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
Adaptive Distance Protection for Microgrids
DEFF Research Database (Denmark)
Lin, Hengwei; Guerrero, Josep M.; Quintero, Juan Carlos Vasquez
2015-01-01
is adopted to accelerate the tripping speed of the relays on the weak lines. The protection methodology is tested on a mid-voltage microgrid network in Aalborg, Denmark. The results show that the adaptive distance protection methodology has good selectivity and sensitivity. What is more, this system also has......Due to the increasing penetration of distributed generation resources, more and more microgrids can be found in distribution systems. This paper proposes a phasor measurement unit based distance protection strategy for microgrids in distribution system. At the same time, transfer tripping scheme...
A Streaming Distance Transform Algorithm for Neighborhood-Sequence Distances
Directory of Open Access Journals (Sweden)
Nicolas Normand
2014-09-01
Full Text Available We describe an algorithm that computes a “translated” 2D Neighborhood-Sequence Distance Transform (DT using a look up table approach. It requires a single raster scan of the input image and produces one line of output for every line of input. The neighborhood sequence is specified either by providing one period of some integer periodic sequence or by providing the rate of appearance of neighborhoods. The full algorithm optionally derives the regular (centered DT from the “translated” DT, providing the result image on-the-ﬂy, with a minimal delay, before the input image is fully processed. Its efficiency can benefit all applications that use neighborhood- sequence distances, particularly when pipelined processing architectures are involved, or when the size of objects in the source image is limited.
Adaptive protection algorithm and system
Hedrick, Paul [Pittsburgh, PA; Toms, Helen L [Irwin, PA; Miller, Roger M [Mars, PA
2009-04-28
An adaptive protection algorithm and system for protecting electrical distribution systems traces the flow of power through a distribution system, assigns a value (or rank) to each circuit breaker in the system and then determines the appropriate trip set points based on the assigned rank.
Distance Protection for Microgrids in Distribution System
DEFF Research Database (Denmark)
Lin, Hengwei; Liu, Chengxi; Guerrero, Josep M.
2015-01-01
protection decreased. This paper adopts distance protection for one mid-voltage level microgrid in Aalborg, Denmark. Different operation modes of the network are analyzed and tested in the paper. The simulation results show that the variations of the fault currents seen by the forward relays are much larger...... than the backward relays. Meanwhile, the fault currents change little with the randomness of renewable energy except the intermittence. Finally, it shows that the designed distance protection has satisfactory performance to clear the various faults.......Owing to the increasing penetration of distributed generation, there are some challenges for the conventional protection in distribution system. Bidirectional power flow and variable fault current because of the various operation modes may lead to the selectivity and sensitivity of the overcurrent...
Engineering of Algorithms for Hidden Markov models and Tree Distances
DEFF Research Database (Denmark)
Sand, Andreas
Bioinformatics is an interdisciplinary scientific field that combines biology with mathematics, statistics and computer science in an effort to develop computational methods for handling, analyzing and learning from biological data. In the recent decades, the amount of available biological data has...... speed up all the classical algorithms for analyses and training of hidden Markov models. And I show how two particularly important algorithms, the forward algorithm and the Viterbi algorithm, can be accelerated through a reformulation of the algorithms and a somewhat more complicated parallelization...... contribution to the theoretically fastest set of algorithms presently available to compute two closely related measures of tree distance, the triplet distance and the quartet distance. And I further demonstrate that they are also the fastest algorithms in almost all cases when tested in practice....
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.
A general algorithm for computing distance transforms in linear time
Meijster, A.; Roerdink, J.B.T.M.; Hesselink, W.H.; Goutsias, J; Vincent, L; Bloomberg, DS
2000-01-01
A new general algorithm fur computing distance transforms of digital images is presented. The algorithm consists of two phases. Both phases consist of two scans, a forward and a backward scan. The first phase scans the image column-wise, while the second phase scans the image row-wise. Since the
Advancements to the planogram frequency–distance rebinning algorithm
International Nuclear Information System (INIS)
Champley, Kyle M; Kinahan, Paul E; Raylman, Raymond R
2010-01-01
In this paper we consider the task of image reconstruction in positron emission tomography (PET) with the planogram frequency–distance rebinning (PFDR) algorithm. The PFDR algorithm is a rebinning algorithm for PET systems with panel detectors. The algorithm is derived in the planogram coordinate system which is a native data format for PET systems with panel detectors. A rebinning algorithm averages over the redundant four-dimensional set of PET data to produce a three-dimensional set of data. Images can be reconstructed from this rebinned three-dimensional set of data. This process enables one to reconstruct PET images more quickly than reconstructing directly from the four-dimensional PET data. The PFDR algorithm is an approximate rebinning algorithm. We show that implementing the PFDR algorithm followed by the (ramp) filtered backprojection (FBP) algorithm in linogram coordinates from multiple views reconstructs a filtered version of our image. We develop an explicit formula for this filter which can be used to achieve exact reconstruction by means of a modified FBP algorithm applied to the stack of rebinned linograms and can also be used to quantify the errors introduced by the PFDR algorithm. This filter is similar to the filter in the planogram filtered backprojection algorithm derived by Brasse et al. The planogram filtered backprojection and exact reconstruction with the PFDR algorithm require complete projections which can be completed with a reprojection algorithm. The PFDR algorithm is similar to the rebinning algorithm developed by Kao et al. By expressing the PFDR algorithm in detector coordinates, we provide a comparative analysis between the two algorithms. Numerical experiments using both simulated data and measured data from a positron emission mammography/tomography (PEM/PET) system are performed. Images are reconstructed by PFDR+FBP (PFDR followed by 2D FBP reconstruction), PFDRX (PFDR followed by the modified FBP algorithm for exact
Principal distance constraint error diffusion algorithm for homogeneous dot distribution
Kang, Ki-Min; Kim, Choon-Woo
1999-12-01
The perceived quality of the halftoned image strongly depends on the spatial distribution of the binary dots. Various error diffusion algorithms have been proposed for realizing the homogeneous dot distribution in the highlight and shadow regions. However, they are computationally expensive and/or require large memory space. This paper presents a new threshold modulated error diffusion algorithm for the homogeneous dot distribution. The proposed method is applied exactly same as the Floyd-Steinberg's algorithm except the thresholding process. The threshold value is modulated based on the difference between the distance to the nearest minor pixel, `minor pixel distance', and the principal distance. To do so, calculation of the minor pixel distance is needed for every pixel. But, it is quite time consuming and requires large memory resources. In order to alleviate this problem, `the minor pixel offset array' that transforms the 2D history of minor pixels into the 1D codes is proposed. The proposed algorithm drastically reduces the computational load and memory spaces needed for calculation of the minor pixel distance.
TÜR, Mehmet Rida; Shobole, Abdulfetah; Baysal, Mustafa; Wadi, Mohammed
2018-01-01
Power systemsmust be protected against faults to ensure quality and reliable generation,transmission and distribution of power systems. Power system protection is providedby the protection relays. This paper is the second part of the ProtectionCoordination study for the Siddik Kardesler Substation. The protection fortransmission lines, transformer, bus bars and customer feeders is provided byovercurrent protection, differential and distance protection schemes. In thispaper, issues related wit...
An Efficient Algorithm for the Maximum Distance Problem
Directory of Open Access Journals (Sweden)
Gabrielle Assunta Grün
2001-12-01
Full Text Available Efficient algorithms for temporal reasoning are essential in knowledge-based systems. This is central in many areas of Artificial Intelligence including scheduling, planning, plan recognition, and natural language understanding. As such, scalability is a crucial consideration in temporal reasoning. While reasoning in the interval algebra is NP-complete, reasoning in the less expressive point algebra is tractable. In this paper, we explore an extension to the work of Gerevini and Schubert which is based on the point algebra. In their seminal framework, temporal relations are expressed as a directed acyclic graph partitioned into chains and supported by a metagraph data structure, where time points or events are represented by vertices, and directed edges are labelled with < or ≤. They are interested in fast algorithms for determining the strongest relation between two events. They begin by developing fast algorithms for the case where all points lie on a chain. In this paper, we are interested in a generalization of this, namely we consider the problem of finding the maximum ``distance'' between two vertices in a chain ; this problem arises in real world applications such as in process control and crew scheduling. We describe an O(n time preprocessing algorithm for the maximum distance problem on chains. It allows queries for the maximum number of < edges between two vertices to be answered in O(1 time. This matches the performance of the algorithm of Gerevini and Schubert for determining the strongest relation holding between two vertices in a chain.
Web page sorting algorithm based on query keyword distance relation
Yang, Han; Cui, Hong Gang; Tang, Hao
2017-08-01
In order to optimize the problem of page sorting, according to the search keywords in the web page in the relationship between the characteristics of the proposed query keywords clustering ideas. And it is converted into the degree of aggregation of the search keywords in the web page. Based on the PageRank algorithm, the clustering degree factor of the query keyword is added to make it possible to participate in the quantitative calculation. This paper proposes an improved algorithm for PageRank based on the distance relation between search keywords. The experimental results show the feasibility and effectiveness of the method.
A proximal point algorithm with generalized proximal distances to BEPs
Bento, G. C.; Neto, J. X. Cruz; Lopes, J. O.; Soares Jr, P. A.; Soubeyran, A.
2014-01-01
We consider a bilevel problem involving two monotone equilibrium bifunctions and we show that this problem can be solved by a proximal point method with generalized proximal distances. We propose a framework for the convergence analysis of the sequences generated by the algorithm. This class of problems is very interesting because it covers mathematical programs and optimization problems under equilibrium constraints. As an application, we consider the problem of the stability and change dyna...
Improved core protection calculator system algorithm
International Nuclear Information System (INIS)
Yoon, Tae Young; Park, Young Ho; In, Wang Kee; Bae, Jong Sik; Baeg, Seung Yeob
2009-01-01
Core Protection Calculator System (CPCS) is a digitized core protection system which provides core protection functions based on two reactor core operation parameters, Departure from Nucleate Boiling Ratio (DNBR) and Local Power Density (LPD). It generates a reactor trip signal when the core condition exceeds the DNBR or LPD design limit. It consists of four independent channels which adapted a two out of four trip logic. CPCS algorithm improvement for the newly designed core protection calculator system, RCOPS (Reactor COre Protection System), is described in this paper. New features include the improvement of DNBR algorithm for thermal margin, the addition of pre trip alarm generation for auxiliary trip function, VOPT (Variable Over Power Trip) prevention during RPCS (Reactor Power Cutback System) actuation and the improvement of CEA (Control Element Assembly) signal checking algorithm. To verify the improved CPCS algorithm, CPCS algorithm verification tests, 'Module Test' and 'Unit Test', would be performed on RCOPS single channel facility. It is expected that the improved CPCS algorithm will increase DNBR margin and enhance the plant availability by reducing unnecessary reactor trips
Directory of Open Access Journals (Sweden)
Y. Damchi
2015-06-01
Full Text Available The aim of the relay coordination is that protection systems detect and isolate the faulted part as fast and selective as possible. On the other hand, in order to reduce the fault clearing time, distance protection relays are usually equipped with pilot protection schemes. Such schemes can be considered in the distance and directional overcurrent relays (D&DOCRs coordination to achieve faster protection systems, while the selectivity is maintained. Therefore, in this paper, a new formulation is presented for the relay coordination problem considering pilot protection. In the proposed formulation, the selectivity constraints for the primary distance and backup overcurrent relays are defined based on the fault at the end of the transmission lines, rather than those at the end of the first zone of the primary distance relay. To solve this nonlinear optimization problem, a combination of genetic algorithm (GA and linear programming (LP is used as a hybrid genetic algorithm (HGA. The proposed approach is tested on an 8-bus and the IEEE 14-bus test systems. Simulation results indicate that considering the pilot protection in the D&DOCRS coordination, not only obtains feasible and effective solutions for the relay settings, but also reduces the overall operating time of the protection system.
Distance Protection of Cross-Bonded Transmission Cable-Systems
DEFF Research Database (Denmark)
Bak, Claus Leth; F. Jensen, Christian
2014-01-01
In this paper the problems of protecting a cross-bonded cable system using distance protection are analysed. The combination of the desire to expand the high voltage transmission grid and the public's opinion towards new installations of overhead lines (OHL), more and more transmission cable syst...
Time coordination of heterogeneous distance protections using a domain specific language
Directory of Open Access Journals (Sweden)
Marcin Kowalski
2012-01-01
Full Text Available BACKGROUND: Distance protections are widely used in protection of energy transmission lines, but their time coordination is still an important and difficult problem. Inappropriate configuration leads to a hazard event: remote circuit breaker tripping provided the local circuit breaker can be opened, which severely impairs power system operation.OBJECTIVE: To describe a method and provide software tools to alleviate the hazard in power systems.METHODS: A domain specific language (DSL for representation of a transmission line with its distance protection schema, and a translation algorithm from the DSL to probabilistic fault trees with time dependencies (PFTTDs are employed.RESULTS: The paper presents software tools that can support power protection experts in time coordination of distance protections. The tools are based upon abstract and concrete syntax of the DSL designed specifically for the purpose of the distance protection time coordination problem. In order to render creation of power line and its protection schema models easier, a DSL-dedicated editor supporting syntax and semantic aspects of the DSL has been developed. Additionally, a translator from the DSL into PFTTD language has been implemented.CONCLUSIONS: Power system experts are enabled to perform hazard probability assessment and sensitivity analysis.LIMITATIONS: Translation supports two types of distance protections, which are: single-system relays with starting elements as well as multi-system relays without starting elements. For the single-system relay, there is one timer per relay. For multi-system relays, there is one timer for each of possibly many protection zones. Other types of protections, e.g. overcurrent are not considered.
Glint Field Trial Results and Application to Glint Threshold Distance Algorithm
National Research Council Canada - National Science Library
Chevalier, William
1998-01-01
.... Glint threshold algorithm. Software adjustments would tentatively be made to the existing algorithm to improve glint threshold distance calculation accuracy, making the modified model a better iterative eye armor design tool...
Protection against hostile algorithms in UNIX software
Radatti, Peter V.
1996-03-01
Protection against hostile algorithms contained in Unix software is a growing concern without easy answers. Traditional methods used against similar attacks in other operating system environments such as MS-DOS or Macintosh are insufficient in the more complex environment provided by Unix. Additionally, Unix provides a special and significant problem in this regard due to its open and heterogeneous nature. These problems are expected to become both more common and pronounced as 32 bit multiprocess network operating systems become popular. Therefore, the problems experienced today are a good indicator of the problems and the solutions that will be experienced in the future, no matter which operating system becomes predominate.
Machine protection system algorithm compiler and simulator
International Nuclear Information System (INIS)
White, G.R.; Sherwin, G.
1993-01-01
The Machine Protection System (MPS) component of the SLC's beam selection system, in which integrated current is continuously monitored and limited to safe levels through careful selection and feedback of the beam repetition rate, is described elsewhere in these proceedings. The novel decision making mechanism by which that system can evaluate open-quotes safe levelsclose quotes, and choose an appropriate repetition rate in real-time, is described here. The algorithm that this mechanism uses to make its decision is written in test files and expressed in states of the accelerator and its devices, one file per accelerator region. Before being used, a file is open-quotes compiledclose quotes to a binary format which can be easily processed as a forward-chaining decision tree. It is processed by distributed microcomputers local to the accelerator regions. A parent algorithm evaluates all results, and reports directly to the beam control microprocessor. Operators can test new algorithms, or changes they make to them, with an online graphical MPS simulator
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.
Multiscale Distance Coherence Vector Algorithm for Content-Based Image Retrieval
Jiexian, Zeng; Xiupeng, Liu
2014-01-01
Multiscale distance coherence vector algorithm for content-based image retrieval (CBIR) is proposed due to the same descriptor with different shapes and the shortcomings of antinoise performance of the distance coherence vector algorithm. By this algorithm, the image contour curve is evolved by Gaussian function first, and then the distance coherence vector is, respectively, extracted from the contour of the original image and evolved images. Multiscale distance coherence vector was obtained by reasonable weight distribution of the distance coherence vectors of evolved images contour. This algorithm not only is invariable to translation, rotation, and scaling transformation but also has good performance of antinoise. The experiment results show us that the algorithm has a higher recall rate and precision rate for the retrieval of images polluted by noise. PMID:24883416
A sub-cubic time algorithm for computing the quartet distance between two general trees
DEFF Research Database (Denmark)
Nielsen, Jesper; Kristensen, Anders Kabell; Mailund, Thomas
2011-01-01
Background When inferring phylogenetic trees different algorithms may give different trees. To study such effects a measure for the distance between two trees is useful. Quartet distance is one such measure, and is the number of quartet topologies that differ between two trees. Results We have...... derived a new algorithm for computing the quartet distance between a pair of general trees, i.e. trees where inner nodes can have any degree ≥ 3. The time and space complexity of our algorithm is sub-cubic in the number of leaves and does not depend on the degree of the inner nodes. This makes...... it the fastest algorithm so far for computing the quartet distance between general trees independent of the degree of the inner nodes. Conclusions We have implemented our algorithm and two of the best competitors. Our new algorithm is significantly faster than the competition and seems to run in close...
Staged-Fault Testing of Distance Protection Relay Settings
Havelka, J.; Malarić, R.; Frlan, K.
2012-01-01
In order to analyze the operation of the protection system during induced fault testing in the Croatian power system, a simulation using the CAPE software has been performed. The CAPE software (Computer-Aided Protection Engineering) is expert software intended primarily for relay protection engineers, which calculates current and voltage values during faults in the power system, so that relay protection devices can be properly set up. Once the accuracy of the simulation model had been confirmed, a series of simulations were performed in order to obtain the optimal fault location to test the protection system. The simulation results were used to specify the test sequence definitions for the end-to-end relay testing using advanced testing equipment with GPS synchronization for secondary injection in protection schemes based on communication. The objective of the end-to-end testing was to perform field validation of the protection settings, including verification of the circuit breaker operation, telecommunication channel time and the effectiveness of the relay algorithms. Once the end-to-end secondary injection testing had been completed, the induced fault testing was performed with three-end lines loaded and in service. This paper describes and analyses the test procedure, consisting of CAPE simulations, end-to-end test with advanced secondary equipment and staged-fault test of a three-end power line in the Croatian transmission system.
Quantum Algorithm for K-Nearest Neighbors Classification Based on the Metric of Hamming Distance
Ruan, Yue; Xue, Xiling; Liu, Heng; Tan, Jianing; Li, Xi
2017-11-01
K-nearest neighbors (KNN) algorithm is a common algorithm used for classification, and also a sub-routine in various complicated machine learning tasks. In this paper, we presented a quantum algorithm (QKNN) for implementing this algorithm based on the metric of Hamming distance. We put forward a quantum circuit for computing Hamming distance between testing sample and each feature vector in the training set. Taking advantage of this method, we realized a good analog for classical KNN algorithm by setting a distance threshold value t to select k - n e a r e s t neighbors. As a result, QKNN achieves O( n 3) performance which is only relevant to the dimension of feature vectors and high classification accuracy, outperforms Llyod's algorithm (Lloyd et al. 2013) and Wiebe's algorithm (Wiebe et al. 2014).
Algorithms for Speeding up Distance-Based Outlier Detection
National Aeronautics and Space Administration — The problem of distance-based outlier detection is difficult to solve efficiently in very large datasets because of potential quadratic time complexity. We address...
International Nuclear Information System (INIS)
Lee, S.; Lee, J.; Song, S.; Yoon, J.; Lee, B.
2015-01-01
Highlights: • This paper presents an outline of the new project of the 154 kV SFCL in Korea. • And then we review some protection problems for the application of 154 kV SFCLs. • This paper proposes a new adaptive protection algorithm for 154 kV SFCLs. • The developed algorithm is tested in a simple distance relay system. - Abstract: In general, SFCLs can have a negative impact on the protective coordination in power transmission system because of the variable impedance of SFCLs. It is very important to solve the protection problems of the power system for the successful application of SFCLs to real power transmission system. This paper reviews some protection problems which can be caused by the application of 154 kV SFCLs to power transmission systems in South Korea. And then we propose an adaptive protection algorithm to solve the problems. The adaptive protection algorithm uses the real time information of the SFCL system operation.
Ridge Distance Estimation in Fingerprint Images: Algorithm and Performance Evaluation
Directory of Open Access Journals (Sweden)
Tian Jie
2004-01-01
Full Text Available It is important to estimate the ridge distance accurately, an intrinsic texture property of a fingerprint image. Up to now, only several articles have touched directly upon ridge distance estimation. Little has been published providing detailed evaluation of methods for ridge distance estimation, in particular, the traditional spectral analysis method applied in the frequency field. In this paper, a novel method on nonoverlap blocks, called the statistical method, is presented to estimate the ridge distance. Direct estimation ratio (DER and estimation accuracy (EA are defined and used as parameters along with time consumption (TC to evaluate performance of these two methods for ridge distance estimation. Based on comparison of performances of these two methods, a third hybrid method is developed to combine the merits of both methods. Experimental results indicate that DER is 44.7%, 63.8%, and 80.6%; EA is 84%, 93%, and 91%; and TC is , , and seconds, with the spectral analysis method, statistical method, and hybrid method, respectively.
Braking distance algorithm for autonomous cars using road surface recognition
Kavitha, C.; Ashok, B.; Nanthagopal, K.; Desai, Rohan; Rastogi, Nisha; Shetty, Siddhanth
2017-11-01
India is yet to accept semi/fully - autonomous cars and one of the reasons, was loss of control on bad roads. For a better handling on these roads we require advanced braking and that can be done by adapting electronics into the conventional type of braking. In Recent years, the automation in braking system led us to various benefits like traction control system, anti-lock braking system etc. This research work describes and experiments the method for recognizing road surface profile and calculating braking distance. An ultra-sonic surface recognition sensor, mounted underneath the car will send a high frequency wave on to the road surface, which is received by a receiver with in the sensor, it calculates the time taken for the wave to rebound and thus calculates the distance from the point where sensor is mounted. A displacement graph will be plotted based on the output of the sensor. A relationship can be derived between the displacement plot and roughness index through which the friction coefficient can be derived in Matlab for continuous calculation throughout the distance travelled. Since it is a non-contact type of profiling, it is non-destructive. The friction coefficient values received in real-time is used to calculate optimum braking distance. This system, when installed on normal cars can also be used to create a database of road surfaces, especially in cities, which can be shared with other cars. This will help in navigation as well as making the cars more efficient.
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Fagerberg, Rolf; Mailund, Thomas
2013-01-01
), respectively, and counting how often the induced topologies in the two input trees are different. In this paper we present efficient algorithms for computing these distances. We show how to compute the triplet distance in time O(n log n) and the quartet distance in time O(d n log n), where d is the maximal......The triplet and quartet distances are distance measures to compare two rooted and two unrooted trees, respectively. The leaves of the two trees should have the same set of n labels. The distances are defined by enumerating all subsets of three labels (triplets) and four labels (quartets...... degree of any node in the two trees. Within the same time bounds, our framework also allows us to compute the parameterized triplet and quartet distances, where a parameter is introduced to weight resolved (binary) topologies against unresolved (non-binary) topologies. The previous best algorithm...
Wang, Jeen-Shing; Lin, Che-Wei; Yang, Ya-Ting C; Ho, Yu-Jen
2012-10-01
This paper presents a walking pattern classification and a walking distance estimation algorithm using gait phase information. A gait phase information retrieval algorithm was developed to analyze the duration of the phases in a gait cycle (i.e., stance, push-off, swing, and heel-strike phases). Based on the gait phase information, a decision tree based on the relations between gait phases was constructed for classifying three different walking patterns (level walking, walking upstairs, and walking downstairs). Gait phase information was also used for developing a walking distance estimation algorithm. The walking distance estimation algorithm consists of the processes of step count and step length estimation. The proposed walking pattern classification and walking distance estimation algorithm have been validated by a series of experiments. The accuracy of the proposed walking pattern classification was 98.87%, 95.45%, and 95.00% for level walking, walking upstairs, and walking downstairs, respectively. The accuracy of the proposed walking distance estimation algorithm was 96.42% over a walking distance.
Data quality system using reference dictionaries and edit distance algorithms
Karbarz, Radosław; Mulawka, Jan
2015-09-01
The real art of management it is important to make smart decisions, what in most of the cases is not a trivial task. Those decisions may lead to determination of production level, funds allocation for investments etc. Most of the parameters in decision-making process such as: interest rate, goods value or exchange rate may change. It is well know that these parameters in the decision-making are based on the data contained in datamarts or data warehouse. However, if the information derived from the processed data sets is the basis for the most important management decisions, it is required that the data is accurate, complete and current. In order to achieve high quality data and to gain from them measurable business benefits, data quality system should be used. The article describes the approach to the problem, shows the algorithms in details and their usage. Finally the test results are provide. Test results show the best algorithms (in terms of quality and quantity) for different parameters and data distribution.
Distance Education Programs in Radiation Protection- A ten year Review
International Nuclear Information System (INIS)
Gauvin, J. P.
2004-01-01
Professional development has always played a critical role in the organisation of radiation safety programs. Training programs for professionals, technologists and general workers involved in high risk trades vary according to their experience and specific functions. The key concept for effective programs consists in the proper match of the training content with the individual skills and interests of the participants. In conventional class training, unless the students constitute an homogeneous group, the teaching can not perfectly follow the specific needs of all participants and the pace of the course is kept at a sub-optimal level in order to accommodate less talented participants. Distance education with Electronic Mail, web CT, first class mail, and other communication tools has been used with success during the last decade in undergraduate, master's and doctoral programs as well as in continuing training for workers. It offers a wide range of teaching strategies and course content. Compared to conventional training, it has numerous benefits: (1) Travel costs for students and instructors are eliminated and international groups of students and professors can easily be constituted; (2) Instructors can be recruited worldwide; (3) Discussion forums can be established easily; (4) Integration of expert guests into online course discussions are possible; (5) Student online publications of projects, assignments and abstracts are current; (6) Schedules are more flexible and proctored examinations are possible. The author will present the strategies used at McGill University in the teaching of Radiation Protection to physicians and professionals ( MSc. level ) and the application of distance education methods for training large groups of workers in biomedical research centres, hospitals, power generation facilities and utilities in general. He will describe the content of the programs, the study guides, the evaluation formats, web-site references and resources, the
An improved initialization center k-means clustering algorithm based on distance and density
Duan, Yanling; Liu, Qun; Xia, Shuyin
2018-04-01
Aiming at the problem of the random initial clustering center of k means algorithm that the clustering results are influenced by outlier data sample and are unstable in multiple clustering, a method of central point initialization method based on larger distance and higher density is proposed. The reciprocal of the weighted average of distance is used to represent the sample density, and the data sample with the larger distance and the higher density are selected as the initial clustering centers to optimize the clustering results. Then, a clustering evaluation method based on distance and density is designed to verify the feasibility of the algorithm and the practicality, the experimental results on UCI data sets show that the algorithm has a certain stability and practicality.
Energy Technology Data Exchange (ETDEWEB)
Narasimhadhan, A.V.; Rajgopal, Kasi
2011-07-01
This paper presents a new hybrid filtered backprojection (FBP) algorithm for fan-beam and cone-beam scan. The hybrid reconstruction kernel is the sum of the ramp and Hilbert filters. We modify the redundancy weighting function to reduce the inverse square distance weighting in the backprojection to inverse distance weight. The modified weight also eliminates the derivative associated with the Hilbert filter kernel. Thus, the proposed reconstruction algorithm has the advantages of the inverse distance weight in the backprojection. We evaluate the performance of the new algorithm in terms of the magnitude level and uniformity in noise for the fan-beam geometry. The computer simulations show that the spatial resolution is nearly identical to the standard fan-beam ramp filtered algorithm while the noise is spatially uniform and the noise variance is reduced. (orig.)
Directory of Open Access Journals (Sweden)
Kae Y. Foo
2010-01-01
Full Text Available The task of localizing underwater assets involves the relative localization of each unit using only pairwise distance measurements, usually obtained from time-of-arrival or time-delay-of-arrival measurements. In the fluctuating underwater environment, a complete set of pair-wise distance measurements can often be difficult to acquire, thus hindering a straightforward closed-form solution in deriving the assets' relative coordinates. An iterative multidimensional scaling approach is presented based upon a weighted-majorization algorithm that tolerates missing or inaccurate distance measurements. Substantial modifications are proposed to optimize the algorithm, while the effects of refractive propagation paths are considered. A parametric study of the algorithm based upon simulation results is shown. An acoustic field-trial was then carried out, presenting field measurements to highlight the practical implementation of this algorithm.
Power unit impedance and distance protection functions during faults in the external power grid
Directory of Open Access Journals (Sweden)
Marcin Lizer
2012-12-01
Full Text Available This paper presents the problem of the risk of an unnecessary tripping of a generation unit’s underimpedance protection functions in circumstances of generator power swings following elimination of long-lasting fault in the external power grid. The fi rst part describes typical solutions of a generator impedance protection function (21e and unit distance protection function (21s. Starting characteristics of these protection functions are shown, as well as their typical operating logics and ways of calculating their settings. Then exemplary (the most common solutions of unit under-impedance relays power swing blocking functions are described. Following this introduction, the issues of the threat of unnecessary operation of fast-tripping protection zones of 21e and 21s protection functions are described, which arises in the circumstances of generator asynchronous power swings occurring after elimination of long-lasting faults in the grid supplied by the power unit. The paper also shows that the available power swing blocking functions may not be able to correctly detect the described conditions, thus allowing the unnecessary operation of under-impedance relays. How an impedance calculation algorithm affects the impedance trajectory seen by a protection relay is also resented.
Quantum algorithms on Walsh transform and Hamming distance for Boolean functions
Xie, Zhengwei; Qiu, Daowen; Cai, Guangya
2018-06-01
Walsh spectrum or Walsh transform is an alternative description of Boolean functions. In this paper, we explore quantum algorithms to approximate the absolute value of Walsh transform W_f at a single point z0 (i.e., |W_f(z0)|) for n-variable Boolean functions with probability at least 8/π 2 using the number of O(1/|W_f(z_{0)|ɛ }) queries, promised that the accuracy is ɛ , while the best known classical algorithm requires O(2n) queries. The Hamming distance between Boolean functions is used to study the linearity testing and other important problems. We take advantage of Walsh transform to calculate the Hamming distance between two n-variable Boolean functions f and g using O(1) queries in some cases. Then, we exploit another quantum algorithm which converts computing Hamming distance between two Boolean functions to quantum amplitude estimation (i.e., approximate counting). If Ham(f,g)=t≠0, we can approximately compute Ham( f, g) with probability at least 2/3 by combining our algorithm and {Approx-Count(f,ɛ ) algorithm} using the expected number of Θ( √{N/(\\lfloor ɛ t\\rfloor +1)}+√{t(N-t)}/\\lfloor ɛ t\\rfloor +1) queries, promised that the accuracy is ɛ . Moreover, our algorithm is optimal, while the exact query complexity for the above problem is Θ(N) and the query complexity with the accuracy ɛ is O(1/ɛ 2N/(t+1)) in classical algorithm, where N=2n. Finally, we present three exact quantum query algorithms for two promise problems on Hamming distance using O(1) queries, while any classical deterministic algorithm solving the problem uses Ω(2n) queries.
A practical O(n log2 n) time algorithm for computing the triplet distance on binary trees
DEFF Research Database (Denmark)
Sand, Andreas; Pedersen, Christian Nørgaard Storm; Mailund, Thomas
2013-01-01
rooted binary trees in time O (n log2 n). The algorithm is related to an algorithm for computing the quartet distance between two unrooted binary trees in time O (n log n). While the quartet distance algorithm has a very severe overhead in the asymptotic time complexity that makes it impractical compared......The triplet distance is a distance measure that compares two rooted trees on the same set of leaves by enumerating all sub-sets of three leaves and counting how often the induced topologies of the tree are equal or different. We present an algorithm that computes the triplet distance between two...
Applications and Benefits for Big Data Sets Using Tree Distances and The T-SNE Algorithm
2016-03-01
BENEFITS FOR BIG DATA SETS USING TREE DISTANCES AND THE T-SNE ALGORITHM by Suyoung Lee March 2016 Thesis Advisor: Samuel E. Buttrey...REPORT TYPE AND DATES COVERED Master’s thesis 4. TITLE AND SUBTITLE APPLICATIONS AND BENEFITS FOR BIG DATA SETS USING TREE DISTANCES AND THE T-SNE...public release; distribution is unlimited 12b. DISTRIBUTION CODE 13. ABSTRACT (maximum 200 words ) Modern data sets often consist of unstructured data
Directory of Open Access Journals (Sweden)
Y. Gholipour
Full Text Available This paper focuses on a metamodel-based design optimization algorithm. The intention is to improve its computational cost and convergence rate. Metamodel-based optimization method introduced here, provides the necessary means to reduce the computational cost and convergence rate of the optimization through a surrogate. This algorithm is a combination of a high quality approximation technique called Inverse Distance Weighting and a meta-heuristic algorithm called Harmony Search. The outcome is then polished by a semi-tabu search algorithm. This algorithm adopts a filtering system and determines solution vectors where exact simulation should be applied. The performance of the algorithm is evaluated by standard truss design problems and there has been a significant decrease in the computational effort and improvement of convergence rate.
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.
Improved Mask Protected DES using RSA Algorithm
Directory of Open Access Journals (Sweden)
Asha Latha S.
2016-01-01
Full Text Available The data encryption standard is a pioneering and farsighted standard which helped to set a new paradigm for encryption standards. But now DES is considered to be insecure for some application. Asymmetric mask protected DES is an advanced encryption method for effectively protecting the advanced DES. There are still probabilities to improve its security. This paper propose a method, which introduce a RSA key generation scheme in mask protected DES instead of plain key, which result in enhancement in the security of present asymmetric mask protected DES. We further propose a Vedic mathematical method of RSA implementation which reduce the complexity of computation in RSA block thereby resulting in reduced delay (four timesthat improves the performance of overall system. The software implementation was performed using Xilinx 13.2 and Model-Sim was used for the simulation environment.
A Distance-Adaptive Refueling Recommendation Algorithm for Self-Driving Travel
Directory of Open Access Journals (Sweden)
Quanli Xu
2018-03-01
Full Text Available Taking the maximum vehicle driving distance, the distances from gas stations, the route length, and the number of refueling gas stations as the decision conditions, recommendation rules and an early refueling service warning mechanism for gas stations along a self-driving travel route were constructed by using the algorithm presented in this research, based on the spatial clustering characteristics of gas stations and the urgency of refueling. Meanwhile, by combining ArcEngine and Matlab capabilities, a scenario simulation system of refueling for self-driving travel was developed by using c#.net in order to validate and test the accuracy and applicability of the algorithm. A total of nine testing schemes with four simulation scenarios were designed and executed using this algorithm, and all of the simulation results were consistent with expectations. The refueling recommendation algorithm proposed in this study can automatically adapt to changes in the route length of self-driving travel, the maximum driving distance of the vehicle, and the distance from gas stations, which could provide variable refueling recommendation strategies according to differing gas station layouts along the route. Therefore, the results of this study could provide a scientific reference for the reasonable planning and timely supply of vehicle refueling during self-driving travel.
Bal, A.; Alam, M. S.; Aslan, M. S.
2006-05-01
Often sensor ego-motion or fast target movement causes the target to temporarily go out of the field-of-view leading to reappearing target detection problem in target tracking applications. Since the target goes out of the current frame and reenters at a later frame, the reentering location and variations in rotation, scale, and other 3D orientations of the target are not known thus complicating the detection algorithm has been developed using Fukunaga-Koontz Transform (FKT) and distance classifier correlation filter (DCCF). The detection algorithm uses target and background information, extracted from training samples, to detect possible candidate target images. The detected candidate target images are then introduced into the second algorithm, DCCF, called clutter rejection module, to determine the target coordinates are detected and tracking algorithm is initiated. The performance of the proposed FKT-DCCF based target detection algorithm has been tested using real-world forward looking infrared (FLIR) video sequences.
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.
A simple algorithm for estimation of source-to-detector distance in Compton imaging
International Nuclear Information System (INIS)
Rawool-Sullivan, Mohini W.; Sullivan, John P.; Tornga, Shawn R.; Brumby, Steven P.
2008-01-01
Compton imaging is used to predict the location of gamma-emitting radiation sources. The X and Y coordinates of the source can be obtained using a back-projected image and a two-dimensional peak-finding algorithm. The emphasis of this work is to estimate the source-to-detector distance (Z). The algorithm presented uses the solid angle subtended by the reconstructed image at various source-to-detector distances. This algorithm was validated using both measured data from the prototype Compton imager (PCI) constructed at the Los Alamos National Laboratory and simulated data of the same imager. Results show this method can be applied successfully to estimate Z, and it provides a way of determining Z without prior knowledge of the source location. This method is faster than the methods that employ maximum likelihood method because it is based on simple back projections of Compton scatter data
Privacy Protection in Cloud Using Rsa Algorithm
Amandeep Kaur; Manpreet Kaur
2014-01-01
The cloud computing architecture has been on high demand nowadays. The cloud has been successful over grid and distributed environment due to its cost and high reliability along with high security. However in the area of research it is observed that cloud computing still has some issues in security regarding privacy. The cloud broker provide services of cloud to general public and ensures that data is protected however they sometimes lag security and privacy. Thus in this work...
International Nuclear Information System (INIS)
Cheng, X C; Su, S J; Wang, Y K; Du, J B
2006-01-01
In order to identify each base-station in quasi-GPS ultrasonic location system, a unique pseudo-random code is assigned to each base-station. This article primarily studies the distance estimation problem between Autonomous Guide Vehicle (AGV) and single base-station, and then the ultrasonic spread-spectrum distance measurement Time Delay Estimation (TDE) model is established. Based on the above model, the envelope correlation fast TDE algorithm based on FFT is presented and analyzed. It shows by experiments that when the m sequence used in the received signal is as same as the reference signal, there will be a sharp correlation value in their envelope correlation function after they are processed by the above algorithm; otherwise, the will be no prominent correlation value. So, the AGV can identify each base-station easily
Energy Technology Data Exchange (ETDEWEB)
Cheng, X C; Su, S J; Wang, Y K; Du, J B [Instrument Department, College of Mechatronics Engineering and Automation, National University of Defense Technology, ChangSha, Hunan, 410073 (China)
2006-10-15
In order to identify each base-station in quasi-GPS ultrasonic location system, a unique pseudo-random code is assigned to each base-station. This article primarily studies the distance estimation problem between Autonomous Guide Vehicle (AGV) and single base-station, and then the ultrasonic spread-spectrum distance measurement Time Delay Estimation (TDE) model is established. Based on the above model, the envelope correlation fast TDE algorithm based on FFT is presented and analyzed. It shows by experiments that when the m sequence used in the received signal is as same as the reference signal, there will be a sharp correlation value in their envelope correlation function after they are processed by the above algorithm; otherwise, the will be no prominent correlation value. So, the AGV can identify each base-station easily.
Energy Technology Data Exchange (ETDEWEB)
Brown, D. F.; Freeman, W. A.; Carhart, R. A.; Krumpolc, M.; Decision and Information Sciences; Univ. of Illinois at Chicago
2005-09-23
This report provides technical documentation for values in the Table of Initial Isolation and Protective Action Distances (PADs) in the 2004 Emergency Response Guidebook (ERG2004). The objective for choosing the PADs specified in the ERG2004 is to balance the need to adequately protect the public from exposure to potentially harmful substances against the risks and expenses that could result from overreacting to a spill. To quantify this balance, a statistical approach is adopted, whereby the best available information is used to conduct an accident scenario analysis and develop a set of up to 1,000,000 hypothetical incidents. The set accounts for differences in containers types, incident types, accident severity (i.e., amounts released), locations, times of day, times of year, and meteorological conditions. Each scenario is analyzed using detailed emission rate and atmospheric dispersion models to calculate the downwind chemical concentrations from which a 'safe distance' is determined. The safe distance is defined as the distance downwind from the source at which the chemical concentration falls below health protection criteria. The American Industrial Hygiene Association's Emergency Response Planning Guideline Level 2 (ERPG-2) or equivalent is the health criteria used. The statistical sample of safe distance values for all incidents considered in the analysis are separated into four categories: small spill/daytime release, small spill/nighttime release, large spill/daytime release, and large spill/nighttime release. The 90th-percentile safe distance values for each of these groups became the PADs that appear in the ERG2004.
A Simple Density with Distance Based Initial Seed Selection Technique for K Means Algorithm
Directory of Open Access Journals (Sweden)
Sajidha Syed Azimuddin
2017-01-01
Full Text Available Open issues with respect to K means algorithm are identifying the number of clusters, initial seed concept selection, clustering tendency, handling empty clusters, identifying outliers etc. In this paper we propose a novel and a simple technique considering both density and distance of the concepts in a dataset to identify initial seed concepts for clustering. Many authors have proposed different techniques to identify initial seed concepts; but our method ensures that the initial seed concepts are chosen from different clusters that are to be generated by the clustering solution. The hallmark of our algorithm is that it is a single pass algorithm that does not require any extra parameters to be estimated. Further, our seed concepts are one among the actual concepts and not the mean of representative concepts as is the case in many other algorithms. We have implemented our proposed algorithm and compared the results with the interval based technique of Fouad Khan. We see that our method outperforms the interval based method. We have also compared our method with the original random K means and K Means++ algorithms.
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.
Efficient sequential and parallel algorithms for finding edit distance based motifs.
Pal, Soumitra; Xiao, Peng; Rajasekaran, Sanguthevar
2016-08-18
Motif search is an important step in extracting meaningful patterns from biological data. The general problem of motif search is intractable and there is a pressing need to develop efficient, exact and approximation algorithms to solve this problem. In this paper, we present several novel, exact, sequential and parallel algorithms for solving the (l,d) Edit-distance-based Motif Search (EMS) problem: given two integers l,d and n biological strings, find all strings of length l that appear in each input string with atmost d errors of types substitution, insertion and deletion. One popular technique to solve the problem is to explore for each input string the set of all possible l-mers that belong to the d-neighborhood of any substring of the input string and output those which are common for all input strings. We introduce a novel and provably efficient neighborhood exploration technique. We show that it is enough to consider the candidates in neighborhood which are at a distance exactly d. We compactly represent these candidate motifs using wildcard characters and efficiently explore them with very few repetitions. Our sequential algorithm uses a trie based data structure to efficiently store and sort the candidate motifs. Our parallel algorithm in a multi-core shared memory setting uses arrays for storing and a novel modification of radix-sort for sorting the candidate motifs. The algorithms for EMS are customarily evaluated on several challenging instances such as (8,1), (12,2), (16,3), (20,4), and so on. The best previously known algorithm, EMS1, is sequential and in estimated 3 days solves up to instance (16,3). Our sequential algorithms are more than 20 times faster on (16,3). On other hard instances such as (9,2), (11,3), (13,4), our algorithms are much faster. Our parallel algorithm has more than 600 % scaling performance while using 16 threads. Our algorithms have pushed up the state-of-the-art of EMS solvers and we believe that the techniques introduced in
Kazmier, Kelli; Alexander, Nathan S.; Meiler, Jens; Mchaourab, Hassane S.
2010-01-01
A hybrid protein structure determination approach combining sparse Electron Paramagnetic Resonance (EPR) distance restraints and Rosetta de novo protein folding has been previously demonstrated to yield high quality models (Alexander et al., 2008). However, widespread application of this methodology to proteins of unknown structures is hindered by the lack of a general strategy to place spin label pairs in the primary sequence. In this work, we report the development of an algorithm that optimally selects spin labeling positions for the purpose of distance measurements by EPR. For the α-helical subdomain of T4 lysozyme (T4L), simulated restraints that maximize sequence separation between the two spin labels while simultaneously ensuring pairwise connectivity of secondary structure elements yielded vastly improved models by Rosetta folding. 50% of all these models have the correct fold compared to only 21% and 8% correctly folded models when randomly placed restraints or no restraints are used, respectively. Moreover, the improvements in model quality require a limited number of optimized restraints, the number of which is determined by the pairwise connectivities of T4L α-helices. The predicted improvement in Rosetta model quality was verified by experimental determination of distances between spin labels pairs selected by the algorithm. Overall, our results reinforce the rationale for the combined use of sparse EPR distance restraints and de novo folding. By alleviating the experimental bottleneck associated with restraint selection, this algorithm sets the stage for extending computational structure determination to larger, traditionally elusive protein topologies of critical structural and biochemical importance. PMID:21074624
Yu, Guizhen; Zhou, Bin; Wang, Yunpeng; Wun, Xinkai; Wang, Pengcheng
2015-12-01
Due to more severe challenges of traffic safety problems, the Advanced Driver Assistance Systems (ADAS) has received widespread attention. Measuring the distance to a preceding vehicle is important for ADAS. However, the existing algorithm focuses more on straight road sections than on curve measurements. In this paper, we present a novel measuring algorithm for the distance to a preceding vehicle on a curve road using on-board monocular camera. Firstly, the characteristics of driving on the curve road is analyzed and the recognition of the preceding vehicle road area is proposed. Then, the vehicle detection and distance measuring algorithms are investigated. We have verified these algorithms on real road driving. The experimental results show that this method proposed in the paper can detect the preceding vehicle on curve roads and accurately calculate the longitudinal distance and horizontal distance to the preceding vehicle.
Luo, Yugong; Chen, Tao; Li, Keqiang
2015-12-01
The paper presents a novel active distance control strategy for intelligent hybrid electric vehicles (IHEV) with the purpose of guaranteeing an optimal performance in view of the driving functions, optimum safety, fuel economy and ride comfort. Considering the complexity of driving situations, the objects of safety and ride comfort are decoupled from that of fuel economy, and a hierarchical control architecture is adopted to improve the real-time performance and the adaptability. The hierarchical control structure consists of four layers: active distance control object determination, comprehensive driving and braking torque calculation, comprehensive torque distribution and torque coordination. The safety distance control and the emergency stop algorithms are designed to achieve the safety and ride comfort goals. The optimal rule-based energy management algorithm of the hybrid electric system is developed to improve the fuel economy. The torque coordination control strategy is proposed to regulate engine torque, motor torque and hydraulic braking torque to improve the ride comfort. This strategy is verified by simulation and experiment using a forward simulation platform and a prototype vehicle. The results show that the novel control strategy can achieve the integrated and coordinated control of its multiple subsystems, which guarantees top performance of the driving functions and optimum safety, fuel economy and ride comfort.
Emil Bartosiewicz; Ryszard Kowalik; Marcin Januszewski
2014-01-01
The paper presents a short review of pilot schemes which are available in modern line distance protection relays, and example results of common pilot scheme tests with the testing methods description. Some differences in implementations of selected pilot schemes have been shown for comparison reasons. Distance protection coordination functions have been tested for GE Multilin UR series devices. Every type of available pilot scheme has been checked in synthetic tests and during the real ...
Energy Technology Data Exchange (ETDEWEB)
Marco, M.; Rodriguez, M.; Gonzalez Giralda, C.G.; Bailador Ferreras, A.B. [CIEMAT, Madrid (Spain); Coeck, M.C. [Studiecentrum voor Kernenergie - Centre d' Etude de l' Energie Nucleaire, Mol (Belgium); Etard, C.E. [CEA Saclay, 91 - Gif sur Yvette (France). INSTN, Institut National des Sciences et Techniques Nucleaires; Moebius, S.M. [FZK -FTU, Munich (Germany); Schmitt-Hanning, A.S. [BfS, Karlsruhe (Germany); Luciani, A.I. [ENEA, Bologna (Italy); Van Der Steen, J.V. [NRG, Petten (Netherlands)
2006-07-01
Full text: A sustainable Education and Training (E.T.) infrastructure for Radiation Protection is an essential component to combat the decline in expertise and to ensure the continuation of the high level of radiation protection knowledge in the future. Such infrastructure has to be built in such a way that both the initial training (Education) and the unceasing maintenance of the level of competencies (referred to as 'Training') are available. The E.N.E.T.R.A.P. project intends to develop the E.T. infrastructure mentioned. To achieve the aims of the different tasks and activities, the work programme for the E.N.E.T.R.A.P. Network is divided in eight work packages developed by 11 partners: Each partner will assume responsibility for the W.P.s. C.I.E.M.A.T. is involved in the W.P.-5 'New concepts and new tools for an E.R.P.C.'. The tasks of the W.P.-5 are focussed in the investigation of the electronic tools used in R.P. training and education. This paper presents the first results of this working group. The first task is an approach to the development and usage of learning resources. A review on the e-learning methodologies, the present state of art and its evolution, are being carried out. Results will be used to select the best way to host learning activities in the framework of the E.N.E.T.R.A.P. project. Another important task is to identify, analyse and evaluate the Open and Distance learning tools and material existing for train ing in Radiation Protection. A review on the evolutions, approaches and methodologies aiming to provide education and training in radiation protection, will be carried out. The results of this task will be a summary of links referred to the most interesting R.P. e-learning. Finally, taking in account the previous results a pilot R.P. module of E.R.P.C. should be prepared. (authors)
International Nuclear Information System (INIS)
Marco, M.; Rodriguez, M.; Gonzalez Giralda, C.G.; Bailador Ferreras, A.B.; Coeck, M.C.; Etard, C.E.; Schmitt-Hanning, A.S.; Luciani, A.I.; Van Der Steen, J.V.
2006-01-01
Full text: A sustainable Education and Training (E.T.) infrastructure for Radiation Protection is an essential component to combat the decline in expertise and to ensure the continuation of the high level of radiation protection knowledge in the future. Such infrastructure has to be built in such a way that both the initial training (Education) and the unceasing maintenance of the level of competencies (referred to as 'Training') are available. The E.N.E.T.R.A.P. project intends to develop the E.T. infrastructure mentioned. To achieve the aims of the different tasks and activities, the work programme for the E.N.E.T.R.A.P. Network is divided in eight work packages developed by 11 partners: Each partner will assume responsibility for the W.P.s. C.I.E.M.A.T. is involved in the W.P.-5 'New concepts and new tools for an E.R.P.C.'. The tasks of the W.P.-5 are focussed in the investigation of the electronic tools used in R.P. training and education. This paper presents the first results of this working group. The first task is an approach to the development and usage of learning resources. A review on the e-learning methodologies, the present state of art and its evolution, are being carried out. Results will be used to select the best way to host learning activities in the framework of the E.N.E.T.R.A.P. project. Another important task is to identify, analyse and evaluate the Open and Distance learning tools and material existing for train ing in Radiation Protection. A review on the evolutions, approaches and methodologies aiming to provide education and training in radiation protection, will be carried out. The results of this task will be a summary of links referred to the most interesting R.P. e-learning. Finally, taking in account the previous results a pilot R.P. module of E.R.P.C. should be prepared. (authors)
Nikitin, P. V.; Savinov, A. N.; Bazhenov, R. I.; Sivandaev, S. V.
2018-05-01
The article describes the method of identifying a person in distance learning systems based on a keyboard rhythm. An algorithm for the organization of access control is proposed, which implements authentication, identification and verification of a person using the keyboard rhythm. Authentication methods based on biometric personal parameters, including those based on the keyboard rhythm, due to the inexistence of biometric characteristics without a particular person, are able to provide an advanced accuracy and inability to refuse authorship and convenience for operators of automated systems, in comparison with other methods of conformity checking. Methods of permanent hidden keyboard monitoring allow detecting the substitution of a student and blocking the key system.
Onoyama, Takashi; Maekawa, Takuya; Kubota, Sen; Tsuruta, Setuso; Komoda, Norihisa
To build a cooperative logistics network covering multiple enterprises, a planning method that can build a long-distance transportation network is required. Many strict constraints are imposed on this type of problem. To solve these strict-constraint problems, a selfish constraint satisfaction genetic algorithm (GA) is proposed. In this GA, each gene of an individual satisfies only its constraint selfishly, disregarding the constraints of other genes in the same individuals. Moreover, a constraint pre-checking method is also applied to improve the GA convergence speed. The experimental result shows the proposed method can obtain an accurate solution in a practical response time.
Effects of Wind Turbines Equipped with Doubly-fed Induction Generators on Distance Protection
Institute of Scientific and Technical Information of China (English)
2012-01-01
Nowadays wind energy is the fastest growing renewable energy resource in the world. The problems of integrating wind farms are caused by changes of wind speed during a day. Moreover, the behaviors of wind turbines equipped with doubly-fed induction generators differ fundamentally from synchronous generators. Therefore, more considerations are needed to analyze the performances of the distance protection relays. The protection of a wind farm with distance relay is inspected. By changing the conditions of the wind farm, the characteristics of the distance relay are studied.
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.
DEFF Research Database (Denmark)
Jia, Jundi; Yang, Guangya; Nielsen, Arne Hejde
2018-01-01
on distance protection are evaluated using a commercial relay through hardware-in-the-loop (HIL) tests. Based on the test results, we propose to avoid using constant reactive power control strategy. It poses an adverse impact on the reliability and speed of distance protection regardless of the presence of SC....... This might bring up challenges to the protection system of a converter-dominated power system. This paper derives a generic converter peak current limitation method for three different VSC control strategies. The impact of the control strategies and the combined impact of a VSC with a synchronous condenser...... at the point of common coupling (PCC), while constant active power and balanced current control strategies favor the performances of distance protection....
Mei, Gang; Xu, Liangliang; Xu, Nengxiong
2017-09-01
This paper focuses on designing and implementing parallel adaptive inverse distance weighting (AIDW) interpolation algorithms by using the graphics processing unit (GPU). The AIDW is an improved version of the standard IDW, which can adaptively determine the power parameter according to the data points' spatial distribution pattern and achieve more accurate predictions than those predicted by IDW. In this paper, we first present two versions of the GPU-accelerated AIDW, i.e. the naive version without profiting from the shared memory and the tiled version taking advantage of the shared memory. We also implement the naive version and the tiled version using two data layouts, structure of arrays and array of aligned structures, on both single and double precision. We then evaluate the performance of parallel AIDW by comparing it with its corresponding serial algorithm on three different machines equipped with the GPUs GT730M, M5000 and K40c. The experimental results indicate that: (i) there is no significant difference in the computational efficiency when different data layouts are employed; (ii) the tiled version is always slightly faster than the naive version; and (iii) on single precision the achieved speed-up can be up to 763 (on the GPU M5000), while on double precision the obtained highest speed-up is 197 (on the GPU K40c). To benefit the community, all source code and testing data related to the presented parallel AIDW algorithm are publicly available.
Directory of Open Access Journals (Sweden)
Karla Vittori
2008-12-01
Full Text Available We propose a new distance algorithm for phylogenetic estimation based on Ant Colony Optimization (ACO, named Ant-Based Phylogenetic Reconstruction (ABPR. ABPR joins two taxa iteratively based on evolutionary distance among sequences, while also accounting for the quality of the phylogenetic tree built according to the total length of the tree. Similar to optimization algorithms for phylogenetic estimation, the algorithm allows exploration of a larger set of nearly optimal solutions. We applied the algorithm to four empirical data sets of mitochondrial DNA ranging from 12 to 186 sequences, and from 898 to 16,608 base pairs, and covering taxonomic levels from populations to orders. We show that ABPR performs better than the commonly used Neighbor-Joining algorithm, except when sequences are too closely related (e.g., population-level sequences. The phylogenetic relationships recovered at and above species level by ABPR agree with conventional views. However, like other algorithms of phylogenetic estimation, the proposed algorithm failed to recover expected relationships when distances are too similar or when rates of evolution are very variable, leading to the problem of long-branch attraction. ABPR, as well as other ACO-based algorithms, is emerging as a fast and accurate alternative method of phylogenetic estimation for large data sets.
International Nuclear Information System (INIS)
Chen Jian-Lin; Li Lei; Wang Lin-Yuan; Cai Ai-Long; Xi Xiao-Qi; Zhang Han-Ming; Li Jian-Xin; Yan Bin
2015-01-01
The projection matrix model is used to describe the physical relationship between reconstructed object and projection. Such a model has a strong influence on projection and backprojection, two vital operations in iterative computed tomographic reconstruction. The distance-driven model (DDM) is a state-of-the-art technology that simulates forward and back projections. This model has a low computational complexity and a relatively high spatial resolution; however, it includes only a few methods in a parallel operation with a matched model scheme. This study introduces a fast and parallelizable algorithm to improve the traditional DDM for computing the parallel projection and backprojection operations. Our proposed model has been implemented on a GPU (graphic processing unit) platform and has achieved satisfactory computational efficiency with no approximation. The runtime for the projection and backprojection operations with our model is approximately 4.5 s and 10.5 s per loop, respectively, with an image size of 256×256×256 and 360 projections with a size of 512×512. We compare several general algorithms that have been proposed for maximizing GPU efficiency by using the unmatched projection/backprojection models in a parallel computation. The imaging resolution is not sacrificed and remains accurate during computed tomographic reconstruction. (paper)
Wang, Jin; Li, Bin; Xia, Feng; Kim, Chang-Seob; Kim, Jeong-Uk
2014-08-18
Traffic patterns in wireless sensor networks (WSNs) usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.
Classification of EEG Signals using adaptive weighted distance nearest neighbor algorithm
Directory of Open Access Journals (Sweden)
E. Parvinnia
2014-01-01
Full Text Available Electroencephalogram (EEG signals are often used to diagnose diseases such as seizure, alzheimer, and schizophrenia. One main problem with the recorded EEG samples is that they are not equally reliable due to the artifacts at the time of recording. EEG signal classification algorithms should have a mechanism to handle this issue. It seems that using adaptive classifiers can be useful for the biological signals such as EEG. In this paper, a general adaptive method named weighted distance nearest neighbor (WDNN is applied for EEG signal classification to tackle this problem. This classification algorithm assigns a weight to each training sample to control its influence in classifying test samples. The weights of training samples are used to find the nearest neighbor of an input query pattern. To assess the performance of this scheme, EEG signals of thirteen schizophrenic patients and eighteen normal subjects are analyzed for the classification of these two groups. Several features including, fractal dimension, band power and autoregressive (AR model are extracted from EEG signals. The classification results are evaluated using Leave one (subject out cross validation for reliable estimation. The results indicate that combination of WDNN and selected features can significantly outperform the basic nearest-neighbor and the other methods proposed in the past for the classification of these two groups. Therefore, this method can be a complementary tool for specialists to distinguish schizophrenia disorder.
Wei, B. G.; Huo, K. X.; Yao, Z. F.; Lou, J.; Li, X. Y.
2018-03-01
It is one of the difficult problems encountered in the research of condition maintenance technology of transformers to recognize partial discharge (PD) pattern. According to the main physical characteristics of PD, three models of oil-paper insulation defects were set up in laboratory to study the PD of transformers, and phase resolved partial discharge (PRPD) was constructed. By using least square method, the grey-scale images of PRPD were constructed and features of each grey-scale image were 28 box dimensions and 28 information dimensions. Affinity propagation algorithm based on manifold distance (AP-MD) for transformers PD pattern recognition was established, and the data of box dimension and information dimension were clustered based on AP-MD. Study shows that clustering result of AP-MD is better than the results of affinity propagation (AP), k-means and fuzzy c-means algorithm (FCM). By choosing different k values of k-nearest neighbor, we find clustering accuracy of AP-MD falls when k value is larger or smaller, and the optimal k value depends on sample size.
Directory of Open Access Journals (Sweden)
Jin Wang
2014-08-01
Full Text Available Traffic patterns in wireless sensor networks (WSNs usually follow a many-to-one model. Sensor nodes close to static sinks will deplete their limited energy more rapidly than other sensors, since they will have more data to forward during multihop transmission. This will cause network partition, isolated nodes and much shortened network lifetime. Thus, how to balance energy consumption for sensor nodes is an important research issue. In recent years, exploiting sink mobility technology in WSNs has attracted much research attention because it can not only improve energy efficiency, but prolong network lifetime. In this paper, we propose an energy efficient distance-aware routing algorithm with multiple mobile sink for WSNs, where sink nodes will move with a certain speed along the network boundary to collect monitored data. We study the influence of multiple mobile sink nodes on energy consumption and network lifetime, and we mainly focus on the selection of mobile sink node number and the selection of parking positions, as well as their impact on performance metrics above. We can see that both mobile sink node number and the selection of parking position have important influence on network performance. Simulation results show that our proposed routing algorithm has better performance than traditional routing ones in terms of energy consumption.
Time coordination of heterogeneous distance protections using a domain specific language
Marcin Kowalski; Jan Magott
2012-01-01
BACKGROUND: Distance protections are widely used in protection of energy transmission lines, but their time coordination is still an important and difficult problem. Inappropriate configuration leads to a hazard event: remote circuit breaker tripping provided the local circuit breaker can be opened, which severely impairs power system operation.OBJECTIVE: To describe a method and provide software tools to alleviate the hazard in power systems.METHODS: A domain specific language (DSL) for repr...
Directory of Open Access Journals (Sweden)
Emil Bartosiewicz
2014-03-01
Full Text Available The paper presents a short review of pilot schemes which are available in modern line distance protection relays, and example results of common pilot scheme tests with the testing methods description. Some differences in implementations of selected pilot schemes have been shown for comparison reasons. Distance protection coordination functions have been tested for GE Multilin UR series devices. Every type of available pilot scheme has been checked in synthetic tests and during the real coordination between D60 and D90Plus devices. For the POTT scheme, coordination between two L90 protections has been carried out by a sort of available different data communication link types, for comparison reasons too.
Distance protection of multiple-circuit shared tower transmission lines with different voltages
DEFF Research Database (Denmark)
Silva, Filipe Miguel Faria da; Bak, Claus Leth
2017-01-01
Multiple-circuit transmission lines combining different voltage levels in one tower present extra challenges when setting a protection philosophy, as faults between voltage levels are possible. This study presents a detailed theoretical analysis of such combined faults, including the development...... of a formula for estimating the magnitude of the short-circuit current. It is demonstrated that if the faulted phase from the higher voltage level leads the faulted phase from the lower voltage level, a distance relay at the higher voltage level sees the fault in the forward direction, whereas a distance relay...
Williams, Lynn; Rasmussen, Susan; Kleczkowski, Adam; Maharaj, Savi; Cairns, Nicole
2015-01-01
Epidemics of respiratory infectious disease remain one of the most serious health risks facing the population. Non-pharmaceutical interventions (e.g. hand-washing or wearing face masks) can have a significant impact on the course of an infectious disease epidemic. The current study investigated whether protection motivation theory (PMT) is a useful framework for understanding social distancing behaviour (i.e. the tendency to reduce social contacts) in response to a simulated infectious disease epidemic. There were 230 participants (109 males, 121 females, mean age 32.4 years) from the general population who completed self-report measures assessing the components of PMT. In addition, participants completed a computer game which simulated an infectious disease epidemic in order to provide a measure of social distancing behaviour. The regression analyses revealed that none of the PMT variables were significant predictors of social distancing behaviour during the simulation task. However, fear (β = .218, p < .001), response efficacy (β = .175, p < .01) and self-efficacy (β = .251, p < .001) were all significant predictors of intention to engage in social distancing behaviour. Overall, the PMT variables (and demographic factors) explain 21.2% of the variance in intention. The findings demonstrated that PMT was a useful framework for understanding intention to engage in social distancing behaviour, but not actual behaviour during the simulated epidemic. These findings may reflect an intention-behaviour gap in relation to social distancing behaviour.
Distance and protective barrier effects on the composite resin degree of conversion
Coutinho, Margareth; Trevizam, Natália Carvalho; Takayassu, Renata Nakase; Leme, Ariene Arcas; Soares, Giulliana Panfiglio
2013-01-01
Context: The food wrap films are used to cover the tip of curing light units in order to avoid contamination and prevent damage to the light guide. However, their effects on resin polymerization are not fully known. Aims: We investigated the effects on restoration efficiency of a food wrap protective barrier used on the tip of curing light units. Materials and Methods: For each treatment, five replications were performed, a total of 60 bovine incisor. The degree of conversion (%DC) of restorations with the composite resin Opallis EA2 was evaluated using 3 curing light devices (Optilux 501, Optilight and Ultra LED) and 2 curing distances (0 and 5 mm). The composite resin was tested for restoration of cavities in bovine crowns. %DC values were measured by the Fourier transform infrared spectroscopy-attenuated total reflectance technique. Statistical Analysis Used: The data were analyzed using 3-way ANOVA and Tukey's test. Results: Use of the protective film lowered %DC (F = 4.13; P = 0.05), and the effects of curing distance were associated to the curing light device (F = 3.61; P = 0.03). Conclusions: The distance from the light curing tip and use of a translucent protective barrier on the light-cure device can both impair composite resin %DC. PMID:24015001
A relation between irreversibility and unlinkability for biometric template protection algorithms
井沼, 学
2014-01-01
For biometric recognition systems, privacy protection of enrolled users’ biometric information, which are called biometric templates, is a critical problem. Recently, various template protection algorithms have been proposed and many related previous works have discussed security notions to evaluate the protection performance of these protection algorithms. Irreversibility and unlinkability are important security notions discussed in many related previous works. In this paper, we prove that u...
Chen, R C; Rigon, L; Longo, R
2013-03-25
Phase retrieval is a technique for extracting quantitative phase information from X-ray propagation-based phase-contrast tomography (PPCT). In this paper, the performance of different single distance phase retrieval algorithms will be investigated. The algorithms are herein called phase-attenuation duality Born Algorithm (PAD-BA), phase-attenuation duality Rytov Algorithm (PAD-RA), phase-attenuation duality Modified Bronnikov Algorithm (PAD-MBA), phase-attenuation duality Paganin algorithm (PAD-PA) and phase-attenuation duality Wu Algorithm (PAD-WA), respectively. They are all based on phase-attenuation duality property and on weak absorption of the sample and they employ only a single distance PPCT data. In this paper, they are investigated via simulated noise-free PPCT data considering the fulfillment of PAD property and weakly absorbing conditions, and with experimental PPCT data of a mixture sample containing absorbing and weakly absorbing materials, and of a polymer sample considering different degrees of statistical and structural noise. The simulation shows all algorithms can quantitatively reconstruct the 3D refractive index of a quasi-homogeneous weakly absorbing object from noise-free PPCT data. When the weakly absorbing condition is violated, the PAD-RA and PAD-PA/WA obtain better result than PAD-BA and PAD-MBA that are shown in both simulation and mixture sample results. When considering the statistical noise, the contrast-to-noise ratio values decreases as the photon number is reduced. The structural noise study shows that the result is progressively corrupted by ring-like artifacts with the increase of structural noise (i.e. phantom thickness). The PAD-RA and PAD-PA/WA gain better density resolution than the PAD-BA and PAD-MBA in both statistical and structural noise study.
Polynomial-time Algorithms for Computing Distances of Fuzzy Transition Systems
Chen, Taolue; Han, Tingting; Cao, Yongzhi
2017-01-01
Behaviour distances to measure the resemblance of two states in a (nondeterministic) fuzzy transition system have been proposed recently in the literature. Such a distance, defined as a pseudo-ultrametric over the state space of the model, provides a quantitative analogue of bisimilarity. In this paper, we focus on the problem of computing these distances. We first extend the definition of the pseudo-ultrametric by introducing discount such that the discounting factor being equal to 1 capture...
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
Lan, G.; Jiang, J.; Li, D. D.; Yi, W. S.; Zhao, Z.; Nie, L. N.
2013-12-01
The calculation of water-hammer pressure phenomenon of single-phase liquid is already more mature for a pipeline of uniform characteristics, but less research has addressed the calculation of slurry water hammer pressure in complex pipelines with slurry flows carrying solid particles. In this paper, based on the developments of slurry pipelines at home and abroad, the fundamental principle and method of numerical simulation of transient processes are presented, and several boundary conditions are given. Through the numerical simulation and analysis of transient processes of a practical engineering of long-distance slurry transportation pipeline system, effective protection measures and operating suggestions are presented. A model for calculating the water impact of solid and fluid phases is established based on a practical engineering of long-distance slurry pipeline transportation system. After performing a numerical simulation of the transient process, analyzing and comparing the results, effective protection measures and operating advice are recommended, which has guiding significance to the design and operating management of practical engineering of longdistance slurry pipeline transportation system.
International Nuclear Information System (INIS)
Lan, G; Jiang, J; Li, D D; Yi, W S; Zhao, Z; Nie, L N
2013-01-01
The calculation of water-hammer pressure phenomenon of single-phase liquid is already more mature for a pipeline of uniform characteristics, but less research has addressed the calculation of slurry water hammer pressure in complex pipelines with slurry flows carrying solid particles. In this paper, based on the developments of slurry pipelines at home and abroad, the fundamental principle and method of numerical simulation of transient processes are presented, and several boundary conditions are given. Through the numerical simulation and analysis of transient processes of a practical engineering of long-distance slurry transportation pipeline system, effective protection measures and operating suggestions are presented. A model for calculating the water impact of solid and fluid phases is established based on a practical engineering of long-distance slurry pipeline transportation system. After performing a numerical simulation of the transient process, analyzing and comparing the results, effective protection measures and operating advice are recommended, which has guiding significance to the design and operating management of practical engineering of longdistance slurry pipeline transportation system
Algorithm for protecting light-trees in survivable mesh wavelength-division-multiplexing networks
Luo, Hongbin; Li, Lemin; Yu, Hongfang
2006-12-01
Wavelength-division-multiplexing (WDM) technology is expected to facilitate bandwidth-intensive multicast applications such as high-definition television. A single fiber cut in a WDM mesh network, however, can disrupt the dissemination of information to several destinations on a light-tree based multicast session. Thus it is imperative to protect multicast sessions by reserving redundant resources. We propose a novel and efficient algorithm for protecting light-trees in survivable WDM mesh networks. The algorithm is called segment-based protection with sister node first (SSNF), whose basic idea is to protect a light-tree using a set of backup segments with a higher priority to protect the segments from a branch point to its children (sister nodes). The SSNF algorithm differs from the segment protection scheme proposed in the literature in how the segments are identified and protected. Our objective is to minimize the network resources used for protecting each primary light-tree such that the blocking probability can be minimized. To verify the effectiveness of the SSNF algorithm, we conduct extensive simulation experiments. The simulation results demonstrate that the SSNF algorithm outperforms existing algorithms for the same problem.
Sivov, Oleg Viktorovich
Series compensated lines are protected from overvoltage by metal-oxide-varistors (MOVs) connected in parallel with the capacitor bank. The nonlinear characteristics of MOV devices add complexity to fault analysis and distance protection operation. During faults, the impedance of the line is modified by an equivalent impedance of the parallel MOV/capacitor circuit, which affects the distance protection. The intermittent wind generation introduces additional complexity to the system performance and distance protection. Wind variation affects the fault current level and equivalent MOV/capacitor impedance during a fault, and hence the distance relay operation. This thesis studies the impact of the intermittent wind power generation on the operation of MOV during faults. For the purpose of simulation, an equivalent wind farm model is proposed to generate a wind generation profile using wind farm generation from California independent system operator (ISO) as a guide for wind power variation to perform the study. The IEEE 12-bus test system is modified to include MOV-protected series capacitor and the equivalent wind farm model. The modified test system is simulated in the MATLAB/Simulink environment. The study has been achieved considering three phase and single line to ground (SLG) faults on the series compensated line to show the effect of wind variation on the MOV operation. This thesis proposes an adaptive setting method for the mho relay distance protection of series compensated line considering effects of wind power variation and MOV operation. The distributed parameters of a transmission line are taken into account to avoid overreaching and underreaching of distance relays. The study shows that variable wind power affects system power flow and fault current in the compensated line during a fault which affects the operation of MOVs for different fault conditions. The equivalent per-phase impedance of the MOV/capacitor circuit has an effect on the system operation
International Nuclear Information System (INIS)
Saari, J.
1989-12-01
The paper describes procedures for automatic location of local events by using single-site, three-component (3c) seismogram records. Epicentral distance is determined from the time difference between P- and S-onsets. For onset time estimates a special phase picker algorithm is introduced. Onset detection is accomplished by comparing short-term average with long-term average after multiplication of north, east and vertical components of recording. For epicentral distances up to 100 km, errors seldom exceed 5 km. The slowness vector, essentially the azimuth, is estimated independently by using the Christoffersson et al. (1988) 'polarization' technique, although a priori knowledge of the P-onset time gives the best results. Differences between 'true' and observed azimuths are generally less than 12 deg C. Practical examples are given by demonstrating the viability of the procedures for automated 3c seismogram analysis. The results obtained compare favourably with those achieved by a miniarray of three stations. (orig.)
Directory of Open Access Journals (Sweden)
Balajee Maram K.
2016-02-01
Full Text Available Data security is a major issue because of rapid evolution of data communication over unsecured internetwork. Here the proposed system is concerned with the problem of randomly generated S-box. The generation of S-box depends on Pseudo-Random-Number-Generators and shared-secret-key. The process of Pseudo-Random-Number-Generator depends on large prime numbers. All Pseudo-Random-Numbers are scrambled according to shared-secret-key. After scrambling, the S-box is generated. In this research, large prime numbers are the inputs to the Pseudo-Random-Number-Generator. The proposed S-box will reduce the complexity of S-box generation. Based on S-box parameters, it experimentally investigates the quality and robustness of the proposed algorithm which was tested. It yields better results with the S-box parameters like Hamming Distance, Balanced Output and Avalanche Effect and can be embedded to popular cryptography algorithms
Chawla, Viveak Kumar; Chanda, Arindam Kumar; Angra, Surjit
2018-03-01
The flexible manufacturing system (FMS) constitute of several programmable production work centers, material handling systems (MHSs), assembly stations and automatic storage and retrieval systems. In FMS, the automatic guided vehicles (AGVs) play a vital role in material handling operations and enhance the performance of the FMS in its overall operations. To achieve low makespan and high throughput yield in the FMS operations, it is highly imperative to integrate the production work centers schedules with the AGVs schedules. The Production schedule for work centers is generated by application of the Giffler and Thompson algorithm under four kind of priority hybrid dispatching rules. Then the clonal selection algorithm (CSA) is applied for the simultaneous scheduling to reduce backtracking as well as distance travel of AGVs within the FMS facility. The proposed procedure is computationally tested on the benchmark FMS configuration from the literature and findings from the investigations clearly indicates that the CSA yields best results in comparison of other applied methods from the literature.
Cathodic Protection Design Algorithms for Refineries Aboveground Storage Tanks
Directory of Open Access Journals (Sweden)
Kosay Abdul sattar Majbor
2017-12-01
Full Text Available Storage tanks condition and integrity is maintained by joint application of coating and cathodic protection. Iraq southern region rich in oil and petroleum product refineries need and use plenty of aboveground storage tanks. Iraq went through conflicts over the past thirty five years resulting in holding the oil industry infrastructure behind regarding maintenance and modernization. The primary concern in this work is the design and implementation of cathodic protection systems for the aboveground storage tanks farm in the oil industry. Storage tank external base area and tank internal surface area are to be protected against corrosion using impressed current and sacrificial anode cathodic protection systems. Interactive versatile computer programs are developed to provide the necessary system parameters data including the anode requirements, composition, rating, configuration, etc. Microsoft-Excel datasheet and Visual Basic.Net developed software were used throughout the study in the design of both cathodic protection systems. The case study considered in this work is the eleven aboveground storage tanks farm situated in al-Shauiba refinery in southern IRAQ. The designed cathodic protection systems are to be installed and monitored realistically in the near future. Both systems were designed for a life span of (15-30 years, and all their parameters were within the internationally accepted standards.
GPU-Based Cloud Service for Smith-Waterman Algorithm Using Frequency Distance Filtration Scheme
Directory of Open Access Journals (Sweden)
Sheng-Ta Lee
2013-01-01
Full Text Available As the conventional means of analyzing the similarity between a query sequence and database sequences, the Smith-Waterman algorithm is feasible for a database search owing to its high sensitivity. However, this algorithm is still quite time consuming. CUDA programming can improve computations efficiently by using the computational power of massive computing hardware as graphics processing units (GPUs. This work presents a novel Smith-Waterman algorithm with a frequency-based filtration method on GPUs rather than merely accelerating the comparisons yet expending computational resources to handle such unnecessary comparisons. A user friendly interface is also designed for potential cloud server applications with GPUs. Additionally, two data sets, H1N1 protein sequences (query sequence set and human protein database (database set, are selected, followed by a comparison of CUDA-SW and CUDA-SW with the filtration method, referred to herein as CUDA-SWf. Experimental results indicate that reducing unnecessary sequence alignments can improve the computational time by up to 41%. Importantly, by using CUDA-SWf as a cloud service, this application can be accessed from any computing environment of a device with an Internet connection without time constraints.
GPU-based cloud service for Smith-Waterman algorithm using frequency distance filtration scheme.
Lee, Sheng-Ta; Lin, Chun-Yuan; Hung, Che Lun
2013-01-01
As the conventional means of analyzing the similarity between a query sequence and database sequences, the Smith-Waterman algorithm is feasible for a database search owing to its high sensitivity. However, this algorithm is still quite time consuming. CUDA programming can improve computations efficiently by using the computational power of massive computing hardware as graphics processing units (GPUs). This work presents a novel Smith-Waterman algorithm with a frequency-based filtration method on GPUs rather than merely accelerating the comparisons yet expending computational resources to handle such unnecessary comparisons. A user friendly interface is also designed for potential cloud server applications with GPUs. Additionally, two data sets, H1N1 protein sequences (query sequence set) and human protein database (database set), are selected, followed by a comparison of CUDA-SW and CUDA-SW with the filtration method, referred to herein as CUDA-SWf. Experimental results indicate that reducing unnecessary sequence alignments can improve the computational time by up to 41%. Importantly, by using CUDA-SWf as a cloud service, this application can be accessed from any computing environment of a device with an Internet connection without time constraints.
Energy Technology Data Exchange (ETDEWEB)
Piovesan, Luis Sergio
1997-07-01
The appliance of two algorithms is evaluated, one based in Fourier analysis and other based in a rectangular transform technique over Fourier analysis, to be used in digital logical circuits (digital protection relays) for the purpose of differential protection of power transformers (ANSI 87T). The first chapter has a brief introduction about electrical protection. The second chapter discusses the general problems of transform protection, the development of digital technology and, with more detail, the differential protection associated to this technology. In this chapter are presented the particular aspects of transformers differential protection concerning sensibility, inrush current situations and harmonic distortions caused by transformer core saturations and the differential protection algorithms and their applications in a specific relay design. In chapter three, a method to make possible testing the protection performance is developed. This work applies digital simulations using EMTP to generate current signal of transformer operation and fault conditions. Digital simulation using Matlab is used to simulate the protection. The EMTP generated field signals are sent to the relay under test, furnishing data of normal operation, internal and external faults. The relay logic simulator at Matlab will work this data and so, it will be possible to verify and evaluate the algorithm behavior and performance. Chapter 4 shows the protection operation over simulations of several of transformer operation and fault conditions. The last chapter presents a conclusion about the protection performance, discussions about all the methods applied in this work and suggestions for further studies. (author)
Han, Kuk-Il; Kim, Do-Hwi; Choi, Jun-Hyuk; Kim, Tae-Kuk
2018-04-20
Treatments for detection by infrared (IR) signals are higher than for other signals such as radar or sonar because an object detected by the IR sensor cannot easily recognize its detection status. Recently, research for actively reducing IR signal has been conducted to control the IR signal by adjusting the surface temperature of the object. In this paper, we propose an active IR stealth algorithm to synchronize IR signals from the object and the background around the object. The proposed method includes the repulsive particle swarm optimization statistical optimization algorithm to estimate the IR stealth surface temperature, which will result in a synchronization between the IR signals from the object and the surrounding background by setting the inverse distance weighted contrast radiant intensity (CRI) equal to zero. We tested the IR stealth performance in mid wavelength infrared (MWIR) and long wavelength infrared (LWIR) bands for a test plate located at three different positions on a forest scene to verify the proposed method. Our results show that the inverse distance weighted active IR stealth technique proposed in this study is proved to be an effective method for reducing the contrast radiant intensity between the object and background up to 32% as compared to the previous method using the CRI determined as the simple signal difference between the object and the background.
Directory of Open Access Journals (Sweden)
Mohamed ZELLAGUI
2012-11-01
Full Text Available This paper presents a study on the performances of distance relays setting in 400 kV in Eastern Algerian transmission networks at Sonelgaz Group (Algerian company of Electrical and Gas compensated by shunt Flexible AC Transmission System (FACTS. The facts are used for controlling transmission voltage, power flow, reactive power, and damping of power system oscillations in high power transfer levels. The effects of SVC devices i.e. Thyristor Controlled Reactor (TCR and the Thyristor Switched Capacitors (TSC insertion, on the total impedance of a transmission line protected by MHO distance relay are investigated. The modified setting zones protections for three forward zones (Z1, Z2 and Z3 have been calculated in order to improve the performances of distance relay protection and prevent circuit breaker nuisance tripping.
DEFF Research Database (Denmark)
Bak, Claus Leth; Silva, Filipe Miguel Faria da
2018-01-01
Combined faults occurring between different voltage levels in overhead lines present a challenge for distance protection. Previous work has shown that such faults most often appears as single phase to ground (SPTG) faults in a normal type of overhead line. However, it is not obvious that distance...... relays will identify and select the correct fault loop according to being similar to SPTG, as all six fault loops get excited when combined faults occur. This paper presents a study where two distance relays of different manufactures are tested using transient replay and secondary test equipment...
Fault Identification Algorithm Based on Zone-Division Wide Area Protection System
Directory of Open Access Journals (Sweden)
Xiaojun Liu
2014-04-01
Full Text Available As the power grid becomes more magnified and complicated, wide-area protection system in the practical engineering application is more and more restricted by the communication level. Based on the concept of limitedness of wide-area protection system, the grid with complex structure is divided orderly in this paper, and fault identification and protection action are executed in each divided zone to reduce the pressure of the communication system. In protection zone, a new wide-area protection algorithm based on positive sequence fault components directional comparison principle is proposed. The special associated intelligent electronic devices (IEDs zones which contain buses and transmission lines are created according to the installation location of the IEDs. When a fault occurs, with the help of the fault information collecting and sharing from associated zones with the fault discrimination principle defined in this paper, the IEDs can identify the fault location and remove the fault according to the predetermined action strategy. The algorithm will not be impacted by the load changes and transition resistance and also has good adaptability in open phase running power system. It can be used as a main protection, and it also can be taken into account for the back-up protection function. The results of cases study show that, the division method of the wide-area protection system and the proposed algorithm are effective.
International Nuclear Information System (INIS)
Beckers, Mischa L.M.; Buydens, Lutgarde M.C.; Pikkemaat, Jeroen A.; Altona, Cornelis
1997-01-01
The three-dimensional spatial structure of a methylene-acetal-linked thymine dimer present in a 10 base-pair (bp) sense-antisense DNA duplex was studied with a genetic algorithm designed to interpret NOE distance restraints. Trial solutions were represented by torsion angles. This means that bond angles for the dimer trial structures are kept fixed during the genetic algorithm optimization. Bond angle values were extracted from a 10 bp sense-antisense duplex model that was subjected to energy minimization by means of a modified AMBER force field. A set of 63 proton-proton distance restraints defining the methylene-acetal-linked thymine dimer was available. The genetic algorithm minimizes the difference between distances in the trial structures and distance restraints. A large conformational search space could be covered in the genetic algorithm optimization by allowing a wide range of torsion angles. The genetic algorithm optimization in all cases led to one family of structures. This family of the methylene-acetal-linked thymine dimer in the duplex differs from the family that was suggested from distance geometry calculations. It is demonstrated that the bond angle geometry around the methylene-acetal linkage plays an important role in the optimization
International Nuclear Information System (INIS)
Koo, Bonseung; Hwang, Daehyun; Kim, Keungkoo
2014-01-01
A multi-purpose best-estimate simulator for SMART is being established, which is intended to be used as a tool to evaluate the impacts of design changes on the safety performance, and to improve and/or optimize the operating procedure of SMART. In keeping with these intentions, a real-time model of the digital core protection and monitoring systems was developed and the real-time performance of the models was verified for various simulation scenarios. In this paper, a performance test of the core protection and monitoring algorithm with a DLL file for the SMART simulator implementation was performed. A DLL file of the simulator application code was made and several real-time evaluation tests were conducted for the steady-state and transient conditions with simulated system variables. A performance test of the core protection and monitoring algorithms for the SMART simulator was performed. A DLL file of the simulator version code was made and several real-time evaluation tests were conducted for various scenarios with a DLL file and simulated system variables. The results of all test cases showed good agreement with the reference results and some features caused by algorithm change were properly reflected to the DLL results. Therefore, it was concluded that the SCOPS S SIM and SCOMS S SIM algorithms and calculational capabilities are appropriate for the core protection and monitoring program in the SMART simulator
Indian Academy of Sciences (India)
polynomial) division have been found in Vedic Mathematics which are dated much before Euclid's algorithm. A programming language Is used to describe an algorithm for execution on a computer. An algorithm expressed using a programming.
Duque, Á.; Phillips, J.F.; von Hildebrand, P.; Posada, C.A.; Prieto, A.; Rudas, A.; Suescún, M.; Stevenson, P.
2009-01-01
In this study, we investigated the pattern of floristic similarity as a function of geographical distances and environmental variability in well-drained uplands (terra firme) in Colombian Amazonia. The study site comprised three National Natural Parks, Tinigua, Chiribiquete, and Amacayacu, located
International Nuclear Information System (INIS)
Brown, D.F.; Policastro, A.J.; Dunn, W.E.; Carhart, R.A.; Lazaro, M.A.; Freeman, W.A.; Krumpolc, M.
2001-01-01
This report provides technical documentation for values in the Table of Initial Isolation and Protective Action Distances (PADs) in the ''2000 Emergency Response Guidebook'' (2000ERG). The objective for choosing the PADs specified in the 2000ERG was to balance the need to adequately protect the public from exposure to potentially harmful substances against the risks and expenses that could result from overreacting to a spill. To quantify this balance, a statistical approach was adopted, whereby the best available information was used to conduct an accident scenario analysis and develop a set of up to 100,000 hypothetical incidents. The set accounted for differences in the types of containers, types of incidents, severities of accidents (i.e., amounts released), locations, times of day, times of year, and meteorological conditions involved. Each scenario was analyzed by using detailed emission rate and atmospheric dispersion models to calculate the downwind chemical concentrations. The safe distance for each incident, defined as the distance downwind from the source at which the chemical concentration falls below the health criteria, was determined. The health criteria used were the American Industrial Hygiene Association's Emergency Response Planning Guideline Level 2 (ERPG-2) or equivalent criteria. The statistical sample of safe distance values for all incidents considered in the analysis was separated into four categories: small spill/daytime release, small spill/nighttime release, large spill/daytime release; and large spill/nighttime release. The 90-percentile safe distance values for each of these groups became the PADs that appear in the 2000ERG table
Optimization of redundancy by using genetic algorithm for reliability of plant protection system
International Nuclear Information System (INIS)
Yoo, D. W.; Seong, S. H.; Kim, D. H.; Park, H. Y.; Gu, I. S.
2000-01-01
The design and development of a reliable protection system has been becoming a key issue in industry field because the reliability of system is considered as an important factor to perform the system's function successfully. Plant Protection System(PPS) guarantees the safety of plant by accident detection and control action against the transient conditions of plant. This paper presents the analysis of PPS reliability and the formal problem statement about optimal redundancy based on the reliability of PPS. And the optimization problem is solved by genetic algorithm. The genetic algorithm is a useful tool to solve the problems, in the case of large searching, complex gradient, existence local minimum. The effectiveness of the proposed optimization technique is proved by the target reliability of one channel of PPS, using the failure rate based on the MIL-HDBK-217
Energy Technology Data Exchange (ETDEWEB)
Trujillo-Guajardo, L.A.; Conde-Enriquez, A. [Universidad Autonoma de Nuevo Leon, Nuevo Leon (Mexico)]. E-mail: luistrujillo84@gmail.com; con_de@yahoo.com
2012-04-15
In this article, a graphical software tool is presented; this tool is based on the education of protection system engineers. The theoretical fundaments used for the design of operation characteristics of distance relays and their algorithms are presented. The software allows the evaluation and analysis of real time events or simulated ones of every stage of design of the distance relay. Some example cases are presented to illustrate the activities that could be done with the graphical software tool developed. [Spanish] En este articulo se presenta una herramienta computacional grafica para apoyar la formacion de ingenieros en protecciones electricas. Los fundamentos teoricos para el diseno de caracteristicas de operacion de relevadores de distancia, asi como las rutinas de programacion de un relevador de distancia son presentados. La herramienta desarrollada permite la evaluacion de las etapas de diseno de relevadores y el analisis de la operacion ante eventos reales o simulados. Se presentan algunos casos de ejemplo para ilustrar las actividades didacticas que son posibles de realizar con la herramienta presentada.
Distance protection of multiple-circuit shared tower transmission lines with different voltages
DEFF Research Database (Denmark)
Silva, Filipe Miguel Faria da; Bak, Claus Leth
2017-01-01
combined faults, being advised to increase the resistive limit of the protection zone, if the network has lower short-circuit power. It is recommended to assure that the fault can only happen for cases where the faulted phase from the higher voltage level leads the faulted phase from the lower voltage......Multiple-circuit transmission lines combining different voltage levels in one tower present extra challenges when setting a protection philosophy, as faults between voltage levels are possible. In this study, the fault loop impedance of combined faults is compared with the fault loop impedance......-phase-to-ground faults. It is also demonstrated that the fault loop impedance of combined faults is more resistive, when compared with equivalent single-phase-to-ground faults. It is concluded that the settings used to protect a line against single-phase-to-ground faults are capable of protecting the line against...
Indian Academy of Sciences (India)
to as 'divide-and-conquer'. Although there has been a large effort in realizing efficient algorithms, there are not many universally accepted algorithm design paradigms. In this article, we illustrate algorithm design techniques such as balancing, greedy strategy, dynamic programming strategy, and backtracking or traversal of ...
Yang, Guo Sheng; Wang, Xiao Yang; Li, Xue Dong
2018-03-01
With the establishment of the integrated model of relay protection and the scale of the power system expanding, the global setting and optimization of relay protection is an extremely difficult task. This paper presents a kind of application in relay protection of global optimization improved particle swarm optimization algorithm and the inverse time current protection as an example, selecting reliability of the relay protection, selectivity, quick action and flexibility as the four requires to establish the optimization targets, and optimizing protection setting values of the whole system. Finally, in the case of actual power system, the optimized setting value results of the proposed method in this paper are compared with the particle swarm algorithm. The results show that the improved quantum particle swarm optimization algorithm has strong search ability, good robustness, and it is suitable for optimizing setting value in the relay protection of the whole power system.
A Genetic Algorithms-based Approach for Optimized Self-protection in a Pervasive Service Middleware
DEFF Research Database (Denmark)
Zhang, Weishan; Ingstrup, Mads; Hansen, Klaus Marius
2009-01-01
With increasingly complex and heterogeneous systems in pervasive service computing, it becomes more and more important to provide self-protected services to end users. In order to achieve self-protection, the corresponding security should be provided in an optimized manner considering...... the constraints of heterogeneous devices and networks. In this paper, we present a Genetic Algorithms-based approach for obtaining optimized security configurations at run time, supported by a set of security OWL ontologies and an event-driven framework. This approach has been realized as a prototype for self-protection...... in the Hydra middleware, and is integrated with a framework for enforcing the computed solution at run time using security obligations. The experiments with the prototype on configuring security strategies for a pervasive service middleware show that this approach has acceptable performance, and could be used...
An automatic, stagnation point based algorithm for the delineation of Wellhead Protection Areas
Tosco, Tiziana; Sethi, Rajandrea; di Molfetta, Antonio
2008-07-01
Time-related capture areas are usually delineated using the backward particle tracking method, releasing circles of equally spaced particles around each well. In this way, an accurate delineation often requires both a very high number of particles and a manual capture zone encirclement. The aim of this work was to propose an Automatic Protection Area (APA) delineation algorithm, which can be coupled with any model of flow and particle tracking. The computational time is here reduced, thanks to the use of a limited number of nonequally spaced particles. The particle starting positions are determined coupling forward particle tracking from the stagnation point, and backward particle tracking from the pumping well. The pathlines are postprocessed for a completely automatic delineation of closed perimeters of time-related capture zones. The APA algorithm was tested for a two-dimensional geometry, in homogeneous and nonhomogeneous aquifers, steady state flow conditions, single and multiple wells. Results show that the APA algorithm is robust and able to automatically and accurately reconstruct protection areas with a very small number of particles, also in complex scenarios.
Application of protective distances in vicinity of dangerous facilities in urban and spatial plans
Directory of Open Access Journals (Sweden)
Stojanović Božidar
2006-01-01
Full Text Available Environmental risk management in production, use and transportation of dangerous materials having been actual theme in the world and in Serbia. Although environmental risk is mostly connected with technical issues, since chemical catastrophe in Bophal-lndia (1986 in the world was recognized that this is complex issue that besides of technical-technological, includes also social-economic, organizational and spatial factors. Spatial component of risk management which is regulated by Seveso II Directive in EU is important for planners. This paper considers basic elements of environmental risk assessment, procedures and methods used in Europe, particularly in the process of land use planning, and characteristics of method for application of separation distances used in General plan of Belgrade.
International Nuclear Information System (INIS)
Marco, M.; Rodriguez, M.; Hernando, E.; Falcon, S.; Rodriguez, M.; Villarroel, R.
2003-01-01
Radiation Protection Training (RPT) System in Spain are is well defined in the local local regulations related to radioactive facilities licensing and radiation protection. A system of personnel licenses is established considering two levels of required radiation protection training-supervisor and operator according to responsibilities assigned during the operation of the radioactive facilities. This paper present the major advances already done in the educational web site maintained on the CIEMAT server and accessible through the CSN web. The project includes training material for sixteen applied courses and the design of a educational web site to hold pedagogical material for developing distant learning courses. The main objective of this project is to provide training materials for course organisers, trainers and for professional participants and to promote the exchange of expertise between workers involved in all activities using radiation sources. The project also aims to provide necessary mechanism for standardisation of the radiation protection knowledge made available to the exposed workers, including theoretical and practical training. The developed training material included in the project will cover all uses of radioactive sources including medical diagnosis. The web site is being developed of provide educational material on a modular design and in Spanish. The paper presents the initial results of this useful tool for practitioners. Courses are based on core modules with basic and specific modules involving different targets groups, and the contents can be easily adapted for other target groups. For each one of the modules should be included in the web site: objectives, syllabus, lessons and practical sessions, demo and lab exercises, etc. The project includes training tools for sixteen courses based in the standard syllabus content in the Spanish legal framework. In the next future complete materials for trainers will be available to case courses
Moreau, Nancy
2008-01-01
This article discusses the impact of patents for computer algorithms in course management systems. Referring to historical documents and court cases, the positive and negative aspects of software patents are presented. The key argument is the accessibility to algorithms comprising a course management software program such as Blackboard. The…
Limongelli, Carla; Sciarrone, Filippo; Temperini, Marco; Vaste, Giulia
2011-01-01
LS-Lab provides automatic support to comparison/evaluation of the Learning Object Sequences produced by different Curriculum Sequencing Algorithms. Through this framework a teacher can verify the correspondence between the behaviour of different sequencing algorithms and her pedagogical preferences. In fact the teacher can compare algorithms…
Bouserhal, Rachel E.; Bockstael, Annelies; MacDonald, Ewen; Falk, Tiago H.; Voix, Jérémie
2017-01-01
Purpose: Studying the variations in speech levels with changing background noise level and talker-to-listener distance for talkers wearing hearing protection devices (HPDs) can aid in understanding communication in background noise. Method: Speech was recorded using an intra-aural HPD from 12 different talkers at 5 different distances in 3…
Indian Academy of Sciences (India)
ticians but also forms the foundation of computer science. Two ... with methods of developing algorithms for solving a variety of problems but ... applications of computers in science and engineer- ... numerical calculus are as important. We will ...
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.
Fast Algorithms for Earth Mover’s Distance Based on Optimal Transport and L1 Type Regularization I
2016-09-01
problem. Numerische Mathematik 84(3): 375–393, 2000. [4] Antonin Chambolle and Thomas Pock. A first-order primal-dual algorithm for convex problems with...Conference on Computer Vision, 460–467, 2009. [13] Thomas Pock and Antonin Chambolle. Diagonal preconditioning for first order primal-dual algorithms in convex... Calculus of Variations and Partial Differential Equations, 36 (3): 343–354, 2009, [18] Sameer Shirdhonkar and David Jacobs. Approximate earth movers
Ghinita, Gabriel; Kalnis, Panos; Kantarcioǧlu, Murâ t; Bertino, Elisa
2010-01-01
Mobile devices with global positioning capabilities allow users to retrieve points of interest (POI) in their proximity. To protect user privacy, it is important not to disclose exact user coordinates to un-trusted entities that provide location-based services. Currently, there are two main approaches to protect the location privacy of users: (i) hiding locations inside cloaking regions (CRs) and (ii) encrypting location data using private information retrieval (PIR) protocols. Previous work focused on finding good trade-offs between privacy and performance of user protection techniques, but disregarded the important issue of protecting the POI dataset D. For instance, location cloaking requires large-sized CRs, leading to excessive disclosure of POIs (O({pipe}D{pipe}) in the worst case). PIR, on the other hand, reduces this bound to O(√{pipe}D{pipe}), but at the expense of high processing and communication overhead. We propose hybrid, two-step approaches for private location-based queries which provide protection for both the users and the database. In the first step, user locations are generalized to coarse-grained CRs which provide strong privacy. Next, a PIR protocol is applied with respect to the obtained query CR. To protect against excessive disclosure of POI locations, we devise two cryptographic protocols that privately evaluate whether a point is enclosed inside a rectangular region or a convex polygon. We also introduce algorithms to efficiently support PIR on dynamic POI sub-sets. We provide solutions for both approximate and exact NN queries. In the approximate case, our method discloses O(1) POI, orders of magnitude fewer than CR- or PIR-based techniques. For the exact case, we obtain optimal disclosure of a single POI, although with slightly higher computational overhead. Experimental results show that the hybrid approaches are scalable in practice, and outperform the pure-PIR approach in terms of computational and communication overhead. © 2010
Ghinita, Gabriel
2010-12-15
Mobile devices with global positioning capabilities allow users to retrieve points of interest (POI) in their proximity. To protect user privacy, it is important not to disclose exact user coordinates to un-trusted entities that provide location-based services. Currently, there are two main approaches to protect the location privacy of users: (i) hiding locations inside cloaking regions (CRs) and (ii) encrypting location data using private information retrieval (PIR) protocols. Previous work focused on finding good trade-offs between privacy and performance of user protection techniques, but disregarded the important issue of protecting the POI dataset D. For instance, location cloaking requires large-sized CRs, leading to excessive disclosure of POIs (O({pipe}D{pipe}) in the worst case). PIR, on the other hand, reduces this bound to O(√{pipe}D{pipe}), but at the expense of high processing and communication overhead. We propose hybrid, two-step approaches for private location-based queries which provide protection for both the users and the database. In the first step, user locations are generalized to coarse-grained CRs which provide strong privacy. Next, a PIR protocol is applied with respect to the obtained query CR. To protect against excessive disclosure of POI locations, we devise two cryptographic protocols that privately evaluate whether a point is enclosed inside a rectangular region or a convex polygon. We also introduce algorithms to efficiently support PIR on dynamic POI sub-sets. We provide solutions for both approximate and exact NN queries. In the approximate case, our method discloses O(1) POI, orders of magnitude fewer than CR- or PIR-based techniques. For the exact case, we obtain optimal disclosure of a single POI, although with slightly higher computational overhead. Experimental results show that the hybrid approaches are scalable in practice, and outperform the pure-PIR approach in terms of computational and communication overhead. © 2010
An improved PSO algorithm for generating protective SNP barcodes in breast cancer.
Directory of Open Access Journals (Sweden)
Li-Yeh Chuang
Full Text Available BACKGROUND: Possible single nucleotide polymorphism (SNP interactions in breast cancer are usually not investigated in genome-wide association studies. Previously, we proposed a particle swarm optimization (PSO method to compute these kinds of SNP interactions. However, this PSO does not guarantee to find the best result in every implement, especially when high-dimensional data is investigated for SNP-SNP interactions. METHODOLOGY/PRINCIPAL FINDINGS: In this study, we propose IPSO algorithm to improve the reliability of PSO for the identification of the best protective SNP barcodes (SNP combinations and genotypes with maximum difference between cases and controls associated with breast cancer. SNP barcodes containing different numbers of SNPs were computed. The top five SNP barcode results are retained for computing the next SNP barcode with a one-SNP-increase for each processing step. Based on the simulated data for 23 SNPs of six steroid hormone metabolisms and signalling-related genes, the performance of our proposed IPSO algorithm is evaluated. Among 23 SNPs, 13 SNPs displayed significant odds ratio (OR values (1.268 to 0.848; p<0.05 for breast cancer. Based on IPSO algorithm, the jointed effect in terms of SNP barcodes with two to seven SNPs show significantly decreasing OR values (0.84 to 0.57; p<0.05 to 0.001. Using PSO algorithm, two to four SNPs show significantly decreasing OR values (0.84 to 0.77; p<0.05 to 0.001. Based on the results of 20 simulations, medians of the maximum differences for each SNP barcode generated by IPSO are higher than by PSO. The interquartile ranges of the boxplot, as well as the upper and lower hinges for each n-SNP barcode (n = 3∼10 are more narrow in IPSO than in PSO, suggesting that IPSO is highly reliable for SNP barcode identification. CONCLUSIONS/SIGNIFICANCE: Overall, the proposed IPSO algorithm is robust to provide exact identification of the best protective SNP barcodes for breast cancer.
Indian Academy of Sciences (India)
algorithm design technique called 'divide-and-conquer'. One of ... Turtle graphics, September. 1996. 5. ... whole list named 'PO' is a pointer to the first element of the list; ..... Program for computing matrices X and Y and placing the result in C *).
Indian Academy of Sciences (India)
algorithm that it is implicitly understood that we know how to generate the next natural ..... Explicit comparisons are made in line (1) where maximum and minimum is ... It can be shown that the function T(n) = 3/2n -2 is the solution to the above ...
Morphological evolution of protective works by Genetic Algorithms: An application to Mt Etna
Marocco, Davide; Spataro, William; D'Ambrosio, Donato; Filippone, Giuseppe; Rongo, Rocco; Iovine, Giulio; Neri, Marco
2013-04-01
The hazard induced by dangerous flow-type phenomena - e.g. lava flows, earth flows, debris flows, and debris avalanches - has increased in recent years due to continuous urbanization. In many cases, the numerical simulation of hypothetical events can help to forecast the flow path in advance and therefore give indications about the areas that can be considered for the construction of protective works - e.g. earth barriers or channels. In this way, urbanized areas, as well as cultural heritage sites or even important infrastructures, can be protected by diverting the flow towards lower interest regions. Here, we have considered the numerical Cellular Automata model Sciara-fv2 for simulating lava flows at Mt Etna and Genetic Algorithms for optimizing the position, orientation and extension of an earth barrier built to protect the Rifugio Sapienza, a well-known touristic facility located near the summit of the volcano. The Rifugio Sapienza area was in fact interested by a lava flow in 2003, which destroyed a Service Center, a parking area and a Cafeteria. In this study, a perimeter was devised around the Rifugio (i.e., security perimeter), which delimitates the area that has to be protected by the flow. Furthermore, another perimeter was devised (i.e., work perimeter), specifying the area in which the earth barrier can be located. The barrier is specified by three parameters, namely the two geographic coordinates of the vertex and the height. In fact, in this preliminary analysis the barrier was modeled as a segment (in plant) having a constant height. Though preliminary, the study has produced extremely positive results. Among different alternatives generated by the genetic algorithm, an interesting scenario consists of a 35 meters barrier high solution, which completely deviates the flow avoiding that the lava reaches the inhabited area. The relative elevated height of the barrier is high due to the fact that the crater is located close to the area to be protected
Indian Academy of Sciences (India)
will become clear in the next article when we discuss a simple logo like programming language. ... Rod B may be used as an auxiliary store. The problem is to find an algorithm which performs this task. ... No disks are moved from A to Busing C as auxiliary rod. • move _disk (A, C);. (No + l)th disk is moved from A to C directly ...
Directory of Open Access Journals (Sweden)
Javier Marcello
2016-09-01
Full Text Available The precise mapping of vegetation covers in semi-arid areas is a complex task as this type of environment consists of sparse vegetation mainly composed of small shrubs. The launch of high resolution satellites, with additional spectral bands and the ability to alter the viewing angle, offers a useful technology to focus on this objective. In this context, atmospheric correction is a fundamental step in the pre-processing of such remote sensing imagery and, consequently, different algorithms have been developed for this purpose over the years. They are commonly categorized as imaged-based methods as well as in more advanced physical models based on the radiative transfer theory. Despite the relevance of this topic, a few comparative studies covering several methods have been carried out using high resolution data or which are specifically applied to vegetation covers. In this work, the performance of five representative atmospheric correction algorithms (DOS, QUAC, FLAASH, ATCOR and 6S has been assessed, using high resolution Worldview-2 imagery and field spectroradiometer data collected simultaneously, with the goal of identifying the most appropriate techniques. The study also included a detailed analysis of the parameterization influence on the final results of the correction, the aerosol model and its optical thickness being important parameters to be properly adjusted. The effects of corrections were studied in vegetation and soil sites belonging to different protected semi-arid ecosystems (high mountain and coastal areas. In summary, the superior performance of model-based algorithms, 6S in particular, has been demonstrated, achieving reflectance estimations very close to the in-situ measurements (RMSE of between 2% and 3%. Finally, an example of the importance of the atmospheric correction in the vegetation estimation in these natural areas is presented, allowing the robust mapping of species and the analysis of multitemporal variations
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...
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...
Alvarez, Diego A.; Hurtado, Jorge E.; Bedoya-Ruíz, Daniel Alveiro
2012-07-01
Despite technological advances in seismic instrumentation, the assessment of the intensity of an earthquake using an observational scale as given, for example, by the modified Mercalli intensity scale is highly useful for practical purposes. In order to link the qualitative numbers extracted from the acceleration record of an earthquake and other instrumental data such as peak ground velocity, epicentral distance, and moment magnitude on the one hand and the modified Mercalli intensity scale on the other, simple statistical regression has been generally employed. In this paper, we will employ three methods of nonlinear regression, namely support vector regression, multilayer perceptrons, and genetic programming in order to find a functional dependence between the instrumental records and the modified Mercalli intensity scale. The proposed methods predict the intensity of an earthquake while dealing with nonlinearity and the noise inherent to the data. The nonlinear regressions with good estimation results have been performed using the "Did You Feel It?" database of the US Geological Survey and the database of the Center for Engineering Strong Motion Data for the California region.
International Nuclear Information System (INIS)
Levitin, Gregory; Dai Yuanshun; Xie Min; Leng Poh, Kim
2003-01-01
In this paper we consider vulnerable systems which can have different states corresponding to different combinations of available elements composing the system. Each state can be characterized by a performance rate, which is the quantitative measure of a system's ability to perform its task. Both the impact of external factors (stress) and internal causes (failures) affect system survivability, which is determined as probability of meeting a given demand. In order to increase the survivability of the system, a multi-level protection is applied to its subsystems. This means that a subsystem and its inner level of protection are in their turn protected by the protection of an outer level. This double-protected subsystem has its outer protection and so forth. In such systems, the protected subsystems can be destroyed only if all of the levels of their protection are destroyed. Each level of protection can be destroyed only if all of the outer levels of protection are destroyed. We formulate the problem of finding the structure of series-parallel multi-state system (including choice of system elements, choice of structure of multi-level protection and choice of protection methods) in order to achieve a desired level of system survivability by the minimal cost. An algorithm based on the universal generating function method is used for determination of the system survivability. A multi-processor version of genetic algorithm is used as optimization tool in order to solve the structure optimization problem. An application example is presented to illustrate the procedure presented in this paper
Almas, Muhammad Shoaib; Vanfretti, Luigi
2017-01-01
Synchrophasor measurements from Phasor Measurement Units (PMUs) are the primary sensors used to deploy Wide-Area Monitoring, Protection and Control (WAMPAC) systems. PMUs stream out synchrophasor measurements through the IEEE C37.118.2 protocol using TCP/IP or UDP/IP. The proposed method establishes a direct communication between two PMUs, thus eliminating the requirement of an intermediate phasor data concentrator, data mediator and/or protocol parser and thereby ensuring minimum communication latency without considering communication link delays. This method allows utilizing synchrophasor measurements internally in a PMU to deploy custom protection and control algorithms. These algorithms are deployed using protection logic equations which are supported by all the PMU vendors. Moreover, this method reduces overall equipment cost as the algorithms execute internally in a PMU and therefore does not require any additional controller for their deployment. The proposed method can be utilized for fast prototyping of wide-area measurements based protection and control applications. The proposed method is tested by coupling commercial PMUs as Hardware-in-the-Loop (HIL) with Opal-RT's eMEGAsim Real-Time Simulator (RTS). As illustrative example, anti-islanding protection application is deployed using proposed method and its performance is assessed. The essential points in the method are: •Bypassing intermediate phasor data concentrator or protocol parsers as the synchrophasors are communicated directly between the PMUs (minimizes communication delays).•Wide Area Protection and Control Algorithm is deployed using logic equations in the client PMU, therefore eliminating the requirement for an external hardware controller (cost curtailment)•Effortless means to exploit PMU measurements in an environment familiar to protection engineers.
Is the S.O.S. diagnostic algorithm applicable to creating highly safe protective systems?
International Nuclear Information System (INIS)
Drab, F.
1994-01-01
The S.O.S. diagnostic system is analyzed and compared with KOMPARACE and MIN-MAX type diagnostic systems. Designed for the identification of failed sensors, the S.O.S. dynamic algorithm is based on a digital monitoring of output signals from a pair of sensors measuring the same technological parameter. The last 3 output signal data from the two sensors are stored in the algorithm memory. The analysis indicates that S.O.S. is no major achievement in the field of diagnosis because its properties are nearly identical with those of the conventional MIN-MAX system. Some degradation failures of the sensor are incorrectly interpreted by the new algorithm, some failures are not detected at all. From this point of view the new algorithm is inferior to the KOMPARACE type algorithm. (J.B.). 2 figs., 5 refs
Alali, Khaled; Casali, John G
2012-01-01
The purpose of this study was to assess normal hearing listeners' performance in detecting a stationary backup alarm signal and to quantify the linear distance at detection point. Detection distances for 12 participants with normal hearing were measured while they were fitted with 7 hearing protectors and while they were unoccluded (open ear). A standard (narrowband) backup alarm signal and a broadband (pulsed white noise) backup alarm signal from Brigade[1] were used. The method of limits, with distance as the physical measurement variable and threshold detection as the task, was employed to find at which distance the participant could first detect the backup alarms. A within-subject Analysis of Variance (ANOVA) revealed a significant main effect of the listening conditions on the detection distance in feet. Post hoc analyses indicated that the Bilsom L3HV conventional passive earmuff (at 1132.2 ft detection distance) was significantly poorer compared to all other HPDs and the open ear in detection distance achieved, and that there were no statistically-significant differences between the unoccluded ear (1652.3 ft), EB-15-Lo BlastPLGTM (1546.2 ft), EB-15-Hi BlastPLGTM (1543.4 ft), E-A-R/3M Combat ArmsTM earplug-nonlinear, level-dependent state (1507.8 ft), E-A-R/3M HiFiTM earplug (1497.7 ft), and Bilsom ImpactTM dichotic electronic earmuff (1567.2 ft). In addition, the E-A-R/3M Combat ArmsTM earplug-passive steady state resulted in significantly longer detection distances than only the open ear condition, at 1474.1 ft versus 1652.3 ft for the open ear. ANOVA also revealed a significant main effect of the backup alarm type on detection distance. The means were 1600.9 ft for the standard (narrowband) backup alarm signal, and a significantly closer 1379.4 ft was required for the Brigade broadband backup alarm signal. For on-ground workers, it is crucial to detect backup alarm signals as far away as possible rather than at close distances since this will provide them
Fault Identification Algorithm Based on Zone-Division Wide Area Protection System
Xiaojun Liu; Youcheng Wang; Hub Hu
2014-01-01
As the power grid becomes more magnified and complicated, wide-area protection system in the practical engineering application is more and more restricted by the communication level. Based on the concept of limitedness of wide-area protection system, the grid with complex structure is divided orderly in this paper, and fault identification and protection action are executed in each divided zone to reduce the pressure of the communication system. In protection zone, a new wide-area...
International Nuclear Information System (INIS)
Li, D D; Jiang, J; Zhao, Z; Yi, W S; Lan, G
2013-01-01
We take a concrete pumping station as an example in this paper. Through the calculation of water hammer protection with a specific pumping station water supply project, and the analysis of the principle, mathematical models and boundary conditions of air vessel and over-pressure relief valve we show that the air vessel can protect the water conveyance system and reduce the transient pressure damage due to various causes. Over-pressure relief valve can effectively reduce the water hammer because the water column re-bridge suddenly stops the pump and prevents pipeline burst. The paper indicates that the combination set of air vessel and over-pressure relief valve can greatly reduce the quantity of the air valve and can eliminate the water hammer phenomenon in the pipeline system due to the vaporization and water column separation and re-bridge. The conclusion could provide a reference for the water hammer protection of long-distance water supply system
Li, D. D.; Jiang, J.; Zhao, Z.; Yi, W. S.; Lan, G.
2013-12-01
We take a concrete pumping station as an example in this paper. Through the calculation of water hammer protection with a specific pumping station water supply project, and the analysis of the principle, mathematical models and boundary conditions of air vessel and over-pressure relief valve we show that the air vessel can protect the water conveyance system and reduce the transient pressure damage due to various causes. Over-pressure relief valve can effectively reduce the water hammer because the water column re-bridge suddenly stops the pump and prevents pipeline burst. The paper indicates that the combination set of air vessel and over-pressure relief valve can greatly reduce the quantity of the air valve and can eliminate the water hammer phenomenon in the pipeline system due to the vaporization and water column separation and re-bridge. The conclusion could provide a reference for the water hammer protection of long-distance water supply system.
Johnsen, Jacob; Pryds, Kasper; Salman, Rasha; Løfgren, Bo; Kristiansen, Steen Buus; Bøtker, Hans Erik
2016-03-01
Remote ischemic preconditioning (rIPC), induced by cycles of transient limb ischemia and reperfusion (IR), is cardioprotective. The optimal rIPC-algorithm is not established. We investigated the effect of cycle numbers and ischemia duration within each rIPC-cycle and the influence of effector organ mass on the efficacy of cardioprotection. Furthermore, the duration of the early phase of protection by rIPC was investigated. Using a tourniquet tightened at the inguinal level, we subjected C57Bl/6NTac mice to intermittent hind-limb ischemia and reperfusion. The rIPC-protocols consisted of (I) two, four, six or eight cycles, (II) 2, 5 or 10 min of ischemia in each cycle, (III) single or two hind-limb occlusions and (IV) 0.5, 1.5, 2.0 or 2.5 h intervals from rIPC to index cardiac ischemia. All rIPC algorithms were followed by 5 min of reperfusion. The hearts were subsequently exposed to 25 min of global ischemia and 60 min of reperfusion in an ex vivo Langendorff model. Cardioprotection was evaluated by infarct size and post-ischemic hemodynamic recovery. Four to six rIPC cycles yielded significant cardioprotection with no further protection by eight cycles. Ischemic cycles lasting 2 min offered the same protection as cycles of 5 min ischemia, whereas prolonged cycles lasting 10 min abrogated protection. One and two hind-limb preconditioning were equally protective. In our mouse model, the duration of protection by rIPC was 1.5 h. These findings indicate that the number and duration of cycles rather than the tissue mass exposed to rIPC determines the efficacy of rIPC.
DEFF Research Database (Denmark)
Bak, Claus Leth; Sigurbjörnsson, Ragnar; Bukh, Bjarne
2016-01-01
are interconnected in a simple way but via transformers and infeed from remaining parts of the network. Distance relay measured fault loop impedance shows wide ranges of variations for both phase-phase loops as well as phase-earth loops. No simple relations exist. Simulation models can be used to study fault loop...... impedance for combined faults and thereby shed light on relay trips. This study uses actual fault records, analytical method and PSCAD simulation studies to analyse combined faults in an existing 400 and 150 kV transmission line owned by Danish TSO Energinet.dk. The results clearly show that an accurate...
DEFF Research Database (Denmark)
Bouserhal, Rachel E.; Bockstael, Annelies; MacDonald, Ewen
2017-01-01
Purpose: Studying the variations in speech levels with changing background noise level and talker-to-listener distance for talkers wearing hearing protection devices (HPDs) can aid in understanding communication in background noise. Method: Speech was recorded using an intra-aural HPD from 12...... complements the existing model presented by Pelegrín-García, Smits, Brunskog, and Jeong (2011) and expands on it by taking into account the effects of occlusion and background noise level on changes in speech sound level. Conclusions: Three models of the relationship between vocal effort, background noise...
Passmore, Gregory G; Owen, Mary Anne; Prabakaran, Krishnan
2011-12-01
Metacognitive learning strategies are based on instructional learning theory, which promotes deep, meaningful learning. Educators in a baccalaureate-level nuclear medicine technology program demonstrated that students enrolled in an online, distance learning section of an introductory radiation protection and radiobiology course performed better when traditional instruction was supplemented with nontraditional metacognitive learning strategies. The metacognitive learning strategy that was used is best known as concept mapping. The concept map, in addition to the standard homework problem assignment and opportunity for question-answer sessions, became the template for misconception identification and remediation interactions between the instructor and the student. The control group relied on traditional homework problems and question-answer sessions alone. Because students in both the "treatment" groups (i.e., students who used concept mapping) and the control group were distance learning students, all personal communications were conducted via e-mail or telephone. The final examination of the course was used to facilitate a quantitative comparison of the performance of students who used concept mapping and the performance of students who did not use concept mapping. The results demonstrated a significantly higher median final examination score for the concept mapping group than for the non-concept mapping group (z = -2.0381, P = 0.0415), with an appropriately large effect size (2.65). Concept mapping is a cognitive learning intervention that effectively enables meaningful learning and is suitable for use in the independent learner-oriented distance learning environments used by some nuclear medicine technology programs.
Directory of Open Access Journals (Sweden)
Mingshan Xie
2017-01-01
Full Text Available In order to enhance the enthusiasm of the data provider in the process of data interaction and improve the adequacy of data interaction, we put forward the concept of the ego of data and then analyzed the characteristics of the ego of data in the Internet of Things (IOT in this paper. We implement two steps of data clustering for the Internet of things; the first step is the spatial location of adjacent fuzzy clustering, and the second step is the sampling time fuzzy clustering. Equivalent classes can be obtained through the two steps. In this way we can make the data with layout characteristics to be classified into different equivalent classes, so that the specific location information of the data can be obscured, the layout characteristics of tags are eliminated, and ultimately anonymization protection would be achieved. The experimental results show that the proposed algorithm can greatly improve the efficiency of protection of the data in the interaction with others in the incompletely open manner, without reducing the quality of anonymization and enhancing the information loss. The anonymization data set generated by this method has better data availability, and this algorithm can effectively improve the security of data exchange.
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...
Mulyadi, Y.; Sucita, T.; Sumarto; Alpani, M.
2018-02-01
Electricity supply demand is increasing every year. It makes PT. PLN (Persero) is required to provide optimal customer service and satisfaction. Optimal service depends on the performance of the equipment of the power system owned, especially the transformer. Power transformer is an electrical equipment that transforms electricity from high voltage to low voltage or vice versa. However, in the electrical power system, is inseparable from interference included in the transformer. But, the disturbance can be minimized by the protection system. The main protection transformer is differential relays. Differential relays working system using Kirchoff law where inflows equal outflows. If there are excessive currents that interfere then the relays will work. But, the relay can also experience decreased performance. Therefore, this final project aims to analyze the reliability of the differential relay on the transformer in three different substations. Referring to the standard applied by the transmission line protection officer, the differential relay shall have slope characteristics of 30% in the first slope and 80% in the second slope when using two slopes and 80% when using one slope with an instant time and the corresponding ratio. So, the results obtained on the Siemens differential release have a reliable slope characteristic with a value of 30 on the fuzzy logic system. In a while, ABB a differential relay is only 80% reliable because two experiments are not reliable. For the time, all the differential relays are instant with a value of 0.06 on the fuzzy logic system. For ratios, the differential relays ABB have a better value than others brand with a value of 151 on the fuzzy logic system.
An Algorithm for the Use of Embolic Protection During Atherectomy for Femoral Popliteal Lesions.
Krishnan, Prakash; Tarricone, Arthur; Purushothaman, K Raman; Purushothaman, Meerarani; Vasquez, Miguel; Kovacic, Jason; Baber, Usman; Kapur, Vishal; Gujja, Karthik; Kini, Annapoorna; Sharma, Samin
2017-02-27
This study sought to identify an algorithm for the use of distal embolic protection on the basis of angiographic lesion morphology and vascular anatomy for patients undergoing atherectomy for femoropopliteal lesions. Atherectomy has been shown to create more embolic debris than angioplasty alone. Distal embolic protection has been shown to be efficacious in capturing macroemboli; however, no consensus exists for the appropriate lesions to use distal embolic protection during atherectomy. Patients with symptomatic lower extremity peripheral artery disease treated with atherectomy and distal embolic protection were evaluated to identify potential predictors of DE. Plaque collected from the SilverHawk nose cone subset was sent to pathology for analysis to evaluate the accuracy of angiography in assessing plaque morphology. Significant differences were found in lesion length (142.1 ± 62.98 vs. 56.91 ± 41.04; p = 0.0001), low-density lipoprotein (82.3 ± 40.3 vs. 70.9 ± 23.2; p = 0.0006), vessel runoff (1.18 ± 0.9 vs. 1.8 ± 0.9; p = 0.0001), chronic total occlusion (131 vs. 10; p = 0.001), in-stent restenosis (33 vs. 6; p = 0.0081), and calcified lesions (136 vs. 65; p 40 mm, and atherosclerotic lesions >140 mm identified by peripheral angiography necessitate concomitant filter use during atherectomy to prevent embolic complications. Copyright Â© 2017 American College of Cardiology Foundation. Published by Elsevier Inc. All rights reserved.
DEFF Research Database (Denmark)
Zheng, Tai-Ying; Cha, Seung-Tae; Crossley, Peter A.
2011-01-01
A protection relay for a wind turbine generator (WTG) based on positive- and negative-sequence fault components is proposed in the paper. The relay uses the magnitude of the positive-sequence component in the fault current to detect a fault on a parallel WTG, connected to the same power collection...... feeder, or a fault on an adjacent feeder; but for these faults, the relay remains stable and inoperative. A fault on the power collection feeder or a fault on the collection bus, both of which require an instantaneous tripping response, are distinguished from an inter-tie fault or a grid fault, which...... in the fault current is used to decide on either instantaneous or delayed operation. The operating performance of the relay is then verified using various fault scenarios modelled using EMTP-RV. The scenarios involve changes in the position and type of fault, and the faulted phases. Results confirm...
Institute of Scientific and Technical Information of China (English)
赵星; 王逊; 黄树成
2018-01-01
Through the improvement of the missing value filling algorithm based on K-means clustering,a filling algorithm based on distance maximization and missing data clustering is proposed in this paper.First of all,the original filling algorithm needs to enter the number of clusters in advance.To solve this problem,an improved K-means clustering algorithm is designed.It determines the cluster centers by the maximum distance between the data.It will automatically generate the number of clusters,and improve the efficiency of clustering.Secondly,the clustering distance function is improved.The improved algorithm can be used to cluster the missing value records,thus simplifying the steps of the original filling algorithm.Through experiments on STUDENT ALCOHOL CONSUMPTION data set,experimental results show that the proposed algorithm can improve efficiency and effectively fill the missing data at the same time.%通过对基于K-means聚类的缺失值填充算法的改进,文中提出了基于距离最大化和缺失数据聚类的填充算法.首先,针对原填充算法需要提前输入聚类个数这一缺点,设计了改进的K-means聚类算法:使用数据间的最大距离确定聚类中心,自动产生聚类个数,提高聚类效果;其次,对聚类的距离函数进行改进,采用部分距离度量方式,改进后的算法可以对含有缺失值的记录进行聚类,简化原填充算法步骤.通过对STUDENT ALCOHOL CONSUMPTION数据集的实验,结果证明了该算法能够在提高效率的同时,有效地填充缺失数据.
Louboutin, Jean-Pierre; Agrawal, Lokesh; Reyes, Beverly A S; Van Bockstaele, Elisabeth J; Strayer, David S
2009-06-01
Toxicity of HIV-1 envelope glycoprotein (gp120) for substantia nigra (SN) neurons may contribute to the Parkinsonian manifestations often seen in HIV-1-associated dementia (HAD). We studied the neurotoxicity of gp120 for dopaminergic neurons and potential neuroprotection by antioxidant gene delivery. Rats were injected stereotaxically into their caudate-putamen (CP); CP and (substantia nigra) SN neuron loss was quantified. The area of neuron loss extended several millimeters from the injection site, approximately 35% of the CP area. SN neurons, outside of this area of direct neurotoxicity, were also severely affected. Dopaminergic SN neurons (expressing tyrosine hydroxylase, TH, in the SN and dopamine transporter, DAT, in the CP) were mostly affected: intra-CP gp120 caused approximately 50% DAT+ SN neuron loss. Prior intra-CP gene delivery of Cu/Zn superoxide dismutase (SOD1) or glutathione peroxidase (GPx1) protected SN neurons from intra-CP gp120. Thus, SN dopaminergic neurons are highly sensitive to HIV-1 gp120-induced neurotoxicity, and antioxidant gene delivery, even at a distance, is protective.
Directory of Open Access Journals (Sweden)
Henning Höfig
2014-11-01
Full Text Available Förster resonance energy transfer (FRET is an important tool for studying the structural and dynamical properties of biomolecules. The fact that both the internal dynamics of the biomolecule and the movements of the biomolecule-attached dyes can occur on similar timescales of nanoseconds is an inherent problem in FRET studies. By performing single-molecule FRET-filtered lifetime measurements, we are able to characterize the amplitude of the motions of fluorescent probes attached to double-stranded DNA standards by means of flexible linkers. With respect to previously proposed experimental approaches, we improved the precision and the accuracy of the inter-dye distance distribution parameters by filtering out the donor-only population with pulsed interleaved excitation. A coarse-grained model is employed to reproduce the experimentally determined inter-dye distance distributions. This approach can easily be extended to intrinsically flexible proteins allowing, under certain conditions, to decouple the macromolecule amplitude of motions from the contribution of the dye linkers.
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.
The Sustainable Technology Division has recently completed an implementation of the U.S. EPA's Waste Reduction (WAR) Algorithm that can be directly accessed from a Cape-Open compliant process modeling environment. The WAR Algorithm add-in can be used in AmsterChem's COFE (Cape-Op...
Energy Technology Data Exchange (ETDEWEB)
Eldin, A.A. Hossam; Refaey, M.A. [Electrical Engineering Department, Alexandria University, Alexandria (Egypt)
2011-01-15
This paper proposes a novel methodology for transformer differential protection, based on wave shape recognition of the discriminating criterion extracted of the instantaneous differential currents. Discrete wavelet transform has been applied to the differential currents due to internal fault and inrush currents. The diagnosis criterion is based on median absolute deviation (MAD) of wavelet coefficients over a specified frequency band. The proposed algorithm is examined using various simulated inrush and internal fault current cases on a power transformer that has been modeled using electromagnetic transients program EMTDC software. Results of evaluation study show that, proposed wavelet based differential protection scheme can discriminate internal faults from inrush currents. (author)
Gualtieri, J. A.; Le Moigne, J.; Packer, C. V.
1992-01-01
Comparing two binary images and assigning a quantitative measure to this comparison finds its purpose in such tasks as image recognition, image compression, and image browsing. This quantitative measurement may be computed by utilizing the Hausdorff distance of the images represented as two-dimensional point sets. In this paper, we review two algorithms that have been proposed to compute this distance, and we present a parallel implementation of one of them on the MasPar parallel processor. We study their complexity and the results obtained by these algorithms for two different types of images: a set of displaced pairs of images of Gaussian densities, and a comparison of a Canny edge image with several edge images from a hierarchical region growing code.
Directory of Open Access Journals (Sweden)
Katarina Pucelj
2006-12-01
Full Text Available I would like to underline the role and importance of knowledge, which is acquired by individuals as a result of a learning process and experience. I have established that a form of learning, such as distance learning definitely contributes to a higher learning quality and leads to innovative, dynamic and knowledgebased society. Knowledge and skills enable individuals to cope with and manage changes, solve problems and also create new knowledge. Traditional learning practices face new circumstances, new and modern technologies appear, which enable quick and quality-oriented knowledge implementation. The centre of learning process at distance learning is to increase the quality of life of citizens, their competitiveness on the workforce market and ensure higher economic growth. Intellectual capital is the one, which represents the biggest capital of each society and knowledge is the key factor for succes of everybody, who are fully aware of this. Flexibility, openness and willingness of people to follow new IT solutions form suitable environment for developing and deciding to take up distance learning.
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...
2016-03-02
whereBψ is any Bregman divergence and ηt is the learning rate parameter. From (Hall & Willett, 2015) we have: Theorem 1. G` = max θ∈Θ,`∈L ‖∇f(θ)‖ φmax = 1...Kullback-Liebler divergence between an initial guess of the matrix that parameterizes the Mahalanobis distance and a solution that satisfies a set of...Bregman divergence and ηt is the learning rate parameter. M̂0, µ̂0 are initialized to some initial value. In [18] a closed-form algorithm for solving
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,
Directory of Open Access Journals (Sweden)
Wessam M. Abdel-Wahab
2013-10-01
Full Text Available Many active ingredients extracted from herbal and medicinal plants are extensively studied for their beneficial effects. Antioxidant activity and free radical scavenging properties of thymoquinone (TQ have been reported. The present study evaluated the possible protective effects of TQ against the toxicity and oxidative stress of sodium fluoride (NaF in the liver of rats. Rats were divided into four groups, the first group served as the control group and was administered distilled water whereas the NaF group received NaF orally at a dose of 10 mg/kg for 4 weeks, TQ group was administered TQ orally at a dose of 10 mg/kg for 5 weeks, and the NaF-TQ group was first given TQ for 1 week and was secondly administered 10 mg/kg/day NaF in association with 10 mg/kg TQ for 4 weeks. Rats intoxicated with NaF showed a significant increase in lipid peroxidation whereas the level of reduced glutathione (GSH and the activity of superoxide dismutase (SOD, catalase (CAT, glutathione S-transferase (GST and glutathione peroxidase (GPx were reduced in hepatic tissues. The proper functioning of the liver was also disrupted as indicated by alterations in the measured liver function indices and biochemical parameters. TQ supplementation counteracted the NaF-induced hepatotoxicity probably due to its strong antioxidant activity. In conclusion, the results obtained clearly indicated the role of oxidative stress in the induction of NaF toxicity and suggested hepatoprotective effects of TQ against the toxicity of fluoride compounds.
DEFF Research Database (Denmark)
Zheng, T. Y.; Cha, Seung-Tae; Lee, B. E.
2011-01-01
A protection relay for a wind turbine generator (WTG) based on the fault-generated symmetrical components is proposed in the paper. At stage 1, the relay uses the magnitude of the positive-sequence component in the fault current to distinguish faults on a parallel WTG, connected to the same feeder......, or on an adjacent feeder from those on the connected feeder, on the collection bus, at an inter-tie or at a grid. For the former faults, the relay should remain stable and inoperative whilst the instantaneous or delayed tripping is required for the latter faults. At stage 2, the fault type is first evaluated using...... the relationships of the fault-generated symmetrical components. Then, the magnitude of the positive-sequence component in the fault current is used again to decide on either instantaneous or delayed operation. The operating performance of the relay is then verified using various fault scenarios modelled using...
Streaming Algorithms for Line Simplification
DEFF Research Database (Denmark)
Abam, Mohammad; de Berg, Mark; Hachenberger, Peter
2010-01-01
this problem in a streaming setting, where we only have a limited amount of storage, so that we cannot store all the points. We analyze the competitive ratio of our algorithms, allowing resource augmentation: we let our algorithm maintain a simplification with 2k (internal) points and compare the error of our...... simplification to the error of the optimal simplification with k points. We obtain the algorithms with O(1) competitive ratio for three cases: convex paths, where the error is measured using the Hausdorff distance (or Fréchet distance), xy-monotone paths, where the error is measured using the Hausdorff distance...... (or Fréchet distance), and general paths, where the error is measured using the Fréchet distance. In the first case the algorithm needs O(k) additional storage, and in the latter two cases the algorithm needs O(k 2) additional storage....
Directory of Open Access Journals (Sweden)
Vahid Karami
2017-04-01
Full Text Available Background Increasing the x-ray film to focus distance (FFD, has been recommended as a practical dose optimization tool for patients undergoing conventional radiological procedures. In the previous study, we demonstrated a 32% reduction in absorbed dose is achievable due to increasing the FFD from 100 to 130 cm during pediatric chest radiography. The aim of this study was to examine whether increasing the FFD from 100 to 130 cm is equally effective for other common radiological procedures and performing a literature review of published studies to address the feasibility and probable limitations against implementing this optimization tool in clinical practice. Materials and Methods Radiographic examination of the pelvis (AP view, abdomen (AP view, skull (AP and lateral view, and spine (AP and lateral view, were taken of pediatric patients. The radiation dose and image quality of a radiological procedure is measured in FFD of 100 cm (reference FFD and 130 cm (increased FFD. The thermo-luminescent dosimeters (TLD were used for radiation dose measurements and visual grading analysis (VGA for image quality assessments. Results: Statistically significant reduction in the ESD ranged from 21.91% for the lateral skull projection to 35.24% for the lateral spine projection was obtained, when the FFD was increased from 100 to 130 cm (P0.05. Conclusion Increasing the FFD from 100 to 130 cm has significantly reduced radiation exposure without affecting on image quality. Our findings are commensurate with the literatures and emphasized that radiographers should learn to use of an updated reference FFD of 130 cm in clinical practice.
Architecture and Fault Identification of Wide-area Protection System
Directory of Open Access Journals (Sweden)
Yuxue Wang
2012-09-01
Full Text Available Wide-area protection system (WAPS is widely studied for the purpose of improvng the performance of conventional backup protection. In this paper, the system architecture of WAPS is proposed and its key technologies are discussed in view of engineering projects. So a mixed structurecentralized-distributed structure which is more suitable for WAPS in limited power grid region, is obtained based on the advantages of the centralized structure and distributed structure. Furthermore, regional distance protection algorithm was taken as an example to illustrate the functions of the constituent units. Faulted components can be detected based on multi-source imformation fuse in the algorithm. And the algorithm cannot only improve the selectivity, the rapidity, and the reliability of relaying protection but also has high fault tolerant capability. A simulation of 220 kV grid systems in Easter Hubei province shows the effectiveness of the wide-area protection system presented by this paper.
Orcutt, John M.; Brenton, James C.
2016-01-01
An accurate database of meteorological data is essential for designing any aerospace vehicle and for preparing launch commit criteria. Meteorological instrumentation were recently placed on the three Lightning Protection System (LPS) towers at Kennedy Space Center (KSC) launch complex 39B (LC-39B), which provide a unique meteorological dataset existing at the launch complex over an extensive altitude range. Data records of temperature, dew point, relative humidity, wind speed, and wind direction are produced at 40, 78, 116, and 139 m at each tower. The Marshall Space Flight Center Natural Environments Branch (EV44) received an archive that consists of one-minute averaged measurements for the period of record of January 2011 - April 2015. However, before the received database could be used EV44 needed to remove any erroneous data from within the database through a comprehensive quality control (QC) process. The QC process applied to the LPS towers' meteorological data is similar to other QC processes developed by EV44, which were used in the creation of meteorological databases for other towers at KSC. The QC process utilized in this study has been modified specifically for use with the LPS tower database. The QC process first includes a check of each individual sensor. This check includes removing any unrealistic data and checking the temporal consistency of each variable. Next, data from all three sensors at each height are checked against each other, checked against climatology, and checked for sensors that erroneously report a constant value. Then, a vertical consistency check of each variable at each tower is completed. Last, the upwind sensor at each level is selected to minimize the influence of the towers and other structures at LC-39B on the measurements. The selection process for the upwind sensor implemented a study of tower-induced turbulence. This paper describes in detail the QC process, QC results, and the attributes of the LPS towers meteorological
Distance majorization and its applications.
Chi, Eric C; Zhou, Hua; Lange, Kenneth
2014-08-01
The problem of minimizing a continuously differentiable convex function over an intersection of closed convex sets is ubiquitous in applied mathematics. It is particularly interesting when it is easy to project onto each separate set, but nontrivial to project onto their intersection. Algorithms based on Newton's method such as the interior point method are viable for small to medium-scale problems. However, modern applications in statistics, engineering, and machine learning are posing problems with potentially tens of thousands of parameters or more. We revisit this convex programming problem and propose an algorithm that scales well with dimensionality. Our proposal is an instance of a sequential unconstrained minimization technique and revolves around three ideas: the majorization-minimization principle, the classical penalty method for constrained optimization, and quasi-Newton acceleration of fixed-point algorithms. The performance of our distance majorization algorithms is illustrated in several applications.
Machine learning enhanced optical distance sensor
Amin, M. Junaid; Riza, N. A.
2018-01-01
Presented for the first time is a machine learning enhanced optical distance sensor. The distance sensor is based on our previously demonstrated distance measurement technique that uses an Electronically Controlled Variable Focus Lens (ECVFL) with a laser source to illuminate a target plane with a controlled optical beam spot. This spot with varying spot sizes is viewed by an off-axis camera and the spot size data is processed to compute the distance. In particular, proposed and demonstrated in this paper is the use of a regularized polynomial regression based supervised machine learning algorithm to enhance the accuracy of the operational sensor. The algorithm uses the acquired features and corresponding labels that are the actual target distance values to train a machine learning model. The optimized training model is trained over a 1000 mm (or 1 m) experimental target distance range. Using the machine learning algorithm produces a training set and testing set distance measurement errors of learning. Applications for the proposed sensor include industrial scenario distance sensing where target material specific training models can be generated to realize low <1% measurement error distance measurements.
On Normalized Compression Distance and Large Malware
Borbely, Rebecca Schuller
2015-01-01
Normalized Compression Distance (NCD) is a popular tool that uses compression algorithms to cluster and classify data in a wide range of applications. Existing discussions of NCD's theoretical merit rely on certain theoretical properties of compression algorithms. However, we demonstrate that many popular compression algorithms don't seem to satisfy these theoretical properties. We explore the relationship between some of these properties and file size, demonstrating that this theoretical pro...
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.
Directory of Open Access Journals (Sweden)
Peek-Asa Corinne
2011-01-01
Full Text Available Abstract Background The need to estimate the distance from an individual to a service provider is common in public health research. However, estimated distances are often imprecise and, we suspect, biased due to a lack of specific residential location data. In many cases, to protect subject confidentiality, data sets contain only a ZIP Code or a county. Results This paper describes an algorithm, known as "the probabilistic sampling method" (PSM, which was used to create a distribution of estimated distances to a health facility for a person whose region of residence was known, but for which demographic details and centroids were known for smaller areas within the region. From this distribution, the median distance is the most likely distance to the facility. The algorithm, using Monte Carlo sampling methods, drew a probabilistic sample of all the smaller areas (Census blocks within each participant's reported region (ZIP Code, weighting these areas by the number of residents in the same age group as the participant. To test the PSM, we used data from a large cross-sectional study that screened women at a clinic for intimate partner violence (IPV. We had data on each woman's age and ZIP Code, but no precise residential address. We used the PSM to select a sample of census blocks, then calculated network distances from each census block's centroid to the closest IPV facility, resulting in a distribution of distances from these locations to the geocoded locations of known IPV services. We selected the median distance as the most likely distance traveled and computed confidence intervals that describe the shortest and longest distance within which any given percent of the distance estimates lie. We compared our results to those obtained using two other geocoding approaches. We show that one method overestimated the most likely distance and the other underestimated it. Neither of the alternative methods produced confidence intervals for the distance
2011-01-01
Background The need to estimate the distance from an individual to a service provider is common in public health research. However, estimated distances are often imprecise and, we suspect, biased due to a lack of specific residential location data. In many cases, to protect subject confidentiality, data sets contain only a ZIP Code or a county. Results This paper describes an algorithm, known as "the probabilistic sampling method" (PSM), which was used to create a distribution of estimated distances to a health facility for a person whose region of residence was known, but for which demographic details and centroids were known for smaller areas within the region. From this distribution, the median distance is the most likely distance to the facility. The algorithm, using Monte Carlo sampling methods, drew a probabilistic sample of all the smaller areas (Census blocks) within each participant's reported region (ZIP Code), weighting these areas by the number of residents in the same age group as the participant. To test the PSM, we used data from a large cross-sectional study that screened women at a clinic for intimate partner violence (IPV). We had data on each woman's age and ZIP Code, but no precise residential address. We used the PSM to select a sample of census blocks, then calculated network distances from each census block's centroid to the closest IPV facility, resulting in a distribution of distances from these locations to the geocoded locations of known IPV services. We selected the median distance as the most likely distance traveled and computed confidence intervals that describe the shortest and longest distance within which any given percent of the distance estimates lie. We compared our results to those obtained using two other geocoding approaches. We show that one method overestimated the most likely distance and the other underestimated it. Neither of the alternative methods produced confidence intervals for the distance estimates. The algorithm
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.
A Distance Bounding Protocol for Location-Cloaked Applications.
Molina-Martínez, Cristián; Galdames, Patricio; Duran-Faundez, Cristian
2018-04-26
Location-based services (LBSs) assume that users are willing to release trustworthy and useful details about their whereabouts. However, many location privacy concerns have arisen. For location privacy protection, several algorithms build a cloaking region to hide a user’s location. However, many applications may not operate adequately on cloaked locations. For example, a traditional distance bounding protocol (DBP)—which is run by two nodes called the prover and the verifier—may conclude an untight and useless distance between these two entities. An LBS (verifier) may use this distance as a metric of usefulness and trustworthiness of the location claimed by the user (prover). However, we show that if a tight distance is desired, traditional DBP can refine a user’s cloaked location and compromise its location privacy. To find a proper balance, we propose a location-privacy-aware DBP protocol. Our solution consists of adding some small delays before submitting any user’s response. We show that several issues arise when a certain delay is chosen, and we propose some solutions. The effectiveness of our techniques in balancing location refinement and utility is demonstrated through simulation.
A Distance Bounding Protocol for Location-Cloaked Applications
Directory of Open Access Journals (Sweden)
Cristián Molina-Martínez
2018-04-01
Full Text Available Location-based services (LBSs assume that users are willing to release trustworthy and useful details about their whereabouts. However, many location privacy concerns have arisen. For location privacy protection, several algorithms build a cloaking region to hide a user’s location. However, many applications may not operate adequately on cloaked locations. For example, a traditional distance bounding protocol (DBP—which is run by two nodes called the prover and the verifier—may conclude an untight and useless distance between these two entities. An LBS (verifier may use this distance as a metric of usefulness and trustworthiness of the location claimed by the user (prover. However, we show that if a tight distance is desired, traditional DBP can refine a user’s cloaked location and compromise its location privacy. To find a proper balance, we propose a location-privacy-aware DBP protocol. Our solution consists of adding some small delays before submitting any user’s response. We show that several issues arise when a certain delay is chosen, and we propose some solutions. The effectiveness of our techniques in balancing location refinement and utility is demonstrated through simulation.
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...
Measuring distances between complex networks
International Nuclear Information System (INIS)
Andrade, Roberto F.S.; Miranda, Jose G.V.; Pinho, Suani T.R.; Lobao, Thierry Petit
2008-01-01
A previously introduced concept of higher order neighborhoods in complex networks, [R.F.S. Andrade, J.G.V. Miranda, T.P. Lobao, Phys. Rev. E 73 (2006) 046101] is used to define a distance between networks with the same number of nodes. With such measure, expressed in terms of the matrix elements of the neighborhood matrices of each network, it is possible to compare, in a quantitative way, how far apart in the space of neighborhood matrices two networks are. The distance between these matrices depends on both the network topologies and the adopted node numberings. While the numbering of one network is fixed, a Monte Carlo algorithm is used to find the best numbering of the other network, in the sense that it minimizes the distance between the matrices. The minimal value found for the distance reflects differences in the neighborhood structures of the two networks that arise only from distinct topologies. This procedure ends up by providing a projection of the first network on the pattern of the second one. Examples are worked out allowing for a quantitative comparison for distances among distinct networks, as well as among distinct realizations of random networks
Phylogenetic inference with weighted codon evolutionary distances.
Criscuolo, Alexis; Michel, Christian J
2009-04-01
We develop a new approach to estimate a matrix of pairwise evolutionary distances from a codon-based alignment based on a codon evolutionary model. The method first computes a standard distance matrix for each of the three codon positions. Then these three distance matrices are weighted according to an estimate of the global evolutionary rate of each codon position and averaged into a unique distance matrix. Using a large set of both real and simulated codon-based alignments of nucleotide sequences, we show that this approach leads to distance matrices that have a significantly better treelikeness compared to those obtained by standard nucleotide evolutionary distances. We also propose an alternative weighting to eliminate the part of the noise often associated with some codon positions, particularly the third position, which is known to induce a fast evolutionary rate. Simulation results show that fast distance-based tree reconstruction algorithms on distance matrices based on this codon position weighting can lead to phylogenetic trees that are at least as accurate as, if not better, than those inferred by maximum likelihood. Finally, a well-known multigene dataset composed of eight yeast species and 106 codon-based alignments is reanalyzed and shows that our codon evolutionary distances allow building a phylogenetic tree which is similar to those obtained by non-distance-based methods (e.g., maximum parsimony and maximum likelihood) and also significantly improved compared to standard nucleotide evolutionary distance estimates.
Dialect distances based on orthographic and phonetic transcriptions
CSIR Research Space (South Africa)
Zulu, N
2006-11-01
Full Text Available , where transcription segments were compared using the algorithm. In 2003 Gooskens and Heeringa [5] calculated Levenshtein distances between 15 Norwegian dialects and compared them to the distances as perceived by Norwegian listeners... by a clustering algorithm. Figure 2 illustrates the dendrogram derived from the clustering of perceptual distances as perceived by Norwegian listeners for the 15 Norwegian dialects investigated in this research [6]. Figure 2: Dendrogram...
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 Distance Standard Deviation
Edelmann, Dominic; Richards, Donald; Vogel, Daniel
2017-01-01
The distance standard deviation, which arises in distance correlation analysis of multivariate data, is studied as a measure of spread. New representations for the distance standard deviation are obtained in terms of Gini's mean difference and in terms of the moments of spacings of order statistics. Inequalities for the distance variance are derived, proving that the distance standard deviation is bounded above by the classical standard deviation and by Gini's mean difference. Further, it is ...
DEFF Research Database (Denmark)
Mahnke, Martina; Uprichard, Emma
2014-01-01
Imagine sailing across the ocean. The sun is shining, vastness all around you. And suddenly [BOOM] you’ve hit an invisible wall. Welcome to the Truman Show! Ever since Eli Pariser published his thoughts on a potential filter bubble, this movie scenario seems to have become reality, just with slight...... changes: it’s not the ocean, it’s the internet we’re talking about, and it’s not a TV show producer, but algorithms that constitute a sort of invisible wall. Building on this assumption, most research is trying to ‘tame the algorithmic tiger’. While this is a valuable and often inspiring approach, we...
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...
An innovative localisation algorithm for railway vehicles
Allotta, B.; D'Adamio, P.; Malvezzi, M.; Pugi, L.; Ridolfi, A.; Rindi, A.; Vettori, G.
2014-11-01
In modern railway automatic train protection and automatic train control systems, odometry is a safety relevant on-board subsystem which estimates the instantaneous speed and the travelled distance of the train; a high reliability of the odometry estimate is fundamental, since an error on the train position may lead to a potentially dangerous overestimation of the distance available for braking. To improve the odometry estimate accuracy, data fusion of different inputs coming from a redundant sensor layout may be used. The aim of this work has been developing an innovative localisation algorithm for railway vehicles able to enhance the performances, in terms of speed and position estimation accuracy, of the classical odometry algorithms, such as the Italian Sistema Controllo Marcia Treno (SCMT). The proposed strategy consists of a sensor fusion between the information coming from a tachometer and an Inertial Measurements Unit (IMU). The sensor outputs have been simulated through a 3D multibody model of a railway vehicle. The work has provided the development of a custom IMU, designed by ECM S.p.a, in order to meet their industrial and business requirements. The industrial requirements have to be compliant with the European Train Control System (ETCS) standards: the European Rail Traffic Management System (ERTMS), a project developed by the European Union to improve the interoperability among different countries, in particular as regards the train control and command systems, fixes some standard values for the odometric (ODO) performance, in terms of speed and travelled distance estimation. The reliability of the ODO estimation has to be taken into account basing on the allowed speed profiles. The results of the currently used ODO algorithms can be improved, especially in case of degraded adhesion conditions; it has been verified in the simulation environment that the results of the proposed localisation algorithm are always compliant with the ERTMS requirements
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...
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,
A cognitively grounded measure of pronunciation distance.
Directory of Open Access Journals (Sweden)
Martijn Wieling
Full Text Available In this study we develop pronunciation distances based on naive discriminative learning (NDL. Measures of pronunciation distance are used in several subfields of linguistics, including psycholinguistics, dialectology and typology. In contrast to the commonly used Levenshtein algorithm, NDL is grounded in cognitive theory of competitive reinforcement learning and is able to generate asymmetrical pronunciation distances. In a first study, we validated the NDL-based pronunciation distances by comparing them to a large set of native-likeness ratings given by native American English speakers when presented with accented English speech. In a second study, the NDL-based pronunciation distances were validated on the basis of perceptual dialect distances of Norwegian speakers. Results indicated that the NDL-based pronunciation distances matched perceptual distances reasonably well with correlations ranging between 0.7 and 0.8. While the correlations were comparable to those obtained using the Levenshtein distance, the NDL-based approach is more flexible as it is also able to incorporate acoustic information other than sound segments.
Haptic Discrimination of Distance
van Beek, Femke E.; Bergmann Tiest, Wouter M.; Kappers, Astrid M. L.
2014-01-01
While quite some research has focussed on the accuracy of haptic perception of distance, information on the precision of haptic perception of distance is still scarce, particularly regarding distances perceived by making arm movements. In this study, eight conditions were measured to answer four main questions, which are: what is the influence of reference distance, movement axis, perceptual mode (active or passive) and stimulus type on the precision of this kind of distance perception? A discrimination experiment was performed with twelve participants. The participants were presented with two distances, using either a haptic device or a real stimulus. Participants compared the distances by moving their hand from a start to an end position. They were then asked to judge which of the distances was the longer, from which the discrimination threshold was determined for each participant and condition. The precision was influenced by reference distance. No effect of movement axis was found. The precision was higher for active than for passive movements and it was a bit lower for real stimuli than for rendered stimuli, but it was not affected by adding cutaneous information. Overall, the Weber fraction for the active perception of a distance of 25 or 35 cm was about 11% for all cardinal axes. The recorded position data suggest that participants, in order to be able to judge which distance was the longer, tried to produce similar speed profiles in both movements. This knowledge could be useful in the design of haptic devices. PMID:25116638
Haptic discrimination of distance.
Directory of Open Access Journals (Sweden)
Femke E van Beek
Full Text Available While quite some research has focussed on the accuracy of haptic perception of distance, information on the precision of haptic perception of distance is still scarce, particularly regarding distances perceived by making arm movements. In this study, eight conditions were measured to answer four main questions, which are: what is the influence of reference distance, movement axis, perceptual mode (active or passive and stimulus type on the precision of this kind of distance perception? A discrimination experiment was performed with twelve participants. The participants were presented with two distances, using either a haptic device or a real stimulus. Participants compared the distances by moving their hand from a start to an end position. They were then asked to judge which of the distances was the longer, from which the discrimination threshold was determined for each participant and condition. The precision was influenced by reference distance. No effect of movement axis was found. The precision was higher for active than for passive movements and it was a bit lower for real stimuli than for rendered stimuli, but it was not affected by adding cutaneous information. Overall, the Weber fraction for the active perception of a distance of 25 or 35 cm was about 11% for all cardinal axes. The recorded position data suggest that participants, in order to be able to judge which distance was the longer, tried to produce similar speed profiles in both movements. This knowledge could be useful in the design of haptic devices.
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.
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...
De Götzen , Amalia; Mion , Luca; Tache , Olivier
2007-01-01
International audience; We call sound algorithms the categories of algorithms that deal with digital sound signal. Sound algorithms appeared in the very infancy of computer. Sound algorithms present strong specificities that are the consequence of two dual considerations: the properties of the digital sound signal itself and its uses, and the properties of auditory perception.
Wang, Lui; Bayer, Steven E.
1991-01-01
Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.
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.
Comparison of two (geometric) algorithms for auto OMA
DEFF Research Database (Denmark)
Juul, Martin; Olsen, Peter; Balling, Ole
2018-01-01
parameters. The two algorithms are compared and illustrated on simulated data. Different choices of distance measures are discussed and evaluated. It is illustrated how a simple distance measure outperforms traditional distance measures from other Auto OMA algorithms. Traditional measures are unable...
Joux, Antoine
2009-01-01
Illustrating the power of algorithms, Algorithmic Cryptanalysis describes algorithmic methods with cryptographically relevant examples. Focusing on both private- and public-key cryptographic algorithms, it presents each algorithm either as a textual description, in pseudo-code, or in a C code program.Divided into three parts, the book begins with a short introduction to cryptography and a background chapter on elementary number theory and algebra. It then moves on to algorithms, with each chapter in this section dedicated to a single topic and often illustrated with simple cryptographic applic
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...
Distance between configurations in Markov chain Monte Carlo simulations
Fukuma, Masafumi; Matsumoto, Nobuyuki; Umeda, Naoya
2017-12-01
For a given Markov chain Monte Carlo algorithm we introduce a distance between two configurations that quantifies the difficulty of transition from one configuration to the other configuration. We argue that the distance takes a universal form for the class of algorithms which generate local moves in the configuration space. We explicitly calculate the distance for the Langevin algorithm, and show that it certainly has desired and expected properties as distance. We further show that the distance for a multimodal distribution gets dramatically reduced from a large value by the introduction of a tempering method. We also argue that, when the original distribution is highly multimodal with large number of degenerate vacua, an anti-de Sitter-like geometry naturally emerges in the extended configuration space.
Diversity-Guided Evolutionary Algorithms
DEFF Research Database (Denmark)
Ursem, Rasmus Kjær
2002-01-01
Population diversity is undoubtably a key issue in the performance of evolutionary algorithms. A common hypothesis is that high diversity is important to avoid premature convergence and to escape local optima. Various diversity measures have been used to analyze algorithms, but so far few...... algorithms have used a measure to guide the search. The diversity-guided evolutionary algorithm (DGEA) uses the wellknown distance-to-average-point measure to alternate between phases of exploration (mutation) and phases of exploitation (recombination and selection). The DGEA showed remarkable results...
Hougardy, Stefan
2016-01-01
Algorithms play an increasingly important role in nearly all fields of mathematics. This book allows readers to develop basic mathematical abilities, in particular those concerning the design and analysis of algorithms as well as their implementation. It presents not only fundamental algorithms like the sieve of Eratosthenes, the Euclidean algorithm, sorting algorithms, algorithms on graphs, and Gaussian elimination, but also discusses elementary data structures, basic graph theory, and numerical questions. In addition, it provides an introduction to programming and demonstrates in detail how to implement algorithms in C++. This textbook is suitable for students who are new to the subject and covers a basic mathematical lecture course, complementing traditional courses on analysis and linear algebra. Both authors have given this "Algorithmic Mathematics" course at the University of Bonn several times in recent years.
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.
Cohen, A.M.; Beineke, L.W.; Wilson, R.J.; Cameron, P.J.
2004-01-01
In this chapter we investigate the classification of distance-transitive graphs: these are graphs whose automorphism groups are transitive on each of the sets of pairs of vertices at distance i, for i = 0, 1,.... We provide an introduction into the field. By use of the classification of finite
Distance Education in Entwicklungslandern.
German Foundation for International Development, Bonn (West Germany).
Seminar and conference reports and working papers on distance education of adults, which reflect the experiences of many countries, are presented. Contents include the draft report of the 1979 International Seminar on Distance Education held in Addis Ababa, Ethiopia, which was jointly sponsored by the United Nations Economic Commission for Africa…
Deza, Michel Marie
2009-01-01
Distance metrics and distances have become an essential tool in many areas of pure and applied Mathematics. This title offers both independent introductions and definitions, while at the same time making cross-referencing easy through hyperlink-like boldfaced references to original definitions.
Directory of Open Access Journals (Sweden)
Dr. Nursel Selver RUZGAR,
2004-04-01
Full Text Available Distance Education in Turkey Assistant Professor Dr. Nursel Selver RUZGAR Technical Education Faculty Marmara University, TURKEY ABSTRACT Many countries of the world are using distance education with various ways, by internet, by post and by TV. In this work, development of distance education in Turkey has been presented from the beginning. After discussing types and applications for different levels of distance education in Turkey, the distance education was given in the cultural aspect of the view. Then, in order to create the tendencies and thoughts of graduates of Higher Education Institutions and Distance Education Institutions about being competitors in job markets, sufficiency of education level, advantages for education system, continuing education in different Institutions, a face-to-face survey was applied to 1284 graduates, 958 from Higher Education Institutions and 326 from Distance Education Institutions. The results were evaluated and discussed. In the last part of this work, suggestions to become widespread and improve the distance education in the country were made.
Vision-Based Detection and Distance Estimation of Micro Unmanned Aerial Vehicles
Directory of Open Access Journals (Sweden)
Fatih Gökçe
2015-09-01
Full Text Available Detection and distance estimation of micro unmanned aerial vehicles (mUAVs is crucial for (i the detection of intruder mUAVs in protected environments; (ii sense and avoid purposes on mUAVs or on other aerial vehicles and (iii multi-mUAV control scenarios, such as environmental monitoring, surveillance and exploration. In this article, we evaluate vision algorithms as alternatives for detection and distance estimation of mUAVs, since other sensing modalities entail certain limitations on the environment or on the distance. For this purpose, we test Haar-like features, histogram of gradients (HOG and local binary patterns (LBP using cascades of boosted classifiers. Cascaded boosted classifiers allow fast processing by performing detection tests at multiple stages, where only candidates passing earlier simple stages are processed at the preceding more complex stages. We also integrate a distance estimation method with our system utilizing geometric cues with support vector regressors. We evaluated each method on indoor and outdoor videos that are collected in a systematic way and also on videos having motion blur. Our experiments show that, using boosted cascaded classifiers with LBP, near real-time detection and distance estimation of mUAVs are possible in about 60 ms indoors (1032 × 778 resolution and 150 ms outdoors (1280 × 720 resolution per frame, with a detection rate of 0.96 F-score. However, the cascaded classifiers using Haar-like features lead to better distance estimation since they can position the bounding boxes on mUAVs more accurately. On the other hand, our time analysis yields that the cascaded classifiers using HOG train and run faster than the other algorithms.
Tel, G.
We define the notion of total algorithms for networks of processes. A total algorithm enforces that a "decision" is taken by a subset of the processes, and that participation of all processes is required to reach this decision. Total algorithms are an important building block in the design of
Fitting polynomial surfaces to triangular meshes with Voronoi Squared Distance Minimization
Nivoliers, Vincent; Yan, Dongming; Lé vy, Bruno L.
2011-01-01
This paper introduces Voronoi Squared Distance Minimization (VSDM), an algorithm that fits a surface to an input mesh. VSDM minimizes an objective function that corresponds to a Voronoi-based approximation of the overall squared distance function
Fitting polynomial surfaces to triangular meshes with Voronoi squared distance minimization
Nivoliers, Vincent; Yan, Dongming; Lé vy, Bruno L.
2012-01-01
This paper introduces Voronoi squared distance minimization (VSDM), an algorithm that fits a surface to an input mesh. VSDM minimizes an objective function that corresponds to a Voronoi-based approximation of the overall squared distance function
Computing the Fréchet distance between folded polygons
Cook IV, A.F.; Driemel, A.; Sherette, J.; Wenk, C.
2015-01-01
Computing the Fréchet distance for surfaces is a surprisingly hard problem and the only known polynomial-time algorithm is limited to computing it between flat surfaces. We study the problem of computing the Fréchet distance for a class of non-flat surfaces called folded polygons. We present a
Classification of Multichannel ECG Signals Using a Cross-Distance Analysis
National Research Council Canada - National Science Library
Shahram, Morteza
2001-01-01
This paper presents a multi-stage algorithm for multi-channel ECG beat classification into normal and abnormal categories using a sequential beat clustering and a cross- distance analysis algorithm...
SIFT based algorithm for point feature tracking
Directory of Open Access Journals (Sweden)
Adrian BURLACU
2007-12-01
Full Text Available In this paper a tracking algorithm for SIFT features in image sequences is developed. For each point feature extracted using SIFT algorithm a descriptor is computed using information from its neighborhood. Using an algorithm based on minimizing the distance between two descriptors tracking point features throughout image sequences is engaged. Experimental results, obtained from image sequences that capture scaling of different geometrical type object, reveal the performances of the tracking algorithm.
e-DMDAV: A new privacy preserving algorithm for wearable enterprise information systems
Zhang, Zhenjiang; Wang, Xiaoni; Uden, Lorna; Zhang, Peng; Zhao, Yingsi
2018-04-01
Wearable devices have been widely used in many fields to improve the quality of people's lives. More and more data on individuals and businesses are collected by statistical organizations though those devices. Almost all of this data holds confidential information. Statistical Disclosure Control (SDC) seeks to protect statistical data in such a way that it can be released without giving away confidential information that can be linked to specific individuals or entities. The MDAV (Maximum Distance to Average Vector) algorithm is an efficient micro-aggregation algorithm belonging to SDC. However, the MDAV algorithm cannot survive homogeneity and background knowledge attacks because it was designed for static numerical data. This paper proposes a systematic dynamic-updating anonymity algorithm based on MDAV called the e-DMDAV algorithm. This algorithm introduces a new parameter and a table to ensure that the k records in one cluster with the range of the distinct values in each cluster is no less than e for numerical and non-numerical datasets. This new algorithm has been evaluated and compared with the MDAV algorithm. The simulation results show that the new algorithm outperforms MDAV in terms of minimizing distortion and disclosure risk with a similar computational cost.
Motivation in Distance Leaming
Directory of Open Access Journals (Sweden)
Daniela Brečko
1996-12-01
Full Text Available It is estimated that motivation is one of the most important psychological functions making it possible for people to leam even in conditions that do not meet their needs. In distance learning, a form of autonomous learning, motivation is of outmost importance. When adopting this method in learning an individual has to stimulate himself and take learning decisions on his or her own. These specific characteristics of distance learning should be taken into account. This all different factors maintaining the motivation of participants in distance learning are to be included. Moreover, motivation in distance learning can be stimulated with specific learning materials, clear instructions and guide-lines, an efficient feed back, personal contact between tutors and participants, stimulating learning letters, telephone calls, encouraging letters and through maintaining a positive relationship between tutor and participant.
Energy Technology Data Exchange (ETDEWEB)
Lambourne, Robert [Department of Physics and Astronomy, Open University, Milton Keynes (United Kingdom)
2005-11-01
This paper examines the challenges and rewards that can arise when the teaching of Einsteinian physics has to be accomplished by means of distance education. The discussion is mainly based on experiences gathered over the past 35 years at the UK Open University, where special and general relativity, relativistic cosmology and other aspects of Einsteinian physics, have been taught at a variety of levels, and using a range of techniques, to students studying at a distance.
Long distance quantum teleportation
Xia, Xiu-Xiu; Sun, Qi-Chao; Zhang, Qiang; Pan, Jian-Wei
2018-01-01
Quantum teleportation is a core protocol in quantum information science. Besides revealing the fascinating feature of quantum entanglement, quantum teleportation provides an ultimate way to distribute quantum state over extremely long distance, which is crucial for global quantum communication and future quantum networks. In this review, we focus on the long distance quantum teleportation experiments, especially those employing photonic qubits. From the viewpoint of real-world application, both the technical advantages and disadvantages of these experiments are discussed.
Stereo vision with distance and gradient recognition
Kim, Soo-Hyun; Kang, Suk-Bum; Yang, Tae-Kyu
2007-12-01
Robot vision technology is needed for the stable walking, object recognition and the movement to the target spot. By some sensors which use infrared rays and ultrasonic, robot can overcome the urgent state or dangerous time. But stereo vision of three dimensional space would make robot have powerful artificial intelligence. In this paper we consider about the stereo vision for stable and correct movement of a biped robot. When a robot confront with an inclination plane or steps, particular algorithms are needed to go on without failure. This study developed the recognition algorithm of distance and gradient of environment by stereo matching process.
Decoding Hermitian Codes with Sudan's Algorithm
DEFF Research Database (Denmark)
Høholdt, Tom; Nielsen, Rasmus Refslund
1999-01-01
We present an efficient implementation of Sudan's algorithm for list decoding Hermitian codes beyond half the minimum distance. The main ingredients are an explicit method to calculate so-called increasing zero bases, an efficient interpolation algorithm for finding the Q-polynomial, and a reduct......We present an efficient implementation of Sudan's algorithm for list decoding Hermitian codes beyond half the minimum distance. The main ingredients are an explicit method to calculate so-called increasing zero bases, an efficient interpolation algorithm for finding the Q...
A Foundation for Efficient Indoor Distance-Aware Query Processing
DEFF Research Database (Denmark)
Lu, Hua; Cao, Xin; Jensen, Christian Søndergaard
2012-01-01
model that integrates indoor distance seamlessly. To enable the use of the model as a foundation for query processing, we develop accompanying, efficient algorithms that compute indoor distances for different indoor entities like doors as well as locations. We also propose an indexing framework......Indoor spaces accommodate large numbers of spatial objects, e.g., points of interest (POIs), and moving populations. A variety of services, e.g., location-based services and security control, are relevant to indoor spaces. Such services can be improved substantially if they are capable of utilizing...... that accommodates indoor distances that are pre-computed using the proposed algorithms. On top of this foundation, we develop efficient algorithms for typical indoor, distance-aware queries. The results of an extensive experimental evaluation demonstrate the efficacy of the proposals....
International Nuclear Information System (INIS)
Jain, Aman; Sharma, Shivam; Parasher, Abhishek
2014-01-01
Radiation dose measurement, field of radiobiology, is considered to be critical factor for optimizing radiation protection to the health care practitioners, patients and the public. This lead to equipment that has dose - area product meters permanently installed. In many countries and even institution, the range of equipment is vast and with the opportunity for radiation protection and dose recording varies considerably. Practitioners must move with the changed demands of radiation protection but in many cases without assistance of modern advancements in technology Keeping the three basic safety measures Time, Dose and Shielding we can say 'Optimum dose is safe dose' instead of 'No dose is safe dose'. The purpose enclosed within the title 'Radiation Protection'. The use of radiation is expanding widely everyday around the world and crossing boundaries of medical imaging, diagnostic and. The way to get the ''As low as reasonably achievable' is only achievable by using methodology of radiation protection and to bring the concern of general public and practitioners over the hazards of un-necessary radiation dose. Three basic principles of radiation protection are time, distance and shielding. By minimizing the exposure time increasing the distance and including the shielding we can reduce the optimum range of dose. The ability of shielding material to attenuate radiation is generally given as half value layer. This is the thickness of the material which will reduce the amount of radiation by 50%. Lab coat and gloves must be worn when handling radioactive material or when working in a labeled radiation work area. Safety glasses or other appropriate splash shields should be used when handling radioactive material. 1. Reached to low dose level to occupational workers, public as per prescribed dose limit. 2. By mean of ALARA principle we achieved the protection from radiation besides us using the radiation for our benefit
Mahalanobis Distance Based Iterative Closest Point
DEFF Research Database (Denmark)
Hansen, Mads Fogtmann; Blas, Morten Rufus; Larsen, Rasmus
2007-01-01
the notion of a mahalanobis distance map upon a point set with associated covariance matrices which in addition to providing correlation weighted distance implicitly provides a method for assigning correspondence during alignment. This distance map provides an easy formulation of the ICP problem that permits...... a fast optimization. Initially, the covariance matrices are set to the identity matrix, and all shapes are aligned to a randomly selected shape (equivalent to standard ICP). From this point the algorithm iterates between the steps: (a) obtain mean shape and new estimates of the covariance matrices from...... the aligned shapes, (b) align shapes to the mean shape. Three different methods for estimating the mean shape with associated covariance matrices are explored in the paper. The proposed methods are validated experimentally on two separate datasets (IMM face dataset and femur-bones). The superiority of ICP...
DEFF Research Database (Denmark)
Hansen, Finn J. S.; Clausen, Christian
2001-01-01
The case study represents an example of a top-down introduction of distance teaching as part of Danish trials with the introduction of multimedia in education. The study is concerned with the background, aim and context of the trial as well as the role and working of the technology and the organi......The case study represents an example of a top-down introduction of distance teaching as part of Danish trials with the introduction of multimedia in education. The study is concerned with the background, aim and context of the trial as well as the role and working of the technology...
Theoretical Principles of Distance Education.
Keegan, Desmond, Ed.
This book contains the following papers examining the didactic, academic, analytic, philosophical, and technological underpinnings of distance education: "Introduction"; "Quality and Access in Distance Education: Theoretical Considerations" (D. Randy Garrison); "Theory of Transactional Distance" (Michael G. Moore);…
Fast Computing for Distance Covariance
Huo, Xiaoming; Szekely, Gabor J.
2014-01-01
Distance covariance and distance correlation have been widely adopted in measuring dependence of a pair of random variables or random vectors. If the computation of distance covariance and distance correlation is implemented directly accordingly to its definition then its computational complexity is O($n^2$) which is a disadvantage compared to other faster methods. In this paper we show that the computation of distance covariance and distance correlation of real valued random variables can be...
Distance Adaptive Tensor Discriminative Geometry Preserving Projection for Face Recognition
Directory of Open Access Journals (Sweden)
Ziqiang Wang
2012-09-01
Full Text Available There is a growing interest in dimensionality reduction techniques for face recognition, however, the traditional dimensionality reduction algorithms often transform the input face image data into vectors before embedding. Such vectorization often ignores the underlying data structure and leads to higher computational complexity. To effectively cope with these problems, a novel dimensionality reduction algorithm termed distance adaptive tensor discriminative geometry preserving projection (DATDGPP is proposed in this paper. The key idea of DATDGPP is as follows: first, the face image data are directly encoded in high-order tensor structure so that the relationships among the face image data can be preserved; second, the data-adaptive tensor distance is adopted to model the correlation among different coordinates of tensor data; third, the transformation matrix which can preserve discrimination and local geometry information is obtained by an iteration algorithm. Experimental results on three face databases show that the proposed algorithm outperforms other representative dimensionality reduction algorithms.
Planning with Reachable Distances
Tang, Xinyu; Thomas, Shawna; Amato, Nancy M.
2009-01-01
reachable distance space (RD-space), in which all configurations lie in the set of constraint-satisfying subspaces. This enables us to directly sample the constrained subspaces with complexity linear in the robot's number of degrees of freedom. In addition
DEFF Research Database (Denmark)
Jensen, Hanne Louise; de Neergaard, Maja
2016-01-01
De-severing Distance This paper draws on the growing body of mobility literature that shows how mobility can be viewed as meaningful everyday practices (Freudendal –Pedersen 2007, Cresswell 2006) this paper examines how Heidegger’s term de-severing can help us understand the everyday coping with ...
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
Electromagnetic distance measurement
1967-01-01
This book brings together the work of forty-eight geodesists from twenty-five countries. They discuss various new electromagnetic distance measurement (EDM) instruments - among them the Tellurometer, Geodimeter, and air- and satellite-borne systems - and investigate the complex sources of error.
Determining average yarding distance.
Roger H. Twito; Charles N. Mann
1979-01-01
Emphasis on environmental and esthetic quality in timber harvesting has brought about increased use of complex boundaries of cutting units and a consequent need for a rapid and accurate method of determining the average yarding distance and area of these units. These values, needed for evaluation of road and landing locations in planning timber harvests, are easily and...
Rahman, Monsurur; Karim, Reza; Byramjee, Framarz
2015-01-01
Many educational institutions in the United States are currently offering programs through distance learning, and that trend is rising. In almost all spheres of education a developing country like Bangladesh needs to make available the expertise of the most qualified faculty to her distant people. But the fundamental question remains as to whether…
DEFF Research Database (Denmark)
Pedersen, Knud Ole Helgesen
1999-01-01
A method for implementing a digital distance relay in the power system is described.Instructions are given on how to program this relay on a 80537 based microcomputer system.The problem is used as a practical case study in the course 53113: Micocomputer applications in the power system.The relay...
Dehghan, Azad; Kovacevic, Aleksandar; Karystianis, George; Keane, John A; Nenadic, Goran
2017-11-01
De-identification of clinical narratives is one of the main obstacles to making healthcare free text available for research. In this paper we describe our experience in expanding and tailoring two existing tools as part of the 2016 CEGS N-GRID Shared Tasks Track 1, which evaluated de-identification methods on a set of psychiatric evaluation notes for up to 25 different types of Protected Health Information (PHI). The methods we used rely on machine learning on either a large or small feature space, with additional strategies, including two-pass tagging and multi-class models, which both proved to be beneficial. The results show that the integration of the proposed methods can identify Health Information Portability and Accountability Act (HIPAA) defined PHIs with overall F 1 -scores of ∼90% and above. Yet, some classes (Profession, Organization) proved again to be challenging given the variability of expressions used to reference given information. Copyright © 2017. Published by Elsevier Inc.
Orcutt, John M.; Brenton, James C.
2016-01-01
The methodology and the results of the quality control (QC) process of the meteorological data from the Lightning Protection System (LPS) towers located at Kennedy Space Center (KSC) launch complex 39B (LC-39B) are documented in this paper. Meteorological data are used to design a launch vehicle, determine operational constraints, and to apply defined constraints on day-of-launch (DOL). In order to properly accomplish these tasks, a representative climatological database of meteorological records is needed because the database needs to represent the climate the vehicle will encounter. Numerous meteorological measurement towers exist at KSC; however, the engineering tasks need measurements at specific heights, some of which can only be provided by a few towers. Other than the LPS towers, Tower 313 is the only tower that provides observations up to 150 m. This tower is located approximately 3.5 km from LC-39B. In addition, data need to be QC'ed to remove erroneous reports that could pollute the results of an engineering analysis, mislead the development of operational constraints, or provide a false image of the atmosphere at the tower's location.
A Distance Measure for Genome Phylogenetic Analysis
Cao, Minh Duc; Allison, Lloyd; Dix, Trevor
Phylogenetic analyses of species based on single genes or parts of the genomes are often inconsistent because of factors such as variable rates of evolution and horizontal gene transfer. The availability of more and more sequenced genomes allows phylogeny construction from complete genomes that is less sensitive to such inconsistency. For such long sequences, construction methods like maximum parsimony and maximum likelihood are often not possible due to their intensive computational requirement. Another class of tree construction methods, namely distance-based methods, require a measure of distances between any two genomes. Some measures such as evolutionary edit distance of gene order and gene content are computational expensive or do not perform well when the gene content of the organisms are similar. This study presents an information theoretic measure of genetic distances between genomes based on the biological compression algorithm expert model. We demonstrate that our distance measure can be applied to reconstruct the consensus phylogenetic tree of a number of Plasmodium parasites from their genomes, the statistical bias of which would mislead conventional analysis methods. Our approach is also used to successfully construct a plausible evolutionary tree for the γ-Proteobacteria group whose genomes are known to contain many horizontally transferred genes.
Principles of Radiation Protection Concepts
International Nuclear Information System (INIS)
Abd Aziz Mhd Ramli
2004-01-01
The contents of this chapter are follows - Radiation Protection Concepts: justification, dose limitation, optimisation, potential exposures, situation requiring intervention; Special Considerations. Protection from Radiation Hazards, Remove the Hazard, Prevent the Hazard, Guard the Worker, Implementation of Radiation Protection and Safety Measures, Distance, Shielding, Time, Monitoring Programme, Safety System. Radiation Protection in Radiological Service: Specific Requirement in Diagnostic Radiological Service
Named Entity Linking Algorithm
Directory of Open Access Journals (Sweden)
M. F. Panteleev
2017-01-01
Full Text Available In the tasks of processing text in natural language, Named Entity Linking (NEL represents the task to define and link some entity, which is found in the text, with some entity in the knowledge base (for example, Dbpedia. Currently, there is a diversity of approaches to solve this problem, but two main classes can be identified: graph-based approaches and machine learning-based ones. Graph and Machine Learning approaches-based algorithm is proposed accordingly to the stated assumptions about the interrelations of named entities in a sentence and in general.In the case of graph-based approaches, it is necessary to solve the problem of identifying an optimal set of the related entities according to some metric that characterizes the distance between these entities in a graph built on some knowledge base. Due to limitations in processing power, to solve this task directly is impossible. Therefore, its modification is proposed. Based on the algorithms of machine learning, an independent solution cannot be built due to small volumes of training datasets relevant to NEL task. However, their use can contribute to improving the quality of the algorithm. The adaptation of the Latent Dirichlet Allocation model is proposed in order to obtain a measure of the compatibility of attributes of various entities encountered in one context.The efficiency of the proposed algorithm was experimentally tested. A test dataset was independently generated. On its basis the performance of the model was compared using the proposed algorithm with the open source product DBpedia Spotlight, which solves the NEL problem.The mockup, based on the proposed algorithm, showed a low speed as compared to DBpedia Spotlight. However, the fact that it has shown higher accuracy, stipulates the prospects for work in this direction.The main directions of development were proposed in order to increase the accuracy of the system and its productivity.
THE EXTRAGALACTIC DISTANCE DATABASE
International Nuclear Information System (INIS)
Tully, R. Brent; Courtois, Helene M.; Jacobs, Bradley A.; Rizzi, Luca; Shaya, Edward J.; Makarov, Dmitry I.
2009-01-01
A database can be accessed on the Web at http://edd.ifa.hawaii.edu that was developed to promote access to information related to galaxy distances. The database has three functional components. First, tables from many literature sources have been gathered and enhanced with links through a distinct galaxy naming convention. Second, comparisons of results both at the levels of parameters and of techniques have begun and are continuing, leading to increasing homogeneity and consistency of distance measurements. Third, new material is presented arising from ongoing observational programs at the University of Hawaii 2.2 m telescope, radio telescopes at Green Bank, Arecibo, and Parkes and with the Hubble Space Telescope. This new observational material is made available in tandem with related material drawn from archives and passed through common analysis pipelines.
Capachi, Casey
2013-01-01
Distance to Cure A three-part television series by Casey Capachi www.distancetocure.com Abstract How far would you go for health care? This three-part television series, featuring two introductory segments between each piece, focuses on the physical, cultural, and political obstacles facing rural Native American patients and the potential of health technology to break down those barriers to care. Part one,Telemedici...
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.
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.
Empirical study of parallel LRU simulation algorithms
Carr, Eric; Nicol, David M.
1994-01-01
This paper reports on the performance of five parallel algorithms for simulating a fully associative cache operating under the LRU (Least-Recently-Used) replacement policy. Three of the algorithms are SIMD, and are implemented on the MasPar MP-2 architecture. Two other algorithms are parallelizations of an efficient serial algorithm on the Intel Paragon. One SIMD algorithm is quite simple, but its cost is linear in the cache size. The two other SIMD algorithm are more complex, but have costs that are independent on the cache size. Both the second and third SIMD algorithms compute all stack distances; the second SIMD algorithm is completely general, whereas the third SIMD algorithm presumes and takes advantage of bounds on the range of reference tags. Both MIMD algorithm implemented on the Paragon are general and compute all stack distances; they differ in one step that may affect their respective scalability. We assess the strengths and weaknesses of these algorithms as a function of problem size and characteristics, and compare their performance on traces derived from execution of three SPEC benchmark programs.
On Computing Breakpoint Distances for Genomes with Duplicate Genes.
Shao, Mingfu; Moret, Bernard M E
2017-06-01
A fundamental problem in comparative genomics is to compute the distance between two genomes in terms of its higher level organization (given by genes or syntenic blocks). For two genomes without duplicate genes, we can easily define (and almost always efficiently compute) a variety of distance measures, but the problem is NP-hard under most models when genomes contain duplicate genes. To tackle duplicate genes, three formulations (exemplar, maximum matching, and any matching) have been proposed, all of which aim to build a matching between homologous genes so as to minimize some distance measure. Of the many distance measures, the breakpoint distance (the number of nonconserved adjacencies) was the first one to be studied and remains of significant interest because of its simplicity and model-free property. The three breakpoint distance problems corresponding to the three formulations have been widely studied. Although we provided last year a solution for the exemplar problem that runs very fast on full genomes, computing optimal solutions for the other two problems has remained challenging. In this article, we describe very fast, exact algorithms for these two problems. Our algorithms rely on a compact integer-linear program that we further simplify by developing an algorithm to remove variables, based on new results on the structure of adjacencies and matchings. Through extensive experiments using both simulations and biological data sets, we show that our algorithms run very fast (in seconds) on mammalian genomes and scale well beyond. We also apply these algorithms (as well as the classic orthology tool MSOAR) to create orthology assignment, then compare their quality in terms of both accuracy and coverage. We find that our algorithm for the "any matching" formulation significantly outperforms other methods in terms of accuracy while achieving nearly maximum coverage.
International Nuclear Information System (INIS)
Creutz, M.
1987-11-01
A large variety of Monte Carlo algorithms are being used for lattice gauge simulations. For purely bosonic theories, present approaches are generally adequate; nevertheless, overrelaxation techniques promise savings by a factor of about three in computer time. For fermionic fields the situation is more difficult and less clear. Algorithms which involve an extrapolation to a vanishing step size are all quite closely related. Methods which do not require such an approximation tend to require computer time which grows as the square of the volume of the system. Recent developments combining global accept/reject stages with Langevin or microcanonical updatings promise to reduce this growth to V/sup 4/3/
Hu, T C
2002-01-01
Newly enlarged, updated second edition of a valuable text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discusses binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. 153 black-and-white illus. 23 tables.Newly enlarged, updated second edition of a valuable, widely used text presents algorithms for shortest paths, maximum flows, dynamic programming and backtracking. Also discussed are binary trees, heuristic and near optimums, matrix multiplication, and NP-complete problems. New to this edition: Chapter 9
Relativistic distances, sizes, lengths
International Nuclear Information System (INIS)
Strel'tsov, V.N.
1992-01-01
Such notion as light or retarded distance, field size, formation way, visible size of a body, relativistic or radar length and wave length of light from a moving atom are considered. The relation between these notions is cleared up, their classification is given. It is stressed that the formation way is defined by the field size of a moving particle. In the case of the electromagnetic field, longitudinal sizes increase proportionally γ 2 with growing charge velocity (γ is the Lorentz-factor). 18 refs
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
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
Distance collaborations with industry
Energy Technology Data Exchange (ETDEWEB)
Peskin, A.; Swyler, K.
1998-06-01
The college industry relationship has been identified as a key policy issue in Engineering Education. Collaborations between academic institutions and the industrial sector have a long history and a bright future. For Engineering and Engineering Technology programs in particular, industry has played a crucial role in many areas including advisement, financial support, and practical training of both faculty and students. Among the most important and intimate interactions are collaborative projects and formal cooperative education arrangements. Most recently, such collaborations have taken on a new dimension, as advances in technology have made possible meaningful technical collaboration at a distance. There are several obvious technology areas that have contributed significantly to this trend. Foremost is the ubiquitous presence of the Internet. Perhaps almost as important are advances in computer based imaging. Because visual images offer a compelling user experience, it affords greater knowledge transfer efficiency than other modes of delivery. Furthermore, the quality of the image appears to have a strongly correlated effect on insight. A good visualization facility offers both a means for communication and a shared information space for the subjects, which are among the essential features of both peer collaboration and distance learning.
Directory of Open Access Journals (Sweden)
Anna Bourmistrova
2011-02-01
Full Text Available The autodriver algorithm is an intelligent method to eliminate the need of steering by a driver on a well-defined road. The proposed method performs best on a four-wheel steering (4WS vehicle, though it is also applicable to two-wheel-steering (TWS vehicles. The algorithm is based on coinciding the actual vehicle center of rotation and road center of curvature, by adjusting the kinematic center of rotation. The road center of curvature is assumed prior information for a given road, while the dynamic center of rotation is the output of dynamic equations of motion of the vehicle using steering angle and velocity measurements as inputs. We use kinematic condition of steering to set the steering angles in such a way that the kinematic center of rotation of the vehicle sits at a desired point. At low speeds the ideal and actual paths of the vehicle are very close. With increase of forward speed the road and tire characteristics, along with the motion dynamics of the vehicle cause the vehicle to turn about time-varying points. By adjusting the steering angles, our algorithm controls the dynamic turning center of the vehicle so that it coincides with the road curvature center, hence keeping the vehicle on a given road autonomously. The position and orientation errors are used as feedback signals in a closed loop control to adjust the steering angles. The application of the presented autodriver algorithm demonstrates reliable performance under different driving conditions.
Overlapping community detection based on link graph using distance dynamics
Chen, Lei; Zhang, Jing; Cai, Li-Jun
2018-01-01
The distance dynamics model was recently proposed to detect the disjoint community of a complex network. To identify the overlapping structure of a network using the distance dynamics model, an overlapping community detection algorithm, called L-Attractor, is proposed in this paper. The process of L-Attractor mainly consists of three phases. In the first phase, L-Attractor transforms the original graph to a link graph (a new edge graph) to assure that one node has multiple distances. In the second phase, using the improved distance dynamics model, a dynamic interaction process is introduced to simulate the distance dynamics (shrink or stretch). Through the dynamic interaction process, all distances converge, and the disjoint community structure of the link graph naturally manifests itself. In the third phase, a recovery method is designed to convert the disjoint community structure of the link graph to the overlapping community structure of the original graph. Extensive experiments are conducted on the LFR benchmark networks as well as real-world networks. Based on the results, our algorithm demonstrates higher accuracy and quality than other state-of-the-art algorithms.
Distance Ranging Based on Quantum Entanglement
International Nuclear Information System (INIS)
Xiao Jun-Jun; Han Xiao-Chun; Zeng Gui-Hua; Fang Chen; Zhao Jian-Kang
2013-01-01
In the quantum metrology, applications of quantum techniques based on entanglement bring in some better performances than conventional approaches. We experimentally investigate an application of entanglement in accurate ranging based on the second-order coherence in the time domain. By a fitting algorithm in the data processing, the optimization results show a precision of ±200 μm at a distance of 1043.3m. In addition, the influence of jamming noise on the ranging scheme is studied. With some different fitting parameters, the result shows that the proposed scheme has a powerful anti-jamming capability for white noise
Antirandom Testing: A Distance-Based Approach
Directory of Open Access Journals (Sweden)
Shen Hui Wu
2008-01-01
Full Text Available Random testing requires each test to be selected randomly regardless of the tests previously applied. This paper introduces the concept of antirandom testing where each test applied is chosen such that its total distance from all previous tests is maximum. This spans the test vector space to the maximum extent possible for a given number of vectors. An algorithm for generating antirandom tests is presented. Compared with traditional pseudorandom testing, antirandom testing is found to be very effective when a high-fault coverage needs to be achieved with a limited number of test vectors. The superiority of the new approach is even more significant for testing bridging faults.
DEFF Research Database (Denmark)
Stidsen, Thomas K.; Kjærulff, Peter
2005-01-01
In this paper we present a new protection method: Complete Rerouting. This is the most capacity e cient protection method for circuit switched networks and it is, to the best of our knowledge, the first time it has been described. We implement a column generation algorithm and test the performance...
Protecting genomic sequence anonymity with generalization lattices.
Malin, B A
2005-01-01
Current genomic privacy technologies assume the identity of genomic sequence data is protected if personal information, such as demographics, are obscured, removed, or encrypted. While demographic features can directly compromise an individual's identity, recent research demonstrates such protections are insufficient because sequence data itself is susceptible to re-identification. To counteract this problem, we introduce an algorithm for anonymizing a collection of person-specific DNA sequences. The technique is termed DNA lattice anonymization (DNALA), and is based upon the formal privacy protection schema of k -anonymity. Under this model, it is impossible to observe or learn features that distinguish one genetic sequence from k-1 other entries in a collection. To maximize information retained in protected sequences, we incorporate a concept generalization lattice to learn the distance between two residues in a single nucleotide region. The lattice provides the most similar generalized concept for two residues (e.g. adenine and guanine are both purines). The method is tested and evaluated with several publicly available human population datasets ranging in size from 30 to 400 sequences. Our findings imply the anonymization schema is feasible for the protection of sequences privacy. The DNALA method is the first computational disclosure control technique for general DNA sequences. Given the computational nature of the method, guarantees of anonymity can be formally proven. There is room for improvement and validation, though this research provides the groundwork from which future researchers can construct genomics anonymization schemas tailored to specific datasharing scenarios.
Improved autonomous star identification algorithm
International Nuclear Information System (INIS)
Luo Li-Yan; Xu Lu-Ping; Zhang Hua; Sun Jing-Rong
2015-01-01
The log–polar transform (LPT) is introduced into the star identification because of its rotation invariance. An improved autonomous star identification algorithm is proposed in this paper to avoid the circular shift of the feature vector and to reduce the time consumed in the star identification algorithm using LPT. In the proposed algorithm, the star pattern of the same navigation star remains unchanged when the stellar image is rotated, which makes it able to reduce the star identification time. The logarithmic values of the plane distances between the navigation and its neighbor stars are adopted to structure the feature vector of the navigation star, which enhances the robustness of star identification. In addition, some efforts are made to make it able to find the identification result with fewer comparisons, instead of searching the whole feature database. The simulation results demonstrate that the proposed algorithm can effectively accelerate the star identification. Moreover, the recognition rate and robustness by the proposed algorithm are better than those by the LPT algorithm and the modified grid algorithm. (paper)
Interactive Distance Learning in Connecticut.
Pietras, Jesse John; Murphy, Robert J.
This paper provides an overview of distance learning activities in Connecticut and addresses the feasibility of such activities. Distance education programs have evolved from the one dimensional electronic mail systems to the use of sophisticated digital fiber networks. The Middlesex Distance Learning Consortium has developed a long-range plan to…
Distance covariance for stochastic processes
DEFF Research Database (Denmark)
Matsui, Muneya; Mikosch, Thomas Valentin; Samorodnitsky, Gennady
2017-01-01
The distance covariance of two random vectors is a measure of their dependence. The empirical distance covariance and correlation can be used as statistical tools for testing whether two random vectors are independent. We propose an analog of the distance covariance for two stochastic processes...
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.
DEFF Research Database (Denmark)
Markham, Annette
This paper takes an actor network theory approach to explore some of the ways that algorithms co-construct identity and relational meaning in contemporary use of social media. Based on intensive interviews with participants as well as activity logging and data tracking, the author presents a richly...... layered set of accounts to help build our understanding of how individuals relate to their devices, search systems, and social network sites. This work extends critical analyses of the power of algorithms in implicating the social self by offering narrative accounts from multiple perspectives. It also...... contributes an innovative method for blending actor network theory with symbolic interaction to grapple with the complexity of everyday sensemaking practices within networked global information flows....
Estimating plant distance in maize using Unmanned Aerial Vehicle (UAV).
Zhang, Jinshui; Basso, Bruno; Price, Richard F; Putman, Gregory; Shuai, Guanyuan
2018-01-01
Distance between rows and plants are essential parameters that affect the final grain yield in row crops. This paper presents the results of research intended to develop a novel method to quantify the distance between maize plants at field scale using an Unmanned Aerial Vehicle (UAV). Using this method, we can recognize maize plants as objects and calculate the distance between plants. We initially developed our method by training an algorithm in an indoor facility with plastic corn plants. Then, the method was scaled up and tested in a farmer's field with maize plant spacing that exhibited natural variation. The results of this study demonstrate that it is possible to precisely quantify the distance between maize plants. We found that accuracy of the measurement of the distance between maize plants depended on the height above ground level at which UAV imagery was taken. This study provides an innovative approach to quantify plant-to-plant variability and, thereby final crop yield estimates.
On the Scalability of Computing Triplet and Quartet Distances
DEFF Research Database (Denmark)
Holt, Morten Kragelund; Johansen, Jens; Brodal, Gerth Stølting
2014-01-01
We present the first I/O- and practically-efficient algorithm for simplifying a planar subdivision, such that no point is moved more than a given distance εxy and such that neighbor relations between faces (homotopy) are preserved. Under some practically realistic assumptions, our algorithm uses ....... For example, for the contour map simplification problem it is significantly faster than the previous algorithm, while obtaining approximately the same simplification factor. Read More: http://epubs.siam.org/doi/abs/10.1137/1.9781611973198.3...
Institute of Scientific and Technical Information of China (English)
刘军; 李生舟; 姚明柱
2017-01-01
This paper takes the remote lower protective layer 11# coal seam mining to protect main 3# coal seam as the research object in Songshuping Coal Mine.It is concluded that it is reasonable to arrange 3314 floor gas drainage roadway at the bottom 15 m of the 3# coal seam through arranging through beds grid format upholes in floor roadway to extract the protective layer and carry out pressure relief gas.The actual extraction data show that during the mining of the long-distance protective layer,the influence of the mining can effectively relieve the pressure and improve the permeability of the protective layer.The pre-pumping rate of the drainage area is about 65.6％.According to the effect analysis of pressure relief gas extraction,11# coal seam after the protection of the working layer in front of 10 m to the protective layer of the face of 60 m within the corresponding overlying 3# coal seam is the best pressure relief gas extraction area.%以桑树坪煤矿远距离下保护层11#煤层开采保护主采3#煤层为研究对象,利用底板巷布置上向穿层网格式钻孔抽采被保护层卸压瓦斯,研究得出将3314底板瓦斯抽放巷布置在3#煤层底部法距15 m处较为合理.实际抽采数据表明,在远距离下保护层开采期间,采动影响能够有效卸压,提高被保护层的透气性,底抽巷预抽区域瓦斯预抽率约为65.6％.从卸压瓦斯抽采效果分析,11#煤层回采后保护层工作面前方10m至保护层工作面后方60 m范围内对应的上覆3#煤层区域为最佳卸压瓦斯抽采区域.
Directory of Open Access Journals (Sweden)
Y. Damchi
2015-09-01
Full Text Available Most studies in relay coordination have focused solely on coordination of overcurrent relays while distance relays are used as the main protection of transmission lines. Since, simultaneous coordination of these two types of relays can provide a better protection, in this paper, a new approach is proposed for simultaneous coordination of distance and directional overcurrent relays (D&DOCRs. Also, pursued by most of the previously published studies, the settings of D&DOCRs are usually determined based on a main network topology which may result in mis-coordination of relays when changes occur in the network topology. In the proposed method, in order to have a robust coordination, network topology changes are taken into account in the coordination problem. In the new formulation, coordination constraints for different network topologies are added to those of the main topology. A complex nonlinear optimization problem is derived to find the desirable relay settings. Then, the problem is solved using hybridized genetic algorithm (GA with linear programming (LP method (HGA. The proposed method is evaluated using the IEEE 14-bus test system. According to the results, a feasible and robust solution is obtained for D&DOCRs coordination while all constraints, which are due to different network topologies, are satisfied.
Planning with Reachable Distances
Tang, Xinyu
2009-01-01
Motion planning for spatially constrained robots is difficult due to additional constraints placed on the robot, such as closure constraints for closed chains or requirements on end effector placement for articulated linkages. It is usually computationally too expensive to apply sampling-based planners to these problems since it is difficult to generate valid configurations. We overcome this challenge by redefining the robot\\'s degrees of freedom and constraints into a new set of parameters, called reachable distance space (RD-space), in which all configurations lie in the set of constraint-satisfying subspaces. This enables us to directly sample the constrained subspaces with complexity linear in the robot\\'s number of degrees of freedom. In addition to supporting efficient sampling, we show that the RD-space formulation naturally supports planning, and in particular, we design a local planner suitable for use by sampling-based planners. We demonstrate the effectiveness and efficiency of our approach for several systems including closed chain planning with multiple loops, restricted end effector sampling, and on-line planning for drawing/sculpting. We can sample single-loop closed chain systems with 1000 links in time comparable to open chain sampling, and we can generate samples for 1000-link multi-loop systems of varying topology in less than a second. © 2009 Springer-Verlag.
Adaptive density trajectory cluster based on time and space distance
Liu, Fagui; Zhang, Zhijie
2017-10-01
There are some hotspot problems remaining in trajectory cluster for discovering mobile behavior regularity, such as the computation of distance between sub trajectories, the setting of parameter values in cluster algorithm and the uncertainty/boundary problem of data set. As a result, based on the time and space, this paper tries to define the calculation method of distance between sub trajectories. The significance of distance calculation for sub trajectories is to clearly reveal the differences in moving trajectories and to promote the accuracy of cluster algorithm. Besides, a novel adaptive density trajectory cluster algorithm is proposed, in which cluster radius is computed through using the density of data distribution. In addition, cluster centers and number are selected by a certain strategy automatically, and uncertainty/boundary problem of data set is solved by designed weighted rough c-means. Experimental results demonstrate that the proposed algorithm can perform the fuzzy trajectory cluster effectively on the basis of the time and space distance, and obtain the optimal cluster centers and rich cluster results information adaptably for excavating the features of mobile behavior in mobile and sociology network.
Casanova, Henri; Robert, Yves
2008-01-01
""…The authors of the present book, who have extensive credentials in both research and instruction in the area of parallelism, present a sound, principled treatment of parallel algorithms. … This book is very well written and extremely well designed from an instructional point of view. … The authors have created an instructive and fascinating text. The book will serve researchers as well as instructors who need a solid, readable text for a course on parallelism in computing. Indeed, for anyone who wants an understandable text from which to acquire a current, rigorous, and broad vi
DEFF Research Database (Denmark)
Gustavson, Fred G.; Reid, John K.; Wasniewski, Jerzy
2007-01-01
We present subroutines for the Cholesky factorization of a positive-definite symmetric matrix and for solving corresponding sets of linear equations. They exploit cache memory by using the block hybrid format proposed by the authors in a companion article. The matrix is packed into n(n + 1)/2 real...... variables, and the speed is usually better than that of the LAPACK algorithm that uses full storage (n2 variables). Included are subroutines for rearranging a matrix whose upper or lower-triangular part is packed by columns to this format and for the inverse rearrangement. Also included is a kernel...
Research on cardiovascular disease prediction based on distance metric learning
Ni, Zhuang; Liu, Kui; Kang, Guixia
2018-04-01
Distance metric learning algorithm has been widely applied to medical diagnosis and exhibited its strengths in classification problems. The k-nearest neighbour (KNN) is an efficient method which treats each feature equally. The large margin nearest neighbour classification (LMNN) improves the accuracy of KNN by learning a global distance metric, which did not consider the locality of data distributions. In this paper, we propose a new distance metric algorithm adopting cosine metric and LMNN named COS-SUBLMNN which takes more care about local feature of data to overcome the shortage of LMNN and improve the classification accuracy. The proposed methodology is verified on CVDs patient vector derived from real-world medical data. The Experimental results show that our method provides higher accuracy than KNN and LMNN did, which demonstrates the effectiveness of the Risk predictive model of CVDs based on COS-SUBLMNN.
Privacy preserving randomized gossip algorithms
Hanzely, Filip; Konečný , Jakub; Loizou, Nicolas; Richtarik, Peter; Grishchenko, Dmitry
2017-01-01
In this work we present three different randomized gossip algorithms for solving the average consensus problem while at the same time protecting the information about the initial private values stored at the nodes. We give iteration complexity bounds for all methods, and perform extensive numerical experiments.
Privacy preserving randomized gossip algorithms
Hanzely, Filip
2017-06-23
In this work we present three different randomized gossip algorithms for solving the average consensus problem while at the same time protecting the information about the initial private values stored at the nodes. We give iteration complexity bounds for all methods, and perform extensive numerical experiments.
Evaluation of odometry algorithm performances using a railway vehicle dynamic model
Allotta, B.; Pugi, L.; Ridolfi, A.; Malvezzi, M.; Vettori, G.; Rindi, A.
2012-05-01
In modern railway Automatic Train Protection and Automatic Train Control systems, odometry is a safety relevant on-board subsystem which estimates the instantaneous speed and the travelled distance of the train; a high reliability of the odometry estimate is fundamental, since an error on the train position may lead to a potentially dangerous overestimation of the distance available for braking. To improve the odometry estimate accuracy, data fusion of different inputs coming from a redundant sensor layout may be used. Simplified two-dimensional models of railway vehicles have been usually used for Hardware in the Loop test rig testing of conventional odometry algorithms and of on-board safety relevant subsystems (like the Wheel Slide Protection braking system) in which the train speed is estimated from the measures of the wheel angular speed. Two-dimensional models are not suitable to develop solutions like the inertial type localisation algorithms (using 3D accelerometers and 3D gyroscopes) and the introduction of Global Positioning System (or similar) or the magnetometer. In order to test these algorithms correctly and increase odometry performances, a three-dimensional multibody model of a railway vehicle has been developed, using Matlab-Simulink™, including an efficient contact model which can simulate degraded adhesion conditions (the development and prototyping of odometry algorithms involve the simulation of realistic environmental conditions). In this paper, the authors show how a 3D railway vehicle model, able to simulate the complex interactions arising between different on-board subsystems, can be useful to evaluate the odometry algorithm and safety relevant to on-board subsystem performances.
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)
Koneman, Elmer; Gade, Wayne
2002-01-01
GermWare Mycology is an image-rich, CD-ROM-based instruction divided into tutorial and reference programs. The tutorial program, designed for new students, provides only for sequential progress through each of the subject modules, so that each page of information is seen. In contrast, the reference program allows the more experienced learner with random and direct access to each facet of information. The aspergilli, the agents of chromomycosis, the dermatophytes, the dimorphic fungi, the hyaline molds, the dematiaceous molds, the yeasts, and the zygomyces are divided into separate modules. The tutorial program also includes an opening 'isolation procedures' module, in which details of specimen collection, culture media, and microscopic techniques are presented. The random access program includes system maps separating out each of the fungal species, and flow diagrams allowing an algorithm approach to species identifications. A global map is also included through which each fungal species can be directly accessed by the simple click of the mouse. Random access to information on the ecology, clinical presentations, pathology and therapy of the various mycotic diseases is also a feature of the reference program. A series of self-assessment exercises is included at the end of each module, with immediate 'pop-up' feedback to both correct and incorrect answers. The entire program includes over 2500 screens and over 700 color images and diagrams. GermWare Mycology is available through the Colorado Association for Continuing Medical Laboratory Education (CACMLE), who also can provide continuing education credits for individuals who complete a separate examination. For more information contact CACMLE at (303) 321-1734 or info@cacmle.org.
Are contemporary tourists consuming distance?
DEFF Research Database (Denmark)
Larsen, Gunvor Riber
2012. Background The background for this research, which explores how tourists represent distance and whether or not distance can be said to be consumed by contemporary tourists, is the increasing leisure mobility of people. Travelling for the purpose of visiting friends and relatives is increasing...... of understanding mobility at a conceptual level, and distance matters to people's manifest mobility: how they travel and how far they travel are central elements of their movements. Therefore leisure mobility (indeed all mobility) is the activity of relating across distance, either through actual corporeal...... metric representation. These representations are the focus for this research. Research Aim and Questions The aim of this research is thus to explore how distance is being represented within the context of leisure mobility. Further the aim is to explore how or whether distance is being consumed...
Distance : between deixis and perspectivity
Meermann, Anastasia; Sonnenhauser, Barbara
2015-01-01
Discussing exemplary applications of the notion of distance in linguistic analysis, this paper shows that very different phenomena are described in terms of this concept. It is argued that in order to overcome the problems arising from this mixup, deixis, distance and perspectivity have to be distinguished and their interrelations need to be described. Thereby, distance emerges as part of a recursive process mediating between situation-bound deixis and discourse-level perspectivity. This is i...
Study on estimation of evacuation distances for nuclear emergency
International Nuclear Information System (INIS)
Sato, Sohei; Homma, Toshimitsu
2005-09-01
Japan Atomic Energy Research Institute (JAERI) have conducted the analytical studies on the Probabilistic Safety Assessment (PSA), the severe accidents, and the optimization of protective actions. Based on the results of these studies, JAERI are investigating the method for taking urgent protective actions more reasonably. If an accident occurs in a nuclear power plant (NPP), early protective actions are carried out. To implement these actions more effectively, emergency preparedness and emergency planning are important, and especially prompt evacuation is expected to reduce a large amount of radiation exposures. To examine the effect of early protective measures by using a PSA method, estimation of the parameter uncertainty related in the time for early protective actions is needed. For this purpose, we have developed an analytical method for urgent protective actions using geographic information, and estimated the movement distance based on gathering points arrangement an population distribution. For this analysis, we used the gathering point data shown on each regional plans for disaster prevention which will be used in actual emergency situation and targeted the population inside Emergency Planning Zone (EPZ). By applying this method for the existing sixteen commercial NPP sites, we estimated the average value and distribution of the movement distance for each sites. This report provides a brief description of the method for estimating the movement distance, input data for this analysis, and the result. Moreover, the problem on the method of evacuation distance analysis and usefulness of this method for emergency planning were discussed. (author)
DEFF Research Database (Denmark)
Stidsen, Thomas K.; Kjærulff, Peter
2006-01-01
Protection of communication against network failures is becoming increasingly important and in this paper we present the most capacity efficient protection method possible, the complete rerouting protection method, when requiring that all communication should be restored in case of a single link...... network failure. We present a linear programming model of the protection method and a column generation algorithm. For 6 real world networks, the minimal restoration overbuild network capacity is between 13% and 78%. We further study the importance of the density of the network, derive analytical bounds...
Improved Iris Recognition through Fusion of Hamming Distance and Fragile Bit Distance.
Hollingsworth, Karen P; Bowyer, Kevin W; Flynn, Patrick J
2011-12-01
The most common iris biometric algorithm represents the texture of an iris using a binary iris code. Not all bits in an iris code are equally consistent. A bit is deemed fragile if its value changes across iris codes created from different images of the same iris. Previous research has shown that iris recognition performance can be improved by masking these fragile bits. Rather than ignoring fragile bits completely, we consider what beneficial information can be obtained from the fragile bits. We find that the locations of fragile bits tend to be consistent across different iris codes of the same eye. We present a metric, called the fragile bit distance, which quantitatively measures the coincidence of the fragile bit patterns in two iris codes. We find that score fusion of fragile bit distance and Hamming distance works better for recognition than Hamming distance alone. To our knowledge, this is the first and only work to use the coincidence of fragile bit locations to improve the accuracy of matches.
On-the-Fly Computation of Bisimilarity Distances
DEFF Research Database (Denmark)
Bacci, Giorgio; Bacci, Giovanni; Larsen, Kim Guldstrand
2017-01-01
of Desharnais et al. between discrete-time Markov chains as an optimal solution of a linear program that can be solved by using the ellipsoid method. Inspired by their result, we propose a novel linear program characterization to compute the distance in the continuous-time setting. Differently from previous......We propose a distance between continuous-time Markov chains (CTMCs) and study the problem of computing it by comparing three different algorithmic methodologies: iterative, linear program, and on-the-fly. In a work presented at FoSSaCS'12, Chen et al. characterized the bisimilarity distance...... proposals, ours has a number of constraints that is bounded by a polynomial in the size of the CTMC. This, in particular, proves that the distance we propose can be computed in polynomial time. Despite its theoretical importance, the proposed linear program characterization turns out to be inefficient...
Effect of Image Linearization on Normalized Compression Distance
Mortensen, Jonathan; Wu, Jia Jie; Furst, Jacob; Rogers, John; Raicu, Daniela
Normalized Information Distance, based on Kolmogorov complexity, is an emerging metric for image similarity. It is approximated by the Normalized Compression Distance (NCD) which generates the relative distance between two strings by using standard compression algorithms to compare linear strings of information. This relative distance quantifies the degree of similarity between the two objects. NCD has been shown to measure similarity effectively on information which is already a string: genomic string comparisons have created accurate phylogeny trees and NCD has also been used to classify music. Currently, to find a similarity measure using NCD for images, the images must first be linearized into a string, and then compared. To understand how linearization of a 2D image affects the similarity measure, we perform four types of linearization on a subset of the Corel image database and compare each for a variety of image transformations. Our experiment shows that different linearization techniques produce statistically significant differences in NCD for identical spatial transformations.
Energy Technology Data Exchange (ETDEWEB)
McQuinn, Kristen B. W. [University of Texas at Austin, McDonald Observatory, 2515 Speedway, Stop C1400 Austin, TX 78712 (United States); Skillman, Evan D. [Minnesota Institute for Astrophysics, School of Physics and Astronomy, 116 Church Street, SE, University of Minnesota, Minneapolis, MN 55455 (United States); Dolphin, Andrew E. [Raytheon Company, 1151 E. Hermans Road, Tucson, AZ 85756 (United States); Berg, Danielle [Center for Gravitation, Cosmology and Astrophysics, Department of Physics, University of Wisconsin Milwaukee, 1900 East Kenwood Boulevard, Milwaukee, WI 53211 (United States); Kennicutt, Robert, E-mail: kmcquinn@astro.as.utexas.edu [Institute for Astronomy, University of Cambridge, Madingley Road, Cambridge CB3 0HA (United Kingdom)
2016-11-01
M104 (NGC 4594; the Sombrero galaxy) is a nearby, well-studied elliptical galaxy included in scores of surveys focused on understanding the details of galaxy evolution. Despite the importance of observations of M104, a consensus distance has not yet been established. Here, we use newly obtained Hubble Space Telescope optical imaging to measure the distance to M104 based on the tip of the red giant branch (TRGB) method. Our measurement yields the distance to M104 to be 9.55 ± 0.13 ± 0.31 Mpc equivalent to a distance modulus of 29.90 ± 0.03 ± 0.07 mag. Our distance is an improvement over previous results as we use a well-calibrated, stable distance indicator, precision photometry in a optimally selected field of view, and a Bayesian maximum likelihood technique that reduces measurement uncertainties. The most discrepant previous results are due to Tully–Fisher method distances, which are likely inappropriate for M104 given its peculiar morphology and structure. Our results are part of a larger program to measure accurate distances to a sample of well-known spiral galaxies (including M51, M74, and M63) using the TRGB method.
Energy Technology Data Exchange (ETDEWEB)
McQuinn, Kristen B. W. [University of Texas at Austin, McDonald Observatory, 2515 Speedway, Stop C1400 Austin, TX 78712 (United States); Skillman, Evan D. [Minnesota Institute for Astrophysics, School of Physics and Astronomy, 116 Church Street, S.E., University of Minnesota, Minneapolis, MN 55455 (United States); Dolphin, Andrew E. [Raytheon Company, 1151 E. Hermans Road, Tucson, AZ 85756 (United States); Berg, Danielle [Center for Gravitation, Cosmology and Astrophysics, Department of Physics, University of Wisconsin Milwaukee, 1900 East Kenwood Boulevard, Milwaukee, WI 53211 (United States); Kennicutt, Robert, E-mail: kmcquinn@astro.as.utexas.edu [Institute for Astronomy, University of Cambridge, Madingley Road, Cambridge CB3 0HA (United Kingdom)
2016-07-20
Great investments of observing time have been dedicated to the study of nearby spiral galaxies with diverse goals ranging from understanding the star formation process to characterizing their dark matter distributions. Accurate distances are fundamental to interpreting observations of these galaxies, yet many of the best studied nearby galaxies have distances based on methods with relatively large uncertainties. We have started a program to derive accurate distances to these galaxies. Here we measure the distance to M51—the Whirlpool galaxy—from newly obtained Hubble Space Telescope optical imaging using the tip of the red giant branch method. We measure the distance modulus to be 8.58 ± 0.10 Mpc (statistical), corresponding to a distance modulus of 29.67 ± 0.02 mag. Our distance is an improvement over previous results as we use a well-calibrated, stable distance indicator, precision photometry in a optimally selected field of view, and a Bayesian Maximum Likelihood technique that reduces measurement uncertainties.
McQuinn, Kristen. B. W.; Skillman, Evan D.; Dolphin, Andrew E.; Berg, Danielle; Kennicutt, Robert
2016-07-01
Great investments of observing time have been dedicated to the study of nearby spiral galaxies with diverse goals ranging from understanding the star formation process to characterizing their dark matter distributions. Accurate distances are fundamental to interpreting observations of these galaxies, yet many of the best studied nearby galaxies have distances based on methods with relatively large uncertainties. We have started a program to derive accurate distances to these galaxies. Here we measure the distance to M51—the Whirlpool galaxy—from newly obtained Hubble Space Telescope optical imaging using the tip of the red giant branch method. We measure the distance modulus to be 8.58 ± 0.10 Mpc (statistical), corresponding to a distance modulus of 29.67 ± 0.02 mag. Our distance is an improvement over previous results as we use a well-calibrated, stable distance indicator, precision photometry in a optimally selected field of view, and a Bayesian Maximum Likelihood technique that reduces measurement uncertainties. Based on observations made with the NASA/ESA Hubble Space Telescope, obtained from the Data Archive at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555.
Distance criterion for hydrogen bond
Indian Academy of Sciences (India)
First page Back Continue Last page Overview Graphics. Distance criterion for hydrogen bond. In a D-H ...A contact, the D...A distance must be less than the sum of van der Waals Radii of the D and A atoms, for it to be a hydrogen bond.
Social Distance and Intergenerational Relations
Kidwell, I. Jane; Booth, Alan
1977-01-01
Questionnaires were administered to a sample of adults to assess the extent of social distance between people of different ages. The findings suggest that the greater the age difference (younger or older) between people, the greater the social distance they feel. (Author)
Quality Content in Distance Education
Yildiz, Ezgi Pelin; Isman, Aytekin
2016-01-01
In parallel with technological advances in today's world of education activities can be conducted without the constraints of time and space. One of the most important of these activities is distance education. The success of the distance education is possible with content quality. The proliferation of e-learning environment has brought a need for…
Virtual Bioinformatics Distance Learning Suite
Tolvanen, Martti; Vihinen, Mauno
2004-01-01
Distance learning as a computer-aided concept allows students to take courses from anywhere at any time. In bioinformatics, computers are needed to collect, store, process, and analyze massive amounts of biological and biomedical data. We have applied the concept of distance learning in virtual bioinformatics to provide university course material…
The Psychology of Psychic Distance
DEFF Research Database (Denmark)
Håkanson, Lars; Ambos, Björn; Schuster, Anja
2016-01-01
and their theoretical underpinnings assume psychic distances to be symmetric. Building on insights from psychology and sociology, this paper demonstrates how national factors and cognitive processes interact in the formation of asymmetric distance perceptions. The results suggest that exposure to other countries...
Cognitive Styles and Distance Education.
Liu, Yuliang; Ginther, Dean
1999-01-01
Considers how to adapt the design of distance education to students' cognitive styles. Discusses cognitive styles, including field dependence versus independence, holistic-analytic, sensory preference, hemispheric preferences, and Kolb's Learning Style Model; and the characteristics of distance education, including technology. (Contains 92…
Distance Learning: Practice and Dilemmas
Tatkovic, Nevenka; Sehanovic, Jusuf; Ruzic, Maja
2006-01-01
In accordance with the European processes of integrated and homogeneous education, the paper presents the essential viewpoints and questions covering the establishment and development of "distance learning" (DL) in Republic of Croatia. It starts from the advantages of distance learning versus traditional education taking into account…
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.
Energy Technology Data Exchange (ETDEWEB)
Fontana, W.
1990-12-13
In this paper complex adaptive systems are defined by a self- referential loop in which objects encode functions that act back on these objects. A model for this loop is presented. It uses a simple recursive formal language, derived from the lambda-calculus, to provide a semantics that maps character strings into functions that manipulate symbols on strings. The interaction between two functions, or algorithms, is defined naturally within the language through function composition, and results in the production of a new function. An iterated map acting on sets of functions and a corresponding graph representation are defined. Their properties are useful to discuss the behavior of a fixed size ensemble of randomly interacting functions. This function gas'', or Turning gas'', is studied under various conditions, and evolves cooperative interaction patterns of considerable intricacy. These patterns adapt under the influence of perturbations consisting in the addition of new random functions to the system. Different organizations emerge depending on the availability of self-replicators.
Otherness that deserves to be protected. Empathy built upon distance
Directory of Open Access Journals (Sweden)
Elżbieta Winiecka
2010-01-01
Full Text Available The article is a review of Krystyna Pietrych’s book Co poezji po bolu.Empatyczne przestrzenie lektury (Łodż 2009 [What good pain and sufferingbring in poetry. Emphatic dimensions of reading]. Since the reviewedbook presents a bold and, to a large extent, novel approach topersonalistic reading — based on a subjective, compassionate experienceof an encounter with uncognizable and unreductible otherness oftormented man-poet, the reviewer focuses on the issues viewed as themost important for the method of emphatic reading adopted by the author.E. Winiecka analyses aesthetical and epistemological, as well asaxiological possibilities and risks that emphatic criticism opens up forreexamination. Formulates her own opinion on the analytical methodused by K. Pietrych in examining poetry, which is a recording of one’smind in agony and suffering experienced by seven authors: AleksanderWat, Zbigniew Herbert, Miron Białszewski, Stanisłw Barańzak, JanuszSzuber, as well as Julian Przybośand Anna Swirszczyńka. Outlinesthe methodological perspectives of the discussed work that tracesthe stages in the formation of literary depiction and representation ofsuffering. The text is also an attempt at defining and indicating the cognitiveperspectives of emphatic criticism.
Error Estimation for the Linearized Auto-Localization Algorithm
Directory of Open Access Journals (Sweden)
Fernando Seco
2012-02-01
Full Text Available The Linearized Auto-Localization (LAL algorithm estimates the position of beacon nodes in Local Positioning Systems (LPSs, using only the distance measurements to a mobile node whose position is also unknown. The LAL algorithm calculates the inter-beacon distances, used for the estimation of the beacons’ positions, from the linearized trilateration equations. In this paper we propose a method to estimate the propagation of the errors of the inter-beacon distances obtained with the LAL algorithm, based on a first order Taylor approximation of the equations. Since the method depends on such approximation, a confidence parameter τ is defined to measure the reliability of the estimated error. Field evaluations showed that by applying this information to an improved weighted-based auto-localization algorithm (WLAL, the standard deviation of the inter-beacon distances can be improved by more than 30% on average with respect to the original LAL method.
A Short-Range Distance Sensor with Exceptional Linearity
Simmons, Steven; Youngquist, Robert
2013-01-01
A sensor has been demonstrated that can measure distance over a total range of about 300 microns to an accuracy of about 0.1 nm (resolution of about 0.01 nm). This represents an exceptionally large dynamic range of operation - over 1,000,000. The sensor is optical in nature, and requires the attachment of a mirror to the object whose distance is being measured. This work resulted from actively developing a white light interferometric system to be used to measure the depths of defects in the Space Shuttle Orbiter windows. The concept was then applied to measuring distance. The concept later expanded to include spectrometer calibration. In summary, broadband (i.e., white) light is launched into a Michelson interferometer, one mirror of which is fixed and one of which is attached to the object whose distance is to be measured. The light emerging from the interferometer has traveled one of two distances: either the distance to the fixed mirror and back, or the distance to the moving mirror and back. These two light beams mix and produce an interference pattern where some wavelengths interfere constructively and some destructively. Sending this light into a spectrometer allows this interference pattern to be analyzed, yielding the net distance difference between the two paths. The unique feature of this distance sensor is its ability to measure accurately distance over a dynamic range of more than one million, the ratio of its range (about 300 microns) to its accuracy (about 0.1 nanometer). Such a large linear operating range is rare and arises here because both amplitude and phase-matching algorithms contribute to the performance. The sensor is limited by the need to attach a mirror of some kind to the object being tracked, and by the fairly small total range, but the exceptional dynamic range should make it of interest.
AES ALGORITHM IMPLEMENTATION IN PROGRAMMING LANGUAGES
Directory of Open Access Journals (Sweden)
Luminiţa DEFTA
2010-12-01
Full Text Available Information encryption represents the usage of an algorithm to convert an unknown message into an encrypted one. It is used to protect the data against unauthorized access. Protected data can be stored on a media device or can be transmitted through the network. In this paper we describe a concrete implementation of the AES algorithm in the Java programming language (available from Java Development Kit 6 libraries and C (using the OpenSSL library. AES (Advanced Encryption Standard is an asymmetric key encryption algorithm formally adopted by the U.S. government and was elected after a long process of standardization.
Tracking frequency laser distance gauge
International Nuclear Information System (INIS)
Phillips, J.D.; Reasenberg, R.D.
2005-01-01
Advanced astronomical missions with greatly enhanced resolution and physics missions of unprecedented accuracy will require laser distance gauges of substantially improved performance. We describe a laser gauge, based on Pound-Drever-Hall locking, in which the optical frequency is adjusted to maintain an interferometer's null condition. This technique has been demonstrated with pm performance. Automatic fringe hopping allows it to track arbitrary distance changes. The instrument is intrinsically free of the nm-scale cyclic bias present in traditional (heterodyne) high-precision laser gauges. The output is a radio frequency, readily measured to sufficient accuracy. The laser gauge has operated in a resonant cavity, which improves precision, can suppress the effects of misalignments, and makes possible precise automatic alignment. The measurement of absolute distance requires little or no additional hardware, and has also been demonstrated. The proof-of-concept version, based on a stabilized HeNe laser and operating on a 0.5 m path, has achieved 10 pm precision with 0.1 s integration time, and 0.1 mm absolute distance accuracy. This version has also followed substantial distance changes as fast as 16 mm/s. We show that, if the precision in optical frequency is a fixed fraction of the linewidth, both incremental and absolute distance precision are independent of the distance measured. We discuss systematic error sources, and present plans for a new version of the gauge based on semiconductor lasers and fiber-coupled components
Valentino, G; Gasior, M; Mirarchi, D; Nosych, A A; Redaelli, S; Salvachua, B; Assmann, R W; Sammut, N
2013-01-01
Collimators with embedded Beam Position Monitor (BPM) buttons will be installed in the LHC during the upcoming long shutdown period. During the subsequent operation, the BPMs will allow the collimator jaws to be kept centered around the beam trajectory. In this manner, the best possible beam cleaning efficiency and machine protection can be provided at unprecedented higher beam energies and intensities. A collimator alignment algorithm is proposed to center the jaws automatically around the beam. The algorithm is based on successive approximation, as the BPM measurements are affected by non-linearities, which vary with the distance between opposite buttons, as well as the difference between the beam and the jaw centers. The successful test results, as well as some considerations for eventual operation in the LHC are also presented.
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
Equivalence of massive propagator distance and mathematical distance on graphs
International Nuclear Information System (INIS)
Filk, T.
1992-01-01
It is shown in this paper that the assignment of distance according to the massive propagator method and according to the mathematical definition (length of minimal path) on arbitrary graphs with a bound on the degree leads to equivalent large scale properties of the graph. Especially, the internal scaling dimension is the same for both definitions. This result holds for any fixed, non-vanishing mass, so that a really inequivalent definition of distance requires the limit m → 0
Language distance and tree reconstruction
International Nuclear Information System (INIS)
Petroni, Filippo; Serva, Maurizio
2008-01-01
Languages evolve over time according to a process in which reproduction, mutation and extinction are all possible. This is very similar to haploid evolution for asexual organisms and for the mitochondrial DNA of complex ones. Exploiting this similarity, it is possible, in principle, to verify hypotheses concerning the relationship among languages and to reconstruct their family tree. The key point is the definition of the distances among pairs of languages in analogy with the genetic distances among pairs of organisms. Distances can be evaluated by comparing grammar and/or vocabulary, but while it is difficult, if not impossible, to quantify grammar distance, it is possible to measure a distance from vocabulary differences. The method used by glottochronology computes distances from the percentage of shared 'cognates', which are words with a common historical origin. The weak point of this method is that subjective judgment plays a significant role. Here we define the distance of two languages by considering a renormalized edit distance among words with the same meaning and averaging over the two hundred words contained in a Swadesh list. In our approach the vocabulary of a language is the analogue of DNA for organisms. The advantage is that we avoid subjectivity and, furthermore, reproducibility of results is guaranteed. We apply our method to the Indo-European and the Austronesian groups, considering, in both cases, fifty different languages. The two trees obtained are, in many respects, similar to those found by glottochronologists, with some important differences as regards the positions of a few languages. In order to support these different results we separately analyze the structure of the distances of these languages with respect to all the others
Language distance and tree reconstruction
Petroni, Filippo; Serva, Maurizio
2008-08-01
Languages evolve over time according to a process in which reproduction, mutation and extinction are all possible. This is very similar to haploid evolution for asexual organisms and for the mitochondrial DNA of complex ones. Exploiting this similarity, it is possible, in principle, to verify hypotheses concerning the relationship among languages and to reconstruct their family tree. The key point is the definition of the distances among pairs of languages in analogy with the genetic distances among pairs of organisms. Distances can be evaluated by comparing grammar and/or vocabulary, but while it is difficult, if not impossible, to quantify grammar distance, it is possible to measure a distance from vocabulary differences. The method used by glottochronology computes distances from the percentage of shared 'cognates', which are words with a common historical origin. The weak point of this method is that subjective judgment plays a significant role. Here we define the distance of two languages by considering a renormalized edit distance among words with the same meaning and averaging over the two hundred words contained in a Swadesh list. In our approach the vocabulary of a language is the analogue of DNA for organisms. The advantage is that we avoid subjectivity and, furthermore, reproducibility of results is guaranteed. We apply our method to the Indo-European and the Austronesian groups, considering, in both cases, fifty different languages. The two trees obtained are, in many respects, similar to those found by glottochronologists, with some important differences as regards the positions of a few languages. In order to support these different results we separately analyze the structure of the distances of these languages with respect to all the others.
Monocular distance estimation from optic flow during active landing maneuvers
International Nuclear Information System (INIS)
Van Breugel, Floris; Morgansen, Kristi; Dickinson, Michael H
2014-01-01
Vision is arguably the most widely used sensor for position and velocity estimation in animals, and it is increasingly used in robotic systems as well. Many animals use stereopsis and object recognition in order to make a true estimate of distance. For a tiny insect such as a fruit fly or honeybee, however, these methods fall short. Instead, an insect must rely on calculations of optic flow, which can provide a measure of the ratio of velocity to distance, but not either parameter independently. Nevertheless, flies and other insects are adept at landing on a variety of substrates, a behavior that inherently requires some form of distance estimation in order to trigger distance-appropriate motor actions such as deceleration or leg extension. Previous studies have shown that these behaviors are indeed under visual control, raising the question: how does an insect estimate distance solely using optic flow? In this paper we use a nonlinear control theoretic approach to propose a solution for this problem. Our algorithm takes advantage of visually controlled landing trajectories that have been observed in flies and honeybees. Finally, we implement our algorithm, which we term dynamic peering, using a camera mounted to a linear stage to demonstrate its real-world feasibility. (paper)
COMPARISON OF DIFFERENT SEGMENTATION ALGORITHMS FOR DERMOSCOPIC IMAGES
Directory of Open Access Journals (Sweden)
A.A. Haseena Thasneem
2015-05-01
Full Text Available This paper compares different algorithms for the segmentation of skin lesions in dermoscopic images. The basic segmentation algorithms compared are Thresholding techniques (Global and Adaptive, Region based techniques (K-means, Fuzzy C means, Expectation Maximization and Statistical Region Merging, Contour models (Active Contour Model and Chan - Vese Model and Spectral Clustering. Accuracy, sensitivity, specificity, Border error, Hammoude distance, Hausdorff distance, MSE, PSNR and elapsed time metrices were used to evaluate various segmentation techniques.
Performance Analysis of a Decoding Algorithm for Algebraic Geometry Codes
DEFF Research Database (Denmark)
Jensen, Helge Elbrønd; Nielsen, Rasmus Refslund; Høholdt, Tom
1998-01-01
We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is greater than or equal to [(dFR-1)/2]+1, where dFR is the Feng-Rao distance......We analyse the known decoding algorithms for algebraic geometry codes in the case where the number of errors is greater than or equal to [(dFR-1)/2]+1, where dFR is the Feng-Rao distance...
Robust haptic large distance telemanipulation for ITER
International Nuclear Information System (INIS)
Heck, D.J.F.; Heemskerk, C.J.M.; Koning, J.F.; Abbasi, A.; Nijmeijer, H.
2013-01-01
Highlights: • ITER remote handling maintenance can be controlled safely over a large distance. • Bilateral teleoperation experiments were performed in a local network. • Wave variables make the controller robust against constant communication delays. • Master and slave position synchronization guaranteed by proportional action. -- Abstract: During shutdowns, maintenance crews are expected to work in 24/6 shifts to perform critical remote handling maintenance tasks on the ITER system. In this article, we investigate the possibility to safely perform these haptic maintenance tasks remotely from control stations located anywhere around the world. To guarantee stability in time delayed bilateral teleoperation, the symmetric position tracking controller using wave variables is selected. This algorithm guarantees robustness against communication delays, can eliminate wave reflections and provide position synchronization of the master and slave devices. Experiments have been conducted under realistic local network bandwidth, latency and jitter constraints. They show sufficient transparency even for substantial communication delays
Signed distance function implicit geologic modeling
Directory of Open Access Journals (Sweden)
Roberto Mentzingen Rolo
Full Text Available Abstract Prior to every geostatistical estimation or simulation study there is a need for delimiting the geologic domains of the deposit, which is traditionally done manually by a geomodeler in a laborious, time consuming and subjective process. For this reason, novel techniques referred to as implicit modelling have appeared. These techniques provide algorithms that replace the manual digitization process of the traditional methods by some form of automatic procedure. This paper covers a few well established implicit methods currently available with special attention to the signed distance function methodology. A case study based on a real dataset was performed and its applicability discussed. Although it did not replace an experienced geomodeler, the method proved to be capable in creating semi-automatic geological models from the sampling data, especially in the early stages of exploration.
Robust haptic large distance telemanipulation for ITER
Energy Technology Data Exchange (ETDEWEB)
Heck, D.J.F., E-mail: d.j.f.heck@tue.nl [Eindhoven University of Technology, Department of Mechanical Engineering, Eindhoven (Netherlands); Heemskerk, C.J.M.; Koning, J.F. [Heemskerk Innovative Technologies, Sassenheim (Netherlands); Abbasi, A.; Nijmeijer, H. [Eindhoven University of Technology, Department of Mechanical Engineering, Eindhoven (Netherlands)
2013-10-15
Highlights: • ITER remote handling maintenance can be controlled safely over a large distance. • Bilateral teleoperation experiments were performed in a local network. • Wave variables make the controller robust against constant communication delays. • Master and slave position synchronization guaranteed by proportional action. -- Abstract: During shutdowns, maintenance crews are expected to work in 24/6 shifts to perform critical remote handling maintenance tasks on the ITER system. In this article, we investigate the possibility to safely perform these haptic maintenance tasks remotely from control stations located anywhere around the world. To guarantee stability in time delayed bilateral teleoperation, the symmetric position tracking controller using wave variables is selected. This algorithm guarantees robustness against communication delays, can eliminate wave reflections and provide position synchronization of the master and slave devices. Experiments have been conducted under realistic local network bandwidth, latency and jitter constraints. They show sufficient transparency even for substantial communication delays.
Algorithms for Planar Graphs and Graphs in Metric Spaces
DEFF Research Database (Denmark)
Wulff-Nilsen, Christian
structural properties that can be exploited. For instance, a road network or a wire layout on a microchip is typically (near-)planar and distances in the network are often defined w.r.t. the Euclidean or the rectilinear metric. Specialized algorithms that take advantage of such properties are often orders...... of magnitude faster than the corresponding algorithms for general graphs. The first and main part of this thesis focuses on the development of efficient planar graph algorithms. The most important contributions include a faster single-source shortest path algorithm, a distance oracle with subquadratic...... for geometric graphs and graphs embedded in metric spaces. Roughly speaking, the stretch factor is a real value expressing how well a (geo-)metric graph approximates the underlying complete graph w.r.t. distances. We give improved algorithms for computing the stretch factor of a given graph and for augmenting...
Distance-two interpolation for parallel algebraic multigrid
International Nuclear Information System (INIS)
Sterck, H de; Falgout, R D; Nolting, J W; Yang, U M
2007-01-01
In this paper we study the use of long distance interpolation methods with the low complexity coarsening algorithm PMIS. AMG performance and scalability is compared for classical as well as long distance interpolation methods on parallel computers. It is shown that the increased interpolation accuracy largely restores the scalability of AMG convergence factors for PMIS-coarsened grids, and in combination with complexity reducing methods, such as interpolation truncation, one obtains a class of parallel AMG methods that enjoy excellent scalability properties on large parallel computers
Hardware modules of the RSA algorithm
Directory of Open Access Journals (Sweden)
Škobić Velibor
2014-01-01
Full Text Available This paper describes basic principles of data protection using the RSA algorithm, as well as algorithms for its calculation. The RSA algorithm is implemented on FPGA integrated circuit EP4CE115F29C7, family Cyclone IV, Altera. Four modules of Montgomery algorithm are designed using VHDL. Synthesis and simulation are done using Quartus II software and ModelSim. The modules are analyzed for different key lengths (16 to 1024 in terms of the number of logic elements, the maximum frequency and speed.
Answer Markup Algorithms for Southeast Asian Languages.
Henry, George M.
1991-01-01
Typical markup methods for providing feedback to foreign language learners are not applicable to languages not written in a strictly linear fashion. A modification of Hart's edit markup software is described, along with a second variation based on a simple edit distance algorithm adapted to a general Southeast Asian font system. (10 references)…
Academy Distance Learning Tools (IRIS) -
Department of Transportation — IRIS is a suite of front-end web applications utilizing a centralized back-end Oracle database. The system fully supports the FAA Academy's Distance Learning Program...
Distance labeling schemes for trees
DEFF Research Database (Denmark)
Alstrup, Stephen; Gørtz, Inge Li; Bistrup Halvorsen, Esben
2016-01-01
We consider distance labeling schemes for trees: given a tree with n nodes, label the nodes with binary strings such that, given the labels of any two nodes, one can determine, by looking only at the labels, the distance in the tree between the two nodes. A lower bound by Gavoille et al. [Gavoille...... variants such as, for example, small distances in trees [Alstrup et al., SODA, 2003]. We improve the known upper and lower bounds of exact distance labeling by showing that 1/4 log2(n) bits are needed and that 1/2 log2(n) bits are sufficient. We also give (1 + ε)-stretch labeling schemes using Theta...
Distance Education in Technological Age
Directory of Open Access Journals (Sweden)
R .C. SHARMA
2005-04-01
Full Text Available Distance Education in Technological AgeRomesh Verma (Editor, New Delhi: Anmol Publications, 2005, ISBN 81-261-2210-2, pp. 419 Reviewed by R C SHARMARegional DirectorIndira Gandhi National Open University-INDIA The advancements in information and communication technologies have brought significant changes in the way the open and distance learning are provided to the learners. The impact of such changes is quite visible in both developed and developing countries. Switching over to online mode, joining hands with private initiatives and making a presence in foreign waters, are some of the hallmarks of the open and distance education (ODE institutions in developing countries. The compilation of twenty six essays on themes as applicable to ODE has resulted in the book, Distance Education in Technological Age. These essays follow a progressive style of narration, starting from describing conceptual framework of distance education, how the distance education was emerged on the global scene and in India, and then goes on to discuss emergence of online distance education and research aspects in ODE. The initial four chapters provide a detailed account of historical development and growth of distance education in India and State Open University and National Open University Model in India . Student support services are pivot to any distance education and much of its success depends on how well the support services are provided. These are discussed from national and international perspective. The issues of collaborative learning, learning on demand, life long learning, learning-unlearning and re-learning model and strategic alliances have also given due space by the authors. An assortment of technologies like communication technology, domestic technology, information technology, mass media and entertainment technology, media technology and educational technology give an idea of how these technologies are being adopted in the open universities. The study
Distance Education in Technological Age
R .C. SHARMA
2005-01-01
Distance Education in Technological AgeRomesh Verma (Editor), New Delhi: Anmol Publications, 2005, ISBN 81-261-2210-2, pp. 419 Reviewed by R C SHARMARegional DirectorIndira Gandhi National Open University-INDIA The advancements in information and communication technologies have brought significant changes in the way the open and distance learning are provided to the learners. The impact of such changes is quite visible in both developed and developing countries. Switching over to online mode...
Directory of Open Access Journals (Sweden)
Suting Chen
2017-12-01
Full Text Available Aerial images have features of high resolution, complex background, and usually require large amounts of calculation, however, most algorithms used in matching of aerial images adopt the shallow hand-crafted features expressed as floating-point descriptors (e.g., SIFT (Scale-invariant Feature Transform, SURF (Speeded Up Robust Features, which may suffer from poor matching speed and are not well represented in the literature. Here, we propose a novel Local Deep Hashing Matching (LDHM method for matching of aerial images with large size and with lower complexity or fast matching speed. The basic idea of the proposed algorithm is to utilize the deep network model in the local area of the aerial images, and study the local features, as well as the hash function of the images. Firstly, according to the course overlap rate of aerial images, the algorithm extracts the local areas for matching to avoid the processing of redundant information. Secondly, a triplet network structure is proposed to mine the deep features of the patches of the local image, and the learned features are imported to the hash layer, thus obtaining the representation of a binary hash code. Thirdly, the constraints of the positive samples to the absolute distance are added on the basis of the triplet loss, a new objective function is constructed to optimize the parameters of the network and enhance the discriminating capabilities of image patch features. Finally, the obtained deep hash code of each image patch is used for the similarity comparison of the image patches in the Hamming space to complete the matching of aerial images. The proposed LDHM algorithm evaluates the UltraCam-D dataset and a set of actual aerial images, simulation result demonstrates that it may significantly outperform the state-of-the-art algorithm in terms of the efficiency and performance.
The Year Ahead: Will Distance Education Enter the Mainstream?
Saba, Farhad, Ed.
1998-01-01
Discusses the following indicators for measuring success in mainstreaming distance education in higher education: integration, resulting in funding and credit for off-campus students; course ownership, providing legal protection for faculty; product differentiation among institutions in course offerings, quality, and flexibility; flexible time…
Institutional Continuity and Distance Learning: A Symbiotic Relationship
Bates, Rodger
2013-01-01
Universities and colleges have been developing institutional continuity plans to protect their ability to function within an environment of increasing uncertainties caused by natural and man-made disasters and events. Within the academic context, distance learning strategies have emerged as critical components for program continuity. This research…
Pseudo-deterministic Algorithms
Goldwasser , Shafi
2012-01-01
International audience; In this talk we describe a new type of probabilistic algorithm which we call Bellagio Algorithms: a randomized algorithm which is guaranteed to run in expected polynomial time, and to produce a correct and unique solution with high probability. These algorithms are pseudo-deterministic: they can not be distinguished from deterministic algorithms in polynomial time by a probabilistic polynomial time observer with black box access to the algorithm. We show a necessary an...
Computing Distances between Probabilistic Automata
Directory of Open Access Journals (Sweden)
Mathieu Tracol
2011-07-01
Full Text Available We present relaxed notions of simulation and bisimulation on Probabilistic Automata (PA, that allow some error epsilon. When epsilon is zero we retrieve the usual notions of bisimulation and simulation on PAs. We give logical characterisations of these notions by choosing suitable logics which differ from the elementary ones, L with negation and L without negation, by the modal operator. Using flow networks, we show how to compute the relations in PTIME. This allows the definition of an efficiently computable non-discounted distance between the states of a PA. A natural modification of this distance is introduced, to obtain a discounted distance, which weakens the influence of long term transitions. We compare our notions of distance to others previously defined and illustrate our approach on various examples. We also show that our distance is not expansive with respect to process algebra operators. Although L without negation is a suitable logic to characterise epsilon-(bisimulation on deterministic PAs, it is not for general PAs; interestingly, we prove that it does characterise weaker notions, called a priori epsilon-(bisimulation, which we prove to be NP-difficult to decide.
Distance sampling methods and applications
Buckland, S T; Marques, T A; Oedekoven, C S
2015-01-01
In this book, the authors cover the basic methods and advances within distance sampling that are most valuable to practitioners and in ecology more broadly. This is the fourth book dedicated to distance sampling. In the decade since the last book published, there have been a number of new developments. The intervening years have also shown which advances are of most use. This self-contained book covers topics from the previous publications, while also including recent developments in method, software and application. Distance sampling refers to a suite of methods, including line and point transect sampling, in which animal density or abundance is estimated from a sample of distances to detected individuals. The book illustrates these methods through case studies; data sets and computer code are supplied to readers through the book’s accompanying website. Some of the case studies use the software Distance, while others use R code. The book is in three parts. The first part addresses basic methods, the ...
Optimizing distance-based methods for large data sets
Scholl, Tobias; Brenner, Thomas
2015-10-01
Distance-based methods for measuring spatial concentration of industries have received an increasing popularity in the spatial econometrics community. However, a limiting factor for using these methods is their computational complexity since both their memory requirements and running times are in {{O}}(n^2). In this paper, we present an algorithm with constant memory requirements and shorter running time, enabling distance-based methods to deal with large data sets. We discuss three recent distance-based methods in spatial econometrics: the D&O-Index by Duranton and Overman (Rev Econ Stud 72(4):1077-1106, 2005), the M-function by Marcon and Puech (J Econ Geogr 10(5):745-762, 2010) and the Cluster-Index by Scholl and Brenner (Reg Stud (ahead-of-print):1-15, 2014). Finally, we present an alternative calculation for the latter index that allows the use of data sets with millions of firms.
Geodesic distance in planar graphs
International Nuclear Information System (INIS)
Bouttier, J.; Di Francesco, P.; Guitter, E.
2003-01-01
We derive the exact generating function for planar maps (genus zero fatgraphs) with vertices of arbitrary even valence and with two marked points at a fixed geodesic distance. This is done in a purely combinatorial way based on a bijection with decorated trees, leading to a recursion relation on the geodesic distance. The latter is solved exactly in terms of discrete soliton-like expressions, suggesting an underlying integrable structure. We extract from this solution the fractal dimensions at the various (multi)-critical points, as well as the precise scaling forms of the continuum two-point functions and the probability distributions for the geodesic distance in (multi)-critical random surfaces. The two-point functions are shown to obey differential equations involving the residues of the KdV hierarchy
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.
Thickness and clearance visualization based on distance field of 3D objects
Directory of Open Access Journals (Sweden)
Masatomo Inui
2015-07-01
Full Text Available This paper proposes a novel method for visualizing the thickness and clearance of 3D objects in a polyhedral representation. The proposed method uses the distance field of the objects in the visualization. A parallel algorithm is developed for constructing the distance field of polyhedral objects using the GPU. The distance between a voxel and the surface polygons of the model is computed many times in the distance field construction. Similar sets of polygons are usually selected as close polygons for close voxels. By using this spatial coherence, a parallel algorithm is designed to compute the distances between a cluster of close voxels and the polygons selected by the culling operation so that the fast shared memory mechanism of the GPU can be fully utilized. The thickness/clearance of the objects is visualized by distributing points on the visible surfaces of the objects and painting them with a unique color corresponding to the thickness/clearance values at those points. A modified ray casting method is developed for computing the thickness/clearance using the distance field of the objects. A system based on these algorithms can compute the distance field of complex objects within a few minutes for most cases. After the distance field construction, thickness/clearance visualization at a near interactive rate is achieved.
The Efficiency Analysis of the Augmented Reality Algorithm
Directory of Open Access Journals (Sweden)
Dovilė Kurpytė
2013-05-01
Full Text Available The article presents the investigation of the efficiency of augmented reality algorithm that depends on the rotation angles and lighting conditions. The following were the target subject parameters: three degrees of freedom perspective of the rotation and side lighting that forms a shadow. Static parameters of subjects with the ability to change them were as follow: the distance between the marker and the camera, camera, processor, and the distance from the light source. The study is based on an open source Java programming language algorithm, where the algorithm is tested with 10 markers. It was found that the rotation error did not exceed 2%.Article in Lithuanian
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
GPU-based Branchless Distance-Driven Projection and Backprojection.
Liu, Rui; Fu, Lin; De Man, Bruno; Yu, Hengyong
2017-12-01
Projection and backprojection operations are essential in a variety of image reconstruction and physical correction algorithms in CT. The distance-driven (DD) projection and backprojection are widely used for their highly sequential memory access pattern and low arithmetic cost. However, a typical DD implementation has an inner loop that adjusts the calculation depending on the relative position between voxel and detector cell boundaries. The irregularity of the branch behavior makes it inefficient to be implemented on massively parallel computing devices such as graphics processing units (GPUs). Such irregular branch behaviors can be eliminated by factorizing the DD operation as three branchless steps: integration, linear interpolation, and differentiation, all of which are highly amenable to massive vectorization. In this paper, we implement and evaluate a highly parallel branchless DD algorithm for 3D cone beam CT. The algorithm utilizes the texture memory and hardware interpolation on GPUs to achieve fast computational speed. The developed branchless DD algorithm achieved 137-fold speedup for forward projection and 188-fold speedup for backprojection relative to a single-thread CPU implementation. Compared with a state-of-the-art 32-thread CPU implementation, the proposed branchless DD achieved 8-fold acceleration for forward projection and 10-fold acceleration for backprojection. GPU based branchless DD method was evaluated by iterative reconstruction algorithms with both simulation and real datasets. It obtained visually identical images as the CPU reference algorithm.
Algorithms for sorting unsigned linear genomes by the DCJ operations.
Jiang, Haitao; Zhu, Binhai; Zhu, Daming
2011-02-01
The double cut and join operation (abbreviated as DCJ) has been extensively used for genomic rearrangement. Although the DCJ distance between signed genomes with both linear and circular (uni- and multi-) chromosomes is well studied, the only known result for the NP-complete unsigned DCJ distance problem is an approximation algorithm for unsigned linear unichromosomal genomes. In this article, we study the problem of computing the DCJ distance on two unsigned linear multichromosomal genomes (abbreviated as UDCJ). We devise a 1.5-approximation algorithm for UDCJ by exploiting the distance formula for signed genomes. In addition, we show that UDCJ admits a weak kernel of size 2k and hence an FPT algorithm running in O(2(2k)n) time.
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.
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 ...
Partial distance correlation with methods for dissimilarities
Székely, Gábor J.; Rizzo, Maria L.
2014-01-01
Distance covariance and distance correlation are scalar coefficients that characterize independence of random vectors in arbitrary dimension. Properties, extensions, and applications of distance correlation have been discussed in the recent literature, but the problem of defining the partial distance correlation has remained an open question of considerable interest. The problem of partial distance correlation is more complex than partial correlation partly because the squared distance covari...
Superficial dose evaluation of four dose calculation algorithms
Cao, Ying; Yang, Xiaoyu; Yang, Zhen; Qiu, Xiaoping; Lv, Zhiping; Lei, Mingjun; Liu, Gui; Zhang, Zijian; Hu, Yongmei
2017-08-01
Accurate superficial dose calculation is of major importance because of the skin toxicity in radiotherapy, especially within the initial 2 mm depth being considered more clinically relevant. The aim of this study is to evaluate superficial dose calculation accuracy of four commonly used algorithms in commercially available treatment planning systems (TPS) by Monte Carlo (MC) simulation and film measurements. The superficial dose in a simple geometrical phantom with size of 30 cm×30 cm×30 cm was calculated by PBC (Pencil Beam Convolution), AAA (Analytical Anisotropic Algorithm), AXB (Acuros XB) in Eclipse system and CCC (Collapsed Cone Convolution) in Raystation system under the conditions of source to surface distance (SSD) of 100 cm and field size (FS) of 10×10 cm2. EGSnrc (BEAMnrc/DOSXYZnrc) program was performed to simulate the central axis dose distribution of Varian Trilogy accelerator, combined with measurements of superficial dose distribution by an extrapolation method of multilayer radiochromic films, to estimate the dose calculation accuracy of four algorithms in the superficial region which was recommended in detail by the ICRU (International Commission on Radiation Units and Measurement) and the ICRP (International Commission on Radiological Protection). In superficial region, good agreement was achieved between MC simulation and film extrapolation method, with the mean differences less than 1%, 2% and 5% for 0°, 30° and 60°, respectively. The relative skin dose errors were 0.84%, 1.88% and 3.90%; the mean dose discrepancies (0°, 30° and 60°) between each of four algorithms and MC simulation were (2.41±1.55%, 3.11±2.40%, and 1.53±1.05%), (3.09±3.00%, 3.10±3.01%, and 3.77±3.59%), (3.16±1.50%, 8.70±2.84%, and 18.20±4.10%) and (14.45±4.66%, 10.74±4.54%, and 3.34±3.26%) for AXB, CCC, AAA and PBC respectively. Monte Carlo simulation verified the feasibility of the superficial dose measurements by multilayer Gafchromic films. And the rank
Hamiltonian Algorithm Sound Synthesis
大矢, 健一
2013-01-01
Hamiltonian Algorithm (HA) is an algorithm for searching solutions is optimization problems. This paper introduces a sound synthesis technique using Hamiltonian Algorithm and shows a simple example. "Hamiltonian Algorithm Sound Synthesis" uses phase transition effect in HA. Because of this transition effect, totally new waveforms are produced.
Progressive geometric algorithms
Alewijnse, S.P.A.; Bagautdinov, T.M.; de Berg, M.T.; Bouts, Q.W.; ten Brink, Alex P.; Buchin, K.A.; Westenberg, M.A.
2015-01-01
Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, and develop efficient progressive algorithms
Progressive geometric algorithms
Alewijnse, S.P.A.; Bagautdinov, T.M.; Berg, de M.T.; Bouts, Q.W.; Brink, ten A.P.; Buchin, K.; Westenberg, M.A.
2014-01-01
Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, and develop efficient progressive algorithms
Gesture Interaction at a Distance
Fikkert, F.W.
2010-01-01
The aim of this work is to explore, from a perspective of human behavior, which gestures are suited to control large display surfaces from a short distance away; why that is so; and, equally important, how such an interface can be made a reality. A well-known example of the type of interface that is
Communication Barriers in Distance Education
Isman, Aytekin; Dabaj, Fahme; Altinay, Fahriye; Altinay, Zehra
2003-01-01
Communication is a key concept as being the major tool for people in order to satisfy their needs. It is an activity which refers as process and effective communication requires qualified communication with the elimination of communication barriers. As it is known, distance education is a new trend by following contemporary facilities and tools…
Distance Education Technologies in Asia
International Development Research Centre (IDRC) Digital Library (Canada)
17 schools ... Mobile Technology in Non-formal Distance Education 192 ..... in the design and application of e-learning strategies, the need to standardise and ...... library providing access to over 20,000 journals and thesis databases, and 6,000 ...
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.
Interaction in Distance Nursing Education
Boz Yuksekdag, Belgin
2012-01-01
The purpose of this study is to determine psychiatry nurses' attitudes toward the interactions in distance nursing education, and also scrunize their attitudes based on demographics and computer/Internet usage. The comparative relational scanning model is the method of this study. The research data were collected through "The Scale of Attitudes of…
Student Monitoring in Distance Education.
Holt, Peter; And Others
1987-01-01
Reviews a computerized monitoring system for distance education students at Athabasca University designed to solve the problems of tracking student performance. A pilot project for tutors is described which includes an electronic conferencing system and electronic mail, and an evaluation currently in progress is briefly discussed. (LRW)
DEFF Research Database (Denmark)
Bucher, Taina
2017-01-01
the notion of the algorithmic imaginary. It is argued that the algorithmic imaginary – ways of thinking about what algorithms are, what they should be and how they function – is not just productive of different moods and sensations but plays a generative role in moulding the Facebook algorithm itself...... of algorithms affect people's use of these platforms, if at all? To help answer these questions, this article examines people's personal stories about the Facebook algorithm through tweets and interviews with 25 ordinary users. To understand the spaces where people and algorithms meet, this article develops...
Energy Technology Data Exchange (ETDEWEB)
Geist, G.A. [Oak Ridge National Lab., TN (United States). Computer Science and Mathematics Div.; Howell, G.W. [Florida Inst. of Tech., Melbourne, FL (United States). Dept. of Applied Mathematics; Watkins, D.S. [Washington State Univ., Pullman, WA (United States). Dept. of Pure and Applied Mathematics
1997-11-01
The BR algorithm, a new method for calculating the eigenvalues of an upper Hessenberg matrix, is introduced. It is a bulge-chasing algorithm like the QR algorithm, but, unlike the QR algorithm, it is well adapted to computing the eigenvalues of the narrowband, nearly tridiagonal matrices generated by the look-ahead Lanczos process. This paper describes the BR algorithm and gives numerical evidence that it works well in conjunction with the Lanczos process. On the biggest problems run so far, the BR algorithm beats the QR algorithm by a factor of 30--60 in computing time and a factor of over 100 in matrix storage space.
A flooding algorithm for multirobot exploration.
Cabrera-Mora, Flavio; Xiao, Jizhong
2012-06-01
In this paper, we present a multirobot exploration algorithm that aims at reducing the exploration time and to minimize the overall traverse distance of the robots by coordinating the movement of the robots performing the exploration. Modeling the environment as a tree, we consider a coordination model that restricts the number of robots allowed to traverse an edge and to enter a vertex during each step. This coordination is achieved in a decentralized manner by the robots using a set of active landmarks that are dropped by them at explored vertices. We mathematically analyze the algorithm on trees, obtaining its main properties and specifying its bounds on the exploration time. We also define three metrics of performance for multirobot algorithms. We simulate and compare the performance of this new algorithm with those of our multirobot depth first search (MR-DFS) approach presented in our recent paper and classic single-robot DFS.
Algorithmically specialized parallel computers
Snyder, Lawrence; Gannon, Dennis B
1985-01-01
Algorithmically Specialized Parallel Computers focuses on the concept and characteristics of an algorithmically specialized computer.This book discusses the algorithmically specialized computers, algorithmic specialization using VLSI, and innovative architectures. The architectures and algorithms for digital signal, speech, and image processing and specialized architectures for numerical computations are also elaborated. Other topics include the model for analyzing generalized inter-processor, pipelined architecture for search tree maintenance, and specialized computer organization for raster
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.
DISTANCES TO FOUR SOLAR NEIGHBORHOOD ECLIPSING BINARIES FROM ABSOLUTE FLUXES
International Nuclear Information System (INIS)
Wilson, R. E.; Van Hamme, W.
2009-01-01
Eclipsing binary (EB)-based distances are estimated for four solar neighborhood EBs by means of the Direct Distance Estimation (DDE) algorithm. Results are part of a project to map the solar neighborhood EBs in three dimensions, independently of parallaxes, and provide statistical comparisons between EB and parallax distances. Apart from judgments on adopted temperature and interstellar extinction, DDE's simultaneous light-velocity solutions are essentially objective and work as well for semidetached (SD) and overcontact binaries as for detached systems. Here, we analyze two detached and two SD binaries, all double lined. RS Chamaeleontis is a pre-main-sequence (MS), detached EB with weak δ Scuti variations. WW Aurigae is detached and uncomplicated, except for having high metallicity. RZ Cassiopeiae is SD and has very clear δ Scuti variations and several peculiarities. R Canis Majoris (R CMa) is an apparently simple but historically problematic SD system, also with weak δ Scuti variations. Discussions include solution rules and strategies, weighting, convergence, and third light problems. So far there is no indication of systematic band dependence among the derived distances, so the adopted band-calibration ratios seem consistent. Agreement of EB-based and parallax distances is typically within the overlapped uncertainties, with minor exceptions. We also suggest an explanation for the long-standing undermassiveness problem of R CMa's hotter component, in terms of a fortuitous combination of low metallicity and evolution slightly beyond the MS.
The geometry of entanglement and Grover's algorithm
International Nuclear Information System (INIS)
Iwai, Toshihiro; Hayashi, Naoki; Mizobe, Kimitake
2008-01-01
A measure of entanglement with respect to a bipartite partition of n-qubit has been defined and studied from the viewpoint of Riemannian geometry (Iwai 2007 J. Phys. A: Math. Theor. 40 12161). This paper has two aims. One is to study further the geometry of entanglement, and the other is to investigate Grover's search algorithms, both the original and the fixed-point ones, in reference with entanglement. As the distance between the maximally entangled states and the separable states is known already in the previous paper, this paper determines the set of maximally entangled states nearest to a typical separable state which is used as an initial state in Grover's search algorithms, and to find geodesic segments which realize the above-mentioned distance. As for Grover's algorithms, it is already known that while the initial and the target states are separable, the algorithms generate sequences of entangled states. This fact is confirmed also in the entanglement measure proposed in the previous paper, and then a split Grover algorithm is proposed which generates sequences of separable states only with respect to the bipartite partition
Radiation protection for nurses
Energy Technology Data Exchange (ETDEWEB)
Mould, R F
1978-01-01
Various aspects of radiation protection relevant to nurses are presented. The different radioisotopes used in internal radiotherapy and scintiscanning techniques and any necessary precautions which should be observed when nursing these patients are described. General information is also given on nuclear and atomic terminology, the physical half-life of radioisotopes, radiation dose as a function of distance, shielding, film badges and the maximum permissible dose.
Moral distance in dictator games
Directory of Open Access Journals (Sweden)
Fernando Aguiar
2008-04-01
Full Text Available We perform an experimental investigation using a dictator game in which individuals must make a moral decision --- to give or not to give an amount of money to poor people in the Third World. A questionnaire in which the subjects are asked about the reasons for their decision shows that, at least in this case, moral motivations carry a heavy weight in the decision: the majority of dictators give the money for reasons of a consequentialist nature. Based on the results presented here and of other analogous experiments, we conclude that dicator behavior can be understood in terms of moral distance rather than social distance and that it systematically deviates from the egoism assumption in economic models and game theory. %extit{JEL}: A13, C72, C91
Managerial Distance and Virtual Ownership
DEFF Research Database (Denmark)
Hansmann, Henry; Thomsen, Steen
Industrial foundations are autonomous nonprofit entities that own and control one or more conventional business firms. These foundations are common in Northern Europe, where they own a number of internationally prominent companies. Previous studies have indicated, surprisingly, that companies con......, but corporate governance and fiduciary behavior more generally....... on differences among the industrial foundations themselves. We work with a rich data set comprising 113 foundation-owned Danish companies over the period 2003-2008. We focus in particular on a composite structural factor that we term “managerial distance.” We propose this as a measure of the extent to which......-seeking outside owners of the company. Consistent with this hypothesis, our empirical analysis shows a positive, significant, and robust association between managerial distance and the economic performance of foundation owned companies. The findings appear to illuminate not just foundation governance...
Determining distances using asteroseismic methods
DEFF Research Database (Denmark)
Aguirre, Victor Silva; Casagrande, L.; Basu, Sarbina
2013-01-01
Asteroseismology has been extremely successful in determining the properties of stars in different evolutionary stages with a remarkable level of precision. However, to fully exploit its potential, robust methods for estimating stellar parameters are required and independent verification of the r......Asteroseismology has been extremely successful in determining the properties of stars in different evolutionary stages with a remarkable level of precision. However, to fully exploit its potential, robust methods for estimating stellar parameters are required and independent verification...... fluxes, and thus distances for field stars in a self-consistent manner. Applying our method to a sample of solar-like oscillators in the {\\it Kepler} field that have accurate {\\it Hipparcos} parallaxes, we find agreement in our distance determinations to better than 5%. Comparison with measurements...
Comparison of turbulence mitigation algorithms
Kozacik, Stephen T.; Paolini, Aaron; Sherman, Ariel; Bonnett, James; Kelmelis, Eric
2017-07-01
When capturing imagery over long distances, atmospheric turbulence often degrades the data, especially when observation paths are close to the ground or in hot environments. These issues manifest as time-varying scintillation and warping effects that decrease the effective resolution of the sensor and reduce actionable intelligence. In recent years, several image processing approaches to turbulence mitigation have shown promise. Each of these algorithms has different computational requirements, usability demands, and degrees of independence from camera sensors. They also produce different degrees of enhancement when applied to turbulent imagery. Additionally, some of these algorithms are applicable to real-time operational scenarios while others may only be suitable for postprocessing workflows. EM Photonics has been developing image-processing-based turbulence mitigation technology since 2005. We will compare techniques from the literature with our commercially available, real-time, GPU-accelerated turbulence mitigation software. These comparisons will be made using real (not synthetic), experimentally obtained data for a variety of conditions, including varying optical hardware, imaging range, subjects, and turbulence conditions. Comparison metrics will include image quality, video latency, computational complexity, and potential for real-time operation. Additionally, we will present a technique for quantitatively comparing turbulence mitigation algorithms using real images of radial resolution targets.
The Research and Application of SURF Algorithm Based on Feature Point Selection Algorithm
Directory of Open Access Journals (Sweden)
Zhang Fang Hu
2014-04-01
Full Text Available As the pixel information of depth image is derived from the distance information, when implementing SURF algorithm with KINECT sensor for static sign language recognition, there can be some mismatched pairs in palm area. This paper proposes a feature point selection algorithm, by filtering the SURF feature points step by step based on the number of feature points within adaptive radius r and the distance between the two points, it not only greatly improves the recognition rate, but also ensures the robustness under the environmental factors, such as skin color, illumination intensity, complex background, angle and scale changes. The experiment results show that the improved SURF algorithm can effectively improve the recognition rate, has a good robustness.
Czech Academy of Sciences Publication Activity Database
Bielas, Wojciech; Plewik, S.; Walczyńska, Marta
2018-01-01
Roč. 4, č. 2 (2018), s. 687-698 ISSN 2199-675X R&D Projects: GA ČR GF16-34860L Institutional support: RVO:67985840 Keywords : Cantorval center of distances von Neumann's theorem * set of subsums Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics https://link.springer.com/article/10.1007%2Fs40879-017-0199-4
Distance probes of dark energy
Energy Technology Data Exchange (ETDEWEB)
Kim, A. G.; Padmanabhan, N.; Aldering, G.; Allen, S. W.; Baltay, C.; Cahn, R. N.; D’Andrea, C. B.; Dalal, N.; Dawson, K. S.; Denney, K. D.; Eisenstein, D. J.; Finley, D. A.; Freedman, W. L.; Ho, S.; Holz, D. E.; Kasen, D.; Kent, S. M.; Kessler, R.; Kuhlmann, S.; Linder, E. V.; Martini, P.; Nugent, P. E.; Perlmutter, S.; Peterson, B. M.; Riess, A. G.; Rubin, D.; Sako, M.; Suntzeff, N. V.; Suzuki, N.; Thomas, R. C.; Wood-Vasey, W. M.; Woosley, S. E.
2015-03-01
This document presents the results from the Distances subgroup of the Cosmic Frontier Community Planning Study (Snowmass 2013). We summarize the current state of the field as well as future prospects and challenges. In addition to the established probes using Type Ia supernovae and baryon acoustic oscillations, we also consider prospective methods based on clusters, active galactic nuclei, gravitational wave sirens and strong lensing time delays.
The Whistleblower Protection Enhancement Act of 2012 (WPA) and the Whistleblower Protection Act of 1989 Enhanced by the Act of 2012 provides protection rights for Federal employees against retaliation for whistleblowing activities.
Y. Damchi; J. Sadeh; H. Rajabi Mashhadi
2015-01-01
Most studies in relay coordination have focused solely on coordination of overcurrent relays while distance relays are used as the main protection of transmission lines. Since, simultaneous coordination of these two types of relays can provide a better protection, in this paper, a new approach is proposed for simultaneous coordination of distance and directional overcurrent relays (D&DOCRs). Also, pursued by most of the previously published studies, the settings of D&DOCRs are usually determi...
Support Services for Distance Education
Directory of Open Access Journals (Sweden)
Sandra Frieden
1999-01-01
Full Text Available The creation and operation of a distance education support infrastructure requires the collaboration of virtually all administrative departments whose activities deal with students and faculty, and all participating academic departments. Implementation can build on where the institution is and design service-oriented strategies that strengthen institutional support and commitment. Issues to address include planning, faculty issues and concerns, policies and guidelines, approval processes, scheduling, training, publicity, information-line operations, informational materials, orientation and registration processes, class coordination and support, testing, evaluations, receive site management, partnerships, budgets, staffing, library and e-mail support, and different delivery modes (microwave, compressed video, radio, satellite, public television/cable, video tape and online. The process is ongoing and increasingly participative as various groups on campus begin to get involved with distance education activities. The distance education unit must continuously examine and revise its processes and procedures to maintain the academic integrity and service excellence of its programs. Its a daunting prospect to revise the way things have been done for many years, but each department has an opportunity to respond to new ways of serving and reaching students.
Teaching Chemistry via Distance Education
Boschmann, Erwin
2003-06-01
This paper describes a chemistry course taught at Indiana University Purdue University, Indianapolis via television, with a Web version added later. The television format is a delivery technology; the Web is an engagement technology and is preferred since it requires student participation. The distance-laboratory component presented the greatest challenge since laboratories via distance education are not a part of the U.S. academic culture. Appropriate experiments have been developed with the consultation of experts from The Open University in the United Kingdom, Athabasca University in Canada, and Monash University in Australia. The criteria used in the development of experiments are: (1) they must be credible academic experiences equal to or better than those used on campus, (2) they must be easy to perform without supervision, (3) they must be safe, and (4) they must meet all legal requirements. An evaluation of the program using three different approaches is described. The paper concludes that technology-mediated distance education students do as well as on-campus students, but drop out at a higher rate. It is very important to communicate with students frequently, and technology tools ought to be used only if good pedagogy is enhanced by their use.
Quantum Computation and Algorithms
International Nuclear Information System (INIS)
Biham, O.; Biron, D.; Biham, E.; Grassi, M.; Lidar, D.A.
1999-01-01
It is now firmly established that quantum algorithms provide a substantial speedup over classical algorithms for a variety of problems, including the factorization of large numbers and the search for a marked element in an unsorted database. In this talk I will review the principles of quantum algorithms, the basic quantum gates and their operation. The combination of superposition and interference, that makes these algorithms efficient, will be discussed. In particular, Grover's search algorithm will be presented as an example. I will show that the time evolution of the amplitudes in Grover's algorithm can be found exactly using recursion equations, for any initial amplitude distribution
International Nuclear Information System (INIS)
Koelzer, W.
1975-01-01
Physical and radiological terms, quantities, and units. Basic principles of radiation protection (ICRP, IAEA, EURATOM, FRG). Biological effects of ionizing radiation. Objectives of practical radiation protection. (HP) [de
Protective relaying of power systems using mathematical morphology
Wu, QH; Ji, TY
2009-01-01
Discusses the development of novel protective relaying algorithms, using Mathematical Morphology (MM). This book introduces the fundamental principles of MM, and brings together the applications of MM to develop different protective relaying algorithms for the protection of a variety of power system components.
Text Clustering Algorithm Based on Random Cluster Core
Directory of Open Access Journals (Sweden)
Huang Long-Jun
2016-01-01
Full Text Available Nowadays clustering has become a popular text mining algorithm, but the huge data can put forward higher requirements for the accuracy and performance of text mining. In view of the performance bottleneck of traditional text clustering algorithm, this paper proposes a text clustering algorithm with random features. This is a kind of clustering algorithm based on text density, at the same time using the neighboring heuristic rules, the concept of random cluster is introduced, which effectively reduces the complexity of the distance calculation.
Stereo matching using epipolar distance transform.
Yang, Qingxiong; Ahuja, Narendra
2012-10-01
In this paper, we propose a simple but effective image transform, called the epipolar distance transform, for matching low-texture regions. It converts image intensity values to a relative location inside a planar segment along the epipolar line, such that pixels in the low-texture regions become distinguishable. We theoretically prove that the transform is affine invariant, thus the transformed images can be directly used for stereo matching. Any existing stereo algorithms can be directly used with the transformed images to improve reconstruction accuracy for low-texture regions. Results on real indoor and outdoor images demonstrate the effectiveness of the proposed transform for matching low-texture regions, keypoint detection, and description for low-texture scenes. Our experimental results on Middlebury images also demonstrate the robustness of our transform for highly textured scenes. The proposed transform has a great advantage, its low computational complexity. It was tested on a MacBook Air laptop computer with a 1.8 GHz Core i7 processor, with a speed of about 9 frames per second for a video graphics array-sized image.
Connes distance function on fuzzy sphere and the connection between geometry and statistics
International Nuclear Information System (INIS)
Devi, Yendrembam Chaoba; Chakraborty, Biswajit; Prajapat, Shivraj; Mukhopadhyay, Aritra K.; Scholtz, Frederik G.
2015-01-01
An algorithm to compute Connes spectral distance, adaptable to the Hilbert-Schmidt operatorial formulation of non-commutative quantum mechanics, was developed earlier by introducing the appropriate spectral triple and used to compute infinitesimal distances in the Moyal plane, revealing a deep connection between geometry and statistics. In this paper, using the same algorithm, the Connes spectral distance has been calculated in the Hilbert-Schmidt operatorial formulation for the fuzzy sphere whose spatial coordinates satisfy the su(2) algebra. This has been computed for both the discrete and the Perelemov’s SU(2) coherent state. Here also, we get a connection between geometry and statistics which is shown by computing the infinitesimal distance between mixed states on the quantum Hilbert space of a particular fuzzy sphere, indexed by n ∈ ℤ/2
Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion
Directory of Open Access Journals (Sweden)
Shao Mingfu
2012-12-01
Full Text Available Abstract Computing the edit distance between two genomes under certain operations is a basic problem in the study of genome evolution. The double-cut-and-join (DCJ model has formed the basis for most algorithmic research on rearrangements over the last few years. The edit distance under the DCJ model can be easily computed for genomes without duplicate genes. In this paper, we study the edit distance for genomes with duplicate genes under a model that includes DCJ operations, insertions and deletions. We prove that computing the edit distance is equivalent to finding the optimal cycle decomposition of the corresponding adjacency graph, and give an approximation algorithm with an approximation ratio of 1.5 + ∈.
International Nuclear Information System (INIS)
Chandrasekharan, Shailesh
2000-01-01
Cluster algorithms have been recently used to eliminate sign problems that plague Monte-Carlo methods in a variety of systems. In particular such algorithms can also be used to solve sign problems associated with the permutation of fermion world lines. This solution leads to the possibility of designing fermion cluster algorithms in certain cases. Using the example of free non-relativistic fermions we discuss the ideas underlying the algorithm
Autonomous Star Tracker Algorithms
DEFF Research Database (Denmark)
Betto, Maurizio; Jørgensen, John Leif; Kilsgaard, Søren
1998-01-01
Proposal, in response to an ESA R.f.P., to design algorithms for autonomous star tracker operations.The proposal also included the development of a star tracker breadboard to test the algorithms performances.......Proposal, in response to an ESA R.f.P., to design algorithms for autonomous star tracker operations.The proposal also included the development of a star tracker breadboard to test the algorithms performances....
International Nuclear Information System (INIS)
Valmianski, Emanuil I.; Petzoldt, Ronald W.; Alexander, Neil B.
2003-01-01
The heat flux from both gas convection and chamber radiation on a direct drive target must be limited to avoid target damage from excessive D-T temperature increase. One of the possibilities of protecting the target is a wake shield flying in front of the target. A shield will also reduce drag force on the target, thereby facilitating target tracking and position prediction. A Direct Simulation Monte Carlo (DSMC) code was used to calculate convection heat loads as boundary conditions input into ANSYS thermal calculations. These were used for studying the quality of target protection depending on various shapes of shields, target-shield distance, and protective properties of the shield moving relative to the target. The results show that the shield can reduce the convective heat flux by a factor of 2 to 5 depending on pressure, temperature, and velocity. The protective effect of a shield moving relative to the target is greater than the protective properties of a fixed shield. However, the protective effect of a shield moving under the drag force is not sufficient for bringing the heat load on the target down to the necessary limit. Some other ways of diminishing heat flux using a protective shield are discussed
Divasón, Jose; Joosten, Sebastiaan; Thiemann, René; Yamada, Akihisa
2018-01-01
The Lenstra-Lenstra-Lovász basis reduction algorithm, also known as LLL algorithm, is an algorithm to find a basis with short, nearly orthogonal vectors of an integer lattice. Thereby, it can also be seen as an approximation to solve the shortest vector problem (SVP), which is an NP-hard problem,
Distance Measurement Solves Astrophysical Mysteries
2003-08-01
Location, location, and location. The old real-estate adage about what's really important proved applicable to astrophysics as astronomers used the sharp radio "vision" of the National Science Foundation's Very Long Baseline Array (VLBA) to pinpoint the distance to a pulsar. Their accurate distance measurement then resolved a dispute over the pulsar's birthplace, allowed the astronomers to determine the size of its neutron star and possibly solve a mystery about cosmic rays. "Getting an accurate distance to this pulsar gave us a real bonanza," said Walter Brisken, of the National Radio Astronomy Observatory (NRAO) in Socorro, NM. Monogem Ring The Monogem Ring, in X-Ray Image by ROSAT satellite CREDIT: Max-Planck Institute, American Astronomical Society (Click on Image for Larger Version) The pulsar, called PSR B0656+14, is in the constellation Gemini, and appears to be near the center of a circular supernova remnant that straddles Gemini and its neighboring constellation, Monoceros, and is thus called the Monogem Ring. Since pulsars are superdense, spinning neutron stars left over when a massive star explodes as a supernova, it was logical to assume that the Monogem Ring, the shell of debris from a supernova explosion, was the remnant of the blast that created the pulsar. However, astronomers using indirect methods of determining the distance to the pulsar had concluded that it was nearly 2500 light-years from Earth. On the other hand, the supernova remnant was determined to be only about 1000 light-years from Earth. It seemed unlikely that the two were related, but instead appeared nearby in the sky purely by a chance juxtaposition. Brisken and his colleagues used the VLBA to make precise measurements of the sky position of PSR B0656+14 from 2000 to 2002. They were able to detect the slight offset in the object's apparent position when viewed from opposite sides of Earth's orbit around the Sun. This effect, called parallax, provides a direct measurement of
A spectral method to detect community structure based on distance modularity matrix
Yang, Jin-Xuan; Zhang, Xiao-Dong
2017-08-01
There are many community organizations in social and biological networks. How to identify these community structure in complex networks has become a hot issue. In this paper, an algorithm to detect community structure of networks is proposed by using spectra of distance modularity matrix. The proposed algorithm focuses on the distance of vertices within communities, rather than the most weakly connected vertex pairs or number of edges between communities. The experimental results show that our method achieves better effectiveness to identify community structure for a variety of real-world networks and computer generated networks with a little more time-consumption.
International Nuclear Information System (INIS)
Myers, D.A.
1989-01-01
Physical protection is defined and its function in relation to other functions of a State System of Accounting for and Control of Nuclear Materials is described. The need for a uniform minimum international standard for physical protection as well as the need for international cooperation in physical protection is emphasized. The IAEA's INFCIRC/225/Rev. 1 (Annex 1) is reviewed. The Convention on the Physical Protection of Nuclear Material (Annex 2) is discussed. Photographs show examples of typical physical protection technology (Annex 3)
Režná, Jana
2006-01-01
Final thesis Topic: Diplomatic protection Thesis supervisor: JUDr. Vladimír Balaš, CSc. Student: Marek Čermák Thesis on the topic of diplomatic protection deals with the granting of exercise of diplomatic protection by the states and is divided into seven chapters which follow each other. The first chapter describes the diplomatic protection and its historical foundations. The second chapter focuses on the possibility of exercise of diplomatic protection in respect of natural persons and the ...
Nature-inspired optimization algorithms
Yang, Xin-She
2014-01-01
Nature-Inspired Optimization Algorithms provides a systematic introduction to all major nature-inspired algorithms for optimization. The book's unified approach, balancing algorithm introduction, theoretical background and practical implementation, complements extensive literature with well-chosen case studies to illustrate how these algorithms work. Topics include particle swarm optimization, ant and bee algorithms, simulated annealing, cuckoo search, firefly algorithm, bat algorithm, flower algorithm, harmony search, algorithm analysis, constraint handling, hybrid methods, parameter tuning
Quantum chromodynamics at large distances
International Nuclear Information System (INIS)
Arbuzov, B.A.
1987-01-01
Properties of QCD at large distances are considered in the framework of traditional quantum field theory. An investigation of asymptotic behaviour of lower Green functions in QCD is the starting point of the approach. The recent works are reviewed which confirm the singular infrared behaviour of gluon propagator M 2 /(k 2 ) 2 at least under some gauge conditions. A special covariant gauge comes out to be the most suitable for description of infrared region due to absence of ghost contributions to infrared asymptotics of Green functions. Solutions of Schwinger-Dyson equation for quark propagator are obtained in this special gauge and are shown to possess desirable properties: spontaneous breaking of chiral invariance and nonperturbative character. The infrared asymptotics of lower Green functions are used for calculation of vacuum expectation values of gluon and quark fields. These vacuum expectation values are obtained in a good agreement with the corresponding phenomenological values which are needed in the method of sum rules in QCD, that confirms adequacy of the infrared region description. The consideration of a behaviour of QCD at large distances leads to the conclusion that at contemporary stage of theory development one may consider two possibilities. The first one is the well-known confinement hypothesis and the second one is called incomplete confinement and stipulates for open color to be observable. Possible manifestations of incomplete confinement are discussed
VISUALIZATION OF PAGERANK ALGORITHM
Perhaj, Ervin
2013-01-01
The goal of the thesis is to develop a web application that help users understand the functioning of the PageRank algorithm. The thesis consists of two parts. First we develop an algorithm to calculate PageRank values of web pages. The input of algorithm is a list of web pages and links between them. The user enters the list through the web interface. From the data the algorithm calculates PageRank value for each page. The algorithm repeats the process, until the difference of PageRank va...
Akl, Selim G
1985-01-01
Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the
Human Identification at a Distance Using Body Shape Information
International Nuclear Information System (INIS)
Rashid, N K A M; Yahya, M F; Shafie, A A
2013-01-01
Shape of human body is unique from one person to another. This paper presents an intelligent system approach for human identification at a distance using human body shape information. The body features used are the head, shoulder, and trunk. Image processing techniques for detection of these body features were developed in this work. Then, the features are recognized using fuzzy logic approach and used as inputs to a recognition system based on a multilayer neural network. The developed system is only applicable for recognizing a person from its frontal view and specifically constrained to male gender to simplify the algorithm. In this research, the accuracy for human identification using the proposed method is 77.5%. Thus, it is proved that human can be identified at a distance using body shape information
Modified Clipped LMS Algorithm
Directory of Open Access Journals (Sweden)
Lotfizad Mojtaba
2005-01-01
Full Text Available Abstract A new algorithm is proposed for updating the weights of an adaptive filter. The proposed algorithm is a modification of an existing method, namely, the clipped LMS, and uses a three-level quantization ( scheme that involves the threshold clipping of the input signals in the filter weight update formula. Mathematical analysis shows the convergence of the filter weights to the optimum Wiener filter weights. Also, it can be proved that the proposed modified clipped LMS (MCLMS algorithm has better tracking than the LMS algorithm. In addition, this algorithm has reduced computational complexity relative to the unmodified one. By using a suitable threshold, it is possible to increase the tracking capability of the MCLMS algorithm compared to the LMS algorithm, but this causes slower convergence. Computer simulations confirm the mathematical analysis presented.
A Neural-Network Clustering-Based Algorithm for Privacy Preserving Data Mining
Tsiafoulis, S.; Zorkadis, V. C.; Karras, D. A.
The increasing use of fast and efficient data mining algorithms in huge collections of personal data, facilitated through the exponential growth of technology, in particular in the field of electronic data storage media and processing power, has raised serious ethical, philosophical and legal issues related to privacy protection. To cope with these concerns, several privacy preserving methodologies have been proposed, classified in two categories, methodologies that aim at protecting the sensitive data and those that aim at protecting the mining results. In our work, we focus on sensitive data protection and compare existing techniques according to their anonymity degree achieved, the information loss suffered and their performance characteristics. The ℓ-diversity principle is combined with k-anonymity concepts, so that background information can not be exploited to successfully attack the privacy of data subjects data refer to. Based on Kohonen Self Organizing Feature Maps (SOMs), we firstly organize data sets in subspaces according to their information theoretical distance to each other, then create the most relevant classes paying special attention to rare sensitive attribute values, and finally generalize attribute values to the minimum extend required so that both the data disclosure probability and the information loss are possibly kept negligible. Furthermore, we propose information theoretical measures for assessing the anonymity degree achieved and empirical tests to demonstrate it.
Khadke, Piyush; Patne, Nita; Singh, Arvind; Shinde, Gulab
2016-01-01
In this article, a novel and accurate scheme for fault detection, classification and fault distance estimation for a fixed series compensated transmission line is proposed. The proposed scheme is based on artificial neural network (ANN) and metal oxide varistor (MOV) energy, employing Levenberg-Marquardt training algorithm. The novelty of this scheme is the use of MOV energy signals of fixed series capacitors (FSC) as input to train the ANN. Such approach has never been used in any earlier fault analysis algorithms in the last few decades. Proposed scheme uses only single end measurement energy signals of MOV in all the 3 phases over one cycle duration from the occurrence of a fault. Thereafter, these MOV energy signals are fed as input to ANN for fault distance estimation. Feasibility and reliability of the proposed scheme have been evaluated for all ten types of fault in test power system model at different fault inception angles over numerous fault locations. Real transmission system parameters of 3-phase 400 kV Wardha-Aurangabad transmission line (400 km) with 40 % FSC at Power Grid Wardha Substation, India is considered for this research. Extensive simulation experiments show that the proposed scheme provides quite accurate results which demonstrate complete protection scheme with high accuracy, simplicity and robustness.
A New Adaptive Hungarian Mating Scheme in Genetic Algorithms
Directory of Open Access Journals (Sweden)
Chanju Jung
2016-01-01
Full Text Available In genetic algorithms, selection or mating scheme is one of the important operations. In this paper, we suggest an adaptive mating scheme using previously suggested Hungarian mating schemes. Hungarian mating schemes consist of maximizing the sum of mating distances, minimizing the sum, and random matching. We propose an algorithm to elect one of these Hungarian mating schemes. Every mated pair of solutions has to vote for the next generation mating scheme. The distance between parents and the distance between parent and offspring are considered when they vote. Well-known combinatorial optimization problems, the traveling salesperson problem, and the graph bisection problem are used for the test bed of our method. Our adaptive strategy showed better results than not only pure and previous hybrid schemes but also existing distance-based mating schemes.
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…
A Game Map Complexity Measure Based on Hamming Distance
Li, Yan; Su, Pan; Li, Wenliang
With the booming of PC game market, Game AI has attracted more and more researches. The interesting and difficulty of a game are relative with the map used in game scenarios. Besides, the path-finding efficiency in a game is also impacted by the complexity of the used map. In this paper, a novel complexity measure based on Hamming distance, called the Hamming complexity, is introduced. This measure is able to estimate the complexity of binary tileworld. We experimentally demonstrated that Hamming complexity is highly relative with the efficiency of A* algorithm, and therefore it is a useful reference to the designer when developing a game map.
Low Count Anomaly Detection at Large Standoff Distances
Pfund, David Michael; Jarman, Kenneth D.; Milbrath, Brian D.; Kiff, Scott D.; Sidor, Daniel E.
2010-02-01
Searching for hidden illicit sources of gamma radiation in an urban environment is difficult. Background radiation profiles are variable and cluttered with transient acquisitions from naturally occurring radioactive materials and medical isotopes. Potentially threatening sources likely will be nearly hidden in this noise and encountered at high standoff distances and low threat count rates. We discuss an anomaly detection algorithm that characterizes low count sources as threatening or non-threatening and operates well in the presence of high benign source variability. We discuss the algorithm parameters needed to reliably find sources both close to the detector and far away from it. These parameters include the cutoff frequencies of background tracking filters and the integration time of the spectrometer. This work is part of the development of the Standoff Radiation Imaging System (SORIS) as part of DNDO's Standoff Radiation Detection System Advanced Technology Demonstration (SORDS-ATD) program.
VIRTUAL LABORATORY IN DISTANCE LEARNING SYSTEM
Directory of Open Access Journals (Sweden)
Е. Kozlovsky
2011-11-01
Full Text Available Questions of designing and a choice of technologies of creation of virtual laboratory for the distance learning system are considered. Distance learning system «Kherson Virtual University» is used as illustration.
Distance Learning Plan Development: Initiating Organizational Structures
National Research Council Canada - National Science Library
Poole, Clifton
1998-01-01
.... Army distance learning plan managers to examine the DLPs they were directing. The analysis showed that neither army nor civilian distance learning plan managers used formalized requirements for organizational structure development (OSD...
When Do Distance Effects Become Empirically Observable?
DEFF Research Database (Denmark)
Beugelsdijk, Sjoerd; Nell, Phillip C.; Ambos, Björn
2017-01-01
Integrating distance research with the behavioral strategy literature on MNC headquarters-subsidiary relations, this paper explores how the distance between headquarters and subsidiaries relates to value added by the headquarters. We show for 124 manufacturing subsidiaries in Europe that...
Institutional Distance and the Internationalization Process
DEFF Research Database (Denmark)
Pogrebnyakov, Nicolai; Maitland, Carleen
2011-01-01
This paper applies the institutional lens to the internationalization process model. It updates the concept of psychic distance in the model with a recently developed, theoretically grounded construct of institutional distance. Institutions are considered simultaneously at the national and industry...
A Dependable Localization Algorithm for Survivable Belt-Type Sensor Networks.
Zhu, Mingqiang; Song, Fei; Xu, Lei; Seo, Jung Taek; You, Ilsun
2017-11-29
As the key element, sensor networks are widely investigated by the Internet of Things (IoT) community. When massive numbers of devices are well connected, malicious attackers may deliberately propagate fake position information to confuse the ordinary users and lower the network survivability in belt-type situation. However, most existing positioning solutions only focus on the algorithm accuracy and do not consider any security aspects. In this paper, we propose a comprehensive scheme for node localization protection, which aims to improve the energy-efficient, reliability and accuracy. To handle the unbalanced resource consumption, a node deployment mechanism is presented to satisfy the energy balancing strategy in resource-constrained scenarios. According to cooperation localization theory and network connection property, the parameter estimation model is established. To achieve reliable estimations and eliminate large errors, an improved localization algorithm is created based on modified average hop distances. In order to further improve the algorithms, the node positioning accuracy is enhanced by using the steepest descent method. The experimental simulations illustrate the performance of new scheme can meet the previous targets. The results also demonstrate that it improves the belt-type sensor networks' survivability, in terms of anti-interference, network energy saving, etc.
Anxiety and Resistance in Distance Learning
Nazime Tuncay; Huseyin Uzunboylu
2010-01-01
The purpose of this study was to investigate students' anxiety and resistance towards learning through distance education.Specifically, the study sought answers to the following questions: -What are the reasons of students not choosing distancelearning courses? -Which symptoms of anxiety, if any, do distance learner’s exhibit towards distance learning? Does genderhave any significant relationships with distance learners' perception of factors that affect their anxiety and resistance? A totalo...
Elasticity of Long Distance Travelling
DEFF Research Database (Denmark)
Knudsen, Mette Aagaard
2011-01-01
With data from the Danish expenditure survey for 12 years 1996 through 2007, this study analyses household expenditures for long distance travelling. Household expenditures are examined at two levels of aggregation having the general expenditures on transportation and leisure relative to five other...... aggregated commodities at the highest level, and the specific expenditures on plane tickets and travel packages at the lowest level. The Almost Ideal Demand System is applied to determine the relationship between expenditures on transportation and leisure and all other purchased non-durables within...... packages has higher income elasticity of demand than plane tickets but also higher than transportation and leisure in general. The findings within price sensitiveness are not as sufficient estimated, but the model results indicate that travel packages is far more price elastic than plane tickets which...
Classification With Truncated Distance Kernel.
Huang, Xiaolin; Suykens, Johan A K; Wang, Shuning; Hornegger, Joachim; Maier, Andreas
2018-05-01
This brief proposes a truncated distance (TL1) kernel, which results in a classifier that is nonlinear in the global region but is linear in each subregion. With this kernel, the subregion structure can be trained using all the training data and local linear classifiers can be established simultaneously. The TL1 kernel has good adaptiveness to nonlinearity and is suitable for problems which require different nonlinearities in different areas. Though the TL1 kernel is not positive semidefinite, some classical kernel learning methods are still applicable which means that the TL1 kernel can be directly used in standard toolboxes by replacing the kernel evaluation. In numerical experiments, the TL1 kernel with a pregiven parameter achieves similar or better performance than the radial basis function kernel with the parameter tuned by cross validation, implying the TL1 kernel a promising nonlinear kernel for classification tasks.
Improved artificial bee colony algorithm based gravity matching navigation method.
Gao, Wei; Zhao, Bo; Zhou, Guang Tao; Wang, Qiu Ying; Yu, Chun Yang
2014-07-18
Gravity matching navigation algorithm is one of the key technologies for gravity aided inertial navigation systems. With the development of intelligent algorithms, the powerful search ability of the Artificial Bee Colony (ABC) algorithm makes it possible to be applied to the gravity matching navigation field. However, existing search mechanisms of basic ABC algorithms cannot meet the need for high accuracy in gravity aided navigation. Firstly, proper modifications are proposed to improve the performance of the basic ABC algorithm. Secondly, a new search mechanism is presented in this paper which is based on an improved ABC algorithm using external speed information. At last, modified Hausdorff distance is introduced to screen the possible matching results. Both simulations and ocean experiments verify the feasibility of the method, and results show that the matching rate of the method is high enough to obtain a precise matching position.
Semioptimal practicable algorithmic cooling
International Nuclear Information System (INIS)
Elias, Yuval; Mor, Tal; Weinstein, Yossi
2011-01-01
Algorithmic cooling (AC) of spins applies entropy manipulation algorithms in open spin systems in order to cool spins far beyond Shannon's entropy bound. Algorithmic cooling of nuclear spins was demonstrated experimentally and may contribute to nuclear magnetic resonance spectroscopy. Several cooling algorithms were suggested in recent years, including practicable algorithmic cooling (PAC) and exhaustive AC. Practicable algorithms have simple implementations, yet their level of cooling is far from optimal; exhaustive algorithms, on the other hand, cool much better, and some even reach (asymptotically) an optimal level of cooling, but they are not practicable. We introduce here semioptimal practicable AC (SOPAC), wherein a few cycles (typically two to six) are performed at each recursive level. Two classes of SOPAC algorithms are proposed and analyzed. Both attain cooling levels significantly better than PAC and are much more efficient than the exhaustive algorithms. These algorithms are shown to bridge the gap between PAC and exhaustive AC. In addition, we calculated the number of spins required by SOPAC in order to purify qubits for quantum computation. As few as 12 and 7 spins are required (in an ideal scenario) to yield a mildly pure spin (60% polarized) from initial polarizations of 1% and 10%, respectively. In the latter case, about five more spins are sufficient to produce a highly pure spin (99.99% polarized), which could be relevant for fault-tolerant quantum computing.
Analysing designed experiments in distance sampling
Stephen T. Buckland; Robin E. Russell; Brett G. Dickson; Victoria A. Saab; Donal N. Gorman; William M. Block
2009-01-01
Distance sampling is a survey technique for estimating the abundance or density of wild animal populations. Detection probabilities of animals inherently differ by species, age class, habitats, or sex. By incorporating the change in an observer's ability to detect a particular class of animals as a function of distance, distance sampling leads to density estimates...
Distance learning: its advantages and disadvantages
KEGEYAN SVETLANA ERIHOVNA
2016-01-01
Distance learning has become popular in higher institutions because of its flexibility and availability to learners and teachers at anytime, regardless of geographic location. With so many definitions and phases of distance education, this paper only focuses on the delivery mode of distance education (the use of information technology), background, and its disadvantages and advantages for today’s learners.
ETUDE - European Trade Union Distance Education.
Creanor, Linda; Walker, Steve
2000-01-01
Describes transnational distance learning activities among European trade union educators carried out as part of the European Trade Union Distance Education (ETUDE) project, supported by the European Commission. Highlights include the context of international trade union distance education; tutor training course; tutors' experiences; and…
Continuity Properties of Distances for Markov Processes
DEFF Research Database (Denmark)
Jaeger, Manfred; Mao, Hua; Larsen, Kim Guldstrand
2014-01-01
In this paper we investigate distance functions on finite state Markov processes that measure the behavioural similarity of non-bisimilar processes. We consider both probabilistic bisimilarity metrics, and trace-based distances derived from standard Lp and Kullback-Leibler distances. Two desirable...
Enhancing multi-view autostereoscopic displays by viewing distance control (VDC)
Jurk, Silvio; Duckstein, Bernd; Renault, Sylvain; Kuhlmey, Mathias; de la Barré, René; Ebner, Thomas
2014-03-01
Conventional multi-view displays spatially interlace various views of a 3D scene and form appropriate viewing channels. However, they only support sufficient stereo quality within a limited range around the nominal viewing distance (NVD). If this distance is maintained, two slightly divergent views are projected to the person's eyes, both covering the entire screen. With increasing deviations from the NVD the stereo image quality decreases. As a major drawback in usability, the manufacturer so far assigns this distance. We propose a software-based solution that corrects false view assignments depending on the distance of the viewer. Our novel approach enables continuous view adaptation based on the calculation of intermediate views and a column-bycolumn rendering method. The algorithm controls each individual subpixel and generates a new interleaving pattern from selected views. In addition, we use color-coded test content to verify its efficacy. This novel technology helps shifting the physically determined NVD to a user-defined distance thereby supporting stereopsis. The recent viewing positions can fall in front or behind the NVD of the original setup. Our algorithm can be applied to all multi-view autostereoscopic displays — independent of the ascent or the periodicity of the optical element. In general, the viewing distance can be corrected with a factor of more than 2.5. By creating a continuous viewing area the visualized 3D content is suitable even for persons with largely divergent intraocular distance — adults and children alike — without any deficiency in spatial perception.
International Nuclear Information System (INIS)
Klinda, J.; Lieskovska, Z.
1998-01-01
In this chapter environmental protection in the Slovak Republic in 1997 are reviewed. The economics of environmental protection, state budget, Slovak state environmental fund, economic instruments, environmental laws, environmental impact assessment, environmental management systems, and environmental education are presented
Public Transport Route Finding using a Hybrid Genetic Algorithm
Liviu Adrian COTFAS; Andreea DIOSTEANU
2011-01-01
In this paper we present a public transport route finding solution based on a hybrid genetic algorithm. The algorithm uses two heuristics that take into consideration the number of trans-fers and the remaining distance to the destination station in order to improve the convergence speed. The interface of the system uses the latest web technologies to offer both portability and advanced functionality. The approach has been evaluated using the data for the Bucharest public transport network.
Public Transport Route Finding using a Hybrid Genetic Algorithm
Directory of Open Access Journals (Sweden)
Liviu Adrian COTFAS
2011-01-01
Full Text Available In this paper we present a public transport route finding solution based on a hybrid genetic algorithm. The algorithm uses two heuristics that take into consideration the number of trans-fers and the remaining distance to the destination station in order to improve the convergence speed. The interface of the system uses the latest web technologies to offer both portability and advanced functionality. The approach has been evaluated using the data for the Bucharest public transport network.
International Nuclear Information System (INIS)
Kastanya, Doddy
2012-01-01
Highlights: ► ADORE is an algorithm for CANDU ROP Detector Layout Optimization. ► ADORE-GA is a Genetic Algorithm variant of the ADORE algorithm. ► Robustness test of ADORE-GA algorithm is presented in this paper. - Abstract: The regional overpower protection (ROP) systems protect CANDU® reactors against overpower in the fuel that could reduce the safety margin-to-dryout. The overpower could originate from a localized power peaking within the core or a general increase in the global core power level. The design of the detector layout for ROP systems is a challenging discrete optimization problem. In recent years, two algorithms have been developed to find a quasi optimal solution to this detector layout optimization problem. Both of these algorithms utilize the simulated annealing (SA) algorithm as their optimization engine. In the present paper, an alternative optimization algorithm, namely the genetic algorithm (GA), has been implemented as the optimization engine. The implementation is done within the ADORE algorithm. Results from evaluating the effects of using various mutation rates and crossover parameters are presented in this paper. It has been demonstrated that the algorithm is sufficiently robust in producing similar quality solutions.
Introduction to Evolutionary Algorithms
Yu, Xinjie
2010-01-01
Evolutionary algorithms (EAs) are becoming increasingly attractive for researchers from various disciplines, such as operations research, computer science, industrial engineering, electrical engineering, social science, economics, etc. This book presents an insightful, comprehensive, and up-to-date treatment of EAs, such as genetic algorithms, differential evolution, evolution strategy, constraint optimization, multimodal optimization, multiobjective optimization, combinatorial optimization, evolvable hardware, estimation of distribution algorithms, ant colony optimization, particle swarm opti
Recursive forgetting algorithms
DEFF Research Database (Denmark)
Parkum, Jens; Poulsen, Niels Kjølstad; Holst, Jan
1992-01-01
In the first part of the paper, a general forgetting algorithm is formulated and analysed. It contains most existing forgetting schemes as special cases. Conditions are given ensuring that the basic convergence properties will hold. In the second part of the paper, the results are applied...... to a specific algorithm with selective forgetting. Here, the forgetting is non-uniform in time and space. The theoretical analysis is supported by a simulation example demonstrating the practical performance of this algorithm...
Explaining algorithms using metaphors
Forišek, Michal
2013-01-01
There is a significant difference between designing a new algorithm, proving its correctness, and teaching it to an audience. When teaching algorithms, the teacher's main goal should be to convey the underlying ideas and to help the students form correct mental models related to the algorithm. This process can often be facilitated by using suitable metaphors. This work provides a set of novel metaphors identified and developed as suitable tools for teaching many of the 'classic textbook' algorithms taught in undergraduate courses worldwide. Each chapter provides exercises and didactic notes fo
Algorithms in Algebraic Geometry
Dickenstein, Alicia; Sommese, Andrew J
2008-01-01
In the last decade, there has been a burgeoning of activity in the design and implementation of algorithms for algebraic geometric computation. Some of these algorithms were originally designed for abstract algebraic geometry, but now are of interest for use in applications and some of these algorithms were originally designed for applications, but now are of interest for use in abstract algebraic geometry. The workshop on Algorithms in Algebraic Geometry that was held in the framework of the IMA Annual Program Year in Applications of Algebraic Geometry by the Institute for Mathematics and Its
Woo, Andrew
2012-01-01
Digital shadow generation continues to be an important aspect of visualization and visual effects in film, games, simulations, and scientific applications. This resource offers a thorough picture of the motivations, complexities, and categorized algorithms available to generate digital shadows. From general fundamentals to specific applications, it addresses shadow algorithms and how to manage huge data sets from a shadow perspective. The book also examines the use of shadow algorithms in industrial applications, in terms of what algorithms are used and what software is applicable.
Spectral Decomposition Algorithm (SDA)
National Aeronautics and Space Administration — Spectral Decomposition Algorithm (SDA) is an unsupervised feature extraction technique similar to PCA that was developed to better distinguish spectral features in...
Quick fuzzy backpropagation algorithm.
Nikov, A; Stoeva, S
2001-03-01
A modification of the fuzzy backpropagation (FBP) algorithm called QuickFBP algorithm is proposed, where the computation of the net function is significantly quicker. It is proved that the FBP algorithm is of exponential time complexity, while the QuickFBP algorithm is of polynomial time complexity. Convergence conditions of the QuickFBP, resp. the FBP algorithm are defined and proved for: (1) single output neural networks in case of training patterns with different targets; and (2) multiple output neural networks in case of training patterns with equivalued target vector. They support the automation of the weights training process (quasi-unsupervised learning) establishing the target value(s) depending on the network's input values. In these cases the simulation results confirm the convergence of both algorithms. An example with a large-sized neural network illustrates the significantly greater training speed of the QuickFBP rather than the FBP algorithm. The adaptation of an interactive web system to users on the basis of the QuickFBP algorithm is presented. Since the QuickFBP algorithm ensures quasi-unsupervised learning, this implies its broad applicability in areas of adaptive and adaptable interactive systems, data mining, etc. applications.
Portfolios of quantum algorithms.
Maurer, S M; Hogg, T; Huberman, B A
2001-12-17
Quantum computation holds promise for the solution of many intractable problems. However, since many quantum algorithms are stochastic in nature they can find the solution of hard problems only probabilistically. Thus the efficiency of the algorithms has to be characterized by both the expected time to completion and the associated variance. In order to minimize both the running time and its uncertainty, we show that portfolios of quantum algorithms analogous to those of finance can outperform single algorithms when applied to the NP-complete problems such as 3-satisfiability.
Critical Points in Distance Learning System
Directory of Open Access Journals (Sweden)
Airina Savickaitė
2013-08-01
Full Text Available Purpose – This article presents the results of distance learning system analysis, i.e. the critical elements of the distance learning system. The critical points of distance learning are a part of distance education online environment interactivity/community process model. The most important is the fact that the critical point is associated with distance learning participants. Design/methodology/approach – Comparative review of articles and analysis of distance learning module. Findings – A modern man is a lifelong learner and distance learning is a way to be a modern person. The focus on a learner and feedback is the most important thing of learning distance system. Also, attention should be paid to the lecture-appropriate knowledge and ability to convey information. Distance system adaptation is the way to improve the learner’s learning outcomes. Research limitations/implications – Different learning disciplines and learning methods may have different critical points. Practical implications – The information of analysis could be important for both lecturers and students, who studies distance education systems. There are familiar critical points which may deteriorate the quality of learning. Originality/value – The study sought to develop remote systems for applications in order to improve the quality of knowledge. Keywords: distance learning, process model, critical points. Research type: review of literature and general overview.
Learner characteristics involved in distance learning
Energy Technology Data Exchange (ETDEWEB)
Cernicek, A.T.; Hahn, H.A.
1991-01-01
Distance learning represents a strategy for leveraging resources to solve educational and training needs. Although many distance learning programs have been developed, lessons learned regarding differences between distance learning and traditional education with respect to learner characteristics have not been well documented. Therefore, we conducted a survey of 20 distance learning professionals. The questionnaire was distributed to experts attending the second Distance Learning Conference sponsored by Los Alamos National Laboratory. This survey not only acquired demographic information from each of the respondents but also identified important distance learning student characteristics. Significant distance learner characteristics, which were revealed statistically and which influence the effectiveness of distance learning, include the following: reading level, student autonomy, and self-motivation. Distance learning cannot become a more useful and effective method of instruction without identifying and recognizing learner characteristics. It will be important to consider these characteristics when designing all distance learning courses. This paper will report specific survey findings and their implications for developing distance learning courses. 9 refs., 6 tabs.
Improved algorithms for approximate string matching (extended abstract
Directory of Open Access Journals (Sweden)
Papamichail Georgios
2009-01-01
Full Text Available Abstract Background The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition. A great effort has been made to design efficient algorithms addressing several variants of the problem, including comparison of two strings, approximate pattern identification in a string or calculation of the longest common subsequence that two strings share. Results We designed an output sensitive algorithm solving the edit distance problem between two strings of lengths n and m respectively in time O((s - |n - m|·min(m, n, s + m + n and linear space, where s is the edit distance between the two strings. This worst-case time bound sets the quadratic factor of the algorithm independent of the longest string length and improves existing theoretical bounds for this problem. The implementation of our algorithm also excels in practice, especially in cases where the two strings compared differ significantly in length. Conclusion We have provided the design, analysis and implementation of a new algorithm for calculating the edit distance of two strings with both theoretical and practical implications. Source code of our algorithm is available online.
Distance Education at Silesian University of Technology
Directory of Open Access Journals (Sweden)
Piotr Klosowski
2008-12-01
Full Text Available This paper presents Distance Learning Platform used by Silesian University of Technology. Distance Learning Platform is based on modular object-oriented dynamic learning environment, represents LMS (Learning Management Systems technology, a software package designed to help educators create quality online courses. Currently on Distance Learning Platform at Silesian University of Technology are available over 520 online courses created for students of twelve University's faculties. Number of Distance Learning Platform users exceeds 12000. Distance Learning Platform works as typically asynchronous e-learning service, but in the future more synchronous e-learning services will be added. Distance Learning Platform has great potential to create a successful elearning experience by providing a plethora of excellent tools that can be used to enhance conventional classroom instruction, in hybrid courses, or any distance learning arrangements.
International Nuclear Information System (INIS)
Lim, Mu Ji; Jung, Hae Sang
1974-10-01
This book is divided into two chapters, which deals with protective relay. The first chapter deals with the basic knowledge of relay on development of relay, classification of protective relay, rating of protective relay general structure of protective relay, detecting of ground protection, about point of contact, operating relay and trip relaying. The second chapter is about structure and explanation of relay on classification by structure such as motor type and moving-coil type, explanation of other relays over current relay, over voltage relay, short voltage relay, relay for power, relay for direction, test of over voltage relay, test of short voltage relay and test of directional circuit relay.
DEFF Research Database (Denmark)
Sofka, Wolfgang; de Faria, Pedro; Shehu, Edlira
2018-01-01
Most firms use secrecy to protect their knowledge from potential imitators. However, the theoretical foundations for secrecy have not been well explored. We extend knowledge protection literature and propose theoretical mechanisms explaining how information visibility influences the importance...... of secrecy as a knowledge protection instrument. Building on mechanisms from information economics and signaling theory, we postulate that secrecy is more important for protecting knowledge for firms that have legal requirements to reveal information to shareholders. Furthermore, we argue that this effect...... and a firm's investment in fixed assets. Our findings inform both academics and managers on how firms balance information disclosure requirements with the use of secrecy as a knowledge protection instrument....
The impact of SFCL and SMES integration on the distance relay
Energy Technology Data Exchange (ETDEWEB)
Yang, Jun, E-mail: JYang@whu.edu.cn [School of Electrical Engineering, Wuhan University, Wuhan 430072 (China); Zhang, Liling; Wang, Xinpu; Chen, Lei [School of Electrical Engineering, Wuhan University, Wuhan 430072 (China); Chen, Yanxia [Beijing Electric Power Research Institute, Beijing 100075 (China)
2016-11-15
Highlights: • The impact of SFCL and SMES integration on the circle distance relay is studied. • The detailed models of SFCL and SMES with distance delay are built in MATLAB. • The integration of SFCL and SMES does influence the operation of distance relay. • An improved distance relay to prevent mal-operation is proposed and verified. - Abstract: The superconducting fault current limiter (SFCL) is an ideal short-circuit fault current limiting device that can limit the fault current without any delay and control the voltage drop of the non-fault line. The superconducting magnetic energy storage (SMES) device can exchange the active and reactive power independently, so it is applied broadly to improve power system stability. With SFCL, the low voltage ride-through capability of SMES can be enhanced as well as its MW and MJ capacities. The distance relay is a key electrical apparatus that will trip circuit breakers to protect electrical devices from short circuit faults. Due to the application of SFCL and SMES integration, the voltage and current in power grid will change accordingly, and the operation characteristic of distance relay may be affected. In this paper, the impact of a bridge-type SFCL and SMES integration on the circle distance relay is studied. And simulation results show that the integration of SFCL and SMES does influence the measured impedance of distance relay, which can lead to mal-operation of the circle distance relay. Furthermore, an improved distance relay is proposed and verified.
The impact of SFCL and SMES integration on the distance relay
International Nuclear Information System (INIS)
Yang, Jun; Zhang, Liling; Wang, Xinpu; Chen, Lei; Chen, Yanxia
2016-01-01
Highlights: • The impact of SFCL and SMES integration on the circle distance relay is studied. • The detailed models of SFCL and SMES with distance delay are built in MATLAB. • The integration of SFCL and SMES does influence the operation of distance relay. • An improved distance relay to prevent mal-operation is proposed and verified. - Abstract: The superconducting fault current limiter (SFCL) is an ideal short-circuit fault current limiting device that can limit the fault current without any delay and control the voltage drop of the non-fault line. The superconducting magnetic energy storage (SMES) device can exchange the active and reactive power independently, so it is applied broadly to improve power system stability. With SFCL, the low voltage ride-through capability of SMES can be enhanced as well as its MW and MJ capacities. The distance relay is a key electrical apparatus that will trip circuit breakers to protect electrical devices from short circuit faults. Due to the application of SFCL and SMES integration, the voltage and current in power grid will change accordingly, and the operation characteristic of distance relay may be affected. In this paper, the impact of a bridge-type SFCL and SMES integration on the circle distance relay is studied. And simulation results show that the integration of SFCL and SMES does influence the measured impedance of distance relay, which can lead to mal-operation of the circle distance relay. Furthermore, an improved distance relay is proposed and verified.
Gallant, Joseph
1999-04-01
One of the goals of physics education is to instill a sense of wonder in our students. We hope our natural curiosity will rub off on them and that they will apply the critical thinking skills we teach them to other aspects of their lives outside the classroom. As an example of this, consider the situation described in Milton's epic poem ``Paradise Lost''. Milton wrote that when the devil was cast out of heaven, he fell for nine days before landing in hell. In Milton's universe, hell is a separate place from Earth, but many people place hell at the center of the Earth. Based on these ideas, we can apply Newton's laws of motion to calculate the distance from heaven to Earth. This exercise is an example of the kind of intellectual exercise a physicist (or a physics student) might carry out when confronted with such information. We apply the basic principles of physics to a situation described in work of literature while making no attempt to validate or refute any philosophy, theology or ideology.
Algorithm 426 : Merge sort algorithm [M1
Bron, C.
1972-01-01
Sorting by means of a two-way merge has a reputation of requiring a clerically complicated and cumbersome program. This ALGOL 60 procedure demonstrates that, using recursion, an elegant and efficient algorithm can be designed, the correctness of which is easily proved [2]. Sorting n objects gives
A Chroma-based Tempo-insensitive Distance Measure for Cover Song Identification
DEFF Research Database (Denmark)
Jensen, Jesper Højvang; Ellis, Dan P. W.; Christensen, Mads Græsbøll
In the context of music, a cover version is a remake of a song, often with significant stylistic variation. In this paper we describe a distance measure between sampled audio files that is designed to be insensitive to instrumentation, time shift, temporal scaling and transpositions. The algorithm...
Sum of All-Pairs Shortest Path Distances in a Planar Graph in Subquadratic Time
DEFF Research Database (Denmark)
Wulff-Nilsen, Christian
2008-01-01
We consider the problem of computing the Wiener index of a graph, defined as the sum of distances between all pairs of its vertices. It is an open problem whether the Wiener index of a planar graph can be found in subquadratic time. We solve this problem by presenting an algorithm with O(n^2*log...
Computing the discrete fréchet distance with imprecise input
Ahn, Heekap; Knauer, Christian; Scherfenberg, Marc; Schlipf, Lena; Vigneron, Antoine E.
2012-01-01
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
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…
Reducing braking distance by control of semi-active suspension
Energy Technology Data Exchange (ETDEWEB)
Niemz, T.
2007-07-01
This thesis presents a control algorithm for semi-active suspensions to reduce the braking distance of passenger cars. Active shock absorbers are controlled and used to influence the vertical dynamics during ABS-controlled full braking. The core of the approach presented in this paper is based on a switching control logic. The control algorithm is implemented in a compact class passenger car. Test drives on a real road, using a braking machine for reproducibility reasons, have been executed. It could be shown that it is possible to reduce the braking distance by affecting on the vertical dynamics of a passenger car in general. This is the first experimental result of this kind published ever. The amount of reduction depends on the height profile of the testing track chosen and on the initial velocity. On a road with an unevenness comparable to the one on a typical German Autobahn an average reduction of 1-2%, compared to the best passive damping, was achieved. (orig.)
Bearing and Range Estimation Algorithm for Buried Object in Underwater Acoustics
Directory of Open Access Journals (Sweden)
Dong Han
2009-01-01
(DOA of objects and objects-sensors distances, is used in MUSIC algorithm instead of classical model. The influence of the depth of buried objects is discussed. Finally, the numerical results are given in the case of buried cylindrical shells.
An algorithm for determination of geodetic path for application in long-range acoustic propagation
Digital Repository Service at National Institute of Oceanography (India)
Murty, T.V.R.; Sivakholundu, K.M.; Navelkar, G.S.; Somayajulu, Y.K.; Murty, C.S.
the distance of interest subject to initial conditions and a azimuth (forward problem). Inverse problem has been solved interatively based on the spheroidal geometry to supplement the initial conditions to the forward problem. The algorithm has been test...
Design of a Ground-Launched Ballistic Missile Interceptor Using a Genetic Algorithm
National Research Council Canada - National Science Library
Anderson, Murray
1999-01-01
...) minimize maximum U-loading. In 50 generations the genetic algorithm was able to develop two basic types of external aerodynamic designs that performed nearly the same, with miss distances less than 1.0 foot...
Development of an operationally efficient PTC braking enforcement algorithm for freight trains.
2013-08-01
Software algorithms used in positive train control (PTC) systems designed to predict freight train stopping distance and enforce a penalty brake application have been shown to be overly conservative, which can lead to operational inefficiencies by in...
Distance relay performance in future converter dominated power systems
DEFF Research Database (Denmark)
Sarkar, Moumita; Jia, Jundi; Yang, Guangya
2017-01-01
Increasing penetration of converter-based generations in power system has led to new system challenges. Short circuit power response from converter-based generations is different from that of traditional synchronous generators. Power electronic converters can be designed for over-current only up ...... of converter controls on fault current response of converter-based generations is also investigated. Index Terms—Converter control, distance relays, power system protection, system modelling....... to 1.1-1.25 times of its nominal value. Low availability of short circuit power can cause many challenges such as misoperation of distance relays. The aim of this paper is to investigate the effect of converter dominated systems on performance of distance relays. Backup functionality of the distance...... relay is major concern as miscoordination of backup relays in case of cascading faults can lead to severe stress in system, which can develop into blackout. In this paper, response of relays in traditional system is compared with response of relays in low short-circuit-current power systems. Impact...
Composite Differential Search Algorithm
Directory of Open Access Journals (Sweden)
Bo Liu
2014-01-01
Full Text Available Differential search algorithm (DS is a relatively new evolutionary algorithm inspired by the Brownian-like random-walk movement which is used by an organism to migrate. It has been verified to be more effective than ABC, JDE, JADE, SADE, EPSDE, GSA, PSO2011, and CMA-ES. In this paper, we propose four improved solution search algorithms, namely “DS/rand/1,” “DS/rand/2,” “DS/current to rand/1,” and “DS/current to rand/2” to search the new space and enhance the convergence rate for the global optimization problem. In order to verify the performance of different solution search methods, 23 benchmark functions are employed. Experimental results indicate that the proposed algorithm performs better than, or at least comparable to, the original algorithm when considering the quality of the solution obtained. However, these schemes cannot still achieve the best solution for all functions. In order to further enhance the convergence rate and the diversity of the algorithm, a composite differential search algorithm (CDS is proposed in this paper. This new algorithm combines three new proposed search schemes including “DS/rand/1,” “DS/rand/2,” and “DS/current to rand/1” with three control parameters using a random method to generate the offspring. Experiment results show that CDS has a faster convergence rate and better search ability based on the 23 benchmark functions.
Algorithms and Their Explanations
Benini, M.; Gobbo, F.; Beckmann, A.; Csuhaj-Varjú, E.; Meer, K.
2014-01-01
By analysing the explanation of the classical heapsort algorithm via the method of levels of abstraction mainly due to Floridi, we give a concrete and precise example of how to deal with algorithmic knowledge. To do so, we introduce a concept already implicit in the method, the ‘gradient of
Finite lattice extrapolation algorithms
International Nuclear Information System (INIS)
Henkel, M.; Schuetz, G.
1987-08-01
Two algorithms for sequence extrapolation, due to von den Broeck and Schwartz and Bulirsch and Stoer are reviewed and critically compared. Applications to three states and six states quantum chains and to the (2+1)D Ising model show that the algorithm of Bulirsch and Stoer is superior, in particular if only very few finite lattice data are available. (orig.)
Recursive automatic classification algorithms
Energy Technology Data Exchange (ETDEWEB)
Bauman, E V; Dorofeyuk, A A
1982-03-01
A variational statement of the automatic classification problem is given. The dependence of the form of the optimal partition surface on the form of the classification objective functional is investigated. A recursive algorithm is proposed for maximising a functional of reasonably general form. The convergence problem is analysed in connection with the proposed algorithm. 8 references.
DEFF Research Database (Denmark)
Husfeldt, Thore
2015-01-01
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available...
8. Algorithm Design Techniques
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 2; Issue 8. Algorithms - Algorithm Design Techniques. R K Shyamasundar. Series Article Volume 2 ... Author Affiliations. R K Shyamasundar1. Computer Science Group, Tata Institute of Fundamental Research, Homi Bhabha Road, Mumbai 400 005, India ...
Multi-AGV path planning with double-path constraints by using an improved genetic algorithm.
Directory of Open Access Journals (Sweden)
Zengliang Han
Full Text Available This paper investigates an improved genetic algorithm on multiple automated guided vehicle (multi-AGV path planning. The innovations embody in two aspects. First, three-exchange crossover heuristic operators are used to produce more optimal offsprings for getting more information than with the traditional two-exchange crossover heuristic operators in the improved genetic algorithm. Second, double-path constraints of both minimizing the total path distance of all AGVs and minimizing single path distances of each AGV are exerted, gaining the optimal shortest total path distance. The simulation results show that the total path distance of all AGVs and the longest single AGV path distance are shortened by using the improved genetic algorithm.
Dynamic programming algorithms for biological sequence comparison.
Pearson, W R; Miller, W
1992-01-01
Efficient dynamic programming algorithms are available for a broad class of protein and DNA sequence comparison problems. These algorithms require computer time proportional to the product of the lengths of the two sequences being compared [O(N2)] but require memory space proportional only to the sum of these lengths [O(N)]. Although the requirement for O(N2) time limits use of the algorithms to the largest computers when searching protein and DNA sequence databases, many other applications of these algorithms, such as calculation of distances for evolutionary trees and comparison of a new sequence to a library of sequence profiles, are well within the capabilities of desktop computers. In particular, the results of library searches with rapid searching programs, such as FASTA or BLAST, should be confirmed by performing a rigorous optimal alignment. Whereas rapid methods do not overlook significant sequence similarities, FASTA limits the number of gaps that can be inserted into an alignment, so that a rigorous alignment may extend the alignment substantially in some cases. BLAST does not allow gaps in the local regions that it reports; a calculation that allows gaps is very likely to extend the alignment substantially. Although a Monte Carlo evaluation of the statistical significance of a similarity score with a rigorous algorithm is much slower than the heuristic approach used by the RDF2 program, the dynamic programming approach should take less than 1 hr on a 386-based PC or desktop Unix workstation. For descriptive purposes, we have limited our discussion to methods for calculating similarity scores and distances that use gap penalties of the form g = rk. Nevertheless, programs for the more general case (g = q+rk) are readily available. Versions of these programs that run either on Unix workstations, IBM-PC class computers, or the Macintosh can be obtained from either of the authors.
Geometric approximation algorithms
Har-Peled, Sariel
2011-01-01
Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, and slow. Over the last 20 years a theory of geometric approximation algorithms has emerged. These algorithms tend to be simple, fast, and more robust than their exact counterparts. This book is the first to cover geometric approximation algorithms in detail. In addition, more traditional computational geometry techniques that are widely used in developing such algorithms, like sampling, linear programming, etc., are also surveyed. Other topics covered include approximate nearest-neighbor search, shape approximation, coresets, dimension reduction, and embeddings. The topics covered are relatively independent and are supplemented by exercises. Close to 200 color figures are included in the text to illustrate proofs and ideas.
Group leaders optimization algorithm
Daskin, Anmer; Kais, Sabre
2011-03-01
We present a new global optimization algorithm in which the influence of the leaders in social groups is used as an inspiration for the evolutionary technique which is designed into a group architecture. To demonstrate the efficiency of the method, a standard suite of single and multi-dimensional optimization functions along with the energies and the geometric structures of Lennard-Jones clusters are given as well as the application of the algorithm on quantum circuit design problems. We show that as an improvement over previous methods, the algorithm scales as N 2.5 for the Lennard-Jones clusters of N-particles. In addition, an efficient circuit design is shown for a two-qubit Grover search algorithm which is a quantum algorithm providing quadratic speedup over the classical counterpart.
International Nuclear Information System (INIS)
Noga, M.T.
1984-01-01
This thesis addresses a number of important problems that fall within the framework of the new discipline of Computational Geometry. The list of topics covered includes sorting and selection, convex hull algorithms, the L 1 hull, determination of the minimum encasing rectangle of a set of points, the Euclidean and L 1 diameter of a set of points, the metric traveling salesman problem, and finding the superrange of star-shaped and monotype polygons. The main theme of all the work was to develop a set of very fast state-of-the-art algorithms that supersede any rivals in terms of speed and ease of implementation. In some cases existing algorithms were refined; for others new techniques were developed that add to the present database of fast adaptive geometric algorithms. What emerges is a collection of techniques that is successful at merging modern tools developed in analysis of algorithms with those of classical geometry
Totally parallel multilevel algorithms
Frederickson, Paul O.
1988-01-01
Four totally parallel algorithms for the solution of a sparse linear system have common characteristics which become quite apparent when they are implemented on a highly parallel hypercube such as the CM2. These four algorithms are Parallel Superconvergent Multigrid (PSMG) of Frederickson and McBryan, Robust Multigrid (RMG) of Hackbusch, the FFT based Spectral Algorithm, and Parallel Cyclic Reduction. In fact, all four can be formulated as particular cases of the same totally parallel multilevel algorithm, which are referred to as TPMA. In certain cases the spectral radius of TPMA is zero, and it is recognized to be a direct algorithm. In many other cases the spectral radius, although not zero, is small enough that a single iteration per timestep keeps the local error within the required tolerance.
Directory of Open Access Journals (Sweden)
Francesca Musiani
2013-08-01
Full Text Available Algorithms are increasingly often cited as one of the fundamental shaping devices of our daily, immersed-in-information existence. Their importance is acknowledged, their performance scrutinised in numerous contexts. Yet, a lot of what constitutes 'algorithms' beyond their broad definition as “encoded procedures for transforming input data into a desired output, based on specified calculations” (Gillespie, 2013 is often taken for granted. This article seeks to contribute to the discussion about 'what algorithms do' and in which ways they are artefacts of governance, providing two examples drawing from the internet and ICT realm: search engine queries and e-commerce websites’ recommendations to customers. The question of the relationship between algorithms and rules is likely to occupy an increasingly central role in the study and the practice of internet governance, in terms of both institutions’ regulation of algorithms, and algorithms’ regulation of our society.
Where genetic algorithms excel.
Baum, E B; Boneh, D; Garrett, C
2001-01-01
We analyze the performance of a genetic algorithm (GA) we call Culling, and a variety of other algorithms, on a problem we refer to as the Additive Search Problem (ASP). We show that the problem of learning the Ising perceptron is reducible to a noisy version of ASP. Noisy ASP is the first problem we are aware of where a genetic-type algorithm bests all known competitors. We generalize ASP to k-ASP to study whether GAs will achieve "implicit parallelism" in a problem with many more schemata. GAs fail to achieve this implicit parallelism, but we describe an algorithm we call Explicitly Parallel Search that succeeds. We also compute the optimal culling point for selective breeding, which turns out to be independent of the fitness function or the population distribution. We also analyze a mean field theoretic algorithm performing similarly to Culling on many problems. These results provide insight into when and how GAs can beat competing methods.
DEFF Research Database (Denmark)
Bilardi, Gianfranco; Pietracaprina, Andrea; Pucci, Geppino
2016-01-01
A framework is proposed for the design and analysis of network-oblivious algorithms, namely algorithms that can run unchanged, yet efficiently, on a variety of machines characterized by different degrees of parallelism and communication capabilities. The framework prescribes that a network......-oblivious algorithm be specified on a parallel model of computation where the only parameter is the problem’s input size, and then evaluated on a model with two parameters, capturing parallelism granularity and communication latency. It is shown that for a wide class of network-oblivious algorithms, optimality...... of cache hierarchies, to the realm of parallel computation. Its effectiveness is illustrated by providing optimal network-oblivious algorithms for a number of key problems. Some limitations of the oblivious approach are also discussed....
[Near infrared distance sensing method for Chang'e-3 alpha particle X-ray spectrometer].
Liang, Xiao-Hua; Wu, Ming-Ye; Wang, Huan-Yu; Peng, Wen-Xi; Zhang, Cheng-Mo; Cui, Xing-Zhu; Wang, Jin-Zhou; Zhang, Jia-Yu; Yang, Jia-Wei; Fan, Rui-Rui; Gao, Min; Liu, Ya-Qing; Zhang, Fei; Dong, Yi-Fan; Guo, Dong-Ya
2013-05-01
Alpha particle X-ray spectrometer (APXS) is one of the payloads of Chang'E-3 lunar rover, the scientific objective of which is in-situ observation and off-line analysis of lunar regolith and rock. Distance measurement is one of the important functions for APXS to perform effective detection on the moon. The present paper will first give a brief introduction to APXS, and then analyze the specific requirements and constraints to realize distance measurement, at last present a new near infrared distance sensing algorithm by using the inflection point of response curve. The theoretical analysis and the experiment results verify the feasibility of this algorithm. Although the theoretical analysis shows that this method is not sensitive to the operating temperature and reflectance of the lunar surface, the solar infrared radiant intensity may make photosensor saturation. The solutions are reducing the gain of device and avoiding direct exposure to sun light.
Giant sparks at cosmological distances?
International Nuclear Information System (INIS)
Kulkarni, S. R.; Ofek, E. O.; Neill, J. D.; Zheng, Z.; Juric, M.
2014-01-01
Millisecond-duration bright radio pulses at 1.4 GHz with high dispersion measures (DMs) were reported by Lorimer et al., Keane et al., and Thornton et al. Their all-sky rate is ≈10 4 day –1 above ∼1 Jy. Related events are 'Perytons'–similar pulsed, dispersed sources, but most certainly local. Suggested models of fast radio bursts (FRBs) can originate in Earth's atmosphere, in stellar coronae, in other galaxies, and even at cosmological distances. Using physically motivated assumptions combined with observed properties, we explore these models. In our analysis, we focus on the Lorimer event: a 30 Jy, 5 ms duration burst with DM = 375 cm –3 pc, exhibiting a steep frequency-dependent pulse width (the Sparker). To be complete, we drop the assumption that high DMs are produced by plasma propagation and assume that the source produces pulses with frequency-dependent arrival time ('chirped signals'). Within this framework, we explore a scenario in which Perytons, the Sparker, and the FRBs are all atmospheric phenomena occurring at different heights. This model is ad hoc in that we cannot explain why Perytons at higher altitudes show greater DMs or exhibit narrower pulses. Nonetheless, we argue that the Sparker may be a Peryton. We end with two remarks. First, the detection of a single FRB by an interferometer with a kilometer (or longer) baseline will prove that FRBs are of extraterrestrial origin. Second, we urge astronomers to pursue observations and understanding of Perytons since they form (at least) a formidable foreground for the FRBs.
Giant sparks at cosmological distances?
Energy Technology Data Exchange (ETDEWEB)
Kulkarni, S. R. [Caltech Optical Observatories 249-17, California Institute of Technology, Pasadena, CA 91125 (United States); Ofek, E. O. [Department of Particle Physics and Astrophysics, Weizmann Institute of Science, Rehovot 76100 (Israel); Neill, J. D. [Space Radiation Laboratory 290-17, California Institute of Technology, Pasadena, CA 91125 (United States); Zheng, Z. [Department of Physics and Astronomy, University of Utah, 115 South 1400 East 201, Salt Lake City, UT 84112 (United States); Juric, M. [Department of Astronomy, University of Washington, Box 351580, Seattle, WA 98195 (United States)
2014-12-10
Millisecond-duration bright radio pulses at 1.4 GHz with high dispersion measures (DMs) were reported by Lorimer et al., Keane et al., and Thornton et al. Their all-sky rate is ≈10{sup 4} day{sup –1} above ∼1 Jy. Related events are 'Perytons'–similar pulsed, dispersed sources, but most certainly local. Suggested models of fast radio bursts (FRBs) can originate in Earth's atmosphere, in stellar coronae, in other galaxies, and even at cosmological distances. Using physically motivated assumptions combined with observed properties, we explore these models. In our analysis, we focus on the Lorimer event: a 30 Jy, 5 ms duration burst with DM = 375 cm{sup –3} pc, exhibiting a steep frequency-dependent pulse width (the Sparker). To be complete, we drop the assumption that high DMs are produced by plasma propagation and assume that the source produces pulses with frequency-dependent arrival time ('chirped signals'). Within this framework, we explore a scenario in which Perytons, the Sparker, and the FRBs are all atmospheric phenomena occurring at different heights. This model is ad hoc in that we cannot explain why Perytons at higher altitudes show greater DMs or exhibit narrower pulses. Nonetheless, we argue that the Sparker may be a Peryton. We end with two remarks. First, the detection of a single FRB by an interferometer with a kilometer (or longer) baseline will prove that FRBs are of extraterrestrial origin. Second, we urge astronomers to pursue observations and understanding of Perytons since they form (at least) a formidable foreground for the FRBs.
Modification of MSDR algorithm and ITS implementation on graph clustering
Prastiwi, D.; Sugeng, K. A.; Siswantining, T.
2017-07-01
Maximum Standard Deviation Reduction (MSDR) is a graph clustering algorithm to minimize the distance variation within a cluster. In this paper we propose a modified MSDR by replacing one technical step in MSDR which uses polynomial regression, with a new and simpler step. This leads to our new algorithm called Modified MSDR (MMSDR). We implement the new algorithm to separate a domestic flight network of an Indonesian airline into two large clusters. Further analysis allows us to discover a weak link in the network, which should be improved by adding more flights.
A decision algorithm for patch spraying
DEFF Research Database (Denmark)
Christensen, Svend; Heisel, Torben; Walter, Mette
2003-01-01
method that estimates an economic optimal herbicide dose according to site-specific weed composition and density is presented in this paper. The method was termed a ‘decision algorithm for patch spraying’ (DAPS) and was evaluated in a 5-year experiment, in Denmark. DAPS consists of a competition model......, a herbicide dose–response model and an algorithm that estimates the economically optimal doses. The experiment was designed to compare herbicide treatments with DAPS recommendations and the Danish decision support system PC-Plant Protection. The results did not show any significant grain yield difference...
Qin, Jiahu; Fu, Weiming; Gao, Huijun; Zheng, Wei Xing
2016-03-03
This paper is concerned with developing a distributed k-means algorithm and a distributed fuzzy c-means algorithm for wireless sensor networks (WSNs) where each node is equipped with sensors. The underlying topology of the WSN is supposed to be strongly connected. The consensus algorithm in multiagent consensus theory is utilized to exchange the measurement information of the sensors in WSN. To obtain a faster convergence speed as well as a higher possibility of having the global optimum, a distributed k-means++ algorithm is first proposed to find the initial centroids before executing the distributed k-means algorithm and the distributed fuzzy c-means algorithm. The proposed distributed k-means algorithm is capable of partitioning the data observed by the nodes into measure-dependent groups which have small in-group and large out-group distances, while the proposed distributed fuzzy c-means algorithm is capable of partitioning the data observed by the nodes into different measure-dependent groups with degrees of membership values ranging from 0 to 1. Simulation results show that the proposed distributed algorithms can achieve almost the same results as that given by the centralized clustering algorithms.
AN ARTIFICIAL INTELLIGENCE-BASED DISTANCE EDUCATION SYSTEM: Artimat
Directory of Open Access Journals (Sweden)
Vasif NABIYEV
2013-04-01
Full Text Available The purpose of this study is to evaluate the artificial intelligence-based distance education system called as ARTIMAT, which has been prepared in order to improve mathematical problem solving skills of the students, in terms of conceptual proficiency and ease of use with the opinions of teachers and students. The implementation has been performed with 4 teachers and 59 students in 10th grade in an Anatolian High School in Trabzon. Many institutions and organizations in the world approach seriously to distance education besides traditional education. It is inevitable to use the distance education in teaching the problem solving skills in this different dimension of the education. In the studies in Turkey and abroad in the field of mathematics teaching, problem solving skills are generally stated not to be at the desired level and often expressed to have difficulty in teaching. For this reason, difficulties of the students in problem solving have initially been evaluated and the system has been prepared utilizing artificial intelligence algorithms according to the obtained results. In the evaluation of the findings obtained from the application, it has been concluded that the system is responsive to the needs of the students and is successful in general, but that conceptual changes should be made in order that students adapt to the system quickly.
MALT90 Kinematic Distances to Dense Molecular Clumps
Energy Technology Data Exchange (ETDEWEB)
Whitaker, J. Scott [Physics Department, Boston University, 590 Commonwealth Avenue, Boston, MA 02215 (United States); Jackson, James M.; Sanhueza, Patricio; Stephens, Ian W. [Institute for Astrophysical Research, Boston University, Boston, MA 02215 (United States); Rathborne, J. M. [CSIRO Astronomy and Space Science, P.O. Box 76, Epping NSW 1710 (Australia); Foster, J. B. [Department of Astronomy, Yale University, P.O. Box 28101, New Haven, CT 06520-8101 (United States); Contreras, Y. [Leiden Observatory, Leiden University, P.O. Box 9513, 2300 RA Leiden (Netherlands); Longmore, S. N., E-mail: scott@bu.edu [Astrophysics Research Institute, Liverpool John Moores University, Egerton Wharf, Birkenhead CH41 1LD (United Kingdom)
2017-10-01
Using molecular-line data from the Millimetre Astronomy Legacy Team 90 GHz Survey (MALT90), we have estimated kinematic distances to 1905 molecular clumps identified in the ATLASGAL 870 μ m continuum survey over the longitude range 295° < l < 350°. The clump velocities were determined using a flux-weighted average of the velocities obtained from Gaussian fits to the HCO{sup +}, HNC, and N{sub 2}H{sup +} (1–0) transitions. The near/far kinematic distance ambiguity was addressed by searching for the presence or absence of absorption or self-absorption features in 21 cm atomic hydrogen spectra from the Southern Galactic Plane Survey. Our algorithm provides an estimation of the reliability of the ambiguity resolution. The Galactic distribution of the clumps indicates positions where the clumps are bunched together, and these locations probably trace the locations of spiral arms. Several clumps fall at the predicted location of the far side of the Scutum–Centaurus arm. Moreover, a number of clumps with positive radial velocities are unambiguously located on the far side of the Milky Way at galactocentric radii beyond the solar circle. The measurement of these kinematic distances, in combination with continuum or molecular-line data, now enables the determination of fundamental parameters such as mass, size, and luminosity for each clump.
Digital integrated protection system
International Nuclear Information System (INIS)
Savornin, M.; Furet, M.
1978-01-01
As a result of technological progress it is now possible to achieve more elaborate protection functions able to follow more closely the phenomena to be supervised. For this reason the CEA, Framatome and Merlin/Gerin/CERCI have undertaken in commonn to develop a Digital Integrated Protection System (D.I.P.S.). This system is designed with the following aims: to improve the safety of the station, . to improve its availability, . to facilitate installation, . to facilitate tests and maintenance. The main characteristics adopted are: . possibilities of obtaining more elaborate monitoring and protection algorithm treatments, . order 4 redundancy of transducers, associated instruments and signal processing, . possibility of inhibiting part of the protection system, . standardisation of equipment, physical and electrical separation of redundant units, . use of multiplexed connections, . automation of tests. Four flow charts are presented: - DIPS with four APUP (Acquisition and Processing Unit for Protection) - APUP - LSU (Logic Safeguard Unit), number LSU corresponding to number fluidic safeguard circuits, - structure of a function unit, - main functions of the APUP [fr
Distance factor on reducing scattered radiation risk during interventional fluoroscopy
International Nuclear Information System (INIS)
Husaini Salleh; Mohd Khalid Matori; Muhammad Jamal Mat Isa; Zainal Jamaluddin; Mohd Firdaus Abdul Rahman; Mohd Khairusalih Mohd Zin
2012-01-01
Interventional Radiology (IR) is subspecialty of diagnostic radiology where minimally invasive procedures are performed using an x-ray as a guidance. This procedure can deliver high radiation doses to patient and medical staff compared with other radiological method due to long screening time. The use of proper shielding, shorten the exposure time and keep the distance are the practices to reduce scattered radiation risks to staff involve in this procedure. This project is to study the distance factor on reducing the scattered radiation effect to the medical staff. It also may provide the useful information which can be use to establish the scattered radiation profile during the IR for the sake of radiation protection and safety to the medical staff involved. (author)
ADULT LEARNERS IN DISTANCE HIGHER EDUCATION
Directory of Open Access Journals (Sweden)
NORICA-FELICIA BUCUR
2012-05-01
Full Text Available This paper attempts at identifying the main features that characterize distance higher education and adult education, respectively, in order to be able to establish to what extent adult learners can fit in distance higher education programs. The historical background of distance learning education, the factors that influence adult learners, and distance learning’s key objectives, effects, issues, advantages, and disadvantages are to be briefly investigated in order to reach the purpose of this paper. Recent developments in Information Technology have led to a new approach to teaching and learning, especially as far as adult learning and distance learning are concerned. Thus, this study will also focus on the consequences of using technology for course design, delivery, and the perception of adult learners participating in distance learning.
Distance and Cable Length Measurement System
Hernández, Sergio Elias; Acosta, Leopoldo; Toledo, Jonay
2009-01-01
A simple, economic and successful design for distance and cable length detection is presented. The measurement system is based on the continuous repetition of a pulse that endlessly travels along the distance to be detected. There is a pulse repeater at both ends of the distance or cable to be measured. The endless repetition of the pulse generates a frequency that varies almost inversely with the distance to be measured. The resolution and distance or cable length range could be adjusted by varying the repetition time delay introduced at both ends and the measurement time. With this design a distance can be measured with centimeter resolution using electronic system with microsecond resolution, simplifying classical time of flight designs which require electronics with picosecond resolution. This design was also applied to position measurement. PMID:22303169
Computing the Quartet Distance Between Evolutionary Trees in Time O(n log n)
DEFF Research Database (Denmark)
Brodal, Gerth Sølfting; Fagerberg, Rolf; Pedersen, Christian Nørgaard Storm
2003-01-01
Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is therefore an important task. The quartet distance is a distance measure between trees previously proposed by Estabrook, McMorris, and ...... unrooted evolutionary trees of n species, where all internal nodes have degree three, in time O(n log n. The previous best algorithm for the problem uses time O(n 2).......Evolutionary trees describing the relationship for a set of species are central in evolutionary biology, and quantifying differences between evolutionary trees is therefore an important task. The quartet distance is a distance measure between trees previously proposed by Estabrook, Mc......Morris, and Meacham. The quartet distance between two unrooted evolutionary trees is the number of quartet topology differences between the two trees, where a quartet topology is the topological subtree induced by four species. In this paper we present an algorithm for computing the quartet distance between two...
The distances of nearby cool carbon stars
International Nuclear Information System (INIS)
Bergeat, J.; Sibille, F.; Lunel, M.
1978-01-01
Distance ratios are provided for 38 cool carbon stars on the basis of a previous study (Bergeat et al., 1976 a,b,c). The validation of this distance scale is obtained through an analysis of stellar velocities. A relationship is established between proper motions and the distance scale. Luminosities and radii are derived for cool carbon stars which permit a discussion of their evolutionary status. Finally, evaluations are given for the rate of mass ejection corresponding to large graphite grains. (WL) [de
Long distance signaling using axionlike particles
International Nuclear Information System (INIS)
Stancil, Daniel D.
2007-01-01
The possible existence of axionlike particles could lead to a new type of long-distance communication. In this work, basic antenna concepts are defined and a Friis-like equation is derived to facilitate long-distance link calculations. An example calculation is presented showing that communication over distances of 1000 km or more may be possible for m a aγγ >5x10 -8 GeV -1
Cardiovascular Risks in Long Distance Runners.
Witham, Bethany Rolfe; Babbitt, Keven
Distance running has become increasingly popular since the 1970s. Despite the health benefits, long-distance running has been associated with an increased risk for cardiac events. Healthcare professionals should be familiar with distance running cardiac risk factors and preparticipation screening recommendations from the American Heart Association, and should screen and educate patients during healthcare encounters. Nurses are particularly well suited to educate runners on risks and symptoms of cardiac dysfunction.
A tentative theory of large distance physics
International Nuclear Information System (INIS)
Friedan, Daniel
2003-01-01
A theoretical mechanism is devised to determine the large distance physics of spacetime. It is a two dimensional nonlinear model, the lambda model, set to govern the string world surface in an attempt to remedy the failure of string theory, as it stands. The lambda model is formulated to cancel the infrared divergent effects of handles at short distance on the world surface. The target manifold is the manifold of background spacetimes. The coupling strength is the spacetime coupling constant. The lambda model operates at 2d distance Δ -1 , very much shorter than the 2d distance μ -1 where the world surface is seen. A large characteristic spacetime distance L is given by L 2 ln(Δ/μ). Spacetime fields of wave number up to 1=L are the local coordinates for the manifold of spacetimes. The distribution of fluctuations at 2d distances shorter than Δ -1 gives the a priori measure on the target manifold, the manifold of spacetimes. If this measure concentrates at a macroscopic spacetime, then, nearby, it is a measure on the spacetime fields. The lambda model thereby constructs a spacetime quantum field theory, cutoff at ultraviolet distance L, describing physics at distances larger than L. The lambda model also constructs an effective string theory with infrared cutoff L, describing physics at distances smaller than L. The lambda model evolves outward from zero 2d distance, Δ -1 = 0, building spacetime physics starting from L ∞ and proceeding downward in L. L can be taken smaller than any distance practical for experiments, so the lambda model, if right, gives all actually observable physics. The harmonic surfaces in the manifold of spacetimes are expected to have novel nonperturbative effects at large distances. (author)
Adaptive algorithm based on antenna arrays for radio communication systems
Directory of Open Access Journals (Sweden)
Fedosov Valentin
2017-01-01
always noticeably accelerate traffic at short distances from the access point, but, they are very effective at long distances. The MIMO principle allows reducing the number of errors in radio data interchange (BER without reducing the transmission rate under conditions of multiple signal re-reflections. The work aims at developing an adaptive space-time signal algorithm for a wireless data transmission system designed to improve the efficiency of this system, as well as to study the efficiency of the algorithm to minimizing the error bit probability and maximizing the channel capacity.
Measuring Disorientation Based on the Needleman-Wunsch Algorithm
Güyer, Tolga; Atasoy, Bilal; Somyürek, Sibel
2015-01-01
This study offers a new method to measure navigation disorientation in web based systems which is powerful learning medium for distance and open education. The Needleman-Wunsch algorithm is used to measure disorientation in a more precise manner. The process combines theoretical and applied knowledge from two previously distinct research areas,…
Starting design for use in variance exchange algorithms | Iwundu ...
African Journals Online (AJOL)
A new method of constructing the initial design for use in variance exchange algorithms is presented. The method chooses support points to go into the design as measures of distances of the support points from the centre of the geometric region and of permutation-invariant sets. The initial design is as close as possible to ...
Energy Technology Data Exchange (ETDEWEB)
Liebau, F. [Technische Univ. Berlin (Germany). Fachbereich 3 - Mathematik; Rudolphi, R. [Bundesanstalt fuer Materialforschung und -pruefung (BAM), Berlin (Germany)
2001-07-01
If we apply the multistep method of W. Gear for the integration of a system of ordinary differential equations to the nonlinear heat conduction equation in the implementation EPISODE, this results in memory problems due to the band structure of the Jacobian, because EPISODE uses a LU-decomposition with pivoting. The report describes measures which suit this method to the actual conditions. If we use the storage scheme for sparse matrices from Liebau, Rudolphi, only the nonzero elements of the Jacobian are stored. In case of a linear problem, this matrix only has to be computed once. The BI-CGSTAB-method, an iterative method, replaces the LU-decomposition resp. the solution of the linear (and possibly non-symmetric) system of equations resulting from the corrector step. If {tau} is the time step length and h the space step length, this BICG-variant has good convergence properties for a moderate ratio of {tau}/h{sup 2}. The report also includes a short description of the program INSTATCP developed in Borland Delphi 4/Object Pascal. Two applications from the field of fire protection and thermal insulation in buildings (fire insulated steel column and vertically perforated brick) show that the modifications of the Gear method work effectively. (orig.) [German] Wird das Mehrschnittverfahren von W. Gear zur Integration eines Systems gewoehnlicher Differentialgleichungen in der Implementation EPISODE auf die nichtlineare Waermeleitungsgleichung angewandt, so ergeben sich aufgrund der Bandstruktur der Jacobi-Matrix Speicherplatzprobleme, da EPISODE eine LU-Zerlegung mit Pivot-Wahl benutzt. Der Bericht beschreibt Massnahmen, mit denen das Verfahren an die hier vorliegende Situation angepasst wird. Durch die Verwendung des Speicherschemas fuer Sparse-Matrizen aus Liebau, Rudolphi werden nur die Nichtnullelemente der Jacobi-Matrix gespeichert. Liegt insbesondere ein lineares Problem vor, so braucht diese Matrix nur einmal berechnet zu werden. Das BI-CGSTAB-Verfahren, also
Long-distance calls in Neotropical primates
Directory of Open Access Journals (Sweden)
Oliveira Dilmar A.G.
2004-01-01
Full Text Available Long-distance calls are widespread among primates. Several studies concentrate on such calls in just one or in few species, while few studies have treated more general trends within the order. The common features that usually characterize these vocalizations are related to long-distance propagation of sounds. The proposed functions of primate long-distance calls can be divided into extragroup and intragroup ones. Extragroup functions relate to mate defense, mate attraction or resource defense, while intragroup functions involve group coordination or alarm. Among Neotropical primates, several species perform long-distance calls that seem more related to intragroup coordination, markedly in atelines. Callitrichids present long-distance calls that are employed both in intragroup coordination and intergroup contests or spacing. Examples of extragroup directed long-distance calls are the duets of titi monkeys and the roars and barks of howler monkeys. Considerable complexity and gradation exist in the long-distance call repertoires of some Neotropical primates, and female long-distance calls are probably more important in non-duetting species than usually thought. Future research must focus on larger trends in the evolution of primate long-distance calls, including the phylogeny of calling repertoires and the relationships between form and function in these signals.
Directory of Open Access Journals (Sweden)
Hans Schonemann
1996-12-01
Full Text Available Some algorithms for singularity theory and algebraic geometry The use of Grobner basis computations for treating systems of polynomial equations has become an important tool in many areas. This paper introduces of the concept of standard bases (a generalization of Grobner bases and the application to some problems from algebraic geometry. The examples are presented as SINGULAR commands. A general introduction to Grobner bases can be found in the textbook [CLO], an introduction to syzygies in [E] and [St1]. SINGULAR is a computer algebra system for computing information about singularities, for use in algebraic geometry. The basic algorithms in SINGULAR are several variants of a general standard basis algorithm for general monomial orderings (see [GG]. This includes wellorderings (Buchberger algorithm ([B1], [B2] and tangent cone orderings (Mora algorithm ([M1], [MPT] as special cases: It is able to work with non-homogeneous and homogeneous input and also to compute in the localization of the polynomial ring in 0. Recent versions include algorithms to factorize polynomials and a factorizing Grobner basis algorithm. For a complete description of SINGULAR see [Si].
Galaxies Gather at Great Distances
2006-01-01
[figure removed for brevity, see original site] Distant Galaxy Cluster Infrared Survey Poster [figure removed for brevity, see original site] [figure removed for brevity, see original site] Bird's Eye View Mosaic Bird's Eye View Mosaic with Clusters [figure removed for brevity, see original site] [figure removed for brevity, see original site] [figure removed for brevity, see original site] 9.1 Billion Light-Years 8.7 Billion Light-Years 8.6 Billion Light-Years Astronomers have discovered nearly 300 galaxy clusters and groups, including almost 100 located 8 to 10 billion light-years away, using the space-based Spitzer Space Telescope and the ground-based Mayall 4-meter telescope at Kitt Peak National Observatory in Tucson, Ariz. The new sample represents a six-fold increase in the number of known galaxy clusters and groups at such extreme distances, and will allow astronomers to systematically study massive galaxies two-thirds of the way back to the Big Bang. A mosaic portraying a bird's eye view of the field in which the distant clusters were found is shown at upper left. It spans a region of sky 40 times larger than that covered by the full moon as seen from Earth. Thousands of individual images from Spitzer's infrared array camera instrument were stitched together to create this mosaic. The distant clusters are marked with orange dots. Close-up images of three of the distant galaxy clusters are shown in the adjoining panels. The clusters appear as a concentration of red dots near the center of each image. These images reveal the galaxies as they were over 8 billion years ago, since that's how long their light took to reach Earth and Spitzer's infrared eyes. These pictures are false-color composites, combining ground-based optical images captured by the Mosaic-I camera on the Mayall 4-meter telescope at Kitt Peak, with infrared pictures taken by Spitzer's infrared array camera. Blue and green represent visible light at wavelengths of 0.4 microns and 0.8 microns
A New Modified Firefly Algorithm
Directory of Open Access Journals (Sweden)
Medha Gupta
2016-07-01
Full Text Available Nature inspired meta-heuristic algorithms studies the emergent collective intelligence of groups of simple agents. Firefly Algorithm is one of the new such swarm-based metaheuristic algorithm inspired by the flashing behavior of fireflies. The algorithm was first proposed in 2008 and since then has been successfully used for solving various optimization problems. In this work, we intend to propose a new modified version of Firefly algorithm (MoFA and later its performance is compared with the standard firefly algorithm along with various other meta-heuristic algorithms. Numerical studies and results demonstrate that the proposed algorithm is superior to existing algorithms.
International Nuclear Information System (INIS)
Dinev, D.
1996-01-01
Several new algorithms for sorting of dipole and/or quadrupole magnets in synchrotrons and storage rings are described. The algorithms make use of a combinatorial approach to the problem and belong to the class of random search algorithms. They use an appropriate metrization of the state space. The phase-space distortion (smear) is used as a goal function. Computational experiments for the case of the JINR-Dubna superconducting heavy ion synchrotron NUCLOTRON have shown a significant reduction of the phase-space distortion after the magnet sorting. (orig.)
R2 & NE: NAVTEQ 2011 Q3 Distance Marker Points for the United States in SDC Format
U.S. Environmental Protection Agency — The DISTMARKER layer contains sequentially numbered markers placed along roads at regular intervals that serve as reference location signs. Distance Markers includes...
Benchmarking Distance Control and Virtual Drilling for Lateral Skull Base Surgery.
Voormolen, Eduard H J; Diederen, Sander; van Stralen, Marijn; Woerdeman, Peter A; Noordmans, Herke Jan; Viergever, Max A; Regli, Luca; Robe, Pierre A; Berkelbach van der Sprenkel, Jan Willem
2018-01-01
Novel audiovisual feedback methods were developed to improve image guidance during skull base surgery by providing audiovisual warnings when the drill tip enters a protective perimeter set at a distance around anatomic structures ("distance control") and visualizing bone drilling ("virtual drilling"). To benchmark the drill damage risk reduction provided by distance control, to quantify the accuracy of virtual drilling, and to investigate whether the proposed feedback methods are clinically feasible. In a simulated surgical scenario using human cadavers, 12 unexperienced users (medical students) drilled 12 mastoidectomies. Users were divided into a control group using standard image guidance and 3 groups using distance control with protective perimeters of 1, 2, or 3 mm. Damage to critical structures (sigmoid sinus, semicircular canals, facial nerve) was assessed. Neurosurgeons performed another 6 mastoidectomy/trans-labyrinthine and retro-labyrinthine approaches. Virtual errors as compared with real postoperative drill cavities were calculated. In a clinical setting, 3 patients received lateral skull base surgery with the proposed feedback methods. Users drilling with distance control protective perimeters of 3 mm did not damage structures, whereas the groups using smaller protective perimeters and the control group injured structures. Virtual drilling maximum cavity underestimations and overestimations were 2.8 ± 0.1 and 3.3 ± 0.4 mm, respectively. Feedback methods functioned properly in the clinical setting. Distance control reduced the risks of drill damage proportional to the protective perimeter distance. Errors in virtual drilling reflect spatial errors of the image guidance system. These feedback methods are clinically feasible. Copyright © 2017 Elsevier Inc. All rights reserved.
International Nuclear Information System (INIS)
Loos, M.
2002-01-01
Major achievements of SCK-CEN's Radiation Protection Department in 2001 are described. The main areas for R and D of the department are enviromnental remediation, emergency planning, radiation protection research, low-level radioactvity measurements, safeguards and physics measurements, decision strategy research and policy support and social sciences in nuclear research. Main achievements for 2001 in these areas are reported
... sun exposure. The start of summer is when UV rays can cause the most skin damage. Use sun protection, even on cloudy days. Clouds and haze don't protect you from the sun. Avoid surfaces that reflect light, such as water, sand, concrete, snow, and areas ...
Efficient sequential and parallel algorithms for record linkage.
Mamun, Abdullah-Al; Mi, Tian; Aseltine, Robert; Rajasekaran, Sanguthevar
2014-01-01
Integrating data from multiple sources is a crucial and challenging problem. Even though there exist numerous algorithms for record linkage or deduplication, they suffer from either large time needs or restrictions on the number of datasets that they can integrate. In this paper we report efficient sequential and parallel algorithms for record linkage which handle any number of datasets and outperform previous algorithms. Our algorithms employ hierarchical clustering algorithms as the basis. A key idea that we use is radix sorting on certain attributes to eliminate identical records before any further processing. Another novel idea is to form a graph that links similar records and find the connected components. Our sequential and parallel algorithms have been tested on a real dataset of 1,083,878 records and synthetic datasets ranging in size from 50,000 to 9,000,000 records. Our sequential algorithm runs at least two times faster, for any dataset, than the previous best-known algorithm, the two-phase algorithm using faster computation of the edit distance (TPA (FCED)). The speedups obtained by our parallel algorithm are almost linear. For example, we get a speedup of 7.5 with 8 cores (residing in a single node), 14.1 with 16 cores (residing in two nodes), and 26.4 with 32 cores (residing in four nodes). We have compared the performance of our sequential algorithm with TPA (FCED) and found that our algorithm outperforms the previous one. The accuracy is the same as that of this previous best-known algorithm.
Trajectory data privacy protection based on differential privacy mechanism
Gu, Ke; Yang, Lihao; Liu, Yongzhi; Liao, Niandong
2018-05-01
In this paper, we propose a trajectory data privacy protection scheme based on differential privacy mechanism. In the proposed scheme, the algorithm first selects the protected points from the user’s trajectory data; secondly, the algorithm forms the polygon according to the protected points and the adjacent and high frequent accessed points that are selected from the accessing point database, then the algorithm calculates the polygon centroids; finally, the noises are added to the polygon centroids by the differential privacy method, and the polygon centroids replace the protected points, and then the algorithm constructs and issues the new trajectory data. The experiments show that the running time of the proposed algorithms is fast, the privacy protection of the scheme is effective and the data usability of the scheme is higher.
Incremental fuzzy C medoids clustering of time series data using dynamic time warping distance
Chen, Jingli; Wu, Shuai; Liu, Zhizhong; Chao, Hao
2018-01-01
Clustering time series data is of great significance since it could extract meaningful statistics and other characteristics. Especially in biomedical engineering, outstanding clustering algorithms for time series may help improve the health level of people. Considering data scale and time shifts of time series, in this paper, we introduce two incremental fuzzy clustering algorithms based on a Dynamic Time Warping (DTW) distance. For recruiting Single-Pass and Online patterns, our algorithms could handle large-scale time series data by splitting it into a set of chunks which are processed sequentially. Besides, our algorithms select DTW to measure distance of pair-wise time series and encourage higher clustering accuracy because DTW could determine an optimal match between any two time series by stretching or compressing segments of temporal data. Our new algorithms are compared to some existing prominent incremental fuzzy clustering algorithms on 12 benchmark time series datasets. The experimental results show that the proposed approaches could yield high quality clusters and were better than all the competitors in terms of clustering accuracy. PMID:29795600
Incremental fuzzy C medoids clustering of time series data using dynamic time warping distance.
Liu, Yongli; Chen, Jingli; Wu, Shuai; Liu, Zhizhong; Chao, Hao
2018-01-01
Clustering time series data is of great significance since it could extract meaningful statistics and other characteristics. Especially in biomedical engineering, outstanding clustering algorithms for time series may help improve the health level of people. Considering data scale and time shifts of time series, in this paper, we introduce two incremental fuzzy clustering algorithms based on a Dynamic Time Warping (DTW) distance. For recruiting Single-Pass and Online patterns, our algorithms could handle large-scale time series data by splitting it into a set of chunks which are processed sequentially. Besides, our algorithms select DTW to measure distance of pair-wise time series and encourage higher clustering accuracy because DTW could determine an optimal match between any two time series by stretching or compressing segments of temporal data. Our new algorithms are compared to some existing prominent incremental fuzzy clustering algorithms on 12 benchmark time series datasets. The experimental results show that the proposed approaches could yield high quality clusters and were better than all the competitors in terms of clustering accuracy.
Indoor Robot Positioning Using an Enhanced Trilateration Algorithm
Directory of Open Access Journals (Sweden)
Pablo Cotera
2016-06-01
Full Text Available This paper presents algorithms implemented for positioning a wheeled robot on a production floor inside a factory by means of radio-frequency distance measurement and trilateration techniques. A set of radio-frequency transceivers located on the columns of the factory (anchors create a grid with several triangular zones capable of measuring the line-of-sight distance between each anchor and the transceiver installed in the wheeled robot. After measuring only three of these distances (radii, an enhanced trilateration algorithm is applied to obtain X and Y coordinates in a Cartesian plane, i.e., the position of the robot on the factory floor. The embedded systems developed for the anchors and the robot are robust enough to establish communication, select the closest anchors for measuring radii, and identify in which of the grid zones the robot is located.
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
van Kranenburg, H.L.; Hagedoorn, J.; Lorenz-Orlean, S.
2014-01-01
This research studies the effect of specific institutional and distance cost issues, in particular the protection of intellectual property rights and geographic distance, on the preference of companies for different governance modalities in terms of the degree of their involvement in international
A Novel Method to Implement the Matrix Pencil Super Resolution Algorithm for Indoor Positioning
Directory of Open Access Journals (Sweden)
Tariq Jamil Saifullah Khanzada
2011-10-01
Full Text Available This article highlights the estimation of the results for the algorithms implemented in order to estimate the delays and distances for the indoor positioning system. The data sets for the transmitted and received signals are captured at a typical outdoor and indoor area. The estimation super resolution algorithms are applied. Different state of art and super resolution techniques based algorithms are applied to avail the optimal estimates of the delays and distances between the transmitted and received signals and a novel method for matrix pencil algorithm is devised. The algorithms perform variably at different scenarios of transmitted and received positions. Two scenarios are experienced, for the single antenna scenario the super resolution techniques like ESPRIT (Estimation of Signal Parameters via Rotational Invariance Technique and theMatrix Pencil algorithms give optimal performance compared to the conventional techniques. In two antenna scenario RootMUSIC and Matrix Pencil algorithm performed better than other algorithms for the distance estimation, however, the accuracy of all the algorithms is worst than the single antenna scenario. In all cases our devised Matrix Pencil algorithm achieved the best estimation results.
National Wind Distance Learning Collaborative
Energy Technology Data Exchange (ETDEWEB)
Dr. James B. Beddow
2013-03-29
Executive Summary The energy development assumptions identified in the Department of Energy's position paper, 20% Wind Energy by 2030, projected an exploding demand for wind energy-related workforce development. These primary assumptions drove a secondary set of assumptions that early stage wind industry workforce development and training paradigms would need to undergo significant change if the workforce needs were to be met. The current training practice and culture within the wind industry is driven by a relatively small number of experts with deep field experience and knowledge. The current training methodology is dominated by face-to-face, classroom based, instructor present training. Given these assumptions and learning paradigms, the purpose of the National Wind Distance Learning Collaborative was to determine the feasibility of developing online learning strategies and products focused on training wind technicians. The initial project scope centered on (1) identifying resources that would be needed for development of subject matter and course design/delivery strategies for industry-based (non-academic) training, and (2) development of an appropriate Learning Management System (LMS). As the project unfolded, the initial scope was expanded to include development of learning products and the addition of an academic-based training partner. The core partners included two training entities, industry-based Airstreams Renewables and academic-based Lake Area Technical Institute. A third partner, Vision Video Interactive, Inc. provided technology-based learning platforms (hardware and software). The revised scope yielded an expanded set of results beyond the initial expectation. Eight learning modules were developed for the industry-based Electrical Safety course. These modules were subsequently redesigned and repurposed for test application in an academic setting. Software and hardware developments during the project's timeframe enabled redesign providing
AN IMPROVED FUZZY CLUSTERING ALGORITHM FOR MICROARRAY IMAGE SPOTS SEGMENTATION
Directory of Open Access Journals (Sweden)
V.G. Biju
2015-11-01
Full Text Available An automatic cDNA microarray image processing using an improved fuzzy clustering algorithm is presented in this paper. The spot segmentation algorithm proposed uses the gridding technique developed by the authors earlier, for finding the co-ordinates of each spot in an image. Automatic cropping of spots from microarray image is done using these co-ordinates. The present paper proposes an improved fuzzy clustering algorithm Possibility fuzzy local information c means (PFLICM to segment the spot foreground (FG from background (BG. The PFLICM improves fuzzy local information c means (FLICM algorithm by incorporating typicality of a pixel along with gray level information and local spatial information. The performance of the algorithm is validated using a set of simulated cDNA microarray images added with different levels of AWGN noise. The strength of the algorithm is tested by computing the parameters such as the Segmentation matching factor (SMF, Probability of error (pe, Discrepancy distance (D and Normal mean square error (NMSE. SMF value obtained for PFLICM algorithm shows an improvement of 0.9 % and 0.7 % for high noise and low noise microarray images respectively compared to FLICM algorithm. The PFLICM algorithm is also applied on real microarray images and gene expression values are computed.
An Enhanced Genetic Algorithm for the Generalized Traveling Salesman Problem
Directory of Open Access Journals (Sweden)
H. Jafarzadeh
2017-12-01
Full Text Available The generalized traveling salesman problem (GTSP deals with finding the minimum-cost tour in a clustered set of cities. In this problem, the traveler is interested in finding the best path that goes through all clusters. As this problem is NP-hard, implementing a metaheuristic algorithm to solve the large scale problems is inevitable. The performance of these algorithms can be intensively promoted by other heuristic algorithms. In this study, a search method is developed that improves the quality of the solutions and competition time considerably in comparison with Genetic Algorithm. In the proposed algorithm, the genetic algorithms with the Nearest Neighbor Search (NNS are combined and a heuristic mutation operator is applied. According to the experimental results on a set of standard test problems with symmetric distances, the proposed algorithm finds the best solutions in most cases with the least computational time. The proposed algorithm is highly competitive with the published until now algorithms in both solution quality and running time.
Algorithms for parallel computers
International Nuclear Information System (INIS)
Churchhouse, R.F.
1985-01-01
Until relatively recently almost all the algorithms for use on computers had been designed on the (usually unstated) assumption that they were to be run on single processor, serial machines. With the introduction of vector processors, array processors and interconnected systems of mainframes, minis and micros, however, various forms of parallelism have become available. The advantage of parallelism is that it offers increased overall processing speed but it also raises some fundamental questions, including: (i) which, if any, of the existing 'serial' algorithms can be adapted for use in the parallel mode. (ii) How close to optimal can such adapted algorithms be and, where relevant, what are the convergence criteria. (iii) How can we design new algorithms specifically for parallel systems. (iv) For multi-processor systems how can we handle the software aspects of the interprocessor communications. Aspects of these questions illustrated by examples are considered in these lectures. (orig.)
Fluid structure coupling algorithm
International Nuclear Information System (INIS)
McMaster, W.H.; Gong, E.Y.; Landram, C.S.; Quinones, D.F.
1980-01-01
A fluid-structure-interaction algorithm has been developed and incorporated into the two-dimensional code PELE-IC. This code combines an Eulerian incompressible fluid algorithm with a Lagrangian finite element shell algorithm and incorporates the treatment of complex free surfaces. The fluid structure and coupling algorithms have been verified by the calculation of solved problems from the literature and from air and steam blowdown experiments. The code has been used to calculate loads and structural response from air blowdown and the oscillatory condensation of steam bubbles in water suppression pools typical of boiling water reactors. The techniques developed have been extended to three dimensions and implemented in the computer code PELE-3D
Hockney, Roger
1987-01-01
Algorithmic phase diagrams are a neat and compact representation of the results of comparing the execution time of several algorithms for the solution of the same problem. As an example, the recent results are shown of Gannon and Van Rosendale on the solution of multiple tridiagonal systems of equations in the form of such diagrams. The act of preparing these diagrams has revealed an unexpectedly complex relationship between the best algorithm and the number and size of the tridiagonal systems, which was not evident from the algebraic formulae in the original paper. Even so, for a particular computer, one diagram suffices to predict the best algorithm for all problems that are likely to be encountered the prediction being read directly from the diagram without complex calculation.
Diagnostic Algorithm Benchmarking
Poll, Scott
2011-01-01
A poster for the NASA Aviation Safety Program Annual Technical Meeting. It describes empirical benchmarking on diagnostic algorithms using data from the ADAPT Electrical Power System testbed and a diagnostic software framework.
Inclusive Flavour Tagging Algorithm
International Nuclear Information System (INIS)
Likhomanenko, Tatiana; Derkach, Denis; Rogozhnikov, Alex
2016-01-01
Identifying the flavour of neutral B mesons production is one of the most important components needed in the study of time-dependent CP violation. The harsh environment of the Large Hadron Collider makes it particularly hard to succeed in this task. We present an inclusive flavour-tagging algorithm as an upgrade of the algorithms currently used by the LHCb experiment. Specifically, a probabilistic model which efficiently combines information from reconstructed vertices and tracks using machine learning is proposed. The algorithm does not use information about underlying physics process. It reduces the dependence on the performance of lower level identification capacities and thus increases the overall performance. The proposed inclusive flavour-tagging algorithm is applicable to tag the flavour of B mesons in any proton-proton experiment. (paper)
Unsupervised learning algorithms
Aydin, Kemal
2016-01-01
This book summarizes the state-of-the-art in unsupervised learning. The contributors discuss how with the proliferation of massive amounts of unlabeled data, unsupervised learning algorithms, which can automatically discover interesting and useful patterns in such data, have gained popularity among researchers and practitioners. The authors outline how these algorithms have found numerous applications including pattern recognition, market basket analysis, web mining, social network analysis, information retrieval, recommender systems, market research, intrusion detection, and fraud detection. They present how the difficulty of developing theoretically sound approaches that are amenable to objective evaluation have resulted in the proposal of numerous unsupervised learning algorithms over the past half-century. The intended audience includes researchers and practitioners who are increasingly using unsupervised learning algorithms to analyze their data. Topics of interest include anomaly detection, clustering,...
Vector Network Coding Algorithms
Ebrahimi, Javad; Fragouli, Christina
2010-01-01
We develop new algebraic algorithms for scalar and vector network coding. In vector network coding, the source multicasts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L x L coding matrices that play a similar role as coding c in scalar coding. Our algorithms for scalar network jointly optimize the employed field size while selecting the coding coefficients. Similarly, for vector coding, our algori...
Optimization algorithms and applications
Arora, Rajesh Kumar
2015-01-01
Choose the Correct Solution Method for Your Optimization ProblemOptimization: Algorithms and Applications presents a variety of solution techniques for optimization problems, emphasizing concepts rather than rigorous mathematical details and proofs. The book covers both gradient and stochastic methods as solution techniques for unconstrained and constrained optimization problems. It discusses the conjugate gradient method, Broyden-Fletcher-Goldfarb-Shanno algorithm, Powell method, penalty function, augmented Lagrange multiplier method, sequential quadratic programming, method of feasible direc
Energy Technology Data Exchange (ETDEWEB)
Huening, R [Fachhochschule Muenster, Burgsteinfurt (Germany, F.R.). Fachbereich Versorgungstechnik
1977-01-01
In order to effectively protect long-distance gas pipelines against mountain damage in the areas in which underground mining is done, expansion compensators must be built in at certain distances. The tests to determine the slippage resistance and the highest permissible distance of expanders Lsub(max) in a transmission line NW 600 having a plastic insulation are described in this work. In addition, a way of calculating the Lsub(max) value from the existing data for pipes of varying diameter and different insulating material is shown.