Coordinate Mapping Research Articles

Multiscale Coarse-Graining with Effective Polarizabilities: A Fully Bottom-Up Approach.

Coarse-grain (CG) models offer a way to estimate the behavior of larger systems, for longer times than possible in fine-grain calculations by eliminating fine detail. For most atomistic models this often involves eliminating electrostatic interactions, yet, in many calculations, the dielectric properties of a material may be too important to ignore. In this work, we expand upon a previous CG representation which preserves the instantaneous center of mass (CoM), charge, and dipole of clusters of atoms by representing them with charged dimers. We then derive a formal mapping of the microscopic coordinates onto the CG representation allowing for a fully bottom-up construction of the CG force field that statistically matches the CoM, and first two terms of the multipole expansion. In the method presented here, unlike any previous bottom-up mappings, the atomistic particles are fractionally mapped to both sites in the dimer representation. Despite this difference, we show that the corresponding coordinate transformation augmented with a dipole moment mapping can be constructed as a canonical transformation and hence can derive correct ensemble statistics in the associated force mapping. The method is tested on nitromethane at a submolecular resolution, where the nitro group is represented through a charged dimer while the methyl group is a standard CoM projection, next we test a lower resolution of nitromethane where the entire molecule is represented as a single dimer. At the high resolution we showed the method can be mixed with standard CoM projections, and give rise to intramolecular interactions. After nitromethane, we test the method at a supramolecular level using an aggressive scheme of 10 water molecules to one CG dimer. We find in all cases the CoM-CoM radial distribution functions are well matched, and the dipole distributions are matched. For the submolecular nitromethane we find the model is transferable to simulations with external fields, and with the single-dimer nitromethane, we see the dipole-dipole correlation function is matched, but we find the frequency dependent dielectric constant significantly deviates indicating enhanced kinetics as commonly seen in CG molecular dynamics. Lastly, for water we see some discrepancy in the dipole-dipole correlation function that stems from the pairwise decomposition of forces rather than the mapping method presented here.

Extensional maps and approximate inverse limits

In 2012, Žiga Virk introduced the notion of an extensional equivalence, herein called an extensional map, and used it to generalize part of the extension theory factorization theorem of M. Levin, L. Rubin, and P. Schapiro. Here were are going to study this notion in the setting of inverse systems of compact Hausdorff spaces and approximate inverse systems of compact metric spaces. In both cases we will show that given a surjective map f to the limit, if each coordinate map pγ∘f is an extensional map, then so is f.

Location correction technique based on mobile communication base station for earthquake population heat map

China has mobile phone penetration rate of over 96.2%. Mobile phone has become the largest Internet terminal for Chinese Internet users. Population geographic distribution in earthquake zones can be got based on mobile phone positioning and map matching. For reducing earthquake black-box stage, we propose a real-time collection, correction and schedule algorithm of population position data by four stream processing environments (Redis, Hbase, Kafka, and Spark Streaming) in this paper. For labeling precisely population geographic distribution on the network map, matching of population geographic coordinates and map coordinates are optimized by sample comparison based on location data of mobile communication base stations and prefecture level cities. The test result shows the proposed system is high efficient and can rapidly respond to any emerging parallel tasks during the earthquake. A high-precision heat map of affected population can be produced and published on-line within 2 min after the devastating earthquake happened.

Reconstruction Algorithm of Calibration Map for RPT Techniques in Quadrilateral Bubble Column Reactor Using MCNPX Code

Radioactive Particle Tracking (RPT) is non-invasive evaluation technique capable of visualising and tracking the motion of the identified phase in bubble column reactor. The single radioactive particle emits γ-ray, and its movement in the column is tracked with the aid of arrays radiation detectors. In this study, Monte Carlo approach was programmed to reconstruct the particle tracer position so-called calibration map. The iterative reconstruction algorithms is used to generate and calculate the 2600 coordinates of calibration map from the number of photon counts from the ten NaI scintillation detectors. To validate the simulation precision, a spiral trajectory of radioactive particle inside the bubble column region consist of 84 grid point locations of the particle were applied. Calibration algorithm was developed for radioactive isotopes Au-198 and Sc-46 particle position verification and determination of statistical uncertainty from the introduction of a various number of primary photon emission. The result of the studies proved that higher number of particles used in the algorithm for position reconstruction gives more accuracy and we found that the Sc-46 obtain more accurate calculation and shows low statistical level than Au-198 particle. The outcome of this simulation based on random sampling from Monte Carlo N-Particle Extended (MCNPX) demonstrated that the calibration map could successfully be implemented in RPT technique to observe the dynamic movement of radioactive particle which represents the tracked media in the quadrilateral bubble column.

