Search results for "A* algorithm"
showing 10 items of 2538 documents
Optimization of Low-Cost Monitoring Systems for On-Site Earthquake Early-Warning of Critical Infrastructures
2020
In the last years, monitoring systems based on low-cost and miniaturized sensors (MEMS) revealed as a very successful compromise between the availability of data and their quality. Also applications in the field of seismic and structural monitoring have been constantly increasing in term of number and variety of functions. Among these applications, the implementation of systems for earthquake early warning is a cutting-edge topic, mainly for its relevance for the society as millions of peoples in various regions of the world are exposed to high seismic hazard. This paper introduces the optimization of an already established seismic (and structural) monitoring system, that would make it suit…
Algorithms for Pallet Building and Truck Loading in an Interdepot Transportation Problem
2016
This paper deals with the problem of a logistics company that has to serve its customers by first putting the products on pallets and then loading the pallets into trucks. Besides the standard geometric constraints of products not overlapping each other and not exceeding the dimensions of pallets and trucks, in this real problem, there are many other constraints, related to the total weight of the load, the maximum weight supported by each axle, and the distribution of the load inside the truck. Although the problem can be decomposed into two phases, pallet loading and truck loading, we have taken a combined approach, building and placing pallets at the same time. For each position in the t…
$O(n^2 log n)$ Time On-line Construction of Two-Dimensional Suffix Trees
2007
The two-dimensional suffix tree of an n × n square matrix A is a compacted trie that represents all square submatrices of A [11]. For the off-line case, i.e., A is given in advance to the algorithm, it is known how to build it in optimal time, for any type of alphabet size [11], [18]. Motivated by applications in Image Compression [22], Giancarlo and Guaiana [14] considered the on-line version of the two-dimensional suffix tree and presented an O(n2 log2 n)-time algorithm, which we refer to as GG. That algorithm is a nontrivial generalization of Ukkonen’s on-line algorithm for standard suffix trees [23]. The main contribution in this paper is an O(logn) factor improvement in the time comple…
Evaluation of an Algorithm for Retrospective Hypoglycemia Detection Using Professional Continuous Glucose Monitoring Data.
2014
Background: People with type 1 diabetes (T1D) are unable to produce insulin and thus rely on exogenous supply to lower their blood glucose. Studies have shown that intensive insulin therapy reduces the risk of late-diabetic complications by lowering average blood glucose. However, the therapy leads to increased incidence of hypoglycemia. Although inaccurate, professional continuous glucose monitoring (PCGM) can be used to identify hypoglycemic events, which can be useful for adjusting glucose-regulating factors. New pattern classification approaches based on identifying hypoglycemic events through retrospective analysis of PCGM data have shown promising results. The aim of this study was to…
Marketing Research Regarding the Usage of Online Social Networking Sites by High School Students
2013
This paper aims to present the concept of online social networks (OSN) and its evolution in the world of business as well as several important advantages and disadvantages of using online social networking sites. We are presenting a quantitative research on the main reasons for using online networking sites by high schools students from the several counties of Romania. The authors will present the results of the research which underline: the main activities undertaken by students with this new communication tool, the average number of friends the students have and the selection criteria for them as well as the influence level of OSN sites on the life and activity (school and private) of the…
Using the Breeder genetic algorithm to optimize a multiple regression analysis model used in prediction of the mesiodistal width of unerupted teeth
2014
For the prediction of the unerupted canine and premolars mesiodistal size, have been proposed different variants of multiple linear regression equations (MLRE). These are based on the amount of the upper and lower permanent incisors with a tooth of the lateral support. Aim of present study was to develop a method for optimization of MLRE, using a genetic algorithm for determining a set of coefficients that minimizes the prediction error for the sum of permanent premolars and canines dimensions from a group of young people in an area Romania's central city represented by Sibiu. To test the proposed method, we used a multiple linear regression equation derived from the estimation method propo…
Implementation and performance of the ATLAS second level jet trigger
2008
ATLAS is one of the four major LHC experiments, designed to cover a wide range of physics topics. In order to cope with a rate of 40 MHz and 25 interactions per bunch crossing, the ATLAS trigger system is divided in three different levels. The first one (LVL1, hardware based) identifies signatures in 2 microseconds that are confirmed by the the following trigger levels (software based). The Second Level Trigger (LVL2) only looks at a region of the space around the LVL1 signature (called Region of Interest or ROI), confirming/rejecting the event in about 10 ms, while the Event Filter (Third Level Trigger, EF) has potential full event access and larger processing times, of the order of 1 s. T…
A new tool for evaluating and/or selecting analytical methods: Summarizing the information in a hexagon
2019
Abstract A quantitative evaluation tool is proposed, which aims to assess optimal selection or/and testing of analytical methods. Objective criteria related to analytical performance, sustainability, environmental impact and economic cost are evaluated through the definition of penalty points divided into five different blocks, namely, figures of merit, toxicity and safety, residues, carbon footprint and economic cost. For each block, the overall qualification is scaled from 0 to 4 and it is depicted on a regular hexagonal pictogram that allows a user friendly comparison of analytical procedures. The present evaluation tool aims to be a guideline for evaluating and/or selecting analytical p…
Generalized Bayesian pursuit: A novel scheme for multi-armed Bernoulli bandit problems
2011
Published version of a chapter in the book: IFIP Advances in Information and Communication Technology. Also available from the publisher at: http;//dx.doi.org/10.1007/978-3-642-23960-1_16 In the last decades, a myriad of approaches to the multi-armed bandit problem have appeared in several different fields. The current top performing algorithms from the field of Learning Automata reside in the Pursuit family, while UCB-Tuned and the ε -greedy class of algorithms can be seen as state-of-the-art regret minimizing algorithms. Recently, however, the Bayesian Learning Automaton (BLA) outperformed all of these, and other schemes, in a wide range of experiments. Although seemingly incompatible, in…
Secure Group Communication Using Fractional Public Keys
2010
Published version of a paper presented at the ARES '10 International Conference on Availability, Reliability, and Security (c) 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. Paper also available from the publisher:http://dx.doi.org/10.1109/ARES.2010.13 In this paper, we present the novel concept of fractional public keys and an efficient zero-round multi-party Diffie-Hellman key agreement sc…