Energy Technology Data Exchange (ETDEWEB)

A microscopic calculation of the level density is performed, based on a combinatorial evaluation using a realistic single-particle level scheme. This calculation relies on a fast Monte Carlo algorithm, allowing to consider heavy nuclei (i.e., large shell model spaces) which could not be treated previously in combinatorial approaches. An exhaustive comparison of the predicted neutron s-wave resonance spacings with experimental data for a wide range of nuclei is presented.

CERN Document Server

Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts to reconnect the two fields with a fresh look at Prolog encodings for the combinatorial objects involved in circuit synthesis. While benefiting from Prolog's fast unification algorithm and built-in backtracking mechanism, efficiency of our search algorithm is ensured by using parallel bitstring operations together with logic variable equality propagation, as a mapping mechanism from primary inputs to the leaves of candidate Leaf-DAGs implementing a combinational circuit specification. After an exhaustive expressiveness comparison of various minimal libraries, a surprising first-runner, Strict Boolean Inequality "<" together with constant function "1" also turns out to have small transistor-count implementations, competitive to NAND-only or ...

CERN Document Server

Let us call a sequence of numbers heapable if they can be sequentially inserted to form a binary tree with the heap property, where each insertion subsequent to the first occurs at a leaf of the tree, i.e. below a previously placed number. In this paper we consider a variety of problems related to heapable sequences and subsequences that do not appear to have been studied previously. Our motivation for introducing these concepts is two-fold. First, such problems correspond to natural extensions of the well-known secretary problem for hiring an organization with a hierarchical structure. Second, from a purely combinatorial perspective, our problems are interesting variations on similar longest increasing subsequence problems, a problem paradigm that has led to many deep mathematical connections. We provide several basic results. We obtain an efficient algorithm for determining the heapability of a sequence, and also prove that the question of ...

Science.gov (United States)

Research into methods for reasoning under uncertainty is currently one of the most exciting areas of artificial intelligence, largely because it has recently become possible to record, store, and process large amounts of data. While impressive achievements have been made in pattern classification problems such as handwritten character recognition, face detection, speaker identification, and prediction of gene function, it is even more exciting that researchers are on the verge of introducing systems that can perform large-scale combinatorial analyses of data, decomposing the data into interacting components. For example, computational methods for automatic scene analysis are now emerging in the computer vision community. These methods decompose an input image into its constituent objects, lighting conditions, motion patterns, etc. Two of the main challenges are finding effective representations and models in specific applications and finding efficient ...

CERN Document Server

Graphs with high symmetry or regularity are the main source for experimentally hard instances of the notoriously difficult graph isomorphism problem. In this paper, we study the computational complexity of isomorphism testing for line graphs of $t$-$(v,k,\\lambda)$ designs. For this class of highly regular graphs, we obtain a worst-case running time of $O(v^{\\log v + O(1)})$ for bounded parameters $t,k,\\lambda$. In a first step, our approach makes use of the Babai--Luks algorithm to compute canonical forms of $t$-designs. In a second step, we show that $t$-designs can be reconstructed from their line graphs in polynomial-time. The first is algebraic in nature, the second purely combinatorial. For both, profound structural knowledge in design theory is required. Our results extend earlier complexity results about isomorphism testing of graphs generated from Steiner triple systems and block designs.

CERN Document Server

Introduction to Genetic Algorithms

International Nuclear Information System (INIS)

This paper describes Automatic Refueling Planning System (ARPS) for a nuclear power station using Genetic Algorithms (GA) and a Simulated Annealing (SA). ARPS has been developed and verified by applying to the Fugen nuclear power station (NPS), which is a 165MWe, heavy water-moderated, boiling light water-cooled, pressure tube-type reactor developed by JNC utilizing mainly uranium and plutonium mixed oxide (MOX) fuel. Fuel loading patterns have been managed independently in the Fugen NPS since the initial core. A planning of an adequate fuel loading pattern on each operational cycle needs one to two months even for expert core management engineers, for the reason that it has multi-objective optimization and nonlinear problems. In order to achieve the optimum fuel loading pattern and a fuel cost reduction, ARPS has been developed by JNC and CRC Solutions Corporation for the last five years. ARPS firstly generates several thousand fuel loading patterns with GA at ...

UK PubMed Central (United Kingdom)

Microbes in nature frequently function as members of complex multitaxon communities, but the structural organization of these communities at the micrometer level is poorly understood because of limitations...Full Text Available

UK PubMed Central (United Kingdom)

BackgroundGene promoters can be in various epigenetic states and undergo interactions with many molecules in a highly transient, probabilistic and combinatorial way, resulting in...Full Text Available

CERN Document Server

Randomized Algorithms for Analysis and Control of Uncertain Systems

CERN Document Server

Nature-inspired algorithms such as Particle Swarm Optimization and Firefly Algorithm are among the most powerful algorithms for optimization. In this paper, we intend to formulate a new metaheuristic algorithm by combining Levy flights with the search strategy via the Firefly Algorithm. Numerical studies and results suggest that the proposed Levy-flight firefly algorithm is superior to existing metaheuristic algorithms. Finally implications for further research and wider applications will be discussed.

CERN Document Server

This paper is about two arrangements of hyperplanes. The first --- the Shi arrangement --- was introduced by Jian-Yi Shi to describe the Kazhdan-Lusztig cells in the affine Weyl group of type $A$. The second --- the Ish arrangement --- was recently defined by the first author who used the two arrangements together to give a new interpretation of the $q,t$-Catalan numbers of Garsia and Haiman. In the present paper we will define a mysterious "combinatorial symmetry" between the two arrangements and show that this symmetry preserves a great deal of information. For example, the Shi and Ish arrangements share the same characteristic polynomial, the same numbers of regions, bounded regions, dominant regions, regions with $c$ "ceilings" and $d$ "degrees of freedom", etc. Moreover, all of these results hold in the greater generality of "deleted" Shi and Ish arrangements corresponding to an arbitrary subgraph of the complete graph. Our proofs are based on nice ...

Energy Technology Data Exchange (ETDEWEB)

The goal of this program was to increase the high-temperature strength of the H-Series of cast austenitic stainless steels by 50% and upper use temperature by 86 to 140 F (30 to 60 C). Meeting this goal is expected to result in energy savings of 38 trillion Btu/year by 2020 and energy cost savings of $185 million/year. The higher strength H-Series of cast stainless steels (HK and HP type) have applications for the production of ethylene in the chemical industry, for radiant burner tubes and transfer rolls for secondary processing of steel in the steel industry, and for many applications in the heat-treating industry. The project was led by Duraloy Technologies, Inc. with research participation by the Oak Ridge National Laboratory (ORNL) and industrial participation by a diverse group of companies. Energy Industries of Ohio (EIO) was also a partner in this project. Each team partner had well-defined roles. Duraloy Technologies led the team by identifying the base alloys that were to be ...

KoreaScience (Korea)

Full Text Available

UK PubMed Central (United Kingdom)

The management of CNS tumors is limited by the blood-brain barrier (BBB), a vascular interface that restricts the passage of most molecules from the blood into the brain. Here we show that phage particles...Full Text Available

Energy Technology Data Exchange (ETDEWEB)

Constructive and combinatorial relationships between order-isomorphisms and order-equivalence classes within the generalized genetic code are presented, not only for the biologically relevant groups of order 4, but also for finite groups of arbitrary order. The main result is the derivation of the number (and types) or order-equivalence classes for a group of order n. Finally, an extension of this work to all biologically admissible alternative codes is discussed.

CERN Document Server