Reconstruction Algorithm of Calibration Map for RPT Techniques in Quadrilateral Bubble Column Reactor Using MCNPX Code

Radioactive Particle Tracking (RPT) is non-invasive evaluation technique capable of visualising and tracking the motion of the identified phase in bubble column reactor. The single radioactive particle emits ?-ray, and its movement in the column is tracked with the aid of arrays radiation detectors. In this study, Monte Carlo approach was programmed to reconstruct the particle tracer position so-called calibration map. The iterative reconstruction algorithms is used to generate and calculate the 2600 coordinates of calibration map from the number of photon counts from the ten NaI scintillation detectors. To validate the simulation precision, a spiral trajectory of radioactive particle inside the bubble column region consist of 84 grid point locations of the particle were applied. Calibration algorithm was developed for radioactive isotopes Au-198 and Sc-46 particle position verification and determination of statistical uncertainty from the introduction of a various number of primary photon emission. The result of the studies proved that higher number of particles used in the algorithm for position reconstruction gives more accuracy and we found that the Sc-46 obtain more accurate calculation and shows low statistical level than Au-198 particle. The outcome of this simulation based on random sampling from Monte Carlo N-Particle Extended (MCNPX) demonstrated that the calibration map could successfully be implemented in RPT technique to observe the dynamic movement of radioactive particle which represents the tracked media in the quadrilateral bubble column.

Fusion of information from multiple Kinect sensors for 3D object reconstruction

In this paper, we estimate the accuracy of 3D object reconstruction using multiple Kinect sensors. First, we discuss the calibration of multiple Kinect sensors, and provide an analysis of the accuracy and resolution of the depth data. Next, the precision of coordinate mapping between sensors data for registration of depth and color images is evaluated. We test a proposed system for 3D object reconstruction with four Kinect V2 sensors and present reconstruction accuracy results. Experiments and computer simulation are carried out using Matlab and Kinect V2.

Designing a Creative Assistant of a Designer

This article describes a model of the future software system, the main task of which is to provide assistance in coloring graphical user interfaces (GUI). The functioning of the system is based on semantic map data. Elements of this semantic map are individual colors and combinations of colors, associated with functional elements of the interface. The map coordinates of each individual color or combination are derived from emotional assessments by human participants. The usage of the map is based on patterns and schemas, typical for popular GUI designs. A system of this sort will be useful as a creative assistant to a human designer in various design projects and in design education.

Using Genetic Algorithm to Solve Travelling Salesman Optimization Problem Based on Google Map Coordinates for Duhok City Areas

This research aims to solve one of the Non-Deterministic Polynomial (NDP) Problems by using one of the artificial intelligence techniques, which is genetic algorithm. Travelling salesman problem (TSP) is one of the difficult optimization problems, the aim of this problem is to get the optimal solution which is represented by the shortest path for (n) visited areas of the city. The number of possible solutions that will be generated, searched and compared when solving this problem for (n) areas is equal to (n!). This number exponentially increased with the increasing of the number of areas. With the large number of areas, which produces a huge number of possible solutions, the traditional search algorithms will be collapsed, and the problem will become a hard (NDP) Problem. In this case it becomes necessary to rely on artificial intelligence techniques, which are based on the biologically-inspired principle. During this research the travelling salesman problem was formulated and programmed in proportion to the concept of genetic algorithm (GA) to produce Travelling Salesman Genetic Algorithm (TSGA). One of the cities of Kurdistan Region of Iraq (Duhok) was selected as a case study to implement the TSGA algorithm. Initially, the study depends on Google earth program to determine the coordinates for number of Duhok’s areas. These coordinates were saved as a (.kml) file format, then the required cleaning and normalization operations were accomplished on this file to produce the pure coordinates, that were stored as an excel file format (.xls) . TSGA algorithm depends on these excel coordinates as an input file to create the initial generation of paths, then the objective function for each path of the this generation was calculated, and then the parent selection, crossover and mutation functions were applied to get the group of the best paths. TSGA algorithm, then, continues to regenerate a number of successive generations, and afterwards recalculate and create the new group of the best paths for each generation to enhance the result. Finally, and depending on the criterion of stopping, this algorithm will cease to create new generations and suggest the final result that represents the shortest path for visited areas. Matlab program was used to implement the TSGA algorithm and to analyze the result. The results of this algorithm were optimum and near optimum for most of the problems at a reasonable time.

