Timed Fast Exact Euclidean Distance (tFEED) maps
Kehtarnavaz, Nasser; Schouten, Theo E.; Laplante, Philip A.; Kuppens, Harco; van den Broek, Egon
2005-01-01
In image and video analysis, distance maps are frequently used. They provide the (Euclidean) distance (ED) of background pixels to the nearest object pixel. In a naive implementation, each object pixel feeds its (exact) ED to each background pixel; then the minimum of these values denotes the ED to
PERBANDINGAN EUCLIDEAN DISTANCE DENGAN CANBERRA DISTANCE PADA FACE RECOGNITION
Directory of Open Access Journals (Sweden)
Sendhy Rachmat Wurdianarto
2014-08-01
Full Text Available Perkembangan ilmu pada dunia komputer sangatlah pesat. Salah satu yang menandai hal ini adalah ilmu komputer telah merambah pada dunia biometrik. Arti biometrik sendiri adalah karakter-karakter manusia yang dapat digunakan untuk membedakan antara orang yang satu dengan yang lainnya. Salah satu pemanfaatan karakter / organ tubuh pada setiap manusia yang digunakan untuk identifikasi (pengenalan adalah dengan memanfaatkan wajah. Dari permasalahan diatas dalam pengenalan lebih tentang aplikasi Matlab pada Face Recognation menggunakan metode Euclidean Distance dan Canberra Distance. Model pengembangan aplikasi yang digunakan adalah model waterfall. Model waterfall beriisi rangkaian aktivitas proses yang disajikan dalam proses analisa kebutuhan, desain menggunakan UML (Unified Modeling Language, inputan objek gambar diproses menggunakan Euclidean Distance dan Canberra Distance. Kesimpulan yang dapat ditarik adalah aplikasi face Recognation menggunakan metode euclidean Distance dan Canverra Distance terdapat kelebihan dan kekurangan masing-masing. Untuk kedepannya aplikasi tersebut dapat dikembangkan dengan menggunakan objek berupa video ataupun objek lainnya. Kata kunci : Euclidean Distance, Face Recognition, Biometrik, Canberra Distance
Fast Exact Euclidean Distance (FEED) Transformation
Schouten, Theo; Kittler, J.; van den Broek, Egon; Petrou, M.; Nixon, M.
2004-01-01
Fast Exact Euclidean Distance (FEED) transformation is introduced, starting from the inverse of the distance transformation. The prohibitive computational cost of a naive implementation of traditional Euclidean Distance Transformation, is tackled by three operations: restriction of both the number
Complex networks in the Euclidean space of communicability distances
Estrada, Ernesto
2012-06-01
We study the properties of complex networks embedded in a Euclidean space of communicability distances. The communicability distance between two nodes is defined as the difference between the weighted sum of walks self-returning to the nodes and the weighted sum of walks going from one node to the other. We give some indications that the communicability distance identifies the least crowded routes in networks where simultaneous submission of packages is taking place. We define an index Q based on communicability and shortest path distances, which allows reinterpreting the “small-world” phenomenon as the region of minimum Q in the Watts-Strogatz model. It also allows the classification and analysis of networks with different efficiency of spatial uses. Consequently, the communicability distance displays unique features for the analysis of complex networks in different scenarios.
The Minimum Distance of Graph Codes
DEFF Research Database (Denmark)
Høholdt, Tom; Justesen, Jørn
2011-01-01
We study codes constructed from graphs where the code symbols are associated with the edges and the symbols connected to a given vertex are restricted to be codewords in a component code. In particular we treat such codes from bipartite expander graphs coming from Euclidean planes and other...... geometries. We give results on the minimum distances of the codes....
Draisma, J.; Horobet, E.; Ottaviani, G.; Sturmfels, B.; Thomas, R.R.; Zhi, L.; Watt, M.
2014-01-01
The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value decomposition. This article develops a theory of such nearest
Steiner tree heuristic in the Euclidean d-space using bottleneck distances
DEFF Research Database (Denmark)
Lorenzen, Stephan Sloth; Winter, Pawel
2016-01-01
Some of the most efficient heuristics for the Euclidean Steiner minimal tree problem in the d-dimensional space, d ≥2, use Delaunay tessellations and minimum spanning trees to determine small subsets of geometrically close terminals. Their low-cost Steiner trees are determined and concatenated...... in a greedy fashion to obtain a low cost tree spanning all terminals. The weakness of this approach is that obtained solutions are topologically related to minimum spanning trees. To avoid this and to obtain even better solutions, bottleneck distances are utilized to determine good subsets of terminals...
MEDOF - MINIMUM EUCLIDEAN DISTANCE OPTIMAL FILTER
Barton, R. S.
1994-01-01
The Minimum Euclidean Distance Optimal Filter program, MEDOF, generates filters for use in optical correlators. The algorithm implemented in MEDOF follows theory put forth by Richard D. Juday of NASA/JSC. This program analytically optimizes filters on arbitrary spatial light modulators such as coupled, binary, full complex, and fractional 2pi phase. MEDOF optimizes these modulators on a number of metrics including: correlation peak intensity at the origin for the centered appearance of the reference image in the input plane, signal to noise ratio including the correlation detector noise as well as the colored additive input noise, peak to correlation energy defined as the fraction of the signal energy passed by the filter that shows up in the correlation spot, and the peak to total energy which is a generalization of PCE that adds the passed colored input noise to the input image's passed energy. The user of MEDOF supplies the functions that describe the following quantities: 1) the reference signal, 2) the realizable complex encodings of both the input and filter SLM, 3) the noise model, possibly colored, as it adds at the reference image and at the correlation detection plane, and 4) the metric to analyze, here taken to be one of the analytical ones like SNR (signal to noise ratio) or PCE (peak to correlation energy) rather than peak to secondary ratio. MEDOF calculates filters for arbitrary modulators and a wide range of metrics as described above. MEDOF examines the statistics of the encoded input image's noise (if SNR or PCE is selected) and the filter SLM's (Spatial Light Modulator) available values. These statistics are used as the basis of a range for searching for the magnitude and phase of k, a pragmatically based complex constant for computing the filter transmittance from the electric field. The filter is produced for the mesh points in those ranges and the value of the metric that results from these points is computed. When the search is concluded, the
Euclidean distance degrees of real algebraic groups
Baaijens, J.A.; Draisma, J.
2015-01-01
We study the problem of finding, in a real algebraic matrix group, the matrix closest to a given data matrix. We do so from the algebro-geometric perspective of Euclidean distance degrees. We recover several classical results; and among the new results that we prove is a formula for the Euclidean
Euclidean distance degrees of real algebraic groups
Baaijens, J.A.; Draisma, J.
2014-01-01
We study the problem of finding, in a real algebraic matrix group, the matrix closest to a given data matrix. We do so from the algebro-geometric perspective of Euclidean distance degrees. We recover several classical results; and among the new results that we prove is a formula for the Euclidean
Three Dimensional Fast Exact Euclidean Distance (3D-FEED) Maps
Latecki, L.J.; Schouten, Theo E.; Mount, D.M.; Kuppens, Harco C.; Wu, A.Y.; van den Broek, Egon
2006-01-01
In image and video analysis, distance maps are frequently used. They provide the (Euclidean) distance (ED) of background pixels to the nearest object pixel. Recently, the Fast Exact Euclidean Distance (FEED) transformation was launched. In this paper, we present the three dimensional (3D) version of
Squared Euclidean distance: a statistical test to evaluate plant community change
Raymond D. Ratliff; Sylvia R. Mori
1993-01-01
The concepts and a procedure for evaluating plant community change using the squared Euclidean distance (SED) resemblance function are described. Analyses are based on the concept that Euclidean distances constitute a sample from a population of distances between sampling units (SUs) for a specific number of times and SUs. With different times, the distances will be...
Fast Exact Euclidean Distance (FEED): A new class of adaptable distance transforms
Schouten, Theo E.; van den Broek, Egon
2014-01-01
A new unique class of foldable distance transforms of digital images (DT) is introduced, baptized: Fast Exact Euclidean Distance (FEED) transforms. FEED class algorithms calculate the DT starting directly from the definition or rather its inverse. The principle of FEED class algorithms is
Fast Exact Euclidean Distance (FEED) : A new class of adaptable distance transforms
Schouten, Theo E.; van den Broek, Egon L.
2014-01-01
A new unique class of foldable distance transforms of digital images (DT) is introduced, baptized: Fast Exact Euclidean Distance (FEED) transforms. FEED class algorithms calculate the DT startingdirectly from the definition or rather its inverse. The principle of FEED class algorithms is introduced,
Euclidean Geometry Codes, minimum weight words and decodable error-patterns using bit-flipping
DEFF Research Database (Denmark)
Høholdt, Tom; Justesen, Jørn; Jonsson, Bergtor
2005-01-01
We determine the number of minimum wigth words in a class of Euclidean Geometry codes and link the performance of the bit-flipping decoding algorithm to the geometry of the error patterns.......We determine the number of minimum wigth words in a class of Euclidean Geometry codes and link the performance of the bit-flipping decoding algorithm to the geometry of the error patterns....
Speckle Suppression by Weighted Euclidean Distance Anisotropic Diffusion
Directory of Open Access Journals (Sweden)
Fengcheng Guo
2018-05-01
Full Text Available To better reduce image speckle noise while also maintaining edge information in synthetic aperture radar (SAR images, we propose a novel anisotropic diffusion algorithm using weighted Euclidean distance (WEDAD. Presented here is a modified speckle reducing anisotropic diffusion (SRAD method, which constructs a new edge detection operator using weighted Euclidean distances. The new edge detection operator can adaptively distinguish between homogenous and heterogeneous image regions, effectively generate anisotropic diffusion coefficients for each image pixel, and filter each pixel at different scales. Additionally, the effects of two different weighting methods (Gaussian weighting and non-linear weighting of de-noising were analyzed. The effect of different adjustment coefficient settings on speckle suppression was also explored. A series of experiments were conducted using an added noise image, GF-3 SAR image, and YG-29 SAR image. The experimental results demonstrate that the proposed method can not only significantly suppress speckle, thus improving the visual effects, but also better preserve the edge information of images.
The Euclidean distance degree of an algebraic variety
Draisma, J.; Horobet, E.; Ottaviani, G.; Sturmfels, B.; Thomas, R.R.
2013-01-01
The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low rank matrices, the Eckart-Young Theorem states that this map is given by the singular value decomposition. This article develops a theory of such nearest
The Euclidean distance degree of an algebraic variety
Draisma, J.; Horobet, E.; Ottaviani, G.; Sturmfels, B.; Thomas, R.R.
The nearest point map of a real algebraic variety with respect to Euclidean distance is an algebraic function. For instance, for varieties of low-rank matrices, the Eckart–Young Theorem states that this map is given by the singular value decomposition. This article develops a theory of such nearest
Optimal Embeddings of Distance Regular Graphs into Euclidean Spaces
F. Vallentin (Frank)
2008-01-01
htmlabstractIn this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular graphs. Our technique involves semidefinite
Change of Measure between Light Travel Time and Euclidean Distances
Directory of Open Access Journals (Sweden)
Heymann Y.
2013-04-01
Full Text Available The problem of cosmological distances is approached using a method based on the propagation of light in an expanding Universe. From the chan ge of measure between Light Travel Time and Euclidean Distances, a formula is deri ved to compute distances as a function of redshift. This formula is identical to Matti g’s formula (with q 0 = 1 / 2 which is based on Friedmann’s equations of general relativi ty.
Directory of Open Access Journals (Sweden)
Lambert Marie-Ève
2012-06-01
Full Text Available Abstract Background Porcine reproductive and respiratory syndrome (PRRS is a viral disease that has a major economic impact for the swine industry. Its control is mostly directed towards preventing its spread which requires a better understanding of the mechanisms of transmission of the virus between herds. The objectives of this study were to describe the genetic diversity and to assess the correlation among genetic, Euclidean and temporal distances and ownership to better understand pathways of transmission. Results A cross-sectional study was conducted on sites located in a high density area of swine production in Quebec. Geographical coordinates (longitude/latitude, date of submission and ownership were obtained for each site. ORF5 sequencing was attempted on PRRSV positive sites. Proportion of pairwise combinations of strains having ≥98% genetic homology were analysed according to Euclidean distances and ownership. Correlations between genetic, Euclidean and temporal distances and ownership were assessed using Mantel tests on continuous and binary matrices. Sensitivity of the correlations between genetic and Euclidean as well as temporal distances was evaluated for different Euclidean and temporal distance thresholds. An ORF5 sequence was identified for 132 of the 176 (75% PRRSV positive sites; 122 were wild-type strains. The mean (min-max genetic, Euclidean and temporal pairwise distances were 11.6% (0–18.7, 15.0 km (0.04-45.7 and 218 days (0–852, respectively. Significant positive correlations were observed between genetic and ownership, genetic and Euclidean and between genetic and temporal binary distances. The relationship between genetic and ownership suggests either common sources of animals or semen, employees, technical services or vehicles, whereas that between genetic and Euclidean binary distances is compatible with area spread of the virus. The latter correlation was observed only up to 5 km. Conclusions This study
Gómez, Daviel; Hernández, L Ázaro; Yabor, Lourdes; Beemster, Gerrit T S; Tebbe, Christoph C; Papenbrock, Jutta; Lorenzo, José Carlos
2018-03-15
Plant scientists usually record several indicators in their abiotic factor experiments. The common statistical management involves univariate analyses. Such analyses generally create a split picture of the effects of experimental treatments since each indicator is addressed independently. The Euclidean distance combined with the information of the control treatment could have potential as an integrating indicator. The Euclidean distance has demonstrated its usefulness in many scientific fields but, as far as we know, it has not yet been employed for plant experimental analyses. To exemplify the use of the Euclidean distance in this field, we performed an experiment focused on the effects of mannitol on sugarcane micropropagation in temporary immersion bioreactors. Five mannitol concentrations were compared: 0, 50, 100, 150 and 200 mM. As dependent variables we recorded shoot multiplication rate, fresh weight, and levels of aldehydes, chlorophylls, carotenoids and phenolics. The statistical protocol which we then carried out integrated all dependent variables to easily identify the mannitol concentration that produced the most remarkable integral effect. Results provided by the Euclidean distance demonstrate a gradually increasing distance from the control in function of increasing mannitol concentrations. 200 mM mannitol caused the most significant alteration of sugarcane biochemistry and physiology under the experimental conditions described here. This treatment showed the longest statistically significant Euclidean distance to the control treatment (2.38). In contrast, 50 and 100 mM mannitol showed the lowest Euclidean distances (0.61 and 0.84, respectively) and thus poor integrated effects of mannitol. The analysis shown here indicates that the use of the Euclidean distance can contribute to establishing a more integrated evaluation of the contrasting mannitol treatments.
Directory of Open Access Journals (Sweden)
Septa Cahyani
2018-04-01
Full Text Available The human ability to recognize a variety of objects, however complex the object, is the special ability that humans possess. Any normal human will have no difficulty in recognizing handwriting objects between an author and another author. With the rapid development of digital technology, the human ability to recognize handwriting objects has been applied in a program known as Computer Vision. This study aims to create identification system different types of handwriting capital letters that have different sizes, thickness, shape, and tilt (distinctive features in handwriting using Linear Discriminant Analysis (LDA and Euclidean Distance methods. LDA is used to obtain characteristic characteristics of the image and provide the distance between the classes becomes larger, while the distance between training data in one class becomes smaller, so that the introduction time of digital image of handwritten capital letter using Euclidean Distance becomes faster computation time (by searching closest distance between training data and data testing. The results of testing the sample data showed that the image resolution of 50x50 pixels is the exact image resolution used for data as much as 1560 handwritten capital letter data compared to image resolution 25x25 pixels and 40x40 pixels. While the test data and training data testing using the method of 10-fold cross validation where 1404 for training data and 156 for data testing showed identification of digital image handwriting capital letter has an average effectiveness of the accuracy rate of 75.39% with the average time computing of 0.4199 seconds.
A linear-time algorithm for Euclidean feature transform sets
Hesselink, Wim H.
2007-01-01
The Euclidean distance transform of a binary image is the function that assigns to every pixel the Euclidean distance to the background. The Euclidean feature transform is the function that assigns to every pixel the set of background pixels with this distance. We present an algorithm to compute the
Durato, M. V.; Albano, A. M.; Rapp, P. E.; Nawang, S. A.
2015-06-01
The validity of ERPs as indices of stable neurophysiological traits is partially dependent on their stability over time. Previous studies on ERP stability, however, have reported diverse stability estimates despite using the same component scoring methods. This present study explores a novel approach in investigating the longitudinal stability of average ERPs—that is, by treating the ERP waveform as a time series and then applying Euclidean Distance and Kolmogorov-Smirnov analyses to evaluate the similarity or dissimilarity between the ERP time series of different sessions or run pairs. Nonlinear dynamical analysis show that in the absence of a change in medical condition, the average ERPs of healthy human adults are highly longitudinally stable—as evaluated by both the Euclidean distance and the Kolmogorov-Smirnov test.
International Nuclear Information System (INIS)
Durato, M V; Nawang, S A; Albano, A M; Rapp, P E
2015-01-01
The validity of ERPs as indices of stable neurophysiological traits is partially dependent on their stability over time. Previous studies on ERP stability, however, have reported diverse stability estimates despite using the same component scoring methods. This present study explores a novel approach in investigating the longitudinal stability of average ERPs—that is, by treating the ERP waveform as a time series and then applying Euclidean Distance and Kolmogorov-Smirnov analyses to evaluate the similarity or dissimilarity between the ERP time series of different sessions or run pairs. Nonlinear dynamical analysis show that in the absence of a change in medical condition, the average ERPs of healthy human adults are highly longitudinally stable—as evaluated by both the Euclidean distance and the Kolmogorov-Smirnov test. (paper)
An adaptive distance measure for use with nonparametric models
International Nuclear Information System (INIS)
Garvey, D. R.; Hines, J. W.
2006-01-01
Distance measures perform a critical task in nonparametric, locally weighted regression. Locally weighted regression (LWR) models are a form of 'lazy learning' which construct a local model 'on the fly' by comparing a query vector to historical, exemplar vectors according to a three step process. First, the distance of the query vector to each of the exemplar vectors is calculated. Next, these distances are passed to a kernel function, which converts the distances to similarities or weights. Finally, the model output or response is calculated by performing locally weighted polynomial regression. To date, traditional distance measures, such as the Euclidean, weighted Euclidean, and L1-norm have been used as the first step in the prediction process. Since these measures do not take into consideration sensor failures and drift, they are inherently ill-suited for application to 'real world' systems. This paper describes one such LWR model, namely auto associative kernel regression (AAKR), and describes a new, Adaptive Euclidean distance measure that can be used to dynamically compensate for faulty sensor inputs. In this new distance measure, the query observations that lie outside of the training range (i.e. outside the minimum and maximum input exemplars) are dropped from the distance calculation. This allows for the distance calculation to be robust to sensor drifts and failures, in addition to providing a method for managing inputs that exceed the training range. In this paper, AAKR models using the standard and Adaptive Euclidean distance are developed and compared for the pressure system of an operating nuclear power plant. It is shown that using the standard Euclidean distance for data with failed inputs, significant errors in the AAKR predictions can result. By using the Adaptive Euclidean distance it is shown that high fidelity predictions are possible, in spite of the input failure. In fact, it is shown that with the Adaptive Euclidean distance prediction
DEFF Research Database (Denmark)
Meng, Weizhi; Li, Wenjuan; Wang, Yu
2017-01-01
and healthcare personnel. The underlying network architecture to support such devices is also referred to as medical smartphone networks (MSNs). Similar to other networks, MSNs also suffer from various attacks like insider attacks (e.g., leakage of sensitive patient information by a malicious insider......). In this work, we focus on MSNs and design a trust-based intrusion detection approach through Euclidean distance-based behavioral profiling to detect malicious devices (or called nodes). In the evaluation, we collaborate with healthcare organizations and implement our approach in a real simulated MSN...
Scaling limits of Euclidean quantum fields
International Nuclear Information System (INIS)
Enss, V.
1981-01-01
The author studies the long-distance and short-distance behaviour of generalized random processes which arise in Euclidean Boson field theories. Among them are Wick-polynomials of free fields and P(PHI) 2 -models. (Auth.)
Directory of Open Access Journals (Sweden)
Yuxian Zhang
2015-01-01
Full Text Available The quality index model in slashing process is difficult to build by reason of the outliers and noise data from original data. To the above problem, a fuzzy neural network based on non-Euclidean distance clustering is proposed in which the input space is partitioned into many local regions by the fuzzy clustering based on non-Euclidean distance so that the computation complexity is decreased, and fuzzy rule number is determined by validity function based on both the separation and the compactness among clusterings. Then, the premise parameters and consequent parameters are trained by hybrid learning algorithm. The parameters identification is realized; meanwhile the convergence condition of consequent parameters is obtained by Lyapunov function. Finally, the proposed method is applied to build the quality index model in slashing process in which the experimental data come from the actual slashing process. The experiment results show that the proposed fuzzy neural network for quality index model has lower computation complexity and faster convergence time, comparing with GP-FNN, BPNN, and RBFNN.
Reduction of product platform complexity by vectorial Euclidean algorithm
International Nuclear Information System (INIS)
Navarrete, Israel Aguilera; Guzman, Alejandro A. Lozano
2013-01-01
In traditional machine, equipment and devices design, technical solutions are practically independent, thus increasing designs cost and complexity. Overcoming this situation has been tackled just using designer's experience. In this work, a product platform complexity reduction is presented based on a matrix representation of technical solutions versus product properties. This matrix represents the product platform. From this matrix, the Euclidean distances among technical solutions are obtained. Thus, the vectorial distances among technical solutions are identified in a new matrix of order of the number of technical solutions identified. This new matrix can be reorganized in groups with a hierarchical structure, in such a way that modular design of products is now more tractable. As a result of this procedure, the minimum vector distances are found thus being possible to identify the best technical solutions for the design problem raised. Application of these concepts is shown with two examples.
Euclidean Primes Have the Minimum Number of Primitive Roots
Czech Academy of Sciences Publication Activity Database
Křížek, Michal; Somer, L.
2008-01-01
Roč. 12, č. 1 (2008), s. 121-127 ISSN 0972-5555 R&D Projects: GA AV ČR(CZ) IAA100190803 Institutional research plan: CEZ:AV0Z10190503 Keywords : Euclidean primes * Fermat primes * Sophie Germain primes Subject RIV: BA - General Mathematics
Construction of Protograph LDPC Codes with Linear Minimum Distance
Divsalar, Dariush; Dolinar, Sam; Jones, Christopher
2006-01-01
A construction method for protograph-based LDPC codes that simultaneously achieve low iterative decoding threshold and linear minimum distance is proposed. We start with a high-rate protograph LDPC code with variable node degrees of at least 3. Lower rate codes are obtained by splitting check nodes and connecting them by degree-2 nodes. This guarantees the linear minimum distance property for the lower-rate codes. Excluding checks connected to degree-1 nodes, we show that the number of degree-2 nodes should be at most one less than the number of checks for the protograph LDPC code to have linear minimum distance. Iterative decoding thresholds are obtained by using the reciprocal channel approximation. Thresholds are lowered by using either precoding or at least one very high-degree node in the base protograph. A family of high- to low-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented. FPGA simulation results for a few example codes show that the proposed codes perform as predicted.
Learning Euclidean Embeddings for Indexing and Classification
National Research Council Canada - National Science Library
Athitsos, Vassilis; Alon, Joni; Sclaroff, Stan; Kollios, George
2004-01-01
BoostMap is a recently proposed method for efficient approximate nearest neighbor retrieval in arbitrary non-Euclidean spaces with computationally expensive and possibly non-metric distance measures...
Efficient gamma index calculation using fast Euclidean distance transform
Energy Technology Data Exchange (ETDEWEB)
Chen Mingli; Lu Weiguo; Chen Quan; Ruchala, Kenneth; Olivera, Gustavo [TomoTherapy Inc., 1240 Deming Way, Madison, WI 53717 (United States)], E-mail: wlu@tomotherapy.com
2009-04-07
The gamma index is a tool for dose distribution comparison. It combines both dose difference (DD) and distance to agreement (DTA) into a single quantity. Though it is an effective measure, making up for the inadequacy of DD or DTA alone, its calculation can be very time-consuming. For a k-D space with N quantization levels in each dimension, the complexity of the exhaustive search is O(N{sup 2k}). In this work, we proposed an efficient method that reduces the complexity from O(N{sup 2k}) to O(N{sup k}M), where M is the number of discretized dose values and is comparable to N. More precisely, by embedding the reference dose distribution in a (k+1)-D spatial-dose space, we can use fast Euclidean distance transform with linear complexity to obtain a table of gamma indices evaluated over a range of the (k+1)-D spatial-dose space. Then, to obtain gamma indices for the test dose distribution, it requires only table lookup with complexity O(N{sup k}). Such a table can also be used for other test dose distributions as long as the reference dose distribution is the same. Simulations demonstrated the efficiency of our proposed method. The speedup for 3D gamma index calculation is expected to be on the order of tens of thousands (from O(N{sup 6}) to O(N{sup 3}M)) if N is a few hundreds, which makes clinical usage of the 3D gamma index feasible. A byproduct of the gamma index table is that the gradient of the gamma index with respect to either the spatial or dose dimension can be easily derived. The gradient can be used to identify the main causes of the discrepancy from the reference distribution at any dose point in the test distribution or incorporated in treatment planning and machine parameter optimization.
International Nuclear Information System (INIS)
Achmad Suntoro
2014-01-01
A design to determine the minimum distance between the consecutive carriers at the trajectory of gamma irradiators IR-200K is implemented. Equilibrium between centrifugal force of a moving carrier in circular trajectory and its gravity force as well as carrier dimensions are used as parameters in determining such a minimum distance. The minimum distance between the consecutive carriers in the design is defined 1.2 meters. The distance is 11.5% greater than the minimum distance theoretically calculated, namely 1,076 meters. Errors tolerance in construction/installation of the trajectory and other unexpected things during irradiator's operation are part of the consideration to enlarge the minimum distance from its theoretical value. The distance between the consecutive carriers will not affect throughput and efficiency of using radiation due to the straight trajectory segments do not need to follow such the minimum distance between the carriers, as the trajectory segments around the i radiation sources are straight. (author)
LDPC Codes with Minimum Distance Proportional to Block Size
Divsalar, Dariush; Jones, Christopher; Dolinar, Samuel; Thorpe, Jeremy
2009-01-01
Low-density parity-check (LDPC) codes characterized by minimum Hamming distances proportional to block sizes have been demonstrated. Like the codes mentioned in the immediately preceding article, the present codes are error-correcting codes suitable for use in a variety of wireless data-communication systems that include noisy channels. The previously mentioned codes have low decoding thresholds and reasonably low error floors. However, the minimum Hamming distances of those codes do not grow linearly with code-block sizes. Codes that have this minimum-distance property exhibit very low error floors. Examples of such codes include regular LDPC codes with variable degrees of at least 3. Unfortunately, the decoding thresholds of regular LDPC codes are high. Hence, there is a need for LDPC codes characterized by both low decoding thresholds and, in order to obtain acceptably low error floors, minimum Hamming distances that are proportional to code-block sizes. The present codes were developed to satisfy this need. The minimum Hamming distances of the present codes have been shown, through consideration of ensemble-average weight enumerators, to be proportional to code block sizes. As in the cases of irregular ensembles, the properties of these codes are sensitive to the proportion of degree-2 variable nodes. A code having too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code having too many such nodes tends not to exhibit a minimum distance that is proportional to block size. Results of computational simulations have shown that the decoding thresholds of codes of the present type are lower than those of regular LDPC codes. Included in the simulations were a few examples from a family of codes characterized by rates ranging from low to high and by thresholds that adhere closely to their respective channel capacity thresholds; the simulation results from these examples showed that the codes in question have low
Hubble expansion in a Euclidean framework
International Nuclear Information System (INIS)
Alfven, H.
1979-01-01
There now seems to be strong evidence for a non-cosmological interpretation of the QSO redshift - in any case, so strong that it is of interest to investigate the consequences. The purpose of this paper is to construct a model of the Hubble expansion which is as far as possible from the conventional Big Bang model without coming in conflict with any well-established observational results (while introducing no new laws of physics). This leads to an essentially Euclidean metagalactic model (see Table I) with very little mass outside one-third or half of the Hubble radius. The total kinetic energy of the Hubble expansion need only to be about 5% of the rest mass energy. Present observations support backwards in time extrapolation of the Hubble expansion to a 'minimum size galaxy' Rsub(m), which may have any value in 0 26 cm. Other arguments speak in favor of a size close to the upper value, say Rsub(m) = 10 26 cm (Table II). As this size is probably about 100 times the Schwarzschild limit, an essentially Euclidean description is allowed. The kinetic energy of the Hubble expansion may derive from an intense QSO-like activity in the minimum size metagalaxy, with an energy release corresponding to the annihilation of a few solar masses per galaxy per year. Some of the conclusions based on the Big Bang hypothesis are criticized and in several cases alternative interpretations are suggested. A comparison between the Euclidean and the conventional models is given in Table III. (orig.)
The positive action conjecture and asymptotically euclidean metrics in quantum gravity
International Nuclear Information System (INIS)
Gibbons, G.W.; Pope, C.N.
1979-01-01
The positive action conjecture requires that the action of any asymptotically Euclidean 4-dimensional Riemannian metric be positive, vanishing if and only if the space is flat. Because any Ricci flat, asymptotically Euclidean metric has zero action and is local extremum of the action which is a local minimum at flat space, the conjecture requires that there are no Ricci flat asymptotically Euclidean metrics other than flat space, which would establish that flat space is the only local minimum. We prove this for metrics on R 4 and a large class of more complicated topologies and for self-dual metrics. We show that if Rsupμsubμ >= 0 there are no bound states of the Dirac equation and discuss the relevance to possible baryon non-conserving processes mediated by gravitational instantons. We conclude that these are forbidden in the lowest stationary phase approximation. We give a detailed discussion of instantons invariant under an SU(2) or SO(3) isometry group. We find all regular solutions, none of which is asymptotically Euclidean and all of which possess a further Killing vector. In an appendix we construct an approximate self-dual metric on K3 - the only simply connected compact manifold which admits a self-dual metric. (orig.) [de
Assessment of the Log-Euclidean Metric Performance in Diffusion Tensor Image Segmentation
Directory of Open Access Journals (Sweden)
Mostafa Charmi
2010-06-01
Full Text Available Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this paper is to assess the possible substitution of the geodesic metric with the Log-Euclidean one to reduce the computational cost of a statistical surface evolution algorithm. Materials and Methods: We incorporated the Log-Euclidean metric in the statistical surface evolution algorithm framework. To achieve this goal, the statistics and gradients of diffusion tensor images were defined using the Log-Euclidean metric. Numerical implementation of the segmentation algorithm was performed in the MATLAB software using the finite difference techniques. Results: In the statistical surface evolution framework, the Log-Euclidean metric was able to discriminate the torus and helix patterns in synthesis datasets and rat spinal cords in biological phantom datasets from the background better than the Euclidean and J-divergence metrics. In addition, similar results were obtained with the geodesic metric. However, the main advantage of the Log-Euclidean metric over the geodesic metric was the dramatic reduction of computational cost of the segmentation algorithm, at least by 70 times. Discussion and Conclusion: The qualitative and quantitative results have shown that the Log-Euclidean metric is a good substitute for the geodesic metric when using a statistical surface evolution algorithm in DTIs segmentation.
Uniform Page Migration Problem in Euclidean Space
Directory of Open Access Journals (Sweden)
Amanj Khorramian
2016-08-01
Full Text Available The page migration problem in Euclidean space is revisited. In this problem, online requests occur at any location to access a single page located at a server. Every request must be served, and the server has the choice to migrate from its current location to a new location in space. Each service costs the Euclidean distance between the server and request. A migration costs the distance between the former and the new server location, multiplied by the page size. We study the problem in the uniform model, in which the page has size D = 1 . All request locations are not known in advance; however, they are sequentially presented in an online fashion. We design a 2.75 -competitive online algorithm that improves the current best upper bound for the problem with the unit page size. We also provide a lower bound of 2.732 for our algorithm. It was already known that 2.5 is a lower bound for this problem.
Modelling non-Euclidean movement and landscape connectivity in highly structured ecological networks
Sutherland, Christopher; Fuller, Angela K.; Royle, J. Andrew
2015-01-01
Movement is influenced by landscape structure, configuration and geometry, but measuring distance as perceived by animals poses technical and logistical challenges. Instead, movement is typically measured using Euclidean distance, irrespective of location or landscape structure, or is based on arbitrary cost surfaces. A recently proposed extension of spatial capture-recapture (SCR) models resolves this issue using spatial encounter histories of individuals to calculate least-cost paths (ecological distance: Ecology, 94, 2013, 287) thereby relaxing the Euclidean assumption. We evaluate the consequences of not accounting for movement heterogeneity when estimating abundance in highly structured landscapes, and demonstrate the value of this approach for estimating biologically realistic space-use patterns and landscape connectivity.
Improvement in quality testing of Braille printer output with Euclidean ...
African Journals Online (AJOL)
This paper focuses on quality testing of Braille printed paper using calibrated camera by detecting dots and measuring the Euclidean distances between them with equal gap, vertically and horizontally. For higher accuracy, camera calibration is essential to observe a planar checker board pattern from different distances and ...
Euclidean distance geometry an introduction
Liberti, Leo
2017-01-01
This textbook, the first of its kind, presents the fundamentals of distance geometry: theory, useful methodologies for obtaining solutions, and real world applications. Concise proofs are given and step-by-step algorithms for solving fundamental problems efficiently and precisely are presented in Mathematica®, enabling the reader to experiment with concepts and methods as they are introduced. Descriptive graphics, examples, and problems, accompany the real gems of the text, namely the applications in visualization of graphs, localization of sensor networks, protein conformation from distance data, clock synchronization protocols, robotics, and control of unmanned underwater vehicles, to name several. Aimed at intermediate undergraduates, beginning graduate students, researchers, and practitioners, the reader with a basic knowledge of linear algebra will gain an understanding of the basic theories of distance geometry and why they work in real life.
Large parallel volumes of finite and compact sets in d-dimensional Euclidean space
DEFF Research Database (Denmark)
Kampf, Jürgen; Kiderlen, Markus
The r-parallel volume V (Cr) of a compact subset C in d-dimensional Euclidean space is the volume of the set Cr of all points of Euclidean distance at most r > 0 from C. According to Steiner’s formula, V (Cr) is a polynomial in r when C is convex. For finite sets C satisfying a certain geometric...
Lower bounds for the minimum distance of algebraic geometry codes
DEFF Research Database (Denmark)
Beelen, Peter
, such as the Goppa bound, the Feng-Rao bound and the Kirfel-Pellikaan bound. I will finish my talk by giving several examples. Especially for two-point codes, the generalized order bound is fairly easy to compute. As an illustration, I will indicate how a lower bound can be obtained for the minimum distance of some...... description of these codes in terms of order domains has been found. In my talk I will indicate how one can use the ideas behind the order bound to obtain a lower bound for the minimum distance of any AG-code. After this I will compare this generalized order bound with other known lower bounds...
Metrics for measuring distances in configuration spaces
International Nuclear Information System (INIS)
Sadeghi, Ali; Ghasemi, S. Alireza; Schaefer, Bastian; Mohr, Stephan; Goedecker, Stefan; Lill, Markus A.
2013-01-01
In order to characterize molecular structures we introduce configurational fingerprint vectors which are counterparts of quantities used experimentally to identify structures. The Euclidean distance between the configurational fingerprint vectors satisfies the properties of a metric and can therefore safely be used to measure dissimilarities between configurations in the high dimensional configuration space. In particular we show that these metrics are a perfect and computationally cheap replacement for the root-mean-square distance (RMSD) when one has to decide whether two noise contaminated configurations are identical or not. We introduce a Monte Carlo approach to obtain the global minimum of the RMSD between configurations, which is obtained from a global minimization over all translations, rotations, and permutations of atomic indices
Decoding Reed-Solomon Codes beyond half the minimum distance
DEFF Research Database (Denmark)
Høholdt, Tom; Nielsen, Rasmus Refslund
1999-01-01
We describe an efficient implementation of M.Sudan"s algorithm for decoding Reed-Solomon codes beyond half the minimum distance. Furthermore we calculate an upper bound of the probabilty of getting more than one codeword as output...
Minimum Distance Estimation on Time Series Analysis With Little Data
National Research Council Canada - National Science Library
Tekin, Hakan
2001-01-01
.... Minimum distance estimation has been demonstrated better standard approaches, including maximum likelihood estimators and least squares, in estimating statistical distribution parameters with very small data sets...
Products of Snowflaked Euclidean Lines Are Not Minimal for Looking Down
Directory of Open Access Journals (Sweden)
Joseph Matthieu
2017-11-01
Full Text Available We show that products of snowflaked Euclidean lines are not minimal for looking down. This question was raised in Fractured fractals and broken dreams, Problem 11.17, by David and Semmes. The proof uses arguments developed by Le Donne, Li and Rajala to prove that the Heisenberg group is not minimal for looking down. By a method of shortcuts, we define a new distance d such that the product of snowflaked Euclidean lines looks down on (RN , d, but not vice versa.
Statistical 2D and 3D shape analysis using Non-Euclidean Metrics
DEFF Research Database (Denmark)
Larsen, Rasmus; Hilger, Klaus Baggesen; Wrobel, Mark Christoph
2002-01-01
We address the problem of extracting meaningful, uncorrelated biological modes of variation from tangent space shape coordinates in 2D and 3D using non-Euclidean metrics. We adapt the maximum autocorrelation factor analysis and the minimum noise fraction transform to shape decomposition. Furtherm......We address the problem of extracting meaningful, uncorrelated biological modes of variation from tangent space shape coordinates in 2D and 3D using non-Euclidean metrics. We adapt the maximum autocorrelation factor analysis and the minimum noise fraction transform to shape decomposition....... Furthermore, we study metrics based on repated annotations of a training set. We define a way of assessing the correlation between landmarks contrary to landmark coordinates. Finally, we apply the proposed methods to a 2D data set consisting of outlines of lungs and a 3D/(4D) data set consisting of sets...
47 CFR 73.807 - Minimum distance separation between stations.
2010-10-01
... and the right-hand column lists (for informational purposes only) the minimum distance necessary for...) Within 320 km of the Mexican border, LP100 stations must meet the following separations with respect to any Mexican stations: Mexican station class Co-channel (km) First-adjacent channel (km) Second-third...
Asymptotic analysis of fundamental solutions of Dirac operators on even dimensional Euclidean spaces
International Nuclear Information System (INIS)
Arai, A.
1985-01-01
We analyze the short distance asymptotic behavior of some quantities formed out of fundamental solutions of Dirac operators on even dimensional Euclidean spaces with finite dimensional matrix-valued potentials. (orig.)
Multivariate Welch t-test on distances
Alekseyenko, Alexander V.
2016-01-01
Motivation: Permutational non-Euclidean analysis of variance, PERMANOVA, is routinely used in exploratory analysis of multivariate datasets to draw conclusions about the significance of patterns visualized through dimension reduction. This method recognizes that pairwise distance matrix between observations is sufficient to compute within and between group sums of squares necessary to form the (pseudo) F statistic. Moreover, not only Euclidean, but arbitrary distances can be used. This method...
Phylogenetic trees and Euclidean embeddings.
Layer, Mark; Rhodes, John A
2017-01-01
It was recently observed by de Vienne et al. (Syst Biol 60(6):826-832, 2011) that a simple square root transformation of distances between taxa on a phylogenetic tree allowed for an embedding of the taxa into Euclidean space. While the justification for this was based on a diffusion model of continuous character evolution along the tree, here we give a direct and elementary explanation for it that provides substantial additional insight. We use this embedding to reinterpret the differences between the NJ and BIONJ tree building algorithms, providing one illustration of how this embedding reflects tree structures in data.
de Wit, Bernard; Reys, Valentin
2017-12-01
Supergravity with eight supercharges in a four-dimensional Euclidean space is constructed at the full non-linear level by performing an off-shell time-like reduction of five-dimensional supergravity. The resulting four-dimensional theory is realized off-shell with the Weyl, vector and tensor supermultiplets and a corresponding multiplet calculus. Hypermultiplets are included as well, but they are themselves only realized with on-shell supersymmetry. We also briefly discuss the non-linear supermultiplet. The off-shell reduction leads to a full understanding of the Euclidean theory. A complete multiplet calculus is presented along the lines of the Minkowskian theory. Unlike in Minkowski space, chiral and anti-chiral multiplets are real and supersymmetric actions are generally unbounded from below. Precisely as in the Minkowski case, where one has different formulations of Poincaré supergravity upon introducing different compensating supermultiplets, one can also obtain different versions of Euclidean supergravity.
Faster exact algorithms for computing Steiner trees in higher dimensional Euclidean spaces
DEFF Research Database (Denmark)
Fonseca, Rasmus; Brazil, Marcus; Winter, Pawel
The Euclidean Steiner tree problem asks for a network of minimum total length interconnecting a finite set of points in d-dimensional space. For d ≥ 3, only one practical algorithmic approach exists for this problem --- proposed by Smith in 1992. A number of refinements of Smith's algorithm have...
Clustering by Partitioning around Medoids using Distance-Based ...
African Journals Online (AJOL)
OLUWASOGO
outperforms both the Euclidean and Manhattan distance metrics in certain situations. KEYWORDS: PAM ... version of a dataset, compare the quality of clusters obtained from the Euclidean .... B. Theoretical Framework and Methodology.
TOPSIS with statistical distances: A new approach to MADM
Directory of Open Access Journals (Sweden)
Vijaya Babu Vommi
2017-01-01
Full Text Available Multiple attribute decision making (MADM methods are very useful in choosing the best alternative among the available finite but conflicting alternatives. TOPSIS is one of the MADM methods, which is simple in its methodology and logic. In TOPSIS, Euclidean distances of each alternative from the positive and negative ideal solutions are utilized to find the best alternative. In literature, apart from Euclidean distances, the city block distances have also been tried to find the separations measures. In general, the attribute data are distributed with unequal ranges and also possess moderate to high correlations. Hence, in the present paper, use of statistical distances is proposed in place of Euclidean distances. Procedures to find the best alternatives are developed using statistical and weighted statistical distances respectively. The proposed methods are illustrated with some industrial problems taken from literature. Results show that the proposed methods can be used as new alternatives in MADM for choosing the best solutions.
Directory of Open Access Journals (Sweden)
Q. Zhou
2017-07-01
Full Text Available Visual Odometry (VO is a critical component for planetary robot navigation and safety. It estimates the ego-motion using stereo images frame by frame. Feature points extraction and matching is one of the key steps for robotic motion estimation which largely influences the precision and robustness. In this work, we choose the Oriented FAST and Rotated BRIEF (ORB features by considering both accuracy and speed issues. For more robustness in challenging environment e.g., rough terrain or planetary surface, this paper presents a robust outliers elimination method based on Euclidean Distance Constraint (EDC and Random Sample Consensus (RANSAC algorithm. In the matching process, a set of ORB feature points are extracted from the current left and right synchronous images and the Brute Force (BF matcher is used to find the correspondences between the two images for the Space Intersection. Then the EDC and RANSAC algorithms are carried out to eliminate mismatches whose distances are beyond a predefined threshold. Similarly, when the left image of the next time matches the feature points with the current left images, the EDC and RANSAC are iteratively performed. After the above mentioned, there are exceptional remaining mismatched points in some cases, for which the third time RANSAC is applied to eliminate the effects of those outliers in the estimation of the ego-motion parameters (Interior Orientation and Exterior Orientation. The proposed approach has been tested on a real-world vehicle dataset and the result benefits from its high robustness.
Protograph based LDPC codes with minimum distance linearly growing with block size
Divsalar, Dariush; Jones, Christopher; Dolinar, Sam; Thorpe, Jeremy
2005-01-01
We propose several LDPC code constructions that simultaneously achieve good threshold and error floor performance. Minimum distance is shown to grow linearly with block size (similar to regular codes of variable degree at least 3) by considering ensemble average weight enumerators. Our constructions are based on projected graph, or protograph, structures that support high-speed decoder implementations. As with irregular ensembles, our constructions are sensitive to the proportion of degree-2 variable nodes. A code with too few such nodes tends to have an iterative decoding threshold that is far from the capacity threshold. A code with too many such nodes tends to not exhibit a minimum distance that grows linearly in block length. In this paper we also show that precoding can be used to lower the threshold of regular LDPC codes. The decoding thresholds of the proposed codes, which have linearly increasing minimum distance in block size, outperform that of regular LDPC codes. Furthermore, a family of low to high rate codes, with thresholds that adhere closely to their respective channel capacity thresholds, is presented. Simulation results for a few example codes show that the proposed codes have low error floors as well as good threshold SNFt performance.
Texture classification using non-Euclidean Minkowski dilation
Florindo, Joao B.; Bruno, Odemir M.
2018-03-01
This study presents a new method to extract meaningful descriptors of gray-scale texture images using Minkowski morphological dilation based on the Lp metric. The proposed approach is motivated by the success previously achieved by Bouligand-Minkowski fractal descriptors on texture classification. In essence, such descriptors are directly derived from the morphological dilation of a three-dimensional representation of the gray-level pixels using the classical Euclidean metric. In this way, we generalize the dilation for different values of p in the Lp metric (Euclidean is a particular case when p = 2) and obtain the descriptors from the cumulated distribution of the distance transform computed over the texture image. The proposed method is compared to other state-of-the-art approaches (such as local binary patterns and textons for example) in the classification of two benchmark data sets (UIUC and Outex). The proposed descriptors outperformed all the other approaches in terms of rate of images correctly classified. The interesting results suggest the potential of these descriptors in this type of task, with a wide range of possible applications to real-world problems.
Non-euclidean simplex optimization
International Nuclear Information System (INIS)
Silver, G.L.
1977-01-01
Geometric optimization techniques useful for studying chemical equilibrium traditionally rely upon principles of euclidean geometry, but such algorithms may also be based upon principles of a non-euclidean geometry. The sequential simplex method is adapted to the hyperbolic plane, and application of optimization to problems such as the potentiometric titration of plutonium is suggested
Spacetime and Euclidean geometry
Brill, Dieter; Jacobson, Ted
2006-04-01
Using only the principle of relativity and Euclidean geometry we show in this pedagogical article that the square of proper time or length in a two-dimensional spacetime diagram is proportional to the Euclidean area of the corresponding causal domain. We use this relation to derive the Minkowski line element by two geometric proofs of the spacetime Pythagoras theorem.
Shape anisotropy: tensor distance to anisotropy measure
Weldeselassie, Yonas T.; El-Hilo, Saba; Atkins, M. S.
2011-03-01
Fractional anisotropy, defined as the distance of a diffusion tensor from its closest isotropic tensor, has been extensively studied as quantitative anisotropy measure for diffusion tensor magnetic resonance images (DT-MRI). It has been used to reveal the white matter profile of brain images, as guiding feature for seeding and stopping in fiber tractography and for the diagnosis and assessment of degenerative brain diseases. Despite its extensive use in DT-MRI community, however, not much attention has been given to the mathematical correctness of its derivation from diffusion tensors which is achieved using Euclidean dot product in 9D space. But, recent progress in DT-MRI has shown that the space of diffusion tensors does not form a Euclidean vector space and thus Euclidean dot product is not appropriate for tensors. In this paper, we propose a novel and robust rotationally invariant diffusion anisotropy measure derived using the recently proposed Log-Euclidean and J-divergence tensor distance measures. An interesting finding of our work is that given a diffusion tensor, its closest isotropic tensor is different for different tensor distance metrics used. We demonstrate qualitatively that our new anisotropy measure reveals superior white matter profile of DT-MR brain images and analytically show that it has a higher signal to noise ratio than fractional anisotropy.
A linear time algorithm for minimum fill-in and treewidth for distance heredity graphs
Broersma, Haitze J.; Dahlhaus, E.; Kloks, A.J.J.; Kloks, T.
2000-01-01
A graph is distance hereditary if it preserves distances in all its connected induced subgraphs. The MINIMUM FILL-IN problem is the problem of finding a chordal supergraph with the smallest possible number of edges. The TREEWIDTH problem is the problem of finding a chordal embedding of the graph
Extended supersymmetry in four-dimensional Euclidean space
International Nuclear Information System (INIS)
McKeon, D.G.C.; Sherry, T.N.
2000-01-01
Since the generators of the two SU(2) groups which comprise SO(4) are not Hermitian conjugates of each other, the simplest supersymmetry algebra in four-dimensional Euclidean space more closely resembles the N=2 than the N=1 supersymmetry algebra in four-dimensional Minkowski space. An extended supersymmetry algebra in four-dimensional Euclidean space is considered in this paper; its structure resembles that of N=4 supersymmetry in four-dimensional Minkowski space. The relationship of this algebra to the algebra found by dimensionally reducing the N=1 supersymmetry algebra in ten-dimensional Euclidean space to four-dimensional Euclidean space is examined. The dimensional reduction of N=1 super Yang-Mills theory in ten-dimensional Minkowski space to four-dimensional Euclidean space is also considered
Measuring the Accuracy of Simple Evolving Connectionist System with Varying Distance Formulas
Al-Khowarizmi; Sitompul, O. S.; Suherman; Nababan, E. B.
2017-12-01
Simple Evolving Connectionist System (SECoS) is a minimal implementation of Evolving Connectionist Systems (ECoS) in artificial neural networks. The three-layer network architecture of the SECoS could be built based on the given input. In this study, the activation value for the SECoS learning process, which is commonly calculated using normalized Hamming distance, is also calculated using normalized Manhattan distance and normalized Euclidean distance in order to compare the smallest error value and best learning rate obtained. The accuracy of measurement resulted by the three distance formulas are calculated using mean absolute percentage error. In the training phase with several parameters, such as sensitivity threshold, error threshold, first learning rate, and second learning rate, it was found that normalized Euclidean distance is more accurate than both normalized Hamming distance and normalized Manhattan distance. In the case of beta fibrinogen gene -455 G/A polymorphism patients used as training data, the highest mean absolute percentage error value is obtained with normalized Manhattan distance compared to normalized Euclidean distance and normalized Hamming distance. However, the differences are very small that it can be concluded that the three distance formulas used in SECoS do not have a significant effect on the accuracy of the training results.
Ideas of space. Euclidean, non-Euclidean and relativistic
Energy Technology Data Exchange (ETDEWEB)
Gray, J
1979-01-01
An historical and chronological account of mathematics is presented in which familiarity with simple equations and elements of trigonometry is needed but no specialist knowledge is assumed although difficult problems are discussed. By discussion of the difficulties and confusions it is hoped to understand mathematics as a dynamic activity. Beginning with early Greek mathematics, the Eastern legacy and the transition to deductive and geometric thinking the problem of parallels is then encountered and discussed. The second part of the book takes the story from Wallis, Saccheri and Lambert through to its resolution by Gauss, Lobachevskii, Bolyai, Riemann and Bettrami. The background of the 19th century theory of surfaces is given. The third part gives an account of Einstein's theories based on what has gone before, moving from a Newtonian-Euclidean picture to an Einsteinian-nonEuclidean one. A brief account of gravitation, the nature of space and black holes concludes the book.
A heuristic derivation of Minkowski distance and Lorentz transformation
International Nuclear Information System (INIS)
Hassani, Sadri
2008-01-01
Students learn new abstract concepts best when these concepts are connected through a well-designed analogy, to familiar ideas. Since the concept of the relativistic spacetime distance is highly abstract, it would be desirable to connect it to the familiar Euclidean distance, but present the latter in such a way that it makes a transparent contact with the former. Starting with some intuitive and 'obvious' assumptions concerning distance in one dimension, we 'derive' the two-dimensional Euclidean distance between two points in terms of their coordinates. Then, assuming the invariance of this distance, we deduce the (familiar) two-dimensional orthogonal coordinate transformation. We present the derivation in such a way that the transition to spacetime becomes 'self-evident.' Thus, following exactly the same procedure, we derive the Minkowskian distance and the corresponding transformation that respects the invariance of that distance, i.e., the Lorentz transformation
On the sizes of expander graphs and minimum distances of graph codes
DEFF Research Database (Denmark)
Høholdt, Tom; Justesen, Jørn
2014-01-01
We give lower bounds for the minimum distances of graph codes based on expander graphs. The bounds depend only on the second eigenvalue of the graph and the parameters of the component codes. We also give an upper bound on the size of a degree regular graph with given second eigenvalue....
International Nuclear Information System (INIS)
Saveliev, M.V.
1983-01-01
In the framework of the algebraic approach a construction of exactly integrable two-dimensional Riemannian manifolds embedded into enveloping Euclidean (pseudo-Euclidean) space Rsub(N) of an arbitrary dimension is presented. The construction is based on a reformulation of the Gauss, Peterson-Codazzi and Ricci equations in the form of a Lax-type representation in two-dimensional space. Here the Lax pair operators take the values in algebra SO(N)
Principle of minimum distance in space of states as new principle in quantum physics
International Nuclear Information System (INIS)
Ion, D. B.; Ion, M. L. D.
2007-01-01
The mathematician Leonhard Euler (1707-1783) appears to have been a philosophical optimist having written: 'Since the fabric of universe is the most perfect and is the work of the most wise Creator, nothing whatsoever take place in this universe in which some relation of maximum or minimum does not appear. Wherefore, there is absolutely no doubt that every effect in universe can be explained as satisfactory from final causes themselves the aid of the method of Maxima and Minima, as can from the effective causes'. Having in mind this kind of optimism in the papers mentioned in this work we introduced and investigated the possibility to construct a predictive analytic theory of the elementary particle interaction based on the principle of minimum distance in the space of quantum states (PMD-SQS). So, choosing the partial transition amplitudes as the system variational variables and the distance in the space of the quantum states as a measure of the system effectiveness, we obtained the results presented in this paper. These results proved that the principle of minimum distance in space of quantum states (PMD-SQS) can be chosen as variational principle by which we can find the analytic expressions of the partial transition amplitudes. In this paper we present a description of hadron-hadron scattering via principle of minimum distance PMD-SQS when the distance in space of states is minimized with two directional constraints: dσ/dΩ(±1) = fixed. Then by using the available experimental (pion-nucleon and kaon-nucleon) phase shifts we obtained not only consistent experimental tests of the PMD-SQS optimality, but also strong experimental evidences for new principles in hadronic physics such as: Principle of nonextensivity conjugation via the Riesz-Thorin relation (1/2p + 1/2q = 1) and a new Principle of limited uncertainty in nonextensive quantum physics. The strong experimental evidence obtained here for the nonextensive statistical behavior of the [J,
Some Properties of the Distance Function and a Conjecture of De Giorgi
Eminenti, Manolo; Mantegazza, Carlo
2003-01-01
We analyse the geometric properties of the high derivatives of the distance function from a submanifold of the Euclidean space. In particular, we show some relations with the second fundamental form and its covariant derivatives of independent interest. As an application we prove a conjecture of Ennio De Giorgi on the evolution of submanifolds of the Euclidean space by the gradient of functionals depending on the derivatives of the distance function.
Walwyn, Amy L.; Navarro, Daniel J.
2010-01-01
An experiment is reported comparing human performance on two kinds of visually presented traveling salesperson problems (TSPs), those reliant on Euclidean geometry and those reliant on city block geometry. Across multiple array sizes, human performance was near-optimal in both geometries, but was slightly better in the Euclidean format. Even so,…
Measuring and testing dependence by correlation of distances
Székely, Gábor J.; Rizzo, Maria L.; Bakirov, Nail K.
2007-01-01
Distance correlation is a new measure of dependence between random vectors. Distance covariance and distance correlation are analogous to product-moment covariance and correlation, but unlike the classical definition of correlation, distance correlation is zero only if the random vectors are independent. The empirical distance dependence measures are based on certain Euclidean distances between sample elements rather than sample moments, yet have a compact representation analogous to the clas...
Local algebras in Euclidean quantum field theory
International Nuclear Information System (INIS)
Guerra, Francesco.
1975-06-01
The general structure of the local observable algebras of Euclidean quantum field theory is described, considering the very simple examples of the free scalar field, the vector meson field, and the electromagnetic field. The role of Markov properties, and the relations between Euclidean theory and Hamiltonian theory in Minkowski space-time are especially emphasized. No conflict appears between covariance (in the Euclidean sense) and locality (in the Markov sense) on one hand and positive definiteness of the metric on the other hand [fr
Euclidean supersymmetry, twisting and topological sigma models
International Nuclear Information System (INIS)
Hull, C.M.; Lindstroem, U.; Santos, L. Melo dos; Zabzine, M.; Unge, R. von
2008-01-01
We discuss two dimensional N-extended supersymmetry in Euclidean signature and its R-symmetry. For N = 2, the R-symmetry is SO(2) x SO(1, 1), so that only an A-twist is possible. To formulate a B-twist, or to construct Euclidean N = 2 models with H-flux so that the target geometry is generalised Kahler, it is necessary to work with a complexification of the sigma models. These issues are related to the obstructions to the existence of non-trivial twisted chiral superfields in Euclidean superspace.
Founding Gravitation in 4D Euclidean Space-Time Geometry
International Nuclear Information System (INIS)
Winkler, Franz-Guenter
2010-01-01
The Euclidean interpretation of special relativity which has been suggested by the author is a formulation of special relativity in ordinary 4D Euclidean space-time geometry. The natural and geometrically intuitive generalization of this view involves variations of the speed of light (depending on location and direction) and a Euclidean principle of general covariance. In this article, a gravitation model by Jan Broekaert, which implements a view of relativity theory in the spirit of Lorentz and Poincare, is reconstructed and shown to fulfill the principles of the Euclidean approach after an appropriate reinterpretation.
Directory of Open Access Journals (Sweden)
Eric Z. Chen
2015-01-01
Full Text Available Error control codes have been widely used in data communications and storage systems. One central problem in coding theory is to optimize the parameters of a linear code and construct codes with best possible parameters. There are tables of best-known linear codes over finite fields of sizes up to 9. Recently, there has been a growing interest in codes over $\\mathbb{F}_{13}$ and other fields of size greater than 9. The main purpose of this work is to present a database of best-known linear codes over the field $\\mathbb{F}_{13}$ together with upper bounds on the minimum distances. To find good linear codes to establish lower bounds on minimum distances, an iterative heuristic computer search algorithm is employed to construct quasi-twisted (QT codes over the field $\\mathbb{F}_{13}$ with high minimum distances. A large number of new linear codes have been found, improving previously best-known results. Tables of $[pm, m]$ QT codes over $\\mathbb{F}_{13}$ with best-known minimum distances as well as a table of lower and upper bounds on the minimum distances for linear codes of length up to 150 and dimension up to 6 are presented.
Ait-Haddou, Rachid
2015-01-01
We show that the best degree reduction of a given polynomial P from degree n to m with respect to the discrete (Formula presented.)-norm is equivalent to the best Euclidean distance of the vector of h-Bézier coefficients of P from the vector
Constructive curves in non-Euclidean planes
Horváth, Ákos G.
2016-01-01
In this paper we overview the theory of conics and roulettes in four non-Euclidean planes. We collect the literature about these classical concepts, from the eighteenth century to the present, including papers available only on arXiv. The comparison of the four non-Euclidean planes, in terms of the known results on conics and roulettes, reflects only the very subjective view of the author.
Spinors in euclidean field theory, complex structures and discrete symmetries
International Nuclear Information System (INIS)
Wetterich, C.
2011-01-01
We discuss fermions for arbitrary dimensions and signature of the metric, with special emphasis on euclidean space. Generalized Majorana spinors are defined for d=2,3,4,8,9mod8, independently of the signature. These objects permit a consistent analytic continuation of Majorana spinors in Minkowski space to euclidean signature. Compatibility of charge conjugation with complex conjugation requires for euclidean signature a new complex structure which involves a reflection in euclidean time. The possible complex structures for Minkowski and euclidean signature can be understood in terms of a modulo two periodicity in the signature. The concepts of a real action and hermitean observables depend on the choice of the complex structure. For a real action the expectation values of all hermitean multi-fermion observables are real. This holds for arbitrary signature, including euclidean space. In particular, a chemical potential is compatible with a real action for the euclidean theory. We also discuss the discrete symmetries of parity, time reversal and charge conjugation for arbitrary dimension and signature.
DEFF Research Database (Denmark)
Lisonek, Petr
1996-01-01
A two-distance set in E^d is a point set X inthe d-dimensional Euclidean spacesuch that the distances between distinct points in Xassume only two different non-zero values. Based on results from classical distance geometry, we developan algorithm to classify, for a given dimension, all maximal...... (largest possible)two-distance sets in E^d.Using this algorithm we have completed the full classificationfor all dimensions less than or equal to 7, andwe have found one set in E^8 whosemaximality follows from Blokhuis' upper bound on sizes of s-distance sets.While in the dimensions less than or equal to 6...
30 CFR 77.807-2 - Booms and masts; minimum distance from high-voltage lines.
2010-07-01
...-voltage lines. 77.807-2 Section 77.807-2 Mineral Resources MINE SAFETY AND HEALTH ADMINISTRATION... WORK AREAS OF UNDERGROUND COAL MINES Surface High-Voltage Distribution § 77.807-2 Booms and masts; minimum distance from high-voltage lines. The booms and masts of equipment operated on the surface of any...
Coxeter, HSM
1965-01-01
This textbook introduces non-Euclidean geometry, and the third edition adds a new chapter, including a description of the two families of 'mid-lines' between two given lines and an elementary derivation of the basic formulae of spherical trigonometry and hyperbolic trigonometry, and other new material.
30 CFR 77.807-3 - Movement of equipment; minimum distance from high-voltage lines.
2010-07-01
... high-voltage lines. 77.807-3 Section 77.807-3 Mineral Resources MINE SAFETY AND HEALTH ADMINISTRATION... WORK AREAS OF UNDERGROUND COAL MINES Surface High-Voltage Distribution § 77.807-3 Movement of equipment; minimum distance from high-voltage lines. When any part of any equipment operated on the surface of any...
Rate-Compatible LDPC Codes with Linear Minimum Distance
Divsalar, Dariush; Jones, Christopher; Dolinar, Samuel
2009-01-01
A recently developed method of constructing protograph-based low-density parity-check (LDPC) codes provides for low iterative decoding thresholds and minimum distances proportional to block sizes, and can be used for various code rates. A code constructed by this method can have either fixed input block size or fixed output block size and, in either case, provides rate compatibility. The method comprises two submethods: one for fixed input block size and one for fixed output block size. The first mentioned submethod is useful for applications in which there are requirements for rate-compatible codes that have fixed input block sizes. These are codes in which only the numbers of parity bits are allowed to vary. The fixed-output-blocksize submethod is useful for applications in which framing constraints are imposed on the physical layers of affected communication systems. An example of such a system is one that conforms to one of many new wireless-communication standards that involve the use of orthogonal frequency-division modulation
Decoding and finding the minimum distance with Gröbner bases : history and new insights
Bulygin, S.; Pellikaan, G.R.; Woungang, I.; Misra, S.; Misra, S.C.
2010-01-01
In this chapter, we discuss decoding techniques and finding the minimum distance of linear codes with the use of Grobner bases. First, we give a historical overview of decoding cyclic codes via solving systems polynominal equations over finite fields. In particular, we mention papers of Cooper,.
Jégat , Alain
2014-01-01
The usual framework for Einstein’s special theory of relativity is the pseudo-euclidean spacetime proposed by Hermann Minkowski. This article aims at proposing a different model.The framework is an euclidean four-dimensional space in which all the objects move regularly (it means that, between two observations, whatever their trajectories, they cover the same distance), but where the events are seen in projection according to a privileged direction, as we are going to explain. The remark, rat...
Solution for a bipartite Euclidean traveling-salesman problem in one dimension
Caracciolo, Sergio; Di Gioacchino, Andrea; Gherardi, Marco; Malatesta, Enrico M.
2018-05-01
The traveling-salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We characterize the optimal cycle for every convex and increasing cost function when the points are thrown independently and with an identical probability distribution in a compact interval. We compute the average optimal cost for every number of points when the distance function is the square of the Euclidean distance. We also show that the average optimal cost is not a self-averaging quantity by explicitly computing the variance of its distribution in the thermodynamic limit. Moreover, we prove that the cost of the optimal cycle is not smaller than twice the cost of the optimal assignment of the same set of points. Interestingly, this bound is saturated in the thermodynamic limit.
Du, Ding-Zhu
2001-01-01
This book is a collection of articles studying various Steiner tree prob lems with applications in industries, such as the design of electronic cir cuits, computer networking, telecommunication, and perfect phylogeny. The Steiner tree problem was initiated in the Euclidean plane. Given a set of points in the Euclidean plane, the shortest network interconnect ing the points in the set is called the Steiner minimum tree. The Steiner minimum tree may contain some vertices which are not the given points. Those vertices are called Steiner points while the given points are called terminals. The shortest network for three terminals was first studied by Fermat (1601-1665). Fermat proposed the problem of finding a point to minimize the total distance from it to three terminals in the Euclidean plane. The direct generalization is to find a point to minimize the total distance from it to n terminals, which is still called the Fermat problem today. The Steiner minimum tree problem is an indirect generalization. Sch...
Multivariate Welch t-test on distances.
Alekseyenko, Alexander V
2016-12-01
Permutational non-Euclidean analysis of variance, PERMANOVA, is routinely used in exploratory analysis of multivariate datasets to draw conclusions about the significance of patterns visualized through dimension reduction. This method recognizes that pairwise distance matrix between observations is sufficient to compute within and between group sums of squares necessary to form the (pseudo) F statistic. Moreover, not only Euclidean, but arbitrary distances can be used. This method, however, suffers from loss of power and type I error inflation in the presence of heteroscedasticity and sample size imbalances. We develop a solution in the form of a distance-based Welch t-test, [Formula: see text], for two sample potentially unbalanced and heteroscedastic data. We demonstrate empirically the desirable type I error and power characteristics of the new test. We compare the performance of PERMANOVA and [Formula: see text] in reanalysis of two existing microbiome datasets, where the methodology has originated. The source code for methods and analysis of this article is available at https://github.com/alekseyenko/Tw2 Further guidance on application of these methods can be obtained from the author. alekseye@musc.edu. © The Author 2016. Published by Oxford University Press.
Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases
Bulygin, S.; Pellikaan, G.R.; Sala, M.; Mora, T.; Perret, L.; Sakata, S.; Traverso, C.
2009-01-01
In this short note we show how one can decode linear error-correcting codes up to half the minimum distance via solving a system of polynomial equations over a finite field. We also explicitly present the reduced Gröbner basis for the system considered.
Biharmonic Submanifolds with Parallel Mean Curvature Vector in Pseudo-Euclidean Spaces
Energy Technology Data Exchange (ETDEWEB)
Fu, Yu, E-mail: yufudufe@gmail.com [Dongbei University of Finance and Economics, School of Mathematics and Quantitative Economics (China)
2013-12-15
In this paper, we investigate biharmonic submanifolds in pseudo-Euclidean spaces with arbitrary index and dimension. We give a complete classification of biharmonic spacelike submanifolds with parallel mean curvature vector in pseudo-Euclidean spaces. We also determine all biharmonic Lorentzian surfaces with parallel mean curvature vector field in pseudo-Euclidean spaces.
Biharmonic Submanifolds with Parallel Mean Curvature Vector in Pseudo-Euclidean Spaces
International Nuclear Information System (INIS)
Fu, Yu
2013-01-01
In this paper, we investigate biharmonic submanifolds in pseudo-Euclidean spaces with arbitrary index and dimension. We give a complete classification of biharmonic spacelike submanifolds with parallel mean curvature vector in pseudo-Euclidean spaces. We also determine all biharmonic Lorentzian surfaces with parallel mean curvature vector field in pseudo-Euclidean spaces
Variational submanifolds of Euclidean spaces
Krupka, D.; Urban, Z.; Volná, J.
2018-03-01
Systems of ordinary differential equations (or dynamical forms in Lagrangian mechanics), induced by embeddings of smooth fibered manifolds over one-dimensional basis, are considered in the class of variational equations. For a given non-variational system, conditions assuring variationality (the Helmholtz conditions) of the induced system with respect to a submanifold of a Euclidean space are studied, and the problem of existence of these "variational submanifolds" is formulated in general and solved for second-order systems. The variational sequence theory on sheaves of differential forms is employed as a main tool for the analysis of local and global aspects (variationality and variational triviality). The theory is illustrated by examples of holonomic constraints (submanifolds of a configuration Euclidean space) which are variational submanifolds in geometry and mechanics.
Generating Approximative Minimum Length Paths in 3D for UAVs
DEFF Research Database (Denmark)
Schøler, Flemming; la Cour-Harbo, Anders; Bisgaard, Morten
2012-01-01
We consider the challenge of planning a minimum length path from an initial position to a desired position for a rotorcraft. The path is found in a 3-dimensional Euclidean space containing a geometric obstacle. We base our approach on visibility graphs which have been used extensively for path pl...
KM-FCM: A fuzzy clustering optimization algorithm based on Mahalanobis distance
Directory of Open Access Journals (Sweden)
Zhiwen ZU
2018-04-01
Full Text Available The traditional fuzzy clustering algorithm uses Euclidean distance as the similarity criterion, which is disadvantageous to the multidimensional data processing. In order to solve this situation, Mahalanobis distance is used instead of the traditional Euclidean distance, and the optimization of fuzzy clustering algorithm based on Mahalanobis distance is studied to enhance the clustering effect and ability. With making the initialization means by Heuristic search algorithm combined with k-means algorithm, and in terms of the validity function which could automatically adjust the optimal clustering number, an optimization algorithm KM-FCM is proposed. The new algorithm is compared with FCM algorithm, FCM-M algorithm and M-FCM algorithm in three standard data sets. The experimental results show that the KM-FCM algorithm is effective. It has higher clustering accuracy than FCM, FCM-M and M-FCM, recognizing high-dimensional data clustering well. It has global optimization effect, and the clustering number has no need for setting in advance. The new algorithm provides a reference for the optimization of fuzzy clustering algorithm based on Mahalanobis distance.
Classical geometry Euclidean, transformational, inversive, and projective
Leonard, I E; Liu, A C F; Tokarsky, G W
2014-01-01
Features the classical themes of geometry with plentiful applications in mathematics, education, engineering, and science Accessible and reader-friendly, Classical Geometry: Euclidean, Transformational, Inversive, and Projective introduces readers to a valuable discipline that is crucial to understanding bothspatial relationships and logical reasoning. Focusing on the development of geometric intuitionwhile avoiding the axiomatic method, a problem solving approach is encouraged throughout. The book is strategically divided into three sections: Part One focuses on Euclidean geometry, which p
Fuzzy Euclidean wormholes in de Sitter space
Energy Technology Data Exchange (ETDEWEB)
Chen, Pisin; Hu, Yao-Chieh; Yeom, Dong-han, E-mail: pisinchen@phys.ntu.edu.tw, E-mail: r04244003@ntu.edu.tw, E-mail: innocent.yeom@gmail.com [Leung Center for Cosmology and Particle Astrophysics, National Taiwan University, Taipei 10617, Taiwan (China)
2017-07-01
We investigate Euclidean wormholes in Einstein gravity with a massless scalar field in de Sitter space. Euclidean wormholes are possible due to the analytic continuation of the time as well as complexification of fields, where we need to impose the classicality after the Wick-rotation to the Lorentzian signatures. For some parameters, wormholes are preferred than Hawking-Moss instantons, and hence wormholes can be more fundamental than Hawking-Moss type instantons. Euclidean wormholes can be interpreted in three ways: (1) classical big bounce, (2) either tunneling from a small to a large universe or a creation of a collapsing and an expanding universe from nothing, and (3) either a transition from a contracting to a bouncing phase or a creation of two expanding universes from nothing. These various interpretations shed some light on challenges of singularities. In addition, these will help to understand tensions between various kinds of quantum gravity theories.
Rate-compatible protograph LDPC code families with linear minimum distance
Divsalar, Dariush (Inventor); Dolinar, Jr., Samuel J. (Inventor); Jones, Christopher R. (Inventor)
2012-01-01
Digital communication coding methods are shown, which generate certain types of low-density parity-check (LDPC) codes built from protographs. A first method creates protographs having the linear minimum distance property and comprising at least one variable node with degree less than 3. A second method creates families of protographs of different rates, all structurally identical for all rates except for a rate-dependent designation of certain variable nodes as transmitted or non-transmitted. A third method creates families of protographs of different rates, all structurally identical for all rates except for a rate-dependent designation of the status of certain variable nodes as non-transmitted or set to zero. LDPC codes built from the protographs created by these methods can simultaneously have low error floors and low iterative decoding thresholds.
Trudeau, Richard J
1986-01-01
How unique and definitive is Euclidean geometry in describing the "real" space in which we live? Richard Trudeau confronts the fundamental question of truth and its representation through mathematical models in The Non-Euclidean Revolution. First, the author analyzes geometry in its historical and philosophical setting; second, he examines a revolution every bit as significant as the Copernican revolution in astronomy and the Darwinian revolution in biology; third, on the most speculative level, he questions the possibility of absolute knowledge of the world. Trudeau writes in a lively, entertaining, and highly accessible style. His book provides one of the most stimulating and personal presentations of a struggle with the nature of truth in mathematics and the physical world. A portion of the book won the Pólya Prize, a distinguished award from the Mathematical Association of America. "Trudeau meets the challenge of reaching a broad audience in clever ways...(The book) is a good addition to our literature o...
Euclidean null controllability of perturbed infinite delay systems with ...
African Journals Online (AJOL)
Euclidean null controllability of perturbed infinite delay systems with limited control. ... Open Access DOWNLOAD FULL TEXT ... The results are established by placing conditions on the perturbation function which guarantee that, if the linear control base system is completely Euclidean controllable, then the perturbed system ...
Quaternion analyticity and conformally Kaehlerian structure in Euclidean gravity
International Nuclear Information System (INIS)
Guersey, F.; Chia-Hsiung Tze
1984-01-01
Starting from the fact that the d = 4 Euclidean flat spacetime is conformally related to the Kaehler manifold H 2 xS 2 , we show the Euclidean Schwarzschild metric to be conformally related to another Kaehler manifold M 2 xS 2 with M 2 being conformal to H 2 in two dimensions. Both metrics which are conformally Kaehlerian, are form-invariant under the infinite parameter Fueter group, the Euclidean counterpart of Milne's group of clock regraduation. The associated Einstein's equations translate into Fueter's quaternionic analyticity. The latter leads to an infinite number of local continuity equations. (orig.)
On the scaling limits in the Euclidean (quantum) field theory
International Nuclear Information System (INIS)
Gielerak, R.
1983-01-01
The author studies the concept of scaling limits in the context of the constructive field theory. He finds that the domain of attraction of a free massless Euclidean scalar field in the two-dimensional space time contains almost all Euclidean self-interacting models of quantum fields so far constructed. The renormalized scaling limit of the Wick polynomials of several self-interacting Euclidean field theory models are shown to be the same as in the free field theory. (Auth.)
Euclidean null controllability of nonlinear infinite delay systems with ...
African Journals Online (AJOL)
Sufficient conditions for the Euclidean null controllability of non-linear delay systems with time varying multiple delays in the control and implicit derivative are derived. If the uncontrolled system is uniformly asymptotically stable and if the control system is controllable, then the non-linear infinite delay system is Euclidean null ...
Dynamic hyperbolic geometry: building intuition and understanding mediated by a Euclidean model
Moreno-Armella, Luis; Brady, Corey; Elizondo-Ramirez, Rubén
2018-05-01
This paper explores a deep transformation in mathematical epistemology and its consequences for teaching and learning. With the advent of non-Euclidean geometries, direct, iconic correspondences between physical space and the deductive structures of mathematical inquiry were broken. For non-Euclidean ideas even to become thinkable the mathematical community needed to accumulate over twenty centuries of reflection and effort: a precious instance of distributed intelligence at the cultural level. In geometry education after this crisis, relations between intuitions and geometrical reasoning must be established philosophically, rather than taken for granted. One approach seeks intuitive supports only for Euclidean explorations, viewing non-Euclidean inquiry as fundamentally non-intuitive in nature. We argue for moving beyond such an impoverished approach, using dynamic geometry environments to develop new intuitions even in the extremely challenging setting of hyperbolic geometry. Our efforts reverse the typical direction, using formal structures as a source for a new family of intuitions that emerge from exploring a digital model of hyperbolic geometry. This digital model is elaborated within a Euclidean dynamic geometry environment, enabling a conceptual dance that re-configures Euclidean knowledge as a support for building intuitions in hyperbolic space-intuitions based not directly on physical experience but on analogies extending Euclidean concepts.
Qiu, Zhijun; Zhou, Bo; Yuan, Jiangfeng
2017-11-21
Protein-protein interaction site (PPIS) prediction must deal with the diversity of interaction sites that limits their prediction accuracy. Use of proteins with unknown or unidentified interactions can also lead to missing interfaces. Such data errors are often brought into the training dataset. In response to these two problems, we used the minimum covariance determinant (MCD) method to refine the training data to build a predictor with better performance, utilizing its ability of removing outliers. In order to predict test data in practice, a method based on Mahalanobis distance was devised to select proper test data as input for the predictor. With leave-one-validation and independent test, after the Mahalanobis distance screening, our method achieved higher performance according to Matthews correlation coefficient (MCC), although only a part of test data could be predicted. These results indicate that data refinement is an efficient approach to improve protein-protein interaction site prediction. By further optimizing our method, it is hopeful to develop predictors of better performance and wide range of application. Copyright © 2017 Elsevier Ltd. All rights reserved.
Zourmand, Alireza; Ting, Hua-Nong; Mirhassani, Seyed Mostafa
2013-03-01
Speech is one of the prevalent communication mediums for humans. Identifying the gender of a child speaker based on his/her speech is crucial in telecommunication and speech therapy. This article investigates the use of fundamental and formant frequencies from sustained vowel phonation to distinguish the gender of Malay children aged between 7 and 12 years. The Euclidean minimum distance and multilayer perceptron were used to classify the gender of 360 Malay children based on different combinations of fundamental and formant frequencies (F0, F1, F2, and F3). The Euclidean minimum distance with normalized frequency data achieved a classification accuracy of 79.44%, which was higher than that of the nonnormalized frequency data. Age-dependent modeling was used to improve the accuracy of gender classification. The Euclidean distance method obtained 84.17% based on the optimal classification accuracy for all age groups. The accuracy was further increased to 99.81% using multilayer perceptron based on mel-frequency cepstral coefficients. Copyright © 2013 The Voice Foundation. Published by Mosby, Inc. All rights reserved.
Computing the Expected Value and Variance of Geometric Measures
DEFF Research Database (Denmark)
Staals, Frank; Tsirogiannis, Constantinos
2017-01-01
distance (MPD), the squared Euclidean distance from the centroid, and the diameter of the minimum enclosing disk. We also describe an efficient (1-e)-approximation algorithm for computing the mean and variance of the mean pairwise distance. We implemented three of our algorithms and we show that our...
Euclidean null controllability of linear systems with delays in state ...
African Journals Online (AJOL)
Sufficient conditions are developed for the Euclidean controllability of linear systems with delay in state and in control. Namely, if the uncontrolled system is uniformly asymptotically stable and the control equation proper, then the control system is Euclidean null controllable. Journal of the Nigerian Association of ...
The relation between Euclidean and Lorentzian 2D quantum gravity
Ambjørn, J.; Correia, J.; Kristjansen, C.; Loll, R.
1999-01-01
Starting from 2D Euclidean quantum gravity, we show that one recovers 2D Lorentzian quantum gravity by removing all baby universes. Using a peeling procedure to decompose the discrete, triangulated geometries along a one-dimensional path, we explicitly associate with each Euclidean space-time a
Isometric immersions and embeddings of locally Euclidean metrics in R2
International Nuclear Information System (INIS)
Sabitov, I Kh
1999-01-01
This paper deals with the problem of isometric immersions and embeddings of two-dimensional locally Euclidean metrics in the Euclidean plane. We find explicit formulae for the immersions of metrics defined on a simply connected domain and a number of sufficient conditions for the existence of isometric embeddings. In the case when the domain is multiply connected we find necessary conditions for the existence of isometric immersions and classify the cases when the metric admits no isometric immersion in the Euclidean plane
Barthlome, D. E.
1975-01-01
Test results of a unique automatic brake control system are outlined and a comparison is made of its mode of operation to that of an existing skid control system. The purpose of the test system is to provide automatic control of braking action such that hydraulic brake pressure is maintained at a near constant, optimum value during minimum distance stops.
Euclidean geometry and its subgeometries
Specht, Edward John; Calkins, Keith G; Rhoads, Donald H
2015-01-01
In this monograph, the authors present a modern development of Euclidean geometry from independent axioms, using up-to-date language and providing detailed proofs. The axioms for incidence, betweenness, and plane separation are close to those of Hilbert. This is the only axiomatic treatment of Euclidean geometry that uses axioms not involving metric notions and that explores congruence and isometries by means of reflection mappings. The authors present thirteen axioms in sequence, proving as many theorems as possible at each stage and, in the process, building up subgeometries, most notably the Pasch and neutral geometries. Standard topics such as the congruence theorems for triangles, embedding the real numbers in a line, and coordinatization of the plane are included, as well as theorems of Pythagoras, Desargues, Pappas, Menelaus, and Ceva. The final chapter covers consistency and independence of axioms, as well as independence of definition properties. There are over 300 exercises; solutions to many of the...
Noncommutative products of Euclidean spaces
Dubois-Violette, Michel; Landi, Giovanni
2018-05-01
We present natural families of coordinate algebras on noncommutative products of Euclidean spaces R^{N_1} × _R R^{N_2} . These coordinate algebras are quadratic ones associated with an R -matrix which is involutive and satisfies the Yang-Baxter equations. As a consequence, they enjoy a list of nice properties, being regular of finite global dimension. Notably, we have eight-dimensional noncommutative euclidean spaces R4 × _R R4 . Among these, particularly well behaved ones have deformation parameter u \\in S^2 . Quotients include seven spheres S7_u as well as noncommutative quaternionic tori TH_u = S^3 × _u S^3 . There is invariance for an action of {{SU}}(2) × {{SU}}(2) on the torus TH_u in parallel with the action of U(1) × U(1) on a `complex' noncommutative torus T^2_θ which allows one to construct quaternionic toric noncommutative manifolds. Additional classes of solutions are disjoint from the classical case.
Directory of Open Access Journals (Sweden)
D. L. Nkweteyim
2018-03-01
Full Text Available It is reported in this paper, the results of a study of the partitioning around medoids (PAM clustering algorithm applied to four datasets, both standardized and not, and of varying sizes and numbers of clusters. The angular distance proximity measure in addition to the two more traditional proximity measures, namely the Euclidean distance and Manhattan distance, was used to compute object-object similarity. The data used in the study comprise three widely available datasets, and one that was constructed from publicly available climate data. Results replicate some of the well known facts about the PAM algorithm, namely that the quality of the clusters generated tend to be much better for small datasets, that the silhouette value is a good, even if not perfect, guide for the optimal number of clusters to generate, and that human intervention is required to interpret generated clusters. Additionally, results also indicate that the angular distance measure, which traditionally has not been widely used in clustering, outperforms both the Euclidean and Manhattan distance metrics in certain situations.
Non-euclidean simplex optimization. [Application to potentiometric titration of Pu
Energy Technology Data Exchange (ETDEWEB)
Silver, G.L.
1977-08-15
Geometric optimization techniques useful for studying chemical equilibrium traditionally rely upon principles of euclidean geometry, but such algorithms may also be based upon principles of a non-euclidean geometry. The sequential simplex method is adapted to the hyperbolic plane, and application of optimization to problems such as the potentiometric titration of plutonium is suggested.
Growth Modeling of Human Mandibles using Non-Euclidean Metrics
DEFF Research Database (Denmark)
Hilger, Klaus Baggesen; Larsen, Rasmus; Wrobel, Mark
2003-01-01
From a set of 31 three-dimensional CT scans we model the temporal shape and size of the human mandible. Each anatomical structure is represented using 14851 semi-landmarks, and mapped into Procrustes tangent space. Exploratory subspace analyses are performed leading to linear models of mandible...... shape evolution in Procrustes space. The traditional variance analysis results in a one-dimensional growth model. However, working in a non-Euclidean metric results in a multimodal model with uncorrelated modes of biological variation. The applied non-Euclidean metric is governed by the correlation...... structure of the estimated noise in the data. The generative models are compared, and evaluated on the basis of a cross validation study. The new non-Euclidean analysis is completely data driven. It not only gives comparable results w.r.t. to previous studies of the mean modelling error, but in addition...
Distance of Sample Measurement Points to Prototype Catalog Curve
DEFF Research Database (Denmark)
Hjorth, Poul G.; Karamehmedovic, Mirza; Perram, John
2006-01-01
We discuss strategies for comparing discrete data points to a catalog (reference) curve by means of the Euclidean distance from each point to the curve in a pump's head H vs. flow Qdiagram. In particular we find that a method currently in use is inaccurate. We propose several alternatives...
The elements of non-Euclidean geometry
Sommerville, D MY
2012-01-01
Renowned for its lucid yet meticulous exposition, this classic allows students to follow the development of non-Euclidean geometry from a fundamental analysis of the concept of parallelism to more advanced topics. 1914 edition. Includes 133 figures.
Kulczycki, Stefan
2008-01-01
This accessible approach features two varieties of proofs: stereometric and planimetric, as well as elementary proofs that employ only the simplest properties of the plane. A short history of geometry precedes a systematic exposition of the principles of non-Euclidean geometry.Starting with fundamental assumptions, the author examines the theorems of Hjelmslev, mapping a plane into a circle, the angle of parallelism and area of a polygon, regular polygons, straight lines and planes in space, and the horosphere. Further development of the theory covers hyperbolic functions, the geometry of suff
Epileptic Seizure Detection with Log-Euclidean Gaussian Kernel-Based Sparse Representation.
Yuan, Shasha; Zhou, Weidong; Wu, Qi; Zhang, Yanli
2016-05-01
Epileptic seizure detection plays an important role in the diagnosis of epilepsy and reducing the massive workload of reviewing electroencephalography (EEG) recordings. In this work, a novel algorithm is developed to detect seizures employing log-Euclidean Gaussian kernel-based sparse representation (SR) in long-term EEG recordings. Unlike the traditional SR for vector data in Euclidean space, the log-Euclidean Gaussian kernel-based SR framework is proposed for seizure detection in the space of the symmetric positive definite (SPD) matrices, which form a Riemannian manifold. Since the Riemannian manifold is nonlinear, the log-Euclidean Gaussian kernel function is applied to embed it into a reproducing kernel Hilbert space (RKHS) for performing SR. The EEG signals of all channels are divided into epochs and the SPD matrices representing EEG epochs are generated by covariance descriptors. Then, the testing samples are sparsely coded over the dictionary composed by training samples utilizing log-Euclidean Gaussian kernel-based SR. The classification of testing samples is achieved by computing the minimal reconstructed residuals. The proposed method is evaluated on the Freiburg EEG dataset of 21 patients and shows its notable performance on both epoch-based and event-based assessments. Moreover, this method handles multiple channels of EEG recordings synchronously which is more speedy and efficient than traditional seizure detection methods.
Euclidean and Minkowski space formulations of linearized gravitational potential in various gauges
International Nuclear Information System (INIS)
Lim, S.C.
1979-01-01
We show that there exists a unitary map connecting linearized theories of gravitational potential in vacuum, formulated in various covariant gauges and noncovariant radiation gauge. The free Euclidean gravitational potentials in covariant gauges satisfy the Markov property of Nelson, but are nonreflexive. For the noncovariant radiation gauge, the corresponding Euclidean field is reflexive but it only satisfies the Markov property with respect to special half spaces. The Feynman--Kac--Nelson formula is established for the Euclidean gravitational potential in radiation gauge
Some nonunitary, indecomposable representations of the Euclidean algebra e(3)
International Nuclear Information System (INIS)
Douglas, Andrew; De Guise, Hubert
2010-01-01
The Euclidean group E(3) is the noncompact, semidirect product group E(3)≅R 3 x SO(3). It is the Lie group of orientation-preserving isometries of three-dimensional Euclidean space. The Euclidean algebra e(3) is the complexification of the Lie algebra of E(3). We construct three distinct families of finite-dimensional, nonunitary representations of e(3) and show that each representation is indecomposable. The representations of the first family are explicitly realized as subspaces of the polynomial ring F[X,Y,Z] with the action of e(3) given by differential operators. The other families are constructed via duals and tensor products of the representations within the first family. We describe subrepresentations, quotients and duals of these indecomposable representations.
Majorization in Euclidean Geometry and Beyond
Czech Academy of Sciences Publication Activity Database
Fiedler, Miroslav
2015-01-01
Roč. 466, 1 February (2015), s. 233-240 ISSN 0024-3795 Institutional support: RVO:67985807 Keywords : Majorization * Doubly stochastic matrix * Euclidean simplex * Star * Regular simplex * Volume of a simplex Subject RIV: BA - General Mathematics Impact factor: 0.965, year: 2015
Uniqueness of Gibbs states and global Markov property for Euclidean fields
International Nuclear Information System (INIS)
Albeverio, S.; Hoeegh-Krohn, R.
1981-01-01
The authors briefly discuss the proof of the uniqueness of solutions of the DLR equations (uniqueness of Gibbs states) in the class of regular generalized random fields (in the sense of having second moments bounded by those of some Euclidean field), for the Euclidean fields with trigonometric interaction. (Auth.)
ORDERED WEIGHTED DISTANCE MEASURE
Institute of Scientific and Technical Information of China (English)
Zeshui XU; Jian CHEN
2008-01-01
The aim of this paper is to develop an ordered weighted distance (OWD) measure, which is thegeneralization of some widely used distance measures, including the normalized Hamming distance, the normalized Euclidean distance, the normalized geometric distance, the max distance, the median distance and the min distance, etc. Moreover, the ordered weighted averaging operator, the generalized ordered weighted aggregation operator, the ordered weighted geometric operator, the averaging operator, the geometric mean operator, the ordered weighted square root operator, the square root operator, the max operator, the median operator and the min operator axe also the special cases of the OWD measure. Some methods depending on the input arguments are given to determine the weights associated with the OWD measure. The prominent characteristic of the OWD measure is that it can relieve (or intensify) the influence of unduly large or unduly small deviations on the aggregation results by assigning them low (or high) weights. This desirable characteristic makes the OWD measure very suitable to be used in many actual fields, including group decision making, medical diagnosis, data mining, and pattern recognition, etc. Finally, based on the OWD measure, we develop a group decision making approach, and illustrate it with a numerical example.
Flexible intuitions of Euclidean geometry in an Amazonian indigene group
Izard, Véronique; Pica, Pierre; Spelke, Elizabeth S.; Dehaene, Stanislas
2011-01-01
Kant argued that Euclidean geometry is synthesized on the basis of an a priori intuition of space. This proposal inspired much behavioral research probing whether spatial navigation in humans and animals conforms to the predictions of Euclidean geometry. However, Euclidean geometry also includes concepts that transcend the perceptible, such as objects that are infinitely small or infinitely large, or statements of necessity and impossibility. We tested the hypothesis that certain aspects of nonperceptible Euclidian geometry map onto intuitions of space that are present in all humans, even in the absence of formal mathematical education. Our tests probed intuitions of points, lines, and surfaces in participants from an indigene group in the Amazon, the Mundurucu, as well as adults and age-matched children controls from the United States and France and younger US children without education in geometry. The responses of Mundurucu adults and children converged with that of mathematically educated adults and children and revealed an intuitive understanding of essential properties of Euclidean geometry. For instance, on a surface described to them as perfectly planar, the Mundurucu's estimations of the internal angles of triangles added up to ∼180 degrees, and when asked explicitly, they stated that there exists one single parallel line to any given line through a given point. These intuitions were also partially in place in the group of younger US participants. We conclude that, during childhood, humans develop geometrical intuitions that spontaneously accord with the principles of Euclidean geometry, even in the absence of training in mathematics. PMID:21606377
Axioms for Euclidean Green's functions. Pt. 2
International Nuclear Information System (INIS)
Osterwalder, K.; Schrader, R.
1975-01-01
We give new (necessary and) sufficient conditions for Euclidean Green's functions to have analytic continuations to a relativistic field theory. These results extend and correct a previous paper. (orig.) [de
Salonen, Maria; Maeda, Eduardo Eiji; Toivonen, Tuuli
2014-10-01
Land use and land cover change (LUCC) models frequently employ different accessibility measures as a proxy for human influence on land change processes. Here, we simulate deforestation in Peruvian Amazonia and evaluate different accessibility measures as LUCC model inputs. We demonstrate how the selection, and different combinations, of accessibility measures impact simulation results. Out of the individual measures, time distance to market center catches the essential aspects of accessibility in our study area. The most accurate simulation is achieved when time distance to market center is used in association with distance to transport network and additional landscape variables. Although traditional Euclidean measures result in clearly lower simulation accuracy when used separately, the combination of two complementary Euclidean measures enhances simulation accuracy significantly. Our results highlight the need for site and context sensitive selection of accessibility variables. More sophisticated accessibility measures can potentially improve LUCC models' spatial accuracy, which often remains low.
What if? Exploring the multiverse through Euclidean wormholes
Bouhmadi-López, Mariam; Krämer, Manuel; Morais, João; Robles-Pérez, Salvador
2017-10-01
We present Euclidean wormhole solutions describing possible bridges within the multiverse. The study is carried out in the framework of third quantisation. The matter content is modelled through a scalar field which supports the existence of a whole collection of universes. The instanton solutions describe Euclidean solutions that connect baby universes with asymptotically de Sitter universes. We compute the tunnelling probability of these processes. Considering the current bounds on the energy scale of inflation and assuming that all the baby universes are nucleated with the same probability, we draw some conclusions about which universes are more likely to tunnel and therefore undergo a standard inflationary era.
What if? Exploring the multiverse through Euclidean wormholes
International Nuclear Information System (INIS)
Bouhmadi-Lopez, Mariam; Kraemer, Manuel; Morais, Joao; Robles-Perez, Salvador
2017-01-01
We present Euclidean wormhole solutions describing possible bridges within the multiverse. The study is carried out in the framework of third quantisation. The matter content is modelled through a scalar field which supports the existence of a whole collection of universes. The instanton solutions describe Euclidean solutions that connect baby universes with asymptotically de Sitter universes. We compute the tunnelling probability of these processes. Considering the current bounds on the energy scale of inflation and assuming that all the baby universes are nucleated with the same probability, we draw some conclusions about which universes are more likely to tunnel and therefore undergo a standard inflationary era. (orig.)
What if? Exploring the multiverse through Euclidean wormholes
Energy Technology Data Exchange (ETDEWEB)
Bouhmadi-Lopez, Mariam [University of the Basque Country UPV/EHU, Department of Theoretical Physics, Bilbao (Spain); Ikerbasque, Basque Foundation for Science, Bilbao (Spain); Kraemer, Manuel [University of Szczecin, Institute of Physics, Szczecin (Poland); Morais, Joao [University of the Basque Country UPV/EHU, Department of Theoretical Physics, Bilbao (Spain); Robles-Perez, Salvador [Instituto de Fisica Fundamental, CSIC, Madrid (Spain); Estacion Ecologica de Biocosmologia, Medellin (Spain)
2017-10-15
We present Euclidean wormhole solutions describing possible bridges within the multiverse. The study is carried out in the framework of third quantisation. The matter content is modelled through a scalar field which supports the existence of a whole collection of universes. The instanton solutions describe Euclidean solutions that connect baby universes with asymptotically de Sitter universes. We compute the tunnelling probability of these processes. Considering the current bounds on the energy scale of inflation and assuming that all the baby universes are nucleated with the same probability, we draw some conclusions about which universes are more likely to tunnel and therefore undergo a standard inflationary era. (orig.)
Statistical mechanics, gravity, and Euclidean theory
International Nuclear Information System (INIS)
Fursaev, Dmitri V.
2002-01-01
A review of computations of free energy for Gibbs states on stationary but not static gravitational and gauge backgrounds is given. On these backgrounds wave equations for free fields are reduced to eigenvalue problems which depend non-linearly on the spectral parameter. We present a method to deal with such problems. In particular, we demonstrate how some results of the spectral theory of second-order elliptic operators, such as heat kernel asymptotics, can be extended to a class of non-linear spectral problems. The method is used to trace down the relation between the canonical definition of the free energy based on summation over the modes and the covariant definition given in Euclidean quantum gravity. As an application, high-temperature asymptotics of the free energy and of the thermal part of the stress-energy tensor in the presence of rotation are derived. We also discuss statistical mechanics in the presence of Killing horizons where canonical and Euclidean theories are related in a non-trivial way
Calculus and analysis in Euclidean space
Shurman, Jerry
2016-01-01
The graceful role of analysis in underpinning calculus is often lost to their separation in the curriculum. This book entwines the two subjects, providing a conceptual approach to multivariable calculus closely supported by the structure and reasoning of analysis. The setting is Euclidean space, with the material on differentiation culminating in the inverse and implicit function theorems, and the material on integration culminating in the general fundamental theorem of integral calculus. More in-depth than most calculus books but less technical than a typical analysis introduction, Calculus and Analysis in Euclidean Space offers a rich blend of content to students outside the traditional mathematics major, while also providing transitional preparation for those who will continue on in the subject. The writing in this book aims to convey the intent of ideas early in discussion. The narrative proceeds through figures, formulas, and text, guiding the reader to do mathematics resourcefully by marshaling the skil...
Lorentz violations and Euclidean signature metrics
International Nuclear Information System (INIS)
Barbero G, J. Fernando; Villasenor, Eduardo J.S.
2003-01-01
We show that the families of effective actions considered by Jacobson et al. to study Lorentz invariance violations contain a class of models that represent pure general relativity with a Euclidean signature. We also point out that some members of this family of actions preserve Lorentz invariance in a generalized sense
Directory of Open Access Journals (Sweden)
Bilková Kristína
2017-06-01
Full Text Available Over the last twenty years or so, researchers’ attention to the issue of food deserts has increased in the geographical literature. Accessibility to large-scale retail units is one of the essential and frequently-used indicators leading to the identification and mapping of food deserts. Numerous accessibility measures of various types are available for this purpose. Euclidean distance and street network distance rank among the most frequently-used approaches, although they may lead to slightly different results. The aim of this paper is to compare various approaches to the accessibility to food stores and to assess the differences in the results gained by these methods. Accessibility was measured for residential block centroids, with applications of various accessibility measures in a GIS environment. The results suggest a strong correspondence between Euclidean distance and a little more accurate street network distance approach, applied in the case of the urban environment of Bratislava-Petržalka, Slovakia.
Tunneling in expanding Universe: Euclidean and Hamiltonian approaches
International Nuclear Information System (INIS)
Goncharov, A.S.; Linde, A.D.
1986-01-01
The theory of the false vacuum decay in de Sitter space and in the inflationary Universe, and also the theory of the Universe creation ''from nothing'' are discussed. This explained why tunneling in the inflationary Universe differs from that in de Sitter space and cannot be exactly homogeneous. It is shown that in several important cases the Euclidean approach should be considerably modified or is absolutely inapplicable for the description of tunneling in the expanding Universe and of the process of the quantum creation of the Universe. The Hamiltonian approach to the theory of tunneling in expanding Universe is developed. The results obtained by this method are compared with the results obtained by the Euclidean approach
Minimum spanning trees and random resistor networks in d dimensions.
Read, N
2005-09-01
We consider minimum-cost spanning trees, both in lattice and Euclidean models, in d dimensions. For the cost of the optimum tree in a box of size L , we show that there is a correction of order L(theta) , where theta or =1 . The arguments all rely on the close relation of Kruskal's greedy algorithm for the minimum spanning tree, percolation, and (for some arguments) random resistor networks. The scaling of the entropy and free energy at small nonzero T , and hence of the number of near-optimal solutions, is also discussed. We suggest that the Steiner tree problem is in the same universality class as the minimum spanning tree in all dimensions, as is the traveling salesman problem in two dimensions. Hence all will have the same value of theta=-3/4 in two dimensions.
On the invariant theory of Weingarten surfaces in Euclidean space
International Nuclear Information System (INIS)
Ganchev, Georgi; Mihova, Vesselka
2010-01-01
On any Weingarten surface in Euclidean space (strongly regular or rotational), we introduce locally geometric principal parameters and prove that such a surface is determined uniquely up to a motion by a special invariant function, which satisfies a natural nonlinear partial differential equation. This result can be interpreted as a solution to the Lund-Regge reduction problem for Weingarten surfaces in Euclidean space. We apply this theory to fractional-linear Weingarten surfaces and obtain the nonlinear partial differential equations describing them.
Contaminant classification using cosine distances based on multiple conventional sensors.
Liu, Shuming; Che, Han; Smith, Kate; Chang, Tian
2015-02-01
Emergent contamination events have a significant impact on water systems. After contamination detection, it is important to classify the type of contaminant quickly to provide support for remediation attempts. Conventional methods generally either rely on laboratory-based analysis, which requires a long analysis time, or on multivariable-based geometry analysis and sequence analysis, which is prone to being affected by the contaminant concentration. This paper proposes a new contaminant classification method, which discriminates contaminants in a real time manner independent of the contaminant concentration. The proposed method quantifies the similarities or dissimilarities between sensors' responses to different types of contaminants. The performance of the proposed method was evaluated using data from contaminant injection experiments in a laboratory and compared with a Euclidean distance-based method. The robustness of the proposed method was evaluated using an uncertainty analysis. The results show that the proposed method performed better in identifying the type of contaminant than the Euclidean distance based method and that it could classify the type of contaminant in minutes without significantly compromising the correct classification rate (CCR).
Hoffman, Kenneth
2007-01-01
Developed for an introductory course in mathematical analysis at MIT, this text focuses on concepts, principles, and methods. Its introductions to real and complex analysis are closely formulated, and they constitute a natural introduction to complex function theory.Starting with an overview of the real number system, the text presents results for subsets and functions related to Euclidean space of n dimensions. It offers a rigorous review of the fundamentals of calculus, emphasizing power series expansions and introducing the theory of complex-analytic functions. Subsequent chapters cover seq
Ait-Haddou, Rachid
2015-06-04
We show that the best degree reduction of a given polynomial P from degree n to m with respect to the discrete (Formula presented.)-norm is equivalent to the best Euclidean distance of the vector of h-Bézier coefficients of P from the vector of degree raised h-Bézier coefficients of polynomials of degree m. Moreover, we demonstrate the adequacy of h-Bézier curves for approaching the problem of weighted discrete least squares approximation. Applications to discrete orthogonal polynomials are also presented. © 2015 Springer Science+Business Media Dordrecht
On the Averaging of Cardiac Diffusion Tensor MRI Data: The Effect of Distance Function Selection
Giannakidis, Archontis; Melkus, Gerd; Yang, Guang; Gullberg, Grant T.
2016-01-01
Diffusion tensor magnetic resonance imaging (DT-MRI) allows a unique insight into the microstructure of highly-directional tissues. The selection of the most proper distance function for the space of diffusion tensors is crucial in enhancing the clinical application of this imaging modality. Both linear and nonlinear metrics have been proposed in the literature over the years. The debate on the most appropriate DT-MRI distance function is still ongoing. In this paper, we presented a framework to compare the Euclidean, affine-invariant Riemannian and log-Euclidean metrics using actual high-resolution DT-MRI rat heart data. We employed temporal averaging at the diffusion tensor level of three consecutive and identically-acquired DT-MRI datasets from each of five rat hearts as a means to rectify the background noise-induced loss of myocyte directional regularity. This procedure is applied here for the first time in the context of tensor distance function selection. When compared with previous studies that used a different concrete application to juxtapose the various DT-MRI distance functions, this work is unique in that it combined the following: (i) Metrics were judged by quantitative –rather than qualitative– criteria, (ii) the comparison tools were non-biased, (iii) a longitudinal comparison operation was used on a same-voxel basis. The statistical analyses of the comparison showed that the three DT-MRI distance functions tend to provide equivalent results. Hence, we came to the conclusion that the tensor manifold for cardiac DT-MRI studies is a curved space of almost zero curvature. The signal to noise ratio dependence of the operations was investigated through simulations. Finally, the “swelling effect” occurrence following Euclidean averaging was found to be too unimportant to be worth consideration. PMID:27754986
On the averaging of cardiac diffusion tensor MRI data: the effect of distance function selection
Giannakidis, Archontis; Melkus, Gerd; Yang, Guang; Gullberg, Grant T.
2016-11-01
Diffusion tensor magnetic resonance imaging (DT-MRI) allows a unique insight into the microstructure of highly-directional tissues. The selection of the most proper distance function for the space of diffusion tensors is crucial in enhancing the clinical application of this imaging modality. Both linear and nonlinear metrics have been proposed in the literature over the years. The debate on the most appropriate DT-MRI distance function is still ongoing. In this paper, we presented a framework to compare the Euclidean, affine-invariant Riemannian and log-Euclidean metrics using actual high-resolution DT-MRI rat heart data. We employed temporal averaging at the diffusion tensor level of three consecutive and identically-acquired DT-MRI datasets from each of five rat hearts as a means to rectify the background noise-induced loss of myocyte directional regularity. This procedure is applied here for the first time in the context of tensor distance function selection. When compared with previous studies that used a different concrete application to juxtapose the various DT-MRI distance functions, this work is unique in that it combined the following: (i) metrics were judged by quantitative—rather than qualitative—criteria, (ii) the comparison tools were non-biased, (iii) a longitudinal comparison operation was used on a same-voxel basis. The statistical analyses of the comparison showed that the three DT-MRI distance functions tend to provide equivalent results. Hence, we came to the conclusion that the tensor manifold for cardiac DT-MRI studies is a curved space of almost zero curvature. The signal to noise ratio dependence of the operations was investigated through simulations. Finally, the ‘swelling effect’ occurrence following Euclidean averaging was found to be too unimportant to be worth consideration.
Euclidean wormholes with minimally coupled scalar fields
International Nuclear Information System (INIS)
Ruz, Soumendranath; Modak, Bijan; Debnath, Subhra; Sanyal, Abhik Kumar
2013-01-01
A detailed study of quantum and semiclassical Euclidean wormholes for Einstein's theory with a minimally coupled scalar field has been performed for a class of potentials. Massless, constant, massive (quadratic in the scalar field) and inverse (linear) potentials admit the Hawking and Page wormhole boundary condition both in the classically forbidden and allowed regions. An inverse quartic potential has been found to exhibit a semiclassical wormhole configuration. Classical wormholes under a suitable back-reaction leading to a finite radius of the throat, where the strong energy condition is satisfied, have been found for the zero, constant, quadratic and exponential potentials. Treating such classical Euclidean wormholes as an initial condition, a late stage of cosmological evolution has been found to remain unaltered from standard Friedmann cosmology, except for the constant potential which under the back-reaction produces a term like a negative cosmological constant. (paper)
Intrinsic Regularization in a Lorentz invariant non-orthogonal Euclidean Space
Tornow, Carmen
2006-01-01
It is shown that the Lorentz transformations can be derived for a non-orthogonal Euclidean space. In this geometry one finds the same relations of special relativity as the ones known from the orthogonal Minkowski space. In order to illustrate the advantage of a non-orthogonal Euclidean metric the two-point Green’s function at x = 0 for a self-interacting scalar field is calculated. In contrast to the Minkowski space the one loop mass correction derived from this function gives a convergent r...
Directory of Open Access Journals (Sweden)
DanFang Yan
Full Text Available OBJECTS: To introduce a new method for generating the clinical target volume (CTV from gross tumor volume (GTV using the geodesic distance calculation for glioma. METHODS: One glioblastoma patient was enrolled. The GTV and natural barriers were contoured on each slice of the computer tomography (CT simulation images. Then, a graphic processing unit based on a parallel Euclidean distance transform was used to generate the CTV considering natural barriers. Three-dimensional (3D visualization technique was applied to show the delineation results. Speed of operation and precision were compared between this new delineation method and the traditional method. RESULTS: In considering spatial barriers, the shortest distance from the point sheltered from these barriers equals the sum of the distance along the shortest path between the two points; this consists of several segments and evades the spatial barriers, rather than being the direct Euclidean distance between two points. The CTV was generated irregularly rather than as a spherical shape. The time required to generate the CTV was greatly reduced. Moreover, this new method improved inter- and intra-observer variability in defining the CTV. CONCLUSIONS: Compared with the traditional CTV delineation, this new method using geodesic distance calculation not only greatly shortens the time to modify the CTV, but also has better reproducibility.
Fisher type inequalities for Euclidean t-designs
Delsarte, Ph.; Seidel, J.J.
1989-01-01
The notion of a Euclidean t-design is analyzed in the framework of appropriate inner product spaces of polynomial functions. Some Fisher type inequalities are obtained in a simple manner by this method. The same approach is used to deal with certain analogous combinatorial designs.
Directory of Open Access Journals (Sweden)
Longxiang Li
Full Text Available Effective assessments of air-pollution exposure depend on the ability to accurately predict pollutant concentrations at unmonitored locations, which can be achieved through spatial interpolation. However, most interpolation approaches currently in use are based on the Euclidean distance, which cannot account for the complex nonlinear features displayed by air-pollution distributions in the wind-field. In this study, an interpolation method based on the shortest path distance is developed to characterize the impact of complex urban wind-field on the distribution of the particulate matter concentration. In this method, the wind-field is incorporated by first interpolating the observed wind-field from a meteorological-station network, then using this continuous wind-field to construct a cost surface based on Gaussian dispersion model and calculating the shortest wind-field path distances between locations, and finally replacing the Euclidean distances typically used in Inverse Distance Weighting (IDW with the shortest wind-field path distances. This proposed methodology is used to generate daily and hourly estimation surfaces for the particulate matter concentration in the urban area of Beijing in May 2013. This study demonstrates that wind-fields can be incorporated into an interpolation framework using the shortest wind-field path distance, which leads to a remarkable improvement in both the prediction accuracy and the visual reproduction of the wind-flow effect, both of which are of great importance for the assessment of the effects of pollutants on human health.
Linearization of Euclidean Norm Dependent Inequalities Applied to Multibeam Satellites Design
Camino , Jean-Thomas; Artigues , Christian; Houssin , Laurent; Mourgues , Stéphane
2016-01-01
Euclidean norm computations over continuous variables appear naturally in the constraints or in the objective of many problems in the optimization literature, possibly defining non-convex feasible regions or cost functions. When some other variables have discrete domains, it positions the problem in the challenging Mixed Integer Nonlinear Programming (MINLP) class. For any MINLP where the nonlinearity is only present in the form of inequality constraints involving the Euclidean norm, we propo...
General Rotational Surfaces in Pseudo-Euclidean 4-Space with Neutral Metric
Aleksieva, Yana; Milousheva, Velichka; Turgay, Nurettin Cenk
2016-01-01
We define general rotational surfaces of elliptic and hyperbolic type in the pseudo-Euclidean 4-space with neutral metric which are analogous to the general rotational surfaces of C. Moore in the Euclidean 4-space. We study Lorentz general rotational surfaces with plane meridian curves and give the complete classification of minimal general rotational surfaces of elliptic and hyperbolic type, general rotational surfaces with parallel normalized mean curvature vector field, flat general rotati...
Martinetti, Pierre; Tomassini, Luca
2013-10-01
We study the metric aspect of the Moyal plane from Connes' noncommutative geometry point of view. First, we compute Connes' spectral distance associated with the natural isometric action of on the algebra of the Moyal plane . We show that the distance between any state of and any of its translated states is precisely the amplitude of the translation. As a consequence, we obtain the spectral distance between coherent states of the quantum harmonic oscillator as the Euclidean distance on the plane. We investigate the classical limit, showing that the set of coherent states equipped with Connes' spectral distance tends towards the Euclidean plane as the parameter of deformation goes to zero. The extension of these results to the action of the symplectic group is also discussed, with particular emphasis on the orbits of coherent states under rotations. Second, we compute the spectral distance in the double Moyal plane, intended as the product of (the minimal unitization of) by . We show that on the set of states obtained by translation of an arbitrary state of , this distance is given by the Pythagoras theorem. On the way, we prove some Pythagoras inequalities for the product of arbitrary unital and non-degenerate spectral triples. Applied to the Doplicher- Fredenhagen-Roberts model of quantum spacetime [DFR], these two theorems show that Connes' spectral distance and the DFR quantum length coincide on the set of states of optimal localization.
New solutions of euclidean SU(2) gauge theory
International Nuclear Information System (INIS)
Khan, I.
1983-08-01
New solutions of the Euclidean SU(2) gauge theory having finite field strength everywhere are presented. The solutions are self dual or antidual and constitute a two-parameter family which includes the instantons. (author)
On Lattice Sequential Decoding for The Unconstrained AWGN Channel
Abediseid, Walid; Alouini, Mohamed-Slim
2013-01-01
channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the \\textit{lattice decoder}. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement
Performance-complexity tradeoff in sequential decoding for the unconstrained AWGN channel
Abediseid, Walid; Alouini, Mohamed-Slim
2013-01-01
channel has been studied only under the use of the minimum Euclidean distance decoder that is commonly referred to as the lattice decoder. Lattice decoders based on solutions to the NP-hard closest vector problem are very complex to implement
Euclidean to Minkowski Bethe-Salpeter amplitude and observables
International Nuclear Information System (INIS)
Carbonell, J.; Frederico, T.; Karmanov, V.A.
2017-01-01
We propose a method to reconstruct the Bethe-Salpeter amplitude in Minkowski space given the Euclidean Bethe-Salpeter amplitude - or alternatively the light-front wave function - as input. The method is based on the numerical inversion of the Nakanishi integral representation and computing the corresponding weight function. This inversion procedure is, in general, rather unstable, and we propose several ways to considerably reduce the instabilities. In terms of the Nakanishi weight function, one can easily compute the BS amplitude, the LF wave function and the electromagnetic form factor. The latter ones are very stable in spite of residual instabilities in the weight function. This procedure allows both, to continue the Euclidean BS solution in the Minkowski space and to obtain a BS amplitude from a LF wave function. (orig.)
Euclidean to Minkowski Bethe-Salpeter amplitude and observables
Energy Technology Data Exchange (ETDEWEB)
Carbonell, J. [Universite Paris-Sud, IN2P3-CNRS, Institut de Physique Nucleaire, Orsay Cedex (France); Frederico, T. [Instituto Tecnologico de Aeronautica, DCTA, Sao Jose dos Campos (Brazil); Karmanov, V.A. [Lebedev Physical Institute, Moscow (Russian Federation)
2017-01-15
We propose a method to reconstruct the Bethe-Salpeter amplitude in Minkowski space given the Euclidean Bethe-Salpeter amplitude - or alternatively the light-front wave function - as input. The method is based on the numerical inversion of the Nakanishi integral representation and computing the corresponding weight function. This inversion procedure is, in general, rather unstable, and we propose several ways to considerably reduce the instabilities. In terms of the Nakanishi weight function, one can easily compute the BS amplitude, the LF wave function and the electromagnetic form factor. The latter ones are very stable in spite of residual instabilities in the weight function. This procedure allows both, to continue the Euclidean BS solution in the Minkowski space and to obtain a BS amplitude from a LF wave function. (orig.)
Matrices and Graphs in Euclidean Geometry
Czech Academy of Sciences Publication Activity Database
Fiedler, Miroslav
2005-01-01
Roč. 14, - (2005), s. 51-58 E-ISSN 1081-3810 R&D Projects: GA AV ČR IAA1030302 Institutional research plan: CEZ:AV0Z10300504 Keywords : Euclidean space * Gram matrix * biorthogonal bases * simplex * interior angle * Steiner circumscribed ellipsoid * right simplex Subject RIV: BA - General Mathematics http://www.math.technion.ac.il/iic/ ela / ela -articles/14.html
Euclidean self-dual Yang-Mills field configurations
International Nuclear Information System (INIS)
Sartori, G.
1980-01-01
The determination of a large class of regular and singular Euclidean self-dual Yang-Mills field configurations is reduced to the solution of a set of linear algebraic equations. The matrix of the coefficients is a polynomial functions of x and the rules for its construction are elementary. (author)
Random walks in Euclidean space
Varjú, Péter Pál
2012-01-01
Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove a local limit theorem under a suitable moment condition and a necessary non-degeneracy condition. Under stronger hypothesis, we prove a limit theorem on a wide range of scales: between e^(-cl^(1/4)) and l^(1/2), where l is the number of steps.
Hu, Weiming; Li, Xi; Luo, Wenhan; Zhang, Xiaoqin; Maybank, Stephen; Zhang, Zhongfei
2012-12-01
Object appearance modeling is crucial for tracking objects, especially in videos captured by nonstationary cameras and for reasoning about occlusions between multiple moving objects. Based on the log-euclidean Riemannian metric on symmetric positive definite matrices, we propose an incremental log-euclidean Riemannian subspace learning algorithm in which covariance matrices of image features are mapped into a vector space with the log-euclidean Riemannian metric. Based on the subspace learning algorithm, we develop a log-euclidean block-division appearance model which captures both the global and local spatial layout information about object appearances. Single object tracking and multi-object tracking with occlusion reasoning are then achieved by particle filtering-based Bayesian state inference. During tracking, incremental updating of the log-euclidean block-division appearance model captures changes in object appearance. For multi-object tracking, the appearance models of the objects can be updated even in the presence of occlusions. Experimental results demonstrate that the proposed tracking algorithm obtains more accurate results than six state-of-the-art tracking algorithms.
Dai, Jian; Song, Xing-Chang
2001-07-01
One of the key ingredients of Connes's noncommutative geometry is a generalized Dirac operator which induces a metric (Connes's distance) on the pure state space. We generalize such a Dirac operator devised by Dimakis et al, whose Connes distance recovers the linear distance on an one-dimensional lattice, to the two-dimensional case. This Dirac operator has the local eigenvalue property and induces a Euclidean distance on this two-dimensional lattice, which is referred to as `natural'. This kind of Dirac operator can be easily generalized into any higher-dimensional lattices.
Introduction to non-Euclidean geometry
Wolfe, Harold E
2012-01-01
One of the first college-level texts for elementary courses in non-Euclidean geometry, this concise, readable volume is geared toward students familiar with calculus. A full treatment of the historical background explores the centuries-long efforts to prove Euclid's parallel postulate and their triumphant conclusion. Numerous original exercises form an integral part of the book.Topics include hyperbolic plane geometry and hyperbolic plane trigonometry, applications of calculus to the solutions of some problems in hyperbolic geometry, elliptic plane geometry and trigonometry, and the consistenc
DEFF Research Database (Denmark)
Hermansson, Henrik Alf Jonas; Cross, James
2015-01-01
Political scientists often nd themselves tracking amendments to political texts. As different actors weigh in, texts change as they are drafted and redrafted, reflecting political preferences and power. This study provides a novel solution to the problem of detecting amendments to political text......) and substantive amount of amendments made between version of texts. To illustrate the usefulness and eciency of the approach we replicate two existing studies from the field of legislative studies. Our results demonstrate that minimum edit distance methods can produce superior measures of text amendments to hand...
Classical and quantum integrability of 2D dilaton gravities in Euclidean space
International Nuclear Information System (INIS)
Bergamin, L; Grumiller, D; Kummer, W; Vassilevich, D V
2005-01-01
Euclidean dilaton gravity in two dimensions is studied exploiting its representation as a complexified first order gravity model. All local classical solutions are obtained. A global discussion reveals that for a given model only a restricted class of topologies is consistent with the metric and the dilaton. A particular case of string motivated Liouville gravity is studied in detail. Path integral quantization in generic Euclidean dilaton gravity is performed non-perturbatively by analogy to the Minkowskian case
A general Euclidean connection for so(n,m) lie algebra and the algebraic approach to scattering
International Nuclear Information System (INIS)
Ionescu, R.A.
1994-11-01
We obtain a general Euclidean connection for so(n,m). This Euclidean connection allows an algebraic derivation of the S matrix and it reduces to the known one in suitable circumstances. (author). 8 refs
Penerapan Algoritma A Star (A* pada Game Petualangan Labirin Berbasis Android
Directory of Open Access Journals (Sweden)
Wahyu Widodo
2018-01-01
Full Text Available Game memiliki arti dasar permainan, permainan dalam hal ini merujuk pada pengertian kelincahan intelektual. Di dalam penerapannya, sebuah Game tentu memerlukan sebuah AI (Artificial Intelligence, dan AI yang digunakan dalam pembangunan Game petualangan labirin ini adalah algoritma A* (A Star dengan euclidean distance. Algoritma ini merupakan algoritma pencarian untuk menemukan rute terpendek dengan cost paling minimum, algoritma A* mencari rute terpendek dengan menjumlahkan jarak sebenarnya dengan jarak perkiraan sehingga membuatnya optimum dan complete. Petualangan labirin merupakan Game yang menceritakan mengenai petualangan kelinci melewati sebuah labirin untuk mencari makanannya. Genre dari Game ini adalah adventure dan puzzle, dibangun dengan bahasa pemrograman java dengan tools Android Studio, AI yang digunakan adalah algoritma A* dengan euclidean distance yang digunakan pada bantuan untuk melakukan pencarian jalur guna menemukan makanan kelinci. Hasil uji dari Game Petualangan labirin ini adalah jika pemain dalam kesusahan menemukan jalur menuju makanan kelinci, maka pemain dapat menggunakan tombol bantuan yang akan dicarikan jalur terpendek oleh algoritma A* (A Star dengan euclidean distance untuk menuju lokasi tempat makanan kelinci berada.
Williams, C.J.; Heglund, P.J.
2009-01-01
Habitat association models are commonly developed for individual animal species using generalized linear modeling methods such as logistic regression. We considered the issue of grouping species based on their habitat use so that management decisions can be based on sets of species rather than individual species. This research was motivated by a study of western landbirds in northern Idaho forests. The method we examined was to separately fit models to each species and to use a generalized Mahalanobis distance between coefficient vectors to create a distance matrix among species. Clustering methods were used to group species from the distance matrix, and multidimensional scaling methods were used to visualize the relations among species groups. Methods were also discussed for evaluating the sensitivity of the conclusions because of outliers or influential data points. We illustrate these methods with data from the landbird study conducted in northern Idaho. Simulation results are presented to compare the success of this method to alternative methods using Euclidean distance between coefficient vectors and to methods that do not use habitat association models. These simulations demonstrate that our Mahalanobis-distance- based method was nearly always better than Euclidean-distance-based methods or methods not based on habitat association models. The methods used to develop candidate species groups are easily explained to other scientists and resource managers since they mainly rely on classical multivariate statistical methods. ?? 2008 Springer Science+Business Media, LLC.
Euclidean fields: vector mesons and photons
International Nuclear Information System (INIS)
Loffelholz, J.
1979-01-01
Free transverse vector fields of mass >= 0 are studied. The model is related to the usual free vector meson and electromagnetic quantum field theories by extension of the field operators from transverse to arbitrary test functions. The one-particle states in transverse gauge and their localization are described. Reflexion positivity is proved and derived are free Feynman-Kac-Nelson formulas. An Euclidean approach to a photon field in a spherical world using dilatation covariance and inversions is given
Spinors and supersymmetry in four-dimensional Euclidean space
International Nuclear Information System (INIS)
McKeon, D.G.C.; Sherry, T.N.
2001-01-01
Spinors in four-dimensional Euclidean space are treated using the decomposition of the Euclidean space SO(4) symmetry group into SU(2)xSU(2). Both 2- and 4-spinor representations of this SO(4) symmetry group are shown to differ significantly from the corresponding spinor representations of the SO(3, 1) symmetry group in Minkowski space. The simplest self conjugate supersymmetry algebra allowed in four-dimensional Euclidean space is demonstrated to be an N=2 supersymmetry algebra which resembles the N=2 supersymmetry algebra in four-dimensional Minkowski space. The differences between the two supersymmetry algebras gives rise to different representations; in particular an analysis of the Clifford algebra structure shows that the momentum invariant is bounded above by the central charges in 4dE, while in 4dM the central charges bound the momentum invariant from below. Dimensional reduction of the N=1 SUSY algebra in six-dimensional Minkowski space (6dM) to 4dE reproduces our SUSY algebra in 4dE. This dimensional reduction can be used to introduce additional generators into the SUSY algebra in 4dE. Well known interpolating maps are used to relate the N=2 SUSY algebra in 4dE derived in this paper to the N=2 SUSY algebra in 4dM. The nature of the spinors in 4dE allows us to write an axially gauge invariant model which is shown to be both Hermitian and anomaly-free. No equivalent model exists in 4dM. Useful formulae in 4dE are collected together in two appendixes
Non-Euclidean Geometry and Gravitation
Directory of Open Access Journals (Sweden)
Stavroulakis N.
2006-04-01
Full Text Available A great deal of misunderstandings and mathematical errors are involved in the currently accepted theory of the gravitational field generated by an isotropic spherical mass. The purpose of the present paper is to provide a short account of the rigorous mathematical theory and exhibit a new formulation of the problem. The solution of the corresponding equations of gravitation points out several new and unusual features of the stationary gravitational field which are related to the non-Euclidean structure of the space. Moreover it precludes the black hole from being a mathematical and physical notion.
Directory of Open Access Journals (Sweden)
Hajime Matsui
2017-12-01
Full Text Available In this study, we consider codes over Euclidean domains modulo their ideals. In the first half of the study, we deal with arbitrary Euclidean domains. We show that the product of generator matrices of codes over the rings mod a and mod b produces generator matrices of all codes over the ring mod a b , i.e., this correspondence is onto. Moreover, we show that if a and b are coprime, then this correspondence is one-to-one, i.e., there exist unique codes over the rings mod a and mod b that produce any given code over the ring mod a b through the product of their generator matrices. In the second half of the study, we focus on the typical Euclidean domains such as the rational integer ring, one-variable polynomial rings, rings of Gaussian and Eisenstein integers, p-adic integer rings and rings of one-variable formal power series. We define the reduced generator matrices of codes over Euclidean domains modulo their ideals and show their uniqueness. Finally, we apply our theory of reduced generator matrices to the Hecke rings of matrices over these Euclidean domains.
Superconvergent perturbation theory for euclidean scalar field theories
International Nuclear Information System (INIS)
Ushveridze, A.G.
1984-01-01
It is shown that the bare (unrenormalized) correlation functions in the euclidean scalar field theories can be expanded in a series whose terms, being computable in a relatively simple way, are free from ultraviolet and infrared divergencies. This series is convergent (divergent) for finite (infinite) values of the correlation functions. (orig.)
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs
I.Z. Emiris; E.P. Tsigaridas; A. Varvitsiotis (Antonios); E.R. Gasner
2009-01-01
textabstract The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such graphs, up to rigid motions, in Euclidean space. We capture embeddability by polynomial systems
Toward the minimum inner edge distance of the habitable zone
Energy Technology Data Exchange (ETDEWEB)
Zsom, Andras; Seager, Sara; De Wit, Julien; Stamenković, Vlada, E-mail: zsom@mit.edu [Department of Earth, Atmospheric and Planetary Sciences, Massachusetts Institute of Technology, Cambridge, MA 02139 (United States)
2013-12-01
We explore the minimum distance from a host star where an exoplanet could potentially be habitable in order not to discard close-in rocky exoplanets for follow-up observations. We find that the inner edge of the Habitable Zone for hot desert worlds can be as close as 0.38 AU around a solar-like star, if the greenhouse effect is reduced (∼1% relative humidity) and the surface albedo is increased. We consider a wide range of atmospheric and planetary parameters such as the mixing ratios of greenhouse gases (water vapor and CO{sub 2}), surface albedo, pressure, and gravity. Intermediate surface pressure (∼1-10 bars) is necessary to limit water loss and to simultaneously sustain an active water cycle. We additionally find that the water loss timescale is influenced by the atmospheric CO{sub 2} level, because it indirectly influences the stratospheric water mixing ratio. If the CO{sub 2} mixing ratio of dry planets at the inner edge is smaller than 10{sup –4}, the water loss timescale is ∼1 billion years, which is considered here too short for life to evolve. We also show that the expected transmission spectra of hot desert worlds are similar to an Earth-like planet. Therefore, an instrument designed to identify biosignature gases in an Earth-like atmosphere can also identify similarly abundant gases in the atmospheres of dry planets. Our inner edge limit is closer to the host star than previous estimates. As a consequence, the occurrence rate of potentially habitable planets is larger than previously thought.
Toward the minimum inner edge distance of the habitable zone
International Nuclear Information System (INIS)
Zsom, Andras; Seager, Sara; De Wit, Julien; Stamenković, Vlada
2013-01-01
We explore the minimum distance from a host star where an exoplanet could potentially be habitable in order not to discard close-in rocky exoplanets for follow-up observations. We find that the inner edge of the Habitable Zone for hot desert worlds can be as close as 0.38 AU around a solar-like star, if the greenhouse effect is reduced (∼1% relative humidity) and the surface albedo is increased. We consider a wide range of atmospheric and planetary parameters such as the mixing ratios of greenhouse gases (water vapor and CO 2 ), surface albedo, pressure, and gravity. Intermediate surface pressure (∼1-10 bars) is necessary to limit water loss and to simultaneously sustain an active water cycle. We additionally find that the water loss timescale is influenced by the atmospheric CO 2 level, because it indirectly influences the stratospheric water mixing ratio. If the CO 2 mixing ratio of dry planets at the inner edge is smaller than 10 –4 , the water loss timescale is ∼1 billion years, which is considered here too short for life to evolve. We also show that the expected transmission spectra of hot desert worlds are similar to an Earth-like planet. Therefore, an instrument designed to identify biosignature gases in an Earth-like atmosphere can also identify similarly abundant gases in the atmospheres of dry planets. Our inner edge limit is closer to the host star than previous estimates. As a consequence, the occurrence rate of potentially habitable planets is larger than previously thought.
Euclidean approach to the inflationary universe
International Nuclear Information System (INIS)
Hawking, S.W.
1983-01-01
The aim of this article is to show how the Euclidean approach can be used to study the inflationary universe. Although this formulation may appear counterintuitive in some respects, it has the advantage that it defines a definite quantum state and provides a framework for calculating quantities of interest such as correlation functions or tunnelling probabilities. By contrast, in the more usual approach in real Lorentzian spacetime, it is not so clear what the quantum state should be or how to evaluate such quantities. (author)
Non-Euclidean spacetime structure and the two-slit experiment
International Nuclear Information System (INIS)
El Naschie, M.S.
2005-01-01
A simple mathematical model for the two-slit experiment is given to account for the wave-particle duality. Subsequently, the various solutions are interpreted via the experimental evidence as a property of the underlying non-Euclidean spacetime topology and geometry at the quantum level
$O(N)$ model in Euclidean de Sitter space: beyond the leading infrared approximation
Nacir, Diana López; Trombetta, Leonardo G
2016-01-01
We consider an $O(N)$ scalar field model with quartic interaction in $d$-dimensional Euclidean de Sitter space. In order to avoid the problems of the standard perturbative calculations for light and massless fields, we generalize to the $O(N)$ theory a systematic method introduced previously for a single field, which treats the zero modes exactly and the nonzero modes perturbatively. We compute the two-point functions taking into account not only the leading infrared contribution, coming from the self-interaction of the zero modes, but also corrections due to the interaction of the ultraviolet modes. For the model defined in the corresponding Lorentzian de Sitter spacetime, we obtain the two-point functions by analytical continuation. We point out that a partial resummation of the leading secular terms (which necessarily involves nonzero modes) is required to obtain a decay at large distances for massless fields. We implement this resummation along with a systematic double expansion in an effective coupling c...
Giovannini, Federico; Savino, Giovanni; Pierini, Marco; Baldanzini, Niccolò
2013-10-01
In the recent years the autonomous emergency brake (AEB) was introduced in the automotive field to mitigate the injury severity in case of unavoidable collisions. A crucial element for the activation of the AEB is to establish when the obstacle is no longer avoidable by lateral evasive maneuvers (swerving). In the present paper a model to compute the minimum swerving distance needed by a powered two-wheeler (PTW) to avoid the collision against a fixed obstacle, named last-second swerving model (Lsw), is proposed. The effectiveness of the model was investigated by an experimental campaign involving 12 volunteers riding a scooter equipped with a prototype autonomous emergency braking, named motorcycle autonomous emergency braking system (MAEB). The tests showed the performance of the model in evasive trajectory computation for different riding styles and fixed obstacles. Copyright © 2013 Elsevier Ltd. All rights reserved.
Spatial generalised linear mixed models based on distances.
Melo, Oscar O; Mateu, Jorge; Melo, Carlos E
2016-10-01
Risk models derived from environmental data have been widely shown to be effective in delineating geographical areas of risk because they are intuitively easy to understand. We present a new method based on distances, which allows the modelling of continuous and non-continuous random variables through distance-based spatial generalised linear mixed models. The parameters are estimated using Markov chain Monte Carlo maximum likelihood, which is a feasible and a useful technique. The proposed method depends on a detrending step built from continuous or categorical explanatory variables, or a mixture among them, by using an appropriate Euclidean distance. The method is illustrated through the analysis of the variation in the prevalence of Loa loa among a sample of village residents in Cameroon, where the explanatory variables included elevation, together with maximum normalised-difference vegetation index and the standard deviation of normalised-difference vegetation index calculated from repeated satellite scans over time. © The Author(s) 2013.
An approach to design interface topologies across interdependent urban infrastructure systems
International Nuclear Information System (INIS)
Ouyang Min; Duenas-Osorio, Leonardo
2011-01-01
This paper proposes an approach to design or retrofit interface topologies to minimize cascading failures across urban infrastructure systems. Four types of interface design strategies are formulated based on maximum network component degree, maximum component betweenness, minimum Euclidean distance across components and component reliability rankings. To compute and compare strategy effectiveness under multiple hazard types, this paper introduces a global annual cascading failure effect (GACFE) metric as well as a GACFE-based cost improvement (GACI) metric. The GACI metric quantifies the improvement of the strategy effectiveness per kilometer increment of interdependent link length (ILL) relative to a reference strategy with minimum ILL. Taking as examples the power and gas transmission systems in Harris County, Texas, USA, optimum interface designs under random and hurricane hazards are discussed. Findings include that the strategy based on reliability rankings minimizes the GACFE metric, and decreases the GACI value relative to a reference practical strategy by 10-15% under different power grid safety margins. Such metrics will contribute to coupled utility system design or retrofit given that current guidelines or recommended practices in the utility industry mostly rely on minimum Euclidean distances and are yet to include interdependent effects in their provisions. - Highlights: → This paper offers interface topology design methods to reduce cascading failures. → Design strategies are judged by performance and cost metrics under multiple hazards. → Reliability-based interfaces globally outperform topological and distance designs. → Only low levels of extra link density and distance are needed for desired designs. → Interface distance relaxation is more effective at yielding maximum performance.
Scalar Green's functions in an Euclidean space with a conical-type line singularity
International Nuclear Information System (INIS)
Guimaraes, M.E.X.; Linet, B.
1994-01-01
In an Euclidean space with a conical-type line singularity, we determine the Green's function for a charged massive scalar field interacting with a magnetic flux running through the line singularity. We give an integral expression of the Green's function and a local form in the neighbourhood of the point source, where it is the sum of the usual Green's function in Euclidean space and a regular term. As an application, we derive the vacuum energy-momentum tensor in the massless case for an arbitrary magnetic flux. (orig.)
Video surveillance using distance maps
Schouten, Theo E.; Kuppens, Harco C.; van den Broek, Egon L.
2006-02-01
Human vigilance is limited; hence, automatic motion and distance detection is one of the central issues in video surveillance. Hereby, many aspects are of importance, this paper specially addresses: efficiency, achieving real-time performance, accuracy, and robustness against various noise factors. To obtain fully controlled test environments, an artificial development center for robot navigation is introduced in which several parameters can be set (e.g., number of objects, trajectories and type and amount of noise). In the videos, for each following frame, movement of stationary objects is detected and pixels of moving objects are located from which moving objects are identified in a robust way. An Exact Euclidean Distance Map (E2DM) is utilized to determine accurately the distances between moving and stationary objects. Together with the determined distances between moving objects and the detected movement of stationary objects, this provides the input for detecting unwanted situations in the scene. Further, each intelligent object (e.g., a robot), is provided with its E2DM, allowing the object to plan its course of action. Timing results are specified for each program block of the processing chain for 20 different setups. So, the current paper presents extensive, experimentally controlled research on real-time, accurate, and robust motion detection for video surveillance, using E2DMs, which makes it a unique approach.
International Nuclear Information System (INIS)
Catoni, Francesco; Cannata, Roberto; Zampetti, Paolo
2005-08-01
The Riemann and Lorentz constant curvature surfaces are investigated from an Euclidean point of view. The four surfaces (constant positive and constant negative curvatures with definite and non-definite fine elements) are represented as surfaces in a Riemannian or in a particular semi-Riemannian flat space and it is shown that the complex and the hyperbolic numbers allow to obtain the same equations for the corresponding Riemann and Lorentz surfaces, respectively. Moreover it is shown that the geodesics on the Lorentz surfaces states, from a physical point of view, a link between curvature and fields. This result is obtained just as a consequence of the space-time geometrical symmetry, without invoking the famous Einstein general relativity postulate [it
On Euclidean connections for su(1,1), suq(1,1) and the algebraic approach to scattering
International Nuclear Information System (INIS)
Ionescu, R.A.
1994-11-01
We obtain a general Euclidean connection for su(1,1) and suq(1,1) algebras. Our Euclidean connection allows an algebraic derivation for the S matrix. These algebraic S matrices reduce to the known ones in suitable circumstances. Also, we obtain a map between su(1,1) and su q (1,1) representations. (author). 8 refs
The Role of Structure in Learning Non-Euclidean Geometry
Asmuth, Jennifer A.
2009-01-01
How do people learn novel mathematical information that contradicts prior knowledge? The focus of this thesis is the role of structure in the acquisition of knowledge about hyperbolic geometry, a non-Euclidean geometry. In a series of three experiments, I contrast a more holistic structure--training based on closed figures--with a mathematically…
DEFF Research Database (Denmark)
Clausen, Kevin Kuhlmann; Clausen, Preben; Hounisen, Jens Peder
2013-01-01
Global Positioning System (GPS) satellite telemetry was used to determine the foraging range, habitat use and minimum flight distances for individual East Atlantic Light-bellied Brent Geese Branta bernicla hrota at two spring staging areas in Denmark. Foraging ranges (mean ± s.d. = 53.0 ± 23.4 km...
Exploring Concepts of Geometry not Euclidean
Directory of Open Access Journals (Sweden)
Luiz Ambrozi
2016-02-01
Full Text Available With this article we intend to propose different situations of teaching and learning, how they can be applied in schools, mediated by the use of concrete materials and Geogebra software, emphasizing the use of technology in the classroom, that this proposal has the role of assisting in the conceptualization and identification of elements of non-Euclidean geometry. In addition, this short course is designed to be a time of current and continuing education for teachers, with activities to be developed with dynamic geometry and based on the theory of Conceptual Fields of Vergnaud.
Broadband invisibility by non-Euclidean cloaking.
Leonhardt, Ulf; Tyc, Tomás
2009-01-02
Invisibility and negative refraction are both applications of transformation optics where the material of a device performs a coordinate transformation for electromagnetic fields. The device creates the illusion that light propagates through empty flat space, whereas in physical space, light is bent around a hidden interior or seems to run backward in space or time. All of the previous proposals for invisibility require materials with extreme properties. Here we show that transformation optics of a curved, non-Euclidean space (such as the surface of a virtual sphere) relax these requirements and can lead to invisibility in a broad band of the spectrum.
Bochner-Riesz means on Euclidean spaces
Lu, Shanzhen
2013-01-01
This book mainly deals with the Bochner-Riesz means of multiple Fourier integral and series on Euclidean spaces. It aims to give a systematical introduction to the fundamental theories of the Bochner-Riesz means and important achievements attained in the last 50 years. For the Bochner-Riesz means of multiple Fourier integral, it includes the Fefferman theorem which negates the Disc multiplier conjecture, the famous Carleson-Sjölin theorem, and Carbery-Rubio de Francia-Vega's work on almost everywhere convergence of the Bochner-Riesz means below the critical index. For the Bochner-Riesz means o
International Nuclear Information System (INIS)
Giampaolo, Salvatore M.; Illuminati, Fabrizio
2007-01-01
We investigate the geometric characterization of pure state bipartite entanglement of (2xD)- and (3xD)-dimensional composite quantum systems. To this aim, we analyze the relationship between states and their images under the action of particular classes of local unitary operations. We find that invariance of states under the action of single-qubit and single-qutrit transformations is a necessary and sufficient condition for separability. We demonstrate that in the (2xD)-dimensional case the von Neumann entropy of entanglement is a monotonic function of the minimum squared Euclidean distance between states and their images over the set of single qubit unitary transformations. Moreover, both in the (2xD)- and in the (3xD)-dimensional cases the minimum squared Euclidean distance exactly coincides with the linear entropy [and thus as well with the tangle measure of entanglement in the (2xD)-dimensional case]. These results provide a geometric characterization of entanglement measures originally established in informational frameworks. Consequences and applications of the formalism to quantum critical phenomena in spin systems are discussed
Energy Technology Data Exchange (ETDEWEB)
Keller, G. (Max-Planck-Institut fuer Physik, Muenchen (Germany). Werner-Heisenberg-Institut); Kopper, C. (Goettingen Univ. (Germany). Inst. fuer Theoretische Physik)
1993-04-01
We give a rigorous and very detailed derivation of the short distance expansion for a product of two arbitrary composite operators in the framework of the perturbative Euclidean massive [Phi][sub 4][sup 4]. The technically almost trivial proof rests on an extension of the differential flow equation method to Green functions with bilocal insertions, for which we also establish a set of generalized Zimmermann identities and Lowenstein rules. (orig.).
Sneath, P. H. A.
A BASIC program is presented for significance tests to determine whether a dendrogram is derived from clustering of points that belong to a single multivariate normal distribution. The significance tests are based on statistics of the Kolmogorov—Smirnov type, obtained by comparing the observed cumulative graph of branch levels with a graph for the hypothesis of multivariate normality. The program also permits testing whether the dendrogram could be from a cluster of lower dimensionality due to character correlations. The program makes provision for three similarity coefficients, (1) Euclidean distances, (2) squared Euclidean distances, and (3) Simple Matching Coefficients, and for five cluster methods (1) WPGMA, (2) UPGMA, (3) Single Linkage (or Minimum Spanning Trees), (4) Complete Linkage, and (5) Ward's Increase in Sums of Squares. The program is entitled DENBRAN.
What does the Euclidean pseudoparticle do in Minkowski space
International Nuclear Information System (INIS)
Ju, I.
1978-08-01
Self dual pseudoparticle solutions for the classical Yang--Mills field equation with finite action have been constructed in Minkowski space. It is shown that the topological structures apparent in Euclidean space are no longer present in Minkowski space. Topological charges become fractional leading to the unquantized axial charge violation in the process involving fermions. 17 references
Effect of Weight Transfer on a Vehicle's Stopping Distance.
Whitmire, Daniel P.; Alleman, Timothy J.
1979-01-01
An analysis of the minimum stopping distance problem is presented taking into account the effect of weight transfer on nonskidding vehicles and front- or rear-wheels-skidding vehicles. Expressions for the minimum stopping distances are given in terms of vehicle geometry and the coefficients of friction. (Author/BB)
Steiner Distance in Graphs--A Survey
Mao, Yaping
2017-01-01
For a connected graph $G$ of order at least $2$ and $S\\subseteq V(G)$, the \\emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. In this paper, we summarize the known results on the Steiner distance parameters, including Steiner distance, Steiner diameter, Steiner center, Steiner median, Steiner interval, Steiner distance hereditary graph, Steiner distance stable graph, average Steiner distance, and Steiner ...
Non-Euclidean geometry and curvature two-dimensional spaces, volume 3
Cannon, James W
2017-01-01
This is the final volume of a three volume collection devoted to the geometry, topology, and curvature of 2-dimensional spaces. The collection provides a guided tour through a wide range of topics by one of the twentieth century's masters of geometric topology. The books are accessible to college and graduate students and provide perspective and insight to mathematicians at all levels who are interested in geometry and topology. Einstein showed how to interpret gravity as the dynamic response to the curvature of space-time. Bill Thurston showed us that non-Euclidean geometries and curvature are essential to the understanding of low-dimensional spaces. This third and final volume aims to give the reader a firm intuitive understanding of these concepts in dimension 2. The volume first demonstrates a number of the most important properties of non-Euclidean geometry by means of simple infinite graphs that approximate that geometry. This is followed by a long chapter taken from lectures the author gave at MSRI, wh...
From Euclidean to Minkowski space with the Cauchy-Riemann equations
International Nuclear Information System (INIS)
Gimeno-Segovia, Mercedes; Llanes-Estrada, Felipe J.
2008-01-01
We present an elementary method to obtain Green's functions in non-perturbative quantum field theory in Minkowski space from Green's functions calculated in Euclidean space. Since in non-perturbative field theory the analytical structure of amplitudes often is unknown, especially in the presence of confined fields, dispersive representations suffer from systematic uncertainties. Therefore, we suggest to use the Cauchy-Riemann equations, which perform the analytical continuation without assuming global information on the function in the entire complex plane, but only in the region through which the equations are solved. We use as example the quark propagator in Landau gauge quantum chromodynamics, which is known from lattice and Dyson-Schwinger studies in Euclidean space. The drawback of the method is the instability of the Cauchy-Riemann equations against high-frequency noise,which makes it difficult to achieve good accuracy. We also point out a few curious details related to the Wick rotation. (orig.)
Micrononcasual Euclidean wave functions
International Nuclear Information System (INIS)
Enatsu, H.; Takenaka, A.; Okazaki, M.
1978-01-01
A theory which describes the internal attributes of hadrons in terms of space-time wave functions is presented. In order to develop the theory on the basis of a rather realistic model, covariant wave equations are first derived for the deuteron, in which the co-ordinates of the centre of mass of two nucleons can be defined unambiguously. Then the micro-noncasual behaviour of virtual mesons mediating between the two nucleons is expressed by means of wave functions depending only on the relative Euclidean co-ordinates with respect to the centre of mass of the two nucleons; the wave functions are assumed to obey the 0 4 and SU 2 x SU 2 groups. The properties of the wave functions under space inversion, time reversal and particle-antiparticle conjugation are investigated. It is found that the internal attributes of the mesons, such as spin, isospin, strangeness, intrinsic parity, charge parity and G-parity are explained consistently. The theory is applicable also to the case of baryons
The toroidal Hausdorff dimension of 2d Euclidean quantum gravity
DEFF Research Database (Denmark)
Ambjorn, Jan; Budd, Timothy George
2013-01-01
The lengths of shortest non-contractible loops are studied numerically in 2d Euclidean quantum gravity on a torus coupled to conformal field theories with central charge less than one. We find that the distribution of these geodesic lengths displays a scaling in agreement with a Hausdorff dimension...
A Low-Complexity Euclidean Orthogonal LDPC Architecture for Low Power Applications.
Revathy, M; Saravanan, R
2015-01-01
Low-density parity-check (LDPC) codes have been implemented in latest digital video broadcasting, broadband wireless access (WiMax), and fourth generation of wireless standards. In this paper, we have proposed a high efficient low-density parity-check code (LDPC) decoder architecture for low power applications. This study also considers the design and analysis of check node and variable node units and Euclidean orthogonal generator in LDPC decoder architecture. The Euclidean orthogonal generator is used to reduce the error rate of the proposed LDPC architecture, which can be incorporated between check and variable node architecture. This proposed decoder design is synthesized on Xilinx 9.2i platform and simulated using Modelsim, which is targeted to 45 nm devices. Synthesis report proves that the proposed architecture greatly reduces the power consumption and hardware utilizations on comparing with different conventional architectures.
A Low-Complexity Euclidean Orthogonal LDPC Architecture for Low Power Applications
Directory of Open Access Journals (Sweden)
M. Revathy
2015-01-01
Full Text Available Low-density parity-check (LDPC codes have been implemented in latest digital video broadcasting, broadband wireless access (WiMax, and fourth generation of wireless standards. In this paper, we have proposed a high efficient low-density parity-check code (LDPC decoder architecture for low power applications. This study also considers the design and analysis of check node and variable node units and Euclidean orthogonal generator in LDPC decoder architecture. The Euclidean orthogonal generator is used to reduce the error rate of the proposed LDPC architecture, which can be incorporated between check and variable node architecture. This proposed decoder design is synthesized on Xilinx 9.2i platform and simulated using Modelsim, which is targeted to 45 nm devices. Synthesis report proves that the proposed architecture greatly reduces the power consumption and hardware utilizations on comparing with different conventional architectures.
Membrane paradigm and entropy of black holes in the Euclidean action approach
International Nuclear Information System (INIS)
Lemos, Jose P. S.; Zaslavskii, Oleg B.
2011-01-01
The membrane paradigm approach to black holes fixes in the vicinity of the event horizon a fictitious surface, the stretched horizon, so that the spacetime outside remains unchanged and the spacetime inside is vacuum. Using this powerful method, several black hole properties have been found and settled, such as the horizon's viscosity, electrical conductivity, resistivity, as well as other properties. On the other hand, the Euclidean action approach to black hole spacetimes has been very fruitful in understanding black hole entropy. Combining both the Euclidean action and membrane paradigm approaches, a direct derivation of the black hole entropy is given. In the derivation, it is considered that the only fields present are the gravitational and matter fields, with no electric field.
Energy Technology Data Exchange (ETDEWEB)
Dai Jian [Theory Group, Department of Physics, Peking University, Beijing (China)]. E-mail: jdai@mail.phy.pku.edu.cn; Song Xingchang [Theory Group, Department of Physics, Peking University, Beijing (China)]. E-mail: songxc@ibm320h.phy.pku.edu.cn
2001-07-13
One of the key ingredients of Connes's noncommutative geometry is a generalized Dirac operator which induces a metric (Connes's distance) on the pure state space. We generalize such a Dirac operator devised by Dimakis et al, whose Connes distance recovers the linear distance on an one-dimensional lattice, to the two-dimensional case. This Dirac operator has the local eigenvalue property and induces a Euclidean distance on this two-dimensional lattice, which is referred to as 'natural'. This kind of Dirac operator can be easily generalized into any higher-dimensional lattices. (author)
Distance-Based Phylogenetic Methods Around a Polytomy.
Davidson, Ruth; Sullivant, Seth
2014-01-01
Distance-based phylogenetic algorithms attempt to solve the NP-hard least-squares phylogeny problem by mapping an arbitrary dissimilarity map representing biological data to a tree metric. The set of all dissimilarity maps is a Euclidean space properly containing the space of all tree metrics as a polyhedral fan. Outputs of distance-based tree reconstruction algorithms such as UPGMA and neighbor-joining are points in the maximal cones in the fan. Tree metrics with polytomies lie at the intersections of maximal cones. A phylogenetic algorithm divides the space of all dissimilarity maps into regions based upon which combinatorial tree is reconstructed by the algorithm. Comparison of phylogenetic methods can be done by comparing the geometry of these regions. We use polyhedral geometry to compare the local nature of the subdivisions induced by least-squares phylogeny, UPGMA, and neighbor-joining when the true tree has a single polytomy with exactly four neighbors. Our results suggest that in some circumstances, UPGMA and neighbor-joining poorly match least-squares phylogeny.
Evaluation of gene-expression clustering via mutual information distance measure
Directory of Open Access Journals (Sweden)
Maimon Oded
2007-03-01
Full Text Available Abstract Background The definition of a distance measure plays a key role in the evaluation of different clustering solutions of gene expression profiles. In this empirical study we compare different clustering solutions when using the Mutual Information (MI measure versus the use of the well known Euclidean distance and Pearson correlation coefficient. Results Relying on several public gene expression datasets, we evaluate the homogeneity and separation scores of different clustering solutions. It was found that the use of the MI measure yields a more significant differentiation among erroneous clustering solutions. The proposed measure was also used to analyze the performance of several known clustering algorithms. A comparative study of these algorithms reveals that their "best solutions" are ranked almost oppositely when using different distance measures, despite the found correspondence between these measures when analysing the averaged scores of groups of solutions. Conclusion In view of the results, further attention should be paid to the selection of a proper distance measure for analyzing the clustering of gene expression data.
Manton, Jonathan H.
2012-01-01
The Newton iteration is a popular method for minimising a cost function on Euclidean space. Various generalisations to cost functions defined on manifolds appear in the literature. In each case, the convergence rate of the generalised Newton iteration needed establishing from first principles. The present paper presents a framework for generalising iterative methods from Euclidean space to manifolds that ensures local convergence rates are preserved. It applies to any (memoryless) iterative m...
On the Convergence and Law of Large Numbers for the Non-Euclidean Lp -Means
Directory of Open Access Journals (Sweden)
George Livadiotis
2017-05-01
Full Text Available This paper describes and proves two important theorems that compose the Law of Large Numbers for the non-Euclidean L p -means, known to be true for the Euclidean L 2 -means: Let the L p -mean estimator, which constitutes the specific functional that estimates the L p -mean of N independent and identically distributed random variables; then, (i the expectation value of the L p -mean estimator equals the mean of the distributions of the random variables; and (ii the limit N → ∞ of the L p -mean estimator also equals the mean of the distributions.
Singular Minkowski and Euclidean solutions for SU(2) Yang-Mills theory
International Nuclear Information System (INIS)
Singleton, D.
1996-01-01
In this paper it is examined a solution to the SU(2) Yang-Mills-Higgs system, which is a trivial mathematical extension of recently discovered Schwarzschild- like solutions (Singleton D., Phys. Rev. D, 51 (1955) 5911). Physically, however, this new solution has drastically different properties from the Schwarzschild-like solutions. It is also studied a new classical solution for Euclidean SU(2) Yang-Mills theory. Again this new solution is a mathematically trivial extension of the Belavin-Polyakov-Schwartz-Tyupkin (BPST) (Belavin A. A. et al., Phys. Lett. B, 59 (1975) 85) instanton, but is physically very different. Unlike the usual instanton solution, the present solution is singular on a sphere of arbitrary radius in Euclidean space. Both of these solutions are infinite-energy solutions, so their practical value is somewhat unclear. However, they may be useful in exploring some of the mathematical aspects of classical Yang-Mills theory
Optimal recovery of linear operators in non-Euclidean metrics
Energy Technology Data Exchange (ETDEWEB)
Osipenko, K Yu [Moscow State Aviation Technological University, Moscow (Russian Federation)
2014-10-31
The paper looks at problems concerning the recovery of operators from noisy information in non-Euclidean metrics. A number of general theorems are proved and applied to recovery problems for functions and their derivatives from the noisy Fourier transform. In some cases, a family of optimal methods is found, from which the methods requiring the least amount of original information are singled out. Bibliography: 25 titles.
Euclidean supergravity and multi-centered solutions
Directory of Open Access Journals (Sweden)
W.A. Sabra
2017-04-01
Full Text Available In ungauged supergravity theories, the no-force condition for BPS states implies the existence of stable static multi-centered solutions. The first solutions to Einstein–Maxwell theory with a positive cosmological constant describing an arbitrary number of charged black holes were found by Kastor and Traschen. Generalisations to five and higher dimensional theories were obtained by London. Multi-centered solutions in gauged supergravity, even with time-dependence allowed, have yet to be constructed. In this letter we construct supersymmetry-preserving multi-centered solutions for the case of D=5, N=2 Euclidean gauged supergravity coupled to an arbitrary number of vector multiplets. Higher dimensional Einstein–Maxwell multi-centered solutions are also presented.
Coupling between minimum scattering antennas
DEFF Research Database (Denmark)
Andersen, J.; Lessow, H; Schjær-Jacobsen, Hans
1974-01-01
Coupling between minimum scattering antennas (MSA's) is investigated by the coupling theory developed by Wasylkiwskyj and Kahn. Only rotationally symmetric power patterns are considered, and graphs of relative mutual impedance are presented as a function of distance and pattern parameters. Crossed...
International Nuclear Information System (INIS)
Dasgupta, I.
1998-01-01
We discuss new bounce-like (but non-time-reversal-invariant) solutions to Euclidean equations of motion, which we dub boomerons. In the Euclidean path integral approach to quantum theories, boomerons make an imaginary contribution to the vacuum energy. The fake vacuum instability can be removed by cancelling boomeron contributions against contributions from time reversed boomerons (anti-boomerons). The cancellation rests on a sign choice whose significance is not completely understood in the path integral method. (orig.)
Euclidean scalar field theory in the bilocal approximation
Nagy, S.; Polonyi, J.; Steib, I.
2018-04-01
The blocking step of the renormalization group method is usually carried out by restricting it to fluctuations and to local blocked action. The tree-level, bilocal saddle point contribution to the blocking, defined by the infinitesimal decrease of the sharp cutoff in momentum space, is followed within the three dimensional Euclidean ϕ6 model in this work. The phase structure is changed, new phases and relevant operators are found, and certain universality classes are restricted by the bilocal saddle point.
Minimum-link paths among obstacles in the plane
Mitchell, J.S.B.; Rote, G.; Woeginger, G.J.
1992-01-01
Given a set of nonintersecting polygonal obstacles in the plane, thelink distance between two pointss andt is the minimum number of edges required to form a polygonal path connectings tot that avoids all obstacles. We present an algorithm that computes the link distance (and a corresponding
Jat, Prahlad; Serre, Marc L
2016-12-01
Widespread contamination of surface water chloride is an emerging environmental concern. Consequently accurate and cost-effective methods are needed to estimate chloride along all river miles of potentially contaminated watersheds. Here we introduce a Bayesian Maximum Entropy (BME) space/time geostatistical estimation framework that uses river distances, and we compare it with Euclidean BME to estimate surface water chloride from 2005 to 2014 in the Gunpowder-Patapsco, Severn, and Patuxent subbasins in Maryland. River BME improves the cross-validation R 2 by 23.67% over Euclidean BME, and river BME maps are significantly different than Euclidean BME maps, indicating that it is important to use river BME maps to assess water quality impairment. The river BME maps of chloride concentration show wide contamination throughout Baltimore and Columbia-Ellicott cities, the disappearance of a clean buffer separating these two large urban areas, and the emergence of multiple localized pockets of contamination in surrounding areas. The number of impaired river miles increased by 0.55% per year in 2005-2009 and by 1.23% per year in 2011-2014, corresponding to a marked acceleration of the rate of impairment. Our results support the need for control measures and increased monitoring of unassessed river miles. Copyright © 2016. Published by Elsevier Ltd.
Ortega, R.; Gutierrez, E.; Carciumaru, D. D.; Huesca-Perez, E.
2017-12-01
We present a method to compute the conditional and no-conditional probability density function (PDF) of the finite fault distance distribution (FFDD). Two cases are described: lines and areas. The case of lines has a simple analytical solution while, in the case of areas, the geometrical probability of a fault based on the strike, dip, and fault segment vertices is obtained using the projection of spheres in a piecewise rectangular surface. The cumulative distribution is computed by measuring the projection of a sphere of radius r in an effective area using an algorithm that estimates the area of a circle within a rectangle. In addition, we introduce the finite fault distance metrics. This distance is the distance where the maximum stress release occurs within the fault plane and generates a peak ground motion. Later, we can apply the appropriate ground motion prediction equations (GMPE) for PSHA. The conditional probability of distance given magnitude is also presented using different scaling laws. A simple model of constant distribution of the centroid at the geometrical mean is discussed, in this model hazard is reduced at the edges because the effective size is reduced. Nowadays there is a trend of using extended source distances in PSHA, however it is not possible to separate the fault geometry from the GMPE. With this new approach, it is possible to add fault rupture models separating geometrical and propagation effects.
An Initialization Method Based on Hybrid Distance for k-Means Algorithm.
Yang, Jie; Ma, Yan; Zhang, Xiangfen; Li, Shunbao; Zhang, Yuping
2017-11-01
The traditional [Formula: see text]-means algorithm has been widely used as a simple and efficient clustering method. However, the performance of this algorithm is highly dependent on the selection of initial cluster centers. Therefore, the method adopted for choosing initial cluster centers is extremely important. In this letter, we redefine the density of points according to the number of its neighbors, as well as the distance between points and their neighbors. In addition, we define a new distance measure that considers both Euclidean distance and density. Based on that, we propose an algorithm for selecting initial cluster centers that can dynamically adjust the weighting parameter. Furthermore, we propose a new internal clustering validation measure, the clustering validation index based on the neighbors (CVN), which can be exploited to select the optimal result among multiple clustering results. Experimental results show that the proposed algorithm outperforms existing initialization methods on real-world data sets and demonstrates the adaptability of the proposed algorithm to data sets with various characteristics.
The non-Euclidean revolution with an introduction by H.S.M. Coxeter
Trudeau, Richard J
2001-01-01
How unique and definitive is Euclidean geometry in describing the "real" space in which we live? Richard Trudeau confronts the fundamental question of truth and its representation through mathematical models in The Non-Euclidean Revolution. First, the author analyzes geometry in its historical and philosophical setting; second, he examines a revolution every bit as significant as the Copernican revolution in astronomy and the Darwinian revolution in biology; third, on the most speculative level, he questions the possibility of absolute knowledge of the world. Trudeau writes in a lively, entertaining, and highly accessible style. His book provides one of the most stimulating and personal presentations of a struggle with the nature of truth in mathematics and the physical world. A portion of the book won the Pólya Prize, a distinguished award from the Mathematical Association of America.
Convergent perturbation expansions for Euclidean quantum field theory
International Nuclear Information System (INIS)
Mack, G.; Pordt, A.
1984-09-01
Mayer perturbation theory is designed to provide computable convergent expansions which permit calculation of Greens functions in Euclidean Quantum Field Theory to arbitrary accuracy, including 'nonperturbative' contributions from large field fluctuations. Here we describe the expansions at the example of 3-dimensional lambdaphi 4 -theory (in continuous space). They are not essentially more complicated than standard perturbation theory. The n-th order term is expressed in terms of 0(n)-dimensional integrals, and is of order lambda 4 if 4k-3<=n<=4k. (orig.)
Cortesi, Nicola; Peña-Angulo, Dhais; Simolo, Claudia; Stepanek, Peter; Brunetti, Michele; Gonzalez-Hidalgo, José Carlos
2014-05-01
One of the key point in the develop of the MOTEDAS dataset (see Poster 1 MOTEDAS) in the framework of the HIDROCAES Project (Impactos Hidrológicos del Calentamiento Global en España, Spanish Ministery of Research CGL2011-27574-C02-01) is the reference series for which no generalized metadata exist. In this poster we present an analysis of spatial variability of monthly minimum and maximum temperatures in the conterminous land of Spain (Iberian Peninsula, IP), by using the Correlation Decay Distance function (CDD), with the aim of evaluating, at sub-regional level, the optimal threshold distance between neighbouring stations for producing the set of reference series used in the quality control (see MOTEDAS Poster 1) and the reconstruction (see MOREDAS Poster 3). The CDD analysis for Tmax and Tmin was performed calculating a correlation matrix at monthly scale between 1981-2010 among monthly mean values of maximum (Tmax) and minimum (Tmin) temperature series (with at least 90% of data), free of anomalous data and homogenized (see MOTEDAS Poster 1), obtained from AEMEt archives (National Spanish Meteorological Agency). Monthly anomalies (difference between data and mean 1981-2010) were used to prevent the dominant effect of annual cycle in the CDD annual estimation. For each station, and time scale, the common variance r2 (using the square of Pearson's correlation coefficient) was calculated between all neighbouring temperature series and the relation between r2 and distance was modelled according to the following equation (1): Log (r2ij) = b*°dij (1) being Log(rij2) the common variance between target (i) and neighbouring series (j), dij the distance between them and b the slope of the ordinary least-squares linear regression model applied taking into account only the surrounding stations within a starting radius of 50 km and with a minimum of 5 stations required. Finally, monthly, seasonal and annual CDD values were interpolated using the Ordinary Kriging with a
ILUCG algorithm which minimizes in the Euclidean norm
International Nuclear Information System (INIS)
Petravic, M.; Kuo-Petravic, G.
1978-07-01
An algroithm is presented which solves sparse systems of linear equations of the form Ax = Y, where A is non-symmetric, by the Incomplete LU Decomposition-Conjugate Gradient (ILUCG) method. The algorithm minimizes the error in the Euclidean norm vertical bar x/sub i/ - x vertical bar 2 , where x/sub i/ is the solution vector after the i/sup th/ iteration and x the exact solution vector. The results of a test on one real problem indicate that the algorithm is likely to be competitive with the best existing algorithms of its type
A strong coupling simulation of Euclidean quantum gravity
International Nuclear Information System (INIS)
Berg, B.; Hamburg Univ.
1984-12-01
Relying on Regge calculus a systematic numerical investigation of models of 4d Euclidean gravity is proposed. The scale a = 1 0 is set by fixing the expectation value of a length. Possible universality of such models is discussed. The strong coupling limit is defined by taking Planck mass msub(p) -> 0 (in units of 1 0 -1 ). The zero order approximation msub(p) = 0 is called 'fluctuating space' and investigated numerically in two 4d models. Canonical dimensions are realized and both models give a negative expectation value for the scalar curvature density. (orig.)
The Minimum Binding Energy and Size of Doubly Muonic D3 Molecule
Eskandari, M. R.; Faghihi, F.; Mahdavi, M.
The minimum energy and size of doubly muonic D3 molecule, which two of the electrons are replaced by the much heavier muons, are calculated by the well-known variational method. The calculations show that the system possesses two minimum positions, one at typically muonic distance and the second at the atomic distance. It is shown that at the muonic distance, the effective charge, zeff is 2.9. We assumed a symmetric planar vibrational model between two minima and an oscillation potential energy is approximated in this region.
Structure functions at small xBj in a Euclidean field theory approach
International Nuclear Information System (INIS)
Hebecker, A.; Meggiolaro, E.; Nachtmann, O.
2000-01-01
The small-x Bj limit of deep inelastic scattering is related to the high-energy limit of the forward Compton amplitude in a familiar way. We show that the analytic continuation of this amplitude in the energy variable is calculable from a matrix element in Euclidean field theory. This matrix element can be written as a Euclidean functional integral in an effective field theory. Its effective Lagrangian has a simple expression in terms of the original Lagrangian. The functional integral expression obtained can, at least in principle, be evaluated using genuinely non-perturbative methods, e.g., on the lattice. Thus, a fundamentally new approach to the long-standing problem of structure functions at very small x Bj seems possible. We give arguments that the limit x Bj →0 corresponds to a critical point of the effective field theory where the correlation length becomes infinite in one direction
The data singular and the data isotropic loci for affine cones
Horobet, E.
2015-01-01
The generic number of critical points of the Euclidean distance function from a data point to a variety is called the Euclidean distance degree. The two special loci of the data points where the number of critical points is smaller then the ED degree are called the Euclidean Distance Data Singular
Visual Analytics for Exploration of a High-Dimensional Structure
2013-04-01
5 Figure 3. Comparison of Euclidean vs. geodesic distance. LDRs use ...manifold, whereas an LDR fails. ...........................6 Figure 4. WEKA GUI for data mining HDD using FRFS-ACO...of Euclidean vs. geodesic distance. LDRs use metrics based on the Euclidean distance between two points, while the NLDRs are based on geodesic
Usability Evaluation of an Augmented Reality System for Teaching Euclidean Vectors
Martin-Gonzalez, Anabel; Chi-Poot, Angel; Uc-Cetina, Victor
2016-01-01
Augmented reality (AR) is one of the emerging technologies that has demonstrated to be an efficient technological tool to enhance learning techniques. In this paper, we describe the development and evaluation of an AR system for teaching Euclidean vectors in physics and mathematics. The goal of this pedagogical tool is to facilitate user's…
Loci of points in the Euclidean plane are deter- mined from ...
Indian Academy of Sciences (India)
Loci of points in the Euclidean plane are deter- mined from prescribed relations of the points with given points, and/or, lines. The depen- dence of these relations on parameters lead to the differential equations representing the fam- ily of loci under concern. Incidentally most of the differential equations thus obtained are non ...
The data singular and the data isotropic loci for affine cones
Horobet, E.
2017-01-01
The generic number of critical points of the Euclidean distance function from a data point to a variety is called the Euclidean distance degree (or ED degree). The two special loci of the data points where the number of critical points is smaller than the ED degree are called the Euclidean distance
Euclidean mirrors. Enhanced vacuum decay from reflected instantons
Energy Technology Data Exchange (ETDEWEB)
Akal, Ibrahim [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany). Theory Group; Moortgat-Pick, Gudrid [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik
2017-06-15
We study the tunneling of virtual matter-antimatter pairs from the quantum vacuum in the presence of a spatially uniform temporal electric background composed of of a strong slow field superimposed with a weak rapid field. After analytic continuation to Euclidean spacetime we obtain from the instanton equations two critical points. While one of them is the closing point of the instanton path, the other serves as an Euclidean mirror which reflects and squeezes the instanton. It is this reflection and shrinking which is responsible for an enormous enhancement of the vacuum pair production rate. We discuss how important features of this mechanism can be analysed and understood via such a rotation in the complex plane. Consistent with previous studies, we consider certain examples where we apply weak fields with a distinct pole structure in order to show that the reflection takes place exactly at the poles. We also discuss the effect of possible sub-cycle structures. We extend this reflection picture to fields which have no poles present and illustrate the effective reflections with explicit examples. An additional field strength dependence for the rate occurs in such cases. We analytically compute the characteristic threshold for this mechanism given by the critical combined Keldysh parameter. We discuss significant differences between these two types of fields. For various backgrounds, we present the contributing instantons and perform analytical computations for the corresponding rates treating both fields nonperturbatively. The validity of the results is confirmed by numerical computations. Considering different profiles for the strong field, we also discuss its impact on the critical combined Keldysh parameter.
The G_Newton --> 0 Limit of Euclidean Quantum Gravity
Smolin, Lee
1992-01-01
Using the Ashtekar formulation, it is shown that the G_{Newton} --> 0 limit of Euclidean or complexified general relativity is not a free field theory, but is a theory that describes a linearized self-dual connection propagating on an arbitrary anti-self-dual background. This theory is quantized in the loop representation and, as in the full theory, an infinite dimnensional space of exact solutions to the constraint is found. An inner product is also proposed. The path integral is constructed...
Euclidean Monte Carlo simulation of nuclear interactions
International Nuclear Information System (INIS)
Montvay, Istvan; Bonn Univ.; Urbach, Carsten
2011-05-01
We present an exploratory study of chiral effective theories of nuclei with methods adopted from lattice quantum chromodynamics (QCD). We show that the simulations in the Euclidean path integral approach are feasible and that we can determine the energy of the two nucleon state. By varying the parameters and the simulated volumes phase shifts can be determined in principle and hopefully tuned to their physical values in the future. The physical cut-off of the theory is realised by blocking of the lattice fields. By keeping this physical cut-off fixed in physical units the lattice cut-off can be changed and in this way the lattice artefacts can be eliminated. (orig.)
Variational estimates for the mass gap of SU(2) Euclidean lattice gauge theory
International Nuclear Information System (INIS)
Hari Dass, N.D.
1984-10-01
The purpose of this letter is to report on the progress made in our understanding of series expansions for the masses in lattice gauge theories by the application of variational techniques to the Euclidean SU(2) lattice gauge theory. (Auth.)
Directory of Open Access Journals (Sweden)
Wei Fuwen
2010-07-01
Full Text Available Abstract Background Gene flow maintains genetic diversity within a species and is influenced by individual behavior and the geographical features of the species' habitat. Here, we have characterized the geographical distribution of genetic patterns in giant pandas (Ailuropoda melanoleuca living in four isolated patches of the Xiaoxiangling and Daxiangling Mountains. Three geographic distance definitions were used with the "isolation by distance theory": Euclidean distance (EUD, least-cost path distance (LCD defined by food resources, and LCD defined by habitat suitability. Results A total of 136 genotypes were obtained from 192 fecal samples and one blood sample, corresponding to 53 unique genotypes. Geographical maps plotted at high resolution using smaller neighborhood radius definitions produced large cost distances, because smaller radii include a finer level of detail in considering each pixel. Mantel tests showed that most correlation indices, particularly bamboo resources defined for different sizes of raster cell, were slightly larger than the correlations calculated for the Euclidean distance, with the exception of Patch C. We found that natural barriers might have decreased gene flow between the Xiaoxiangling and Daxiangling regions. Conclusions Landscape features were found to partially influence gene flow in the giant panda population. This result is closely linked to the biological character and behavior of giant pandas because, as bamboo feeders, individuals spend most of their lives eating bamboo or moving within the bamboo forest. Landscape-based genetic analysis suggests that gene flow will be enhanced if the connectivity between currently fragmented bamboo forests is increased.
Edit Distance to Monotonicity in Sliding Windows
DEFF Research Database (Denmark)
Chan, Ho-Leung; Lam, Tak-Wah; Lee, Lap Kei
2011-01-01
Given a stream of items each associated with a numerical value, its edit distance to monotonicity is the minimum number of items to remove so that the remaining items are non-decreasing with respect to the numerical value. The space complexity of estimating the edit distance to monotonicity of a ...
General Nth order integrals of motion in the Euclidean plane
International Nuclear Information System (INIS)
Post, S; Winternitz, P
2015-01-01
The general form of an integral of motion that is a polynomial of order N in the momenta is presented for a Hamiltonian system in two-dimensional Euclidean space. The classical and the quantum cases are treated separately, emphasizing both the similarities and the differences between the two. The main application will be to study Nth order superintegrable systems that allow separation of variables in the Hamilton–Jacobi and Schrödinger equations, respectively. (paper)
A Class of Weingarten Surfaces in Euclidean 3-Space
Directory of Open Access Journals (Sweden)
Yu Fu
2013-01-01
Full Text Available The class of biconservative surfaces in Euclidean 3-space 3 are defined in (Caddeo et al., 2012 by the equation A(grad H=-H grad H for the mean curvature function H and the Weingarten operator A. In this paper, we consider the more general case that surfaces in 3 satisfying A(grad H=kH grad H for some constant k are called generalized bi-conservative surfaces. We show that this class of surfaces are linear Weingarten surfaces. We also give a complete classification of generalized bi-conservative surfaces in 3.
Multi-stability in folded shells: non-Euclidean origami
Evans, Arthur
2015-03-01
Both natural and man-made structures benefit from having multiple mechanically stable states, from the quick snapping motion of hummingbird beaks to micro-textured surfaces with tunable roughness. Rather than discuss special fabrication techniques for creating bi-stability through material anisotropy, in this talk I will present several examples of how folding a structure can modify the energy landscape and thus lead to multiple stable states. Using ideas from origami and differential geometry, I will discuss how deforming a non-Euclidean surface can be done either continuously or discontinuously, and explore the effects that global constraints have on the ultimate stability of the surface.
Euclidean D-branes and higher-dimensional gauge theory
International Nuclear Information System (INIS)
Acharya, B.S.; Figueroa-O'Farrill, J.M.; Spence, B.; O'Loughlin, M.
1997-07-01
We consider euclidean D-branes wrapping around manifolds of exceptional holonomy in dimensions seven and eight. The resulting theory on the D-brane-that is, the dimensional reduction of 10-dimensional supersymmetric Yang-Mills theory-is a cohomological field theory which describes the topology of the moduli space of instantons. The 7-dimensional theory is an N T =2 (or balanced) cohomological theory given by an action potential of Chern-Simons type. As a by-product of this method, we construct a related cohomological field theory which describes the monopole moduli space on a 7-manifold of G 2 holonomy. (author). 22 refs, 3 tabs
Ultrametric Distance in Syntax
Directory of Open Access Journals (Sweden)
Roberts Mark D.
2015-04-01
Full Text Available Phrase structure trees have a hierarchical structure. In many subjects, most notably in taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierarchical phrase trees are subject to a similar analysis, which is much simpler as the branching structure is more readily discernible and switched. The ambiguity of which branching height to choose, is resolved by postulating that branching occurs at the lowest height available. An ultrametric produces a measure of the complexity of sentences: presumably the complexity of sentences increases as a language is acquired so that this can be tested. All ultrametric triangles are equilateral or isosceles. Here it is shown that X̅ structure implies that there are no equilateral triangles. Restricting attention to simple syntax a minimum ultrametric distance between lexical categories is calculated. A matrix constructed from this ultrametric distance is shown to be different than the matrix obtained from features. It is shown that the definition of C-COMMAND can be replaced by an equivalent ultrametric definition. The new definition invokes a minimum distance between nodes and this is more aesthetically satisfying than previous varieties of definitions. From the new definition of C-COMMAND follows a new definition of of the central notion in syntax namely GOVERNMENT.
The Euclidean three-point function in loop and perturbative gravity
International Nuclear Information System (INIS)
Rovelli, Carlo; Zhang Mingyi
2011-01-01
We compute the leading order of the three-point function in loop quantum gravity, using the vertex expansion of the Euclidean version of the new spin foam dynamics, in the region of γ < 1. We find results consistent with Regge calculus in the limit γ → 0, j → ∞. We also compute the tree-level three-point function of perturbative quantum general relativity in position space and discuss the possibility of directly comparing the two results.
A Minimum Spanning Tree Representation of Anime Similarities
Wibowo, Canggih Puspo
2016-01-01
In this work, a new way to represent Japanese animation (anime) is presented. We applied a minimum spanning tree to show the relation between anime. The distance between anime is calculated through three similarity measurements, namely crew, score histogram, and topic similarities. Finally, the centralities are also computed to reveal the most significance anime. The result shows that the minimum spanning tree can be used to determine the similarity anime. Furthermore, by using centralities c...
On the Schroedinger representation of the Euclidean quantum field theory
International Nuclear Information System (INIS)
Semmler, U.
1987-04-01
The theme of the present thesis is the Schroedinger representation of the Euclidean quantum field theory: We define the time development of the quantum field states as functional integral in a novel, mathematically precise way. In the following we discuss the consequences which result from this approach to the Euclidean quantum field theory. Chapter 1 introduces the theory of abstract Wiener spaces which is here proved as suitable mathematical tool for the treatment of the physical problems. In chapter 2 the diffusion theory is formulated in the framework of abstract Wiener spaces. In chapter 3 we define the field functional ψ 5 u, t 7 as functional integral, determine the functional differential equation which ψ satisfies (Schroedinger equation), and summarize the consequences resulting from this. Chapter 4 is dedicated to the attempt to determine the kernel of the time-development operator, by the knowledge of which the time development of each initial state is fixed. In chapter 5 the consequences of the theory presented in chapter 3 and 4 are discussed by means of simple examples. In chapter 6 the renormalization which results for the φ 4 potential from the definition of the functional integral in chapter 3 is calculated up to the first-order perturbation theory, and it is shown that the problems in the Symanzik renormalization procedure can be removed. (orig./HSI) [de
Minimum triplet covers of binary phylogenetic X-trees.
Huber, K T; Moulton, V; Steel, M
2017-12-01
Trees with labelled leaves and with all other vertices of degree three play an important role in systematic biology and other areas of classification. A classical combinatorial result ensures that such trees can be uniquely reconstructed from the distances between the leaves (when the edges are given any strictly positive lengths). Moreover, a linear number of these pairwise distance values suffices to determine both the tree and its edge lengths. A natural set of pairs of leaves is provided by any 'triplet cover' of the tree (based on the fact that each non-leaf vertex is the median vertex of three leaves). In this paper we describe a number of new results concerning triplet covers of minimum size. In particular, we characterize such covers in terms of an associated graph being a 2-tree. Also, we show that minimum triplet covers are 'shellable' and thereby provide a set of pairs for which the inter-leaf distance values will uniquely determine the underlying tree and its associated branch lengths.
Euclidean mirrors: enhanced vacuum decay from reflected instantons
Akal, Ibrahim; Moortgat-Pick, Gudrid
2018-05-01
We study the tunnelling of virtual matter–antimatter pairs from the quantum vacuum in the presence of a spatially uniform, time-dependent electric background composed of a strong, slow field superimposed with a weak, rapid field. After analytic continuation to Euclidean spacetime, we obtain from the instanton equations two critical points. While one of them is the closing point of the instanton path, the other serves as an Euclidean mirror which reflects and squeezes the instanton. It is this reflection and shrinking which is responsible for an enormous enhancement of the vacuum pair production rate. We discuss how important features of two different mechanisms can be analysed and understood via such a rotation in the complex plane. (a) Consistent with previous studies, we first discuss the standard assisted mechanism with a static strong field and certain weak fields with a distinct pole structure in order to show that the reflection takes place exactly at the poles. We also discuss the effect of possible sub-cycle structures. We extend this reflection picture then to weak fields which have no poles present and illustrate the effective reflections with explicit examples. An additional field strength dependence for the rate occurs in such cases. We analytically compute the characteristic threshold for the assisted mechanism given by the critical combined Keldysh parameter. We discuss significant differences between these two types of fields. For various backgrounds, we present the contributing instantons and perform analytical computations for the corresponding rates treating both fields nonperturbatively. (b) In addition, we also study the case with a nonstatic strong field which gives rise to the assisted dynamical mechanism. For different strong field profiles we investigate the impact on the critical combined Keldysh parameter. As an explicit example, we analytically compute the rate by employing the exact reflection points. The validity of the predictions
Fault Diagnosis of Supervision and Homogenization Distance Based on Local Linear Embedding Algorithm
Directory of Open Access Journals (Sweden)
Guangbin Wang
2015-01-01
Full Text Available In view of the problems of uneven distribution of reality fault samples and dimension reduction effect of locally linear embedding (LLE algorithm which is easily affected by neighboring points, an improved local linear embedding algorithm of homogenization distance (HLLE is developed. The method makes the overall distribution of sample points tend to be homogenization and reduces the influence of neighboring points using homogenization distance instead of the traditional Euclidean distance. It is helpful to choose effective neighboring points to construct weight matrix for dimension reduction. Because the fault recognition performance improvement of HLLE is limited and unstable, the paper further proposes a new local linear embedding algorithm of supervision and homogenization distance (SHLLE by adding the supervised learning mechanism. On the basis of homogenization distance, supervised learning increases the category information of sample points so that the same category of sample points will be gathered and the heterogeneous category of sample points will be scattered. It effectively improves the performance of fault diagnosis and maintains stability at the same time. A comparison of the methods mentioned above was made by simulation experiment with rotor system fault diagnosis, and the results show that SHLLE algorithm has superior fault recognition performance.
Water quality assessment with hierarchical cluster analysis based on Mahalanobis distance.
Du, Xiangjun; Shao, Fengjing; Wu, Shunyao; Zhang, Hanlin; Xu, Si
2017-07-01
Water quality assessment is crucial for assessment of marine eutrophication, prediction of harmful algal blooms, and environment protection. Previous studies have developed many numeric modeling methods and data driven approaches for water quality assessment. The cluster analysis, an approach widely used for grouping data, has also been employed. However, there are complex correlations between water quality variables, which play important roles in water quality assessment but have always been overlooked. In this paper, we analyze correlations between water quality variables and propose an alternative method for water quality assessment with hierarchical cluster analysis based on Mahalanobis distance. Further, we cluster water quality data collected form coastal water of Bohai Sea and North Yellow Sea of China, and apply clustering results to evaluate its water quality. To evaluate the validity, we also cluster the water quality data with cluster analysis based on Euclidean distance, which are widely adopted by previous studies. The results show that our method is more suitable for water quality assessment with many correlated water quality variables. To our knowledge, it is the first attempt to apply Mahalanobis distance for coastal water quality assessment.
UPGMA and the normalized equidistant minimum evolution problem
Moulton, Vincent; Spillner, Andreas; Wu, Taoyang
2017-01-01
UPGMA (Unweighted Pair Group Method with Arithmetic Mean) is a widely used clustering method. Here we show that UPGMA is a greedy heuristic for the normalized equidistant minimum evolution (NEME) problem, that is, finding a rooted tree that minimizes the minimum evolution score relative to the dissimilarity matrix among all rooted trees with the same leaf-set in which all leaves have the same distance to the root. We prove that the NEME problem is NP-hard. In addition, we present some heurist...
Curvature-driven morphing of non-Euclidean shells
Pezzulla, Matteo; Stoop, Norbert; Jiang, Xin; Holmes, D. P.
2017-05-01
We investigate how thin structures change their shape in response to non-mechanical stimuli that can be interpreted as variations in the structure's natural curvature. Starting from the theory of non-Euclidean plates and shells, we derive an effective model that reduces a three-dimensional stimulus to the natural fundamental forms of the mid-surface of the structure, incorporating expansion, or growth, in the thickness. Then, we apply the model to a variety of thin bodies, from flat plates to spherical shells, obtaining excellent agreement between theory and numerics. We show how cylinders and cones can either bend more or unroll, and eventually snap and rotate. We also study the nearly isometric deformations of a spherical shell and describe how this shape change is ruled by the geometry of a spindle. As the derived results stem from a purely geometrical model, they are general and scalable.
International Nuclear Information System (INIS)
Pordt, A.
1985-10-01
The author describes the Mayer expansion in Euclidean lattice field theory by comparing it with the statistical mechanics of polymer systems. In this connection he discusses the Borel summability and the analyticity of the activities on the lattice. Furthermore the relations between renormalization and the Mayer expansion are considered. (HSI)
Lu, Bin; Yang, Yi; Sharma, Santosh K; Zambare, Prachi; Madane, Mayura A
2014-12-23
A method identifies electric load types of a plurality of different electric loads. The method includes providing a load feature database of a plurality of different electric load types, each of the different electric load types including a first load feature vector having at least four different load features; sensing a voltage signal and a current signal for each of the different electric loads; determining a second load feature vector comprising at least four different load features from the sensed voltage signal and the sensed current signal for a corresponding one of the different electric loads; and identifying by a processor one of the different electric load types by determining a minimum distance of the second load feature vector to the first load feature vector of the different electric load types of the load feature database.
Exact Boson-Fermion Duality on a 3D Euclidean Lattice
Chen, Jing-Yuan; Son, Jun Ho; Wang, Chao; Raghu, S.
2018-01-01
The idea of statistical transmutation plays a crucial role in descriptions of the fractional quantum Hall effect. However, a recently conjectured duality between a critical boson and a massless two-component Dirac fermion extends this notion to gapless systems. This duality sheds light on highly nontrivial problems such as the half-filled Landau level, the superconductor-insulator transition, and surface states of strongly coupled topological insulators. Although this boson-fermion duality has undergone many consistency checks, it has remained unproven. We describe the duality in a nonperturbative fashion using an exact UV mapping of partition functions on a 3D Euclidean lattice.
Safety distance between underground natural gas and water pipeline facilities
International Nuclear Information System (INIS)
Mohsin, R.; Majid, Z.A.; Yusof, M.Z.
2014-01-01
A leaking water pipe bursting high pressure water jet in the soil will create slurry erosion which will eventually erode the adjacent natural gas pipe, thus causing its failure. The standard 300 mm safety distance used to place natural gas pipe away from water pipeline facilities needs to be reviewed to consider accidental damage and provide safety cushion to the natural gas pipe. This paper presents a study on underground natural gas pipeline safety distance via experimental and numerical approaches. The pressure–distance characteristic curve obtained from this experimental study showed that the pressure was inversely proportional to the square of the separation distance. Experimental testing using water-to-water pipeline system environment was used to represent the worst case environment, and could be used as a guide to estimate appropriate safety distance. Dynamic pressures obtained from the experimental measurement and simulation prediction mutually agreed along the high-pressure water jetting path. From the experimental and simulation exercises, zero effect distance for water-to-water medium was obtained at an estimated horizontal distance at a minimum of 1500 mm, while for the water-to-sand medium, the distance was estimated at a minimum of 1200 mm. - Highlights: • Safe separation distance of underground natural gas pipes was determined. • Pressure curve is inversely proportional to separation distance. • Water-to-water system represents the worst case environment. • Measured dynamic pressures mutually agreed with simulation results. • Safe separation distance of more than 1200 mm should be applied
The Bregman Variational Dual-Tree Framework
DEFF Research Database (Denmark)
Amizadeh, Saeed; Thiesson, Bo; Hauskrecht, Milos
2013-01-01
where the Euclidean distance quantifies the similarity. In this paper, we extend the VDT framework beyond the Euclidean distance to more general Bregman divergences that include the Euclidean distance as a special case. By exploiting the properties of the general Bregman divergence, we show how the new....... A significant effort to find more efficient solutions to the problem has been made in the literature. One of the state-of-the-art methods that has been recently introduced is the Variational Dual-Tree (VDT) framework. Despite some of its unique features, VDT is currently restricted only to Euclidean spaces...... framework can maintain all the pivotal features of the VDT framework and yet significantly improve its performance in non-Euclidean domains. We apply the proposed framework to different text categorization problems and demonstrate its benefits over the original VDT....
Directory of Open Access Journals (Sweden)
Atamurat Kuchkarov
2016-01-01
Full Text Available We consider pursuit and evasion differential games of a group of m pursuers and one evader on manifolds with Euclidean metric. The motions of all players are simple, and maximal speeds of all players are equal. If the state of a pursuer coincides with that of the evader at some time, we say that pursuit is completed. We establish that each of the differential games (pursuit or evasion is equivalent to a differential game of m groups of countably many pursuers and one group of countably many evaders in Euclidean space. All the players in any of these groups are controlled by one controlled parameter. We find a condition under which pursuit can be completed, and if this condition is not satisfied, then evasion is possible. We construct strategies for the pursuers in pursuit game which ensure completion the game for a finite time and give a formula for this time. In the case of evasion game, we construct a strategy for the evader.
Biess, Armin
2013-01-01
The study of the kinematic and dynamic features of human arm movements provides insights into the computational strategies underlying human motor control. In this paper a differential geometric approach to movement control is taken by endowing arm configuration space with different non-Euclidean metric structures to study the predictions of the generalized minimum-jerk (MJ) model in the resulting Riemannian manifold for different types of human arm movements. For each metric space the solution of the generalized MJ model is given by reparametrized geodesic paths. This geodesic model is applied to a variety of motor tasks ranging from three-dimensional unconstrained movements of a four degree of freedom arm between pointlike targets to constrained movements where the hand location is confined to a surface (e.g., a sphere) or a curve (e.g., an ellipse). For the latter speed-curvature relations are derived depending on the boundary conditions imposed (periodic or nonperiodic) and the compatibility with the empirical one-third power law is shown. Based on these theoretical studies and recent experimental findings, I argue that geodesics may be an emergent property of the motor system and that the sensorimotor system may shape arm configuration space by learning metric structures through sensorimotor feedback.
Computing the discrete fréchet distance with imprecise input
Ahn, Heekap
2012-02-01
We consider the problem of computing the discrete Frechet distance between two polyg- onal curves when their vertices are imprecise. An imprecise point is given by a region and this point could lie anywhere within this region. By modelling imprecise points as balls in dimension d, we present an algorithm for this problem that returns in time 2 O (d 2)m 2n 2 log 2 (mn) the minimum Frechet distance between two imprecise polygonal curves with n and m vertices, respectively. We give an improved algorithm for the pla- nar case with running time O(mnlog 3 (mn)+(m 2 +n 2) log(mn)). In the d-dimensional orthogonal case, where points are modelled as axis-parallel boxes, and we use the L∞ distance, we give an O(dmnlog(dmn))-time algorithm. We also give effcient O(dmn)-time algorithms to approximate the maximum Frechet distance, as well as the minimum and maximum Frechet distance under translation. These algorithms achieve constant factor approximation ratios in \\ ealistic" settings (such as when the radii of the balls modelling the imprecise points are roughly of the same size). © 2012 World Scientific Publishing Company.
International Nuclear Information System (INIS)
Haba, Z.
1981-01-01
In the usual models of Euclidean field theory the Schwinger functions are moments of a positive measure. In this paper the author discusses the basic properties of the measure μ, i.e. properties of the sample paths of the random field. (Auth.)
DEFF Research Database (Denmark)
Baker, Mariwan; Cooper, David T.; Behrens, Claus F.
2016-01-01
.001). The median of the interobserver COM distance (Euclidean distance for 36 scans) was reduced from 8.5 (C-US) to 6.0mm (A-US). An F-test on the 36 scans showed strong significant differences (p Euclidean interobserver distance when comparing the C-US with the A-US scans. The average...
Design for minimum energy in interstellar communication
Messerschmitt, David G.
2015-02-01
Microwave digital communication at interstellar distances is the foundation of extraterrestrial civilization (SETI and METI) communication of information-bearing signals. Large distances demand large transmitted power and/or large antennas, while the propagation is transparent over a wide bandwidth. Recognizing a fundamental tradeoff, reduced energy delivered to the receiver at the expense of wide bandwidth (the opposite of terrestrial objectives) is advantageous. Wide bandwidth also results in simpler design and implementation, allowing circumvention of dispersion and scattering arising in the interstellar medium and motion effects and obviating any related processing. The minimum energy delivered to the receiver per bit of information is determined by cosmic microwave background alone. By mapping a single bit onto a carrier burst, the Morse code invented for the telegraph in 1836 comes closer to this minimum energy than approaches used in modern terrestrial radio. Rather than the terrestrial approach of adding phases and amplitudes increases information capacity while minimizing bandwidth, adding multiple time-frequency locations for carrier bursts increases capacity while minimizing energy per information bit. The resulting location code is simple and yet can approach the minimum energy as bandwidth is expanded. It is consistent with easy discovery, since carrier bursts are energetic and straightforward modifications to post-detection pattern recognition can identify burst patterns. Time and frequency coherence constraints leading to simple signal discovery are addressed, and observations of the interstellar medium by transmitter and receiver constrain the burst parameters and limit the search scope.
Adesso, Gerardo; Giampaolo, Salvatore M.; Illuminati, Fabrizio
2007-10-01
We present a geometric approach to the characterization of separability and entanglement in pure Gaussian states of an arbitrary number of modes. The analysis is performed adapting to continuous variables a formalism based on single subsystem unitary transformations that has been recently introduced to characterize separability and entanglement in pure states of qubits and qutrits [S. M. Giampaolo and F. Illuminati, Phys. Rev. A 76, 042301 (2007)]. In analogy with the finite-dimensional case, we demonstrate that the 1×M bipartite entanglement of a multimode pure Gaussian state can be quantified by the minimum squared Euclidean distance between the state itself and the set of states obtained by transforming it via suitable local symplectic (unitary) operations. This minimum distance, corresponding to a , uniquely determined, extremal local operation, defines an entanglement monotone equivalent to the entropy of entanglement, and amenable to direct experimental measurement with linear optical schemes.
International Nuclear Information System (INIS)
Adesso, Gerardo; Giampaolo, Salvatore M.; Illuminati, Fabrizio
2007-01-01
We present a geometric approach to the characterization of separability and entanglement in pure Gaussian states of an arbitrary number of modes. The analysis is performed adapting to continuous variables a formalism based on single subsystem unitary transformations that has been recently introduced to characterize separability and entanglement in pure states of qubits and qutrits [S. M. Giampaolo and F. Illuminati, Phys. Rev. A 76, 042301 (2007)]. In analogy with the finite-dimensional case, we demonstrate that the 1xM bipartite entanglement of a multimode pure Gaussian state can be quantified by the minimum squared Euclidean distance between the state itself and the set of states obtained by transforming it via suitable local symplectic (unitary) operations. This minimum distance, corresponding to a, uniquely determined, extremal local operation, defines an entanglement monotone equivalent to the entropy of entanglement, and amenable to direct experimental measurement with linear optical schemes
Maximum hardness and minimum polarizability principles through lattice energies of ionic compounds
International Nuclear Information System (INIS)
Kaya, Savaş; Kaya, Cemal; Islam, Nazmul
2016-01-01
The maximum hardness (MHP) and minimum polarizability (MPP) principles have been analyzed using the relationship among the lattice energies of ionic compounds with their electronegativities, chemical hardnesses and electrophilicities. Lattice energy, electronegativity, chemical hardness and electrophilicity values of ionic compounds considered in the present study have been calculated using new equations derived by some of the authors in recent years. For 4 simple reactions, the changes of the hardness (Δη), polarizability (Δα) and electrophilicity index (Δω) were calculated. It is shown that the maximum hardness principle is obeyed by all chemical reactions but minimum polarizability principles and minimum electrophilicity principle are not valid for all reactions. We also proposed simple methods to compute the percentage of ionic characters and inter nuclear distances of ionic compounds. Comparative studies with experimental sets of data reveal that the proposed methods of computation of the percentage of ionic characters and inter nuclear distances of ionic compounds are valid.
Maximum hardness and minimum polarizability principles through lattice energies of ionic compounds
Energy Technology Data Exchange (ETDEWEB)
Kaya, Savaş, E-mail: savaskaya@cumhuriyet.edu.tr [Department of Chemistry, Faculty of Science, Cumhuriyet University, Sivas 58140 (Turkey); Kaya, Cemal, E-mail: kaya@cumhuriyet.edu.tr [Department of Chemistry, Faculty of Science, Cumhuriyet University, Sivas 58140 (Turkey); Islam, Nazmul, E-mail: nazmul.islam786@gmail.com [Theoretical and Computational Chemistry Research Laboratory, Department of Basic Science and Humanities/Chemistry Techno Global-Balurghat, Balurghat, D. Dinajpur 733103 (India)
2016-03-15
The maximum hardness (MHP) and minimum polarizability (MPP) principles have been analyzed using the relationship among the lattice energies of ionic compounds with their electronegativities, chemical hardnesses and electrophilicities. Lattice energy, electronegativity, chemical hardness and electrophilicity values of ionic compounds considered in the present study have been calculated using new equations derived by some of the authors in recent years. For 4 simple reactions, the changes of the hardness (Δη), polarizability (Δα) and electrophilicity index (Δω) were calculated. It is shown that the maximum hardness principle is obeyed by all chemical reactions but minimum polarizability principles and minimum electrophilicity principle are not valid for all reactions. We also proposed simple methods to compute the percentage of ionic characters and inter nuclear distances of ionic compounds. Comparative studies with experimental sets of data reveal that the proposed methods of computation of the percentage of ionic characters and inter nuclear distances of ionic compounds are valid.
Rooij, van I.; Stege, U.; Schactman, A.
2003-01-01
Recently there has been growing interest among psychologists in human performance on the Euclidean traveling salesperson problem (E-TSP). A debate has been initiated on what strategy people use in solving visually presented E-TSP instances. The most prominent hypothesis is the convex-hull
Characterizations of Space Curves According to Bishop Darboux Vector in Euclidean 3-Space E3
Huseyin KOCAYIGIT; Ali OZDEMIR
2014-01-01
In this paper, we obtained some characterizations of space curves according to Bihop frame in Euclidean 3-space E3 by using Laplacian operator and Levi-Civita connection. Furthermore, we gave the general differential equations which characterize the space curves according to the Bishop Darboux vector and the normal Bishop Darboux vector.
Minimum wakefield achievable by waveguide damped cavity
International Nuclear Information System (INIS)
Lin, X.E.; Kroll, N.M.
1995-01-01
The authors use an equivalent circuit to model a waveguide damped cavity. Both exponentially damped and persistent (decay t -3/2 ) components of the wakefield are derived from this model. The result shows that for a cavity with resonant frequency a fixed interval above waveguide cutoff, the persistent wakefield amplitude is inversely proportional to the external Q value of the damped mode. The competition of the two terms results in an optimal Q value, which gives a minimum wakefield as a function of the distance behind the source particle. The minimum wakefield increases when the resonant frequency approaches the waveguide cutoff. The results agree very well with computer simulation on a real cavity-waveguide system
Ho, Jeff C; Russel, Kory C; Davis, Jennifer
2014-03-01
Support is growing for the incorporation of fetching time and/or distance considerations in the definition of access to improved water supply used for global monitoring. Current efforts typically rely on self-reported distance and/or travel time data that have been shown to be unreliable. To date, however, there has been no head-to-head comparison of such indicators with other possible distance/time metrics. This study provides such a comparison. We examine the association between both straight-line distance and self-reported one-way travel time with measured route distances to water sources for 1,103 households in Nampula province, Mozambique. We find straight-line, or Euclidean, distance to be a good proxy for route distance (R(2) = 0.98), while self-reported travel time is a poor proxy (R(2) = 0.12). We also apply a variety of time- and distance-based indicators proposed in the literature to our sample data, finding that the share of households classified as having versus lacking access would differ by more than 70 percentage points depending on the particular indicator employed. This work highlights the importance of the ongoing debate regarding valid, reliable, and feasible strategies for monitoring progress in the provision of improved water supply services.
On the short distance behavior of string theories
International Nuclear Information System (INIS)
Guida, R.; Konishi, K.; Provero, P.
1991-01-01
Short distance behavior of string theories is investigated by the use of the discretized path-integral formulation. In particular, the minimum physical length and the generalized uncertainty relation are re-derived from a set of Ward-Takahashi identities. In this paper several issues related to the form of the generalized uncertainty relation and to its implications are discussed. A consistent qualitative picture of short distance behavior of string theory seems to emerge from such a study
Vera, José Fernando; de Rooij, Mark; Heiser, Willem J
2014-11-01
In this paper we propose a latent class distance association model for clustering in the predictor space of large contingency tables with a categorical response variable. The rows of such a table are characterized as profiles of a set of explanatory variables, while the columns represent a single outcome variable. In many cases such tables are sparse, with many zero entries, which makes traditional models problematic. By clustering the row profiles into a few specific classes and representing these together with the categories of the response variable in a low-dimensional Euclidean space using a distance association model, a parsimonious prediction model can be obtained. A generalized EM algorithm is proposed to estimate the model parameters and the adjusted Bayesian information criterion statistic is employed to test the number of mixture components and the dimensionality of the representation. An empirical example highlighting the advantages of the new approach and comparing it with traditional approaches is presented. © 2014 The British Psychological Society.
Using BMDP and SPSS for a Q factor analysis.
Tanner, B A; Koning, S M
1980-12-01
While Euclidean distances and Q factor analysis may sometimes be preferred to correlation coefficients and cluster analysis for developing a typology, commercially available software does not always facilitate their use. Commands are provided for using BMDP and SPSS in a Q factor analysis with Euclidean distances.
Geometry through history Euclidean, hyperbolic, and projective geometries
Dillon, Meighan I
2018-01-01
Presented as an engaging discourse, this textbook invites readers to delve into the historical origins and uses of geometry. The narrative traces the influence of Euclid’s system of geometry, as developed in his classic text The Elements, through the Arabic period, the modern era in the West, and up to twentieth century mathematics. Axioms and proof methods used by mathematicians from those periods are explored alongside the problems in Euclidean geometry that lead to their work. Students cultivate skills applicable to much of modern mathematics through sections that integrate concepts like projective and hyperbolic geometry with representative proof-based exercises. For its sophisticated account of ancient to modern geometries, this text assumes only a year of college mathematics as it builds towards its conclusion with algebraic curves and quaternions. Euclid’s work has affected geometry for thousands of years, so this text has something to offer to anyone who wants to broaden their appreciation for the...
Defects and boundary layers in non-Euclidean plates
International Nuclear Information System (INIS)
Gemmer, J A; Venkataramani, S C
2012-01-01
We investigate the behaviour of non-Euclidean plates with constant negative Gaussian curvature using the Föppl–von Kármán reduced theory of elasticity. Motivated by recent experimental results, we focus on annuli with a periodic profile. We prove rigorous upper and lower bounds for the elastic energy that scales like the thickness squared. In particular we show that are only two types of global minimizers—deformations that remain flat and saddle shaped deformations with isolated regions of stretching near the edge of the annulus. We also show that there exist local minimizers with a periodic profile that have additional boundary layers near their lines of inflection. These additional boundary layers are a new phenomenon in thin elastic sheets and are necessary to regularize jump discontinuities in the azimuthal curvature across lines of inflection. We rigorously derive scaling laws for the width of these boundary layers as a function of the thickness of the sheet. (paper)
Logical and Geometrical Distance in Polyhedral Aristotelian Diagrams in Knowledge Representation
Directory of Open Access Journals (Sweden)
Lorenz Demey
2017-09-01
Full Text Available Aristotelian diagrams visualize the logical relations among a finite set of objects. These diagrams originated in philosophy, but recently, they have also been used extensively in artificial intelligence, in order to study (connections between various knowledge representation formalisms. In this paper, we develop the idea that Aristotelian diagrams can be fruitfully studied as geometrical entities. In particular, we focus on four polyhedral Aristotelian diagrams for the Boolean algebra B 4 , viz. the rhombic dodecahedron, the tetrakis hexahedron, the tetraicosahedron and the nested tetrahedron. After an in-depth investigation of the geometrical properties and interrelationships of these polyhedral diagrams, we analyze the correlation (or lack thereof between logical (Hamming and geometrical (Euclidean distance in each of these diagrams. The outcome of this analysis is that the Aristotelian rhombic dodecahedron and tetrakis hexahedron exhibit the strongest degree of correlation between logical and geometrical distance; the tetraicosahedron performs worse; and the nested tetrahedron has the lowest degree of correlation. Finally, these results are used to shed new light on the relative strengths and weaknesses of these polyhedral Aristotelian diagrams, by appealing to the congruence principle from cognitive research on diagram design.
Vempala, Santosh S
2005-01-01
Random projection is a simple geometric technique for reducing the dimensionality of a set of points in Euclidean space while preserving pairwise distances approximately. The technique plays a key role in several breakthrough developments in the field of algorithms. In other cases, it provides elegant alternative proofs. The book begins with an elementary description of the technique and its basic properties. Then it develops the method in the context of applications, which are divided into three groups. The first group consists of combinatorial optimization problems such as maxcut, graph coloring, minimum multicut, graph bandwidth and VLSI layout. Presented in this context is the theory of Euclidean embeddings of graphs. The next group is machine learning problems, specifically, learning intersections of halfspaces and learning large margin hypotheses. The projection method is further refined for the latter application. The last set consists of problems inspired by information retrieval, namely, nearest neig...
Fast Tree: Computing Large Minimum-Evolution Trees with Profiles instead of a Distance Matrix
Energy Technology Data Exchange (ETDEWEB)
N. Price, Morgan; S. Dehal, Paramvir; P. Arkin, Adam
2009-07-31
Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability. Instead of storing a distance matrix, FastTree stores sequence profiles of internal nodes in the tree. FastTree uses these profiles to implement neighbor-joining and uses heuristics to quickly identify candidate joins. FastTree then uses nearest-neighbor interchanges to reduce the length of the tree. For an alignment with N sequences, L sites, and a different characters, a distance matrix requires O(N^2) space and O(N^2 L) time, but FastTree requires just O( NLa + N sqrt(N) ) memory and O( N sqrt(N) log(N) L a ) time. To estimate the tree's reliability, FastTree uses local bootstrapping, which gives another 100-fold speedup over a distance matrix. For example, FastTree computed a tree and support values for 158,022 distinct 16S ribosomal RNAs in 17 hours and 2.4 gigabytes of memory. Just computing pairwise Jukes-Cantor distances and storing them, without inferring a tree or bootstrapping, would require 17 hours and 50 gigabytes of memory. In simulations, FastTree was slightly more accurate than neighbor joining, BIONJ, or FastME; on genuine alignments, FastTree's topologies had higher likelihoods. FastTree is available at http://microbesonline.org/fasttree.
Hadronic vacuum polarization in QCD and its evaluation in Euclidean spacetime
de Rafael, Eduardo
2017-07-01
We discuss a new technique to evaluate integrals of QCD Green's functions in the Euclidean based on their Mellin-Barnes representation. We present as a first application the evaluation of the lowest order hadronic vacuum polarization (HVP) contribution to the anomalous magnetic moment of the muon 1/2 (gμ-2 )HVP≡aμHVP . It is shown that with a precise determination of the slope and curvature of the HVP function at the origin from lattice QCD (LQCD), one can already obtain a result for aμHVP which may serve as a test of the determinations based on experimental measurements of the e+e- annihilation cross section into hadrons.
Supersymmetry on a euclidean spacetime lattice 1. A target theory with four supercharges
International Nuclear Information System (INIS)
Cohen, Andrew G.; Kaplan, David B.; Katz, Emanuel; Uensal, Mithat
2003-01-01
We formulate a euclidean spacetime lattice whose continuum limit is (2,2) supersymmetric Yang-Mills theory in two dimensions, a theory which possesses four supercharges and an anomalous global chiral symmetry. The lattice action respects one exact supersymmetry, which allows the target theory to emerge in the continuum limit without fine-tuning. Our method exploits an orbifold construction described previously for spatial lattices in Minkowski space, and can be generalized to more complicated theories with additional supersymmetry and more spacetime dimensions. (author)
International Nuclear Information System (INIS)
Masurowski, Frank; Drechsler, Martin; Frank, Karin
2016-01-01
Setting a minimum distance between wind turbines and settlements is an important policy to mitigate the conflict between renewable energy production and the well-being of residents. We present a novel approach to assess the impact of varying minimum distances on the wind energy potential of a region, state or country. We show that this impact can be predicted from the spatial structure of the settlements. Applying this approach to Germany, we identify those regions where the energy potential very sensitively reacts to a change in the minimum distance. In relative terms the reduction of the energy potential is maximal in the north-west and the south-east of Germany. In absolute terms it is maximal in the north. This information helps deciding in which regions the minimum distance may be increased without large losses in the energy potential. - Highlights: • Distance between wind turbines and settlements is an important policy criterion. • We predict the impact of varying the distance on the regional energy potential. • The impact can be explained from the settlement structure. • The impact varies by region and German Federal state.
Solar wind and coronal structure near sunspot minimum: Pioneer and SMM observations from 1985-1987
International Nuclear Information System (INIS)
Mihalov, J.D.; Barnes, A.; Hundhausen, A.J.; Smith, E.J.
1990-01-01
The solar wind speeds observed in the outer heliosphere (20 to 40 AU heliocentric distance, approximately) by Pioneers 10 an 11, and at a heliocentric distance of 0.7 AU by the Pioneer Venus spacecraft, reveal a complex set of changes in the years near the recent sunspot minimum, 1985-1987. The pattern of recurrent solar wind streams, the long-term average speed, and the sector polarity of the interplanetary magnetic field all changed in a manner suggesting both a temporal variation, and a changing dependence on heliographic latitude. Coronal observations made from the Solar Maximum Mission spacecraft during the same epoch show a systematic variation in coronal structure and (by implication) the magnetic structure imposed on the expanding solar wind. These observations suggest interpretation of the solar wind speed variations in terms of the familiar model where the speed increases with distance from a nearly flat interplanetary current sheet (or with heliomagnetic latitude), and where this current sheet becomes aligned with the solar equatorial plane as sunspot minimum approaches, but deviates rapidly from that orientation after minimum. The authors confirm here that this basic organization of the solar wind speed persists in the outer heliosphere with an orientation of the neutral sheet consistent with that inferred at a heliocentric distance of a few solar radii, from the coronal observations
Equivalence Testing of Complex Particle Size Distribution Profiles Based on Earth Mover's Distance.
Hu, Meng; Jiang, Xiaohui; Absar, Mohammad; Choi, Stephanie; Kozak, Darby; Shen, Meiyu; Weng, Yu-Ting; Zhao, Liang; Lionberger, Robert
2018-04-12
Particle size distribution (PSD) is an important property of particulates in drug products. In the evaluation of generic drug products formulated as suspensions, emulsions, and liposomes, the PSD comparisons between a test product and the branded product can provide useful information regarding in vitro and in vivo performance. Historically, the FDA has recommended the population bioequivalence (PBE) statistical approach to compare the PSD descriptors D50 and SPAN from test and reference products to support product equivalence. In this study, the earth mover's distance (EMD) is proposed as a new metric for comparing PSD particularly when the PSD profile exhibits complex distribution (e.g., multiple peaks) that is not accurately described by the D50 and SPAN descriptor. EMD is a statistical metric that measures the discrepancy (distance) between size distribution profiles without a prior assumption of the distribution. PBE is then adopted to perform statistical test to establish equivalence based on the calculated EMD distances. Simulations show that proposed EMD-based approach is effective in comparing test and reference profiles for equivalence testing and is superior compared to commonly used distance measures, e.g., Euclidean and Kolmogorov-Smirnov distances. The proposed approach was demonstrated by evaluating equivalence of cyclosporine ophthalmic emulsion PSDs that were manufactured under different conditions. Our results show that proposed approach can effectively pass an equivalent product (e.g., reference product against itself) and reject an inequivalent product (e.g., reference product against negative control), thus suggesting its usefulness in supporting bioequivalence determination of a test product to the reference product which both possess multimodal PSDs.
Green's functions in Bianchi type-I spaces. Relation between Minkowski and Euclidean approaches
International Nuclear Information System (INIS)
Bukhbinder, I.L.; Kirillova, E.N.
1988-01-01
A theory is considered for a free scalar field with a conformal connection in a curved space-time with a Bianchi type-I metric. A representation is obtained for the Green's function G∼ in in in the form of an integral of a Schwinger-DeWitt kernel along a contour in a plane of complex-valued proper time. It is shown how as transition may be accomplished from Green's functions in space with the Euclidean signature to Green's functions in space with Minkowski signature and vice versa
Using P-Stat, BMDP and SPSS for a cross-products factor analysis.
Tanner, B A; Leiman, J M
1983-06-01
The major disadvantage of the Q factor analysis with Euclidean distances described by Tanner and Koning [Comput. Progr. Biomed. 12 (1980) 201-202] is the considerable editing required. An alternative procedure with commercially distributed software, and with cross-products in place of Euclidean distances is described. This procedure does not require any editing.
Constraint algebra in Smolin's G →0 limit of 4D Euclidean gravity
Varadarajan, Madhavan
2018-05-01
Smolin's generally covariant GNewton→0 limit of 4d Euclidean gravity is a useful toy model for the study of the constraint algebra in loop quantum gravity (LQG). In particular, the commutator between its Hamiltonian constraints has a metric dependent structure function. While a prior LQG-like construction of nontrivial anomaly free constraint commutators for the model exists, that work suffers from two defects. First, Smolin's remarks on the inability of the quantum dynamics to generate propagation effects apply. Second, the construction only yields the action of a single Hamiltonian constraint together with the action of its commutator through a continuum limit of corresponding discrete approximants; the continuum limit of a product of two or more constraints does not exist. Here, we incorporate changes in the quantum dynamics through structural modifications in the choice of discrete approximants to the quantum Hamiltonian constraint. The new structure is motivated by that responsible for propagation in an LQG-like quantization of paramatrized field theory and significantly alters the space of physical states. We study the off shell constraint algebra of the model in the context of these structural changes and show that the continuum limit action of multiple products of Hamiltonian constraints is (a) supported on an appropriate domain of states, (b) yields anomaly free commutators between pairs of Hamiltonian constraints, and (c) is diffeomorphism covariant. Many of our considerations seem robust enough to be applied to the setting of 4d Euclidean gravity.
THE FLUENCE AND DISTANCE DISTRIBUTIONS OF FAST RADIO BURSTS
International Nuclear Information System (INIS)
Vedantham, H. K.; Ravi, V.; Hallinan, G.; Shannon, R. M.
2016-01-01
Fast radio bursts (FRB) are millisecond-duration radio pulses with apparent extragalactic origins. All but two of the FRBs have been discovered using the Parkes dish, which employs multiple beams formed by an array of feed horns on its focal plane. In this paper, we show that (i) the preponderance of multiple-beam detections and (ii) the detection rates for varying dish diameters can be used to infer the index α of the cumulative fluence distribution function (the log N –log F function: α = 1.5 for a non-evolving population in a Euclidean universe). If all detected FRBs arise from a single progenitor population, multiple-beam FRB detection rates from the Parkes telescope yield the constraint 0.52 < α < 1.0 with 90% confidence. Searches at other facilities with different dish sizes refine the constraint to 0.5 < α < 0.9. Our results favor FRB searches with smaller dishes, because for α < 1 the gain in field of view for a smaller dish is more important than the reduction in sensitivity. Further, our results suggest that (i) FRBs are not standard candles, and (ii) the distribution of distances to the detected FRBs is weighted toward larger distances. If FRBs are extragalactic, these results are consistent with a cosmological population, which would make FRBs excellent probes of the baryonic content and geometry of the universe.
Constant curvature black holes in Einstein AdS gravity: Euclidean action and thermodynamics
Guilleminot, Pablo; Olea, Rodrigo; Petrov, Alexander N.
2018-03-01
We compute the Euclidean action for constant curvature black holes (CCBHs), as an attempt to associate thermodynamic quantities to these solutions of Einstein anti-de Sitter (AdS) gravity. CCBHs are gravitational configurations obtained by identifications along isometries of a D -dimensional globally AdS space, such that the Riemann tensor remains constant. Here, these solutions are interpreted as extended objects, which contain a (D -2 )-dimensional de-Sitter brane as a subspace. Nevertheless, the computation of the free energy for these solutions shows that they do not obey standard thermodynamic relations.
Euclidean quantum field theory and the Hawking effect
International Nuclear Information System (INIS)
Lapedes, A.S.
1978-01-01
Complex analytic continuation in a time variable in order to define a Feynman propagator is investigated in a general relativistic context. When external electric fields are present a complex analytic continuation in the electric charge is also introduced. The new Euclidean formalism is checked by reproducing Schwinger's special relativistic result for pair creation by an external, homogenous, electric field, and then applied to the Robinson-Bertotti universe. The Robinson-Bertotti universe, although unphysical, provides an interesting theoretical laboratory in which to investigate quantum effects, much as the unphysical Taub-NUT (Newman-Unti-Tamburino) universe does for purely classical general relativity. A conformally related problem of pair creation by a supercritically charged nucleus is also considered, and a sensible resolution is obtained to this classic problem. The essential mathematical point throughout is the use of the Feynman path-integral form of the propagator to motivate replacing hyperbolic equations by elliptic equations. The unique, bounded solution for the elliptic Green's function is then analytically continued back to physical values to define the Feynman Green's function
Two-stage sparse coding of region covariance via Log-Euclidean kernels to detect saliency.
Zhang, Ying-Ying; Yang, Cai; Zhang, Ping
2017-05-01
In this paper, we present a novel bottom-up saliency detection algorithm from the perspective of covariance matrices on a Riemannian manifold. Each superpixel is described by a region covariance matrix on Riemannian Manifolds. We carry out a two-stage sparse coding scheme via Log-Euclidean kernels to extract salient objects efficiently. In the first stage, given background dictionary on image borders, sparse coding of each region covariance via Log-Euclidean kernels is performed. The reconstruction error on the background dictionary is regarded as the initial saliency of each superpixel. In the second stage, an improvement of the initial result is achieved by calculating reconstruction errors of the superpixels on foreground dictionary, which is extracted from the first stage saliency map. The sparse coding in the second stage is similar to the first stage, but is able to effectively highlight the salient objects uniformly from the background. Finally, three post-processing methods-highlight-inhibition function, context-based saliency weighting, and the graph cut-are adopted to further refine the saliency map. Experiments on four public benchmark datasets show that the proposed algorithm outperforms the state-of-the-art methods in terms of precision, recall and mean absolute error, and demonstrate the robustness and efficiency of the proposed method. Copyright © 2017 Elsevier Ltd. All rights reserved.
Further results on binary convolutional codes with an optimum distance profile
DEFF Research Database (Denmark)
Johannesson, Rolf; Paaske, Erik
1978-01-01
Fixed binary convolutional codes are considered which are simultaneously optimal or near-optimal according to three criteria: namely, distance profiled, free distanced_{ infty}, and minimum number of weightd_{infty}paths. It is shown how the optimum distance profile criterion can be used to limit...... codes. As a counterpart to quick-look-in (QLI) codes which are not "transparent," we introduce rateR = 1/2easy-look-in-transparent (ELIT) codes with a feedforward inverse(1 + D,D). In general, ELIT codes haved_{infty}superior to that of QLI codes....
The Sight Distance Issues with Retrofitted Single-Lane HOV Facilities
Directory of Open Access Journals (Sweden)
Zhongren Wang
2013-06-01
Full Text Available It is well-known that obstruction inside a highway horizontal curve will lead to impaired sight distance. Highway alignment design standards in terms of the minimum horizontal curve radius are specified to allow for adequate stopping sight distance at given design speeds. For a single-lane HOV facility, inside curve obstruction may occur no matter when the facility curves to the left (per travel direction or right. A unique situation that calls for special attention is that the adjacent mixed-flow lane traffic, once queued, may become sight obstruction. Calculations indicated that such obstruction may govern the minimum curve radius design as long as the left shoulder is not less than 0.92 m, when the HOV lane is contiguous to the mixed-flow lanes. Such governance may necessitate design speed reduction, horizontal and cross-section design adjustment, or both.
Computational Analysis of Distance Operators for the Iterative Closest Point Algorithm.
Directory of Open Access Journals (Sweden)
Higinio Mora
Full Text Available The Iterative Closest Point (ICP algorithm is currently one of the most popular methods for rigid registration so that it has become the standard in the Robotics and Computer Vision communities. Many applications take advantage of it to align 2D/3D surfaces due to its popularity and simplicity. Nevertheless, some of its phases present a high computational cost thus rendering impossible some of its applications. In this work, it is proposed an efficient approach for the matching phase of the Iterative Closest Point algorithm. This stage is the main bottleneck of that method so that any efficiency improvement has a great positive impact on the performance of the algorithm. The proposal consists in using low computational cost point-to-point distance metrics instead of classic Euclidean one. The candidates analysed are the Chebyshev and Manhattan distance metrics due to their simpler formulation. The experiments carried out have validated the performance, robustness and quality of the proposal. Different experimental cases and configurations have been set up including a heterogeneous set of 3D figures, several scenarios with partial data and random noise. The results prove that an average speed up of 14% can be obtained while preserving the convergence properties of the algorithm and the quality of the final results.
SLE as a Mating of Trees in Euclidean Geometry
Holden, Nina; Sun, Xin
2018-05-01
The mating of trees approach to Schramm-Loewner evolution (SLE) in the random geometry of Liouville quantum gravity (LQG) has been recently developed by Duplantier et al. (Liouville quantum gravity as a mating of trees, 2014. arXiv:1409.7055). In this paper we consider the mating of trees approach to SLE in Euclidean geometry. Let {η} be a whole-plane space-filling SLE with parameter {κ > 4} , parameterized by Lebesgue measure. The main observable in the mating of trees approach is the contour function, a two-dimensional continuous process describing the evolution of the Minkowski content of the left and right frontier of {η} . We prove regularity properties of the contour function and show that (as in the LQG case) it encodes all the information about the curve {η} . We also prove that the uniform spanning tree on {Z^2} converges to SLE8 in the natural topology associated with the mating of trees approach.
Non-Euclidean Geometry, Nontrivial Topology and Quantum Vacuum Effects
Directory of Open Access Journals (Sweden)
Yurii A. Sitenko
2018-01-01
Full Text Available Space out of a topological defect of the Abrikosov–Nielsen–Olesen (ANO vortex type is locally flat but non-Euclidean. If a spinor field is quantized in such a space, then a variety of quantum effects are induced in the vacuum. On the basis of the continuum model for long-wavelength electronic excitations originating in the tight-binding approximation for the nearest-neighbor interaction of atoms in the crystal lattice, we consider quantum ground-state effects in Dirac materials with two-dimensional monolayer structures warped into nanocones by a disclination; the nonzero size of the disclination is taken into account, and a boundary condition at the edge of the disclination is chosen to ensure self-adjointness of the Dirac–Weyl Hamiltonian operator. We show that the quantum ground-state effects are independent of the disclination size, and we find circumstances in which they are independent of parameters of the boundary condition.
Buckling transition and boundary layer in non-Euclidean plates.
Efrati, Efi; Sharon, Eran; Kupferman, Raz
2009-07-01
Non-Euclidean plates are thin elastic bodies having no stress-free configuration, hence exhibiting residual stresses in the absence of external constraints. These bodies are endowed with a three-dimensional reference metric, which may not necessarily be immersible in physical space. Here, based on a recently developed theory for such bodies, we characterize the transition from flat to buckled equilibrium configurations at a critical value of the plate thickness. Depending on the reference metric, the buckling transition may be either continuous or discontinuous. In the infinitely thin plate limit, under the assumption that a limiting configuration exists, we show that the limit is a configuration that minimizes the bending content, among all configurations with zero stretching content (isometric immersions of the midsurface). For small but finite plate thickness, we show the formation of a boundary layer, whose size scales with the square root of the plate thickness and whose shape is determined by a balance between stretching and bending energies.
Directory of Open Access Journals (Sweden)
Robert M. Yamaleev
2013-01-01
Full Text Available The hyperbolic cosines and sines theorems for the curvilinear triangle bounded by circular arcs of three intersecting circles are formulated and proved by using the general complex calculus. The method is based on a key formula establishing a relationship between exponential function and the cross-ratio. The proofs are carried out on Euclidean plane.
The structure of water around the compressibility minimum
Energy Technology Data Exchange (ETDEWEB)
Skinner, L. B. [X-ray Science Division, Advanced Photon Source, Argonne National Laboratory, Argonne, Illinois 60439 (United States); Mineral Physics Institute, Stony Brook University, Stony Brook, New York, New York 11794-2100 (United States); Benmore, C. J., E-mail: benmore@aps.anl.gov [X-ray Science Division, Advanced Photon Source, Argonne National Laboratory, Argonne, Illinois 60439 (United States); Neuefeind, J. C. [Spallation Neutron Source, Oak Ridge National Laboratory, Oak Ridge, Tennessee 37922 (United States); Parise, J. B. [Mineral Physics Institute, Stony Brook University, Stony Brook, New York, New York 11794-2100 (United States); Department of Geosciences, Stony Brook University, Stony Brook, New York, New York 11794-2100 (United States); Photon Sciences Division, Brookhaven National Laboratory, Upton, New York 11973 (United States)
2014-12-07
Here we present diffraction data that yield the oxygen-oxygen pair distribution function, g{sub OO}(r) over the range 254.2–365.9 K. The running O-O coordination number, which represents the integral of the pair distribution function as a function of radial distance, is found to exhibit an isosbestic point at 3.30(5) Å. The probability of finding an oxygen atom surrounding another oxygen at this distance is therefore shown to be independent of temperature and corresponds to an O-O coordination number of 4.3(2). Moreover, the experimental data also show a continuous transition associated with the second peak position in g{sub OO}(r) concomitant with the compressibility minimum at 319 K.
Phenotypic distance among assai palm’s mother plants (Euterpe oleracea Mart. from Eastern Amazon
Directory of Open Access Journals (Sweden)
Rosemiro Santos Galate
2014-09-01
Full Text Available The açai palm tree (Euterpe oleracea Mart. is native to the Amazonian estuary. Media revelation of the nutraceutical properties of açai palm has resulted in its introduction in the national and international markets, consequently increasing the açai palm crop area in the Amazon. Nevertheless, açai palm cultivation is performed in a rational manner, because of limited product extraction from the native açai palm varieties. The study aimed to conduct a preliminary estimate of genetic variability, parameters, and phenotypic divergence of parent açai palms. Data from 129 parent plants from northeast Pará was collected. Analysis of variance (ANOVA of 22 morphoagronomic traits was performed to estimate the genetic parameters. Divergence was estimated using standardized average euclidean distance by using unweighted pair group method with arithmetic mean (UPGMA and Tocher clustering methods. Significant variance was noted in 77.3% traits (ANOVA, p<0.01 and p<0.05; CVg/CVe ratio indicated that 72.3% traits may present genetic variability for use in breeding programs. The euclidean distance showed EO-070 and EO-072 parent plants (Combu Island as the least divergent, and EO-010 (Belém and EO-018 (Salinópolis as the most divergent. The clustering methods determined ten (Tocher and nine (UPGMA similar groups. The most dissimilar parent plants were EO-035 (Capitão Poço, EO- 109 (Combu Island, EO-019 (Salinópolis, and EO-010 (Belém (Tocher method, whereas even the EO-010 (Belém; EO-011 (São João de Pirabas; EO-017, EO-018, and EO-019 (Salinópolis; EO-062 and EO-109 (Combu Island plants showed dissimilarity. We concluded that the 129 mother plants have high phenotypic variability, indicating the possibility of their use in genetic breeding programs. Further, the divergent parent plants can be used in the production of genotypes with favorable characteristics.
Superintegrability in two-dimensional Euclidean space and associated polynomial solutions
International Nuclear Information System (INIS)
Kalnins, E.G.; Miller, W. Jr; Pogosyan, G.S.
1996-01-01
In this work we examine the basis functions for those classical and quantum mechanical systems in two dimensions which admit separation of variables in at least two coordinate systems. We do this for the corresponding systems defined in Euclidean space and on the two dimensional sphere. We present all of these cases from a unified point of view. In particular, all of the spectral functions that arise via variable separation have their essential features expressed in terms of their zeros. The principal new results are the details of the polynomial base for each of the nonsubgroup base, not just the subgroup cartesian and polar coordinate case, and the details of the structure of the quadratic algebras. We also study the polynomial eigenfunctions in elliptic coordinates of the N-dimensional isotropic quantum oscillator. 28 refs., 1 tab
Cannistraci, Carlo Vittorio; Ravasi, Timothy; Montevecchi, Franco Maria; Ideker, Trey; Alessio, Massimo
2010-09-15
Nonlinear small datasets, which are characterized by low numbers of samples and very high numbers of measures, occur frequently in computational biology, and pose problems in their investigation. Unsupervised hybrid-two-phase (H2P) procedures-specifically dimension reduction (DR), coupled with clustering-provide valuable assistance, not only for unsupervised data classification, but also for visualization of the patterns hidden in high-dimensional feature space. 'Minimum Curvilinearity' (MC) is a principle that-for small datasets-suggests the approximation of curvilinear sample distances in the feature space by pair-wise distances over their minimum spanning tree (MST), and thus avoids the introduction of any tuning parameter. MC is used to design two novel forms of nonlinear machine learning (NML): Minimum Curvilinear embedding (MCE) for DR, and Minimum Curvilinear affinity propagation (MCAP) for clustering. Compared with several other unsupervised and supervised algorithms, MCE and MCAP, whether individually or combined in H2P, overcome the limits of classical approaches. High performance was attained in the visualization and classification of: (i) pain patients (proteomic measurements) in peripheral neuropathy; (ii) human organ tissues (genomic transcription factor measurements) on the basis of their embryological origin. MC provides a valuable framework to estimate nonlinear distances in small datasets. Its extension to large datasets is prefigured for novel NMLs. Classification of neuropathic pain by proteomic profiles offers new insights for future molecular and systems biology characterization of pain. Improvements in tissue embryological classification refine results obtained in an earlier study, and suggest a possible reinterpretation of skin attribution as mesodermal. https://sites.google.com/site/carlovittoriocannistraci/home.
Non-perturbative BRST quantization of Euclidean Yang-Mills theories in Curci-Ferrari gauges
Pereira, A. D.; Sobreiro, R. F.; Sorella, S. P.
2016-10-01
In this paper we address the issue of the non-perturbative quantization of Euclidean Yang-Mills theories in the Curci-Ferrari gauge. In particular, we construct a refined Gribov-Zwanziger action for this gauge, which takes into account the presence of gauge copies as well as the dynamical formation of dimension-two condensates. This action enjoys a non-perturbative BRST symmetry recently proposed in Capri et al. (Phys. Rev. D 92(4), 045039. doi: 10.1103/PhysRevD.92.045039 arXiv:1506.06995 [hep-th], 2015). Finally, we pay attention to the gluon propagator in different space-time dimensions.
Non-perturbative BRST quantization of Euclidean Yang-Mills theories in Curci-Ferrari gauges
International Nuclear Information System (INIS)
Pereira, A.D.; Sobreiro, R.F.; Sorella, S.P.
2016-01-01
In this paper we address the issue of the non-perturbative quantization of Euclidean Yang-Mills theories in the Curci-Ferrari gauge. In particular, we construct a refined Gribov-Zwanziger action for this gauge, which takes into account the presence of gauge copies as well as the dynamical formation of dimension-two condensates. This action enjoys a non-perturbative BRST symmetry recently proposed in Capri et al. (Phys. Rev. D 92(4), 045039. doi:10.1103/PhysRevD.92.045039. arXiv:1506.06995 [hepth], 2015). Finally, we pay attention to the gluon propagator in different space-time dimensions. (orig.)
Non-perturbative BRST quantization of Euclidean Yang-Mills theories in Curci-Ferrari gauges
Energy Technology Data Exchange (ETDEWEB)
Pereira, A.D. [UFF, Universidade Federal Fluminense, Instituto de Fisica, Campus da Praia Vermelha, Niteroi, RJ (Brazil); Max Planck Institute for Gravitational Physics, Albert Einstein Institute, Potsdam (Germany); UERJ, Universidade do Estado do Rio de Janeiro, Departamento de Fisica Teorica, Rio de Janeiro (Brazil); Sobreiro, R.F. [UFF, Universidade Federal Fluminense, Instituto de Fisica, Campus da Praia Vermelha, Niteroi, RJ (Brazil); Sorella, S.P. [UERJ, Universidade do Estado do Rio de Janeiro, Departamento de Fisica Teorica, Rio de Janeiro (Brazil)
2016-10-15
In this paper we address the issue of the non-perturbative quantization of Euclidean Yang-Mills theories in the Curci-Ferrari gauge. In particular, we construct a refined Gribov-Zwanziger action for this gauge, which takes into account the presence of gauge copies as well as the dynamical formation of dimension-two condensates. This action enjoys a non-perturbative BRST symmetry recently proposed in Capri et al. (Phys. Rev. D 92(4), 045039. doi:10.1103/PhysRevD.92.045039. arXiv:1506.06995 [hepth], 2015). Finally, we pay attention to the gluon propagator in different space-time dimensions. (orig.)
Absence of even-integer ζ-function values in Euclidean physical quantities in QCD
Jamin, Matthias; Miravitllas, Ramon
2018-04-01
At order αs4 in perturbative quantum chromodynamics, even-integer ζ-function values are present in Euclidean physical correlation functions like the scalar quark correlation function or the scalar gluonium correlator. We demonstrate that these contributions cancel when the perturbative expansion is expressed in terms of the so-called C-scheme coupling αˆs which has recently been introduced in Ref. [1]. It is furthermore conjectured that a ζ4 term should arise in the Adler function at order αs5 in the MS ‾-scheme, and that this term is expected to disappear in the C-scheme as well.
Safety distance for preventing hot particle ignition of building insulation materials
Jiayun Song; Supan Wang; Haixiang Chen
2014-01-01
Trajectories of flying hot particles were predicted in this work, and the temperatures during the movement were also calculated. Once the particle temperature decreased to the critical temperature for a hot particle to ignite building insulation materials, which was predicted by hot-spot ignition theory, the distance particle traveled was determined as the minimum safety distance for preventing the ignition of building insulation materials by hot particles. The results showed that for sphere ...
Case-Based Reasoning untuk Diagnosis Penyakit Jantung
Directory of Open Access Journals (Sweden)
Eka Wahyudi
2017-01-01
The test results using medical records data validated by expert indicate that the system is able to recognize diseases heart using nearest neighbor similarity method, minskowski distance similarity and euclidean distance similarity correctly respectively of 100%. Using nearest neighbor get accuracy of 86.21%, minkowski 100%, and euclidean 94.83%
Relationship between source-surface distance and patient dose in fluoroscopic X-ray examinations
International Nuclear Information System (INIS)
Suzuki, Shoichi; Asada, Yasuki; Nishi, Kazuta; Mizuno, Emiko; Hara, Natsue; Orito, Takeo; Kamei, Tetsuya; Koga, Sukehiko
2000-01-01
The International Electrotechnical Commission, IEC provided in its standard IEC 60601-1-3 (1994) to prevent the use during radioscopic irradiation of focal spot to skin distances less than 20 cm if the X-RAY EQUIPMENT is specified for RADIOSCOPY during surgery or 30 cm for other specified applications. This standard was reflected in the Japanese Industrial Standard JIS Z 4701-1997, which provided the minimum distance from focal spot to skin to be 30 cm for the use of a fluoroscopic and radiographic table (Under-table type). However, JIS had formerly provided the minimum distance to be 40 cm and so does the current Medical Treatment Law. The draft revision for the Medical Treatment Law currently discussed has consideration to adopt the value 30 cm in accordance with the current JIS. Our research intended to investigate the impact on the entrance surface dose for the change of the focal spot to skin distance from 40 cm to 30 cm. The result was 20-30% increase of the entrance surface dose for the focal spot to skin distance 30 cm. Taking patient exposure dose into account, we need further and more sufficient discussion with this result before adopting this value to the Medical Treatment Law. (author)
A relationship between scalar Green functions on hyperbolic and Euclidean Rindler spaces
International Nuclear Information System (INIS)
Haba, Z
2007-01-01
We derive a formula connecting in any dimension the Green function on the (D + 1)-dimensional Euclidean Rindler space and the one for a minimally coupled scalar field with a mass m in the D-dimensional hyperbolic space. The relation takes a simple form in the momentum space where the Green functions are equal at the momenta (p 0 , p) for Rindler and (m,p-hat) for hyperbolic space with a simple additive relation between the squares of the mass and the momenta. The formula has applications to finite temperature Green functions, Green functions on the cone and on the (compactified) Milne spacetime. Analytic continuations and interacting quantum fields are briefly discussed
Tan, Shan; Zhang, Hao; Zhang, Yongxue; Chen, Wengen; D’Souza, Warren D.; Lu, Wei
2013-01-01
Purpose: A family of fluorine-18 (18F)-fluorodeoxyglucose (18F-FDG) positron-emission tomography (PET) features based on histogram distances is proposed for predicting pathologic tumor response to neoadjuvant chemoradiotherapy (CRT). These features describe the longitudinal change of FDG uptake distribution within a tumor. Methods: Twenty patients with esophageal cancer treated with CRT plus surgery were included in this study. All patients underwent PET/CT scans before (pre-) and after (post-) CRT. The two scans were first rigidly registered, and the original tumor sites were then manually delineated on the pre-PET/CT by an experienced nuclear medicine physician. Two histograms representing the FDG uptake distribution were extracted from the pre- and the registered post-PET images, respectively, both within the delineated tumor. Distances between the two histograms quantify longitudinal changes in FDG uptake distribution resulting from CRT, and thus are potential predictors of tumor response. A total of 19 histogram distances were examined and compared to both traditional PET response measures and Haralick texture features. Receiver operating characteristic analyses and Mann-Whitney U test were performed to assess their predictive ability. Results: Among all tested histogram distances, seven bin-to-bin and seven crossbin distances outperformed traditional PET response measures using maximum standardized uptake value (AUC = 0.70) or total lesion glycolysis (AUC = 0.80). The seven bin-to-bin distances were: L2 distance (AUC = 0.84), χ2 distance (AUC = 0.83), intersection distance (AUC = 0.82), cosine distance (AUC = 0.83), squared Euclidean distance (AUC = 0.83), L1 distance (AUC = 0.82), and Jeffrey distance (AUC = 0.82). The seven crossbin distances were: quadratic-chi distance (AUC = 0.89), earth mover distance (AUC = 0.86), fast earth mover distance (AUC = 0.86), diffusion distance (AUC = 0.88), Kolmogorov-Smirnov distance (AUC = 0.88), quadratic form distance
Cyclic labellings with constraints at two distances
Leese, R; Noble, S D
2004-01-01
Motivated by problems in radio channel assignment, we consider the vertex-labelling of graphs with non-negative integers. The objective is to minimise the span of the labelling, subject to constraints imposed at graph distances one and two. We show that the minimum span is (up to rounding) a piecewise linear function of the constraints, and give a complete specification, together with associated optimal assignments, for trees and cycles.
Cannistraci, Carlo
2010-09-01
Motivation: Nonlinear small datasets, which are characterized by low numbers of samples and very high numbers of measures, occur frequently in computational biology, and pose problems in their investigation. Unsupervised hybrid-two-phase (H2P) procedures-specifically dimension reduction (DR), coupled with clustering-provide valuable assistance, not only for unsupervised data classification, but also for visualization of the patterns hidden in high-dimensional feature space. Methods: \\'Minimum Curvilinearity\\' (MC) is a principle that-for small datasets-suggests the approximation of curvilinear sample distances in the feature space by pair-wise distances over their minimum spanning tree (MST), and thus avoids the introduction of any tuning parameter. MC is used to design two novel forms of nonlinear machine learning (NML): Minimum Curvilinear embedding (MCE) for DR, and Minimum Curvilinear affinity propagation (MCAP) for clustering. Results: Compared with several other unsupervised and supervised algorithms, MCE and MCAP, whether individually or combined in H2P, overcome the limits of classical approaches. High performance was attained in the visualization and classification of: (i) pain patients (proteomic measurements) in peripheral neuropathy; (ii) human organ tissues (genomic transcription factor measurements) on the basis of their embryological origin. Conclusion: MC provides a valuable framework to estimate nonlinear distances in small datasets. Its extension to large datasets is prefigured for novel NMLs. Classification of neuropathic pain by proteomic profiles offers new insights for future molecular and systems biology characterization of pain. Improvements in tissue embryological classification refine results obtained in an earlier study, and suggest a possible reinterpretation of skin attribution as mesodermal. © The Author(s) 2010. Published by Oxford University Press.
Entropy, extremality, euclidean variations, and the equations of motion
Dong, Xi; Lewkowycz, Aitor
2018-01-01
We study the Euclidean gravitational path integral computing the Rényi entropy and analyze its behavior under small variations. We argue that, in Einstein gravity, the extremality condition can be understood from the variational principle at the level of the action, without having to solve explicitly the equations of motion. This set-up is then generalized to arbitrary theories of gravity, where we show that the respective entanglement entropy functional needs to be extremized. We also extend this result to all orders in Newton's constant G N , providing a derivation of quantum extremality. Understanding quantum extremality for mixtures of states provides a generalization of the dual of the boundary modular Hamiltonian which is given by the bulk modular Hamiltonian plus the area operator, evaluated on the so-called modular extremal surface. This gives a bulk prescription for computing the relative entropies to all orders in G N . We also comment on how these ideas can be used to derive an integrated version of the equations of motion, linearized around arbitrary states.
Euclidean supersymmetric solutions with the self-dual Weyl tensor
Directory of Open Access Journals (Sweden)
Masato Nozawa
2017-07-01
Full Text Available We explore the Euclidean supersymmetric solutions admitting the self-dual gauge field in the framework of N=2 minimal gauged supergravity in four dimensions. According to the classification scheme utilizing the spinorial geometry or the bilinears of Killing spinors, the general solution preserves one quarter of supersymmetry and is described by the Przanowski–Tod class with the self-dual Weyl tensor. We demonstrate that there exists an additional Killing spinor, provided the Przanowski–Tod metric admits a Killing vector that commutes with the principal one. The proof proceeds by recasting the metric into another Przanowski–Tod form. This formalism enables us to show that the self-dual Reissner–Nordström–Taub–NUT–AdS metric possesses a second Killing spinor, which has been missed over many years. We also address the supersymmetry when the Przanowski–Tod space is conformal to each of the self-dual ambi-toric Kähler metrics. It turns out that three classes of solutions are all reduced to the self-dual Carter family, by virtue of the nondegenerate Killing–Yano tensor.
International Nuclear Information System (INIS)
Bubelev, E.G.; Kuchin, I.A.
1998-01-01
The necessity of creating mesophysics is motivated on the basis of a general likeness of the description of many phenomena and processes in micro- and macroworld. For a general and detailed investigation of the former in modern high energy physics (HEP), the Absolute (arising from Minkovsky and irrespective of any reference system) universal approach is used. Its two conceptually new branches are non-linear system-dynamic and non-Euclidean evolutionary ones. They are complementary ones and completely adequate to an extreme complexity of directly unobservable HEP objects. Some primary problems of them are briefly made clear on the basis of synergetics principles and HEP's internal Lobachevsky-Euclidean geometry. They are noted as the primary content of the Lobachevsky-Poincare Programme (LPP) the idea of which has been proposed recently for their successive solution
International Nuclear Information System (INIS)
Bhattacharyya, Pratip; Chakrabarti, Bikas K
2008-01-01
We study different ways of determining the mean distance (r n ) between a reference point and its nth neighbour among random points distributed with uniform density in a D-dimensional Euclidean space. First, we present a heuristic method; though this method provides only a crude mathematical result, it shows a simple way of estimating (r n ). Next, we describe two alternative means of deriving the exact expression of (r n ): we review the method using absolute probability and develop an alternative method using conditional probability. Finally, we obtain an approximation to (r n ) from the mean volume between the reference point and its nth neighbour and compare it with the heuristic and exact results
Euler numbers of four-dimensional rotating black holes with the Euclidean signature
International Nuclear Information System (INIS)
Ma Zhengze
2003-01-01
For a black hole's spacetime manifold in the Euclidean signature, its metric is positive definite and therefore a Riemannian manifold. It can be regarded as a gravitational instanton and a topological characteristic which is the Euler number to which it is associated. In this paper we derive a formula for the Euler numbers of four-dimensional rotating black holes by the integral of the Euler density on the spacetime manifolds of black holes. Using this formula, we obtain that the Euler numbers of Kerr and Kerr-Newman black holes are 2. We also obtain that the Euler number of the Kerr-Sen metric in the heterotic string theory with one boost angle nonzero is 2, which is in accordance with its topology
The stochastic versus the Euclidean approach to quantum fields on a static space-time
International Nuclear Information System (INIS)
De Angelis, G.F.; de Falco, D.
1986-01-01
Equations are presented which modify the definition of the Gaussian field in the Rindler chart in order to make contact with the Wightman state, the Hartle-Hawking state, and the Euclidean field. By taking Ornstein-Uhlenbeck processes the authors have chosen, in the sense of stochastic mechanics, to place precisely the Fulling modes in their harmonic oscillator ground state. In this respect, together with the periodicity of Minkowski space-time, the authors observe that the covariance of the Ornstein-Uhlenbeck process can be obtained by analytical continuation of the Wightman function of the harmonic oscillator at zero temperature
Derivatives, forms and vector fields on the κ-deformed Euclidean space
International Nuclear Information System (INIS)
Dimitrijevic, Marija; Moeller, Lutz; Tsouchnika, Efrossini
2004-01-01
The model of κ-deformed space is an interesting example of a noncommutative space, since it allows a deformed symmetry. In this paper, we present new results concerning different sets of derivatives on the coordinate algebra of κ-deformed Euclidean space. We introduce a differential calculus with two interesting sets of one-forms and higher-order forms. The transformation law of vector fields is constructed in accordance with the transformation behaviour of derivatives. The crucial property of the different derivatives, forms and vector fields is that in an n-dimensional spacetime there are always n of them. This is the key difference with respect to conventional approaches, in which the differential calculus is (n + 1)-dimensional. This work shows that derivative-valued quantities such as derivative-valued vector fields appear in a generic way on noncommutative spaces
The distance-decay function of geographical gravity model: Power law or exponential law?
International Nuclear Information System (INIS)
Chen, Yanguang
2015-01-01
Highlights: •The distance-decay exponent of the gravity model is a fractal dimension. •Entropy maximization accounts for the gravity model based on power law decay. •Allometric scaling relations relate gravity models with spatial interaction models. •The four-parameter gravity models have dual mathematical expressions. •The inverse power law is the most probable distance-decay function. -- Abstract: The distance-decay function of the geographical gravity model is originally an inverse power law, which suggests a scaling process in spatial interaction. However, the distance exponent of the model cannot be reasonably explained with the ideas from Euclidean geometry. This results in a dimension dilemma in geographical analysis. Consequently, a negative exponential function was used to replace the inverse power function to serve for a distance-decay function. But a new puzzle arose that the exponential-based gravity model goes against the first law of geography. This paper is devoted for solving these kinds of problems by mathematical reasoning and empirical analysis. New findings are as follows. First, the distance exponent of the gravity model is demonstrated to be a fractal dimension using the geometric measure relation. Second, the similarities and differences between the gravity models and spatial interaction models are revealed using allometric relations. Third, a four-parameter gravity model possesses a symmetrical expression, and we need dual gravity models to describe spatial flows. The observational data of China's cities and regions (29 elements indicative of 841 data points) in 2010 are employed to verify the theoretical inferences. A conclusion can be reached that the geographical gravity model based on power-law decay is more suitable for analyzing large, complex, and scale-free regional and urban systems. This study lends further support to the suggestion that the underlying rationale of fractal structure is entropy maximization. Moreover
Zhang, Ying-Ying; Yang, Cai; Zhang, Ping
2017-08-01
In this paper, we present a novel bottom-up saliency detection algorithm from the perspective of covariance matrices on a Riemannian manifold. Each superpixel is described by a region covariance matrix on Riemannian Manifolds. We carry out a two-stage sparse coding scheme via Log-Euclidean kernels to extract salient objects efficiently. In the first stage, given background dictionary on image borders, sparse coding of each region covariance via Log-Euclidean kernels is performed. The reconstruction error on the background dictionary is regarded as the initial saliency of each superpixel. In the second stage, an improvement of the initial result is achieved by calculating reconstruction errors of the superpixels on foreground dictionary, which is extracted from the first stage saliency map. The sparse coding in the second stage is similar to the first stage, but is able to effectively highlight the salient objects uniformly from the background. Finally, three post-processing methods-highlight-inhibition function, context-based saliency weighting, and the graph cut-are adopted to further refine the saliency map. Experiments on four public benchmark datasets show that the proposed algorithm outperforms the state-of-the-art methods in terms of precision, recall and mean absolute error, and demonstrate the robustness and efficiency of the proposed method. Copyright © 2017 Elsevier Ltd. All rights reserved.
On the Optimal Detection and Error Performance Analysis of the Hardware Impaired Systems
Javed, Sidrah; Amin, Osama; Ikki, Salama S.; Alouini, Mohamed-Slim
2018-01-01
The conventional minimum Euclidean distance (MED) receiver design is based on the assumption of ideal hardware transceivers and proper Gaussian noise in communication systems. Throughout this study, an accurate statistical model of various hardware impairments (HWIs) is presented. Then, an optimal maximum likelihood (ML) receiver is derived considering the distinct characteristics of the HWIs comprised of additive improper Gaussian noise and signal distortion. Next, the average error probability performance of the proposed optimal ML receiver is analyzed and tight bounds are derived. Finally, different numerical and simulation results are presented to support the superiority of the proposed ML receiver over MED receiver and the tightness of the derived bounds.
On the Optimal Detection and Error Performance Analysis of the Hardware Impaired Systems
Javed, Sidrah
2018-01-15
The conventional minimum Euclidean distance (MED) receiver design is based on the assumption of ideal hardware transceivers and proper Gaussian noise in communication systems. Throughout this study, an accurate statistical model of various hardware impairments (HWIs) is presented. Then, an optimal maximum likelihood (ML) receiver is derived considering the distinct characteristics of the HWIs comprised of additive improper Gaussian noise and signal distortion. Next, the average error probability performance of the proposed optimal ML receiver is analyzed and tight bounds are derived. Finally, different numerical and simulation results are presented to support the superiority of the proposed ML receiver over MED receiver and the tightness of the derived bounds.
Yang, Yao Ming; Jia, Ruo; Xun, Hui; Yang, Jie; Chen, Qiang; Zeng, Xiang Guang; Yang, Ming
2018-02-21
Simulium quinquestriatum Shiraki (Diptera: Simuliidae), a human-biting fly that is distributed widely across Asia, is a vector for multiple pathogens. However, the larval development of this species is poorly understood. In this study, we determined the number of instars in this pest using three batches of field-collected larvae from Guiyang, Guizhou, China. The postgenal length, head capsule width, mandibular phragma length, and body length of 773 individuals were measured, and k-means clustering was used for instar grouping. Four distance measures-Manhattan, Euclidean, Chebyshev, and Canberra-were determined. The reported instar numbers, ranging from 4 to 11, were set as initial cluster centers for k-means clustering. The Canberra distance yielded reliable instar grouping, which was consistent with the first instar, as characterized by egg bursters and prepupae with dark histoblasts. Females and males of the last cluster of larvae were identified using Feulgen-stained gonads. Morphometric differences between the two sexes were not significant. Validation was performed using the Brooks-Dyar and Crosby rules, revealing that the larval stage of S. quinquestriatum is composed of eight instars.
Optimal placement of range-only beacons for mobile robot localisation
CSIR Research Space (South Africa)
Burke, Michael G
2011-11-01
Full Text Available of the Euclidean distance between the position estimate (x; y; z) and the largest orthogo- nal standard deviations in 3D space, and is an improvement on the GDOP metric as it considers both off-diagonal covariance terms and individual beacon noise. The beacon... is the Euclidean distance between an accessed node and a goal. This results in the shortest route to a goal being determined. The cost of traversing to a node is typically the distance between nodes. However, by replacing this cost with the uncertainty metric...
Clear evidence of a continuum theory of 4D Euclidean simplicial quantum gravity
International Nuclear Information System (INIS)
Egawa, H.S.; Horata, S.; Yukawa, T.
2002-01-01
Four-dimensional (4D) simplicial quantum gravity coupled to both scalar fields (N X ) and gauge fields (N A ) has been studied using Monte-Carlo simulations. The matter dependence of the string susceptibility exponent γ (4) is estimated. Furthermore, we compare our numerical results with Background-Metric-Independent (BMI) formulation conjectured to describe the quantum field theory of gravity in 4D. The numerical results suggest that the 4D simplicial quantum gravity is related to the conformal gravity in 4D. Therefore, we propose a phase structure in detail with adding both scalar and gauge fields and discuss the possibility and the property of a continuum theory of 4D Euclidean simplicial quantum gravity
Biased discriminant euclidean embedding for content-based image retrieval.
Bian, Wei; Tao, Dacheng
2010-02-01
With many potential multimedia applications, content-based image retrieval (CBIR) has recently gained more attention for image management and web search. A wide variety of relevance feedback (RF) algorithms have been developed in recent years to improve the performance of CBIR systems. These RF algorithms capture user's preferences and bridge the semantic gap. However, there is still a big room to further the RF performance, because the popular RF algorithms ignore the manifold structure of image low-level visual features. In this paper, we propose the biased discriminative Euclidean embedding (BDEE) which parameterises samples in the original high-dimensional ambient space to discover the intrinsic coordinate of image low-level visual features. BDEE precisely models both the intraclass geometry and interclass discrimination and never meets the undersampled problem. To consider unlabelled samples, a manifold regularization-based item is introduced and combined with BDEE to form the semi-supervised BDEE, or semi-BDEE for short. To justify the effectiveness of the proposed BDEE and semi-BDEE, we compare them against the conventional RF algorithms and show a significant improvement in terms of accuracy and stability based on a subset of the Corel image gallery.
Numerical evaluation of tensor Feynman integrals in Euclidean kinematics
Energy Technology Data Exchange (ETDEWEB)
Gluza, J.; Kajda [Silesia Univ., Katowice (Poland). Inst. of Physics; Riemann, T.; Yundin, V. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany)
2010-10-15
For the investigation of higher order Feynman integrals, potentially with tensor structure, it is highly desirable to have numerical methods and automated tools for dedicated, but sufficiently 'simple' numerical approaches. We elaborate two algorithms for this purpose which may be applied in the Euclidean kinematical region and in d=4-2{epsilon} dimensions. One method uses Mellin-Barnes representations for the Feynman parameter representation of multi-loop Feynman integrals with arbitrary tensor rank. Our Mathematica package AMBRE has been extended for that purpose, and together with the packages MB (M. Czakon) or MBresolve (A. V. Smirnov and V. A. Smirnov) one may perform automatically a numerical evaluation of planar tensor Feynman integrals. Alternatively, one may apply sector decomposition to planar and non-planar multi-loop {epsilon}-expanded Feynman integrals with arbitrary tensor rank. We automatized the preparations of Feynman integrals for an immediate application of the package sectordecomposition (C. Bogner and S. Weinzierl) so that one has to give only a proper definition of propagators and numerators. The efficiency of the two implementations, based on Mellin-Barnes representations and sector decompositions, is compared. The computational packages are publicly available. (orig.)
Modified fuzzy c-means applied to a Bragg grating-based spectral imager for material clustering
Rodríguez, Aida; Nieves, Juan Luis; Valero, Eva; Garrote, Estíbaliz; Hernández-Andrés, Javier; Romero, Javier
2012-01-01
We have modified the Fuzzy C-Means algorithm for an application related to segmentation of hyperspectral images. Classical fuzzy c-means algorithm uses Euclidean distance for computing sample membership to each cluster. We have introduced a different distance metric, Spectral Similarity Value (SSV), in order to have a more convenient similarity measure for reflectance information. SSV distance metric considers both magnitude difference (by the use of Euclidean distance) and spectral shape (by the use of Pearson correlation). Experiments confirmed that the introduction of this metric improves the quality of hyperspectral image segmentation, creating spectrally more dense clusters and increasing the number of correctly classified pixels.
Representing distance, consuming distance
DEFF Research Database (Denmark)
Larsen, Gunvor Riber
Title: Representing Distance, Consuming Distance Abstract: Distance is a condition for corporeal and virtual mobilities, for desired and actual travel, but yet it has received relatively little attention as a theoretical entity in its own right. Understandings of and assumptions about distance...... are being consumed in the contemporary society, in the same way as places, media, cultures and status are being consumed (Urry 1995, Featherstone 2007). An exploration of distance and its representations through contemporary consumption theory could expose what role distance plays in forming...
Directory of Open Access Journals (Sweden)
Riva Mylène
2008-02-01
Full Text Available Abstract Background Over the past two decades, geographical accessibility of urban resources for population living in residential areas has received an increased focus in urban health studies. Operationalising and computing geographical accessibility measures depend on a set of four parameters, namely definition of residential areas, a method of aggregation, a measure of accessibility, and a type of distance. Yet, the choice of these parameters may potentially generate different results leading to significant measurement errors. The aim of this paper is to compare discrepancies in results for geographical accessibility of selected health care services for residential areas (i.e. census tracts computed using different distance types and aggregation methods. Results First, the comparison of distance types demonstrates that Cartesian distances (Euclidean and Manhattan distances are strongly correlated with more accurate network distances (shortest network and shortest network time distances across the metropolitan area (Pearson correlation greater than 0.95. However, important local variations in correlation between Cartesian and network distances were observed notably in suburban areas where Cartesian distances were less precise. Second, the choice of the aggregation method is also important: in comparison to the most accurate aggregation method (population-weighted mean of the accessibility measure for census blocks within census tracts, accessibility measures computed from census tract centroids, though not inaccurate, yield important measurement errors for 5% to 10% of census tracts. Conclusion Although errors associated to the choice of distance types and aggregation method are only important for about 10% of census tracts located mainly in suburban areas, we should not avoid using the best estimation method possible for evaluating geographical accessibility. This is especially so if these measures are to be included as a dimension of the
International Nuclear Information System (INIS)
Todinov, M.T.
2004-01-01
A new reliability measure is proposed and equations are derived which determine the probability of existence of a specified set of minimum gaps between random variables following a homogeneous Poisson process in a finite interval. Using the derived equations, a method is proposed for specifying the upper bound of the random variables' number density which guarantees that the probability of clustering of two or more random variables in a finite interval remains below a maximum acceptable level. It is demonstrated that even for moderate number densities the probability of clustering is substantial and should not be neglected in reliability calculations. In the important special case where the random variables are failure times, models have been proposed for determining the upper bound of the hazard rate which guarantees a set of minimum failure-free operating intervals before the random failures, with a specified probability. A model has also been proposed for determining the upper bound of the hazard rate which guarantees a minimum availability target. Using the models proposed, a new strategy, models and reliability tools have been developed for setting quantitative reliability requirements which consist of determining the intersection of the hazard rate envelopes (hazard rate upper bounds) which deliver a minimum failure-free operating period before random failures, a risk of premature failure below a maximum acceptable level and a minimum required availability. It is demonstrated that setting reliability requirements solely based on an availability target does not necessarily mean a low risk of premature failure. Even at a high availability level, the probability of premature failure can be substantial. For industries characterised by a high cost of failure, the reliability requirements should involve a hazard rate envelope limiting the risk of failure below a maximum acceptable level
Lesser, Mark R; Jackson, Stephen T
2013-03-01
Long-distance dispersal is an integral part of plant species migration and population development. We aged and genotyped 1125 individuals in four disjunct populations of Pinus ponderosa that were initially established by long-distance dispersal in the 16th and 17th centuries. Parentage analysis was used to determine if individuals were the product of local reproductive events (two parents present), long-distance pollen dispersal (one parent present) or long-distance seed dispersal (no parents present). All individuals established in the first century at each site were the result of long-distance dispersal. Individuals reproduced at younger ages with increasing age of the overall population. These results suggest Allee effects, where populations were initially unable to expand on their own, and were dependent on long-distance dispersal to overcome a minimum-size threshold. Our results demonstrate that long-distance dispersal was not only necessary for initial colonisation but also to sustain subsequent population growth during early phases of expansion. © 2012 Blackwell Publishing Ltd/CNRS.
Energy Technology Data Exchange (ETDEWEB)
Schutze, Mark K; Krosch, Matthew N; Clarke, Anthony R [CRC for National Plant Biosecurity (Australia); School of Earth, Environmental and Biological Sciences, Queensland University of Technology, Brisbane, QLD (Australia); Armstrong, Karen F; Chapman, Toni A; Englezou, Anna; Hailstones, Deborah [CRC for National Plant Biosecurity (Australia); Cameron, Stephen L [School of Earth, Environmental and Biological Sciences, Queensland University of Technology, Brisbane, QLD (Australia); Chomic, Anastasija
2013-01-15
Background: Bactrocera dorsalis s.s. is a pestiferous tephritid fruit fly distributed from Pakistan to the Pacific, with the Thai/Malay peninsula its southern limit. Sister pest taxa, B. papayae and B. philippinensis, occur in the southeast Asian archipelago and the Philippines, respectively. The relationship among these species is unclear due to their high molecular and morphological similarity. This study analysed population structure of these three species within a southeast Asian biogeographical context to assess potential dispersal patterns and the validity of their current taxonomic status. Results: Geometric morphometric results generated from 15 landmarks for wings of 169 flies revealed significant differences in wing shape between almost all sites following canonical variate analysis. For the combined data set there was a greater isolation-by-distance (IBD) effect under a 'non-Euclidean' scenario which used geographical distances within a biogeographical 'Sundaland context' (r{sup 2} = 0.772, P < 0.0001) as compared to a 'Euclidean' scenario for which direct geographic distances between sample sites was used (r{sup 2} = 0.217, P < 0.01). COI sequence data were obtained for 156 individuals and yielded 83 unique haplotypes with no correlation to current taxonomic designations via a minimum spanning network. BEAST analysis provided a root age and location of 540kya in northern Thailand, with migration of B. dorsalis s.l. into Malaysia 470kya and Sumatra 270kya. Two migration events into the Philippines are inferred. Sequence data revealed a weak but significant IBD effect under the 'non-Euclidean' scenario (r{sup 2} = 0.110, P < 0.05), with no historical migration evident between Taiwan and the Philippines. Results are consistent with those expected at the intra-specific level. Conclusions: Bactrocera dorsalis s.s., B. papayae and B. philippinensis likely represent one species structured around the South China Sea, having migrated from northern Thailand into
Unstable spiral waves and local Euclidean symmetry in a model of cardiac tissue
International Nuclear Information System (INIS)
Marcotte, Christopher D.; Grigoriev, Roman O.
2015-01-01
This paper investigates the properties of unstable single-spiral wave solutions arising in the Karma model of two-dimensional cardiac tissue. In particular, we discuss how such solutions can be computed numerically on domains of arbitrary shape and study how their stability, rotational frequency, and spatial drift depend on the size of the domain as well as the position of the spiral core with respect to the boundaries. We also discuss how the breaking of local Euclidean symmetry due to finite size effects as well as the spatial discretization of the model is reflected in the structure and dynamics of spiral waves. This analysis allows identification of a self-sustaining process responsible for maintaining the state of spiral chaos featuring multiple interacting spirals
Unstable spiral waves and local Euclidean symmetry in a model of cardiac tissue.
Marcotte, Christopher D; Grigoriev, Roman O
2015-06-01
This paper investigates the properties of unstable single-spiral wave solutions arising in the Karma model of two-dimensional cardiac tissue. In particular, we discuss how such solutions can be computed numerically on domains of arbitrary shape and study how their stability, rotational frequency, and spatial drift depend on the size of the domain as well as the position of the spiral core with respect to the boundaries. We also discuss how the breaking of local Euclidean symmetry due to finite size effects as well as the spatial discretization of the model is reflected in the structure and dynamics of spiral waves. This analysis allows identification of a self-sustaining process responsible for maintaining the state of spiral chaos featuring multiple interacting spirals.
Farley, Carlton; Kassu, Aschalew; Bose, Nayana; Jackson-Davis, Armitra; Boateng, Judith; Ruffin, Paul; Sharma, Anup
2017-06-01
A short distance standoff Raman technique is demonstrated for detecting economically motivated adulteration (EMA) in extra virgin olive oil (EVOO). Using a portable Raman spectrometer operating with a 785 nm laser and a 2-in. refracting telescope, adulteration of olive oil with grapeseed oil and canola oil is detected between 1% and 100% at a minimum concentration of 2.5% from a distance of 15 cm and at a minimum concentration of 5% from a distance of 1 m. The technique involves correlating the intensity ratios of prominent Raman bands of edible oils at 1254, 1657, and 1441 cm -1 to the degree of adulteration. As a novel variation in the data analysis technique, integrated intensities over a spectral range of 100 cm -1 around the Raman line were used, making it possible to increase the sensitivity of the technique. The technique is demonstrated by detecting adulteration of EVOO with grapeseed and canola oils at 0-100%. Due to the potential of this technique for making measurements from a convenient distance, the short distance standoff Raman technique has the promise to be used for routine applications in food industry such as identifying food items and monitoring EMA at various checkpoints in the food supply chain and storage facilities.
Directory of Open Access Journals (Sweden)
Rodríguez Velásquez, Javier Oswaldo
2014-01-01
Full Text Available Background: Pathological interpretation of cellular form in cervical cytology is very important for preven- tion of cervical cancer. The methods most frequently used for assessment of this test have reproducibility and inter-observer variability problems. Objective: To make fractal and Euclidean measure- ments to mathematically diagnose normal and pre- malignant cells of cervical squamous epithelium. Methodology: 21 cells with normal, ASCUS or LSIL diagnosis according to the Bethesda system were assessed. Fractal and Euclidean geometric measures of three mathematical objects were calculated: cyto- plasm, nucleus and whole cell. Mathematical propor- tions between these measurements were calculated in order to compare them with conventional classification methods. Results: It was found that the nuclear border measures calculated with the 2-pixel grill and the surface measures could mathematically and objectively differentiate normal cells from the pre-malignant ones (ASCUS and LSIL. Conclusions: An objective and reproducible diagnos- tic method was developed; it allows to identify the evolution towards malignant cellular states based on simultaneous fractal and Euclidean measures, estab- lishing the severity level of ASCUS and LSIL cells.
New method for distance-based close following safety indicator.
Sharizli, A A; Rahizar, R; Karim, M R; Saifizul, A A
2015-01-01
The increase in the number of fatalities caused by road accidents involving heavy vehicles every year has raised the level of concern and awareness on road safety in developing countries like Malaysia. Changes in the vehicle dynamic characteristics such as gross vehicle weight, travel speed, and vehicle classification will affect a heavy vehicle's braking performance and its ability to stop safely in emergency situations. As such, the aim of this study is to establish a more realistic new distance-based safety indicator called the minimum safe distance gap (MSDG), which incorporates vehicle classification (VC), speed, and gross vehicle weight (GVW). Commercial multibody dynamics simulation software was used to generate braking distance data for various heavy vehicle classes under various loads and speeds. By applying nonlinear regression analysis to the simulation results, a mathematical expression of MSDG has been established. The results show that MSDG is dynamically changed according to GVW, VC, and speed. It is envisaged that this new distance-based safety indicator would provide a more realistic depiction of the real traffic situation for safety analysis.
Bayesian Approach to Spectral Function Reconstruction for Euclidean Quantum Field Theories
Burnier, Yannis; Rothkopf, Alexander
2013-11-01
We present a novel approach to the inference of spectral functions from Euclidean time correlator data that makes close contact with modern Bayesian concepts. Our method differs significantly from the maximum entropy method (MEM). A new set of axioms is postulated for the prior probability, leading to an improved expression, which is devoid of the asymptotically flat directions present in the Shanon-Jaynes entropy. Hyperparameters are integrated out explicitly, liberating us from the Gaussian approximations underlying the evidence approach of the maximum entropy method. We present a realistic test of our method in the context of the nonperturbative extraction of the heavy quark potential. Based on hard-thermal-loop correlator mock data, we establish firm requirements in the number of data points and their accuracy for a successful extraction of the potential from lattice QCD. Finally we reinvestigate quenched lattice QCD correlators from a previous study and provide an improved potential estimation at T=2.33TC.
New results on embeddings of polyhedra and manifolds in Euclidean spaces
International Nuclear Information System (INIS)
Repovs, D; Skopenkov, A B
1999-01-01
The aim of this survey is to present several classical results on embeddings and isotopies of polyhedra and manifolds in R m . We also describe the revival of interest in this beautiful branch of topology and give an account of new results, including an improvement of the Haefliger-Weber theorem on the completeness of the deleted product obstruction to embeddability and isotopy of highly connected manifolds in R m (Skopenkov) as well as the unimprovability of this theorem for polyhedra (Freedman, Krushkal, Teichner, Segal, Skopenkov, and Spiez) and for manifolds without the necessary connectedness assumption (Skopenkov). We show how algebraic obstructions (in terms of cohomology, characteristic classes, and equivariant maps) arise from geometric problems of embeddability in Euclidean spaces. Several classical and modern results on completeness or incompleteness of these obstructions are stated and proved. By these proofs we illustrate classical and modern tools of geometric topology (engulfing, the Whitney trick, van Kampen and Casson finger moves, and their generalizations)
Linear embeddings of finite-dimensional subsets of Banach spaces into Euclidean spaces
International Nuclear Information System (INIS)
Robinson, James C
2009-01-01
This paper treats the embedding of finite-dimensional subsets of a Banach space B into finite-dimensional Euclidean spaces. When the Hausdorff dimension of X − X is finite, d H (X − X) k are injective on X. The proof motivates the definition of the 'dual thickness exponent', which is the key to proving that a prevalent set of such linear maps have Hölder continuous inverse when the box-counting dimension of X is finite and k > 2d B (X). A related argument shows that if the Assouad dimension of X − X is finite and k > d A (X − X), a prevalent set of such maps are bi-Lipschitz with logarithmic corrections. This provides a new result for compact homogeneous metric spaces via the Kuratowksi embedding of (X, d) into L ∞ (X)
L 1 Generalized Procrustes 2D Shape Alignment
DEFF Research Database (Denmark)
Larsen, Rasmus
2008-01-01
on the orientation of the coordinate system, i.e. it is not rotationally invariant. However, by simultaneously minimizing the city block distances in a series of rotated coordinate systems we are able to approximate the circular equidistance curves of Euclidean distances with a regular polygonal equidistance curve...... to the precision needed. Using 3 coordinate systems rotated 30 degrees we get a 12 sided regular polygon, with which we achieve deviations from Euclidean distances less than 2 % over all directions. This new formulation allows for minimization in the L1-norm using LP. We demonstrate that the use of the L1-norm...
Osseiran, Sam; Roider, Elisabeth M.; Wang, Hequn; Suita, Yusuke; Murphy, Michael; Fisher, David E.; Evans, Conor L.
2017-12-01
Chemical sun filters are commonly used as active ingredients in sunscreens due to their efficient absorption of ultraviolet (UV) radiation. Yet, it is known that these compounds can photochemically react with UV light and generate reactive oxygen species and oxidative stress in vitro, though this has yet to be validated in vivo. One label-free approach to probe oxidative stress is to measure and compare the relative endogenous fluorescence generated by cellular coenzymes nicotinamide adenine dinucleotides and flavin adenine dinucleotides. However, chemical sun filters are fluorescent, with emissive properties that contaminate endogenous fluorescent signals. To accurately distinguish the source of fluorescence in ex vivo skin samples treated with chemical sun filters, fluorescence lifetime imaging microscopy data were processed on a pixel-by-pixel basis using a non-Euclidean separation algorithm based on Mahalanobis distance and validated on simulated data. Applying this method, ex vivo samples exhibited a small oxidative shift when exposed to sun filters alone, though this shift was much smaller than that imparted by UV irradiation. Given the need for investigative tools to further study the clinical impact of chemical sun filters in patients, the reported methodology may be applied to visualize chemical sun filters and measure oxidative stress in patients' skin.
Fast Tree: Computing Large Minimum-Evolution Trees with Profiles instead of a Distance Matrix
N. Price, Morgan
2009-01-01
Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability. Instead of storing a distance matrix, FastTree stores sequence profiles of internal nodes in the tree. FastTree uses these profiles to implement neighbor-joining and uses heuristics to quickly identify candidate joins. FastTree then uses nearest-neighbor i...
FastTree: Computing Large Minimum Evolution Trees with Profiles instead of a Distance Matrix
Price, Morgan N.; Dehal, Paramvir S.; Arkin, Adam P.
2009-01-01
Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability. Instead of storing a distance matrix, FastTree stores sequence profiles of internal nodes in the tree. FastTree uses these profiles to implement Neighbor-Joining and uses heuristics to quickly identify candidate joins. FastTree then uses nearest neighbor in...
Directory of Open Access Journals (Sweden)
Jinhong Noh
2016-04-01
Full Text Available Obstacle avoidance methods require knowledge of the distance between a mobile robot and obstacles in the environment. However, in stochastic environments, distance determination is difficult because objects have position uncertainty. The purpose of this paper is to determine the distance between a robot and obstacles represented by probability distributions. Distance determination for obstacle avoidance should consider position uncertainty, computational cost and collision probability. The proposed method considers all of these conditions, unlike conventional methods. It determines the obstacle region using the collision probability density threshold. Furthermore, it defines a minimum distance function to the boundary of the obstacle region with a Lagrange multiplier method. Finally, it computes the distance numerically. Simulations were executed in order to compare the performance of the distance determination methods. Our method demonstrated a faster and more accurate performance than conventional methods. It may help overcome position uncertainty issues pertaining to obstacle avoidance, such as low accuracy sensors, environments with poor visibility or unpredictable obstacle motion.
Ichikawa, Kazuki; Morishita, Shinichi
2014-01-01
K-means clustering has been widely used to gain insight into biological systems from large-scale life science data. To quantify the similarities among biological data sets, Pearson correlation distance and standardized Euclidean distance are used most frequently; however, optimization methods have been largely unexplored. These two distance measurements are equivalent in the sense that they yield the same k-means clustering result for identical sets of k initial centroids. Thus, an efficient algorithm used for one is applicable to the other. Several optimization methods are available for the Euclidean distance and can be used for processing the standardized Euclidean distance; however, they are not customized for this context. We instead approached the problem by studying the properties of the Pearson correlation distance, and we invented a simple but powerful heuristic method for markedly pruning unnecessary computation while retaining the final solution. Tests using real biological data sets with 50-60K vectors of dimensions 10-2001 (~400 MB in size) demonstrated marked reduction in computation time for k = 10-500 in comparison with other state-of-the-art pruning methods such as Elkan's and Hamerly's algorithms. The BoostKCP software is available at http://mlab.cb.k.u-tokyo.ac.jp/~ichikawa/boostKCP/.
Directory of Open Access Journals (Sweden)
Budi Dwi Satoto
2015-04-01
Full Text Available Distribution of education in Indonesia has become government's attention for a long time. But until now, education in Indonesia is still not evenly distributed. This can be seen from the low value of Participation Rough figures and net enrollment ratio in certain areas as well as uneven educational facilities. The purpose of this research is to provide information to local authorities about the state of education in local region to produce an appropriate policy regarding development of educational infrastructure and teachers assistant distribution. Clustering is a data mining method that divides data into several groups with the same object characteristics. This research used Partition Around Medoids methods with 3 distance measure that contain Manhattan, Euclidean and Canberra distance. Adjusted Random Index used to measure the quality of clustering results. From 3 times sampling, better value of ARI Euclidean distance 0.799, Manhattan distance 0.738 and Canberra distance 0.163 while the best clustering obtained is Euclidean distance with value of ARI 0.825 and compatibility with the original label 83.33%. it is produces high equity group composed of 11 districts with equity groups are composed of 15 districts and low equity group consists of 46 sub-districts.
DISTANCES TO DARK CLOUDS: COMPARING EXTINCTION DISTANCES TO MASER PARALLAX DISTANCES
International Nuclear Information System (INIS)
Foster, Jonathan B.; Jackson, James M.; Stead, Joseph J.; Hoare, Melvin G.; Benjamin, Robert A.
2012-01-01
We test two different methods of using near-infrared extinction to estimate distances to dark clouds in the first quadrant of the Galaxy using large near-infrared (Two Micron All Sky Survey and UKIRT Infrared Deep Sky Survey) surveys. Very long baseline interferometry parallax measurements of masers around massive young stars provide the most direct and bias-free measurement of the distance to these dark clouds. We compare the extinction distance estimates to these maser parallax distances. We also compare these distances to kinematic distances, including recent re-calibrations of the Galactic rotation curve. The extinction distance methods agree with the maser parallax distances (within the errors) between 66% and 100% of the time (depending on method and input survey) and between 85% and 100% of the time outside of the crowded Galactic center. Although the sample size is small, extinction distance methods reproduce maser parallax distances better than kinematic distances; furthermore, extinction distance methods do not suffer from the kinematic distance ambiguity. This validation gives us confidence that these extinction methods may be extended to additional dark clouds where maser parallaxes are not available.
Safety distance for preventing hot particle ignition of building insulation materials
Directory of Open Access Journals (Sweden)
Jiayun Song
2014-01-01
Full Text Available Trajectories of flying hot particles were predicted in this work, and the temperatures during the movement were also calculated. Once the particle temperature decreased to the critical temperature for a hot particle to ignite building insulation materials, which was predicted by hot-spot ignition theory, the distance particle traveled was determined as the minimum safety distance for preventing the ignition of building insulation materials by hot particles. The results showed that for sphere aluminum particles with the same initial velocities and diameters, the horizontal and vertical distances traveled by particles with higher initial temperatures were higher. Smaller particles traveled farther when other conditions were the same. The critical temperature for an aluminum particle to ignite rigid polyurethane foam increased rapidly with the decrease of particle diameter. The horizontal and vertical safety distances were closely related to the initial temperature, diameter and initial velocity of particles. These results could help update the safety provision of firework display.
Euclidean scalar Green's functions near the black hole and black brane horizons
International Nuclear Information System (INIS)
Haba, Z
2009-01-01
We discuss approximations of the Riemannian geometry near the horizon. If a (D + 1)-dimensional manifold N has a bifurcate Killing horizon then we approximate N by a product of the two-dimensional Rindler space R 2 and a (D - 1)-dimensional Riemannian manifold M. We obtain approximate formulae for scalar Green's functions. We study the behavior of the Green's functions near the horizon and their dimensional reduction. We show that if M is compact then the Green's function near the horizon can be approximated by the Green's function of the two-dimensional quantum field theory. The correction term is exponentially small away from the horizon. We extend the results to black brane solutions of supergravity in 10 and 11 dimensions. The near-horizon geometry can be approximated by N=AdS p xS q . We discuss the Euclidean Green's functions on N and their behavior near the horizon.
Development of Gis Tool for the Solution of Minimum Spanning Tree Problem using Prim's Algorithm
Dutta, S.; Patra, D.; Shankar, H.; Alok Verma, P.
2014-11-01
minimum spanning tree (MST) of a connected, undirected and weighted network is a tree of that network consisting of all its nodes and the sum of weights of all its edges is minimum among all such possible spanning trees of the same network. In this study, we have developed a new GIS tool using most commonly known rudimentary algorithm called Prim's algorithm to construct the minimum spanning tree of a connected, undirected and weighted road network. This algorithm is based on the weight (adjacency) matrix of a weighted network and helps to solve complex network MST problem easily, efficiently and effectively. The selection of the appropriate algorithm is very essential otherwise it will be very hard to get an optimal result. In case of Road Transportation Network, it is very essential to find the optimal results by considering all the necessary points based on cost factor (time or distance). This paper is based on solving the Minimum Spanning Tree (MST) problem of a road network by finding it's minimum span by considering all the important network junction point. GIS technology is usually used to solve the network related problems like the optimal path problem, travelling salesman problem, vehicle routing problems, location-allocation problems etc. Therefore, in this study we have developed a customized GIS tool using Python script in ArcGIS software for the solution of MST problem for a Road Transportation Network of Dehradun city by considering distance and time as the impedance (cost) factors. It has a number of advantages like the users do not need a greater knowledge of the subject as the tool is user-friendly and that allows to access information varied and adapted the needs of the users. This GIS tool for MST can be applied for a nationwide plan called Prime Minister Gram Sadak Yojana in India to provide optimal all weather road connectivity to unconnected villages (points). This tool is also useful for constructing highways or railways spanning several
Extremal values on Zagreb indices of trees with given distance k-domination number.
Pei, Lidan; Pan, Xiangfeng
2018-01-01
Let [Formula: see text] be a graph. A set [Formula: see text] is a distance k -dominating set of G if for every vertex [Formula: see text], [Formula: see text] for some vertex [Formula: see text], where k is a positive integer. The distance k -domination number [Formula: see text] of G is the minimum cardinality among all distance k -dominating sets of G . The first Zagreb index of G is defined as [Formula: see text] and the second Zagreb index of G is [Formula: see text]. In this paper, we obtain the upper bounds for the Zagreb indices of n -vertex trees with given distance k -domination number and characterize the extremal trees, which generalize the results of Borovićanin and Furtula (Appl. Math. Comput. 276:208-218, 2016). What is worth mentioning, for an n -vertex tree T , is that a sharp upper bound on the distance k -domination number [Formula: see text] is determined.
Long-distance travellers stopover for longer: a case study with spoonbills staying in North Iberia
Navedo , Juan G.; Orizaola , Germán; Masero , José A.; Overdijk , Otto; Sánchez-Guzmán , Juan M.
2010-01-01
Abstract Long-distance migration is widespread among birds, connecting breeding and wintering areas through a set of stopover localities where individuals refuel and/or rest. The extent of the stopover is critical in determining the migratory strategy of a bird. Here, we examined the relationship between minimum length of stay of PVC-ringed birds in a major stopover site and the remaining flight distance to the overwintering area in the Eurasian spoonbill (Platalea l. leucorodia) d...
Energy Technology Data Exchange (ETDEWEB)
Afzal, Muhammad; Ahmed, Furqan; Anwar, Muhammad Yousaf; Ali, Liaqat; Ajmal, Muhammad [Univ. of Engineering and Technology, Metallurgical and Materials Engineering, Lahore (Pakistan); Khan, Aamer Nusair [Institute of Industrial and Control System, Rawalpindi (Pakistan)
2015-09-15
In the present research, WC-12 %Co cermet coatings were deposited on AISI-321 stainless steel substrate using air plasma spraying. During the deposition process, the standoff distance was varied from 80 to 130 mm with 10 mm increments. Other parameters such as current, voltage, time, carrier gas flow rate and powder feed rate etc. were kept constant. The objective was to study the effects of spraying distance on the microstructure of as-sprayed coatings. The microscopic analyses revealed that the band of spraying distance ranging from 90 to 100 mm was the threshold distance for optimum results, provided that all the other spraying parameters were kept constant. In this range of threshold distance, minimum percentages of porosity and defects were observed. Further, the formation of different phases, at six spraying distances, was studied using X-ray diffraction, and the phase analysis was correlated with hardness results.
Anthropology in the post-Euclidean State, or from textual to oral anthropology
Directory of Open Access Journals (Sweden)
Antonio Luigi Palmisano
2011-12-01
Full Text Available The actual crisis of anthropology is examined in relation to its wide public success. Anthropology has prospered and the anthropologists have proliferated becoming more specific. But the theoretical debate has come to a halt over the last decades. The article suggests that both the methodology and the form of expression of the ethnographic report have developed and then become crystallized around actual protocols. A critique of the dichotomy Subject/Object, namely the key discussion about the notion of Otherness, is here reexamined as the testimony for an immanent “non-protocolar” character of anthropology. This critique together with the end of anthropology as tekhne, i.e. as protocolar activity, will allow anthropology to go on enhancing many other social and non social sciences. The article discusses the re-definition of anthropology in the context of Daseinanalysis and, therefore the changing relation between man and power, that is between the social actor and the post-Euclidean State in the era of the tekhne.
Euclidean scalar Green function in a higher dimensional global monopole space-time
International Nuclear Information System (INIS)
Bezerra de Mello, E.R.
2002-01-01
We construct the explicit Euclidean scalar Green function associated with a massless field in a higher dimensional global monopole space-time, i.e., a (1+d)-space-time with d≥3 which presents a solid angle deficit. Our result is expressed in terms of an infinite sum of products of Legendre functions with Gegenbauer polynomials. Although this Green function cannot be expressed in a closed form, for the specific case where the solid angle deficit is very small, it is possible to develop the sum and obtain the Green function in a more workable expression. Having this expression it is possible to calculate the vacuum expectation value of some relevant operators. As an application of this formalism, we calculate the renormalized vacuum expectation value of the square of the scalar field, 2 (x)> Ren , and the energy-momentum tensor, μν (x)> Ren , for the global monopole space-time with spatial dimensions d=4 and d=5
Towards an intelligent environment for distance learning
Directory of Open Access Journals (Sweden)
Rafael Morales
2009-12-01
Full Text Available Mainstream distance learning nowadays is heavily influenced by traditional educational approaches that produceshomogenised learning scenarios for all learners through learning management systems. Any differentiation betweenlearners and personalisation of their learning scenarios is left to the teacher, who gets minimum support from the system inthis respect. This way, the truly digital native, the computer, is left out of the move, unable to better support the teachinglearning processes because it is not provided with the means to transform into knowledge all the information that it storesand manages. I believe learning management systems should care for supporting adaptation and personalisation of bothindividual learning and the formation of communities of learning. Open learner modelling and intelligent collaborativelearning environments are proposed as a means to care. The proposal is complemented with a general architecture for anintelligent environment for distance learning and an educational model based on the principles of self-management,creativity, significance and participation.
Multi-image acquisition-based distance sensor using agile laser spot beam.
Riza, Nabeel A; Amin, M Junaid
2014-09-01
We present a novel laser-based distance measurement technique that uses multiple-image-based spatial processing to enable distance measurements. Compared with the first-generation distance sensor using spatial processing, the modified sensor is no longer hindered by the classic Rayleigh axial resolution limit for the propagating laser beam at its minimum beam waist location. The proposed high-resolution distance sensor design uses an electronically controlled variable focus lens (ECVFL) in combination with an optical imaging device, such as a charged-coupled device (CCD), to produce and capture different laser spot size images on a target with these beam spot sizes different from the minimal spot size possible at this target distance. By exploiting the unique relationship of the target located spot sizes with the varying ECVFL focal length for each target distance, the proposed distance sensor can compute the target distance with a distance measurement resolution better than the axial resolution via the Rayleigh resolution criterion. Using a 30 mW 633 nm He-Ne laser coupled with an electromagnetically actuated liquid ECVFL, along with a 20 cm focal length bias lens, and using five spot images captured per target position by a CCD-based Nikon camera, a proof-of-concept proposed distance sensor is successfully implemented in the laboratory over target ranges from 10 to 100 cm with a demonstrated sub-cm axial resolution, which is better than the axial Rayleigh resolution limit at these target distances. Applications for the proposed potentially cost-effective distance sensor are diverse and include industrial inspection and measurement and 3D object shape mapping and imaging.
Effects of logging on macroinvertebrates in streams with and without buffer strips
Energy Technology Data Exchange (ETDEWEB)
Newbold, J D; Erman, D C; Roby, K B
1980-01-01
The impact of logging with and without buffer strip protection on stream macroinvertebrates was examined through comparisons of community structure in commercially logged and control watersheds throughout northern California. A nonparametric test of community dissimilarities within matched blocks of two control and one or two treated stations showed significant (P < 0.05) logging effects on unprotected streams when Euclidean distance and mutual information were used as dissimilarity indices, but not when chord distance was used. Shannon diversity in unprotected streams was lower (P < 0.01) than in control (unlogged) streams; densities of total macroinvertebrate fauna and of Chironomidae, Baetis, and Nemoura were higher in unprotected streams than in controls (P <0.05). Streams with narrow buffer strips (<30 m) showed significant effects by the Euclidean distance test, but diversity varied widely and was not significantly different from that in either unprotected or control streams than in controls (P < 0.05). Macroinvertebrate communities in streams with wide buffers (greater than or equal to 30m) could not be distinguished from those of controls by either Euclidean distance or diversity; however, diversity in wide-buffered streams was significantly greater than in streams without buffer strips, indicating effective protection from logging effects.
On locating a semi-desirable facility on the continuous plane
DEFF Research Database (Denmark)
Brimberg, Jack; Juel, Henrik
1998-01-01
Euclidean distance from the facility to the closest customer. The objective is to generate the set of efficient points, from which the decision maker must choose the preferred one. Two reformulations are considered: in one, the sum of weighted distances is minimized, subject to constraints requiring...... that each customer must have a weighted Euclidean distance to the facility of at least a given parameter; varying the parameter yields the efficient set. In the other, both criteria are viewed as minimization problems and a convex combination of them is minimized. Properties of the reformulations are given......The paper considers a bicriteria model for locating a semi-desirable facility on the plane. One criterion is that of minimizing the sum of weighted distances between customers and facility, where distances are given by an arbitrary norm. The other criterion is that of maximizing the weighted...
Feedback brake distribution control for minimum pitch
Tavernini, Davide; Velenis, Efstathios; Longo, Stefano
2017-06-01
The distribution of brake forces between front and rear axles of a vehicle is typically specified such that the same level of brake force coefficient is imposed at both front and rear wheels. This condition is known as 'ideal' distribution and it is required to deliver the maximum vehicle deceleration and minimum braking distance. For subcritical braking conditions, the deceleration demand may be delivered by different distributions between front and rear braking forces. In this research we show how to obtain the optimal distribution which minimises the pitch angle of a vehicle and hence enhances driver subjective feel during braking. A vehicle model including suspension geometry features is adopted. The problem of the minimum pitch brake distribution for a varying deceleration level demand is solved by means of a model predictive control (MPC) technique. To address the problem of the undesirable pitch rebound caused by a full-stop of the vehicle, a second controller is designed and implemented independently from the braking distribution in use. An extended Kalman filter is designed for state estimation and implemented in a high fidelity environment together with the MPC strategy. The proposed solution is compared with the reference 'ideal' distribution as well as another previous feed-forward solution.
A Novel Parallel Algorithm for Edit Distance Computation
Directory of Open Access Journals (Sweden)
Muhammad Murtaza Yousaf
2018-01-01
Full Text Available The edit distance between two sequences is the minimum number of weighted transformation-operations that are required to transform one string into the other. The weighted transformation-operations are insert, remove, and substitute. Dynamic programming solution to find edit distance exists but it becomes computationally intensive when the lengths of strings become very large. This work presents a novel parallel algorithm to solve edit distance problem of string matching. The algorithm is based on resolving dependencies in the dynamic programming solution of the problem and it is able to compute each row of edit distance table in parallel. In this way, it becomes possible to compute the complete table in min(m,n iterations for strings of size m and n whereas state-of-the-art parallel algorithm solves the problem in max(m,n iterations. The proposed algorithm also increases the amount of parallelism in each of its iteration. The algorithm is also capable of exploiting spatial locality while its implementation. Additionally, the algorithm works in a load balanced way that further improves its performance. The algorithm is implemented for multicore systems having shared memory. Implementation of the algorithm in OpenMP shows linear speedup and better execution time as compared to state-of-the-art parallel approach. Efficiency of the algorithm is also proven better in comparison to its competitor.
Saw, Kim Guan
2017-01-01
This article revisits the cognitive load theory to explore the use of worked examples to teach a selected topic in a higher level undergraduate physics course for distance learners at the School of Distance Education, Universiti Sains Malaysia. With a break of several years from receiving formal education and having only minimum science…
Edit distance for marked point processes revisited: An implementation by binary integer programming
Energy Technology Data Exchange (ETDEWEB)
Hirata, Yoshito; Aihara, Kazuyuki [Institute of Industrial Science, The University of Tokyo, 4-6-1 Komaba, Meguro-ku, Tokyo 153-8505 (Japan)
2015-12-15
We implement the edit distance for marked point processes [Suzuki et al., Int. J. Bifurcation Chaos 20, 3699–3708 (2010)] as a binary integer program. Compared with the previous implementation using minimum cost perfect matching, the proposed implementation has two advantages: first, by using the proposed implementation, we can apply a wide variety of software and hardware, even spin glasses and coherent ising machines, to calculate the edit distance for marked point processes; second, the proposed implementation runs faster than the previous implementation when the difference between the numbers of events in two time windows for a marked point process is large.
International Nuclear Information System (INIS)
Guillorn, Michael A.; Carr, Dustin W.; Tiberio, Richard C.; Greenbaum, Elias; Simpson, Michael L.
2000-01-01
We report a versatile process for the fabrication of dissimilar metal electrodes with a minimum interelectrode distance of less than 6 nm using electron beam lithography and liftoff pattern transfer. This technique provides a controllable and reproducible method for creating structures suited for the electrical characterization of asymmetric molecules for molecular electronics applications. Electrode structures employing pairs of Au electrodes and non-Au electrodes were fabricated in three different patterns. Parallel electrode structures 300 μm long with interelectrode distances as low as 10 nm, 75 nm wide electrode pairs with interelectrode distances less than 6 nm, and a multiterminal electrode structure with reproducible interelectrode distances of 8 nm were realized using this technique. The processing issues associated with the fabrication of these structures are discussed along with the intended application of these devices. (c) 2000 American Vacuum Society
Directory of Open Access Journals (Sweden)
Ramakalavathi Marapareddy
2017-10-01
Full Text Available This paper analyzes the use of a synthetic aperture radar (SAR imagery to support levee condition assessment by detecting potential slide areas in an efficient and cost-effective manner. Levees are prone to a failure in the form of internal erosion within the earthen structure and landslides (also called slough or slump slides. If not repaired, slough slides may lead to levee failures. In this paper, we compare the accuracy of the supervised classification methods minimum distance (MD using Euclidean and Mahalanobis distance, support vector machine (SVM, and maximum likelihood (ML, using SAR technology to detect slough slides on earthen levees. In this work, the effectiveness of the algorithms was demonstrated using quad-polarimetric L-band SAR imagery from the NASA Jet Propulsion Laboratory’s (JPL’s uninhabited aerial vehicle synthetic aperture radar (UAVSAR. The study area is a section of the lower Mississippi River valley in the Southern USA, where earthen flood control levees are maintained by the US Army Corps of Engineers.
Directory of Open Access Journals (Sweden)
L. G. Balázs
2012-01-01
Full Text Available We studied the complete randomness of the angular distribution of BATSE gamma-ray bursts (GRBs. Based on their durations and peak fluxes, we divided the BATSE sample into 5 subsamples (short1, short2, intermediate, long1, long2 and studied the angular distributions separately. We used three methods to search for non-randomness in the subsamples: Voronoi tesselation, minimal spanning tree, and multifractal spectra. To study any non-randomness in the subsamples we defined 13 test-variables (9 from Voronoi tesselation, 3 from the minimal spanning tree and one from the multifractal spectrum. We made Monte Carlo simulations taking into account the BATSE’s sky-exposure function. We tested therandomness by introducing squared Euclidean distances in the parameter space of the test-variables. We recognized that the short1, short2 groups deviate significantly (99.90%, 99.98% from the fully random case in the distribution of the squared Euclidean distances but this is not true for the long samples. In the intermediate group, the squared Euclidean distances also give significant deviation (98.51%.
Green functions and dimensional reduction of quantum fields on product manifolds
International Nuclear Information System (INIS)
Haba, Z
2008-01-01
We discuss Euclidean Green functions on product manifolds P=N x M. We show that if M is compact and N is not compact then the Euclidean field on P can be approximated by its zero mode which is a Euclidean field on N. We estimate the remainder of this approximation. We show that for large distances on N the remainder is small. If P=R D-1 x S β , where S β is a circle of radius β, then the result reduces to the well-known approximation of the D-dimensional finite temperature quantum field theory by (D - 1)-dimensional one in the high-temperature limit. Analytic continuation of Euclidean fields is discussed briefly
Improved initial guess for minimum energy path calculations
International Nuclear Information System (INIS)
Smidstrup, Søren; Pedersen, Andreas; Stokbro, Kurt; Jónsson, Hannes
2014-01-01
A method is presented for generating a good initial guess of a transition path between given initial and final states of a system without evaluation of the energy. An objective function surface is constructed using an interpolation of pairwise distances at each discretization point along the path and the nudged elastic band method then used to find an optimal path on this image dependent pair potential (IDPP) surface. This provides an initial path for the more computationally intensive calculations of a minimum energy path on an energy surface obtained, for example, by ab initio or density functional theory. The optimal path on the IDPP surface is significantly closer to a minimum energy path than a linear interpolation of the Cartesian coordinates and, therefore, reduces the number of iterations needed to reach convergence and averts divergence in the electronic structure calculations when atoms are brought too close to each other in the initial path. The method is illustrated with three examples: (1) rotation of a methyl group in an ethane molecule, (2) an exchange of atoms in an island on a crystal surface, and (3) an exchange of two Si-atoms in amorphous silicon. In all three cases, the computational effort in finding the minimum energy path with DFT was reduced by a factor ranging from 50% to an order of magnitude by using an IDPP path as the initial path. The time required for parallel computations was reduced even more because of load imbalance when linear interpolation of Cartesian coordinates was used
Directory of Open Access Journals (Sweden)
Saleh LAshkari
2016-06-01
Full Text Available Selecting optimal features based on nature of the phenomenon and high discriminant ability is very important in the data classification problems. Since it doesn't require any assumption about stationary condition and size of the signal and the noise in Recurrent Quantification Analysis (RQA, it may be useful for epileptic seizure Detection. In this study, RQA was used to discriminate ictal EEG from the normal EEG where optimal features selected by combination of algorithm genetic and Bayesian Classifier. Recurrence plots of hundred samples in each two categories were obtained with five distance norms in this study: Euclidean, Maximum, Minimum, Normalized and Fixed Norm. In order to choose optimal threshold for each norm, ten threshold of ε was generated and then the best feature space was selected by genetic algorithm in combination with a bayesian classifier. The results shown that proposed method is capable of discriminating the ictal EEG from the normal EEG where for Minimum norm and 0.1˂ε˂1, accuracy was 100%. In addition, the sensitivity of proposed framework to the ε and the distance norm parameters was low. The optimal feature presented in this study is Trans which it was selected in most feature spaces with high accuracy.
Non-Hermitian systems of Euclidean Lie algebraic type with real energy spectra
Dey, Sanjib; Fring, Andreas; Mathanaranjan, Thilagarajah
2014-07-01
We study several classes of non-Hermitian Hamiltonian systems, which can be expressed in terms of bilinear combinations of Euclidean-Lie algebraic generators. The classes are distinguished by different versions of antilinear (PT)-symmetries exhibiting various types of qualitative behaviour. On the basis of explicitly computed non-perturbative Dyson maps we construct metric operators, isospectral Hermitian counterparts for which we solve the corresponding time-independent Schrödinger equation for specific choices of the coupling constants. In these cases general analytical expressions for the solutions are obtained in the form of Mathieu functions, which we analyze numerically to obtain the corresponding energy spectra. We identify regions in the parameter space for which the corresponding spectra are entirely real and also domains where the PT symmetry is spontaneously broken and sometimes also regained at exceptional points. In some cases it is shown explicitly how the threshold region from real to complex spectra is characterized by the breakdown of the Dyson maps or the metric operator. We establish the explicit relationship to models currently under investigation in the context of beam dynamics in optical lattices.
Max–min distance nonnegative matrix factorization
Wang, Jim Jing-Yan; Gao, Xin
2014-01-01
Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problems. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basis matrix and a nonnegative coefficient matrix. The columns of the coefficient matrix can be used as new representations of these data samples. However, traditional NMF methods ignore class labels of the data samples. In this paper, we propose a novel supervised NMF algorithm to improve the discriminative ability of the new representation by using the class labels. Using the class labels, we separate all the data sample pairs into within-class pairs and between-class pairs. To improve the discriminative ability of the new NMF representations, we propose to minimize the maximum distance of the within-class pairs in the new NMF space, and meanwhile to maximize the minimum distance of the between-class pairs. With this criterion, we construct an objective function and optimize it with regard to basis and coefficient matrices, and slack variables alternatively, resulting in an iterative algorithm. The proposed algorithm is evaluated on three pattern classification problems and experiment results show that it outperforms the state-of-the-art supervised NMF methods.
Max–min distance nonnegative matrix factorization
Wang, Jim Jing-Yan
2014-10-26
Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problems. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basis matrix and a nonnegative coefficient matrix. The columns of the coefficient matrix can be used as new representations of these data samples. However, traditional NMF methods ignore class labels of the data samples. In this paper, we propose a novel supervised NMF algorithm to improve the discriminative ability of the new representation by using the class labels. Using the class labels, we separate all the data sample pairs into within-class pairs and between-class pairs. To improve the discriminative ability of the new NMF representations, we propose to minimize the maximum distance of the within-class pairs in the new NMF space, and meanwhile to maximize the minimum distance of the between-class pairs. With this criterion, we construct an objective function and optimize it with regard to basis and coefficient matrices, and slack variables alternatively, resulting in an iterative algorithm. The proposed algorithm is evaluated on three pattern classification problems and experiment results show that it outperforms the state-of-the-art supervised NMF methods.
DEFF Research Database (Denmark)
Gravesen, Jens
2015-01-01
and found the MacAdam ellipses which are often interpreted as defining the metric tensor at their centres. An important question is whether it is possible to define colour coordinates such that the Euclidean distance in these coordinates correspond to human perception. Using cubic splines to represent......The space of colours is a fascinating space. It is a real vector space, but no matter what inner product you put on the space the resulting Euclidean distance does not correspond to human perception of difference between colours. In 1942 MacAdam performed the first experiments on colour matching...
Real-time stop sign detection and distance estimation using a single camera
Wang, Wenpeng; Su, Yuxuan; Cheng, Ming
2018-04-01
In modern world, the drastic development of driver assistance system has made driving a lot easier than before. In order to increase the safety onboard, a method was proposed to detect STOP sign and estimate distance using a single camera. In STOP sign detection, LBP-cascade classifier was applied to identify the sign in the image, and the principle of pinhole imaging was based for distance estimation. Road test was conducted using a detection system built with a CMOS camera and software developed by Python language with OpenCV library. Results shows that that the proposed system reach a detection accuracy of maximum of 97.6% at 10m, a minimum of 95.00% at 20m, and 5% max error in distance estimation. The results indicate that the system is effective and has the potential to be used in both autonomous driving and advanced driver assistance driving systems.
DOCUMENT IMAGE REGISTRATION FOR IMPOSED LAYER EXTRACTION
Directory of Open Access Journals (Sweden)
Surabhi Narayan
2017-02-01
Full Text Available Extraction of filled-in information from document images in the presence of template poses challenges due to geometrical distortion. Filled-in document image consists of null background, general information foreground and vital information imposed layer. Template document image consists of null background and general information foreground layer. In this paper a novel document image registration technique has been proposed to extract imposed layer from input document image. A convex polygon is constructed around the content of the input and the template image using convex hull. The vertices of the convex polygons of input and template are paired based on minimum Euclidean distance. Each vertex of the input convex polygon is subjected to transformation for the permutable combinations of rotation and scaling. Translation is handled by tight crop. For every transformation of the input vertices, Minimum Hausdorff distance (MHD is computed. Minimum Hausdorff distance identifies the rotation and scaling values by which the input image should be transformed to align it to the template. Since transformation is an estimation process, the components in the input image do not overlay exactly on the components in the template, therefore connected component technique is applied to extract contour boxes at word level to identify partially overlapping components. Geometrical features such as density, area and degree of overlapping are extracted and compared between partially overlapping components to identify and eliminate components common to input image and template image. The residue constitutes imposed layer. Experimental results indicate the efficacy of the proposed model with computational complexity. Experiment has been conducted on variety of filled-in forms, applications and bank cheques. Data sets have been generated as test sets for comparative analysis.
International Nuclear Information System (INIS)
Bezerra de Mello, E.R.
2006-01-01
In this paper we present, in a integral form, the Euclidean Green function associated with a massless scalar field in the five-dimensional Kaluza-Klein magnetic monopole superposed to a global monopole, admitting a nontrivial coupling between the field with the geometry. This Green function is expressed as the sum of two contributions: the first one related with uncharged component of the field, is similar to the Green function associated with a scalar field in a four-dimensional global monopole space-time. The second contains the information of all the other components. Using this Green function it is possible to study the vacuum polarization effects on this space-time. Explicitly we calculate the renormalized vacuum expectation value * (x)Φ(x)> Ren , which by its turn is also expressed as the sum of two contributions
A novel three-stage distance-based consensus ranking method
Aghayi, Nazila; Tavana, Madjid
2018-05-01
In this study, we propose a three-stage weighted sum method for identifying the group ranks of alternatives. In the first stage, a rank matrix, similar to the cross-efficiency matrix, is obtained by computing the individual rank position of each alternative based on importance weights. In the second stage, a secondary goal is defined to limit the vector of weights since the vector of weights obtained in the first stage is not unique. Finally, in the third stage, the group rank position of alternatives is obtained based on a distance of individual rank positions. The third stage determines a consensus solution for the group so that the ranks obtained have a minimum distance from the ranks acquired by each alternative in the previous stage. A numerical example is presented to demonstrate the applicability and exhibit the efficacy of the proposed method and algorithms.
Space-Efficient Approximation Scheme for Circular Earth Mover Distance
DEFF Research Database (Denmark)
Brody, Joshua Eric; Liang, Hongyu; Sun, Xiaoming
2012-01-01
The Earth Mover Distance (EMD) between point sets A and B is the minimum cost of a bipartite matching between A and B. EMD is an important measure for estimating similarities between objects with quantifiable features and has important applications in several areas including computer vision...... to computer vision [13] and can be seen as a special case of computing EMD on a discretized grid. We achieve a (1 ±ε) approximation for EMD in $\\tilde O(\\varepsilon^{-3})$ space, for every 0 ... that matches the space bound asked in [9]....
Phylogenetic Applications of the Minimum Contradiction Approach on Continuous Characters
Directory of Open Access Journals (Sweden)
Marc Thuillard
2009-01-01
Full Text Available We describe the conditions under which a set of continuous variables or characters can be described as an X-tree or a split network. A distance matrix corresponds exactly to a split network or a valued X-tree if, after ordering of the taxa, the variables values can be embedded into a function with at most a local maximum and a local minimum, and crossing any horizontal line at most twice. In real applications, the order of the taxa best satisfying the above conditions can be obtained using the Minimum Contradiction method. This approach is applied to 2 sets of continuous characters. The first set corresponds to craniofacial landmarks in Hominids. The contradiction matrix is used to identify possible tree structures and some alternatives when they exist. We explain how to discover the main structuring characters in a tree. The second set consists of a sample of 100 galaxies. In that second example one shows how to discretize the continuous variables describing physical properties of the galaxies without disrupting the underlying tree structure.
Maximum And Minimum Temperature Trends In Mexico For The Last 31 Years
Romero-Centeno, R.; Zavala-Hidalgo, J.; Allende Arandia, M. E.; Carrasco-Mijarez, N.; Calderon-Bustamante, O.
2013-05-01
Based on high-resolution (1') daily maps of the maximum and minimum temperatures in Mexico, an analysis of the last 31-year trends is performed. The maps were generated using all the available information from more than 5,000 stations of the Mexican Weather Service (Servicio Meteorológico Nacional, SMN) for the period 1979-2009, along with data from the North American Regional Reanalysis (NARR). The data processing procedure includes a quality control step, in order to eliminate erroneous daily data, and make use of a high-resolution digital elevation model (from GEBCO), the relationship between air temperature and elevation by means of the average environmental lapse rate, and interpolation algorithms (linear and inverse-distance weighting). Based on the monthly gridded maps for the mentioned period, the maximum and minimum temperature trends calculated by least-squares linear regression and their statistical significance are obtained and discussed.
The Edit Distance as a Measure of Perceived Rhythmic Similarity
Directory of Open Access Journals (Sweden)
Olaf Post
2012-07-01
Full Text Available The ‘edit distance’ (or ‘Levenshtein distance’ measure of distance between two data sets is defined as the minimum number of editing operations – insertions, deletions, and substitutions – that are required to transform one data set to the other (Orpen and Huron, 1992. This measure of distance has been applied frequently and successfully in music information retrieval, but rarely in predicting human perception of distance. In this study, we investigate the effectiveness of the edit distance as a predictor of perceived rhythmic dissimilarity under simple rhythmic alterations. Approaching rhythms as a set of pulses that are either onsets or silences, we study two types of alterations. The first experiment is designed to test the model’s accuracy for rhythms that are relatively similar; whether rhythmic variations with the same edit distance to a source rhythm are also perceived as relatively similar by human subjects. In addition, we observe whether the salience of an edit operation is affected by its metric placement in the rhythm. Instead of using a rhythm that regularly subdivides a 4/4 meter, our source rhythm is a syncopated 16-pulse rhythm, the son. Results show a high correlation between the predictions by the edit distance model and human similarity judgments (r = 0.87; a higher correlation than for the well-known generative theory of tonal music (r = 0.64. In the second experiment, we seek to assess the accuracy of the edit distance model in predicting relatively dissimilar rhythms. The stimuli used are random permutations of the son’s inter-onset intervals: 3-3-4-2-4. The results again indicate that the edit distance correlates well with the perceived rhythmic dissimilarity judgments of the subjects (r = 0.76. To gain insight in the relationships between the individual rhythms, the results are also presented by means of graphic phylogenetic trees.
Pettengill, James B; Pightling, Arthur W; Baugher, Joseph D; Rand, Hugh; Strain, Errol
2016-01-01
The adoption of whole-genome sequencing within the public health realm for molecular characterization of bacterial pathogens has been followed by an increased emphasis on real-time detection of emerging outbreaks (e.g., food-borne Salmonellosis). In turn, large databases of whole-genome sequence data are being populated. These databases currently contain tens of thousands of samples and are expected to grow to hundreds of thousands within a few years. For these databases to be of optimal use one must be able to quickly interrogate them to accurately determine the genetic distances among a set of samples. Being able to do so is challenging due to both biological (evolutionary diverse samples) and computational (petabytes of sequence data) issues. We evaluated seven measures of genetic distance, which were estimated from either k-mer profiles (Jaccard, Euclidean, Manhattan, Mash Jaccard, and Mash distances) or nucleotide sites (NUCmer and an extended multi-locus sequence typing (MLST) scheme). When analyzing empirical data (whole-genome sequence data from 18,997 Salmonella isolates) there are features (e.g., genomic, assembly, and contamination) that cause distances inferred from k-mer profiles, which treat absent data as informative, to fail to accurately capture the distance between samples when compared to distances inferred from differences in nucleotide sites. Thus, site-based distances, like NUCmer and extended MLST, are superior in performance, but accessing the computing resources necessary to perform them may be challenging when analyzing large databases.
Directory of Open Access Journals (Sweden)
James B Pettengill
Full Text Available The adoption of whole-genome sequencing within the public health realm for molecular characterization of bacterial pathogens has been followed by an increased emphasis on real-time detection of emerging outbreaks (e.g., food-borne Salmonellosis. In turn, large databases of whole-genome sequence data are being populated. These databases currently contain tens of thousands of samples and are expected to grow to hundreds of thousands within a few years. For these databases to be of optimal use one must be able to quickly interrogate them to accurately determine the genetic distances among a set of samples. Being able to do so is challenging due to both biological (evolutionary diverse samples and computational (petabytes of sequence data issues. We evaluated seven measures of genetic distance, which were estimated from either k-mer profiles (Jaccard, Euclidean, Manhattan, Mash Jaccard, and Mash distances or nucleotide sites (NUCmer and an extended multi-locus sequence typing (MLST scheme. When analyzing empirical data (whole-genome sequence data from 18,997 Salmonella isolates there are features (e.g., genomic, assembly, and contamination that cause distances inferred from k-mer profiles, which treat absent data as informative, to fail to accurately capture the distance between samples when compared to distances inferred from differences in nucleotide sites. Thus, site-based distances, like NUCmer and extended MLST, are superior in performance, but accessing the computing resources necessary to perform them may be challenging when analyzing large databases.
Do Minimum Wages Fight Poverty?
David Neumark; William Wascher
1997-01-01
The primary goal of a national minimum wage floor is to raise the incomes of poor or near-poor families with members in the work force. However, estimates of employment effects of minimum wages tell us little about whether minimum wages are can achieve this goal; even if the disemployment effects of minimum wages are modest, minimum wage increases could result in net income losses for poor families. We present evidence on the effects of minimum wages on family incomes from matched March CPS s...
Wang, Yong-Long; Jiang, Hua; Zong, Hong-Shi
2017-08-01
In the spirit of the thin-layer quantization approach, we give the formula of the geometric influences of a particle confined to a curved surface embedded in three-dimensional Euclidean space. The geometric contributions can result from the reduced commutation relation between the acted function depending on normal variable and the normal derivative. According to the formula, we obtain the geometric potential, geometric momentum, geometric orbital angular momentum, geometric linear Rashba, and cubic Dresselhaus spin-orbit couplings. As an example, a truncated cone surface is considered. We find that the geometric orbital angular momentum can provide an azimuthal polarization for spin, and the sign of the geometric Dresselhaus spin-orbit coupling can be flipped through the inclination angle of generatrix.
International Nuclear Information System (INIS)
Czubek, J.A.; Lenda, A.
1979-01-01
The minimum dimensions have been calculated assuring 91, 96 and 98 % of the probe response in respect to the infinite medium. The models are of cylindrical form, the probe (source-to-detector distance equal to 60 or 90 cm) being placed on the model axis, symmetrically with respect to the two end-faces. All the models are ''embedded'' in various media, such as: air, sand of 40% porosity and completely saturated with water, sand of 30 % porosity and of moisture content equal to 10 %, and water. The models are of three types of material: sandstone, limestone and dolomite, with various porosities, ranging from 0 to 100 %. The probe response is due to gamma rays arising from the radiativecapture of thermal neutrons. The calculations were carried out for the highest energy line of gamma rays arising in given litology. Gamma-ray flux from the neutron radiative capture has been calculated versus rock porosity and model dimensions and radiation migration lengths determined for given litologies. The minimum dimensions of cylindrical models are given as functions of: porosity, probe length (source-to-detector distance) lithology of model and type of medium surrounding our model. (author)
Directory of Open Access Journals (Sweden)
Ertekin Öztekin Öztekin
2015-12-01
Full Text Available Design of the distance of bolts to each other and design of the distance of bolts to the edge of connection plates are made based on minimum and maximum boundary values proposed by structural codes. In this study, reliabilities of those distances were investigated. For this purpose, loading types, bolt types and plate thicknesses were taken as variable parameters. Monte Carlo Simulation (MCS method was used in the reliability computations performed for all combination of those parameters. At the end of study, all reliability index values for all those distances were presented in graphics and tables. Results obtained from this study compared with the values proposed by some structural codes and finally some evaluations were made about those comparisons. Finally, It was emphasized in the end of study that, it would be incorrect of the usage of the same bolt distances in the both traditional designs and the higher reliability level designs.
Tableau Calculus for the Logic of Comparative Similarity over Arbitrary Distance Spaces
Alenda, Régis; Olivetti, Nicola
The logic CSL (first introduced by Sheremet, Tishkovsky, Wolter and Zakharyaschev in 2005) allows one to reason about distance comparison and similarity comparison within a modal language. The logic can express assertions of the kind "A is closer/more similar to B than to C" and has a natural application to spatial reasoning, as well as to reasoning about concept similarity in ontologies. The semantics of CSL is defined in terms of models based on different classes of distance spaces and it generalizes the logic S4 u of topological spaces. In this paper we consider CSL defined over arbitrary distance spaces. The logic comprises a binary modality to represent comparative similarity and a unary modality to express the existence of the minimum of a set of distances. We first show that the semantics of CSL can be equivalently defined in terms of preferential models. As a consequence we obtain the finite model property of the logic with respect to its preferential semantic, a property that does not hold with respect to the original distance-space semantics. Next we present an analytic tableau calculus based on its preferential semantics. The calculus provides a decision procedure for the logic, its termination is obtained by imposing suitable blocking restrictions.
The depth estimation of 3D face from single 2D picture based on manifold learning constraints
Li, Xia; Yang, Yang; Xiong, Hailiang; Liu, Yunxia
2018-04-01
The estimation of depth is virtual important in 3D face reconstruction. In this paper, we propose a t-SNE based on manifold learning constraints and introduce K-means method to divide the original database into several subset, and the selected optimal subset to reconstruct the 3D face depth information can greatly reduce the computational complexity. Firstly, we carry out the t-SNE operation to reduce the key feature points in each 3D face model from 1×249 to 1×2. Secondly, the K-means method is applied to divide the training 3D database into several subset. Thirdly, the Euclidean distance between the 83 feature points of the image to be estimated and the feature point information before the dimension reduction of each cluster center is calculated. The category of the image to be estimated is judged according to the minimum Euclidean distance. Finally, the method Kong D will be applied only in the optimal subset to estimate the depth value information of 83 feature points of 2D face images. Achieving the final depth estimation results, thus the computational complexity is greatly reduced. Compared with the traditional traversal search estimation method, although the proposed method error rate is reduced by 0.49, the number of searches decreases with the change of the category. In order to validate our approach, we use a public database to mimic the task of estimating the depth of face images from 2D images. The average number of searches decreased by 83.19%.
Full-Angle Quaternions for Robustly Matching Vectors of 3D Rotations
Liwicki, Stephan; Pham, Minh-Tri; Zafeiriou, Stefanos; Pantic, Maja; Stenger, Björn
In this paper we introduce a new distance for robustly matching vectors of 3D rotations. A special representation of 3D rotations, which we coin full-angle quaternion (FAQ), allows us to express this distance as Euclidean. We apply the distance to the problems of 3D shape recognition from point
Renormalized G-convolution of n-point functions in quantum field theory. I. The Euclidean case
International Nuclear Information System (INIS)
Bros, Jacques; Manolessou-Grammaticou, Marietta.
1977-01-01
The notion of Feynman amplitude associated with a graph G in perturbative quantum field theory admits a generalized version in which each vertex v of G is associated with a general (non-perturbative) nsub(v)-point function Hsup(nsub(v)), nsub(v) denoting the number of lines which are incident to v in G. In the case where no ultraviolet divergence occurs, this has been performed directly in complex momentum space through Bros-Lassalle's G-convolution procedure. The authors propose a generalization of G-convolution which includes the case when the functions Hsup(nsub(v)) are not integrable at infinity but belong to a suitable class of slowly increasing functions. A finite part of the G-convolution integral is then defined through an algorithm which closely follows Zimmermann's renormalization scheme. The case of Euclidean four-momentum configurations is only treated
Particle swarm optimization for determining shortest distance to voltage collapse
Energy Technology Data Exchange (ETDEWEB)
Arya, L.D.; Choube, S.C. [Electrical Engineering Department, S.G.S.I.T.S. Indore, MP 452 003 (India); Shrivastava, M. [Electrical Engineering Department, Government Engineering College Ujjain, MP 456 010 (India); Kothari, D.P. [Centre for Energy Studies, Indian Institute of Technology, Delhi (India)
2007-12-15
This paper describes an algorithm for computing shortest distance to voltage collapse or determination of CSNBP using PSO technique. A direction along CSNBP gives conservative results from voltage security view point. This information is useful to the operator to steer the system away from this point by taking corrective actions. The distance to a closest bifurcation is a minimum of the loadability given a slack bus or participation factors for increasing generation as the load increases. CSNBP determination has been formulated as an optimization problem to be used in PSO technique. PSO is a new evolutionary algorithm (EA) which is population based inspired by the social behavior of animals such as fish schooling and birds flocking. It can handle optimization problems with any complexity since mechanization is simple with few parameters to be tuned. The developed algorithm has been implemented on two standard test systems. (author)
Vertices Contained In All Or In No Minimum Semitotal Dominating Set Of A Tree
Directory of Open Access Journals (Sweden)
Henning Michael A.
2016-02-01
Full Text Available Let G be a graph with no isolated vertex. In this paper, we study a parameter that is squeezed between arguably the two most important domination parameters; namely, the domination number, γ(G, and the total domination number, γt(G. A set S of vertices in a graph G is a semitotal dominating set of G if it is a dominating set of G and every vertex in S is within distance 2 of another vertex of S. The semitotal domination number, γt2(G, is the minimum cardinality of a semitotal dominating set of G. We observe that γ(G ≤ γt2(G ≤ γt(G. We characterize the set of vertices that are contained in all, or in no minimum semitotal dominating set of a tree.
Farm Planning by Fuzzy Multi Objective Programming Model
Directory of Open Access Journals (Sweden)
m Raei Jadidi
2010-05-01
Full Text Available In current study, Fuzzy Goal Programming (FGP model by considering a set of social and economic goals, was applied to optimal land allocation in Koshksaray district, Marand city, East Azarbaijan province, Iran. Farmer goals including total cultivable area, factor of production, production levels of various crops and total expected profit were considered fuzzily in establishment of the model. The goals were considered by 16 scenarios in the form of single objective, compound and priority structures. Results showed that, cost minimization in single objective and compound scenario is the best as compared with current conditions. In priority structure, scenario 10 with priorities of profit maximization, cost minimization, satisfying of production goals considering cost minimization and production goals, and scenario 13 with priorities of profit maximization, satisfying factor of production goals, cost minimization and fulfilling production goals, had minimum Euclidean Distance and satisfied the fuzzy objectives. Moreover, dry barley, irrigated and dry wheat and irrigated barely had maximum and minimum cultivated area, respectively. According to the findings, by reallocation of resources, farmers can achieve their better goals and objectives.
Rising above the Minimum Wage.
Even, William; Macpherson, David
An in-depth analysis was made of how quickly most people move up the wage scale from minimum wage, what factors influence their progress, and how minimum wage increases affect wage growth above the minimum. Very few workers remain at the minimum wage over the long run, according to this study of data drawn from the 1977-78 May Current Population…
Spontaneous cluster activity in the inferior olivary nucleus in brainstem slices from postnatal mice
DEFF Research Database (Denmark)
Rekling, Jens C; Reveles Jensen, Kristian; Jahnsen, Henrik
2012-01-01
-active with separate clusters at different times. The coherence between calcium transients in IO neurons decreased with Euclidean distance between the cells reaching low values at 100-200 µm distances. Intracellular recordings from IO neurons during cluster formation revealed the presence of spikelet-like potentials...
Modeling Internal Radiation Therapy
van den Broek, Egon; Schouten, Theo E.; Pellegrini, M.; Fred, A.; Filipe, J.; Gamboa, H.
2011-01-01
A new technique is described to model (internal) radiation therapy. It is founded on morphological processing, in particular distance transforms. Its formal basis is presented as well as its implementation via the Fast Exact Euclidean Distance (FEED) transform. Its use for all variations of internal
A proposal of comparative Maunder minimum cosmogenic isotope measurements
International Nuclear Information System (INIS)
Attolini, M.R.; Nanni, T.; Galli, M.; Povinec, P.
1989-01-01
There are at present contraddictory conclusions about solar activity and cosmogenic isotope production variation during Maunder Minimum. The interaction of solar wind with galactic cosmic rays, the dynamic behaviour of the Sun either as a system having an internal clock, and/or as a forced non linear system, are important aspects that can shed new light on solar physics, the Earth-Sun relationship and the climatic variation. An essential progress in the matter might be made by clarifying the cosmogenic isotope production during the mentioned interval. As it seems that during Maunder Minimum the Be10 production oscillates of about a factor of two, the authors have also to expect short scale enhanced variations in tree rings radiocarbon concentrations for the same interval. It is therefore highly desirable that for the same interval, that the authors would identify with 1640-1720 AD, detailed concentration measurements both of Be10 (in dated polar ice in addition to those of Beer et al.) and of tree ring radiocarbon, be made with cross-checking, in samples of different latitudes, longitudes and within short and large distance of the sea. The samples could be taken, as for example in samples from the central Mediterranean region, in the Baltic region and in other sites from central Europe and Asia
Scaling of Natal Dispersal Distances in Terrestrial Birds and Mammals
Directory of Open Access Journals (Sweden)
Glenn D. Sutherland
2000-07-01
Full Text Available Natal dispersal is a process that is critical in the spatial dynamics of populations, including population spread, recolonization, and gene flow. It is a central focus of conservation issues for many vertebrate species. Using data for 77 bird and 68 mammal species, we tested whether median and maximum natal dispersal distances were correlated with body mass, diet type, social system, taxonomic family, and migratory status. Body mass and diet type were found to predict both median and maximum natal dispersal distances in mammals: large species dispersed farther than small ones, and carnivorous species dispersed farther than herbivores and omnivores. Similar relationships occurred for carnivorous bird species, but not for herbivorous or omnivorous ones. Natal dispersal distances in birds or mammals were not significantly related to broad categories of social systems. Only in birds were factors such as taxonomic relatedness and migratory status correlated with natal dispersal, and then only for maximum distances. Summary properties of dispersal processes appeared to be derived from interactions among behavioral and morphological characteristics of species and from their linkages to the dynamics of resource availability in landscapes. In all the species we examined, most dispersers moved relatively short distances, and long-distance dispersal was uncommon. On the basis of these findings, we fit an empirical model based on the negative exponential distribution for calculating minimum probabilities that animals disperse particular distances from their natal areas. This model, coupled with knowledge of a species' body mass and diet type, can be used to conservatively predict dispersal distances for different species and examine possible consequences of large-scale habitat alterations on connectedness between populations. Taken together, our results can provide managers with the means to identify species vulnerable to landscape-level habitat changes
On Finding the Shortest Distance of a Point From a Line: Which ...
Indian Academy of Sciences (India)
One more application is in disaster management in the vicinity of high ... A proper safety dis- .... of a point in the n-dimensional Euclidean space Rn from a hyper- plane. Let the ... Let the coordinates in the new system be represented by. (x ,y ).
Classification in medical image analysis using adaptive metric k-NN
DEFF Research Database (Denmark)
Chen, Chen; Chernoff, Konstantin; Karemore, Gopal
2010-01-01
The performance of the k-nearest neighborhoods (k-NN) classifier is highly dependent on the distance metric used to identify the k nearest neighbors of the query points. The standard Euclidean distance is commonly used in practice. This paper investigates the performance of k-NN classifier...
Estimating the relationship between abundance and distribution
DEFF Research Database (Denmark)
Rindorf, Anna; Lewy, Peter
2012-01-01
based on Euclidean distance to the centre of gravity of the spatial distribution. Only the proportion of structurally empty areas, Lloyds index, and indices of the distance to the centre of gravity of the spatial distribution are unbiased at all levels of abundance. The remaining indices generate...
Efficient Proximity Detection among Mobile Users via SelfTuning Policies
DEFF Research Database (Denmark)
Yiu, Man Lung; Hou U, Leong; Saltenis, Simonas
2010-01-01
Given a set of users, their friend relationships, and a distance threshold per friend pair, the proximity detection problem is to find each pair of friends such that the Euclidean distance between them is within the given threshold. This problem plays an essential role in friend...
Employment effects of minimum wages
Neumark, David
2014-01-01
The potential benefits of higher minimum wages come from the higher wages for affected workers, some of whom are in low-income families. The potential downside is that a higher minimum wage may discourage employers from using the low-wage, low-skill workers that minimum wages are intended to help. Research findings are not unanimous, but evidence from many countries suggests that minimum wages reduce the jobs available to low-skill workers.
Euclidean action for vacuum decay in a de Sitter universe
International Nuclear Information System (INIS)
Balek, V.; Demetrian, M.
2005-01-01
The behavior of the action of the instantons describing vacuum decay in a de Sitter is investigated. For a near-to-limit instanton (a Coleman-de Luccia instanton close to some Hawking-Moss instanton) we find approximate formulas for the Euclidean action by expanding the scalar field and the metric of the instanton in the powers of the scalar field amplitude. The order of the magnitude of the correction to the Hawking-Moss action depends on the order of the instanton (the number of crossings of the barrier by the scalar field): for instantons of odd and even orders the correction is of the fourth and third order in the scalar field amplitude, respectively. If a near-to-limit instanton of the first order exists in a potential with the curvature at the top of the barrier greater than 4x(Hubble constant) 2 , which is the case if the fourth derivative of the potential at the top of the barrier is greater than some negative limit value, the action of the instanton is less than the Hawking-Moss action and, consequently, the instanton determines the outcome of the vacuum decay if no other Coleman-de Luccia instanton is admitted by the potential. A numerical study shows that for the quartic potential the physical mode of the vacuum decay is given by the Coleman-de Luccia instanton of the first order also in the region of parameters in which the potential admits two instantons of the second order
Fields, Gary S.; Kanbur, Ravi
2005-01-01
Textbook analysis tells us that in a competitive labor market, the introduction of a minimum wage above the competitive equilibrium wage will cause unemployment. This paper makes two contributions to the basic theory of the minimum wage. First, we analyze the effects of a higher minimum wage in terms of poverty rather than in terms of unemployment. Second, we extend the standard textbook model to allow for incomesharing between the employed and the unemployed. We find that there are situation...
Heat stroke risk for open-water swimmers during long-distance events.
Macaluso, Filippo; Barone, Rosario; Isaacs, Ashwin W; Farina, Felicia; Morici, Giuseppe; Di Felice, Valentina
2013-12-01
Open-water swimming is a rapidly growing sport discipline worldwide, and clinical problems associated with long-distance swimming are now better recognized and managed more effectively. The most prevalent medical risk associated with an open-water swimming event is hypothermia; therefore, the Federation Internationale De Natation (FINA) has instituted 2 rules to reduce this occurrence related to the minimum water temperature and the time taken to complete the race. Another medical risk that is relevant to open-water swimmers is heat stroke, a condition that can easily go unnoticed. The purpose of this review is to shed light on this physiological phenomenon by examining the physiological response of swimmers during long-distance events, to define a maximum water temperature limit for competitions. We conclude that competing in water temperatures exceeding 33°C should be avoided. Copyright © 2013 Wilderness Medical Society. Published by Elsevier Inc. All rights reserved.
Properties of 3-dimensional line location models
DEFF Research Database (Denmark)
Brimberg, Jack; Juel, Henrik; Schöbel, Anita
2002-01-01
We consider the problem of locating a line with respect to some existing facilities in 3-dimensional space, such that the sum of weighted distances between the line and the facilities is minimized. Measuring distance using the l\\_p norm is discussed, along with the special cases of Euclidean...
2010-02-08
... capital and reserve requirements to be issued by order or regulation with respect to a product or activity... minimum capital requirements. Section 1362(a) establishes a minimum capital level for the Enterprises... entities required under this section.\\6\\ \\3\\ The Bank Act's current minimum capital requirements apply to...
A Pareto-Improving Minimum Wage
Eliav Danziger; Leif Danziger
2014-01-01
This paper shows that a graduated minimum wage, in contrast to a constant minimum wage, can provide a strict Pareto improvement over what can be achieved with an optimal income tax. The reason is that a graduated minimum wage requires high-productivity workers to work more to earn the same income as low-productivity workers, which makes it more difficult for the former to mimic the latter. In effect, a graduated minimum wage allows the low-productivity workers to benefit from second-degree pr...
Directory of Open Access Journals (Sweden)
Heekang Kim
2016-07-01
Full Text Available This paper proposes a vehicle light detection method using a hyperspectral camera instead of a Charge-Coupled Device (CCD or Complementary metal-Oxide-Semiconductor (CMOS camera for adaptive car headlamp control. To apply Intelligent Headlight Control (IHC, the vehicle headlights need to be detected. Headlights are comprised from a variety of lighting sources, such as Light Emitting Diodes (LEDs, High-intensity discharge (HID, and halogen lamps. In addition, rear lamps are made of LED and halogen lamp. This paper refers to the recent research in IHC. Some problems exist in the detection of headlights, such as erroneous detection of street lights or sign lights and the reflection plate of ego-car from CCD or CMOS images. To solve these problems, this study uses hyperspectral images because they have hundreds of bands and provide more information than a CCD or CMOS camera. Recent methods to detect headlights used the Spectral Angle Mapper (SAM, Spectral Correlation Mapper (SCM, and Euclidean Distance Mapper (EDM. The experimental results highlight the feasibility of the proposed method in three types of lights (LED, HID, and halogen.
Deza, Michel Marie
2016-01-01
This 4th edition of the leading reference volume on distance metrics is characterized by updated and rewritten sections on some items suggested by experts and readers, as well a general streamlining of content and the addition of essential new topics. Though the structure remains unchanged, the new edition also explores recent advances in the use of distances and metrics for e.g. generalized distances, probability theory, graph theory, coding theory, data analysis. New topics in the purely mathematical sections include e.g. the Vitanyi multiset-metric, algebraic point-conic distance, triangular ratio metric, Rossi-Hamming metric, Taneja distance, spectral semimetric between graphs, channel metrization, and Maryland bridge distance. The multidisciplinary sections have also been supplemented with new topics, including: dynamic time wrapping distance, memory distance, allometry, atmospheric depth, elliptic orbit distance, VLBI distance measurements, the astronomical system of units, and walkability distance. Lea...
National Research Council Canada - National Science Library
Sorgaard, Duane
2004-01-01
.... A time-to-location algorithm can successfully resolve a geographic location of a computer node using only latency information from known sites and mathematically calculating the Euclidean distance...
International Nuclear Information System (INIS)
Dam, H. van; Leege, P.F.A. de
1987-01-01
An analysis is presented of thermal systems with minimum critical mass, based on the use of materials with optimum neutron moderating and reflecting properties. The optimum fissile material distributions in the systems are obtained by calculations with standard computer codes, extended with a routine for flat fuel importance search. It is shown that in the minimum critical mass configuration a considerable part of the fuel is positioned in the reflector region. For 239 Pu a minimum critical mass of 87 g is found, which is the lowest value reported hitherto. (author)
National Research Council Canada - National Science Library
Braddock, Joseph
1997-01-01
A study reviewing the existing Army Distance Learning Plan (ADLP) and current Distance Learning practices, with a focus on the Army's training and educational challenges and the benefits of applying Distance Learning techniques...
Directory of Open Access Journals (Sweden)
Ahmadreza Ghasemi
2017-01-01
Full Text Available The concept of antifragility has received much attention from researchers in recent years. Contrary to fragile systems which fail when exposed to stressors, antifragile systems prosper and improve in response to unpredictability, volatility, randomness, chaos and disturbance. The implications of antifragility goes beyond resilience or robustness. A resilient system resists stress and remains the same; while an antifragile system improves. Taleb argues that antifragility is required for dealing with events that he called black swans or X-events, which are scarce, unpredictable, and extreme events. Such events come as a surprise and have major consequences. The concept of antifragility was developed by Taleb in a socioeconomic context, not in industrial production. However, the authors think that this concept may have its greatest practical utilization when applied to industrial environments. Thus, they focused on this concept in the article aiming to investigate the level of antifragility in an organization. In order to perform this, the authors used a case study based on an Iranian manufacturer of banknotes and security paper (TAKAB. Firstly, a questionnaire was designed based on 7 criteria related to antifragility using the five-point Likert scale and a triangular fuzzy number for each linguistic term is defined. In the next phase, the weight of each component was obtained using the entropy technique. In the final stage, the Euclidean distance between the aggregated fuzzy antifragility index (FAI and each linguistic term used during this case study was calculated. Finally, based on these results, the level of the organization's antifragility was assessed as satisfactorily antifragile, based on the minimum Euclidean distance. (original abstract
Door Security using Face Detection and Raspberry Pi
Bhutra, Venkatesh; Kumar, Harshav; Jangid, Santosh; Solanki, L.
2018-03-01
With the world moving towards advanced technologies, security forms a crucial part in daily life. Among the many techniques used for this purpose, Face Recognition stands as effective means of authentication and security. This paper deals with the user of principal component and security. PCA is a statistical approach used to simplify a data set. The minimum Euclidean distance found from the PCA technique is used to recognize the face. Raspberry Pi a low cost ARM based computer on a small circuit board, controls the servo motor and other sensors. The servo-motor is in turn attached to the doors of home and opens up when the face is recognized. The proposed work has been done using a self-made training database of students from B.K. Birla Institute of Engineering and Technology, Pilani, Rajasthan, India.
REPRESENTATIONS OF DISTANCE: DIFFERENCES IN UNDERSTANDING DISTANCE ACCORDING TO TRAVEL METHOD
Directory of Open Access Journals (Sweden)
Gunvor Riber Larsen
2017-12-01
Full Text Available This paper explores how Danish tourists represent distance in relation to their holiday mobility and how these representations of distance are a result of being aero-mobile as opposed to being land-mobile. Based on interviews with Danish tourists, whose holiday mobility ranges from the European continent to global destinations, the first part of this qualitative study identifies three categories of representations of distance that show how distance is being ‘translated’ by the tourists into non-geometric forms: distance as resources, distance as accessibility, and distance as knowledge. The representations of distance articulated by the Danish tourists show that distance is often not viewed in ‘just’ kilometres. Rather, it is understood in forms that express how transcending the physical distance through holiday mobility is dependent on individual social and economic contexts, and on whether the journey was undertaken by air or land. The analysis also shows that being aeromobile is the holiday transportation mode that removes the tourists the furthest away from physical distance, resulting in the distance travelled by air being represented in ways that have the least correlation, in the tourists’ minds, with physical distance measured in kilometres.
2010-01-01
... 5 Administrative Personnel 1 2010-01-01 2010-01-01 false Minimum wage. 551.301 Section 551.301... FAIR LABOR STANDARDS ACT Minimum Wage Provisions Basic Provision § 551.301 Minimum wage. (a)(1) Except... employees wages at rates not less than the minimum wage specified in section 6(a)(1) of the Act for all...
International Nuclear Information System (INIS)
Stenin, V.Ya.; Stepanov, P.V.
2015-01-01
A hardened DICE cell layout design is based on the two spaced transistor clusters of the DICE cell each consisting of four transistors. The larger the distance between these two CMOS transistor clusters, the more robust the hardened DICE SRAM to Single Event Upsets. Some versions of the 28-nm and 65-nm DICE CMOS SRAM block composition have been suggested with minimum cluster distances of 2.27-2.32 mkm. The area of hardened 28-nm DICE CMOS cells is larger than the area of 28-nm 6T CMOS cells by a factor of 2.1 [ru
Directory of Open Access Journals (Sweden)
Keiichi Kubota
2007-03-01
Full Text Available We implemented a synchronous distance course entitled: Introductory Finance designed for undergraduate students. This course was held between two Japanese universities. Stable Internet connections allowing minimum delay and minimum interruptions of the audio-video streaming signals were used. Students were equipped with their own PCs with pre-loaded learning materials and Microsoft Excel exercises. These accompanying course and exercise materials helped students comprehend the mathematical equations and statistical numerical exercises that are indispensable to learning Introductory Finance effectively. The general tendency for students, not to raise questions during the class hours in Japan, however, was found to be a big obstacle. As such, motivational devices are needed and should ideally be combined to promote interaction between the e-classrooms.
A test for the minimum scale of grooving on the Amatrice and Norcia earthquakes
Okamoto, K.; Brodsky, E. E.; Billi, A.
2017-12-01
As stress builds up along a fault, elastic strain energy builds until it cannot be accommodated by small-scale ductile deformation and then the fault brittlely fails. This brittle failure is associated with the grooving process that causes slickensides along fault planes. Therefore the scale at which slickensides disappear could be geological evidence of earthquake nucleation. Past studies found the minimum scale of grooving, however the studied fault surfaces were not exposed by recent earthquakes. These measurements could have been a product of chemical or mechanical weathering. On August 24th and October 30th of 2016, MW 6.0 and 6.5 earthquakes shook central Italy. The earthquakes caused decimeter to meter scale fault scarps along the Mt. Vettoretto Fault. Here, we analyze samples of a scarp using white light interferometry in order to determine if the minimum scale of grooving is present. Results suggest that grooving begins around 100 μm for these samples, which is consistent with previous findings of faults without any direct evidence of earthquakes. The measurement is also consistent with typical values of the frictional weakening distance Dc, which also is associated with a transition between ductile and brittle behavior. The measurements show that the minimum scale of grooving is a useful measure of the behavior of faults.
Directory of Open Access Journals (Sweden)
Kim Guan SAW
2017-10-01
Full Text Available This article revisits the cognitive load theory to explore the use of worked examples to teach a selected topic in a higher level undergraduate physics course for distance learners at the School of Distance Education, Universiti Sains Malaysia. With a break of several years from receiving formal education and having only minimum science background, distance learners need an appropriate instructional strategy for courses that require complex conceptualization and mathematical manipulations. As the working memory is limited, distance learners need to acquire domain specific knowledge in stages to lessen cognitive load. This article charts a learning task with a lower cognitive load to teach Fermi-Dirac distribution and demonstrates the use of sequential worked examples. Content taught in stages using worked examples can be presented as a form of didactic conversation to reduce transactional distance. This instructional strategy can be applied to similar challenging topics in other well-structured domains in a distance learning environment.
Solar wind and coronal structure near sunspot minimum - Pioneer and SMM observations from 1985-1987
Mihalov, J. D.; Barnes, A.; Hundhausen, A. J.; Smith, E. J.
1990-01-01
Changes in solar wind speed and magnetic polarity observed at the Pioneer spacecraft are discussed here in terms of the changing magnetic geometry implied by SMM coronagraph observations over the period 1985-1987. The pattern of recurrent solar wind streams, the long-term average speed, and the sector polarity of the interplanetary magnetic field all changed in a manner suggesting both a temporal variation, and a changing dependence on heliographic latitude. Coronal observations during this epoch show a systematic variation in coronal structure and the magnetic structure imposed on the expanding solar wind. These observations suggest interpretation of the solar wind speed variations in terms of the familiar model where the speed increases with distance from a nearly flat interplanetary current sheet, and where this current sheet becomes aligned with the solar equatorial plane as sunspot minimum approaches, but deviates rapidly from that orientation after minimum.
International Nuclear Information System (INIS)
Cheng Shaoyong; Xiu Shixin; Wang Jimei; Shen Zhengchao
2006-01-01
The greenhouse effect of SF 6 is a great concern today. The development of high voltage vacuum circuit breakers becomes more important. The vacuum circuit breaker has minimum pollution to the environment. The vacuum interrupter is the key part of a vacuum circuit breaker. The interrupting characteristics in vacuum and arc-controlling technique are the main problems to be solved for a longer gap distance in developing high voltage vacuum interrupters. To understand the vacuum arc characteristics and provide effective technique to control vacuum arc in a long gap distance, the arc mode transition of a cup-type axial magnetic field electrode is observed by a high-speed charge coupled device (CCD) video camera under different gap distances while the arc voltage and arc current are recorded. The controlling ability of the axial magnetic field on vacuum arc obviously decreases when the gap distance is longer than 40 mm. The noise components and mean value of the arc voltage significantly increase. The effective method for controlling the vacuum arc characteristics is provided by long gap distances based on the test results. The test results can be used as a reference to develop high voltage and large capacity vacuum interrupters
Directory of Open Access Journals (Sweden)
Amy Mizen
2015-11-01
Full Text Available The aim of this study was to quantify the error associated with different accessibility methods commonly used by public health researchers. Network distances were calculated from each household to the nearest GP our study area in the UK. Household level network distances were assigned as the gold standard and compared to alternate widely used accessibility methods. Four spatial aggregation units, two centroid types and two distance calculation methods represent commonly used accessibility calculation methods. Spearman's rank coefficients were calculated to show the extent which distance measurements were correlated with the gold standard. We assessed the proportion of households that were incorrectly assigned to GP for each method. The distance method, level of spatial aggregation and centroid type were compared between urban and rural regions. Urban distances were less varied from the gold standard, with smaller errors, compared to rural regions. For urban regions, Euclidean distances are significantly related to network distances. Network distances assigned a larger proportion of households to the correct GP compared to Euclidean distances, for both urban and rural morphologies. Our results, stratified by urban and rural populations, explain why contradicting results have been reported in the literature. The results we present are intended to be used aide-memoire by public health researchers using geographical aggregated data in accessibility research.
Directory of Open Access Journals (Sweden)
Moslem Akbarzadeh
2017-01-01
Full Text Available Introduction: For water resources monitoring, Evaluation of groundwater quality obtained via detailed analysis of pollution data. The most fundamental analysis is to identify the exact measurement of dangerous zones and homogenous station identification in terms of pollution. In case of quality evaluation, the monitoring improvement could be achieved via identifying homogenous wells in terms of pollution. Presenting a method for clustering is essential in large amounts of quality data for aquifer monitoring and quality evaluation, including identification of homogeneous stations of monitoring network and their clustering based on pollution. In this study, with the purpose of Mashhad aquifer quality evaluation, clustering have been studied based on Euclidean distance and Entropy criteria. Cluster analysis is the task of grouping a set of objects in such a way that objects in the same group (called a cluster are more similar (in some sense or another to each other than to those in other groups (clusters. SNI as a combined entropy measure for clustering calculated from dividing mutual information of two values (pollution index values to the joint entropy. These measures apply as similar distance criteria for monitoring stations clustering. Materials and Methods: First, nitrate data (as pollution index and electrical conductivity (EC (as covariate collected from the related locational situation of 287 wells in statistical period 2002 to 2011. Having identified the outlying data and estimating non-observed points by spatial-temporal Kriging method and then standardizes them, the clustering process was carried out. A similar distance of wells calculated through a clustering process based on Euclidean distance and Entropy (SNI criteria. This difference explained by characteristics such as the location of wells (longitude & latitude and the pollution index (nitrate. Having obtained a similar distance of each well to others, the hierarchical clustering
On the minimum core mass for giant planet formation at wide separations
International Nuclear Information System (INIS)
Piso, Ana-Maria A.; Youdin, Andrew N.
2014-01-01
In the core accretion hypothesis, giant planets form by gas accretion onto solid protoplanetary cores. The minimum (or critical) core mass to form a gas giant is typically quoted as 10 M ⊕ . The actual value depends on several factors: the location in the protoplanetary disk, atmospheric opacity, and the accretion rate of solids. Motivated by ongoing direct imaging searches for giant planets, this study investigates core mass requirements in the outer disk. To determine the fastest allowed rates of gas accretion, we consider solid cores that no longer accrete planetesimals, as this would heat the gaseous envelope. Our spherical, two-layer atmospheric cooling model includes an inner convective region and an outer radiative zone that matches onto the disk. We determine the minimum core mass for a giant planet to form within a typical disk lifetime of 3 Myr. The minimum core mass declines with disk radius, from ∼8.5 M ⊕ at 5 AU to ∼3.5 M ⊕ at 100 AU, with standard interstellar grain opacities. Lower temperatures in the outer disk explain this trend, while variations in disk density are less influential. At all distances, a lower dust opacity or higher mean molecular weight reduces the critical core mass. Our non-self-gravitating, analytic cooling model reveals that self-gravity significantly affects early atmospheric evolution, starting when the atmosphere is only ∼10% as massive as the core.
Distribution of the minimum path on percolation clusters: A renormalization group calculation
International Nuclear Information System (INIS)
Hipsh, Lior.
1993-06-01
This thesis uses the renormalization group for the research of the chemical distance or the minimal path on percolation clusters on a 2 dimensional square lattice. Our aims are to calculate analytically (iterative calculation) the fractal dimension of the minimal path. d min. , and the distributions of the minimum paths, l min for different lattice sizes and for different starting densities (including the threshold value p c ). For the distributions. We seek for an analytic form which describes them. The probability to get a minimum path for each linear size L is calculated by iterating the distribution of l min for the basic cell of size 2*2 to the next scale sizes, using the H cell renormalization group. For the threshold value of p and for values near to p c . We confirm a scaling in the form: P(l,L) =f1/l(l/(L d min ). L - the linear size, l - the minimum path. The distribution can be also represented in the Fourier space, so we will try to solve the renormalization group equations in this space. A numerical fitting is produced and compared to existing numerical results. In order to improve the agreement between the renormalization group and the numerical simulations, we also present attempts to generalize the renormalization group by adding more parameters, e.g. correlations between bonds in different directions or finite densities for occupation of bonds and sites. (author) 17 refs
Maximally-localized position, Euclidean path-integral, and thermodynamics in GUP quantum mechanics
Bernardo, Reginald Christian S.; Esguerra, Jose Perico H.
2018-04-01
In dealing with quantum mechanics at very high energies, it is essential to adapt to a quasiposition representation using the maximally-localized states because of the generalized uncertainty principle. In this paper, we look at maximally-localized states as eigenstates of the operator ξ = X + iβP that we refer to as the maximally-localized position. We calculate the overlap between maximally-localized states and show that the identity operator can be expressed in terms of the maximally-localized states. Furthermore, we show that the maximally-localized position is diagonal in momentum-space and that the maximally-localized position and its adjoint satisfy commutation and anti-commutation relations reminiscent of the harmonic oscillator commutation and anti-commutation relations. As application, we use the maximally-localized position in developing the Euclidean path-integral and introduce the compact form of the propagator for maximal localization. The free particle momentum-space propagator and the propagator for maximal localization are analytically evaluated up to quadratic-order in β. Finally, we obtain a path-integral expression for the partition function of a thermodynamic system using the maximally-localized states. The partition function of a gas of noninteracting particles is evaluated. At temperatures exceeding the Planck energy, we obtain the gas' maximum internal energy N / 2 β and recover the zero heat capacity of an ideal gas.
Topographic determinants of foot and mouth disease transmission in the UK 2001 epidemic
Directory of Open Access Journals (Sweden)
Keeling Matthew J
2006-01-01
Full Text Available Abstract Background A key challenge for modelling infectious disease dynamics is to understand the spatial spread of infection in real landscapes. This ideally requires a parallel record of spatial epidemic spread and a detailed map of susceptible host density along with relevant transport links and geographical features. Results Here we analyse the most detailed such data to date arising from the UK 2001 foot and mouth epidemic. We show that Euclidean distance between infectious and susceptible premises is a better predictor of transmission risk than shortest and quickest routes via road, except where major geographical features intervene. Conclusion Thus, a simple spatial transmission kernel based on Euclidean distance suffices in most regions, probably reflecting the multiplicity of transmission routes during the epidemic.
On the stretch factor of convex Delaunay graphs
Directory of Open Access Journals (Sweden)
Prosenjit Bose
2010-06-01
Full Text Available Let C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC(S of S is defined to be the dual of the Voronoi diagram of S with respect to the convex distance function defined by C. We prove that DGC(S is a t-spanner for S, for some constant t that depends only on the shape of the set C. Thus, for any two points p and q in S, the graph DGC(S contains a path between p and q whose Euclidean length is at most t times the Euclidean distance between p and q.
Deza, Michel Marie
2014-01-01
This updated and revised third edition of the leading reference volume on distance metrics includes new items from very active research areas in the use of distances and metrics such as geometry, graph theory, probability theory and analysis. Among the new topics included are, for example, polyhedral metric space, nearness matrix problems, distances between belief assignments, distance-related animal settings, diamond-cutting distances, natural units of length, Heidegger’s de-severance distance, and brain distances. The publication of this volume coincides with intensifying research efforts into metric spaces and especially distance design for applications. Accurate metrics have become a crucial goal in computational biology, image analysis, speech recognition and information retrieval. Leaving aside the practical questions that arise during the selection of a ‘good’ distance function, this work focuses on providing the research community with an invaluable comprehensive listing of the main available di...
Load Balancing Routing with Bounded Stretch
Directory of Open Access Journals (Sweden)
Chen Siyuan
2010-01-01
Full Text Available Routing in wireless networks has been heavily studied in the last decade. Many routing protocols are based on classic shortest path algorithms. However, shortest path-based routing protocols suffer from uneven load distribution in the network, such as crowed center effect where the center nodes have more load than the nodes in the periphery. Aiming to balance the load, we propose a novel routing method, called Circular Sailing Routing (CSR, which can distribute the traffic more evenly in the network. The proposed method first maps the network onto a sphere via a simple stereographic projection, and then the route decision is made by a newly defined "circular distance" on the sphere instead of the Euclidean distance in the plane. We theoretically prove that for a network, the distance traveled by the packets using CSR is no more than a small constant factor of the minimum (the distance of the shortest path. We also extend CSR to a localized version, Localized CSR, by modifying greedy routing without any additional communication overhead. In addition, we investigate how to design CSR routing for 3D networks. For all proposed methods, we conduct extensive simulations to study their performances and compare them with global shortest path routing or greedy routing in 2D and 3D wireless networks.
Lie sphere transformations and the focal sets of hyper-surfaces
International Nuclear Information System (INIS)
Buyske, S.G.
1988-01-01
Isoparametric hypersurfaces of euclidean or spherical space are those with constant principal curvatures. The image of the hypersurface under a conformal transformation of the ambient space will no longer be isoparametric, but will be Dupin: the principal curvatures will be constant in the principal directions. Dupin hypersurfaces are closely related to taut hypersurfaces, for which almost every distance function is a perfect Morse function (the number of critical points is the minimum for the topology of the hypersurface). A weaker concept is tightness, for which almost every linear height function is required to be a perfect Morse function. Dupin and taut hypersurfaces are preserved not just under conformal, or Moebuius, transformations but also under the more general Lie sphere transformations. Roughly speaking, these are generated by Moebius transformations and parallel transformations. The purpose of this thesis is to study certain taut or Dupin hypersurfaces under Lie sphere transformations including the effect on the focal set. The thesis is divided into four sections. After the introduction, the method of studying hypersurfaces as Lie sphere objects is developed. The third section extends the concepts of tightness and tautness of semi-euclidean space. The final section shows that if a hypersurface is the Lie sphere image of certain standard constructions (tubes, cylinders, and rotations), the resulting family of curvature spheres is taut in the Lie quadric
Comparing Phylogenetic Trees by Matching Nodes Using the Transfer Distance Between Partitions.
Bogdanowicz, Damian; Giaro, Krzysztof
2017-05-01
Ability to quantify dissimilarity of different phylogenetic trees describing the relationship between the same group of taxa is required in various types of phylogenetic studies. For example, such metrics are used to assess the quality of phylogeny construction methods, to define optimization criteria in supertree building algorithms, or to find horizontal gene transfer (HGT) events. Among the set of metrics described so far in the literature, the most commonly used seems to be the Robinson-Foulds distance. In this article, we define a new metric for rooted trees-the Matching Pair (MP) distance. The MP metric uses the concept of the minimum-weight perfect matching in a complete bipartite graph constructed from partitions of all pairs of leaves of the compared phylogenetic trees. We analyze the properties of the MP metric and present computational experiments showing its potential applicability in tasks related to finding the HGT events.
International Nuclear Information System (INIS)
Peng, W.H.
1977-01-01
A specialized moments-method computer code was constructed for the calculation of the even spatial moments of the scalar flux, phi/sub 2n/, through 2n = 80. Neutron slowing-down and transport in a medium with constant cross sections was examined and the effect of a superimposed square-well cross section minimum on the penetrating flux was studied. In the constant cross section case, for nuclei that are not too light, the scalar flux is essentially independent of the nuclide mass. The numerical results obtained were used to test the validity of existing analytic approximations to the flux at both small and large lethargies relative to the source energy. As a result it was possible to define the regions in the lethargy--distance plane where these analytic solutions apply with reasonable accuracy. A parametric study was made of the effect of a square-well cross section minimum on neutron fluxes at energies below the minimum. It was shown that the flux at energies well below the minimum is essentially independent of the position of the minimum in lethargy. The results can be described by a convolution-of-sources model involving only the lethargy separation between detector and source, the width and the relative depth of the minimum. On the basis of the computations and the corresponding model, it is possible to predict, e.g., the conditions under which transport in the region of minimum completely determines the penetrating flux. At the other extreme, the model describes when the transport in the minimum can be treated in the same manner as in any comparable lethargy interval. With the aid of these criteria it is possible to understand the apparent paradoxical effects of certain minima in neutron penetration through such media as iron and sodium
Interplay between strong correlation and adsorption distances: Co on Cu(001)
Bahlke, Marc Philipp; Karolak, Michael; Herrmann, Carmen
2018-01-01
Adsorbed transition metal atoms can have partially filled d or f shells due to strong on-site Coulomb interaction. Capturing all effects originating from electron correlation in such strongly correlated systems is a challenge for electronic structure methods. It requires a sufficiently accurate description of the atomistic structure (in particular bond distances and angles), which is usually obtained from first-principles Kohn-Sham density functional theory (DFT), which due to the approximate nature of the exchange-correlation functional may provide an unreliable description of strongly correlated systems. To elucidate the consequences of this popular procedure, we apply a combination of DFT with the Anderson impurity model (AIM), as well as DFT + U for a calculation of the potential energy surface along the Co/Cu(001) adsorption coordinate, and compare the results with those obtained from DFT. The adsorption minimum is shifted towards larger distances by applying DFT+AIM, or the much cheaper DFT +U method, compared to the corresponding spin-polarized DFT results, by a magnitude comparable to variations between different approximate exchange-correlation functionals (0.08 to 0.12 Å). This shift originates from an increasing correlation energy at larger adsorption distances, which can be traced back to the Co 3 dx y and 3 dz2 orbitals being more correlated as the adsorption distance is increased. We can show that such considerations are important, as they may strongly affect electronic properties such as the Kondo temperature.
Interface Simulation Distances
Directory of Open Access Journals (Sweden)
Pavol Černý
2012-10-01
Full Text Available The classical (boolean notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, tolerating errors (while counting them in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, and that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies.
International Nuclear Information System (INIS)
Stoffner, R.; Widmann, G.; Bale, R.; Augschoell, C.; Boehler, D.
2009-01-01
Purpose: To compare the accuracy of frameless stereotactic and robot-assisted puncture in vitro based on computed tomography (CT) imaging with a slice thickness of 1, 3, and 5 mm. Materials and Methods: 300 punctures were carried out with help of the Atlas aiming device guided by the optical navigation system Stealth Station TREONplus and 150 punctures were guided by the robotic assistance system Innomotion. Conically shaped rods were punctured with Kirschner wires. The accuracy was evaluated on the basis of control CTs by measuring the Euclidean distance between the wire tip and target and the normal distance between the target and wire. Results: With the Stealth Station a mean Euclidean distance of 1.94±0.912, 2.2±1.136, and 2.74±1.166 mm at a slice thickness of 1, 3 and 5 mm, respectively, was reached. The mean normal distance was 1.64±0.919, 1.84±1.189, and 2.48±1.196 mm, respectively. The Innomotion system resulted in a mean Euclidean distance of 1.69±0.772, 1.91±0.673, and 2.30±0.881 mm, respectively, while the mean normal distance was (1.42±0.78), 1.60±0.733, and 1.98±1.002 mm, respectively. A statistical significance between accuracies with both systems with 1 mm and 3 mm slices could not be detected (p > 0.05). At a slice thickness of 5 mm, the robot was significantly more accurate, but not as accurate as when using thinner slices (p < 0.05). The procedure time is longer for the Innomotion system (∝30 vs. ∝18 min), and the practicability is higher with the Stealth Station. (orig.)
Carbon, Claus-Christian
2010-01-01
Participants with personal and without personal experiences with the Earth as a sphere estimated large-scale distances between six cities located on different continents. Cognitive distances were submitted to a specific multidimensional scaling algorithm in the 3D Euclidean space with the constraint that all cities had to lie on the same sphere. A…
International Nuclear Information System (INIS)
Han, Renmin; Wang, Liansan; Xu, Fan; Zhang, Yongdeng; Zhang, Mingshu; Liu, Zhiyong; Ren, Fei; Zhang, Fa
2015-01-01
The recent developments of far-field optical microscopy (single molecule imaging techniques) have overcome the diffraction barrier of light and improve image resolution by a factor of ten compared with conventional light microscopy. These techniques utilize the stochastic switching of probe molecules to overcome the diffraction limit and determine the precise localizations of molecules, which often requires a long image acquisition time. However, long acquisition times increase the risk of sample drift. In the case of high resolution microscopy, sample drift would decrease the image resolution. In this paper, we propose a novel metric based on the distance between molecules to solve the drift correction. The proposed metric directly uses the position information of molecules to estimate the frame drift. We also designed an algorithm to implement the metric for the general application of drift correction. There are two advantages of our method: First, because our method does not require space binning of positions of molecules but directly operates on the positions, it is more natural for single molecule imaging techniques. Second, our method can estimate drift with a small number of positions in each temporal bin, which may extend its potential application. The effectiveness of our method has been demonstrated by both simulated data and experiments on single molecular images
Minimum income protection in the Netherlands
van Peijpe, T.
2009-01-01
This article offers an overview of the Dutch legal system of minimum income protection through collective bargaining, social security, and statutory minimum wages. In addition to collective agreements, the Dutch statutory minimum wage offers income protection to a small number of workers. Its
The impact of distance to the farm compound on the options for use of the cereal plot
Directory of Open Access Journals (Sweden)
K. TAMM
2008-12-01
Full Text Available In increasingly competitive conditions, the dominant trend of enlarging the production area of farms is causing a growth in transportation costs making the profitability of cultivating distant plots questionable. The aim of this study was to provide a method to evaluate the rationality of using a plot depending on its distance, area and cultivation technology. An algorithm and a mathematical model were composed to calculate the total costs depending on the distance to the plot. The transportation costs of machines and materials, cost of organisational travel and timeliness costs are taken into account in the model to enable determination of the maximum distance or the minimum area of the plot necessary for profitable cultivation. Simulations allow us to conclude that the growth in yield and selling price of the production allow an increase in the limit value of driving costs and, thus, the profitable distance of the plot; on the other hand, it means also an increase of timeliness costs as a limitation for extending distance. Exploitation of more distant plots can be uneconomical in coming years because of increasing fuel costs.;
Transformational plane geometry
Umble, Ronald N
2014-01-01
Axioms of Euclidean Plane Geometry The Existence and Incidence Postulates The Distance and Ruler Postulates The Plane Separation Postulate The Protractor Postulate The Side-Angle-Side Postulate and the Euclidean Parallel Postulate Theorems of Euclidean Plane Geometry The Exterior Angle Theorem Triangle Congruence Theorems The Alternate Interior Angles Theorem and the Angle Sum Theorem Similar Triangles Introduction to Transformations, Isometries, and Similarities Transformations Isometries and SimilaritiesAppendix: Proof of Surjectivity Translations, Rotations, and Reflections Translations Rotations Reflections Appendix: Geometer's Sketchpad Commands Required by Exploratory Activities Compositions of Translations, Rotations, and Reflections The Three Points Theorem Rotations as Compositions of Two Reflections Translations as Compositions of Two Halfturns or Two Reflections The Angle Addition Theorem Glide Reflections Classification of Isometries The Fundamental Theorem and Congruence Classification of Isometr...
Evidence for asymptotic safety from lattice quantum gravity.
Laiho, J; Coumbe, D
2011-10-14
We calculate the spectral dimension for nonperturbative quantum gravity defined via Euclidean dynamical triangulations. We find that it runs from a value of ∼3/2 at short distance to ∼4 at large distance scales, similar to results from causal dynamical triangulations. We argue that the short-distance value of 3/2 for the spectral dimension may resolve the tension between asymptotic safety and the holographic principle.
Nassan, Feiby L; Chavarro, Jorge E; Mínguez-Alarcón, Lidia; Williams, Paige L; Tanrikut, Cigdem; Ford, Jennifer B; Dadd, Ramace; Perry, Melissa J; Hauser, Russ; Gaskins, Audrey J
2018-06-01
We examined associations of residential distance to major roadways, as a proxy for traffic-related air pollution exposures, with sperm characteristics and male reproductive hormones. The cohort included 797 men recruited from Massachusetts General Hospital Fertility Center between 2000 and 2015 to participate in fertility research studies. Men reported their residential addresses at enrollment and provided 1-6 semen samples and a blood sample during follow-up. We estimated the Euclidean distance to major roadways (e.g. interstates and highways: limited access highways, multi-lane highways (not limited access), other numbered routes, and major roads) using information from the Massachusetts Department of Geographic Information Systems. Semen parameters (1238 semen samples), sperm DNA integrity (389 semen samples), chromosomal disomy (101 semen samples), and serum reproductive hormones (405 serum samples) were assessed following standard procedures. Men in this cohort were primarily Caucasian (86%), not current smokers (92%), with a college or higher education (88%), and had an average age of 36 years and BMI of 27.7 kg/m 2 . The median (interquartile range) residential distance to a major roadway was 111 (37, 248) meters. Residential proximity to major roadways was not associated with semen parameters, sperm DNA integrity, chromosomal disomy, or serum reproductive hormone concentrations. The adjusted percent change (95% CI) in semen quality parameters associated with a 500 m increase in residential distance to a major roadway was -1.0% (-6.3, 4.5) for semen volume, 4.3% (-5.8, 15.7) for sperm concentration, 3.1% (-7.2, 14.5) for sperm count, 1.1% (-1.2, 3.4) for % total motile sperm, and 0.1% (-0.3, 0.5) for % morphologically normal sperm. Results were consistent when we modeled the semen parameters dichotomized according to WHO 2010 reference values. Residential distance to major roadways, as a proxy for traffic-related air pollution exposure, was not related
Audio Query by Example Using Similarity Measures between Probability Density Functions of Features
Directory of Open Access Journals (Sweden)
Marko Helén
2010-01-01
Full Text Available This paper proposes a query by example system for generic audio. We estimate the similarity of the example signal and the samples in the queried database by calculating the distance between the probability density functions (pdfs of their frame-wise acoustic features. Since the features are continuous valued, we propose to model them using Gaussian mixture models (GMMs or hidden Markov models (HMMs. The models parametrize each sample efficiently and retain sufficient information for similarity measurement. To measure the distance between the models, we apply a novel Euclidean distance, approximations of Kullback-Leibler divergence, and a cross-likelihood ratio test. The performance of the measures was tested in simulations where audio samples are automatically retrieved from a general audio database, based on the estimated similarity to a user-provided example. The simulations show that the distance between probability density functions is an accurate measure for similarity. Measures based on GMMs or HMMs are shown to produce better results than that of the existing methods based on simpler statistics or histograms of the features. A good performance with low computational cost is obtained with the proposed Euclidean distance.
Matrix Completion Optimization for Localization in Wireless Sensor Networks for Intelligent IoT
Directory of Open Access Journals (Sweden)
Thu L. N. Nguyen
2016-05-01
Full Text Available Localization in wireless sensor networks (WSNs is one of the primary functions of the intelligent Internet of Things (IoT that offers automatically discoverable services, while the localization accuracy is a key issue to evaluate the quality of those services. In this paper, we develop a framework to solve the Euclidean distance matrix completion problem, which is an important technical problem for distance-based localization in WSNs. The sensor network localization problem is described as a low-rank dimensional Euclidean distance completion problem with known nodes. The task is to find the sensor locations through recovery of missing entries of a squared distance matrix when the dimension of the data is small compared to the number of data points. We solve a relaxation optimization problem using a modification of Newton’s method, where the cost function depends on the squared distance matrix. The solution obtained in our scheme achieves a lower complexity and can perform better if we use it as an initial guess for an interactive local search of other higher precision localization scheme. Simulation results show the effectiveness of our approach.
The graph-theoretic minimum energy path problem for ionic conduction
Directory of Open Access Journals (Sweden)
Ippei Kishida
2015-10-01
Full Text Available A new computational method was developed to analyze the ionic conduction mechanism in crystals through graph theory. The graph was organized into nodes, which represent the crystal structures modeled by ionic site occupation, and edges, which represent structure transitions via ionic jumps. We proposed a minimum energy path problem, which is similar to the shortest path problem. An effective algorithm to solve the problem was established. Since our method does not use randomized algorithm and time parameters, the computational cost to analyze conduction paths and a migration energy is very low. The power of the method was verified by applying it to α-AgI and the ionic conduction mechanism in α-AgI was revealed. The analysis using single point calculations found the minimum energy path for long-distance ionic conduction, which consists of 12 steps of ionic jumps in a unit cell. From the results, the detailed theoretical migration energy was calculated as 0.11 eV by geometry optimization and nudged elastic band method. Our method can refine candidates for possible jumps in crystals and it can be adapted to other computational methods, such as the nudged elastic band method. We expect that our method will be a powerful tool for analyzing ionic conduction mechanisms, even for large complex crystals.
Reducing the distance in distance-caregiving by technology innovation
Directory of Open Access Journals (Sweden)
Lazelle E Benefield
2007-07-01
Full Text Available Lazelle E Benefield1, Cornelia Beck21College of Nursing, University of Oklahoma Health Sciences Center, Oklahoma City, Oklahoma, USA; 2Pat & Willard Walker Family Memory Research Center, University of Arkansas for Medical Sciences, Little Rock, Arkansas, USAAbstract: Family caregivers are responsible for the home care of over 34 million older adults in the United States. For many, the elder family member lives more than an hour’s distance away. Distance caregiving is a growing alternative to more familiar models where: 1 the elder and the family caregiver(s may reside in the same household; or 2 the family caregiver may live nearby but not in the same household as the elder. The distance caregiving model involves elders and their family caregivers who live at some distance, defined as more than a 60-minute commute, from one another. Evidence suggests that distance caregiving is a distinct phenomenon, differs substantially from on-site family caregiving, and requires additional assistance to support the physical, social, and contextual dimensions of the caregiving process. Technology-based assists could virtually connect the caregiver and elder and provide strong support that addresses the elder’s physical, social, cognitive, and/or sensory impairments. Therefore, in today’s era of high technology, it is surprising that so few affordable innovations are being marketed for distance caregiving. This article addresses distance caregiving, proposes the use of technology innovation to support caregiving, and suggests a research agenda to better inform policy decisions related to the unique needs of this situation.Keywords: caregiving, family, distance, technology, elders
The solution of location problems with certain existing facility structures
DEFF Research Database (Denmark)
Juel, Henrik; Love, Robert F.
1983-01-01
It is known that in the Euclidean distance case, the optimal minisum location of a new facility in relation to four existing facilities is at the intersection of the two lines joining two pairs of the facilities. The authors extend this concept to minisum problems having any even number of existing...... facilities and characterized by generalized distance norms...
Censoring distances based on labeled cortical distance maps in cortical morphometry.
Ceyhan, Elvan; Nishino, Tomoyuki; Alexopolous, Dimitrios; Todd, Richard D; Botteron, Kelly N; Miller, Michael I; Ratnanather, J Tilak
2013-01-01
It has been demonstrated that shape differences in cortical structures may be manifested in neuropsychiatric disorders. Such morphometric differences can be measured by labeled cortical distance mapping (LCDM) which characterizes the morphometry of the laminar cortical mantle of cortical structures. LCDM data consist of signed/labeled distances of gray matter (GM) voxels with respect to GM/white matter (WM) surface. Volumes and other summary measures for each subject and the pooled distances can help determine the morphometric differences between diagnostic groups, however they do not reveal all the morphometric information contained in LCDM distances. To extract more information from LCDM data, censoring of the pooled distances is introduced for each diagnostic group where the range of LCDM distances is partitioned at a fixed increment size; and at each censoring step, the distances not exceeding the censoring distance are kept. Censored LCDM distances inherit the advantages of the pooled distances but also provide information about the location of morphometric differences which cannot be obtained from the pooled distances. However, at each step, the censored distances aggregate, which might confound the results. The influence of data aggregation is investigated with an extensive Monte Carlo simulation analysis and it is demonstrated that this influence is negligible. As an illustrative example, GM of ventral medial prefrontal cortices (VMPFCs) of subjects with major depressive disorder (MDD), subjects at high risk (HR) of MDD, and healthy control (Ctrl) subjects are used. A significant reduction in laminar thickness of the VMPFC in MDD and HR subjects is observed compared to Ctrl subjects. Moreover, the GM LCDM distances (i.e., locations with respect to the GM/WM surface) for which these differences start to occur are determined. The methodology is also applicable to LCDM-based morphometric measures of other cortical structures affected by disease.
Censoring Distances Based on Labeled Cortical Distance Maps in Cortical Morphometry
Directory of Open Access Journals (Sweden)
Elvan eCeyhan
2013-10-01
Full Text Available It has been demonstrated that shape differences are manifested in cortical structures due to neuropsychiatric disorders. Such morphometric differences can be measured by labeled cortical distance mapping (LCDM which characterizes the morphometry of the laminar cortical mantle of cortical structures. LCDM data consist of signed/labeled distances of gray matter (GM voxels with respect to GM/white matter (WM surface. Volumes and other summary measures for each subject and the pooled distances can help determine the morphometric differences between diagnostic groups, however they do not reveal all the morphometric information con-tained in LCDM distances. To extract more information from LCDM data, censoring of the pooled distances is introduced for each diagnostic group where the range of LCDM distances is partitioned at a fixed increment size; and at each censoring step, the distances not exceeding the censoring distance are kept. Censored LCDM distances inherit the advantages of the pooled distances but also provide information about the location of morphometric differences which cannot be obtained from the pooled distances. However, at each step, the censored distances aggregate, which might confound the results. The influence of data aggregation is investigated with an extensive Monte Carlo simulation analysis and it is demonstrated that this influence is negligible. As an illustrative example, GM of ventral medial prefrontal cortices (VMPFCs of subjects with major depressive disorder (MDD, subjects at high risk (HR of MDD, and healthy control (Ctrl subjects are used. A significant reduction in laminar thickness of the VMPFC in MDD and HR subjects is observed compared to Ctrl subjects. Moreover, the GM LCDM distances (i.e., locations with respect to the GM/WM surface for which these differences start to occur are determined. The methodology is also applicable to LCDM-based morphometric measures of other cortical structures affected by disease.
Training for Distance Teaching through Distance Learning.
Cadorath, Jill; Harris, Simon; Encinas, Fatima
2002-01-01
Describes a mixed-mode bachelor degree course in English language teaching at the Universidad Autonoma de Puebla (Mexico) that was designed to help practicing teachers write appropriate distance education materials by giving them the experience of being distance students. Includes a course outline and results of a course evaluation. (Author/LRW)
The minimum test battery to screen for binocular vision anomalies: report 3 of the BAND study.
Hussaindeen, Jameel Rizwana; Rakshit, Archayeeta; Singh, Neeraj Kumar; Swaminathan, Meenakshi; George, Ronnie; Kapur, Suman; Scheiman, Mitchell; Ramani, Krishna Kumar
2018-03-01
This study aims to report the minimum test battery needed to screen non-strabismic binocular vision anomalies (NSBVAs) in a community set-up. When large numbers are to be screened we aim to identify the most useful test battery when there is no opportunity for a more comprehensive and time-consuming clinical examination. The prevalence estimates and normative data for binocular vision parameters were estimated from the Binocular Vision Anomalies and Normative Data (BAND) study, following which cut-off estimates and receiver operating characteristic curves to identify the minimum test battery have been plotted. In the receiver operating characteristic phase of the study, children between nine and 17 years of age were screened in two schools in the rural arm using the minimum test battery, and the prevalence estimates with the minimum test battery were found. Receiver operating characteristic analyses revealed that near point of convergence with penlight and red filter (> 7.5 cm), monocular accommodative facility ( 1.25 prism dioptres) were significant factors with cut-off values for best sensitivity and specificity. This minimum test battery was applied to a cohort of 305 children. The mean (standard deviation) age of the subjects was 12.7 (two) years with 121 males and 184 females. Using the minimum battery of tests obtained through the receiver operating characteristic analyses, the prevalence of NSBVAs was found to be 26 per cent. Near point of convergence with penlight and red filter > 10 cm was found to have the highest sensitivity (80 per cent) and specificity (73 per cent) for the diagnosis of convergence insufficiency. For the diagnosis of accommodative infacility, monocular accommodative facility with a cut-off of less than seven cycles per minute was the best predictor for screening (92 per cent sensitivity and 90 per cent specificity). The minimum test battery of near point of convergence with penlight and red filter, difference between distance and near
DEFF Research Database (Denmark)
Larsen, Gunvor Riber
The environmental impact of tourism mobility is linked to the distances travelled in order to reach a holiday destination, and with tourists travelling more and further than previously, an understanding of how the tourists view the distance they travel across becomes relevant. Based on interviews...... contribute to an understanding of how it is possible to change tourism travel behaviour towards becoming more sustainable. How tourists 'consume distance' is discussed, from the practical level of actually driving the car or sitting in the air plane, to the symbolic consumption of distance that occurs when...... travelling on holiday becomes part of a lifestyle and a social positioning game. Further, different types of tourist distance consumers are identified, ranging from the reluctant to the deliberate and nonchalant distance consumers, who display very differing attitudes towards the distance they all travel...
Analytic processing of distance.
Dopkins, Stephen; Galyer, Darin
2018-01-01
How does a human observer extract from the distance between two frontal points the component corresponding to an axis of a rectangular reference frame? To find out we had participants classify pairs of small circles, varying on the horizontal and vertical axes of a computer screen, in terms of the horizontal distance between them. A response signal controlled response time. The error rate depended on the irrelevant vertical as well as the relevant horizontal distance between the test circles with the relevant distance effect being larger than the irrelevant distance effect. The results implied that the horizontal distance between the test circles was imperfectly extracted from the overall distance between them. The results supported an account, derived from the Exemplar Based Random Walk model (Nosofsky & Palmieri, 1997), under which distance classification is based on the overall distance between the test circles, with relevant distance being extracted from overall distance to the extent that the relevant and irrelevant axes are differentially weighted so as to reduce the contribution of irrelevant distance to overall distance. The results did not support an account, derived from the General Recognition Theory (Ashby & Maddox, 1994), under which distance classification is based on the relevant distance between the test circles, with the irrelevant distance effect arising because a test circle's perceived location on the relevant axis depends on its location on the irrelevant axis, and with relevant distance being extracted from overall distance to the extent that this dependency is absent. Copyright © 2017 Elsevier B.V. All rights reserved.
Distancing, not embracing, the Distancing-Embracing model of art reception.
Davies, Stephen
2017-01-01
Despite denials in the target article, the Distancing-Embracing model appeals to compensatory ideas in explaining the appeal of artworks that elicit negative affect. The model also appeals to the deflationary effects of psychological distancing. Having pointed to the famous rejection in the 1960s of the view that aesthetic experience involves psychological distancing, I suggest that "distance" functions here as a weak metaphor that cannot sustain the explanatory burden the theory demands of it.
Foundations of Distance Education. Third Edition. Routledge Studies in Distance Education.
Keegan, Desmond
This text gives an overview of distance education for students, administrators, and practitioners in distance education. Chapter 1 discusses the study of distance education. Chapter 2 analyzes forms of nonconventional education (open, nontraditional) that may have similarities to distance education but are not to be identified with it. Chapter 3…
Directory of Open Access Journals (Sweden)
Robert F. Love
2001-01-01
Full Text Available Distance predicting functions may be used in a variety of applications for estimating travel distances between points. To evaluate the accuracy of a distance predicting function and to determine its parameters, a goodness-of-fit criteria is employed. AD (Absolute Deviations, SD (Squared Deviations and NAD (Normalized Absolute Deviations are the three criteria that are mostly employed in practice. In the literature some assumptions have been made about the properties of each criterion. In this paper, we present statistical analyses performed to compare the three criteria from different perspectives. For this purpose, we employ the ℓkpθ-norm as the distance predicting function, and statistically compare the three criteria by using normalized absolute prediction error distributions in seventeen geographical regions. We find that there exist no significant differences between the criteria. However, since the criterion SD has desirable properties in terms of distance modelling procedures, we suggest its use in practice.
Understanding the Minimum Wage: Issues and Answers.
Employment Policies Inst. Foundation, Washington, DC.
This booklet, which is designed to clarify facts regarding the minimum wage's impact on marketplace economics, contains a total of 31 questions and answers pertaining to the following topics: relationship between minimum wages and poverty; impacts of changes in the minimum wage on welfare reform; and possible effects of changes in the minimum wage…
On approximately fair cost allocation in Euclidean TSP games
Faigle, U.; Fekete, Sándor P.; Hochstättler, Winfried; Kern, Walter
1998-01-01
We consider the problem of allocating the cost of an optimal traveling salesman tour in a fair way among the nodes visited; in particular, we focus on the case where the distance matrix of the underlying TSP problem satisfies the triangle inequality. We thereby use the model of TSP games in the
Youth minimum wages and youth employment
Marimpi, Maria; Koning, Pierre
2018-01-01
This paper performs a cross-country level analysis on the impact of the level of specific youth minimum wages on the labor market performance of young individuals. We use information on the use and level of youth minimum wages, as compared to the level of adult minimum wages as well as to the median
Directory of Open Access Journals (Sweden)
Fubiao Feng
2017-03-01
Full Text Available Recently, graph embedding has drawn great attention for dimensionality reduction in hyperspectral imagery. For example, locality preserving projection (LPP utilizes typical Euclidean distance in a heat kernel to create an affinity matrix and projects the high-dimensional data into a lower-dimensional space. However, the Euclidean distance is not sufficiently correlated with intrinsic spectral variation of a material, which may result in inappropriate graph representation. In this work, a graph-based discriminant analysis with spectral similarity (denoted as GDA-SS measurement is proposed, which fully considers curves changing description among spectral bands. Experimental results based on real hyperspectral images demonstrate that the proposed method is superior to traditional methods, such as supervised LPP, and the state-of-the-art sparse graph-based discriminant analysis (SGDA.
Discretization of space and time: determining the values of minimum length and minimum time
Roatta , Luca
2017-01-01
Assuming that space and time can only have discrete values, we obtain the expression of the minimum length and the minimum time interval. These values are found to be exactly coincident with the Planck's length and the Planck's time but for the presence of h instead of ħ .
Minimum wage development in the Russian Federation
Bolsheva, Anna
2012-01-01
The aim of this paper is to analyze the effectiveness of the minimum wage policy at the national level in Russia and its impact on living standards in the country. The analysis showed that the national minimum wage in Russia does not serve its original purpose of protecting the lowest wage earners and has no substantial effect on poverty reduction. The national subsistence minimum is too low and cannot be considered an adequate criterion for the setting of the minimum wage. The minimum wage d...
Liu, Qian; Li, Huajiao; Liu, Xueyong; Jiang, Meihui
2018-04-01
In the stock market, there are widespread information connections between economic agents. Listed companies can obtain mutual information about investment decisions from common shareholders, and the extent of sharing information often determines the relationships between listed companies. Because different shareholder compositions and investment shares lead to different formations of the company's governance mechanisms, we map the investment relationships between shareholders to the multi-attribute dimensional spaces of the listed companies (each shareholder investment in a company is a company dimension). Then, we construct the listed company's information network based on co-shareholder relationships. The weights for the edges in the information network are measured with the Euclidean distance between the listed companies in the multi-attribute dimension space. We define two indices to analyze the information network's features. We conduct an empirical study that analyzes Chinese listed companies' information networks. The results from the analysis show that with the diversification and decentralization of shareholder investments, almost all Chinese listed companies exchanged information through common shareholder relationships, and there is a gradual reduction in information sharing capacity between listed companies that have common shareholders. This network analysis has benefits for risk management and portfolio investments.
Pairing call-response surveys and distance sampling for a mammalian carnivore
Hansen, Sara J. K.; Frair, Jacqueline L.; Underwood, Harold B.; Gibbs, James P.
2015-01-01
Density estimates accounting for differential animal detectability are difficult to acquire for wide-ranging and elusive species such as mammalian carnivores. Pairing distance sampling with call-response surveys may provide an efficient means of tracking changes in populations of coyotes (Canis latrans), a species of particular interest in the eastern United States. Blind field trials in rural New York State indicated 119-m linear error for triangulated coyote calls, and a 1.8-km distance threshold for call detectability, which was sufficient to estimate a detection function with precision using distance sampling. We conducted statewide road-based surveys with sampling locations spaced ≥6 km apart from June to August 2010. Each detected call (be it a single or group) counted as a single object, representing 1 territorial pair, because of uncertainty in the number of vocalizing animals. From 524 survey points and 75 detections, we estimated the probability of detecting a calling coyote to be 0.17 ± 0.02 SE, yielding a detection-corrected index of 0.75 pairs/10 km2 (95% CI: 0.52–1.1, 18.5% CV) for a minimum of 8,133 pairs across rural New York State. Importantly, we consider this an index rather than true estimate of abundance given the unknown probability of coyote availability for detection during our surveys. Even so, pairing distance sampling with call-response surveys provided a novel, efficient, and noninvasive means of monitoring populations of wide-ranging and elusive, albeit reliably vocal, mammalian carnivores. Our approach offers an effective new means of tracking species like coyotes, one that is readily extendable to other species and geographic extents, provided key assumptions of distance sampling are met.
Directory of Open Access Journals (Sweden)
Milinkovitch Michel C
2007-11-01
Full Text Available Abstract Background Distance matrix methods constitute a major family of phylogenetic estimation methods, and the minimum evolution (ME principle (aiming at recovering the phylogeny with shortest length is one of the most commonly used optimality criteria for estimating phylogenetic trees. The major difficulty for its application is that the number of possible phylogenies grows exponentially with the number of taxa analyzed and the minimum evolution principle is known to belong to the NP MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaWenfgDOvwBHrxAJfwnHbqeg0uy0HwzTfgDPnwy1aaceaGae8xdX7Kaeeiuaafaaa@3888@-hard class of problems. Results In this paper, we introduce an Ant Colony Optimization (ACO algorithm to estimate phylogenies under the minimum evolution principle. ACO is an optimization technique inspired from the foraging behavior of real ant colonies. This behavior is exploited in artificial ant colonies for the search of approximate solutions to discrete optimization problems. Conclusion We show that the ACO algorithm is potentially competitive in comparison with state-of-the-art algorithms for the minimum evolution principle. This is the first application of an ACO algorithm to the phylogenetic estimation problem.
Minimum emittance of three-bend achromats
International Nuclear Information System (INIS)
Li Xiaoyu; Xu Gang
2012-01-01
The calculation of the minimum emittance of three-bend achromats (TBAs) made by Mathematical software can ignore the actual magnets lattice in the matching condition of dispersion function in phase space. The minimum scaling factors of two kinds of widely used TBA lattices are obtained. Then the relationship between the lengths and the radii of the three dipoles in TBA is obtained and so is the minimum scaling factor, when the TBA lattice achieves its minimum emittance. The procedure of analysis and the results can be widely used in achromats lattices, because the calculation is not restricted by the actual lattice. (authors)
Ruler of the plane - Games of geometry
Beekhuis, S.; Buchin, K.; Castermans, T.; Hurks, T.; Sonke, W.; Aronov, B.; Katz, M.J.
2017-01-01
Ruler of the Plane is a set of games illustrating concepts from combinatorial and computational geometry. The games are based on the art gallery problem, ham-sandwich cuts, the Voronoi game, and geometric network connectivity problems like the Euclidean minimum spanning tree and traveling
Robust Point Matching for Non-Rigid Shapes: A Relaxation Labeling Based Approach
National Research Council Canada - National Science Library
Zheng, Yefeng; Doermann, David S
2004-01-01
.... Based on this observation, we formulate point matching as a graph matching problem. Each point is a node in the graph, and two nodes are connected by an edge if their Euclidean distance is less...
In vitro embryo rescue and plant regeneration following self ...
African Journals Online (AJOL)
EJIRO
2015-07-08
Jul 8, 2015 ... calculated using the simple matching Euclidean distance (DE) followed by cluster analysis ..... we plan to fully characterize these plantlets and to establish whether or not .... Tesis de Grado, Universidad. ICESI, Cali. Colombia.
Székely, Gábor J.; Rizzo, Maria L.
2010-01-01
Distance correlation is a new class of multivariate dependence coefficients applicable to random vectors of arbitrary and not necessarily equal dimension. Distance covariance and distance correlation are analogous to product-moment covariance and correlation, but generalize and extend these classical bivariate measures of dependence. Distance correlation characterizes independence: it is zero if and only if the random vectors are independent. The notion of covariance with...
Implementation of multi-criteria decision making approach for the team leader selection in IT sector
Directory of Open Access Journals (Sweden)
Sandhya
2016-12-01
Full Text Available In the era of technology, the demand of the software development increases at a very high speed, as software has touched the human’s life in all aspects. The better quality software development acquiring minimum development time leads to the team work in which a group of people has been formed that work together in a team for the software development. One of the most signifi-cant issues in effective and efficient teamwork is the team leader selection because the team lead-er is the person in any team that is going to handle all types of managerial activities such as lead-ership, motivation to others, etc. The team leader selection process may be dependent on numer-ous conflicting selection indexes that make it a Multi-Criteria Decision Making (MCDM prob-lem. In the present research, an MCDM approach namely, Euclidean Distance Based Approxi-mation (EDBA which is based on the calculation of the composite distance value for each alter-native from a hypothetical optimal point is presented. The result of this study provides a compre-hensive ranking of team leaders that leads to the right selection of team leader in information technology (IT sector.
Traversing psychological distance.
Liberman, Nira; Trope, Yaacov
2014-07-01
Traversing psychological distance involves going beyond direct experience, and includes planning, perspective taking, and contemplating counterfactuals. Consistent with this view, temporal, spatial, and social distances as well as hypotheticality are associated, affect each other, and are inferred from one another. Moreover, traversing all distances involves the use of abstraction, which we define as forming a belief about the substitutability for a specific purpose of subjectively distinct objects. Indeed, across many instances of both abstraction and psychological distancing, more abstract constructs are used for more distal objects. Here, we describe the implications of this relation for prediction, choice, communication, negotiation, and self-control. We ask whether traversing distance is a general mental ability and whether distance should replace expectancy in expected-utility theories. Copyright © 2014 Elsevier Ltd. All rights reserved.
30 CFR 57.19021 - Minimum rope strength.
2010-07-01
... feet: Minimum Value=Static Load×(7.0−0.001L) For rope lengths 3,000 feet or greater: Minimum Value=Static Load×4.0. (b) Friction drum ropes. For rope lengths less than 4,000 feet: Minimum Value=Static Load×(7.0−0.0005L) For rope lengths 4,000 feet or greater: Minimum Value=Static Load×5.0. (c) Tail...
30 CFR 56.19021 - Minimum rope strength.
2010-07-01
... feet: Minimum Value=Static Load×(7.0-0.001L) For rope lengths 3,000 feet or greater: Minimum Value=Static Load×4.0 (b) Friction drum ropes. For rope lengths less than 4,000 feet: Minimum Value=Static Load×(7.0-0.0005L) For rope lengths 4,000 feet or greater: Minimum Value=Static Load×5.0 (c) Tail ropes...
A transfer learning framework for traffic video using neuro-fuzzy ...
Indian Academy of Sciences (India)
P M Ashok Kumar
2017-08-04
Aug 4, 2017 ... The proposed ANFIS-LCTE transfer learning model consists of four steps. (1) Low level visual items .... algorithm clusters object trajectories based on the distance parameters like Euclidean ..... Machine Learning, pp. 113–120.
Du, Peng; Ouahsine, Abdellatif; Sergent, Philippe
2018-05-01
Ship maneuvering in the confined inland waterway is investigated using the system-based method, where a nonlinear transient hydrodynamic model is adopted and confinement models are implemented to account for the influence of the channel bank and bottom. The maneuvering model is validated using the turning circle test, and the confinement model is validated using the experimental data. The separation distance, ship speed, and channel width are then varied to investigate their influences on ship maneuverability. With smaller separation distances and higher speeds near the bank, the ship's trajectory deviates more from the original course and the bow is repelled with a larger yaw angle, which increase the difficulty of maneuvering. Smaller channel widths induce higher advancing resistances on the ship. The minimum distance to the bank are extracted and studied. It is suggested to navigate the ship in the middle of the channel and with a reasonable speed in the restricted waterway.
30 CFR 77.1431 - Minimum rope strength.
2010-07-01
... feet: Minimum Value=Static Load×(7.0−0.001L) For rope lengths 3,000 feet or greater: Minimum Value=Static Load×4.0 (b) Friction drum ropes. For rope lengths less than 4,000 feet: Minimum Value=Static Load×(7.0−0.0005L) For rope lengths 4,000 feet or greater: Minimum Value=Static Load×5.0 (c) Tail ropes...
A Phosphate Minimum in the Oxygen Minimum Zone (OMZ) off Peru
Paulmier, A.; Giraud, M.; Sudre, J.; Jonca, J.; Leon, V.; Moron, O.; Dewitte, B.; Lavik, G.; Grasse, P.; Frank, M.; Stramma, L.; Garcon, V.
2016-02-01
The Oxygen Minimum Zone (OMZ) off Peru is known to be associated with the advection of Equatorial SubSurface Waters (ESSW), rich in nutrients and poor in oxygen, through the Peru-Chile UnderCurrent (PCUC), but this circulation remains to be refined within the OMZ. During the Pelágico cruise in November-December 2010, measurements of phosphate revealed the presence of a phosphate minimum (Pmin) in various hydrographic stations, which could not be explained so far and could be associated with a specific water mass. This Pmin, localized at a relatively constant layer ( 20minimum with a mean vertical phosphate decrease of 0.6 µM but highly variable between 0.1 and 2.2 µM. In average, these Pmin are associated with a predominant mixing of SubTropical Under- and Surface Waters (STUW and STSW: 20 and 40%, respectively) within ESSW ( 25%), complemented evenly by overlying (ESW, TSW: 8%) and underlying waters (AAIW, SPDW: 7%). The hypotheses and mechanisms leading to the Pmin formation in the OMZ are further explored and discussed, considering the physical regional contribution associated with various circulation pathways ventilating the OMZ and the local biogeochemical contribution including the potential diazotrophic activity.
In-situ position and vibration measurement of rough surfaces using laser Doppler distance sensors
Czarske, J.; Pfister, T.; Günther, P.; Büttner, L.
2009-06-01
In-situ measurement of distances and shapes as well as dynamic deformations and vibrations of fast moving and especially rotating objects, such as gear shafts and turbine blades, is an important task at process control. We recently developed a laser Doppler distance frequency sensor, employing two superposed fan-shaped interference fringe systems with contrary fringe spacing gradients. Via two Doppler frequency evaluations the non-incremental position (i.e. distance) and the tangential velocity of rotating bodies are determined simultaneously. The distance uncertainty is in contrast to e.g. triangulation in principle independent of the object velocity. This unique feature allows micrometer resolutions of fast moved rough surfaces. The novel sensor was applied at turbo machines in order to control the tip clearance. The measurements at a transonic centrifugal compressor were performed during operation at up to 50,000 rpm, i.e. 586 m/s velocity of the blade tips. Due to the operational conditions such as temperatures of up to 300 °C, a flexible and robust measurement system with a passive fiber-coupled sensor, using diffractive optics, has been realized. Since the tip clearance of individual blades could be temporally resolved an analysis of blade vibrations was possible. A Fourier transformation of the blade distances results in an average period of 3 revolutions corresponding to a frequency of 1/3 of the rotary frequency. Additionally, a laser Doppler distance sensor using two tilted fringe systems and phase evaluation will be presented. This phase sensor exhibits a minimum position resolution of σz = 140 nm. It allows precise in-situ shape measurements at grinding and turning processes.
Directory of Open Access Journals (Sweden)
Hüseyin Eldem
2017-08-01
Full Text Available Traveling Salesman Problem (TSP is a problem in combinatorial optimization that should be solved by a salesperson who has to travel all cities at the minimum cost (minimum route and return to the starting city (node. Todays, to resolve the minimum cost of this problem, many optimization algorithms have been used. The major ones are these metaheuristic algorithms. In this study, one of the metaheuristic methods, Ant Colony Optimization (ACO method (Max-Min Ant System – MMAS, was used to solve the Non-Euclidean TSP, which consisted of sets of different count points coincidentally located on the surface of a sphere. In this study seven point sets were used which have different point count. The performance of the MMAS method solving Non-Euclidean TSP problem was demonstrated by different experiments. Also, the results produced by ACO are compared with Discrete Cuckoo Search Algorithm (DCS and Genetic Algorithm (GA that are in the literature. The experiments for TSP on a sphere, show that ACO’s average results were better than the GA’s average results and also best results of ACO successful than the DCS.
Open and Distance Learning Today. Routledge Studies in Distance Education Series.
Lockwood, Fred, Ed.
This book contains the following papers on open and distance learning today: "Preface" (Daniel); "Big Bang Theory in Distance Education" (Hawkridge); "Practical Agenda for Theorists of Distance Education" (Perraton); "Trends, Directions and Needs: A View from Developing Countries" (Koul); "American…
CSIR Research Space (South Africa)
Govender, N
2014-08-01
Full Text Available information to improve the initial shape recognition results. We propose an initial system which performs shape recognition using the euclidean distances of Fourier descriptors. To improve upon these results we build multinomial and Gaussian probabilistic...
From a distance: implications of spontaneous self-distancing for adaptive self-reflection.
Ayduk, Ozlem; Kross, Ethan
2010-05-01
Although recent experimental work indicates that self-distancing facilitates adaptive self-reflection, it remains unclear (a) whether spontaneous self-distancing leads to similar adaptive outcomes, (b) how spontaneous self-distancing relates to avoidance, and (c) how this strategy impacts interpersonal behavior. Three studies examined these issues demonstrating that the more participants spontaneously self-distanced while reflecting on negative memories, the less emotional (Studies 1-3) and cardiovascular (Study 2) reactivity they displayed in the short term. Spontaneous self-distancing was also associated with lower emotional reactivity and intrusive ideation over time (Study 1). The negative association between spontaneous self-distancing and emotional reactivity was mediated by how participants construed their experience (i.e., less recounting relative to reconstruing) rather than avoidance (Studies 1-2). In addition, spontaneous self-distancing was associated with more problem-solving behavior and less reciprocation of negativity during conflicts among couples in ongoing relationships (Study 3). Although spontaneous self-distancing was empirically related to trait rumination, it explained unique variance in predicting key outcomes. 2010 APA, all rights reserved
van Dam, Edwin R.; Koolen, Jack H.; Tanaka, Hajime
2016-01-01
This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN'[Brouwer, A.E., Cohen, A.M., Neumaier,
Network Kernel Density Estimation for the Analysis of Facility POI Hotspots
Directory of Open Access Journals (Sweden)
YU Wenhao
2015-12-01
Full Text Available The distribution pattern of urban facility POIs (points of interest usually forms clusters (i.e. "hotspots" in urban geographic space. To detect such type of hotspot, the methods mostly employ spatial density estimation based on Euclidean distance, ignoring the fact that the service function and interrelation of urban feasibilities is carried out on the network path distance, neither than conventional Euclidean distance. By using these methods, it is difficult to exactly and objectively delimitate the shape and the size of hotspot. Therefore, this research adopts the kernel density estimation based on the network distance to compute the density of hotspot and proposes a simple and efficient algorithm. The algorithm extends the 2D dilation operator to the 1D morphological operator, thus computing the density of network unit. Through evaluation experiment, it is suggested that the algorithm is more efficient and scalable than the existing algorithms. Based on the case study on real POI data, the range of hotspot can highlight the spatial characteristic of urban functions along traffic routes, in order to provide valuable spatial knowledge and information services for the applications of region planning, navigation and geographic information inquiring.
Why conventional detection methods fail in identifying the existence of contamination events.
Liu, Shuming; Li, Ruonan; Smith, Kate; Che, Han
2016-04-15
Early warning systems are widely used to safeguard water security, but their effectiveness has raised many questions. To understand why conventional detection methods fail to identify contamination events, this study evaluates the performance of three contamination detection methods using data from a real contamination accident and two artificial datasets constructed using a widely applied contamination data construction approach. Results show that the Pearson correlation Euclidean distance (PE) based detection method performs better for real contamination incidents, while the Euclidean distance method (MED) and linear prediction filter (LPF) method are more suitable for detecting sudden spike-like variation. This analysis revealed why the conventional MED and LPF methods failed to identify existence of contamination events. The analysis also revealed that the widely used contamination data construction approach is misleading. Copyright © 2016 Elsevier Ltd. All rights reserved.
Hierarchical traits distances explain grassland Fabaceae species' ecological niches distances
Fort, Florian; Jouany, Claire; Cruz, Pablo
2015-01-01
Fabaceae species play a key role in ecosystem functioning through their capacity to fix atmospheric nitrogen via their symbiosis with Rhizobium bacteria. To increase benefits of using Fabaceae in agricultural systems, it is necessary to find ways to evaluate species or genotypes having potential adaptations to sub-optimal growth conditions. We evaluated the relevance of phylogenetic distance, absolute trait distance and hierarchical trait distance for comparing the adaptation of 13 grassland Fabaceae species to different habitats, i.e., ecological niches. We measured a wide range of functional traits (root traits, leaf traits, and whole plant traits) in these species. Species phylogenetic and ecological distances were assessed from a species-level phylogenetic tree and species' ecological indicator values, respectively. We demonstrated that differences in ecological niches between grassland Fabaceae species were related more to their hierarchical trait distances than to their phylogenetic distances. We showed that grassland Fabaceae functional traits tend to converge among species with the same ecological requirements. Species with acquisitive root strategies (thin roots, shallow root systems) are competitive species adapted to non-stressful meadows, while conservative ones (coarse roots, deep root systems) are able to tolerate stressful continental climates. In contrast, acquisitive species appeared to be able to tolerate low soil-P availability, while conservative ones need high P availability. Finally we highlight that traits converge along the ecological gradient, providing the assumption that species with similar root-trait values are better able to coexist, regardless of their phylogenetic distance. PMID:25741353
Hierarchical traits distances explain grassland Fabaceae species’ ecological niches distances
Directory of Open Access Journals (Sweden)
Florian eFort
2015-02-01
Full Text Available Fabaceae species play a key role in ecosystem functioning through their capacity to fix atmospheric nitrogen via their symbiosis with Rhizobium bacteria. To increase benefits of using Fabaceae in agricultural systems, it is necessary to find ways to evaluate species or genotypes having potential adaptations to sub-optimal growth conditions. We evaluated the relevance of phylogenetic distance, absolute trait distance and hierarchical trait distance for comparing the adaptation of 13 grassland Fabaceae species to different habitats, i.e. ecological niches. We measured a wide range of functional traits (root traits, leaf traits and whole plant traits in these species. Species phylogenetic and ecological distances were assessed from a species-level phylogenetic tree and species’ ecological indicator values, respectively. We demonstrated that differences in ecological niches between grassland Fabaceae species were related more to their hierarchical trait distances than to their phylogenetic distances. We showed that grassland Fabaceae functional traits tend to converge among species with the same ecological requirements. Species with acquisitive root strategies (thin roots, shallow root systems are competitive species adapted to non-stressful meadows, while conservative ones (coarse roots, deep root systems are able to tolerate stressful continental climates. In contrast, acquisitive species appeared to be able to tolerate low soil-P availability, while conservative ones need high P availability. Finally we highlight that traits converge along the ecological gradient, providing the assumption that species with similar root-trait values are better able to coexist, regardless of their phylogenetic distance.
Ziegler, Gerhard
2011-01-01
Distance protection provides the basis for network protection in transmission systems and meshed distribution systems. This book covers the fundamentals of distance protection and the special features of numerical technology. The emphasis is placed on the application of numerical distance relays in distribution and transmission systems.This book is aimed at students and engineers who wish to familiarise themselves with the subject of power system protection, as well as the experienced user, entering the area of numerical distance protection. Furthermore it serves as a reference guide for s