In this paper, using combinatorial and analytic methods, we prove an exact calculating formula on the $2m$-th power mean value of the generalized quadratic Gauss sums for $m\\geq 2$. This solves a conjecture of He and Zhang [`On the $2k$-th power mean value of the generalized quadratic Gauss sums', Bull. Korean Math. Soc. 48 (2011), No.1, 9-15].

International Nuclear Information System (INIS)

A dose calculation algorithm for MLC based conformal radiotherapy is described in this paper. The algorithm is formulated by the coordinate of MLC leaves. Verification on the algorithm is made by comparing the dose distributions generated by this algorithm with that generated by a Differential Convolution Superposition algorithm for various regular and irregular fields. The results demonstrate that the present algorithm has suitable accuracy and high computational efficiency, thus it could be useful for the treatment planning process in MLC based conformal radiotherapy, where the workload for interactively or automatically designing the shapes of MLC is heavy. (authors)

UK PubMed Central (United Kingdom)

OBJECTIVE--To develop, test, and validate an algorithm for diagnosing disease in neonates during an over the telephone referral to a specialist cardiac centre. DESIGN--A draft algorithm requiring only...Full Text Available

Science.gov (United States)

TART97 is a coupled neutron-photon, 3 dimensional, combinatorial geometry, time dependent Monte Carlo transport code. This code can run on any modern computer. It is a complete system to assist you with input preparation, running Monte Carlo calculations, and analysis of output results. TART97 is also incredibly fast: if you have used similar codes, you will be amazed at how fast this code is compared to other similar codes. Use of the entire system can save you a great deal of time and energy. TART 97 is distributed on CD. This CD contains on-line documentation for all codes included in the system, the codes configured to run on a variety of computers, and many example problems that you can use to familiarize yourself with the system. TART97 completely supersedes all older versions of TART, and it is strongly recommended that users only use the most recent version of TART97 and ist data files.

Energy Technology Data Exchange (ETDEWEB)

Model-based approaches to pattern recognition and machine vision have been proposed to overcome the exorbitant training requirements of earlier computational paradigms. However, uncertainties in data were found to lead to a combinatorial explosion of the computational complexity. This issue is related here to the roles of a priori knowledge vs. adaptive learning. What is the a-priori knowledge representation that supports learning? I introduce Modeling Field Theory (MFT), a model-based neural network whose adaptive learning is based on a priori models. These models combine deterministic, fuzzy, and statistical aspects to account for a priori knowledge, its fuzzy nature, and data uncertainties. In the process of learning, a priori fuzzy concepts converge to crisp or probabilistic concepts. The MFT is a convergent dynamical system of only linear computational complexity. Fuzzy logic turns out to be essential for reducing the combinatorial ...

Science.gov (United States)

... FL, April 18-20, 2006 Using Advanced Computer Vision Algorithms on Small Mobile Robots G. Koguta,F. Birchmoreb,E ...

International Nuclear Information System (INIS)

... p. SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS algorithms

Science.gov (United States)

The implementation of a reverse time migration algorithm on the Connection Machine, a massively

KoreaScience (Korea)

Full Text Available

KoreaScience (Korea)

Full Text Available

KoreaScience (Korea)

Full Text Available

CERN Document Server

Design and Analysis of Vaccine Studies

KoreaScience (Korea)

Full Text Available

CERN Document Server

We present faster approximation algorithms for generalized network flow problems. A generalized flow is one in which the flow out of an edge differs from the flow into the edge by a constant factor. We limit ourselves to the lossy case, when these factors are at most 1. Our algorithm uses a standard interior-point algorithm to solve a linear program formulation of the network flow problem. The system of linear equations that arises at each step of the interior-point algorithm takes the form of a symmetric M-matrix. We present an algorithm for solving such systems in nearly linear time. The algorithm relies on the Spielman-Teng nearly linear time algorithm for solving linear systems in diagonally-dominant matrices. For a graph with m edges, our algorithm obtains an additive epsilon approximation of the maximum generalized ...

Science.gov (United States)

This paper proposes an optimization algorithm to reduce the distortion produced in the loop-filter of Continuous-Time Sigma-Delta Modulators. The aim of the algorithm is to find the loop-filter implementation that minimizes distortion at the output of the modulator, by modifying the output swing of every integrator. The algorithm is implemented in Matlab as an evolutive searching. During each step of the searching, the algorithm evaluates the harmonical distortion of a tone when it is applied to the modulator with a certain loop-filter implementation. The output of the algorithm is an optimum linear state-space representation of the loop-filter. This particular state-space representation leads to minimum distortion at the output of the modulator when the loop-filter is implemented with some specific circuitry previously defined. As long as the search is of evolutive type, the ...

CERN Document Server

Shaping has proven to be a powerful but precarious means of improving reinforcement learning performance. Ng, Harada, and Russell (1999) proposed the potential-based shaping algorithm for adding shaping rewards in a way that guarantees the learner will learn optimal behavior. In this note, we prove certain similarities between this shaping algorithm and the initialization step required for several reinforcement learning algorithms. More specifically, we prove that a reinforcement learner with initial Q-values based on the shaping algorithm's potential function make the same updates throughout learning as a learner receiving potential-based shaping rewards. We further prove that under a broad category of policies, the behavior of these two learners are indistinguishable. The comparison provides intuition on the theoretical properties of the shaping algorithm as well as a suggestion ...

Science.gov (United States)

Constraint-based lexical models of language processing assume that readers resolve temporary ambiguities by relying on a variety of cues, including particular knowledge of how verbs combine with nouns. Previous experiments have demonstrated verb bias effects only in structurally complex sentences, and have been criticized on the grounds that such effects could be due to a rapid reanalysis stage in a two-stage modular processing system. In a self-paced reading experiment and an eyetracking experiment, we demonstrate verb bias effects in sentences with simple structures that should require no reanalysis, and thus provide evidence that the combinatorial properties of individual words influence the earliest stages of sentence comprehension. (Contains 4 figures and 12 tables.)

CERN Document Server

We define several "standard" subgroups of the automorphism group Aut(G) of a partially commutative (right-angled Artin) group and use these standard subgroups to describe decompositions of Aut(G). If C is the commutation graph of G, we show how Aut(G) decomposes in terms of the connected components of C: obtaining a particularly clear decomposition theorem in the special case where C has no isolated vertices. If C has no vertices of a type we call dominated then we give a semi-direct decompostion of Aut(G) into a subgroup of locally conjugating automorphisms by the subgroup stabilising a certain lattice of "admissible subsets" of the vertices of C. We then characterise those graphs for which Aut(G) is a product (not necessarily semi-direct) of two such subgroups.

CERN Document Server

We propose a decoding algorithm for the $(u\\mid u+v)$-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one can decode beyond the error correction capability of the code.

CERN Document Server

The airborne traffic monitoring system forms a novel technology of detecting vehicle motion. An optical digital camera located on an airborne platform produces a series of images which then are processed to recognized the fixed vehicles. In this way the video data are converted into the time sequence of frames containing the vehicle coordinates. In the present work a three-frame algorithm is developed to identify the succeeding vehicle positions. It is based on finding the neighboring points in the frame sequence characterized by minimal acceleration. To verify and optimize the developed algorithm a ``Virtual Road'' simulator was created. Finally available empirical data are analyzed using the created algorithm.

Science.gov (United States)

... Missionaries and Cannibals, etc.) Since the shooting example is intended to be an example of general autonomous reasoning, we will avoid such ...

British Library Electronic Table of Contents (United Kingdom)

The algorithmic, or consistent, tangent stiffness was introduced to improve the asymptotic convergence rate of the iterative correction algorithm for the evolutive analysis of elastoplastic structures. The original approach is based on a formulation of the elastoplastic law in terms of a plastic multiplier with an analysis which, in general, requires an operator inversion. A geometric description of the method, based on hypersurface theory, is proposed here to provide a clear picture of the algorithmic properties. An estimate of the tangent stiffness associated with finite step elastoplastic and elastoviscoplastic constitutive models is given. It is based on the properties of the projection operator on the elastic domain and avoids operator inversions retaining the beneficial properties of...

Energy Technology Data Exchange (ETDEWEB)

In this paper, a new design methodology for determining the size, location, type and number of capacitors to be placed on a radial distribution system is presented. The objective is to minimize the peak power losses and the energy losses in the distribution system considering the capacitor cost. A sensitivity analysis based method is used to select the candidate locations for the capacitors. A new optimization method using a Genetic Algorithm is proposed to determine the optimal selection of capacitors. Test results have been presented along with the discussion of the algorithm.

Energy Technology Data Exchange (ETDEWEB)

The classical stochastic approximation methods are shown to yield algorithms to solve several formulations of the PAC learning problem defined on the domain [o,1]{sup d}. Under some assumptions on different ability of the probability measure functions, simple algorithms to solve some PAC learning problems are proposed based on networks of non-polynomial units (e.g. artificial neural networks). Conditions on the sizes of these samples required to ensure the error bounds are derived using martingale inequalities.

Energy Technology Data Exchange (ETDEWEB)

In a recent paper, Lowry (1981) described an architecture for a computer vision rectangular processor array that is suitable for VLSI implementation. In this paper the authors review that architecture, discuss extensions to it and present results of an array simulator applied to vision algorithms. They also present an algorithm for re-routing an array with bad processors into a working subset of the array, making it feasible to implement a large array on one wafer-sized chip. 7 references.

Energy Technology Data Exchange (ETDEWEB)

Surface modification of topography and chemistry in order to achieve a specific water contact angle (CA) has been explored by using a novel combinatorial screening platform. The screening arrays consisted of 507 distinct combinations of micro-topographies and chemical compositions. By performing chemical modifications with 1H, 1H, 2H, 2H perfluoroethyltriethoxy-silane (PFS) and n-octadecyltriethoxysilane (ODS) on standard silicon wafers it was possible to include both superhydrophobic and very hydrophilic pad arrays in the same screening platform. Surfaces modified with PFS were more hydrophobic than surfaces modified with ODS, while the unmodified silicon surfaces were hydrophilic. For the PFS modified surfaces the largest CAs were achieved with a small pillar size of X = 1 {mu}m and an intermediate inter-pillar gap size of Y = 4 {mu}m with superhydrophobic CAs over 170 . Surface analysis with X-ray photoelectron spectroscopy (XPS) revealed that CF{sub 3} groups ...

Science.gov (United States)

We propose a new algorithm for two-dimensional magnetotelluric (MT) inversion. Our algorithm is an MT inversion based on the steepest descent method, borrowed from the backpropagation technique of seismic inversion or reverse time migration, introduced in the middle 1980s by Lailly and Tarantola. The steepest descent direction can be calculated efficiently by using the symmetry of numerical Green's function derived from a mixed finite element method proposed by Nedelec for Maxwell's equation, without calculating the Jacobian matrix explicitly. We construct three different objective functions by taking the logarithm of the complex apparent resistivity as introduced in the recent waveform inversion algorithm by Shin and Min. These objective functions can be naturally separated into amplitude inversion, phase inversion and simultaneous inversion. We demonstrate our algorithm by showing ...

International Nuclear Information System (INIS)

An iterative phase retrieval algorithm was previously investigated for in-line x-ray phase imaging. Through detailed theoretical analysis and computer simulations, we now discuss the limitations, robustness, and efficiency of the algorithm. The iterative algorithm was proved robust against imaging noise but sensitive to the variations of several system parameters. It is also efficient in terms of calculation time. It was shown that the algorithm can be applied to phase retrieval based on one phase-contrast image and one attenuation image, or two phase-contrast images; in both cases, the two images can be obtained either by one detector in two exposures, or by two detectors in only one exposure as in the dual-detector scheme.

International Nuclear Information System (INIS)

Background and purpose: A series of phase I/II clinical trials are being initiated in several UK centres to explore the use of dose-escalated schedules for the treatment of non-small cell lung cancer (NSCLC). Among them the IDEAL-CRT trial (ISRCTN12155469) will investigate the introduction of individualised 'isotoxic' treatment schedules based on the relative mean lung normalised total dose (rNTDmean), an estimator related to lung toxicity. Since treatment planning will be performed using different treatment planning systems (TPSs), for the quality assurance of the trial we have carried out work to quantify the influence of dose calculation algorithms based on the determination of rNTDmean and on the choice of individualised prescription doses. Material and methods: Twenty-five patient plans with stage I, II and III NSCLC were calculated, with the same prescription dose, using the Adaptive Convolve (AC) and Collapsed Cone (CC) algorithms of the ...

International Nuclear Information System (INIS)

A new leaf-sequencing approach has been developed that is designed to reduce the number of required beam segments for step-and-shoot intensity modulated radiation therapy (IMRT). This approach to leaf sequencing is called continuous-intensity-map-optimization (CIMO). Using a simulated annealing algorithm, CIMO seeks to minimize differences between the optimized and sequenced intensity maps. Two distinguishing features of the CIMO algorithm are (1) CIMO does not require that each optimized intensity map be clustered into discrete levels and (2) CIMO is not rule-based but rather simultaneously optimizes both the aperture shapes and weights. To test the CIMO algorithm, ten IMRT patient cases were selected (four head-and-neck, two pancreas, two prostate, one brain, and one pelvis). For each case, the optimized intensity maps were extracted from the Pinnacle"3 treatment planning system. The CIMO algorithm ...

CERN Document Server

It is well known that for ergodic channel processes the Generalized Max-Weight Matching (GMWM) scheduling policy stabilizes the network for any supportable arrival rate vector within the network capacity region. This policy, however, often requires the solution of an NP-hard optimization problem. This has motivated many researchers to develop sub-optimal algorithms that approximate the GMWM policy in selecting schedule vectors. One implicit assumption commonly shared in this context is that during the algorithm runtime, the channel states remain effectively unchanged. This assumption may not hold as the time needed to select near-optimal schedule vectors usually increases quickly with the network size. In this paper, we incorporate channel variations and the time-efficiency of sub-optimal algorithms into the scheduler design, to dynamically tune the algorithm runtime considering the tradeoff between ...

CERN Document Server

We systematically develop real Paley-Wiener theory for the Fourier transform on R^d for Schwartz functions, L^p-functions and distributions, in an elementary treatment based on the inversion theorem. As an application, we show how versions of classical Paley-Wiener theorems can be derived from the real ones via an approach which does not involve domain shifting and which may be put to good use for other transforms of Fourier type as well. An explanation is also given why the easily applied classical Paley-Wiener theorems are unlikely to be able to yield information about the support of a function or distribution which is more precise than giving its convex hull, whereas real Paley-Wiener theorems can be used to reconstruct the support precisely, albeit at the cost of combinatorial complexity. We indicate a possible application of real Paley-Wiener theory to partial differential equations in this vein and furthermore we give evidence that a number of real ...

Energy Technology Data Exchange (ETDEWEB)

Considering the hardware characteristics of the laser-induced plasma X-ray source and the limitations of the conventional cone-beam reconstruction algorithm, a general cone-beam reconstruction algorithm has been developed at our laboratory, in which the motion locus of the X-ray source is an arbitrary curve corresponding to at least a 2{pi} continuous horizontal angular displacement in the coordinate system of the specimen. The preliminary simulation shows that the general cone-beam reconstruction algorithm consistently results in visually satisfactory images.

Energy Technology Data Exchange (ETDEWEB)

Exceptional progress has been made in mathematical algorithm research leading to optimized mesh partitions for the highly unstructured grids occurring in finite element applications in solid mechanics. Today another research challenge presents itself. Research is needed to include boundary conditions into the algorithms for partitioning meshes. We describe below two methods we use currently to accomplish this and propose a more general approach be developed which would apply to our problems today as well as to the coupled models we envision for the future. Finally, we suggest research be considered that would incorporate partitioning methods into parallel mesh generation.

British Library Electronic Table of Contents (United Kingdom)

This paper considers location?allocation problem in the real uncertain world and develops a possibilistic non-linear programming model to deal with this problem. Fuzzy decision making in fuzzy environment concept is used to determine possibility distribution of location and allocation variables. To solve this model, a novel approach based on genetic algorithm structure is developed. As the proposed model includes both deterministic (location) and uncertain (allocation) parameters, the developed solution algorithm uses a hybrid chromosome structure. Also, to cover continuous nature of the problem and prevent GA from early convergence, a new crossover operator is introduced. Finally, performance of the developed algorithm is evaluated by an example.

Energy Technology Data Exchange (ETDEWEB)

A fast production scheduling algorithm suitable for generation expansion studies is described in this paper. It can handle several independent rivers, thermal plants, pumped storage plants, import, export, and internal non-firm markets. Inflows and load are deterministic and a one-reservoir limit is imposed on each river. The scheduling problem is formulated as a generalized network problem which is efficiently solved by an adaption of the simplex method. The algorithm is part of a program developed by Hydro-Quebec to conduct preliminary evaluations of alternative expansion plans. The program and the scheduling algorithm are presented.

Science.gov (United States)

Mar 1, 2011... Science Research; Atmospheric Correction Prototype Algorithm for High ... spaceborne (Hyperion) and airborne (AVIRIS) hyperspectral data. ...

British Library Electronic Table of Contents (United Kingdom)

Abstract Questions: How important is the choice of flow routing algorithm with respect to application of topographic wetness index (TWI) in vegetation ecology? Which flow routing algorithms are preferable for application in vegetation ecology? Location: Forests in three different regions of the Czech Republic. Methods: We used vegetation data from 521 georeferenced plots, recently sampled in a wide range of forest communities. From a digital elevation model, we calculated 11 variations of TWI for each plot with 11 different flow routing algorithms. We evaluated the performance of differently calculated TWI by (1) Spearman rank correlation with average Ellenberg indicator values for soil moisture, (2) Mantel correlation coefficient between dissimilarities of species composition and dissimil...

Energy Technology Data Exchange (ETDEWEB)

The application of multi-objective genetic algorithms for green building design in two phases were presented in order to better help designers in the decision-making process. The purpose is to minimize two conflicting criteria: the life-cycle cost and the life-cycle environmental impact. Environmental impact criteria examined include energy and non-energy natural resources, global warming, and acidification. Variables focus on building envelope-related parameters. The application of multi-objective genetic algorithms is divided into two phases. The first phase intends to help designers in understanding the trade-off relationship between the two conflicting criteria. The second phase intends to refine the performance region that is of the designer's interest. The results after the two-phase application of the multi objective genetic algorithm were then presented. 13 refs., 4 tabs., 3 figs.

Science.gov (United States)

The potentials of the spherical sensor and nearby conductors are controlled by ... Incoming data are continuously monitored by algorithms in the software to ... launched together with FM5 (Rumba) by a Soyuz-Fregat rocket from Baikonur. ...

Science.gov (United States)

... 5.12 Terminal Value for Performance Measure P ... As examples, a stochastic communication network containing a buffer queue at each ...

Science.gov (United States)

An almost linear optimization problem of importance in vibration isolation has been identified and algorithms were developed to minimize the forced vibrational response of structural systems. The constraints can be either displacements of accelerations. T...

Science.gov (United States)

Nov 12, 2010 ... The adaptive, nonparametric matched filter algorithm suggested by Kay ... For the point design of a 4 sigma single event SNR the combined NR ...

Science.gov (United States)

THE GFS WILL BE THAT THE DEFAULT PRECIPITATION TYPE ALGORITHM WILL CHANGE FROM THE BALDWIN METHOD TO THE DOMINANT PRECIPITATION TYPE. THE DOMINANT PRECIPITATION TYPE IS...

Science.gov (United States)

... coordinates to allow for multisensor fusion, trajectory ... of an image processing toolkit (iPTK ... effectiveness of data-driven registration processing, spatial ...

UK PubMed Central (United Kingdom)

Privacy-preserving machine learning algorithms are crucial for the increasingly common setting in which personal data, such as medical or financial records, are analyzed. We provide general...Full Text Available

Science.gov (United States)

Feb 23, 2011 ... The potentials of the spherical sensor and nearby conductors are ... Incoming data are continuously monitored by algorithms in the software to ..... together with FM6 (Salsa) by a Soyuz-Fregat rocket from Baikonur. ...

International Nuclear Information System (INIS)

The purpose of this work was to study and quantify the differences in dose distributions computed with some of the newest dose calculation algorithms available in commercial planning systems. The study was done for clinical cases originally calculated with pencil beam convolution (PBC) where large density inhomogeneities were present. Three other dose algorithms were used: a pencil beam like algorithm, the anisotropic analytic algorithm (AAA), a convolution superposition algorithm, collapsed cone convolution (CCC), and a Monte Carlo program, voxel Monte Carlo (VMC++). The dose calculation algorithms were compared under static field irradiations at 6 MV and 15 MV using multileaf collimators and hard wedges where necessary. Five clinical cases were studied: three lung and two breast cases. We found that, in terms of accuracy, the CCC algorithm ...

Science.gov (United States)

... on some results we obtained, using stochastic methods as ... choice between two customers in a queue and one ... with the terminal of edge I being the ...

British Library Electronic Table of Contents (United Kingdom)

Product-sum property states that an ordered pair (s"n,p"n) is unique for any ordered set a"1,a"2,...,a"n where a"i,n@?N, and s"n and p"n are the sum and product of the elements of the set, respectively. This fact has been exploited to develop an O(log(M)) time complexity algorithm for pattern searching in a large dataset, where M is the number of records in the dataset. Two potential applications (from databases and computational biology) of this property have been demonstrated to show the effectiveness and working of the proposed algorithm. The space complexity of the algorithm rises to the quadratic order.

CERN Document Server

In this paper, we propose a bid optimizer for sponsored keyword search auctions which leads to better retention of advertisers by yielding attractive utilities to the advertisers without decreasing the revenue to the search engine. The bid optimizer is positioned as a key value added tool the search engine provides to the advertisers. The proposed bid optimizer algorithm transforms the reported values of the advertisers for a keyword into a correlated bid profile using many ideas from cooperative game theory. The algorithm is based on a characteristic form game involving the search engine and the advertisers. Ideas from Nash bargaining theory are used in formulating the characteristic form game to provide for a fair share of surplus among the players involved. The algorithm then computes the nucleolus of the characteristic form game since we find that the nucleolus is an apt way of allocating the gains of cooperation among ...

International Nuclear Information System (INIS)

Background and purpose: The low density of lung tissue causes a reduced attenuation of photons and an increased range of secondary electrons, which is inaccurately predicted by the algorithms incorporated in some commonly available treatment planning systems (TPSs). This study evaluates the differences in dose in normal lung tissue computed using a simple and a more correct algorithm. We also studied the consequences of these differences on the dose-effect relations for radiation-induced lung injury. Materials and methods: The treatment plans of 68 lung cancer patients initially produced in a TPS using a calculation model that incorporates the equivalent-pathlength (EPL) inhomogeneity-correction algorithm, were recalculated in a TPS with the convolution-superposition (CS) algorithm. The higher accuracy of the CS algorithm is well-established. Dose distributions in lung were compared ...

International Nuclear Information System (INIS)

A new semi-empirical algorithm for the radial distribution of dose is compared with available data. The algorithm is used to calculate the inactivation cross section for dry enzymes and viruses using an extended target model of a 1-hit detector. Agreement with data is at about the 15% level, approximating the precision of the data itself. (author).

Energy Technology Data Exchange (ETDEWEB)

Activities and results are reported of a project to investigate the application of remote sensing technology developed for the LACIE, AgRISTARS, Forestry and other NASA remote sensing projects for the environmental monitoring of strip mining, industrial pollution, and acid rain. Following a remote sensing workshop for EPA personnel, the EOD clustering algorithm CLASSY was selected for evaluation by EPA as a possible candidate technology. LANDSAT data acquired for a North Dakota test sight was clustered in order to compare CLASSY with other algorithms.

Energy Technology Data Exchange (ETDEWEB)

A new algorithm for the treatment of sliding interfaces between solids with or without friction in an Eulerian wavecode is described. The algorithm has been implemented in the two-dimensional version of the CTH code. The code was used to simulate penetration and perforation of aluminum plates by rigid, conical-nosed tungsten projectiles. Comparison with experimental data is provided.

UK PubMed Central (United Kingdom)

The aim of this study is to compare the dosimetry results that are obtained by using Convolution, Superposition and Fast Superposition algorithms in Conventional Radiotherapy, Three-Dimensional Conformal...Full Text Available

Energy Technology Data Exchange (ETDEWEB)

In this paper, we study data structures for use in N-body simulation. We concentrate on the spatial decomposition tree used in particle-cluster force evaluation algorithms such as the Barnes-Hut algorithm. We prove that a k-d tree is asymptotically inferior to a spatially balanced tree. We show that the worst case complexity of the force evaluation algorithm using a k-d tree is {Theta}(n log{sup 3} n log L) compared with {Theta}(n log L) for an oct-tree. (L is the separation ratio of the set of points.) We also investigate improving the constant factor of the algorithm, and present several methods which improve over the standard oct-tree decomposition. Finally, we consider whether or not the bounding box of a point set should be {open_quotes}tight{close_quotes}, and show that it is only safe to use tight bounding boxes for binary decompositions. The results are all directly applicable to practical ...

Energy Technology Data Exchange (ETDEWEB)

Daylight responsive dimming systems have been used in few buildings to date because they require improvements to improve reliability. The key underlying factor contributing to poor performance is the variability of the ratio of the photosensor signal to daylight workplane illuminance in accordance with sun position, sky condition, and fenestration condition. Therefore, this paper describes the integrated systems between automated roller shade systems and daylight responsive dimming systems with an improved closed-loop proportional control algorithm, and the relative performance of the integrated systems and single systems. The concept of the improved closed-loop proportional control algorithm for the integrated systems is to predict the varying correlation of photosensor signal to daylight workplane illuminance according to roller shade height and sky conditions for improvement of the system accuracy. In this study, the performance of the ...

Energy Technology Data Exchange (ETDEWEB)

One of the main goals in the determination of three-dimensional macromolecular structures from electron microscope images of individual molecules and complexes (single particles) is a sufficiently high spatial resolution, about 4 A, at which the interpretation with an atomic model becomes possible. To reach high resolution, an iterative refinement procedure using an expectation maximization algorithm is often used that leads to a more accurate alignment of the positional and orientational parameters for each particle. We show here the results of refinement algorithms that use a phase residual, a linear correlation coefficient, or a weighted correlation coefficient to align individual particles. The algorithms were applied to computer-generated data sets that contained projections from model structures, as well as noise. The algorithms show different degrees of over-fitting, especially at high resolution ...

International Nuclear Information System (INIS)

IMRT optimization requires a fast yet relatively accurate algorithm to calculate the iteration dose with small memory demand. In this paper, we present a dose calculation algorithm that approaches these goals. By decomposing the infinitesimal pencil beam (IPB) kernel into the central axis (CAX) component and lateral spread function (LSF) and taking the beam's eye view (BEV), we established a non-voxel and non-beamlet-based dose calculation formula. Both LSF and CAX are determined by a commissioning procedure using the collapsed-cone convolution/superposition (CCCS) method as the standard dose engine. The proposed dose calculation involves a 2D convolution of a fluence map with LSF followed by ray tracing based on the CAX lookup table with radiological distance and divergence correction, resulting in complexity of O(N"3) both spatially and temporally. This simple algorithm is orders of magnitude faster than the CCCS method. ...

CERN Document Server

Bayesian optimization (BO) algorithms try to optimize an unknown function that is expensive to evaluate using minimum number of evaluations/experiments. Most of the proposed algorithms in BO are sequential, where only one experiment is selected at each iteration. This method can be time inefficient when each experiment takes a long time and more than one experiment can be ran concurrently. On the other hand, requesting a fix-sized batch of experiments at each iteration causes performance inefficiency in BO compared to the sequential policies. In this paper, we present an algorithm that asks a batch of experiments at each time step t where the batch size p_t is dynamically determined in each step. Our algorithm is based on the observation that the sequence of experiments selected by the sequential policy can sometimes be almost independent from each other. Our algorithm identifies ...

International Nuclear Information System (INIS)

Previously, an analytical dose calculation algorithm for MLC-based radiotherapy was developed and commissioned, which includes a detailed model of various MLC effects as a unique feature [1]. The algorithm was originally developed as an independent verification of the treatment planning system's dose calculation and it explicitly modeled spatial and depth dependent MLC effects such as interleaf transmission, the tongue-and-groove effect, rounded leaf ends, MLC scatter, beam hardening, and gradual MLC transmission fall-off with increasing off-axis distance. Originally the algorithm was implemented in Mathematica trademark (Wolfram). To speed up the calculation time and to be able to calculate high resolution 2D dose distributions within a reasonable time frame (<2 s) the algorithm needs to be optimized and to be embedded in a user friendly environment. To achieve this goal, the dose calculation model ...

International Nuclear Information System (INIS)

Purpose: An inverse treatment planning algorithm for tomotherapy is described. Methods and Materials: The algorithm iteratively computes a set of nonnegative beam intensity profiles that minimizes the least-squares residual dose defined in the target and selected normal tissue regions of interest. At each iteration the residual dose distribution is transformed into a set of residual beam profiles using an inversion method derived from filtered backprojection image reconstruction theory. These 'residual' profiles are used to correct the current beam profile estimates resulting in new profile estimates. Adaptive filtering is incorporated into the inversion model so that the gross structure of the dose distribution is optimized during initial iterations of the algorithm, and the fine structure corresponding to edges is obtained at later iterations. A three dimensional, kernel based, convolution/superposition dose model is used ...

International Nuclear Information System (INIS)

An extensive set of benchmark measurement of PDDs and beam profiles was performed in a heterogeneous layer phantom, including a lung equivalent heterogeneity, by means of several detectors and compared against the predicted dose values by different calculation algorithms in two treatment planning systems. PDDs were measured with TLDs, plane parallel and cylindrical ionization chambers and beam profiles with films. Additionally, Monte Carlo simulations by meansof the PENELOPE code were performed. Four different field sizes (10x10, 5x5, 2x2, and1x1 cm"2) and two lung equivalent materials (CIRS, #rho#_e"w=0.195 and St. Bartholomew Hospital, London, #rho#_e"w=0.244-0.322) were studied. The performance of four correction-based algorithms and one based on convolution-superposition was analyzed. The correction-based algorithms were the Batho, the Modified Batho, and the Equivalent TAR implemented in the Cadplan (Varian) treatment ...

CERN Document Server

The Proportional-Integral-Derivative Controller is widely used in industries for process control applications. Fractional-order PID controllers are known to outperform their integer-order counterparts. In this paper, we propose a new technique of fractional-order PID controller synthesis based on peak overshoot and rise-time specifications. Our approach is to construct an objective function, the optimization of which yields a possible solution to the design problem. This objective function is optimized using two popular bio-inspired stochastic search algorithms, namely Particle Swarm Optimization and Differential Evolution. With the help of a suitable example, the superiority of the designed fractional-order PID controller to an integer-order PID controller is affirmed and a comparative study of the efficacy of the two above algorithms in solving the optimization problem is also presented.

British Library Electronic Table of Contents (United Kingdom)

It is acknowledged that fluorescence line height (FLH) algorithms are still hampered by the uncertainty of fluorescence peak position. The fluorescence peak moves to longer wavelengths with the increase of chlorophyll a concentration. In this article, the fluorescence enveloped area (FEA), which integrates the fluorescence height and the fluorescence peak position, was used to estimate the chlorophyll a concentration in the coastal waters of the Pearl River Estuary. The FEA algorithm was developed from in situ data of chlorophyll a concentration, total suspended matter (TSM) concentration and above-water remote sensing reflectance, which were collected at 37 sampling stations in the Pearl River Estuary during two cruises. The results showed that the FEA algorithm made a better estimation o...

CERN Document Server

An algorithm for creating synthetic telescope images of Smoothed Particle Hydrodynamics (SPH) density fields is presented, which utilises the adaptive nature of the SPH formalism in full. The imaging process uses Monte Carlo Radiative Transfer (MCRT) methods to model the scattering and absorption of photon packets in the density field, which then exit the system and are captured on a pixelated image plane, creating a 2D image (or a 3D datacube, if the photons are also binned by their wavelength). The algorithm is implemented on the density field directly: no gridding of the field is required, allowing the density field to be described to an identical level of accuracy as the simulations that generated it. Some applications of the method to star and planet formation simulations are presented to illustrate the advantages of this new technique, and suggestions as to how this framework could support a Radiative Equilibrium ...

Science.gov (United States)

We propose two algorithms to provide a full preliminary orbit of an Earth-orbiting object with a number of observations lower than the classical methods, such as those by Laplace and Gauss. The first one is the Virtual debris algorithm, based upon the admissible region, that is the set of the unknown quantities corresponding to possible orbits for a given observation for objects in Earth orbit (as opposed to both interplanetary orbits and ballistic ones). A similar method has already been successfully used in recent years for the asteroidal case. The second algorithm uses the integrals of the geocentric 2-body motion, which must have the same values at the times of the different observations for a common orbit to exist. We also discuss how to account for the perturbations of the 2-body motion, e.g., the J 2 effect.

Energy Technology Data Exchange (ETDEWEB)

Considers fundamental problems involved in the precise location of faults on high-voltage transmission lines. The influence of pre-fault load on the distance-to-fault measurement problem is analysed and a new method of accounting for load effects is presented. Two of the algorithms considered are precise, containing no simplifyng assumptions and their overall accuracy is limited only by the accuracy of digital impedance relays at both ends of the protected circuit. A third algorithm presents a new approach to the fault location problem, which requires digital impedance relays at one end only of a transmission line. The procedures described are applicable to any system arrangement and are suitable for a wide range of fault resistance values.

British Library Electronic Table of Contents (United Kingdom)

Timely detection of the pneumatic system problems is important in industry. Many techniques have been employed to solve this problem. In this paper, Genetic Algorithm (GA) based optimal configuration of neural networks is proposed for fault diagnostic of bottle filling systems. Back-propagation is used for neural networks algorithm. The back-propagation algorithm had six inputs and one output. A fitness function was designed to the minimize execution time of ANN model by keeping the number of hidden layer(s) and nodes as low as possible while the mean square error of estimated output error is minimized. The designed GA-ANN combination and the graphical user interface (GUI) eliminate the trial and error process for selection of the fastest and most accurate configuration. The performance of...

CERN Document Server

Mining Time Series data has a tremendous growth of interest in today's world. To provide an indication various implementations are studied and summarized to identify the different problems in existing applications. Clustering time series is a trouble that has applications in an extensive assortment of fields and has recently attracted a large amount of research. Time series data are frequently large and may contain outliers. In addition, time series are a special type of data set where elements have a temporal ordering. Therefore clustering of such data stream is an important issue in the data mining process. Numerous techniques and clustering algorithms have been proposed earlier to assist clustering of time series data streams. The clustering algorithms and its effectiveness on various applications are compared to develop a new method to solve the existing problem. This paper presents a survey on various clustering ...

British Library Electronic Table of Contents (United Kingdom)

This paper presents a new algorithm which is applicable in designing a smart damping system for vibration mitigation. The algorithm, which is extended into a unified system from Lyapunov stability theory, enables us to decrease the errors by its increased stability. The validity of this design method was proved in the experiment on a control model of three-storied building structure. Smart damper was used for MR (Magneto-Rheological fluid) damper in the experiment, and its control effectiveness was evaluated. In order to make a more accurate control model mathematically, we updated the model on the basis of the analysis of dynamic characteristics of structure and of the mathematical analysis of a lumped mass model, and then employed a state space model redefined by structural property matr...

Science.gov (United States)

A new algorithm for the design of decentralized output feedback stabilizers for large-scale electric power systems is presented in this paper. In the proposed approach, the generators which are most effective for stabilizer applications are first identified by using participation factors. Then an efficient algorithm based on decentralized pole assignment is proposed for the determination of the parameters of the power system stabilizers which, due to the difficulty associated with the communication among the geographically dispersed generating stations in a large power system, are essentially decentralized compensators using local generator outputs as their feedback signals. The proposed method is computationally efficient and can be applied to any large-scale system. The simplicity and effectiveness of the proposed method are demonstrated by an example of stabilizer design for a practical power system.

Science.gov (United States)

period T. Also shown is the returned chirp from a specular reflector at ...... algorithms is a Brown (1977) model of the return waveform, which assumes a ...... Townsend, W.F., 1980: An initial assessment of the performance achieved by ...

International Nuclear Information System (INIS)

The purpose of this study was to investigate the feasibility of a simple deformable phantom as a QA tool for testing and validation of deformable image registration algorithms. A diagnostic thoracic imaging phantom with a deformable foam insert was used in this study. Small plastic markers were distributed through the foam to create a lattice with a measurable deformation as the ground truth data for all comparisons. The foam was compressed in the superior-inferior direction using a one-dimensional drive stage pushing a flat 'diaphragm' to create deformations similar to those from inhale and exhale states. Images were acquired at different compressions of the foam and the location of every marker was manually identified on each image volume to establish a known deformation field with a known accuracy. The markers were removed digitally from corresponding images prior to registration. Different image registration algorithms were tested using ...

UK PubMed Central (United Kingdom)

Four-dimensional (4D) radiotherapy is the explicit inclusion of the temporal changes in anatomy during the imaging, planning, and delivery of radiotherapy. One key component of 4D radiotherapy planning...Full Text Available

UK PubMed Central (United Kingdom)

PurposeAuto-propagation of anatomical region-of-interests (ROIs) from the planning CT to daily CT is an essential step in image-guided adaptive radiotherapy. The...Full Text Available

Science.gov (United States)

Feb 7, 2011 ... The potentials of the spherical sensor and nearby conductors are controlled ... Incoming data are continuously monitored by algorithms in the software ... together with FM8 (Tango) by a Soyuz-Fregat rocket from Baikonur. ...

UK PubMed Central (United Kingdom)

An optical flow gradient algorithm was applied to spontaneously forming networks of neurons and glia in culture imaged by fluorescence optical microscopy in order to map functional calcium signaling...Full Text Available

Science.gov (United States)

High precision, fast computation speed, as well as a good capability of fault tolerant and reconstruction are required more and more for spacecraft attitude determination system. To realize the above requirement, an approach was presented to the synthesis of federated filters using sigma point technique. In this algorithm, the sigma point technique brought the algorithm a high precision, while the federated structure significantly enhanced the filters' capability of multi-rate information fusion, fault tolerance, and system modularity. Within consideration of computation consumption, a simple information-sharing formulation was derived to adapt to the special property of sigma point distribution, and a dynamical information sharing strategy for multi-rate fusion was developed. A numerical simulation example was employed to give the algorithm a test, where the simulated system contained a suit of gyroscopes; a three-axis ...

CERN Document Server

Future High Energy Physics experiments will produce unprecedented data volumes (up to 1 GB/s [1]). In most cases it will be impossible to analyse these data in real time and they will have to be stored on durable mostly magnetic linear media (e.g. tapes) for later analysis. This threatens to become a major cost factor for the running of these experiments. Here we present some ideas developed together with the Institute of Computer Graphics, Department for Algorithms and Programming on how this volume and the related cost can be reduced significantly. The algorithms presented are not general ones but aimed in particular to physics experiments data. Taking advantage of the knowledge of the data they are highly superior to general ones (Huffman, LZW, arithmetic coding) both in compression rate but more importantly in speed as to keep up with the output rate to modern tape drives. Above standard algorithms are, however, used ...

CERN Document Server

Experimental results show that certain message passing algorithms, namely, Survey Propagation, are very effective in finding satisfying assignments for random satisfiable 3CNF formulas which are considered hard for other SAT heuristics. Unfortunately, rigorous understanding of this phenomena is still lacking. In this paper we make a modest step towards providing rigorous explanation for the effectiveness of message passing algorithms. We analyze the performance of Warning Propagation, a popular message passing algorithm that is simpler than Survey Propagation. We show that for 3CNF formulas drawn from a certain distribution over random satisfiable 3CNF formulas, commonly referred to as the planted-assignment distribution, running Warning Propagation in the standard way (run message passing until convergence, simplify the formula according to the resulting assignment, and satisfy the remaining subformula, if necessary, using ...

Science.gov (United States)

The Federal Highway Administration (FHWA) has put a high priority on the use of existing dynamic message signs (DMS) to provide travel time estimates to the public. The Oregon Department of Transportation (ODOT) has three DMS in the Portland metropolitan ...

International Nuclear Information System (INIS)

This paper introduces a robust searching hybrid evolutionary algorithm to solve the multi-objective Distribution Feeder Reconfiguration (DFR). The main objective of the DFR is to minimize the real power loss, deviation of the nodes' voltage, the number of switching operations, and balance the loads on the feeders. Because of the fact that the objectives are different and no commensurable, it is difficult to solve the problem by conventional approaches that may optimize a single objective. This paper presents a new approach based on norm3 for the DFR problem. In the proposed method, the objective functions are considered as a vector and the aim is to maximize the distance (norm2) between the objective function vector and the worst objective function vector while the constraints are met. Since the proposed DFR is a multi objective and non-differentiable optimization problem, a new hybrid evolutionary algorithm (EA) based on the combination of the ...

Energy Technology Data Exchange (ETDEWEB)

Some diagnostics at the National Ignition Facility (NIF), including the Gamma Reaction History (GRH) diagnostic, require multiple channels of data to achieve the required dynamic range. These channels need to be stitched together into a single time series, and they may have non-uniform and redundant time samples. We chose to apply the popular cubic smoothing spline technique to our stitching problem because we needed a general non-parametric method. We adapted one of the algorithms in the literature, by Hutchinson and deHoog, to our needs. The modified algorithm and the resulting code perform a cubic smoothing spline fit to multiple data channels with redundant time samples and missing data points. The data channels can have different, time-varying, zero-mean white noise characteristics. The method we employ automatically determines an optimal smoothing level by minimizing the Generalized Cross Validation (GCV) score. In order to automatically ...

UK PubMed Central (United Kingdom)

BackgroundIn current comparative proteomics studies, the large number of images generated by 2D gels is currently compared using spot matching algorithms. Unfortunately, differences...Full Text Available

UK PubMed Central (United Kingdom)

We proposed a faster pedigree-based generalized multifactor dimensionality reduction algorithm, called PedG-MDR II (PII), to detect gene-gene interactions underlying complex traits. Inherited...Full Text Available

CERN Document Server

The complete complementary code (CCC) is a sequence family with ideal correlation sums which was proposed by Suehiro and Hatori. Numerous literatures show its applications to direct-spread code-division multiple access (DS-CDMA) systems for inter-channel interference (ICI)-free communication with improved spectral efficiency. In this paper, we propose a systematic framework for the construction of CCCs based on $N$-shift cross-orthogonal sequence families ($N$-CO-SFs). We show theoretical bounds on the size of $N$-CO-SFs and CCCs, and give a set of four algorithms for their generation and extension. The algorithms are optimal in the sense that the size of resulted sequence families achieves theoretical bounds and, with the algorithms, we can construct an optimal CCC consisting of sequences whose lengths are not only almost arbitrary but even variable between sequence families. We also discuss the family size, alphabet size, ...

International Nuclear Information System (INIS)

The accuracy of dose computation within the lungs depends strongly on the performance of the calculation algorithm in regions of electronic disequilibrium that arise near tissue inhomogeneities with large density variations. There is a lack of data evaluating the performance of highly developed analytical dose calculation algorithms compared to Monte Carlo computations in a clinical setting. We compared full Monte Carlo calculations (performed by our Monte Carlo dose engine MCDE) with two different commercial convolution/superposition (CS) implementations (Pinnacle-CS and Helax-TMS's collapsed cone model Helax-CC) and one pencil beam algorithm (Helax-TMS's pencil beam model Helax-PB) for 10 intensity modulated radiation therapy (IMRT) lung cancer patients. Treatment plans were created for two photon beam qualities (6 and 18 MV). For each dose calculation algorithm, patient, and beam quality, the ...

Energy Technology Data Exchange (ETDEWEB)

Our work has focused on the development and analysis of domain decomposition algorithms for a variety of problems arising in continuum mechanics modeling. In particular, we have extended and analyzed FETI-DP and BDDC algorithms; these iterative solvers were first introduced and studied by Charbel Farhat and his collaborators, see [11, 45, 12], and by Clark Dohrmann of SANDIA, Albuquerque, see [43, 2, 1], respectively. These two closely related families of methods are of particular interest since they are used more extensively than other iterative substructuring methods to solve very large and difficult problems. Thus, the FETI algorithms are part of the SALINAS system developed by the SANDIA National Laboratories for very large scale computations, and as already noted, BDDC was first developed by a SANDIA scientist, Dr. Clark Dohrmann. The FETI algorithms are also making inroads in commercial ...

Energy Technology Data Exchange (ETDEWEB)

This report details an investigation into the efficacy of two approaches to solving the radiation diffusion equation within a radiation hydrodynamic simulation. Because leading-edge scientific computing platforms have evolved from large single-node vector processors to parallel aggregates containing tens to thousands of individual CPU's, the ability of an algorithm to maintain high compute efficiency when distributed over a large array of nodes is critically important. The viability of an algorithm thus hinges upon the tripartite question of numerical accuracy, total time to solution, and parallel efficiency.

Energy Technology Data Exchange (ETDEWEB)

The paper presents the integration of the SIMBAD space charge module in the UAL framework. SIMBAD is a Particle-in-Cell (PIC) code. Its 3-D Parallel approach features an optimized load balancing scheme based on a genetic algorithm. The UAL framework enhances the SIMBAD standalone version with the interactive ROOT-based analysis environment and an open catalog of accelerator algorithms. The composite package addresses complex high intensity beam dynamics and has been developed as part of the FAIR SIS 100 project.

Energy Technology Data Exchange (ETDEWEB)

This paper presents a new algorithm for the optimal long-range generation planning for a thermal system with pumped-storage plants. The algorithm is based upon the analytical production costing model developed under the assumption of Gaussian probabilistic distribution of random load fluctuations and plant outages. The optimization problem consists of the master problem to determine the annual investment, and the pumped-storage subproblem to determine the optimal pumped-storage operation. The master problem is formulated as a Hamiltonian minimization problem, and the pumped-storage subproblem is solved using the concept of peak-shaving operation on the original load curve.

CERN Document Server

In source coding, either with or without side information at the decoder, the ultimate performance can be achieved by means of random binning. Structured binning into cosets of performing channel codes has been successfully employed in practical applications. In this letter it is formally shown that various convolutional- and turbo-syndrome decoding algorithms proposed in literature lead in fact to the same estimate. An equivalent implementation is also delineated by directly tackling syndrome decoding as a maximum a posteriori probability problem and solving it by means of iterative message-passing. This solution takes advantage of the exact same structures and algorithms used by the conventional channel decoder for the code according to which the syndrome is formed.

Energy Technology Data Exchange (ETDEWEB)

Recent advances in steering algorithms have made it possible to accurately control electron beam position in storage rings, implement fast and slow feedback systems, and in some cases detect hardware errors. In practice, however, the program operator would like to reduce the overhead of selecting variables and constraints and to easily view the data. To simplify the process, we constructed an interactive orbit control program in MATLAB [1]. The program modules are easily adapted to new algorithms or beam lines. This paper describes the program functionality and architecture.

CERN Document Server

A new metaheuristic optimisation algorithm, called Cuckoo Search (CS), was developed recently by Yang and Deb (2009). This paper presents a more extensive comparison study using some standard test functions and newly designed stochastic test functions. We then apply the CS algorithm to solve engineering design optimisation problems, including the design of springs and welded beam structures. The optimal solutions obtained by CS are far better than the best solutions obtained by an efficient particle swarm optimiser. We will discuss the unique search features used in CS and the implications for further research.

Energy Technology Data Exchange (ETDEWEB)

The diamond norm measures the distance between two quantum channels. From an operational viewpoint, this norm measures how well we can distinguish between two channels by applying them to the input states of arbitrarily large dimensions. In this paper, we show that the diamond norm can be conveniently, and in a physically transparent way, computed by means of a Monte Carlo algorithm based on the Fano representation of quantum states and quantum operations. The effectiveness of this algorithm is illustrated for several single-qubit quantum channels.

Energy Technology Data Exchange (ETDEWEB)

The Michigan Electric Coordination Center (MEPCC), operated by Consumers Power and Detroit Edison Companies, has the responsibility for scheduling the Ludington pumped storage plant. Ludington has an extremely large economic effect on the Consumers Power and Detroit Edison Companies' system due to its size (over 1800 MW net demonstrated generating capability). This paper presents a dynamic programming algorithm for scheduling large pumped storage plants and shows how this method can be coordinated with the commitment of the thermal units of the system.

CERN Document Server

A discrete time control algorithm using the damped least squares is introduced for acceleration and energy exchange controls in nonlinear vibrating systems. It is shown that the damping constant of least squares and sampling time step of the controller must be inversely related to insure that vanishing the time step has little effect on the results. The algorithm is illustrated on two linearly coupled Duffing oscillators near the 1:1 internal resonance. In particular, it is shown that varying the dissipation ratio of one of the two oscillators can significantly suppress the nonlinear beat phenomenon.

International Nuclear Information System (INIS)

Network reconfiguration is an operation problem, which entails altering the topological structure of the distribution feeders by rearranging the status of switches in order to obtain an optimal configuration in order to minimise the system losses. This paper presents a new reconfiguration algorithm that enhances voltage stability and improves the voltage profile besides minimising losses without incurring any additional cost for installation of capacitors, tap changing transformers and related switching equipment in the distribution system. Test results on a 69 node distribution system reveal the superiority of this algorithm.

CERN Document Server

This paper describes an effective unsupervised speaker indexing approach. We suggest a two stage algorithm to speed-up the state-of-the-art algorithm based on the Bayesian Information Criterion (BIC). In the first stage of the merging process a computationally cheap method based on the vector quantization (VQ) is used. Then in the second stage a more computational expensive technique based on the BIC is applied. In the speaker indexing task a turning parameter or a threshold is used. We suggest an on-line procedure to define the value of a turning parameter without using development data. The results are evaluated using 10 hours of audio data.

International Nuclear Information System (INIS)

The Anisotropic Analytical Algorithm (AAA) is a new pencil beam convolution/superposition algorithm proposed by Varian for photon dose calculations. The configuration of AAA depends on linear accelerator design and specifications. The purpose of this study was to investigate the accuracy of AAA for an Elekta SL25 linear accelerator for small fields and intensity modulated radiation therapy (IMRT) treatments in inhomogeneous media. The accuracy of AAA was evaluated in two studies. First, AAA was compared both with Monte Carlo (MC) and the measurements in an inhomogeneous phantom simulating lung equivalent tissues and bone ribs. The algorithm was tested under lateral electronic disequilibrium conditions, using small fields (2x2 cm"2). Good agreement was generally achieved for depth dose and profiles, with deviations generally below 3% in lung inhomogeneities and below 5% at interfaces. However, the effects of attenuation and ...

Energy Technology Data Exchange (ETDEWEB)

This paper presents a real-time wavelet-Fuzzy combined approach for digital relaying. The algorithm for fault classification employs wavelet multi resolution analysis (MRA) to overcome the difficulties associated with conventional voltage and current based measurements due to effect of factors such as fault inception angle, fault impedance and fault distance. The proposed algorithm for fault location, different from conventional algorithms that are based on deterministic computations on a well-defined model to be protected, employs wavelet transform together with fuzzy logic. The wavelet transform captures the dynamic characteristics of the non-stationary transient fault signals using wavelet MRA coefficients. The fuzzy logic is employed to incorporate expert evaluation through fuzzy inference system (FIS) so as to extract important features from wavelet MRA coefficients for obtaining coherent conclusions regarding fault ...

Energy Technology Data Exchange (ETDEWEB)

This research has two main goals. First, we wanted to introduce optimization tools in the diffusion code DONJON, mostly for fuel management. The second objective is more practical. The optimization capabilities are applied to the fuel management problem for different CANDU reactors at refueling equilibrium state. Two kinds of approaches are considered and implemented in this study to solve optimization problems in the code DONJON. The first methods are based on gradients and on the quasi-linear mathematical programming. The method initially developed in the code OPTEX is implemented as a reference approach for the gradient based methods. However, this approach has a major drawback. Indeed, the starting point has to be a feasible point. Then, several approaches have been developed to be more general and not limited by the initial point choice. Among the different methods we developed, two were found to be very efficient: the multi-step method and the mixte method. The second kind of ...

International Nuclear Information System (INIS)

This work describes an experimental verification of the two-photon dose calculation engines available on the Helax-TMS (version 6.1) commercial radiotherapy treatment planning system. The performance of the pencil beam convolution and the collapsed cone superposition algorithms was examined for 4, 6, 15 MV beams, under a range of clinically relevant irradiation geometries. Comparisons against measurements were carried out in terms of absolute dose, thus assessment of the accuracy of monitor unit (MU) calculations was also carried out. Results show that both algorithms agree with measurement to acceptable tolerance levels in most cases in homogeneous water-equivalent media irradiated under full scatter conditions. The collapsed cone algorithm slightly overestimates the penumbra width and this is mainly due to discretization effects of the fluence matrix. The accuracy of this algorithm strongly depends on ...

Energy Technology Data Exchange (ETDEWEB)

The seismic reflection exploration technique which is one of the geophysical methods for oil exploration became effectively to image the subsurface structure with rapid development of computer. As a tool to perform seismic inversion, seismic forward modeling program using ray tracing should be developed. In this study, we have developed the algorithm that is to calculate the travel time of the complex geological structure using ray tracing by subdividing the geologic model into triangular element (finite element) having the constant velocity. We can analytically calculate Jacobian with some information by this current ray tracing. With this Jacobian, we will develop new algorithm which is to obtain geological properties and to image the subsurface. Since the FEM (Finite Element Method) ray tracing we have developed goes well the inverse velocities structure, we can apply the inversion problem to complex geological model. For the convenience of ...

Energy Technology Data Exchange (ETDEWEB)

This paper presented a technique to compensate for distorted secondary currents. Since current distortion can cause operating time delays in protective relays, attempts are made to minimize current transformer (CT) saturation by choosing a CT with a voltage rating that is at least twice that required for the maximum steady-state symmetrical fault current. However, the possibility of saturation still exists because of the DC component of an asymmetrical fault current and the remanent flux in a CT core. An advanced algorithm for the compensation of the distorted signal due to CT saturation was proposed. The secondary current can be expressed as the linear combination of sinusoidal and exponential signals, if no saturation occurs. In this study, the algorithm first utilized the third difference function for detecting the start and end of saturation in real-time. The AR model-based FIR filter and the least mean square curve fitting method were then ...

International Nuclear Information System (INIS)

Reactor COre Protection System (RCOPS), an advanced core protection calculator system, is a digitized one which provides core protection function 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 adapted a two-out-of-four trip logic. System configuration, hardware platform and an improved algorithm of the newly designed core protection calculator system are described in this paper. One channel of RCOPS was implemented as a single channel facility for this R and D project where we performed final integration software testing. To implement custom function blocks, pSET is used. Software test is performed by two methods. The first method is a 'Software Module Test' and the second method is a 'Software Unit Test'. New features include improvement of core thermal ...

Energy Technology Data Exchange (ETDEWEB)

This paper uses multi-pass iteration particle swarm optimization (MIPSO) to solve short term hydroelectric generation scheduling of a power system with wind turbine generators. MIPSO is a new algorithm for solving nonlinear optimal scheduling problems. A new index called iteration best (IB) is incorporated into particle swarm optimization (PSO) to improve solution quality. The concept of multi-pass dynamic programming is applied to modify PSO further and improve computation efficiency. The feasible operational regions of the hydro units and pumped storage plants over the whole scheduling time range must be determined before applying MIPSO to the problem. Wind turbine power generation then shaves the power system load curves. Next, MIPSO calculates hydroelectric generation scheduling. It begins with a coarse time stage and searching space and refines the time interval between two time stages and the search spacing pass by pass (iteration). With the cooperation of ...

International Nuclear Information System (INIS)

This article considers a hypothetical imaging device with a spinning slat collimator that measures parallel-planar-integral data from an object. This device rotates around the object 180 deg. and stops at N positions uniformly distributed over this 180 deg. . At each stop, the device spins on its own axis 180 deg. and acquires measurements at M positions uniformly distributed over this 180 deg. . For a fixed total imaging time, an optimal distribution of the scanning time among the data measurement locations is searched by a nonlinear programming method: Nelder-Mead's simplex method. The optimal dwell time is approximately proportional to the weighting factor in the backprojector of the reconstruction algorithm. By using an optimal dwell-time profile, the reconstruction signal-to-noise ratio has a gain of 23%-24% for the filtered backprojection algorithm and a gain of 10%-18% for the iterative algorithms, compared with the ...

Science.gov (United States)

A voice-tracking algorithm was developed and tested for the purposes of electronically separating the voice signals of simultaneous talkers. Many individuals suffer from hearing disorders that often inhibit their ability to focus on a single speaker in a multiple speaker environment (the cocktail party effect). Digital hearing aid technology makes it possible to implement complex algorithms for speech processing in both the time and frequency domains. In this work, an average magnitude difference function (AMDF) was performed on mixed voice signals in order to determine the fundamental frequencies present in the signals. A time prediction neural network was trained to recognize normal human voice inflection patterns, including rising, falling, rising-falling, and falling-rising patterns. The neural network was designed to track the fundamental frequency of a single talker based on the training procedure. The output of the neural network can be ...

Science.gov (United States)

Staggered arrays of dimples printed on opposite surfaces of a cooling channel is formulated numerically and optimized with hybrid multi-objective evolutionary algorithm and Pareto optimal front. As Pareto optimal front produces a set of optimal solutions, the trends of objective functions with design variables are predicted by hybrid multi-objective evolutionary algorithm. The problem is defined by three non-dimensional geometric design variables composed of dimpled channel height, dimple print diameter, dimple spacing, and dimple depth, to maximize heat transfer rate compromising with pressure drop. Twenty designs generated by Latin hypercube sampling were evaluated by Reynolds-averaged Navier-Stokes solver and the evaluated objectives were used to construct Pareto optimal front through hybrid multi-objective evolutionary algorithm. The optimum designs were grouped by k-means clustering technique and some of the clustered ...

CERN Document Server

We show how to obtain a fast component-by-component construction algorithm for higher order polynomial lattice rules. Such rules are useful for multivariate quadrature of high-dimensional smooth functions over the unit cube as they achieve the near optimal order of convergence. The main problem addressed in this paper is to find an efficient way of computing the worst-case error. A general algorithm is presented and explicit expressions for base~2 are given. To obtain an efficient component-by-component construction algorithm we exploit the structure of the underlying cyclic group. We compare our new higher order multivariate quadrature rules to existing quadrature rules based on higher order digital nets by computing their worst-case error. These numerical results show that the higher order polynomial lattice rules improve upon the known constructions of quasi-Monte Carlo rules based on higher order digital nets.

Energy Technology Data Exchange (ETDEWEB)

Bluestein's Fast Fourier Transform (FFT), commonly called the Chirp-Z Transform (CZT), is a little-known algorithm that offers engineers a high-resolution FFT combined with the ability to specify bandwidth. In the field of digital signal processing, engineers are always challenged to detect tones, frequencies, signatures, or some telltale sign that signifies a condition that must be indicated, ignored, or controlled. One of these challenges is to detect specific frequencies, for instance when looking for tones from telephones or detecting 60-Hz noise on power lines. The Goertzel algorithm described in Embedded Systems Programming, September 2002, offered a powerful tool toward finding specific frequencies faster than the FFT.Another challenge involves analyzing a range of frequencies, such as recording frequency response measurements, matching voice patterns, or displaying spectrum information on the face of an amateur radio. To meet ...

DEFF Research Database (Denmark)

Introducing intelligence by means of cognition for managing, protecting, processing, and delivering of information in mobile communication systems is the way towards ubiquitous, converged and secure communications. In this context, this paper introduces the concept of quality of information (QoI). QoI means QoS while all the requirements for dependability, security, privacy and trust are satisfied at the highest possible level. This work proposes and describes an approach to network monitoring in a heterogeneous communication environment based on use of cognitive techniques and learning predictive algorithms (e.g., fuzzy logic). These methodologies are used to create an autonomy in the decision making process that is based on the calculation of key performance indicators (KPIs), which in their turn would trigger the needed radio resource management algorithms. The expected output is an improved network performance in terms of maximized ...

Energy Technology Data Exchange (ETDEWEB)

The partial oxidation of 1,3-butadiene has been investigated over VMoO catalysts synthesized by sol-gel techniques. Surface areas were 9-14 m{sup 2}/g, and compositions were within the solid solution regime, i.e. below 15.0 mol % MoO{sub 3}/(MoO{sub 3} + V{sub 2}O{sub 5}). Laser Raman Spectroscopy and XRD data indicated that solid solutions were formed, and pre- and post-reaction XPS data indicated that catalyst surfaces contained some V{sup +4} and were further reduced in 1,3-butadiene oxidation. A reaction pathway for 1,3-butadiene partial oxidation to maleic anhydride was shown to involve intermediates such as 3,4-epoxy-1-butene, crotonaldehyde, furan, and 2-butene-1,4-dial. The addition of water to the reaction stream substantially increased catalyst activity and improved selectivity to crotonaldehyde and furan at specific reaction temperatures. At higher water addition concentrations, furan selectivity increased from 12% to over 25%. The catalytic effects of water addition were ...

International Nuclear Information System (INIS)

A new algorithm for constructing extensions of the Virasoro algebra by primary fields - so called W-algebras - is presented. With the help of REDUCE all W-algebras with one further primary field up to conformal dimension 9 were calculated. Furthermore I give an interpretation of the obtained results using fusion algebras. The algorithm could also be used for constructing extensions of the super Virasoro algebra which play an important role in superstring theory. I present two examples here. With using representation theory of Kac-Moody algebras I determine the minimal field content of the super W_3 algebra. Finally, the general coset models SU(2)_kxSU(2)_m/SU(2)_k_+_m and SU(3)_kxSU(3)_m/SU(3)_k_+m are investigated. I calculate which W-algebras are likely contained in these cosets. (orig.).

CERN Document Server

An effective computer program for three dimensional relativistic hydrodynamical model has been developed. It implements a new approach to the early hot phase of relativistic heavy-ion collisions. The computer program simulates time-space evolution of nuclear matter in terms of ideal-fluid dynamics. Equations of motions of hydrodynamics are solved making use of finite difference methods. Commonly-used algorithms of numerical relativistic hydrodynamics RHLLE and MUSTA-FORCE have been applied in simulations. To speed-up calculations, parallel processing has been made available for solving hydrodynamical equations. The test results of simulations for 3D, 2D and Bjorken expansion are reported in this paper. As a next step we plan to implement the hadronization algorithm by implementing the continuous particle emission for freeze-out and comparing it with Cooper-Frye formula.

CERN Document Server

We describe features of the LSST science database that are amenable to scientific data mining, object classification, outlier identification, anomaly detection, image quality assurance, and survey science validation. The data mining research agenda includes: scalability (at petabytes scales) of existing machine learning and data mining algorithms; development of grid-enabled parallel data mining algorithms; designing a robust system for brokering classifications from the LSST event pipeline (which may produce 10,000 or more event alerts per night); multi-resolution methods for exploration of petascale databases; indexing of multi-attribute multi-dimensional astronomical databases (beyond spatial indexing) for rapid querying of petabyte databases; and more.

CERN Document Server

Sur l'origine des chiffres arabes A. Boucenna 1 From the pagination of an Algerian Arabic manuscript of the beginning of the 19th century,we rediscover the original shape that the Arabic numerals had before passing in Europe and underwent the transformation that gave the modern Arabic numerals. This original shape,whose use disappeared completely, proves that these numerals have their origin in the Arabic letters. Contrary to what some hypotheses pretend, particularly those that present them as drifting of Indian characters, the 10 Arabic numerals that we use are, nothing else, 10 Arabic letters more or less modified and taken in the "Abjadi" order. The hypothesis of the Indian origin of the Arabic numerals is revealed a mistake denied by the shape of the Arabic numerals and by the logic of the right to left representation of the numbers and the algorithm of the elementary operations. The Arabic numerals that simplified the writing of the numbers and the ...

International Nuclear Information System (INIS)

A model for the simulation of the time dependent behavior and the analysis of the equilibrium of the coupled system of storage ring and Free Electron Laser (FEL) is presented. The analysis comprises both amplifier and oscillator FEL. Bunch lengthening and energy widening due to wake forces are taken into account in a self-consistent way. The method is based on a mapping algorithm for means and correlations of the electron distribution function, pioneered by K. Hirata. The evolution of the laser field in the oscillator FEL is described by K. Hirata. The evolution of the laser field in the oscillator FEL is described by supermodes. The model is used to simulate an FEL in a small 500 MeV storage ring with 100 m circumference. Typical values for the output power, spatial, and spectral characteristics of the emitted radiation are presented.

Energy Technology Data Exchange (ETDEWEB)

This paper is devoted to the coordination of secondary voltage control and adaptive parameters resetting of the power system stabilizer, in order to increase stability, margins in real time operation. Secondary voltage control and the power system stabilizer are two control loops, which affect the same system parameter on different bases - that parameter is the voltage set-point of the automatic voltage regulator. It was found that their effects were complementary. In that way, through the proper coordination of actions of these two control loops open up a wide range of possibilities for ensuring the stability of bulk power systems in real time. For the establishment of this coordination, an on-line sequential algorithm is proposed which is based on adaptive resetting of the voltage set-point of the automatic voltage regulator and the PSS parameters. The efficiency of the proposed algorithm is confined through simulations on a real-life ...

British Library Electronic Table of Contents (United Kingdom)

This study presents new software, called Google Earth-based Optimal HAulage RouTing System (GEOHARTS), to improve the functionality of Google Earth for optimal haulage routing of off-road dump trucks in construction and mining sites. A modified least-cost path algorithm, which is applicable to working areas with both paved and unpaved temporary roads and can consider the effects of terrain relief and curves along a route on the route planning, was proposed and utilized for the software development. GEOHARTS can determine optimal haulage routes between loaders and dumps that ensure the least travel time or fuel consumption of off-road dump trucks and can visualize the results using an embedded 3D render window of Google Earth. The application to the Pasir open-pit coal mine in Indonesia dem...

British Library Electronic Table of Contents (United Kingdom)

Currently many service providers offer their services on a private and proprietary hard- and software infrastructure. These infrastructures often share many similarities. Hence we believe a generic service management architecture, that allows service providers to offer a large array of different services on a single infrastructure or multiple providers to offer their services cooperatively, would provide many advantages over current silo-based approaches. Additionally, by allowing the distributed service management components to cooperate in a peer-to-peer overlay network, scalability and resilience of the system could be greatly improved. In this paper we propose an optimal algorithm, based on an integer linear programming (ILP) formulation, and several heuristics to support such a generi...

CERN Document Server

Term extraction is one of the layers in the ontology development process which has the task to extract all the terms contained in the input document automatically. The purpose of this process is to generate list of terms that are relevant to the domain of the input document. In the literature there are many approaches, techniques and algorithms used for term extraction. In this paper we propose a new approach using particle swarm optimization techniques in order to improve the accuracy of term extraction results. We choose five features to represent the term score. The approach has been applied to the domain of religious document. We compare our term extraction method precision with TFIDF, Weirdness, GlossaryExtraction and TermExtractor. The experimental results show that our propose approach achieve better precision than those four algorithm.

CERN Document Server

Strong gravitational lensing of an extended object is described by a mapping from source to image coordinates that is nonlinear and cannot generally be inverted analytically. Determining the structure of the source intensity distribution also requires a description of the blurring effect due to a point spread function. This initial study uses an iterative gravitational lens modeling scheme based on the semilinear method to determine the linear parameters (source intensity profile) of a strongly lensed system. Our 'matrix-free' approach avoids construction of the lens and blurring operators while retaining the least squares formulation of the problem. The parameters of an analytical lens model are found through nonlinear optimization by an advanced genetic algorithm (GA) and particle swarm optimizer (PSO). These global optimization routines are designed to explore the parameter space thoroughly, mapping model degeneracies in detail. We develop a novel method that ...

British Library Electronic Table of Contents (United Kingdom)

A crack fault is one of the damage modes most frequently occurring in gears. Identifying different crack levels, especially for early cracks is a challenge in gear fault diagnosis. This paper aims to propose a method to classify the different levels of gear cracks automatically and reliably. In this method, feature parameters in time domain, specially designed for gear damage detection and in frequency domain are extracted to characterize the gear conditions. A two-stage feature selection and weighting technique (TFSWT) via Euclidean distance evaluation technique (EDET) is presented and adopted to select sensitive features and remove fault-unrelated features. A weighted K nearest neighbor (WKNN) classification algorithm is utilized to identify the gear crack levels. The gear crack experime...

DEFF Research Database (Denmark)

The determination of conformational preferences in unfolded and disordered proteins is an important challenge in structural biology. We here describe an algorithm to optimize energy functions for the simulation of unfolded proteins. The procedure is based on the maximum likelihood principle and employs a fast and efficient gradient descent method to find the set of parameters of the energy function that best explain the experimental data. We first validate the method by using synthetic reference data, and subsequently apply the algorithms to data from nuclear magnetic resonance spin-labeling experiments on the Delta 131 Delta fragment of Staphylococcal nuclease. A significant strength of the procedure that we present is that it directly uses experimental data to optimize the energy parameters, without relying on the availability of high resolution structures. The procedure is fully general and can be applied to a range of experimental data and ...

CERN Document Server

The MAP model was introduced in information system engineering in order to model processes on a flexible way. The intentional level of this model helps an engineer to execute a process with a strong relationship to the situation of the project at hand. In the literature, attempts for having a practical use of maps are not numerous. Our aim is to enhance the guidance mechanisms of the process execution by reusing graph algorithms. After clarifying the existing relationship between graphs and maps, we improve the MAP model by adding qualitative criteria. We then offer a way to express maps with graphs and propose to use Graph theory algorithms to offer an automatic guidance of the map. We illustrate our proposal by an example and discuss its limitations.

International Nuclear Information System (INIS)

Waste electrical and Electronic Equipment (WEEE) constitutes 4% of the municipal waste in Europe, being increased by 16-28% every five years. Nowadays, Europe produces 6,5 million tonnes of WEEE per year and currently 90% goes to landfill. WEEE waste is growing 3 times faster than municipal waste and this figure is expected to be increased up to 12 million tones by 2015. Applying a new technology to separate non-ferrous metal Waste from WEEE is the aim of this paper, by identifying multi-and hyper-spectral materials and inserting them in a recycling plant. This technology will overcome the shortcomings passed by current methods, which are unable to separate valuable materials very similar in colour, size or shape. For this reason, it is necessary to develop new algorithms able to distinguish among these materials and to face the timing requirements. (Author). 22 refs.

Energy Technology Data Exchange (ETDEWEB)

A new recurrent neural network power system stabilizer (RNNPSS) based on genetic algorithm (GA) was presented. It shows faster convergence than the linear quadratic regulator (LQR) stabilizer in a multi-machine power system, because the proposed GA based neural network was first trained off-line to determine the optimal values of the learning rates. Otherwise, the RNNPSS consists of just two layers. As such, the time consumption of the damping oscillations is lower than with conventional methods. In addition, the operating range of the RNNPSS is greater than that of the LQR and conventional three layer neural networks, since the RNNPSS can greatly reduce system complexity and effectively damp system oscillations. 9 refs., 7 figs.

CERN Document Server

Problem statement: Clustering has a number of techniques that have been developed in statistics, pattern recognition, data mining, and other fields. Subspace clustering enumerates clusters of objects in all subspaces of a dataset. It tends to produce many over lapping clusters. Approach: Subspace clustering and projected clustering are research areas for clustering in high dimensional spaces. In this research we experiment three clustering oriented algorithms, PROCLUS, P3C and STATPC. Results: In general, PROCLUS performs better in terms of time of calculation and produced the least number of un-clustered data while STATPC outperforms PROCLUS and P3C in the accuracy of both cluster points and relevant attributes found. Conclusions/Recommendations: In this study, we analyze in detail the properties of different data clustering method.

CERN Document Server

In the 21st century, Aerial and satellite images are information rich. They are also complex to analyze. For GIS systems, many features require fast and reliable extraction of open space area from high resolution satellite imagery. In this paper we will study efficient and reliable automatic extraction algorithm to find out the open space area from the high resolution urban satellite imagery. This automatic extraction algorithm uses some filters and segmentations and grouping is applying on satellite images. And the result images may use to calculate the total available open space area and the built up area. It may also use to compare the difference between present and past open space area using historical urban satellite images of that same projection

British Library Electronic Table of Contents (United Kingdom)

Derivative spectrophotometry and bivariate calibration algorithm were used for study of run of photooxidation of levomepromazine hydrochloride (LV). The actual concentrations of LV and its main degradation product levomepromazine sulphoxide (LV-SO) were calculated using data provided by applied methods. The direct reading of absorbance values at 302nm and 334nm were employed for quantification of LV and LV-SO, respectively, in the case of bivariate method. The derivative spectrophotometric method is based on transformation of zero-order spectra into first derivative. The values of first derivative at 334nm were used for quantification of LV while at 278nm for assay of LV-SO. The obtained quantitative data were applied for investigation of kinetics of photodegradation of LV.

CERN Document Server

Inferring cluster structure in microarray datasets is a fundamental task for the -omic sciences. A fundamental question in Statistics, Data Analysis and Classification, is the prediction of the number of clusters in a dataset, usually established via internal validation measures. Despite the wealth of internal measures available in the literature, new ones have been recently proposed, some of them specifically for microarray data. In this dissertation, a study of internal validation measures is given, paying particular attention to the stability based ones. Indeed, this class of measures is particularly prominent and promising in order to have a reliable estimate the number of clusters in a dataset. For those measures, a new general algorithmic paradigm is proposed here that highlights the richness of measures in this class and accounts for the ones already available in the literature. Moreover, some of the most representative validation measures are also ...

Energy Technology Data Exchange (ETDEWEB)

Ultra-short-pulse reflectometry is studied by means of the numerical integration of a one-dimensional full-wave equation for ordinary modes propagating in a plasma. The numerical calculations illustrate the potential of using the reflection of ultra-short-pulse, microwaves as an effective probe of the density profile even in the presence of significant density fluctuations. The difference in time delays of differing frequency components of the microwaves can be used to deduce the density profile. The modification of the reflected pulses in the presence of density fluctuations is examined and can be understood based on considerations of Bragg resonance. A simple and effective profile-reconstruction algorithm using the zero-crossings of the reflected pulse and subsequent Abel inversion is demonstrated. The robustness of the profile reconstruction algorithm in the presence of a sufficiently small amplitude density perturbation is assessed.

Energy Technology Data Exchange (ETDEWEB)

Restructuring of power system has changed the traditional planning objectives and introduced challenges in the field of Transmission Expansion Planning (TEP). Due to these changes, new approaches and criteria are needed for transmission planning in deregulated environment. Therefore, in this paper, a dynamic expansion methodology is presented using a multi-objective optimization framework. Investment cost, congestion cost and reliability are considered in the optimization as three objectives. To overcome the difficulties in solving the non-convex and mixed integer nature of the optimization problems, a Non-Dominated Sorting Genetic Algorithm (NSGA II) approach is used followed by a fuzzy decision making analysis to obtain the final optimal solution. The planning methodology has been demonstrated on the IEEE 24-bus test system and north-east of Iran national 400 kV transmission grid to show the feasibility and capabilities of the proposed ...

CERN Document Server

Feature selection refers to the problem of selecting relevant features which produce the most predictive outcome. In particular, feature selection task is involved in datasets containing huge number of features. Rough set theory has been one of the most successful methods used for feature selection. However, this method is still not able to find optimal subsets. This paper proposes a new feature selection method based on Rough set theory hybrid with Bee Colony Optimization (BCO) in an attempt to combat this. This proposed work is applied in the medical domain to find the minimal reducts and experimentally compared with the Quick Reduct, Entropy Based Reduct, and other hybrid Rough Set methods such as Genetic Algorithm (GA), Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO).

Energy Technology Data Exchange (ETDEWEB)

Hybrid models for solving unit commitment problem have been proposed in this paper. To incorporate the changes due to the addition of new constraints automatically, an expert system (ES) has been proposed. The ES combines both schedules of units to be committed based on any classical or traditional algorithms and the knowledge of experienced power system operators. A solution database, i.e. information contained in the previous schedule is used to facilitate the current solution process. The proposed ES receives the input, i.e. the unit commitment solutions from a fuzzy-neural network. The unit commitment solutions from the artificial neural network cannot offer good performance if the load patterns are dissimilar to those of the trained data. Hence, the load demands, i.e. the input to the fuzzy-neural network is considered as fuzzy variables. To take into account the uncertainty in load demands, a fuzzy decision making approach has also been developed to solve the ...

CERN Document Server

We derive the explicit formula for the joint Laplace transform of the Wishart process and its time integral which extends the original approach of Bru. We compare our methodology with the alternative results given by the variation of constants method, the linearization of the Matrix Riccati ODE's and the Runge-Kutta algorithm. The new formula turns out to be fast, accurate and very useful for applications when dealing with stochastic volatility and stochastic correlation modelling.

Energy Technology Data Exchange (ETDEWEB)

Transmission line faults must be located accurately to allow maintenance crews to arrive at the scene and repair the faulted section as soon as possible. Rugged terrain and geographical layout cause some sections of power transmission lines to be difficult to reach. In the past, a variety of fault location algorithms were introduced as either an add-on feature in protective relays or stand-alone implementation in fault locators. In both cases, the measurements of current and voltages were taken at one terminal of a transmission line only. Under such conditions, it may become difficult to determine the fault location accurately, since data from other transmission line ends are required for more precise computations. In the absence of data from the other end, existing algorithms have accuracy problems under several circumstances, such as varying switching and loading conditions, fault infeed from the other end, and random value of fault ...

International Nuclear Information System (INIS)

An explicite PN solution of the multi-dimensional homogeneous neutron transport equation is given by expanding the angular flux into a series of geometry-independent spherical harmonics operators. An algorithm is developed for representing the spherical harmonic operators in orthogonal curvilinear coordinates. The general formulae are applied to two-dimensional spherical geometry; detailed P3 formulae are given. (orig.).

Energy Technology Data Exchange (ETDEWEB)

A new multigrid algorithm based on the method of self-correction for the solution of elliptic problems is described. The method exploits information contained in the residual to dynamically modify the source term (right-hand side) of the elliptic problem. It is shown that the self-correcting solver is more efficient at damping the short wavelength modes of the algebraic error than its standard equivalent. When used in conjunction with a multigrid method, the resulting solver displays an improved convergence rate with no additional computational work.

International Nuclear Information System (INIS)

These proceedings compile the papers presented at the international conference (1988) sponsored by IEEE Council on ''Robotics and Automation''. The subjects discussed were: automation and robots of nuclear power stations; algorithms of multiprocessors; parallel processing and computer architecture; and U.S. DOE research programs on nuclear power plants.

Energy Technology Data Exchange (ETDEWEB)

The transition radiation detector (TRD) for the D{Phi} experiment is currently in operation at Fermilab. Transition radiation production, which has been clearly observed in the collider data, makes the TRD a valuable tool to discriminate electrons and hadrons. We describe an algorithm based on the truncated energy, and illustrate its use for top signal and background. (authors). 7 refs., 6 figs., 2 tabs.

Energy Technology Data Exchange (ETDEWEB)

We study by means of Quantum Monte Carlo simulations based on the Worm Algorithm the low temperature (down to T = 0.05 K) properties of parahydrogen clusters comprising up to 40 molecules. Three different intermolecular interactions are employed: the Silvera-Goldman, the Buck and the Lennard-Jones potential. Despite important discrepancies observed in the numerical estimates of energy and superfluid fraction, the mechanism by which clusters melt at low T is independent of the particular choice of the potential, whose only effect is to alter the temperature scale.

CERN Document Server

We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given propositional knowledge base. We give a general algorithm, based on the notion of projection; then we study restrictions over the representations of the knowledge base and of the query, and find new polynomial classes of abduction problems.

Energy Technology Data Exchange (ETDEWEB)

An analyzer-based X-ray phase-contrast imaging (ABI) setup has been mounted at the Brazilian Synchrotron Light Laboratory (LNLS) for multiple imaging radiography (MIR) purposes. The algorithm employed for treating the MIR data collected at LNLS is described, and its reliability in extracting the distinct types of contrast that can be obtained with MIR is demonstrated by analyzing a test sample (thin polyamide wire). As a practical application, the possibility of studying ophthalmic tissues, corneal sequestra in this case, via MIR is investigated.

Energy Technology Data Exchange (ETDEWEB)

Accurate automated alignment of laser beams in the National Ignition Facility (NIF) is essential for achieving extreme temperature and pressure required for inertial confinement fusion. The alignment achieved by the integrated control systems relies on algorithms processing video images to determine the position of the laser beam images in real-time. Alignment images that exhibit wide variations in beam quality require a matched-filter algorithm for position detection. One challenge in designing a matched-filter based algorithm is to construct a filter template that is resilient to variations in imaging conditions while guaranteeing accurate position determination. A second challenge is to process the image as fast as possible. This paper describes the development of a new analytical template that captures key recurring features present in the beam image to accurately estimate the beam position under good image quality ...

Wastenet

...Correction Discussion Editorial Letter Opinion Review Short Note Technical Note Special Issue all A Systematic Development Method for Rational Drug Design Advances in Molecular Electronic Structure Calculations Algorithms and Molecular Sciences Antimicrobial Agents Application of Density Functional Theory Applications of Density Functional Theory Applications of Molecular Dynamics Atoms in Molecules ...

Science.gov (United States)

This study presents a novel approach to modeling the electrocardiogram (ECG): the Gaussian pulse decomposition. Constituent waves of the ECG are decomposed into and represented by Gaussian pulses using an iterative algorithm: the chip away decomposition (ChAD) algorithm. At each iteration, a nonlinear minimization method is used to fit a portion of the ECG waveform with a single Gaussian pulse, which is then subtracted from the ECG waveform. The process iterates on the resulting residual waveform until the normalized mean square error is below an acceptable level. Three different minimization methods were compared for their applicability to the ChAD algorithm; the Nelder-Mead simplex method was found to be more noise-tolerant than the Newton-Raphson method or the steepest descent method. Using morphologically different ECG waveforms from the MIT-BIH arrhythmia database, it was demonstrated that the ChAD ...

Science.gov (United States)

Over the past ten years face segmentation has developed rapidly and various algorithms have been proposed. In this paper we will demonstrate a face detection system based on skin color and the spaces RGB, normalized RGB, HSV and YCbCr are concentrated here. Through combing them the more accurate face region will be detected.

CERN Document Server

This paper describes the approach taken to the XML Mining track at INEX 2008 by a group at the Queensland University of Technology. We introduce the K-tree clustering algorithm in an Information Retrieval context by adapting it for document clustering. Many large scale problems exist in document clustering. K-tree scales well with large inputs due to its low complexity. It offers promising results both in terms of efficiency and quality. Document classification was completed using Support Vector Machines.

Science.gov (United States)

This was written as the research final report of (sup D)evelopment of Auto- tuning System for the Process Optimal Control of Wolsung NPP(sup ()95ZS13). In this research, a new PID controller auto-tuning algorithm and Auto-tuning System which can simulate ...

International Nuclear Information System (INIS)

Helical tomotherapy presented many unique dosimetric challenges and solutions during the initial commissioning process, and some of them are presented. The dose calculation algorithm is convolution/superposition based. This requires that the energy fluence spectrum and magnitude be quantified. The methodology for doing so is described. Aspects of the energy fluence characterization that are unique to tomotherapy are highlighted. Many beam characteristics can be measured automatically by an included megavoltage computed tomography imaging system. This greatly improves data collection efficiency.

Energy Technology Data Exchange (ETDEWEB)

The Albedo Theory was applied in order to develop an one-group algorithm for coupled neutron-gamma shielding calculations. The configuration analyzed consists of multilayered plane systems, where a incident neutron current generates gamma radiation through neutron-gamma reactions. The results obtained by Albedo Method and ANISN code have shown excellent agreement. (author)

CERN Document Server

The performance of Evolutionary Algorithms can be enhanced by integrating the concept of agents. Agents and Multi-agents can bring many interesting features which are beyond the scope of traditional evolutionary process and learning. This book presents the state-of-the art in the theory and practice of Agent Based Evolutionary Search and aims to increase the awareness on this effective technology. This includes novel frameworks, a convergence and complexity analysis, as well as real-world applications of Agent Based Evolutionary Search, a design of multi-agent architectures and a design of age

Energy Technology Data Exchange (ETDEWEB)

We propose an extension of Gaussian mixture models in the statistical-mechanical point of view. The conventional Gaussian mixture models are formulated to divide all points in given data to some kinds of classes. We introduce some quantum states constructed by superposing conventional classes in linear combinations. Our extension can provide a new algorithm in classifications of data by means of linear response formulas in the statistical mechanics.

Energy Technology Data Exchange (ETDEWEB)

This report discusses a desk-top computer program has been developed for estimating the costs, waste volumes, and occupational radiation exposures associated with decommissioning light-water reactor power stations. Cost categories and cost algorithms used in the program are discussed and a brief description of the user interface is given.

Energy Technology Data Exchange (ETDEWEB)

A variety of surveillance operations require the ability to track vehicles over a long period of time using sequences of images taken from a camera mounted on an airborne or similar platform. In order to be able to see and track a vehicle for any length of time, either a persistent surveillance imager is needed that can image wide fields of view over a long time-span or a highly maneuverable smaller field-of-view imager is needed that can follow the vehicle of interest. The algorithm described here was designed for the persistence surveillance case. In turns out that most vehicle tracking algorithms described in the literature[1,2,3,4] are designed for higher frame rates (> 5 FPS) and relatively short ground sampling distances (GSD) and resolutions ({approx} few cm to a couple tens of cm). But for our datasets, we are restricted to lower resolutions and GSD's ({ge}0.5 m) and limited frame-rates ({le}2.0 Hz). As a consequence, we ...

Energy Technology Data Exchange (ETDEWEB)

This paper presents (a) an overview of the Inmos transputer and its use in parallel arrays for image processing, (b) a functional block-level description of IBM-AT-compatible boards for signal/image processing research using transputers with reconfigurable interconnection topologies, and (c) an overview of the OCCAM and C programming tools for placing parallel algorithms onto such a processor. The hardware consists of two custom printed-circuit boards (and two commercially available boards) within an IBM-AT host. The first provides a flexible input/output interface between a general-purpose high-speed input-data bus and the transputer array. The second contains 32 transputers and 4 programmable crossbar-switch interconnection chips. Several copies of the second board can be cascaded (or even partially-unpopulated) to provide for an arbitrary number of transputer chips. Each one of these boards will perform about 128 million Whetstones or, for highly regular ...

International Nuclear Information System (INIS)

An outline is given of time-dependent wavepacket methods as applied to calculations of molecular collisions with solid surfaces. The methods reviewed include numerical integration algorithms for the time-dependent Schroedinger equation, semiclassical wavepacket treatments, and approximations that treat some of the degrees-of-freedom quantum-mechanically and others classically. The computational and numerical characteristics of these methods are discussed, with emphasis on their particular advantages and relevance in the context of certain molecule/surface scattering problems. For the semiclassical and mixed quantal-classical treatments, the approximation errors and their physical origins are discussed. For the quantum wavepacket techniques a numerical error analysis is presented. The computational efficiency of the various algorithms is considered and examined in the context of several applications. The main focus is on diffractive scattering ...

Energy Technology Data Exchange (ETDEWEB)

The seismic reflection exploration technique which is one of the geophysical methods for oil exploration became effectively to image the subsurface structure with rapid development of computer. As a tool to perform seismic inversion, seismic forward modeling program using ray tracing should be developed. In this study, we have developed the algorithm that is to calculate the travel time of the complex geological structure using ray tracing by subdividing the geologic model into triangular element (finite element) having the constant velocity. We can analytically calculate Jacobian with some information by this current ray tracing. With this Jacobian, we will develop new algorithm which is to obtain geological properties and to image the subsurface. Since the FEM (Finite Element Method) ray tracing we have developed goes well the inverse velocities structure, we can apply the inversion problem to complex geological model. This report consists of ...

International Nuclear Information System (INIS)

Reactor Regulating System (RRS) of TAPP-3 and 4 (540 MWe PHWR) addresses issues of elaborate Flux Tilt Control as applied to large Reactor Cores in addition to the traditional Bulk Power (Actual Power) Control. The control of Bulk and Zonal Power by RRS through the use of Zonal Control Compartments (ZCCs) has been successfully demonstrated in the Indian PHWRs for the first time. Features like automation in Demand Power Maneuvering, Manual Movement of Reactivity Devices through the Human Machine Interface (HMI) and the supervised withdrawal of Shut-off Rods during Auto Criticality are also included. Special algorithms to measure and control the individual Zone Power and Bulk Power also form part of RRS algorithms. This paper describes the salient features of RRS of TAPP-3 and 4 and the improvement carried out based on the feedback of past 1 year of operation of TAPP-4 at around 90 % FP. (author)

Energy Technology Data Exchange (ETDEWEB)

Target recognition requires the ability to distinguish targets from non-targets, a capability called one-class generalization. To function as a one-class classifier, a neural network must have three types of generalization: within-class, between-class, and out-of-class. We discuss these three types of generalization and identify neural network architectures that meet these requirements. We have applied our one-class classifier ideas to the problem of automatic target recognition in synthetic aperture radar. We have compared three neural network algorithms: Carpenter and Grossberg`s algorithmic version of the Adaptive Resonance Theory (ART-2A), Kohonen`s Learning Vector Quantization (LVQ), and Reilly and Cooper`s Restricted Columb Energy network (RCE). The ART 2-A neural network has given the best results, with 100% within-class, and out-of-class generalization. Experiments show that the network`s performance is sensitive to vigilance and number ...

Energy Technology Data Exchange (ETDEWEB)

Stable and accurate numerical analytical method even at high Rayleigh numbers is desired, and in addition flexibility and economical efficiency are very important for numerical analysis. Unsteady flows of natural convention in a square cavity are investigated using the GSMAC (generalized and simplified marker and cell) finite-element method at high Rayleigh numbers from 10 {sup 6} to 10 {sup 8}. Validities of the multi-pass algorithm and BTD (balancing tensor diffusivity), which are highly accurate solutions for finite-element method, are investigated by introducing them to the GSMAC finite-element method. As the result, it was found that the multi-pass algorithm has little effect for the GSMAC finite-element method. The steady solutions at the Rayleigh numbers of 10 {sup 5} and 10 {sup 7} agreed well with the bench mark solutions and numerical solutions. Complex transient phenomena at Rayleigh numbers higher than 10 {sup 7} are successfully ...

International Nuclear Information System (INIS)

X-ray imaging using asymmetric Bragg reflection in the hard x-ray regime opens the way to improve the spatial resolution limit below 1 #mu#m by magnifying the image before detection, simultaneously providing a strong phase contrast. A theoretical formalism of the imaging process is established. Based on this algorithm, numerical simulations are performed and demonstrate that both Fresnel propagation and Bragg diffraction contribute to contrast formation. The achievable resolution of this technique is investigated theoretically; the results obtained can be used to improve future experimental setups. Furthermore, the minimum detectable phase gradient is estimated, for comparison with other phase sensitive imaging techniques. Results from biological objects demonstrate that the technique is viable for imaging both in two and three dimensions. Refraction contrast images are extracted from experimental projection images by an algorithm similar to ...

Energy Technology Data Exchange (ETDEWEB)

A novel method to detect and correct inaccuracies in a set of unconstrained dense correspondences between two images is presented. Starting with a robust, general-purpose dense correspondence algorithm, an initial pose estimate and dense 3D scene reconstruction are obtained and bundle-adjusted. Reprojection errors are then computed for each correspondence pair, which is used as a metric to distinguish high and low-error correspondences. An affine neighborhood-based coarse-to-fine iterative search algorithm is then applied only on the high-error correspondences to correct their positions. Such an error detection and correction mechanism is novel for unconstrained dense correspondences, for example not obtained through epipolar geometry-based guided matching. Results indicate that correspondences in regions with issues such as occlusions, repetitive patterns and moving objects can be identified and corrected, such that a more accurate set of ...

CERN Document Server

Collective graphical models exploit inter-instance associative dependence to output more accurate labelings. However existing models support very limited kind of associativity which restricts accuracy gains. This paper makes two major contributions. First, we propose a general collective inference framework that biases data instances to agree on a set of {\\em properties} of their labelings. Agreement is encouraged through symmetric clique potentials. We show that rich properties leads to bigger gains, and present a systematic inference procedure for a large class of such properties. The procedure performs message passing on the cluster graph, where property-aware messages are computed with cluster specific algorithms. This provides an inference-only solution for domain adaptation. Our experiments on bibliographic information extraction illustrate significant test error reduction over unseen domains. Our second major contribution consists of ...

CERN Document Server

Many kinds of Evolutionary Algorithms (EAs) have been described in the literature since the last 30 years. However, though most of them share a common structure, no existing software package allows the user to actually shift from one model to another by simply changing a few parameters, e.g. in a single window of a Graphical User Interface. This paper presents GUIDE, a Graphical User Interface for DREAM Experiments that, among other user-friendly features, unifies all kinds of EAs into a single panel, as far as evolution parameters are concerned. Such a window can be used either to ask for one of the well known ready-to-use algorithms, or to very easily explore new combinations that have not yet been studied. Another advantage of grouping all necessary elements to describe virtually all kinds of EAs is that it creates a fantastic pedagogic tool to teach EAs to students and newcomers to the field.

CERN Document Server

This paper proposes the application of particle swarm optimization (PSO) to the problem of finite element model (FEM) selection. This problem arises when a choice of the best model for a system has to be made from set of competing models, each developed a priori from engineering judgment. PSO is a population-based stochastic search algorithm inspired by the behaviour of biological entities in nature when they are foraging for resources. Each potentially correct model is represented as a particle that exhibits both individualistic and group behaviour. Each particle moves within the model search space looking for the best solution by updating the parameters values that define it. The most important step in the particle swarm algorithm is the method of representing models which should take into account the number, location and variables of parameters to be updated. One example structural system is used to show the applicability of PSO in finding ...

CERN Document Server

One class of gravitational wave signals LIGO is searching for consists of short duration bursts of unknown waveforms. Potential sources include core collapse supernovae, gamma ray burst progenitors, and the merger of binary black holes or neutron stars. We present a density-based clustering algorithm to improve the performance of time-frequency searches for the such gravitational-wave bursts when they are extended in time and/or frequency. We have implemented this algorithm as an extension to the QPipeline search for bursts, which currently determines the statistical significance of events based solely on the peak significance observed in minimum uncertainty regions of the time-frequency plane. Density based clustering improves the performance of such a search by considering the aggregate significance of arbitrarily shaped regions in the time-frequency plane and rejecting the isolated minimum uncertainty features expected from the background ...

Energy Technology Data Exchange (ETDEWEB)

Finite-difference acoustic-wave modeling and reverse-time depth migration based on the full wave equation are general approaches that can take into account arbitrary variations in velocity and density and can handle turning waves as well. However, conventional finite-difference methods for solving the acoustic- or elastic-wave equation suffer from numerical dispersion when too few samples per wavelength are used. The flux-corrected transport (FCT) algorithm, adapted from hydrodynamics, reduces the numerical dispersion in finite-difference wavefield continuation. The flux-correction procedure endeavors to incorporate diffusion into the wavefield continuation process only where needed to suppress the numerical dispersion. Incorporating the flux-correction procedure in conventional finite-difference modeling or reverse-time migration can provide finite-difference solutions with no numerical dispersion even for impulsive sources. The FCT correction, which can be ...

International Nuclear Information System (INIS)

This paper presents a practical case study on the dynamic stability of the Saudi Electricity Company (SEC) power system and its effect on increasing power transfer limit of the interconnection between Eastern Operating Area (SEC-EOA). The problem of optimal tuning of the power system stabilizer parameters was converted into optimization problem wth eigenvalue-based objective functions, which was then solved by genetic algorithms. In this regard, two eigenvalue-based objective functions were considered and the problem is solved using real-coded genetic algorithm (RCGA). The effectiveness of the suggested technique to enhance the power system dynamic stability and to extend the power transfer capability limit of the SEC-EOA and the SEC-EOA power system was verified through a comprehensive eigenvalue analysis and time-domain nonlinear simulation. The results also indicated that the proposed tuning schemes of the existing stabilizers in the system ...

CERN Document Server

Data mining is a useful decision support technique that can be used to discover production rules in warehouses or corporate data. Data mining research has made much effort to apply various mining algorithms efficiently on large databases. However, a serious problem in their practical application is the long processing time of such algorithms. Nowadays, one of the key challenges is to integrate data mining methods within the framework of traditional database systems. Indeed, such implementations can take advantage of the efficiency provided by SQL engines. In this paper, we propose an integrating approach for decision trees within a classical database system. In other words, we try to discover knowledge from relational databases, in the form of production rules, via a procedure embedding SQL queries. The obtained decision tree is defined by successive, related relational views. Each view corresponds to a given population in the underlying ...