Perspective Projection Algorithm Enabling Mobile Device’s Indoor Positioning

In order to improve the user’s satisfaction with the augmented reality (AR) technology and the accuracy of the service, it is important to obtain the exact position of the user. Frequently used techniques for finding outdoors locations is the global positioning system (GPS), which is less accurate indoors. Therefore, an indoor position is measured by comparing the reception level about access point (AP) signal of wireless fidelity (Wi-Fi) or using bluetooth low energy (BLE) tags. However, Wi-Fi and Bluetooth require additional hardware installation. In this paper, the proposed method of estimating the user’s position uses an indoor image and indoor coordinate map without additional hardware installation. The indoor image has several feature points extracted from fixed objects. By matching the feature points with the feature points of the user image, we can obtain the position of the user on the Indoor map by obtaining six or more pixel coordinates from the user image and solving the solution using the perspective projection formula. The experimental results show that the user position can be obtained more accurately in the indoor environment by using only the software without additional hardware installation.

Catadioptric freeform optical system design for LED off-axis road illumination applications.

The aim of this paper is to develop a new composite structure of catadioptric optical system containing both freeform refractive surface and freeform total internal reflective (TIR) surface for LED road illumination applications. The role of freeform refractive part is to generate the shifted general rectangular illumination pattern to optimally match the shape of the road surface. The application of TIR mechanism is aimed to control the stray light in the sidewalk direction of the road luminaire and maximize the efficient energy efficiency. In this paper, we use the "double pole" ray mapping technique to design the refractive optical surface and the θ-φ coordinate ray mapping technique to derive the freeform TIR surface. The simulation shows that the novel catadioptric design has relatively high collection efficiency, thus high average illuminance level inside the effective illumination area. This lens also has good control of stray light on the backside of the road luminaire.

Coordinate Channel-Aware Page Mapping Policy and Memory Scheduling for Reducing Memory Interference Among Multimedia Applications

In a modern multicore system, memory is shared among more and more concurrently running multimedia applications. Therefore, memory contention and interference are more and more serious, inducing system performance degradation significantly, the performance degradation of each thread differently, unfairness in resource sharing, and priority inversion, even starvation. In this paper, we propose an approach of coordinating channel-aware page mapping policy and memory scheduling (CCPS) to reduce intermultimedia application interference in a memory system. The idea is to map the data of different threads to different channels, together with memory scheduling. The key principles of the policies of page mapping and memory scheduling are: 1) the memory address space, the thread priority, and the load balance; and 2) prioritizing a low-memory request thread, a row-buffer hit access, and an older request. We evaluate the CCPS on a variety of mixed single-thread and multithread benchmarks and system configurations, and we compare them with four previously proposed state-of-the-art interference-reducing policies. Experimental results demonstrate that the CCPS improves the performance while reducing the energy consumption significantly; moreover, the CCPS incurs a much lower hardware overhead than the current existing policies.

A multiple watermarking algorithm for vector geographic data based on coordinate mapping and domain subdivision

A lot of watermarking algorithms for vector geographic data are presented in the literature. Due to widely application of digital watermarking, more demands are required, such as multiple watermarking algorithm. However, vector geographic data attracted less research focus on multiple watermarking. Consequently, a multiple watermarking algorithm for vector geographic data is proposed. In particular, the vertices are mapped to the logic domains firstly based on the constructed function. Then every domain is subdivided into blocks according to dichotomy and the number of embedding watermarks. Then, every watermark is embedded in the corresponding block. During the watermark detection, the watermarks are detected without the original vector geographic data. Finally, the experiments are made to test the multiple watermark capacity and robustness against attacks, with an emphasis on cropping attacks. The experimental results show that the proposed algorithm has good robustness against common attacks, such as, data simplification, vertex addition, vertex deletion, feature deletion, and cropping attacks. Moreover, the algorithm provides high multiple watermark capacity.

The Quality of Life of Hospital Inpatients: Exploring visual sphere based on seeing capacity

This paper study the visual sphere based on a visual surface from a patients' point of view in immobile condition. Capturing image and calculating region were used to identify visual sphere as a collected scene, that established a coordinate system, based on visual degrees in seeing capacity. Coordinate system reveals the most effective of series of the scene in a coordinate mapping of the visual sphere. The most effective of series of the scene will identify the maximum level of seeing capacity. These findings provide new evidence to improving interior design for inpatients in the hospital.

Spectral algorithms for multiple scale localized eigenfunctions in infinitely long, slightly bent quantum waveguides

A “bent waveguide” in the sense used here is a small perturbation of a two-dimensional rectangular strip which is infinitely long in the down-channel direction and has a finite, constant width in the cross-channel coordinate. The goal is to calculate the smallest (“ground state”) eigenvalue of the stationary Schrödinger equation which here is a two-dimensional Helmholtz equation, ψxx+ψyy+Eψ=0 where E is the eigenvalue and homogeneous Dirichlet boundary conditions are imposed on the walls of the waveguide. Perturbation theory gives a good description when the “bending strength” parameter ϵ is small as described in our previous article (Amore et al., 2017) and other works cited therein. However, such series are asymptotic, and it is often impractical to calculate more than a handful of terms. It is therefore useful to develop numerical methods for the perturbed strip to cover intermediate ϵ where the perturbation series may be inaccurate and also to check the pertubation expansion when ϵ is small. The perturbation-induced change-in-eigenvalue, δ≡E(ϵ)−E(0), is O(ϵ2). We show that the computation becomes very challenging as ϵ→0 because (i) the ground state eigenfunction varies on both O(1) and O(1∕ϵ) length scales and (ii) high accuracy is needed to compute several correct digits in δ, which is itself small compared to the eigenvalue E. The multiple length scales are not geographically separate, but rather are inextricably commingled in the neighborhood of the boundary deformation. We show that coordinate mapping and immersed boundary strategies both reduce the computational domain to the uniform strip, allowing application of pseudospectral methods on tensor product grids with tensor product basis functions. We compared different basis sets; Chebyshev polynomials are best in the cross-channel direction. However, sine functions generate rather accurate analytical approximations with just a single basis function.In the down-channel coordinate, X∈[−∞,∞], Fourier domain truncation using the change of coordinate X=sinh(Lt) is considerably more efficient than rational Chebyshev functions TBn(X;L). All the spectral methods, however, yielded the required accuracy on a desktop computer.

One loop tadpole in heterotic string field theory

We compute the off-shell 1-loop tadpole amplitude in heterotic string field theory. With a special choice of cubic vertex, we show that this amplitude can be computed exactly. We obtain explicit and elementary expressions for the Feynman graph decomposition of the moduli space, the local coordinate map at the puncture as a function of the modulus, and the b-ghost insertions needed for the integration measure. Recently developed homotopy algebra methods provide a consistent configuration of picture changing operators. We discuss the consequences of spurious poles for the choice of picture changing operators.

A Study on Analytical Methods of FEM-Based Edge Heating System

This paper focuses on analytical methods of a finite-element method (FEM)-based edge heating system. The edge heating system plays a role in maintaining the temperature in the hot rolling process of carbon steel. Carbon steel moves along the production line and maintains the temperature by the edge heating system in the process. Power-of-the-edge heating system is transmitted to carbon steel during the process. Eddy currents are generated in carbon steel by Faraday’s law of electromagnetic induction, and eddy current loss serves as a heat source to increase the temperature. Thus, there is a need for accurate electromagnetic-field analysis and thermal analysis because the eddy current path generated in carbon steel greatly affects the heat distribution in carbon steel. This multiphysics analysis requires high reliability. Accordingly, this paper presents a coupling analysis method using an FEM-based coordinate mapping method as a more accurate analytical method. This paper also established an analytical approach to the edge heating system using the ductility analytical method of this coordinate mapping method.

Linear operator‐based statistical analysis: A useful paradigm for big data

AbstractIn this article we lay out some basic structures, technical machineries, and key applications, of Linear Operator‐Based Statistical Analysis, and organize them toward a unified paradigm. This paradigm can play an important role in analyzing big data due to the nature of linear operators: they process large number of functions in batches. The system accommodates at least four statistical settings: multivariate data analysis, functional data analysis, nonlinear multivariate data analysis via kernel learning, and nonlinear functional data analysis via kernel learning. We develop five linear operators within each statistical setting: the covariance operator, the correlation operator, the conditional covariance operator, the regression operator, and the partial correlation operator, which provide us with a powerful means to study the interconnections between random variables or random functions in a nonparametric and comprehensive way. We present a case study tracing the development of sufficient dimension reduction, and describe in detail how these linear operators play increasingly critical roles in its recent development. We also present a coordinate mapping method which can be systematically applied to implement these operators at the sample level. The Canadian Journal of Statistics 46: 79–103; 2018 © 2017 Statistical Society of Canada

Stereotactically-guided Ablation of the Rat Auditory Cortex, and Localization of the Lesion in the Brain.

The rat auditory cortex (AC) is becoming popular among auditory neuroscience investigators who are interested in experience-dependence plasticity, auditory perceptual processes, and cortical control of sound processing in the subcortical auditory nuclei. To address new challenges, a procedure to accurately locate and surgically expose the auditory cortex would expedite this research effort. Stereotactic neurosurgery is routinely used in pre-clinical research in animal models to engraft a needle or electrode at a pre-defined location within the auditory cortex. In the following protocol, we use stereotactic methods in a novel way. We identify four coordinate points over the surface of the temporal bone of the rat to define a window that, once opened, accurately exposes both the primary (A1) and secondary (Dorsal and Ventral) cortices of the AC. Using this method, we then perform a surgical ablation of the AC. After such a manipulation is performed, it is necessary to assess the localization, size, and extension of the lesions made in the cortex. Thus, we also describe a method to easily locate the AC ablation postmortem using a coordinate map constructed by transferring the cytoarchitectural limits of the AC to the surface of the brain.The combination of the stereotactically-guided location and ablation of the AC with the localization of the injured area in a coordinate map postmortem facilitates the validation of information obtained from the animal, and leads to a better analysis and comprehension of the data.

Stereotactically-guided Ablation of the Rat Auditory Cortex, and Localization of the Lesion in the Brain

The rat auditory cortex (AC) is becoming popular among auditory neuroscience investigators who are interested in experience-dependence plasticity, auditory perceptual processes, and cortical control of sound processing in the subcortical auditory nuclei. To address new challenges, a procedure to accurately locate and surgically expose the auditory cortex would expedite this research effort. Stereotactic neurosurgery is routinely used in pre-clinical research in animal models to engraft a needle or electrode at a pre-defined location within the auditory cortex. In the following protocol, we use stereotactic methods in a novel way. We identify four coordinate points over the surface of the temporal bone of the rat to define a window that, once opened, accurately exposes both the primary (A1) and secondary (Dorsal and Ventral) cortices of the AC. Using this method, we then perform a surgical ablation of the AC. After such a manipulation is performed, it is necessary to assess the localization, size, and extension of the lesions made in the cortex. Thus, we also describe a method to easily locate the AC ablation postmortem using a coordinate map constructed by transferring the cytoarchitectural limits of the AC to the surface of the brain.The combination of the stereotactically-guided location and ablation of the AC with the localization of the injured area in a coordinate map postmortem facilitates the validation of information obtained from the animal, and leads to a better analysis and comprehension of the data.

On an integration rule for products of barycentric coordinates over simplexes in Rn

In finite-element computations, one often needs to calculate integrals of products of powers of monomials over simplexes. In this manuscript, we prove a generalisation of the exact integration formula that was reported and proved for two-dimensional simplexes by Holand & Bell in 1969. We extend the proof to n -dimensional simplexes and to simplexes on d -dimensional manifolds in n -dimensional space. The results are used to develop finite-element and boundary-element simulation tools. The proofs of the theorems are based on mathematical induction and coordinate mappings.