DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Moruz, Gabriel
2006-01-01
It is well-known that to minimize the number of comparisons a binary search tree should be perfectly balanced. Previous work has shown that a dominating factor over the running time for a search is the number of cache faults performed, and that an appropriate memory layout of a binary search tree...... can reduce the number of cache faults by several hundred percent. Motivated by the fact that during a search branching to the left or right at a node does not necessarily have the same cost, e.g. because of branch prediction schemes, we in this paper study the class of skewed binary search trees....... For all nodes in a skewed binary search tree the ratio between the size of the left subtree and the size of the tree is a fixed constant (a ratio of 1/2 gives perfect balanced trees). In this paper we present an experimental study of various memory layouts of static skewed binary search trees, where each...
A Two-Level Cache for Distributed Information Retrieval in Search Engines
Directory of Open Access Journals (Sweden)
Weizhe Zhang
2013-01-01
Full Text Available To improve the performance of distributed information retrieval in search engines, we propose a two-level cache structure based on the queries of the users’ logs. We extract the highest rank queries of users from the static cache, in which the queries are the most popular. We adopt the dynamic cache as an auxiliary to optimize the distribution of the cache data. We propose a distribution strategy of the cache data. The experiments prove that the hit rate, the efficiency, and the time consumption of the two-level cache have advantages compared with other structures of cache.
A two-level cache for distributed information retrieval in search engines.
Zhang, Weizhe; He, Hui; Ye, Jianwei
2013-01-01
To improve the performance of distributed information retrieval in search engines, we propose a two-level cache structure based on the queries of the users' logs. We extract the highest rank queries of users from the static cache, in which the queries are the most popular. We adopt the dynamic cache as an auxiliary to optimize the distribution of the cache data. We propose a distribution strategy of the cache data. The experiments prove that the hit rate, the efficiency, and the time consumption of the two-level cache have advantages compared with other structures of cache.
Understanding search trees via statistical physics
Indian Academy of Sciences (India)
ary search tree model (where stands for the number of branches of the search tree), an important problem for data storage in computer science, using a variety of statistical physics techniques that allow us to obtain exact asymptotic results.
A Durable Flash Memory Search Tree
Clay III, James; Wortman, Kevin
2012-01-01
We consider the task of optimizing the B-tree data structure, used extensively in operating systems and databases, for sustainable usage on multi-level flash memory. Empirical evidence shows that this new flash memory tree, or FM Tree, extends the operational lifespan of each block of flash memory by a factor of roughly 27 to 70 times, while still supporting logarithmic-time search tree operations.
Phylogenetic search through partial tree mixing
2012-01-01
Background Recent advances in sequencing technology have created large data sets upon which phylogenetic inference can be performed. Current research is limited by the prohibitive time necessary to perform tree search on a reasonable number of individuals. This research develops new phylogenetic algorithms that can operate on tens of thousands of species in a reasonable amount of time through several innovative search techniques. Results When compared to popular phylogenetic search algorithms, better trees are found much more quickly for large data sets. These algorithms are incorporated in the PSODA application available at http://dna.cs.byu.edu/psoda Conclusions The use of Partial Tree Mixing in a partition based tree space allows the algorithm to quickly converge on near optimal tree regions. These regions can then be searched in a methodical way to determine the overall optimal phylogenetic solution. PMID:23320449
Smoothed analysis of binary search trees
Manthey, Bodo; Reischuk, Rüdiger
2007-01-01
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform distribution is only logarithmic. The exact value is one of the best studied problems in average-case complexity. We
An analysis of Monte Carlo tree search
CSIR Research Space (South Africa)
James, S
2017-02-01
Full Text Available Tree Search Steven James∗, George Konidaris† & Benjamin Rosman∗‡ ∗University of the Witwatersrand, Johannesburg, South Africa †Brown University, Providence RI 02912, USA ‡Council for Scientific and Industrial Research, Pretoria, South Africa steven....james@students.wits.ac.za, gdk@cs.brown.edu, brosman@csir.co.za Abstract Monte Carlo Tree Search (MCTS) is a family of directed search algorithms that has gained widespread attention in re- cent years. Despite the vast amount of research into MCTS, the effect of modifications...
A two-level parallel direct search implementation for arbitrarily sized objective functions
Energy Technology Data Exchange (ETDEWEB)
Hutchinson, S.A.; Shadid, N.; Moffat, H.K. [Sandia National Labs., Albuquerque, NM (United States)] [and others
1994-12-31
In the past, many optimization schemes for massively parallel computers have attempted to achieve parallel efficiency using one of two methods. In the case of large and expensive objective function calculations, the optimization itself may be run in serial and the objective function calculations parallelized. In contrast, if the objective function calculations are relatively inexpensive and can be performed on a single processor, then the actual optimization routine itself may be parallelized. In this paper, a scheme based upon the Parallel Direct Search (PDS) technique is presented which allows the objective function calculations to be done on an arbitrarily large number (p{sub 2}) of processors. If, p, the number of processors available, is greater than or equal to 2p{sub 2} then the optimization may be parallelized as well. This allows for efficient use of computational resources since the objective function calculations can be performed on the number of processors that allow for peak parallel efficiency and then further speedup may be achieved by parallelizing the optimization. Results are presented for an optimization problem which involves the solution of a PDE using a finite-element algorithm as part of the objective function calculation. The optimum number of processors for the finite-element calculations is less than p/2. Thus, the PDS method is also parallelized. Performance comparisons are given for a nCUBE 2 implementation.
Cache-Oblivious Search Trees via Binary Trees of Small Height
DEFF Research Database (Denmark)
Brodal, G.S.; Fagerberg, R.; Jacob, R.
2002-01-01
We propose a version of cache oblivious search trees which is simpler than the previous proposal of Bender, Demaine and Farach-Colton and has the same complexity bounds. In particular, our data structure avoids the use of weight balanced B-trees, and can be implemented as just a single array......, and range queries in worst case O(logB n + k/B) memory transfers, where k is the size of the output.The basic idea of our data structure is to maintain a dynamic binary tree of height log n+O(1) using existing methods, embed this tree in a static binary tree, which in turn is embedded in an array in a cache...... oblivious fashion, using the van Emde Boas layout of Prokop.We also investigate the practicality of cache obliviousness in the area of search trees, by providing an empirical comparison of different methods for laying out a search tree in memory....
Local search for Steiner tree problems in graphs
Verhoeven, M.G.A.; Severens, M.E.M.; Aarts, E.H.L.; Rayward-Smith, V.J.; Reeves, C.R.; Smith, G.D.
1996-01-01
We present a local search algorithm for the Steiner tree problem in graphs, which uses a neighbourhood in which paths in a steiner tree are exchanged. The exchange function of this neigbourhood is based on multiple-source shortest path algorithm. We present computational results for a known
Monte-Carlo Tree Search for Poly-Y
Wevers, L.; te Brinke, Steven
2014-01-01
Monte-Carlo tree search (MCTS) is a heuristic search algorithm that has recently been very successful in the games of Go and Hex. In this paper, we describe an MCTS player for the game of Poly-Y, which is a connection game similar to Hex. Our player won the CodeCup 2014 AI programming competition.
Efficient Tree Search in Encrypted Data
Brinkman, R.; Feng, L.; Doumen, J.M.; Hartel, P.H.; Jonker, W.
Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in an encrypted textual document. The search speed is linear in the size of the document. It does not scale well for a large
Understanding search trees via statistical physics
Indian Academy of Sciences (India)
the sequence changes, the corresponding tree changes and hence these observables ... While the leading log(N) behavior was proved by Devroye [4] who also ..... further useful to make a change of variables, t = log(N) and ϵi = − log(ri). The.
Search Trees with Relaxed Balance and Near-Optimal Height
DEFF Research Database (Denmark)
Fagerberg, Rolf; Jensen, Rune E.; Larsen, Kim Skak
2001-01-01
We introduce a relaxed k-tree, a search tree with relaxed balance and a height bound, when in balance, of (1+epsilon)log_2 n + 1, for any epsilon > 0. The number of nodes involved in rebalancing is O(1/epsilon) per update in the amortized sense, and O(log n/epsilon) in the worst case sense. This ...... constant rebalancing, which is an improvement over the current definition. World Wide Web search engines are possible applications for this line of work....
Searching Fragment Spaces with feature trees.
Lessel, Uta; Wellenzohn, Bernd; Lilienthal, Markus; Claussen, Holger
2009-02-01
Virtual combinatorial chemistry easily produces billions of compounds, for which conventional virtual screening cannot be performed even with the fastest methods available. An efficient solution for such a scenario is the generation of Fragment Spaces, which encode huge numbers of virtual compounds by their fragments/reagents and rules of how to combine them. Similarity-based searches can be performed in such spaces without ever fully enumerating all virtual products. Here we describe the generation of a huge Fragment Space encoding about 5 * 10(11) compounds based on established in-house synthesis protocols for combinatorial libraries, i.e., we encode practically evaluated combinatorial chemistry protocols in a machine readable form, rendering them accessible to in silico search methods. We show how such searches in this Fragment Space can be integrated as a first step in an overall workflow. It reduces the extremely huge number of virtual products by several orders of magnitude so that the resulting list of molecules becomes more manageable for further more elaborated and time-consuming analysis steps. Results of a case study are presented and discussed, which lead to some general conclusions for an efficient expansion of the chemical space to be screened in pharmaceutical companies.
Monte-Carlo Tree Search by Best Arm Identification
E. Kaufmann (Emilie); W.M. Koolen-Wijkstra (Wouter)
2017-01-01
textabstractRecent advances in bandit tools and techniques for sequential learning are steadily enabling new applications and are promising the resolution of a range of challenging related problems. We study the game tree search problem, where the goal is to quickly identify the optimal move in a
Monte-Carlo tree search by best arm identification
E. Kaufmann (Emilie); W.M. Koolen-Wijkstra (Wouter)
2017-01-01
textabstractRecent advances in bandit tools and techniques for sequential learning are steadily enabling new applications and are promising the resolution of a range of challenging related problems. We study the game tree search problem, where the goal is to quickly identify the optimal move in a
Optimal Finger Search Trees in the Pointer Machine
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Lagogiannis, George; Makris, Christos
2003-01-01
We develop a new finger search tree with worst-case constant update time in the Pointer Machine (PM) model of computation. This was a major problem in the field of Data Structures and was tantalizingly open for over twenty years while many attempts by researchers were made to solve it. The result...
MDTS: automatic complex materials design using Monte Carlo tree search
Dieb, Thaer M.; Ju, Shenghong; Yoshizoe, Kazuki; Hou, Zhufeng; Shiomi, Junichiro; Tsuda, Koji
2017-12-01
Complex materials design is often represented as a black-box combinatorial optimization problem. In this paper, we present a novel python library called MDTS (Materials Design using Tree Search). Our algorithm employs a Monte Carlo tree search approach, which has shown exceptional performance in computer Go game. Unlike evolutionary algorithms that require user intervention to set parameters appropriately, MDTS has no tuning parameters and works autonomously in various problems. In comparison to a Bayesian optimization package, our algorithm showed competitive search efficiency and superior scalability. We succeeded in designing large Silicon-Germanium (Si-Ge) alloy structures that Bayesian optimization could not deal with due to excessive computational cost. MDTS is available at https://github.com/tsudalab/MDTS.
USING PRECEDENTS FOR REDUCTION OF DECISION TREE BY GRAPH SEARCH
Directory of Open Access Journals (Sweden)
I. A. Bessmertny
2015-01-01
Full Text Available The paper considers the problem of mutual payment organization between business entities by means of clearing that is solved by search of graph paths. To reduce the decision tree complexity a method of precedents is proposed that consists in saving the intermediate solution during the moving along decision tree. An algorithm and example are presented demonstrating solution complexity coming close to a linear one. The tests carried out in civil aviation settlement system demonstrate approximately 30 percent shortage of real money transfer. The proposed algorithm is planned to be implemented also in other clearing organizations of the Russian Federation.
Monte-Carlo Tree Search for Simulated Car Racing
DEFF Research Database (Denmark)
Fischer, Jacob; Falsted, Nikolaj; Vielwerth, Mathias
2015-01-01
Monte Carlo Tree Search (MCTS) has recently seen considerable success in playing certain types of games, most of which are discrete, fully observable zero-sum games. Consequently there is currently considerable interest within the research community in investigating what other games this algorithm...... might play well, and how it can be modified to achieve this. In this paper, we investigate the application of MCTS to simulated car racing, in particular the open-source racing game TORCS. The presented approach is based on the development of an efficient forward model and the discretization...... of the action space. This combination allows the controller to effectively search the tree of potential future states. Results show that it is indeed possible to implement a competent MCTS-based racing controller. The controller generalizes to most road tracks as long as a warm-up period is provided....
Improving multivariate Horner schemes with Monte Carlo tree search
Kuipers, J.; Plaat, A.; Vermaseren, J. A. M.; van den Herik, H. J.
2013-11-01
Optimizing the cost of evaluating a polynomial is a classic problem in computer science. For polynomials in one variable, Horner's method provides a scheme for producing a computationally efficient form. For multivariate polynomials it is possible to generalize Horner's method, but this leaves freedom in the order of the variables. Traditionally, greedy schemes like most-occurring variable first are used. This simple textbook algorithm has given remarkably efficient results. Finding better algorithms has proved difficult. In trying to improve upon the greedy scheme we have implemented Monte Carlo tree search, a recent search method from the field of artificial intelligence. This results in better Horner schemes and reduces the cost of evaluating polynomials, sometimes by factors up to two.
Playing Multi-Action Adversarial Games: Online Evolutionary Planning versus Tree Search
Justesen, Niels; Mahlmann, Tobias; Risi, Sebastian; Togelius, Julian
2017-01-01
We address the problem of playing turn-based multi-action adversarial games, which include many strategy games with extremely high branching factors as players take multiple actions each turn. This leads to the breakdown of standard tree search methods, including Monte Carlo Tree Search (MCTS), as they become unable to reach a sufficient depth in the game tree. In this paper, we introduce Online Evolutionary Planning (OEP) to address this challenge, which searches for combinations of actions ...
RNA inverse folding using Monte Carlo tree search.
Yang, Xiufeng; Yoshizoe, Kazuki; Taneda, Akito; Tsuda, Koji
2017-11-06
Artificially synthesized RNA molecules provide important ways for creating a variety of novel functional molecules. State-of-the-art RNA inverse folding algorithms can design simple and short RNA sequences of specific GC content, that fold into the target RNA structure. However, their performance is not satisfactory in complicated cases. We present a new inverse folding algorithm called MCTS-RNA, which uses Monte Carlo tree search (MCTS), a technique that has shown exceptional performance in Computer Go recently, to represent and discover the essential part of the sequence space. To obtain high accuracy, initial sequences generated by MCTS are further improved by a series of local updates. Our algorithm has an ability to control the GC content precisely and can deal with pseudoknot structures. Using common benchmark datasets for evaluation, MCTS-RNA showed a lot of promise as a standard method of RNA inverse folding. MCTS-RNA is available at https://github.com/tsudalab/MCTS-RNA .
A best-first tree-searching approach for ML decoding in MIMO system
Shen, Chung-An; Eltawil, Ahmed M.; Mondal, Sudip; Salama, Khaled N.
2012-01-01
In MIMO communication systems maximum-likelihood (ML) decoding can be formulated as a tree-searching problem. This paper presents a tree-searching approach that combines the features of classical depth-first and breadth-first approaches to achieve
Virtual Network Embedding via Monte Carlo Tree Search.
Haeri, Soroush; Trajkovic, Ljiljana
2018-02-01
Network virtualization helps overcome shortcomings of the current Internet architecture. The virtualized network architecture enables coexistence of multiple virtual networks (VNs) on an existing physical infrastructure. VN embedding (VNE) problem, which deals with the embedding of VN components onto a physical network, is known to be -hard. In this paper, we propose two VNE algorithms: MaVEn-M and MaVEn-S. MaVEn-M employs the multicommodity flow algorithm for virtual link mapping while MaVEn-S uses the shortest-path algorithm. They formalize the virtual node mapping problem by using the Markov decision process (MDP) framework and devise action policies (node mappings) for the proposed MDP using the Monte Carlo tree search algorithm. Service providers may adjust the execution time of the MaVEn algorithms based on the traffic load of VN requests. The objective of the algorithms is to maximize the profit of infrastructure providers. We develop a discrete event VNE simulator to implement and evaluate performance of MaVEn-M, MaVEn-S, and several recently proposed VNE algorithms. We introduce profitability as a new performance metric that captures both acceptance and revenue to cost ratios. Simulation results show that the proposed algorithms find more profitable solutions than the existing algorithms. Given additional computation time, they further improve embedding solutions.
Playing Multi-Action Adversarial Games: Online Evolutionary Planning versus Tree Search
DEFF Research Database (Denmark)
Justesen, Niels; Mahlmann, Tobias; Risi, Sebastian
2017-01-01
We address the problem of playing turn-based multi-action adversarial games, which include many strategy games with extremely high branching factors as players take multiple actions each turn. This leads to the breakdown of standard tree search methods, including Monte Carlo Tree Search (MCTS......), as they become unable to reach a sufficient depth in the game tree. In this paper, we introduce Online Evolutionary Planning (OEP) to address this challenge, which searches for combinations of actions to perform during a single turn guided by a fitness function that evaluates the quality of a particular state....... We compare OEP to different MCTS variations that constrain the exploration to deal with the high branching factor in the turn-based multi-action game Hero Academy. While the constrained MCTS variations outperform the vanilla MCTS implementation by a large margin, OEP is able to search the space...
Dropout Rates and Response Times of an Occupation Search Tree in a Web Survey
Directory of Open Access Journals (Sweden)
Tijdens Kea
2014-03-01
Full Text Available Occupation is key in socioeconomic research. As in other survey modes, most web surveys use an open-ended question for occupation, though the absence of interviewers elicits unidentifiable or aggregated responses. Unlike other modes, web surveys can use a search tree with an occupation database. They are hardly ever used, but this may change due to technical advancements. This article evaluates a three-step search tree with 1,700 occupational titles, used in the 2010 multilingual WageIndicator web survey for UK, Belgium and Netherlands (22,990 observations. Dropout rates are high; in Step 1 due to unemployed respondents judging the question not to be adequate, and in Step 3 due to search tree item length. Median response times are substantial due to search tree item length, dropout in the next step and invalid occupations ticked. Overall the validity of the occupation data is rather good, 1.7-7.5% of the respondents completing the search tree have ticked an invalid occupation.
Goloboff, Pablo A
2014-10-01
Three different types of data sets, for which the uniquely most parsimonious tree can be known exactly but is hard to find with heuristic tree search methods, are studied. Tree searches are complicated more by the shape of the tree landscape (i.e. the distribution of homoplasy on different trees) than by the sheer abundance of homoplasy or character conflict. Data sets of Type 1 are those constructed by Radel et al. (2013). Data sets of Type 2 present a very rugged landscape, with narrow peaks and valleys, but relatively low amounts of homoplasy. For such a tree landscape, subjecting the trees to TBR and saving suboptimal trees produces much better results when the sequence of clipping for the tree branches is randomized instead of fixed. An unexpected finding for data sets of Types 1 and 2 is that starting a search from a random tree instead of a random addition sequence Wagner tree may increase the probability that the search finds the most parsimonious tree; a small artificial example where these probabilities can be calculated exactly is presented. Data sets of Type 3, the most difficult data sets studied here, comprise only congruent characters, and a single island with only one most parsimonious tree. Even if there is a single island, missing entries create a very flat landscape which is difficult to traverse with tree search algorithms because the number of equally parsimonious trees that need to be saved and swapped to effectively move around the plateaus is too large. Minor modifications of the parameters of tree drifting, ratchet, and sectorial searches allow travelling around these plateaus much more efficiently than saving and swapping large numbers of equally parsimonious trees with TBR. For these data sets, two new related criteria for selecting taxon addition sequences in Wagner trees (the "selected" and "informative" addition sequences) produce much better results than the standard random or closest addition sequences. These new methods for Wagner
Directory of Open Access Journals (Sweden)
Alexander Safatli
2015-06-01
Full Text Available Summary. Pylogeny is a cross-platform library for the Python programming language that provides an object-oriented application programming interface for phylogenetic heuristic searches. Its primary function is to permit both heuristic search and analysis of the phylogenetic tree search space, as well as to enable the design of novel algorithms to search this space. To this end, the framework supports the structural manipulation of phylogenetic trees, in particular using rearrangement operators such as NNI, SPR, and TBR, the scoring of trees using parsimony and likelihood methods, the construction of a tree search space graph, and the programmatic execution of a few existing heuristic programs. The library supports a range of common phylogenetic file formats and can be used for both nucleotide and protein data. Furthermore, it is also capable of supporting GPU likelihood calculation on nucleotide character data through the BEAGLE library.Availability. Existing development and source code is available for contribution and for download by the public from GitHub (http://github.com/AlexSafatli/Pylogeny. A stable release of this framework is available for download through PyPi (Python Package Index at http://pypi.python.org/pypi/pylogeny.
Directory of Open Access Journals (Sweden)
Jian Yang
2016-09-01
Full Text Available In this article, a tree search algorithm is proposed to find the near optimal conflict avoidance solutions for unmanned aerial vehicles. In the dynamic environment, the unmodeled elements, such as wind, would make UAVs deviate from nominal traces. It brings about difficulties for conflict detection and resolution. The back propagation neural networks are utilized to approximate the unmodeled dynamics of the environment. To satisfy the online planning requirement, the search length of the tree search algorithm would be limited. Therefore, the algorithm may not be able to reach the goal states in search process. The midterm reward function for assessing each node is devised, with consideration given to two factors, namely, the safe separation requirement and the mission of each unmanned aerial vehicle. The simulation examples and the comparisons with previous approaches are provided to illustrate the smooth and convincing behaviours of the proposed algorithm.
D Nearest Neighbour Search Using a Clustered Hierarchical Tree Structure
Suhaibah, A.; Uznir, U.; Anton, F.; Mioc, D.; Rahman, A. A.
2016-06-01
Locating and analysing the location of new stores or outlets is one of the common issues facing retailers and franchisers. This is due to assure that new opening stores are at their strategic location to attract the highest possible number of customers. Spatial information is used to manage, maintain and analyse these store locations. However, since the business of franchising and chain stores in urban areas runs within high rise multi-level buildings, a three-dimensional (3D) method is prominently required in order to locate and identify the surrounding information such as at which level of the franchise unit will be located or is the franchise unit located is at the best level for visibility purposes. One of the common used analyses used for retrieving the surrounding information is Nearest Neighbour (NN) analysis. It uses a point location and identifies the surrounding neighbours. However, with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our findings, the proposed approach substantially showed an improvement of response time analysis compared to existing approaches of spatial access methods in databases. The query performance was tested using a dataset consisting of 500,000 point locations building and franchising unit. The results are presented in this paper. Another advantage of this structure is that it also offers a minimal overlap and coverage among nodes which can reduce repetitive data entry.
A γ dose distribution evaluation technique using the k-d tree for nearest neighbor searching
International Nuclear Information System (INIS)
Yuan Jiankui; Chen Weimin
2010-01-01
Purpose: The authors propose an algorithm based on the k-d tree for nearest neighbor searching to improve the γ calculation time for 2D and 3D dose distributions. Methods: The γ calculation method has been widely used for comparisons of dose distributions in clinical treatment plans and quality assurances. By specifying the acceptable dose and distance-to-agreement criteria, the method provides quantitative measurement of the agreement between the reference and evaluation dose distributions. The γ value indicates the acceptability. In regions where γ≤1, the predefined criterion is satisfied and thus the agreement is acceptable; otherwise, the agreement fails. Although the concept of the method is not complicated and a quick naieve implementation is straightforward, an efficient and robust implementation is not trivial. Recent algorithms based on exhaustive searching within a maximum radius, the geometric Euclidean distance, and the table lookup method have been proposed to improve the computational time for multidimensional dose distributions. Motivated by the fact that the least searching time for finding a nearest neighbor can be an O(log N) operation with a k-d tree, where N is the total number of the dose points, the authors propose an algorithm based on the k-d tree for the γ evaluation in this work. Results: In the experiment, the authors found that the average k-d tree construction time per reference point is O(log N), while the nearest neighbor searching time per evaluation point is proportional to O(N 1/k ), where k is between 2 and 3 for two-dimensional and three-dimensional dose distributions, respectively. Conclusions: Comparing with other algorithms such as exhaustive search and sorted list O(N), the k-d tree algorithm for γ evaluation is much more efficient.
A Fast Framework for Abrupt Change Detection Based on Binary Search Trees and Kolmogorov Statistic
Qi, Jin-Peng; Qi, Jie; Zhang, Qing
2016-01-01
Change-Point (CP) detection has attracted considerable attention in the fields of data mining and statistics; it is very meaningful to discuss how to quickly and efficiently detect abrupt change from large-scale bioelectric signals. Currently, most of the existing methods, like Kolmogorov-Smirnov (KS) statistic and so forth, are time-consuming, especially for large-scale datasets. In this paper, we propose a fast framework for abrupt change detection based on binary search trees (BSTs) and a modified KS statistic, named BSTKS (binary search trees and Kolmogorov statistic). In this method, first, two binary search trees, termed as BSTcA and BSTcD, are constructed by multilevel Haar Wavelet Transform (HWT); second, three search criteria are introduced in terms of the statistic and variance fluctuations in the diagnosed time series; last, an optimal search path is detected from the root to leaf nodes of two BSTs. The studies on both the synthetic time series samples and the real electroencephalograph (EEG) recordings indicate that the proposed BSTKS can detect abrupt change more quickly and efficiently than KS, t-statistic (t), and Singular-Spectrum Analyses (SSA) methods, with the shortest computation time, the highest hit rate, the smallest error, and the highest accuracy out of four methods. This study suggests that the proposed BSTKS is very helpful for useful information inspection on all kinds of bioelectric time series signals. PMID:27413364
A Fast Framework for Abrupt Change Detection Based on Binary Search Trees and Kolmogorov Statistic.
Qi, Jin-Peng; Qi, Jie; Zhang, Qing
2016-01-01
Change-Point (CP) detection has attracted considerable attention in the fields of data mining and statistics; it is very meaningful to discuss how to quickly and efficiently detect abrupt change from large-scale bioelectric signals. Currently, most of the existing methods, like Kolmogorov-Smirnov (KS) statistic and so forth, are time-consuming, especially for large-scale datasets. In this paper, we propose a fast framework for abrupt change detection based on binary search trees (BSTs) and a modified KS statistic, named BSTKS (binary search trees and Kolmogorov statistic). In this method, first, two binary search trees, termed as BSTcA and BSTcD, are constructed by multilevel Haar Wavelet Transform (HWT); second, three search criteria are introduced in terms of the statistic and variance fluctuations in the diagnosed time series; last, an optimal search path is detected from the root to leaf nodes of two BSTs. The studies on both the synthetic time series samples and the real electroencephalograph (EEG) recordings indicate that the proposed BSTKS can detect abrupt change more quickly and efficiently than KS, t-statistic (t), and Singular-Spectrum Analyses (SSA) methods, with the shortest computation time, the highest hit rate, the smallest error, and the highest accuracy out of four methods. This study suggests that the proposed BSTKS is very helpful for useful information inspection on all kinds of bioelectric time series signals.
A best-first tree-searching approach for ML decoding in MIMO system
Shen, Chung-An
2012-07-28
In MIMO communication systems maximum-likelihood (ML) decoding can be formulated as a tree-searching problem. This paper presents a tree-searching approach that combines the features of classical depth-first and breadth-first approaches to achieve close to ML performance while minimizing the number of visited nodes. A detailed outline of the algorithm is given, including the required storage. The effects of storage size on BER performance and complexity in terms of search space are also studied. Our result demonstrates that with a proper choice of storage size the proposed method visits 40% fewer nodes than a sphere decoding algorithm at signal to noise ratio (SNR) = 20dB and by an order of magnitude at 0 dB SNR.
Tree decomposition based fast search of RNA structures including pseudoknots in genomes.
Song, Yinglei; Liu, Chunmei; Malmberg, Russell; Pan, Fangfang; Cai, Liming
2005-01-01
Searching genomes for RNA secondary structure with computational methods has become an important approach to the annotation of non-coding RNAs. However, due to the lack of efficient algorithms for accurate RNA structure-sequence alignment, computer programs capable of fast and effectively searching genomes for RNA secondary structures have not been available. In this paper, a novel RNA structure profiling model is introduced based on the notion of a conformational graph to specify the consensus structure of an RNA family. Tree decomposition yields a small tree width t for such conformation graphs (e.g., t = 2 for stem loops and only a slight increase for pseudo-knots). Within this modelling framework, the optimal alignment of a sequence to the structure model corresponds to finding a maximum valued isomorphic subgraph and consequently can be accomplished through dynamic programming on the tree decomposition of the conformational graph in time O(k(t)N(2)), where k is a small parameter; and N is the size of the projiled RNA structure. Experiments show that the application of the alignment algorithm to search in genomes yields the same search accuracy as methods based on a Covariance model with a significant reduction in computation time. In particular; very accurate searches of tmRNAs in bacteria genomes and of telomerase RNAs in yeast genomes can be accomplished in days, as opposed to months required by other methods. The tree decomposition based searching tool is free upon request and can be downloaded at our site h t t p ://w.uga.edu/RNA-informatics/software/index.php.
Mastering the game of Go with deep neural networks and tree search
Silver, David; Huang, Aja; Maddison, Chris J.; Guez, Arthur; Sifre, Laurent; van den Driessche, George; Schrittwieser, Julian; Antonoglou, Ioannis; Panneershelvam, Veda; Lanctot, Marc; Dieleman, Sander; Grewe, Dominik; Nham, John; Kalchbrenner, Nal; Sutskever, Ilya; Lillicrap, Timothy; Leach, Madeleine; Kavukcuoglu, Koray; Graepel, Thore; Hassabis, Demis
2016-01-01
The game of Go has long been viewed as the most challenging of classic games for artificial intelligence owing to its enormous search space and the difficulty of evaluating board positions and moves. Here we introduce a new approach to computer Go that uses ‘value networks’ to evaluate board positions and ‘policy networks’ to select moves. These deep neural networks are trained by a novel combination of supervised learning from human expert games, and reinforcement learning from games of self-play. Without any lookahead search, the neural networks play Go at the level of state-of-the-art Monte Carlo tree search programs that simulate thousands of random games of self-play. We also introduce a new search algorithm that combines Monte Carlo simulation with value and policy networks. Using this search algorithm, our program AlphaGo achieved a 99.8% winning rate against other Go programs, and defeated the human European Go champion by 5 games to 0. This is the first time that a computer program has defeated a human professional player in the full-sized game of Go, a feat previously thought to be at least a decade away.
Monte Carlo Tree Search for Continuous and Stochastic Sequential Decision Making Problems
International Nuclear Information System (INIS)
Couetoux, Adrien
2013-01-01
In this thesis, I studied sequential decision making problems, with a focus on the unit commitment problem. Traditionally solved by dynamic programming methods, this problem is still a challenge, due to its high dimension and to the sacrifices made on the accuracy of the model to apply state of the art methods. I investigated on the applicability of Monte Carlo Tree Search methods for this problem, and other problems that are single player, stochastic and continuous sequential decision making problems. In doing so, I obtained a consistent and anytime algorithm, that can easily be combined with existing strong heuristic solvers. (author)
A Hybrid Differential Evolution and Tree Search Algorithm for the Job Shop Scheduling Problem
Directory of Open Access Journals (Sweden)
Rui Zhang
2011-01-01
Full Text Available The job shop scheduling problem (JSSP is a notoriously difficult problem in combinatorial optimization. In terms of the objective function, most existing research has been focused on the makespan criterion. However, in contemporary manufacturing systems, due-date-related performances are more important because they are essential for maintaining a high service reputation. Therefore, in this study we aim at minimizing the total weighted tardiness in JSSP. Considering the high complexity, a hybrid differential evolution (DE algorithm is proposed for the problem. To enhance the overall search efficiency, a neighborhood property of the problem is discovered, and then a tree search procedure is designed and embedded into the DE framework. According to the extensive computational experiments, the proposed approach is efficient in solving the job shop scheduling problem with total weighted tardiness objective.
International Nuclear Information System (INIS)
Wang Jianyong; Wang Tianzhi; Zuiderweg, Erik R. P.; Crippen, Gordon M.
2005-01-01
Rapid analysis of protein structure, interaction, and dynamics requires fast and automated assignments of 3D protein backbone triple-resonance NMR spectra. We introduce a new depth-first ordered tree search method of automated assignment, CASA, which uses hand-edited peak-pick lists of a flexible number of triple resonance experiments. The computer program was tested on 13 artificially simulated peak lists for proteins up to 723 residues, as well as on the experimental data for four proteins. Under reasonable tolerances, it generated assignments that correspond to the ones reported in the literature within a few minutes of CPU time. The program was also tested on the proteins analyzed by other methods, with both simulated and experimental peaklists, and it could generate good assignments in all relevant cases. The robustness was further tested under various situations
Individua l tree identification in airborne LASER data BY inverse SEARCH window
Directory of Open Access Journals (Sweden)
Eric Bastos Gorgens
2015-03-01
Full Text Available The local maximum filtering performance is highly dependent of the window size definition. This paper proposes that the window size should be determined by an inverse relationship to the canopy height model, and test the hypothesis that a windowsize inversely proportional will have better performance than the window proportional to the canopy height model. The study area is located in the southeastern region of the State of British Columbia, Canada. The natural vegetation is the boreal type and is characterized by the dominance of two species Picea engelmannii Parry ex. Engelmann (Engelmann spruce and Abies lasiocarpa (Hook. Nutt. (sub-alpine fir. The relief is mountainous with altitudes ranging from 650-2400 meters. 62 plots with 256 square meters were measured in the field. The airborne LiDAR had discrete returns, 2 points per square meter density and small-footprint. The performance of the search windows was evaluated based on success percentage, absolute average error and also compared to the observed values of the field plots. The local maximum filter underestimated the number of trees per hectare for both window sizing methods. The use of the inverse proportional window size has resulted in superior results, particularly for regions with highest density of trees.
Al-Khaja, Nawal
2007-01-01
This is a thematic lesson plan for young learners about palm trees and the importance of taking care of them. The two part lesson teaches listening, reading and speaking skills. The lesson includes parts of a tree; the modal auxiliary, can; dialogues and a role play activity.
Optimal processing for gel electrophoresis images: Applying Monte Carlo Tree Search in GelApp.
Nguyen, Phi-Vu; Ghezal, Ali; Hsueh, Ya-Chih; Boudier, Thomas; Gan, Samuel Ken-En; Lee, Hwee Kuan
2016-08-01
In biomedical research, gel band size estimation in electrophoresis analysis is a routine process. To facilitate and automate this process, numerous software have been released, notably the GelApp mobile app. However, the band detection accuracy is limited due to a band detection algorithm that cannot adapt to the variations in input images. To address this, we used the Monte Carlo Tree Search with Upper Confidence Bound (MCTS-UCB) method to efficiently search for optimal image processing pipelines for the band detection task, thereby improving the segmentation algorithm. Incorporating this into GelApp, we report a significant enhancement of gel band detection accuracy by 55.9 ± 2.0% for protein polyacrylamide gels, and 35.9 ± 2.5% for DNA SYBR green agarose gels. This implementation is a proof-of-concept in demonstrating MCTS-UCB as a strategy to optimize general image segmentation. The improved version of GelApp-GelApp 2.0-is freely available on both Google Play Store (for Android platform), and Apple App Store (for iOS platform). © 2016 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Whelan, Simon
2007-10-01
Phylogenetic tree estimation plays a critical role in a wide variety of molecular studies, including molecular systematics, phylogenetics, and comparative genomics. Finding the optimal tree relating a set of sequences using score-based (optimality criterion) methods, such as maximum likelihood and maximum parsimony, may require all possible trees to be considered, which is not feasible even for modest numbers of sequences. In practice, trees are estimated using heuristics that represent a trade-off between topological accuracy and speed. I present a series of novel algorithms suitable for score-based phylogenetic tree reconstruction that demonstrably improve the accuracy of tree estimates while maintaining high computational speeds. The heuristics function by allowing the efficient exploration of large numbers of trees through novel hill-climbing and resampling strategies. These heuristics, and other computational approximations, are implemented for maximum likelihood estimation of trees in the program Leaphy, and its performance is compared to other popular phylogenetic programs. Trees are estimated from 4059 different protein alignments using a selection of phylogenetic programs and the likelihoods of the tree estimates are compared. Trees estimated using Leaphy are found to have equal to or better likelihoods than trees estimated using other phylogenetic programs in 4004 (98.6%) families and provide a unique best tree that no other program found in 1102 (27.1%) families. The improvement is particularly marked for larger families (80 to 100 sequences), where Leaphy finds a unique best tree in 81.7% of families.
Tree breeding for pest resistance for the next 50 years: the search for cross resistance?
Alvin D. Yanchuk
2012-01-01
Research activities aimed at developing resistance to pests (insect, pathogens, mammals) in forest trees can be documented back over 5 decades. While a substantial body of research has been published on resistances in forest trees, not much of this work has made its way into applied tree improvement programs. There are several reasons for this, e.g.: (i) a new...
Detection of Spam Email by Combining Harmony Search Algorithm and Decision Tree
Directory of Open Access Journals (Sweden)
M. Z. Gashti
2017-06-01
Full Text Available Spam emails is probable the main problem faced by most e-mail users. There are many features in spam email detection and some of these features have little effect on detection and cause skew detection and classification of spam email. Thus, Feature Selection (FS is one of the key topics in spam email detection systems. With choosing the important and effective features in classification, its performance can be optimized. Selector features has the task of finding a subset of features to improve the accuracy of its predictions. In this paper, a hybrid of Harmony Search Algorithm (HSA and decision tree is used for selecting the best features and classification. The obtained results on Spam-base dataset show that the rate of recognition accuracy in the proposed model is 95.25% which is high in comparison with models such as SVM, NB, J48 and MLP. Also, the accuracy of the proposed model on the datasets of Ling-spam and PU1 is high in comparison with models such as NB, SVM and LR.
Smoly, Ilan; Carmel, Amir; Shemer-Avni, Yonat; Yeger-Lotem, Esti; Ziv-Ukelson, Michal
2016-03-01
Network querying is a powerful approach to mine molecular interaction networks. Most state-of-the-art network querying tools either confine the search to a prespecified topology in the form of some template subnetwork, or do not specify any topological constraints at all. Another approach is grammar-based queries, which are more flexible and expressive as they allow for expressing the topology of the sought pattern according to some grammar-based logic. Previous grammar-based network querying tools were confined to the identification of paths. In this article, we extend the patterns identified by grammar-based query approaches from paths to trees. For this, we adopt a higher order query descriptor in the form of a regular tree grammar (RTG). We introduce a novel problem and propose an algorithm to search a given graph for the k highest scoring subgraphs matching a tree accepted by an RTG. Our algorithm is based on the combination of dynamic programming with color coding, and includes an extension of previous k-best parsing optimization approaches to avoid isomorphic trees in the output. We implement the new algorithm and exemplify its application to mining viral infection patterns within molecular interaction networks. Our code is available online.
Ruczyński, Ireneusz; Bartoń, Kamil A
2012-01-01
Sensory limitation plays an important role in the evolution of animal behaviour. Animals have to find objects of interest (e.g. food, shelters, predators). When sensory abilities are strongly limited, animals adjust their behaviour to maximize chances for success. Bats are nocturnal, live in complex environments, are capable of flight and must confront numerous perceptual challenges (e.g. limited sensory range, interfering clutter echoes). This makes them an excellent model for studying the role of compensating behaviours to decrease costs of finding resources. Cavity roosting bats are especially interesting because the availability of tree cavities is often limited, and their quality is vital for bats during the breeding season. From a bat's sensory point of view, cavities are difficult to detect and finding them requires time and energy. However, tree cavities are also long lasting, allowing information transfer among conspecifics. Here, we use a simple simulation model to explore the benefits of tree selection, memory and eavesdropping (compensation behaviours) to searches for tree cavities by bats with short and long perception range. Our model suggests that memory and correct discrimination of tree suitability are the basic strategies decreasing the cost of roost finding, whereas perceptual range plays a minor role in this process. Additionally, eavesdropping constitutes a buffer that reduces the costs of finding new resources (such as roosts), especially when they occur in low density. We conclude that natural selection may promote different strategies of roost finding in relation to habitat conditions and cognitive skills of animals.
Directory of Open Access Journals (Sweden)
Ireneusz Ruczyński
Full Text Available Sensory limitation plays an important role in the evolution of animal behaviour. Animals have to find objects of interest (e.g. food, shelters, predators. When sensory abilities are strongly limited, animals adjust their behaviour to maximize chances for success. Bats are nocturnal, live in complex environments, are capable of flight and must confront numerous perceptual challenges (e.g. limited sensory range, interfering clutter echoes. This makes them an excellent model for studying the role of compensating behaviours to decrease costs of finding resources. Cavity roosting bats are especially interesting because the availability of tree cavities is often limited, and their quality is vital for bats during the breeding season. From a bat's sensory point of view, cavities are difficult to detect and finding them requires time and energy. However, tree cavities are also long lasting, allowing information transfer among conspecifics. Here, we use a simple simulation model to explore the benefits of tree selection, memory and eavesdropping (compensation behaviours to searches for tree cavities by bats with short and long perception range. Our model suggests that memory and correct discrimination of tree suitability are the basic strategies decreasing the cost of roost finding, whereas perceptual range plays a minor role in this process. Additionally, eavesdropping constitutes a buffer that reduces the costs of finding new resources (such as roosts, especially when they occur in low density. We conclude that natural selection may promote different strategies of roost finding in relation to habitat conditions and cognitive skills of animals.
International Nuclear Information System (INIS)
Vilalta, R; Ocegueda-Hernandez, F; Valerio, R; Watts, G
2010-01-01
Decision tree learning constitutes a suitable approach to classification due to its ability to partition the variable space into regions of class-uniform events, while providing a structure amenable to interpretation, in contrast to other methods such as neural networks. But an inherent limitation of decision tree learning is the progressive lessening of the statistical support of the final classifier as clusters of single-class events are split on every partition, a problem known as the fragmentation problem. We describe a software system called DTFE, for Decision Tree Fragmentation Evaluator, that measures the degree of fragmentation caused by a decision tree learner on every event cluster. Clusters are found through a decomposition of the data using a technique known as Spectral Clustering. Each cluster is analyzed in terms of the number and type of partitions induced by the decision tree. Our domain of application lies on the search for single top quark production, a challenging problem due to large and similar backgrounds, low energetic signals, and low number of jets. The output of the machine-learning software tool consists of a series of statistics describing the degree of data fragmentation.
Ansel Adams's Eucalyptus Tree, Fort Ross: Nature, Photography, and the Search for California
Adam Arenson
2005-01-01
This article considers the image of California evoked in the unusual Ansel Adams photograph Eucalyptus Tree, Fort Ross, California (1969), a Polaroid Land image of the garrison fence and an aged eucalyptus tree. Considering the participation of Russian occupation, Australian cross-pollination, Carleton Watkins's early photographs of redwoods, automotive and tourist images in the creation of this distinctive California place, the article argues that to understand Ansel Adams's work, we must no...
Darboux transformation for two-level system
Energy Technology Data Exchange (ETDEWEB)
Bagrov, V.; Baldiotti, M.; Gitman, D.; Shamshutdinova, V. [Instituto de Fisica, Universidade de Sao Paulo, Caixa Postal 66318-CEP, 05315-970 Sao Paulo, S.P. (Brazil)
2005-06-01
We develop the Darboux procedure for the case of the two-level system. In particular, it is demonstrated that one can construct the Darboux intertwining operator that does not violate the specific structure of the equations of the two-level system, transforming only one real potential into another real potential. We apply the obtained Darboux transformation to known exact solutions of the two-level system. Thus, we find three classes of new solutions for the two-level system and the corresponding new potentials that allow such solutions. (Abstract Copyright [2005], Wiley Periodicals, Inc.)
AMS radiocarbon investigation of the African baobab: Searching for the oldest tree
Energy Technology Data Exchange (ETDEWEB)
Patrut, Adrian, E-mail: apatrut@gmail.com [Babes-Bolyai University, Department of Chemistry, Arany Janos 11, 400028 Cluj-Napoca (Romania); Reden, Karl F. von [Woods Hole Oceanographic Institution, Department of Geology and Geophysics, NOSAMS Facility, 360 Woods Hole Rd., Mailstop 8, Woods Hole, MA 02543 (United States); Mayne, Diana H. [Baobab Trust, P.O. Box 1566, Parklands 2121, Johannesburg (South Africa); Lowy, Daniel A. [FlexEl, LLC, 387 Technology Drive, College Park, MD 20742 (United States); Patrut, Roxana T. [Babes-Bolyai University, Department of Biology and Geology, Gh. Bilascu 44, 400015 Cluj-Napoca (Romania)
2013-01-15
The Glencoe baobab, a very large specimen from South Africa, split twice in 2009. Several wood samples were collected from the eastern cavity, from the outer part of the main section and also from the largest broken segment which was connected to this section. These wood samples were processed and investigated by AMS radiocarbon dating. The radiocarbon date of the oldest sample was found to be 1838 {+-} 21 BP, which corresponds to a calibrated age of 1835 {+-} 40 years. Thus, the Glencoe baobab becomes the oldest dated baobab and also the oldest angiosperm tree with accurate dating results. The distribution of dating results revealed that the Glencoe baobab is a multi-generation tree, with several standing or collapsed and partially fused stems, showing different ages.
Two-Level Semantics and Code Generation
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis
1988-01-01
A two-level denotational metalanguage that is suitable for defining the semantics of Pascal-like languages is presented. The two levels allow for an explicit distinction between computations taking place at compile-time and computations taking place at run-time. While this distinction is perhaps...... not absolutely necessary for describing the input-output semantics of programming languages, it is necessary when issues such as data flow analysis and code generation are considered. For an example stack-machine, the authors show how to generate code for the run-time computations and still perform the compile...
VLSI implementation of MIMO detection for 802.11n using a novel adaptive tree search algorithm
International Nuclear Information System (INIS)
Yao Heng; Jian Haifang; Zhou Liguo; Shi Yin
2013-01-01
A 4×4 64-QAM multiple-input multiple-output (MIMO) detector is presented for the application of an IEEE 802.11n wireless local area network. The detectoris the implementation of a novel adaptive tree search(ATS) algorithm, and multiple ATS cores need to be instantiated to achieve the wideband requirement in the 802.11n standard. Both the ATS algorithm and the architectural considerations are explained. The latency of the detector is 0.75 μs, and the detector has a gate count of 848 k with a total of 19 parallel ATS cores. Each ATS core runs at 67 MHz. Measurement results show that compared with the floating-point ATS algorithm, the fixed-point implementation achieves a loss of 0.9 dB at a BER of 10 −3 . (semiconductor integrated circuits)
Cha, Jongsub; Park, Kyungho; Kang, Joonhyuk; Park, Hyuncheol
In this letter, we propose two computationally efficient precoding algorithms that achieve near-ML performance for multiuser MIMO downlink. The proposed algorithms perform tree expansion after lattice reduction. The first full expansion is tried by selecting the first level node with a minimum metric, constituting a reference metric. To find an optimal sequence, they iteratively visit each node and terminate the expansion by comparing node metrics with the calculated reference metric. By doing this, they significantly reduce the number of undesirable node visit. Monte-Carlo simulations show that both proposed algorithms yield near-ML performance with considerable reduction in complexity compared with that of the conventional schemes such as sphere encoding.
Directory of Open Access Journals (Sweden)
Atif Shahzad
2016-02-01
Full Text Available A promising approach for an effective shop scheduling that synergizes the benefits of the combinatorial optimization, supervised learning and discrete-event simulation is presented. Though dispatching rules are in widely used by shop scheduling practitioners, only ordinary performance rules are known; hence, dynamic generation of dispatching rules is desired to make them more effective in changing shop conditions. Meta-heuristics are able to perform quite well and carry more knowledge of the problem domain, however at the cost of prohibitive computational effort in real-time. The primary purpose of this research lies in an offline extraction of this domain knowledge using decision trees to generate simple if-then rules that subsequently act as dispatching rules for scheduling in an online manner. We used similarity index to identify parametric and structural similarity in problem instances in order to implicitly support the learning algorithm for effective rule generation and quality index for relative ranking of the dispatching decisions. Maximum lateness is used as the scheduling objective in a job shop scheduling environment.
3D NEAREST NEIGHBOUR SEARCH USING A CLUSTERED HIERARCHICAL TREE STRUCTURE
Directory of Open Access Journals (Sweden)
A. Suhaibah
2016-06-01
Full Text Available Locating and analysing the location of new stores or outlets is one of the common issues facing retailers and franchisers. This is due to assure that new opening stores are at their strategic location to attract the highest possible number of customers. Spatial information is used to manage, maintain and analyse these store locations. However, since the business of franchising and chain stores in urban areas runs within high rise multi-level buildings, a three-dimensional (3D method is prominently required in order to locate and identify the surrounding information such as at which level of the franchise unit will be located or is the franchise unit located is at the best level for visibility purposes. One of the common used analyses used for retrieving the surrounding information is Nearest Neighbour (NN analysis. It uses a point location and identifies the surrounding neighbours. However, with the immense number of urban datasets, the retrieval and analysis of nearest neighbour information and their efficiency will become more complex and crucial. In this paper, we present a technique to retrieve nearest neighbour information in 3D space using a clustered hierarchical tree structure. Based on our findings, the proposed approach substantially showed an improvement of response time analysis compared to existing approaches of spatial access methods in databases. The query performance was tested using a dataset consisting of 500,000 point locations building and franchising unit. The results are presented in this paper. Another advantage of this structure is that it also offers a minimal overlap and coverage among nodes which can reduce repetitive data entry.
Schomaker, Lambertus; Mangalagiu, D.; Vuurpijl, Louis; Weinfeld, M.; Schomaker, Lambert; Vuurpijl, Louis
2000-01-01
This paper describes treebased classification of character images, comparing two methods of tree formation and two methods of matching: nearest neighbor and nearest centroid. The first method, Preprocess Using Relative Distances (PURD) is a treebased reorganization of a flat list of patterns,
A best-first soft/hard decision tree searching MIMO decoder for a 4 × 4 64-QAM system
Shen, Chungan
2012-08-01
This paper presents the algorithm and VLSI architecture of a configurable tree-searching approach that combines the features of classical depth-first and breadth-first methods. Based on this approach, techniques to reduce complexity while providing both hard and soft outputs decoding are presented. Furthermore, a single programmable parameter allows the user to tradeoff throughput versus BER performance. The proposed multiple-input-multiple-output decoder supports a 4 × 4 64-QAM system and was synthesized with 65-nm CMOS technology at 333 MHz clock frequency. For the hard output scheme the design can achieve an average throughput of 257.8 Mbps at 24 dB signal-to-noise ratio (SNR) with area equivalent to 54.2 Kgates and a power consumption of 7.26 mW. For the soft output scheme it achieves an average throughput of 83.3 Mbps across the SNR range of interest with an area equivalent to 64 Kgates and a power consumption of 11.5 mW. © 2011 IEEE.
A best-first soft/hard decision tree searching MIMO decoder for a 4 × 4 64-QAM system
Shen, Chungan; Eltawil, Ahmed M.; Salama, Khaled N.; Mondal, Sudip
2012-01-01
This paper presents the algorithm and VLSI architecture of a configurable tree-searching approach that combines the features of classical depth-first and breadth-first methods. Based on this approach, techniques to reduce complexity while providing both hard and soft outputs decoding are presented. Furthermore, a single programmable parameter allows the user to tradeoff throughput versus BER performance. The proposed multiple-input-multiple-output decoder supports a 4 × 4 64-QAM system and was synthesized with 65-nm CMOS technology at 333 MHz clock frequency. For the hard output scheme the design can achieve an average throughput of 257.8 Mbps at 24 dB signal-to-noise ratio (SNR) with area equivalent to 54.2 Kgates and a power consumption of 7.26 mW. For the soft output scheme it achieves an average throughput of 83.3 Mbps across the SNR range of interest with an area equivalent to 64 Kgates and a power consumption of 11.5 mW. © 2011 IEEE.
Directory of Open Access Journals (Sweden)
Robin Roj
2014-07-01
Full Text Available This paper presents three different search engines for the detection of CAD-parts in large databases. The analysis of the contained information is performed by the export of the data that is stored in the structure trees of the CAD-models. A preparation program generates one XML-file for every model, which in addition to including the data of the structure tree, also owns certain physical properties of each part. The first search engine is specializes in the discovery of standard parts, like screws or washers. The second program uses certain user input as search parameters, and therefore has the ability to perform personalized queries. The third one compares one given reference part with all parts in the database, and locates files that are identical, or similar to, the reference part. All approaches run automatically, and have the analysis of the structure tree in common. Files constructed with CATIA V5, and search engines written with Python have been used for the implementation. The paper also includes a short comparison of the advantages and disadvantages of each program, as well as a performance test.
Directory of Open Access Journals (Sweden)
Dongying Wu
Full Text Available BACKGROUND: Most of our knowledge about the ancient evolutionary history of organisms has been derived from data associated with specific known organisms (i.e., organisms that we can study directly such as plants, metazoans, and culturable microbes. Recently, however, a new source of data for such studies has arrived: DNA sequence data generated directly from environmental samples. Such metagenomic data has enormous potential in a variety of areas including, as we argue here, in studies of very early events in the evolution of gene families and of species. METHODOLOGY/PRINCIPAL FINDINGS: We designed and implemented new methods for analyzing metagenomic data and used them to search the Global Ocean Sampling (GOS expedition data set for novel lineages in three gene families commonly used in phylogenetic studies of known and unknown organisms: small subunit rRNA and the recA and rpoB superfamilies. Though the methods available could not accurately identify very deeply branched ss-rRNAs (largely due to difficulties in making robust sequence alignments for novel rRNA fragments, our analysis revealed the existence of multiple novel branches in the recA and rpoB gene families. Analysis of available sequence data likely from the same genomes as these novel recA and rpoB homologs was then used to further characterize the possible organismal source of the novel sequences. CONCLUSIONS/SIGNIFICANCE: Of the novel recA and rpoB homologs identified in the metagenomic data, some likely come from uncharacterized viruses while others may represent ancient paralogs not yet seen in any cultured organism. A third possibility is that some come from novel cellular lineages that are only distantly related to any organisms for which sequence data is currently available. If there exist any major, but so-far-undiscovered, deeply branching lineages in the tree of life, we suggest that methods such as those described herein currently offer the best way to search for them.
International Nuclear Information System (INIS)
Domingos, Marisa; Bulbovas, Patricia; Camargo, Carla Z.S.; Aguiar-Silva, Cristiane; Brandão, Solange E.; Dafré-Martinelli, Marcelle; Dias, Ana Paula L.; Engela, Marcela R.G.S.; Gagliano, Janayne; Moura, Barbara B.; Alves, Edenise S.; Rinaldi, Mirian C.S.; Gomes, Eduardo P.C.; Furlan, Claudia M.; Figueiredo, Ana Maria G.
2015-01-01
This study summarizes the first effort to search for bioindicator tree species and respective potential biomarkers for future assessment of potential mixed pollution effects on the highly diverse Atlantic Forest in SE-Brazil. Leaves of the three most abundant species inventoried in a phytosociological survey (Croton floribundus, Piptadenia gonoacantha and Astronium graveolens) were collected in four forest remnants during winter and summer (2012). Their potential bioindicator attributes were highlighted using a screening of morphological, chemical and biochemical markers. The leaf surface structure and/or epicuticular wax composition pointed the accumulator properties of C. floribundus and P. gonoacantha. C. floribundus is a candidate for assessing potential accumulation of Cu, Cd, Mn, Ni, S and Zn. P. gonoacantha is a candidate to monitor polycyclic aromatic hydrocarbons. Increased levels of secondary metabolites and decreased antioxidant capacity in leaves of A. graveolens may support its value as a bioindicator for oxidative pollutants by visible dark stipplings. - Highlights: • We searched for tree species from Atlantic Forest for future air pollution monitoring in Brazil. • Croton floribundus, Astronium graveolens and Piptadenia gonoacantha were possible bioindicators. • P. gonoachanta was a potential bioindicator of polycyclic aromatic hydrocarbons. • C. floribundus was a potential bioindicator of heavy metals and sulfur. • A. graveolens may be used for monitoring oxidative pollutants, due to its biochemical leaf traits. - Inherent characteristics of the most abundant native tree species were potential biomarkers for assessing pollution effects on the highly diverse Atlantic Forest in SE-Brazil
Directory of Open Access Journals (Sweden)
Sofie Demeyer
Full Text Available Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA, a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http://sourceforge.net/projects/isma/.
Demeyer, Sofie; Michoel, Tom; Fostier, Jan; Audenaert, Pieter; Pickavet, Mario; Demeester, Piet
2013-01-01
Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA), a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http://sourceforge.net/projects/isma/. PMID:23620730
Demeyer, Sofie; Michoel, Tom; Fostier, Jan; Audenaert, Pieter; Pickavet, Mario; Demeester, Piet
2013-01-01
Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA), a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are inve...
2015-05-01
decisions on the fly in an online retail environment. Tech. rep., Working Paper, Massachusetts Institute of Technology, Boston, MA. Arneson, Broderick , Ryan...Hayward, Philip Henderson. 2009. MoHex wins Hex tournament. International Computer Games Association Journal 32 114–116. Arneson, Broderick , Ryan B...Combina- torial Search. Enzenberger, Markus, Martin Muller, Broderick Arneson, Richard Segal. 2010. Fuego—an open-source framework for board games and
Buntine, Wray
1994-01-01
IND computer program introduces Bayesian and Markov/maximum-likelihood (MML) methods and more-sophisticated methods of searching in growing trees. Produces more-accurate class-probability estimates important in applications like diagnosis. Provides range of features and styles with convenience for casual user, fine-tuning for advanced user or for those interested in research. Consists of four basic kinds of routines: data-manipulation, tree-generation, tree-testing, and tree-display. Written in C language.
Moderation analysis using a two-level regression model.
Yuan, Ke-Hai; Cheng, Ying; Maxwell, Scott
2014-10-01
Moderation analysis is widely used in social and behavioral research. The most commonly used model for moderation analysis is moderated multiple regression (MMR) in which the explanatory variables of the regression model include product terms, and the model is typically estimated by least squares (LS). This paper argues for a two-level regression model in which the regression coefficients of a criterion variable on predictors are further regressed on moderator variables. An algorithm for estimating the parameters of the two-level model by normal-distribution-based maximum likelihood (NML) is developed. Formulas for the standard errors (SEs) of the parameter estimates are provided and studied. Results indicate that, when heteroscedasticity exists, NML with the two-level model gives more efficient and more accurate parameter estimates than the LS analysis of the MMR model. When error variances are homoscedastic, NML with the two-level model leads to essentially the same results as LS with the MMR model. Most importantly, the two-level regression model permits estimating the percentage of variance of each regression coefficient that is due to moderator variables. When applied to data from General Social Surveys 1991, NML with the two-level model identified a significant moderation effect of race on the regression of job prestige on years of education while LS with the MMR model did not. An R package is also developed and documented to facilitate the application of the two-level model.
Experimental Hamiltonian identification for controlled two-level systems
International Nuclear Information System (INIS)
Schirmer, S.G.; Kolli, A.; Oi, D.K.L.
2004-01-01
We present a strategy to empirically determine the internal and control Hamiltonians for an unknown two-level system (black box) subject to various (piecewise constant) control fields when direct readout by measurement is limited to a single, fixed observable
The geometric phase in two-level atomic systems
International Nuclear Information System (INIS)
Tian Mingzhen; Barber, Zeb W.; Fischer, Joe A.; Randall Babbitt, Wm.
2004-01-01
We report the observation of the geometric phase in a closed two-level atomic system using stimulated photon echoes. The two-level system studied consists of the two-electronic energy levels ( 3 H 4 and 3 H 6 ) of Tm 3+ doped in YAG crystal. When a two-level atom at an arbitrary superposition state is excited by a pair of specially designed laser pulses, the excited state component gains a relative phase with respect to the ground state component. We identified the phase shift to be of pure geometric nature. The dynamic phase associated to the driving Hamiltonian is unchanged. The experiment results of the phase change agree with the theory to the extent of the measurement limit
Two-level convolution formula for nuclear structure function
Ma, Boqiang
1990-05-01
A two-level convolution formula for the nuclear structure function is derived in considering the nucleus as a composite system of baryon-mesons which are also composite systems of quark-gluons again. The results show that the European Muon Colaboration effect can not be explained by the nuclear effects as nucleon Fermi motion and nuclear binding contributions.
Two-level convolution formula for nuclear structure function
International Nuclear Information System (INIS)
Ma Boqiang
1990-01-01
A two-level convolution formula for the nuclear structure function is derived in considering the nucleus as a composite system of baryon-mesons which are also composite systems of quark-gluons again. The results show that the European Muon Colaboration effect can not be explained by the nuclear effects as nucleon Fermi motion and nuclear binding contributions
Stationary states of two-level open quantum systems
International Nuclear Information System (INIS)
Gardas, Bartlomiej; Puchala, Zbigniew
2011-01-01
A problem of finding stationary states of open quantum systems is addressed. We focus our attention on a generic type of open system: a qubit coupled to its environment. We apply the theory of block operator matrices and find stationary states of two-level open quantum systems under certain conditions applied on both the qubit and the surrounding.
Memory Effects in the Two-Level Model for Glasses
Aquino, Gerardo; Allahverdyan, Armen; Nieuwenhuizen, Theo M.
2008-07-01
We study an ensemble of two-level systems interacting with a thermal bath. This is a well-known model for glasses. The origin of memory effects in this model is a quasistationary but nonequilibrium state of a single two-level system, which is realized due to a finite-rate cooling and slow thermally activated relaxation. We show that single-particle memory effects, such as negativity of the specific heat under reheating, vanish for a sufficiently disordered ensemble. In contrast, a disordered ensemble displays a collective memory effect [similar to the Kovacs effect], where nonequilibrium features of the ensemble are monitored via a macroscopic observable. An experimental realization of the effect can be used to further assess the consistency of the model.
Two-level method with coarse space size independent convergence
Energy Technology Data Exchange (ETDEWEB)
Vanek, P.; Brezina, M. [Univ. of Colorado, Denver, CO (United States); Tezaur, R.; Krizkova, J. [UWB, Plzen (Czech Republic)
1996-12-31
The basic disadvantage of the standard two-level method is the strong dependence of its convergence rate on the size of the coarse-level problem. In order to obtain the optimal convergence result, one is limited to using a coarse space which is only a few times smaller than the size of the fine-level one. Consequently, the asymptotic cost of the resulting method is the same as in the case of using a coarse-level solver for the original problem. Today`s two-level domain decomposition methods typically offer an improvement by yielding a rate of convergence which depends on the ratio of fine and coarse level only polylogarithmically. However, these methods require the use of local subdomain solvers for which straightforward application of iterative methods is problematic, while the usual application of direct solvers is expensive. We suggest a method diminishing significantly these difficulties.
Franson Interference Generated by a Two-Level System
Peiris, M.; Konthasinghe, K.; Muller, A.
2017-01-01
We report a Franson interferometry experiment based on correlated photon pairs generated via frequency-filtered scattered light from a near-resonantly driven two-level semiconductor quantum dot. In contrast to spontaneous parametric down-conversion and four-wave mixing, this approach can produce single pairs of correlated photons. We have measured a Franson visibility as high as 66%, which goes beyond the classical limit of 50% and approaches the limit of violation of Bell's inequalities (70.7%).
Mixing phases of unstable two-level systems
International Nuclear Information System (INIS)
Sokolov, V.V.; Brentano, P. von.
1993-01-01
An unstable two-level system decaying into an arbitrary number of channels is considered. It is shown that the mixing phases of the two overlapping resonances can be expressed in the terms of their partial widths and one additional universal mixing parameter. Some applications to a doublet of 2 + resonances in 8 Be and to the ρ-ω systems are considered. 18 refs
Ingestive Behaviour of Grazing Ewes Given Two Levels of Concentrate
African Journals Online (AJOL)
South African Journal of Animal Science. Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue · Archives · Journal Home > Vol 45, No 2 (2015) >. Log in or Register to get access to full text downloads.
Two-level systems driven by large-amplitude fields
Nori, F.; Ashhab, S.; Johansson, J. R.; Zagoskin, A. M.
2009-03-01
We analyze the dynamics of a two-level system subject to driving by large-amplitude external fields, focusing on the resonance properties in the case of driving around the region of avoided level crossing. In particular, we consider three main questions that characterize resonance dynamics: (1) the resonance condition, (2) the frequency of the resulting oscillations on resonance, and (3) the width of the resonance. We identify the regions of validity of different approximations. In a large region of the parameter space, we use a geometric picture in order to obtain both a simple understanding of the dynamics and quantitative results. The geometric approach is obtained by dividing the evolution into discrete time steps, with each time step described by either a phase shift on the basis states or a coherent mixing process corresponding to a Landau-Zener crossing. We compare the results of the geometric picture with those of a rotating wave approximation. We also comment briefly on the prospects of employing strong driving as a useful tool to manipulate two-level systems. S. Ashhab, J.R. Johansson, A.M. Zagoskin, F. Nori, Two-level systems driven by large-amplitude fields, Phys. Rev. A 75, 063414 (2007). S. Ashhab et al, unpublished.
Rectilinear Full Steiner Tree Generation
DEFF Research Database (Denmark)
Zachariasen, Martin
1999-01-01
The fastest exact algorithm (in practice) for the rectilinear Steiner tree problem in the plane uses a two-phase scheme: First, a small but sufficient set of full Steiner trees (FSTs) is generated and then a Steiner minimum tree is constructed from this set by using simple backtrack search, dynamic...
Perturbation Theory for Open Two-Level Nonlinear Quantum Systems
International Nuclear Information System (INIS)
Zhang Zhijie; Jiang Dongguang; Wang Wei
2011-01-01
Perturbation theory is an important tool in quantum mechanics. In this paper, we extend the traditional perturbation theory to open nonlinear two-level systems, treating decoherence parameter γ as a perturbation. By this virtue, we give a perturbative solution to the master equation, which describes a nonlinear open quantum system. The results show that for small decoherence rate γ, the ratio of the nonlinear rate C to the tunneling coefficient V (i.e., r = C/V) determines the validity of the perturbation theory. For small ratio r, the perturbation theory is valid, otherwise it yields wrong results. (general)
Modal intersection types, two-level languages, and staged synthesis
DEFF Research Database (Denmark)
Henglein, Fritz; Rehof, Jakob
2016-01-01
-linguistic framework for staged program synthesis, where metaprograms are automatically synthesized which, when executed, generate code in a target language. We survey the basic theory of staged synthesis and illustrate by example how a two-level language theory specialized from λ∩ ⎕ can be used to understand......A typed λ-calculus, λ∩ ⎕, is introduced, combining intersection types and modal types. We develop the metatheory of λ∩ ⎕, with particular emphasis on the theory of subtyping and distributivity of the modal and intersection type operators. We describe how a stratification of λ∩ ⎕ leads to a multi...... the process of staged synthesis....
Two-level schemes for the advection equation
Vabishchevich, Petr N.
2018-06-01
The advection equation is the basis for mathematical models of continuum mechanics. In the approximate solution of nonstationary problems it is necessary to inherit main properties of the conservatism and monotonicity of the solution. In this paper, the advection equation is written in the symmetric form, where the advection operator is the half-sum of advection operators in conservative (divergent) and non-conservative (characteristic) forms. The advection operator is skew-symmetric. Standard finite element approximations in space are used. The standard explicit two-level scheme for the advection equation is absolutely unstable. New conditionally stable regularized schemes are constructed, on the basis of the general theory of stability (well-posedness) of operator-difference schemes, the stability conditions of the explicit Lax-Wendroff scheme are established. Unconditionally stable and conservative schemes are implicit schemes of the second (Crank-Nicolson scheme) and fourth order. The conditionally stable implicit Lax-Wendroff scheme is constructed. The accuracy of the investigated explicit and implicit two-level schemes for an approximate solution of the advection equation is illustrated by the numerical results of a model two-dimensional problem.
Two-level systems driven by large-amplitude fields
International Nuclear Information System (INIS)
Ashhab, S.; Johansson, J. R.; Zagoskin, A. M.; Nori, Franco
2007-01-01
We analyze the dynamics of a two-level system subject to driving by large-amplitude external fields, focusing on the resonance properties in the case of driving around the region of avoided level crossing. In particular, we consider three main questions that characterize resonance dynamics: (1) the resonance condition (2) the frequency of the resulting oscillations on resonance, and (3) the width of the resonance. We identify the regions of validity of different approximations. In a large region of the parameter space, we use a geometric picture in order to obtain both a simple understanding of the dynamics and quantitative results. The geometric approach is obtained by dividing the evolution into discrete time steps, with each time step described by either a phase shift on the basis states or a coherent mixing process corresponding to a Landau-Zener crossing. We compare the results of the geometric picture with those of a rotating wave approximation. We also comment briefly on the prospects of employing strong driving as a useful tool to manipulate two-level systems
Energy Technology Data Exchange (ETDEWEB)
Pangilinan, Monica [Brown Univ., Providence, RI (United States)
2010-05-01
The top quark produced through the electroweak channel provides a direct measurement of the V_{tb} element in the CKM matrix which can be viewed as a transition rate of a top quark to a bottom quark. This production channel of top quark is also sensitive to different theories beyond the Standard Model such as heavy charged gauged bosons termed W'. This thesis measures the cross section of the electroweak produced top quark using a technique based on using the matrix elements of the processes under consideration. The technique is applied to 2.3 fb^{-1} of data from the D0 detector. From a comparison of the matrix element discriminants between data and the signal and background model using Bayesian statistics, we measure the cross section of the top quark produced through the electroweak mechanism σ(p$\\bar{p}$ → tb + X, tqb + X) = 4.30_{-1.20}^{+0.98} pb. The measured result corresponds to a 4.9σ Gaussian-equivalent significance. By combining this analysis with other analyses based on the Bayesian Neural Network (BNN) and Boosted Decision Tree (BDT) method, the measured cross section is 3.94 ± 0.88 pb with a significance of 5.0σ, resulting in the discovery of electroweak produced top quarks. Using this measured cross section and constraining |V_{tb}| < 1, the 95% confidence level (C.L.) lower limit is |V_{tb}| > 0.78. Additionally, a search is made for the production of W' using the same samples from the electroweak produced top quark. An analysis based on the BDT method is used to separate the signal from expected backgrounds. No significant excess is found and 95% C.L. upper limits on the production cross section are set for W' with masses within 600-950 GeV. For four general models of W{prime} boson production using decay channel W' → t$\\bar{p}$, the lower mass limits are the following: M(W'_{L} with SM couplings) > 840 GeV; M(W'_{R}) > 880 GeV or 890 GeV if the
Atomistic study of two-level systems in amorphous silica
Damart, T.; Rodney, D.
2018-01-01
Internal friction is analyzed in an atomic-scale model of amorphous silica. The potential energy landscape of more than 100 glasses is explored to identify a sample of about 700 two-level systems (TLSs). We discuss the properties of TLSs, particularly their energy asymmetry and barrier as well as their deformation potential, computed as longitudinal and transverse averages of the full deformation potential tensors. The discrete sampling is used to predict dissipation in the classical regime. Comparison with experimental data shows a better agreement with poorly relaxed thin films than well relaxed vitreous silica, as expected from the large quench rates used to produce numerical glasses. The TLSs are categorized in three types that are shown to affect dissipation in different temperature ranges. The sampling is also used to discuss critically the usual approximations employed in the literature to represent the statistical properties of TLSs.
Two-level modelling of real estate taxtation
DEFF Research Database (Denmark)
Gall, Jaroslav; Stubkjær, Erik
2006-01-01
Real estate taxes recurrently attract attention, because they are a source of potentially increased revenue for local and national government. Most experts agree that it is necessary to switch from using normative values for taxation to a market-value-based taxation of real property with computer......-assisted mass valuation, witch benefit from use of value maps. In Czech Republic, efforts have been made to adopt current tax policy goals, but improvements are still needed. The paper aims at supporting the current improvement process towards a market based system. It presents models, which describe aspects...... of the present Czech property tax system. A proposal for the future system focuses on the value map component. The described change depends on political involvement. This political activity is modelled as well. The hypothesis is that the two-level modelling effort enhances the change process by providing...
Two-level tunneling systems in amorphous alumina
Lebedeva, Irina V.; Paz, Alejandro P.; Tokatly, Ilya V.; Rubio, Angel
2014-03-01
The decades of research on thermal properties of amorphous solids at temperatures below 1 K suggest that their anomalous behaviour can be related to quantum mechanical tunneling of atoms between two nearly equivalent states that can be described as a two-level system (TLS). This theory is also supported by recent studies on microwave spectroscopy of superconducting qubits. However, the microscopic nature of the TLS remains unknown. To identify structural motifs for TLSs in amorphous alumina we have performed extensive classical molecular dynamics simulations. Several bistable motifs with only one or two atoms jumping by considerable distance ~ 0.5 Å were found at T=25 K. Accounting for the surrounding environment relaxation was shown to be important up to distances ~ 7 Å. The energy asymmetry and barrier for the detected motifs lied in the ranges 0.5 - 2 meV and 4 - 15 meV, respectively, while their density was about 1 motif per 10 000 atoms. Tuning of motif asymmetry by strain was demonstrated with the coupling coefficient below 1 eV. The tunnel splitting for the symmetrized motifs was estimated on the order of 0.1 meV. The discovered motifs are in good agreement with the available experimental data. The financial support from the Marie Curie Fellowship PIIF-GA-2012-326435 (RespSpatDisp) is gratefully acknowledged.
EDITORIAL Development Linkages between Tree Breeding ...
African Journals Online (AJOL)
EDITORIAL Development Linkages between Tree Breeding Programmes and National/Regional Tree Seed Centres in Africa. ... Discovery and Innovation. Journal Home · ABOUT THIS JOURNAL · Advanced Search · Current Issue · Archives.
Pixel detector readout electronics with two-level discriminator scheme
International Nuclear Information System (INIS)
Pengg, F.
1998-01-01
In preparation for a silicon pixel detector with more than 3,000 readout channels per chip for operation at the future large hadron collider (LHC) at CERN the analog front end of the readout electronics has been designed and measured on several test-arrays with 16 by 4 cells. They are implemented in the HP 0.8 microm process but compatible with the design rules of the radiation hard Honeywell 0.8 microm bulk process. Each cell contains bump bonding pad, preamplifier, discriminator and control logic for masking and testing within a layout area of only 50 microm by 140 microm. A new two-level discriminator scheme has been implemented to cope with the problems of time-walk and interpixel cross-coupling. The measured gain of the preamplifier is 900 mV for a minimum ionizing particle (MIP, about 24,000 e - for a 300 microm thick Si-detector) with a return to baseline within 750 ns for a 1 MIP input signal. The full readout chain (without detector) shows an equivalent noise charge to 60e - r.m.s. The time-walk, a function of the separation between the two threshold levels, is measured to be 22 ns at a separation of 1,500 e - , which is adequate for the 40 MHz beam-crossing frequency at the LHC. The interpixel cross-coupling, measured with a 40fF coupling capacitance, is less than 3%. A single cell consumes 35 microW at 3.5 V supply voltage
The transposition distance for phylogenetic trees
Rossello, Francesc; Valiente, Gabriel
2006-01-01
The search for similarity and dissimilarity measures on phylogenetic trees has been motivated by the computation of consensus trees, the search by similarity in phylogenetic databases, and the assessment of clustering results in bioinformatics. The transposition distance for fully resolved phylogenetic trees is a recent addition to the extensive collection of available metrics for comparing phylogenetic trees. In this paper, we generalize the transposition distance from fully resolved to arbi...
Human action analysis with randomized trees
Yu, Gang; Liu, Zicheng
2014-01-01
This book will provide a comprehensive overview on human action analysis with randomized trees. It will cover both the supervised random trees and the unsupervised random trees. When there are sufficient amount of labeled data available, supervised random trees provides a fast method for space-time interest point matching. When labeled data is minimal as in the case of example-based action search, unsupervised random trees is used to leverage the unlabelled data. We describe how the randomized trees can be used for action classification, action detection, action search, and action prediction.
Two-Level Evaluation on Sensor Interoperability of Features in Fingerprint Image Segmentation
Directory of Open Access Journals (Sweden)
Ya-Shuo Li
2012-03-01
Full Text Available Features used in fingerprint segmentation significantly affect the segmentation performance. Various features exhibit different discriminating abilities on fingerprint images derived from different sensors. One feature which has better discriminating ability on images derived from a certain sensor may not adapt to segment images derived from other sensors. This degrades the segmentation performance. This paper empirically analyzes the sensor interoperability problem of segmentation feature, which refers to the feature’s ability to adapt to the raw fingerprints captured by different sensors. To address this issue, this paper presents a two-level feature evaluation method, including the first level feature evaluation based on segmentation error rate and the second level feature evaluation based on decision tree. The proposed method is performed on a number of fingerprint databases which are obtained from various sensors. Experimental results show that the proposed method can effectively evaluate the sensor interoperability of features, and the features with good evaluation results acquire better segmentation accuracies of images originating from different sensors.
Rojas Huamani, Jairo Martin
2017-01-01
The main goal is to have a direct measurement of the Yukawa coupling of the Higgs boson to the top quark which is only possible in the production process → ttH + . In this analysis, final states with 2 same sign leptons (neutrinos not counted) have been used in order to estimate the expected significance of the ttH process. A study using Boosted Decision Trees was done using Monte Carlo simulation equivalent to a luminosity of 36.5 fb-1 at √s=13 TeV, characteristics of the years 2015 and 2016 of Run-2 at LHC. The focus of my summer student program was to investigate the performance of the BDT, mainly: To avoid building of a rigid and possible overtrained BTD (Boosted Decision Tree) in charge of identifying pp→ttH+X process by removing systematically the number of variables used in the analysis. Look the expected sensitivity’s dependence on different parameters that takes in account the BDT.
Aspects of insertion in random trees
Bagchi, Arunabha; Reingold, E.M.
1982-01-01
A method formulated by Yao and used by Brown has yielded bounds on the fraction of nodes with specified properties in trees bult by a sequence of random internal nodes in a random tree built by binary search and insertion, and show that in such a tree about bounds better than those now known. We
Improved Anonymity for Key-trees
Veugen, P.J.M.; Beye, M.
2013-01-01
Randomized hash-lock protocols for Radio Frequency IDentification (RFID) tags offer forward untraceability, but incur heavy search on the server. Key trees have been proposed as a way to reduce search times, but because partial keys in such trees are shared, key compromise affects several tags.
Indian Academy of Sciences (India)
Flowering Trees. Boswellia serrata Roxb. ex Colebr. (Indian Frankincense tree) of Burseraceae is a large-sized deciduous tree that is native to India. Bark is thin, greenish-ash-coloured that exfoliates into smooth papery flakes. Stem exudes pinkish resin ... Fruit is a three-valved capsule. A green gum-resin exudes from the ...
Indian Academy of Sciences (India)
IAS Admin
Flowering Trees. Ailanthus excelsa Roxb. (INDIAN TREE OF. HEAVEN) of Simaroubaceae is a lofty tree with large pinnately compound alternate leaves, which are ... inflorescences, unisexual and greenish-yellow. Fruits are winged, wings many-nerved. Wood is used in making match sticks. 1. Male flower; 2. Female flower.
Indian Academy of Sciences (India)
Flowering Trees. Gyrocarpus americanus Jacq. (Helicopter Tree) of Hernandiaceae is a moderate size deciduous tree that grows to about 12 m in height with a smooth, shining, greenish-white bark. The leaves are ovate, rarely irregularly ... flowers which are unpleasant smelling. Fruit is a woody nut with two long thin wings.
Indian Academy of Sciences (India)
More Details Fulltext PDF. Volume 8 Issue 8 August 2003 pp 112-112 Flowering Trees. Zizyphus jujuba Lam. of Rhamnaceae · More Details Fulltext PDF. Volume 8 Issue 9 September 2003 pp 97-97 Flowering Trees. Moringa oleifera · More Details Fulltext PDF. Volume 8 Issue 10 October 2003 pp 100-100 Flowering Trees.
Yu, Jeffrey Xu; Chang, Lijun
2009-01-01
It has become highly desirable to provide users with flexible ways to query/search information over databases as simple as keyword search like Google search. This book surveys the recent developments on keyword search over databases, and focuses on finding structural information among objects in a database using a set of keywords. Such structural information to be returned can be either trees or subgraphs representing how the objects, that contain the required keywords, are interconnected in a relational database or in an XML database. The structural keyword search is completely different from
Mathematical foundations of event trees
International Nuclear Information System (INIS)
Papazoglou, Ioannis A.
1998-01-01
A mathematical foundation from first principles of event trees is presented. The main objective of this formulation is to offer a formal basis for developing automated computer assisted construction techniques for event trees. The mathematical theory of event trees is based on the correspondence between the paths of the tree and the elements of the outcome space of a joint event. The concept of a basic cylinder set is introduced to describe joint event outcomes conditional on specific outcomes of basic events or unconditional on the outcome of basic events. The concept of outcome space partition is used to describe the minimum amount of information intended to be preserved by the event tree representation. These concepts form the basis for an algorithm for systematic search for and generation of the most compact (reduced) form of an event tree consistent with the minimum amount of information the tree should preserve. This mathematical foundation allows for the development of techniques for automated generation of event trees corresponding to joint events which are formally described through other types of graphical models. Such a technique has been developed for complex systems described by functional blocks and it is reported elsewhere. On the quantification issue of event trees, a formal definition of a probability space corresponding to the event tree outcomes is provided. Finally, a short discussion is offered on the relationship of the presented mathematical theory with the more general use of event trees in reliability analysis of dynamic systems
Tree compression with top trees
DEFF Research Database (Denmark)
Bille, Philip; Gørtz, Inge Li; Landau, Gad M.
2013-01-01
We introduce a new compression scheme for labeled trees based on top trees [3]. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast...
Tree compression with top trees
DEFF Research Database (Denmark)
Bille, Philip; Gørtz, Inge Li; Landau, Gad M.
2015-01-01
We introduce a new compression scheme for labeled trees based on top trees. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast...
DEFF Research Database (Denmark)
Sitchinava, Nodar; Zeh, Norbert
2012-01-01
We present the parallel buffer tree, a parallel external memory (PEM) data structure for batched search problems. This data structure is a non-trivial extension of Arge's sequential buffer tree to a private-cache multiprocessor environment and reduces the number of I/O operations by the number of...... in the optimal OhOf(psortN + K/PB) parallel I/O complexity, where K is the size of the output reported in the process and psortN is the parallel I/O complexity of sorting N elements using P processors....
... Blog Vision Awards Common Allergens Tree Nut Allergy Tree Nut Allergy Learn about tree nut allergy, how ... a Tree Nut Label card . Allergic Reactions to Tree Nuts Tree nuts can cause a severe and ...
DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony.
Wehe, André; Bansal, Mukul S; Burleigh, J Gordon; Eulenstein, Oliver
2008-07-01
DupTree is a new software program for inferring rooted species trees from collections of gene trees using the gene tree parsimony approach. The program implements a novel algorithm that significantly improves upon the run time of standard search heuristics for gene tree parsimony, and enables the first truly genome-scale phylogenetic analyses. In addition, DupTree allows users to examine alternate rootings and to weight the reconciliation costs for gene trees. DupTree is an open source project written in C++. DupTree for Mac OS X, Windows, and Linux along with a sample dataset and an on-line manual are available at http://genome.cs.iastate.edu/CBL/DupTree
Indian Academy of Sciences (India)
medium-sized handsome tree with a straight bole that branches at the top. Leaves are once pinnate, with two to three pairs of leaflets. Young parts of the tree are velvety. Inflorescence is a branched raceme borne at the branch ends. Flowers are large, white, attractive, and fragrant. Corolla is funnel-shaped. Fruit is an ...
Indian Academy of Sciences (India)
Cassia siamia Lamk. (Siamese tree senna) of Caesalpiniaceae is a small or medium size handsome tree. Leaves are alternate, pinnately compound and glandular, upto 18 cm long with 8–12 pairs of leaflets. Inflorescence is axillary or terminal and branched. Flowering lasts for a long period from March to February. Fruit is ...
Indian Academy of Sciences (India)
Flowering Trees. Cerbera manghasL. (SEA MANGO) of Apocynaceae is a medium-sized evergreen coastal tree with milky latex. The bark is grey-brown, thick and ... Fruit is large. (5–10 cm long), oval containing two flattened seeds and resembles a mango, hence the name Mangas or. Manghas. Leaves and fruits contain ...
Indian Academy of Sciences (India)
user
Flowering Trees. Gliricidia sepium(Jacq.) Kunta ex Walp. (Quickstick) of Fabaceae is a small deciduous tree with. Pinnately compound leaves. Flower are prroduced in large number in early summer on terminal racemes. They are attractive, pinkish-white and typically like bean flowers. Fruit is a few-seeded flat pod.
Indian Academy of Sciences (India)
Flowering Trees. Acrocarpus fraxinifolius Wight & Arn. (PINK CEDAR, AUSTRALIAN ASH) of. Caesalpiniaceae is a lofty unarmed deciduous native tree that attains a height of 30–60m with buttresses. Bark is thin and light grey. Leaves are compound and bright red when young. Flowers in dense, erect, axillary racemes.
Tolman, Marvin
2005-01-01
Students love outdoor activities and will love them even more when they build confidence in their tree identification and measurement skills. Through these activities, students will learn to identify the major characteristics of trees and discover how the pace--a nonstandard measuring unit--can be used to estimate not only distances but also the…
DEFF Research Database (Denmark)
Halkjær From, Andreas; Schlichtkrull, Anders; Villadsen, Jørgen
2018-01-01
We formally prove in Isabelle/HOL two properties of an algorithm for laying out trees visually. The first property states that removing layout annotations recovers the original tree. The second property states that nodes are placed at least a unit of distance apart. We have yet to formalize three...
Indian Academy of Sciences (India)
Srimath
Grevillea robusta A. Cunn. ex R. Br. (Sil- ver Oak) of Proteaceae is a daintily lacy ornamental tree while young and growing into a mighty tree (45 m). Young shoots are silvery grey and the leaves are fern- like. Flowers are golden-yellow in one- sided racemes (10 cm). Fruit is a boat- shaped, woody follicle.
Two levels decision system for efficient planning and implementation of bioenergy production
International Nuclear Information System (INIS)
Ayoub, Nasser; Martins, Ricardo; Wang, Kefeng; Seki, Hiroya; Naka, Yuji
2007-01-01
When planning bioenergy production from biomass, planners should take into account each and every stakeholder along the biomass supply chains, e.g. biomass resources suppliers, transportation, conversion and electricity suppliers. Also, the planners have to consider social concerns, environmental and economical impacts related with establishing the biomass systems and the specific difficulties of each country. To overcome these problems in a sustainable manner, a robust decision support system is required. For that purpose, a two levels general Bioenergy Decision System (gBEDS) for bioenergy production planning and implementation was developed. The core part of the gBEDS is the information base, which includes the basic bioenergy information and the detailed decision information. Basic bioenergy information include, for instance, the geographical information system (GIS) database, the biomass materials' database, the biomass logistic database and the biomass conversion database. The detailed decision information considers the parameters' values database with their default values and the variables database, values obtained by simulation and optimization. It also includes a scenario database, which is used for demonstration to new users and also for case based reasoning by planners and executers. Based on the information base, the following modules are included to support decision making: the simulation module with graph interface based on the unit process (UP) definition and the genetic algorithms (GAs) methods for optimal decisions and the Matlab module for applying data mining methods (fuzzy C-means clustering and decision trees) to the biomass collection points, to define the location of storage and bioenergy conversion plants based on the simulation and optimization model developed of the whole life cycle of bioenergy generation. Furthermore, Matlab is used to set up a calculation model with crucial biomass planning parameters (e.g. costs, CO 2 emissions), over
Baños, Hector; Bushek, Nathaniel; Davidson, Ruth; Gross, Elizabeth; Harris, Pamela E.; Krone, Robert; Long, Colby; Stewart, Allen; Walker, Robert
2016-01-01
We introduce the package PhylogeneticTrees for Macaulay2 which allows users to compute phylogenetic invariants for group-based tree models. We provide some background information on phylogenetic algebraic geometry and show how the package PhylogeneticTrees can be used to calculate a generating set for a phylogenetic ideal as well as a lower bound for its dimension. Finally, we show how methods within the package can be used to compute a generating set for the join of any two ideals.
Two-step values for games with two-level communication structure
Béal, Silvain; Khmelnitskaya, Anna Borisovna; Solal, Philippe
TU games with two-level communication structure, in which a two-level communication structure relates fundamentally to the given coalition structure and consists of a communication graph on the collection of the a priori unions in the coalition structure, as well as a collection of communication
Using tree diversity to compare phylogenetic heuristics.
Sul, Seung-Jin; Matthews, Suzanne; Williams, Tiffani L
2009-04-29
Evolutionary trees are family trees that represent the relationships between a group of organisms. Phylogenetic heuristics are used to search stochastically for the best-scoring trees in tree space. Given that better tree scores are believed to be better approximations of the true phylogeny, traditional evaluation techniques have used tree scores to determine the heuristics that find the best scores in the fastest time. We develop new techniques to evaluate phylogenetic heuristics based on both tree scores and topologies to compare Pauprat and Rec-I-DCM3, two popular Maximum Parsimony search algorithms. Our results show that although Pauprat and Rec-I-DCM3 find the trees with the same best scores, topologically these trees are quite different. Furthermore, the Rec-I-DCM3 trees cluster distinctly from the Pauprat trees. In addition to our heatmap visualizations of using parsimony scores and the Robinson-Foulds distance to compare best-scoring trees found by the two heuristics, we also develop entropy-based methods to show the diversity of the trees found. Overall, Pauprat identifies more diverse trees than Rec-I-DCM3. Overall, our work shows that there is value to comparing heuristics beyond the parsimony scores that they find. Pauprat is a slower heuristic than Rec-I-DCM3. However, our work shows that there is tremendous value in using Pauprat to reconstruct trees-especially since it finds identical scoring but topologically distinct trees. Hence, instead of discounting Pauprat, effort should go in improving its implementation. Ultimately, improved performance measures lead to better phylogenetic heuristics and will result in better approximations of the true evolutionary history of the organisms of interest.
DEFF Research Database (Denmark)
Appelt, Ane L; Rønde, Heidi S
2013-01-01
The photo shows a close-up of a Lichtenberg figure – popularly called an “electron tree” – produced in a cylinder of polymethyl methacrylate (PMMA). Electron trees are created by irradiating a suitable insulating material, in this case PMMA, with an intense high energy electron beam. Upon discharge......, during dielectric breakdown in the material, the electrons generate branching chains of fractures on leaving the PMMA, producing the tree pattern seen. To be able to create electron trees with a clinical linear accelerator, one needs to access the primary electron beam used for photon treatments. We...... appropriated a linac that was being decommissioned in our department and dismantled the head to circumvent the target and ion chambers. This is one of 24 electron trees produced before we had to stop the fun and allow the rest of the accelerator to be disassembled....
Indian Academy of Sciences (India)
Srimath
shaped corolla. Fruit is large, ellipsoidal, green with a hard and smooth shell containing numerous flattened seeds, which are embedded in fleshy pulp. Calabash tree is commonly grown in the tropical gardens of the world as a botanical oddity.
Two level undercut-profile substrate for filamentary YBa2Cu3O7 coated conductors
DEFF Research Database (Denmark)
Wulff, Anders Christian; Solovyov, M.; Gömöry, Fedor
2015-01-01
A novel substrate design is presented for scalable industrial production of filamentary coated conductors (CCs). The new substrate, called ‘two level undercut-profile substrate (2LUPS)’, has two levels of plateaus connected by walls with an undercut profile. The undercuts are made to produce...... a shading effect during subsequent deposition of layers, thereby creating gaps in the superconducting layer deposited on the curved walls between the two levels. It is demonstrated that such 2LUPS-based CCs can be produced in a large-scale production system using standard deposition processes...
Compressed Data Structures for Range Searching
DEFF Research Database (Denmark)
Bille, Philip; Gørtz, Inge Li; Vind, Søren Juhl
2015-01-01
matrices and web graphs. Our contribution is twofold. First, we show how to compress geometric repetitions that may appear in standard range searching data structures (such as K-D trees, Quad trees, Range trees, R-trees, Priority R-trees, and K-D-B trees), and how to implement subsequent range queries...... on the compressed representation with only a constant factor overhead. Secondly, we present a compression scheme that efficiently identifies geometric repetitions in point sets, and produces a hierarchical clustering of the point sets, which combined with the first result leads to a compressed representation...
Directory of Open Access Journals (Sweden)
Burak Omer Saracoglu
2016-03-01
Full Text Available Purpose: The electricity demand in Turkey has been increasing for a while. Hydropower is one of the major electricity generation types to compensate this electricity demand in Turkey. Private investors (domestic and foreign in the hydropower electricity generation sector have been looking for the most appropriate and satisfactory new private hydropower investment (PHPI options and opportunities in Turkey. This study aims to present a qualitative multi-attribute decision making (MADM model, that is easy, straightforward, and fast for the selection of the most satisfactory reasonable PHPI options during the very early investment stages (data and information poorness on projects. Design/methodology/approach: The data and information of the PHPI options was gathered from the official records on the official websites. A wide and deep literature review was conducted for the MADM models and for the hydropower industry. The attributes of the model were identified, selected, clustered and evaluated by the expert decision maker (EDM opinion and by help of an open source search results clustering engine (Carrot2 (helpful for also comprehension. The PHPI options were clustered according to their installed capacities main property to analyze the options in the most appropriate, decidable, informative, understandable and meaningful way. A simple clustering algorithm for the PHPI options was executed in the current study. A template model for the selection of the most satisfactory PHPI options was built in the DEXi (Decision EXpert for Education and the DEXiTree software. Findings: The basic attributes for the selection of the PHPI options were presented and afterwards the aggregate attributes were defined by the bottom-up structuring for the early investment stages. The attributes were also analyzed by help of Carrot2. The most satisfactory PHPI options in Turkey in the big options data set were selected for each PHPI options cluster by the EDM evaluations in
Dynamical properties of a two-level system with arbitrary nonlinearities
Indian Academy of Sciences (India)
nication, information processing and quantum computing, such as in the investigation of quantum teleportation ... They con- sidered a two-level atom interacting with an undamped cavity initially in a coherent state. ... Because concurrence pro-.
Suhartono, Lee, Muhammad Hisyam; Prastyo, Dedy Dwi
2015-12-01
The aim of this research is to develop a calendar variation model for forecasting retail sales data with the Eid ul-Fitr effect. The proposed model is based on two methods, namely two levels ARIMAX and regression methods. Two levels ARIMAX and regression models are built by using ARIMAX for the first level and regression for the second level. Monthly men's jeans and women's trousers sales in a retail company for the period January 2002 to September 2009 are used as case study. In general, two levels of calendar variation model yields two models, namely the first model to reconstruct the sales pattern that already occurred, and the second model to forecast the effect of increasing sales due to Eid ul-Fitr that affected sales at the same and the previous months. The results show that the proposed two level calendar variation model based on ARIMAX and regression methods yields better forecast compared to the seasonal ARIMA model and Neural Networks.
Efficiency analysis on a two-level three-phase quasi-soft-switching inverter
DEFF Research Database (Denmark)
Geng, Pan; Wu, Weimin; Huang, Min
2013-01-01
When designing an inverter, an engineer often needs to select and predict the efficiency beforehand. For the standard inverters, plenty of researches are analyzing the power losses and also many software tools are being used for efficiency calculation. In this paper, the efficiency calculation...... for non-conventional inverters with special shoot-through state is introduced and illustrated through the analysis on a special two-level three-phase quasi-soft-switching inverter. Efficiency comparison between the classical two-stage two-level three-phase inverter and the two-level three-phase quasi......-soft-switching inverter is carried out. A 10 kW/380 V prototype is constructed to verify the analysis. The experimental results show that the efficiency of the new inverter is higher than that of the traditional two-stage two- level three-phase inverter....
Directory of Open Access Journals (Sweden)
Eman M Dokla
Full Text Available This study provides a comprehensive computational procedure for the discovery of novel urea-based antineoplastic kinase inhibitors while focusing on diversification of both chemotype and selectivity pattern. It presents a systematic structural analysis of the different binding motifs of urea-based kinase inhibitors and the corresponding configurations of the kinase enzymes. The computational model depends on simultaneous application of two protocols. The first protocol applies multiple consecutive validated virtual screening filters including SMARTS, support vector-machine model (ROC = 0.98, Bayesian model (ROC = 0.86 and structure-based pharmacophore filters based on urea-based kinase inhibitors complexes retrieved from literature. This is followed by hits profiling against different extended electron distribution (XED based field templates representing different kinase targets. The second protocol enables cancericidal activity verification by using the algorithm of feature trees (Ftrees similarity searching against NCI database. Being a proof-of-concept study, this combined procedure was experimentally validated by its utilization in developing a novel series of urea-based derivatives of strong anticancer activity. This new series is based on 3-benzylbenzo[d]thiazol-2(3H-one scaffold which has interesting chemical feasibility and wide diversification capability. Antineoplastic activity of this series was assayed in vitro against NCI 60 tumor-cell lines showing very strong inhibition of GI(50 as low as 0.9 uM. Additionally, its mechanism was unleashed using KINEX™ protein kinase microarray-based small molecule inhibitor profiling platform and cell cycle analysis showing a peculiar selectivity pattern against Zap70, c-src, Mink1, csk and MeKK2 kinases. Interestingly, it showed activity on syk kinase confirming the recent studies finding of the high activity of diphenyl urea containing compounds against this kinase. Allover, the new series
Energy Technology Data Exchange (ETDEWEB)
Saracoglu, B.O.
2016-07-01
The electricity demand in Turkey has been increasing for a while. Hydropower is one of the major electricity generation types to compensate this electricity demand in Turkey. Private investors (domestic and foreign) in the hydropower electricity generation sector have been looking for the most appropriate and satisfactory new private hydropower investment (PHPI) options and opportunities in Turkey. This study aims to present a qualitative multi-attribute decision making (MADM) model, that is easy, straightforward, and fast for the selection of the most satisfactory reasonable PHPI options during the very early investment stages (data and information poorness on projects). The data and information of the PHPI options was gathered from the official records on the official websites. A wide and deep literature review was conducted for the MADM models and for the hydropower industry. The attributes of the model were identified, selected, clustered and evaluated by the expert decision maker (EDM) opinion and by help of an open source search results clustering engine (Carrot2) (helpful for also comprehension). The PHPI options were clustered according to their installed capacities main property to analyze the options in the most appropriate, decidable, informative, understandable and meaningful way. A simple clustering algorithm for the PHPI options was executed in the current study. A template model for the selection of the most satisfactory PHPI options was built in the DEXi (Decision EXpert for Education) and the DEXiTree software. The basic attributes for the selection of the PHPI options were presented and afterwards the aggregate attributes were defined by the bottom-up structuring for the early investment stages. The attributes were also analyzed by help of Carrot2. The most satisfactory PHPI options in Turkey in the big options data set were selected for each PHPI options cluster by the EDM evaluations in the DEXi. (Author)
Eucalyptus as a landscape tree
W. Douglas Hamilton
1983-01-01
Ninety-two species of Eucalyptus were evaluated at the University of California re- search station in San Jose. The purpose: to find acceptable new street and park trees. Growth rates and horticultural characteristics were noted. Forty-three species were studied in locations statewide to evaluate site adaptation and landscape usefulness; flooded, cold, dry, saline....
Controlling the optical bistability and multistability in a two-level pumped-probe system
International Nuclear Information System (INIS)
Mahmoudi, Mohammad; Sahrai, Mostafa; Masoumeh Mousavi, Seyede
2010-01-01
We study the behavior of the optical bistability (OB) and multistability (OM) in a two-level pumped-probe atomic system by means of a unidirectional ring cavity. We show that the optical bistability in a two-level atomic system can be controlled by adjusting the intensity of the pump field and the detuning between two fields. We find that applying the pumping field decreases the threshold of the optical bistability.
Excitation transfer in two two-level systems coupled to an oscillator
International Nuclear Information System (INIS)
Hagelstein, P L; Chaudhary, I U
2008-01-01
We consider a generalization of the spin-boson model in which two different two-level systems are coupled to an oscillator, under conditions where the oscillator energy is much less than the two-level system energies, and where the oscillator is highly excited. We find that the two-level system transition energy is shifted, producing a Bloch-Siegert shift in each two-level system similar to what would be obtained if the other were absent. At resonances associated with energy exchange between a two-level system and the oscillator, the level splitting is about the same as would be obtained in the spin-boson model at a Bloch-Siegert resonance. However, there occur resonances associated with the transfer of excitation between one two-level system and the other, an effect not present in the spin-boson model. We use a unitary transformation leading to a rotated system in which terms responsible for the shift and splittings can be identified. The level splittings at the anticrossings associated with both energy exchange and excitation transfer resonances are accounted for with simple two-state models and degenerate perturbation theory using operators that appear in the rotated Hamiltonian
The stopping rules for winsorized tree
Ch'ng, Chee Keong; Mahat, Nor Idayu
2017-11-01
Winsorized tree is a modified tree-based classifier that is able to investigate and to handle all outliers in all nodes along the process of constructing the tree. It overcomes the tedious process of constructing a classical tree where the splitting of branches and pruning go concurrently so that the constructed tree would not grow bushy. This mechanism is controlled by the proposed algorithm. In winsorized tree, data are screened for identifying outlier. If outlier is detected, the value is neutralized using winsorize approach. Both outlier identification and value neutralization are executed recursively in every node until predetermined stopping criterion is met. The aim of this paper is to search for significant stopping criterion to stop the tree from further splitting before overfitting. The result obtained from the conducted experiment on pima indian dataset proved that the node could produce the final successor nodes (leaves) when it has achieved the range of 70% in information gain.
Towards improving searches for optimal phylogenies.
Ford, Eric; St John, Katherine; Wheeler, Ward C
2015-01-01
Finding the optimal evolutionary history for a set of taxa is a challenging computational problem, even when restricting possible solutions to be "tree-like" and focusing on the maximum-parsimony optimality criterion. This has led to much work on using heuristic tree searches to find approximate solutions. We present an approach for finding exact optimal solutions that employs and complements the current heuristic methods for finding optimal trees. Given a set of taxa and a set of aligned sequences of characters, there may be subsets of characters that are compatible, and for each such subset there is an associated (possibly partially resolved) phylogeny with edges corresponding to each character state change. These perfect phylogenies serve as anchor trees for our constrained search space. We show that, for sequences with compatible sites, the parsimony score of any tree [Formula: see text] is at least the parsimony score of the anchor trees plus the number of inferred changes between [Formula: see text] and the anchor trees. As the maximum-parsimony optimality score is additive, the sum of the lower bounds on compatible character partitions provides a lower bound on the complete alignment of characters. This yields a region in the space of trees within which the best tree is guaranteed to be found; limiting the search for the optimal tree to this region can significantly reduce the number of trees that must be examined in a search of the space of trees. We analyze this method empirically using four different biological data sets as well as surveying 400 data sets from the TreeBASE repository, demonstrating the effectiveness of our technique in reducing the number of steps in exact heuristic searches for trees under the maximum-parsimony optimality criterion. © The Author(s) 2014. Published by Oxford University Press, on behalf of the Society of Systematic Biologists. All rights reserved. For Permissions, please email: journals.permissions@oup.com.
Indian Academy of Sciences (India)
deciduous tree with irregularly-shaped trunk, greyish-white scaly bark and milky latex. Leaves in opposite pairs are simple, oblong and whitish beneath. Flowers that occur in branched inflorescence are white, 2–. 3cm across and fragrant. Calyx is glandular inside. Petals bear numerous linear white scales, the corollary.
Indian Academy of Sciences (India)
Berrya cordifolia (Willd.) Burret (Syn. B. ammonilla Roxb.) – Trincomali Wood of Tiliaceae is a tall evergreen tree with straight trunk, smooth brownish-grey bark and simple broad leaves. Inflorescence is much branched with white flowers. Stamens are many with golden yellow anthers. Fruit is a capsule with six spreading ...
Indian Academy of Sciences (India)
Canthium parviflorum Lam. of Rubiaceae is a large shrub that often grows into a small tree with conspicuous spines. Leaves are simple, in pairs at each node and are shiny. Inflorescence is an axillary few-flowered cymose fascicle. Flowers are small (less than 1 cm across), 4-merous and greenish-white. Fruit is ellipsoid ...
Indian Academy of Sciences (India)
sriranga
Hook.f. ex Brandis (Yellow. Cadamba) of Rubiaceae is a large and handsome deciduous tree. Leaves are simple, large, orbicular, and drawn abruptly at the apex. Flowers are small, yellowish and aggregate into small spherical heads. The corolla is funnel-shaped with five stamens inserted at its mouth. Fruit is a capsule.
Indian Academy of Sciences (India)
Celtis tetrandra Roxb. of Ulmaceae is a moderately large handsome deciduous tree with green branchlets and grayish-brown bark. Leaves are simple with three to four secondary veins running parallel to the mid vein. Flowers are solitary, male, female and bisexual and inconspicuous. Fruit is berry-like, small and globose ...
Indian Academy of Sciences (India)
IAS Admin
Aglaia elaeagnoidea (A.Juss.) Benth. of Meliaceae is a small-sized evergreen tree of both moist and dry deciduous forests. The leaves are alternate and pinnately compound, terminating in a single leaflet. Leaflets are more or less elliptic with entire margin. Flowers are small on branched inflorescence. Fruit is a globose ...
Indian Academy of Sciences (India)
user
Flowers are borne on stiff bunches terminally on short shoots. They are 2-3 cm across, white, sweet-scented with light-brown hairy sepals and many stamens. Loquat fruits are round or pear-shaped, 3-5 cm long and are edible. A native of China, Loquat tree is grown in parks as an ornamental and also for its fruits.
Indian Academy of Sciences (India)
mid-sized slow-growing evergreen tree with spreading branches that form a dense crown. The bark is smooth, thick, dark and flakes off in large shreds. Leaves are thick, oblong, leathery and bright red when young. The female flowers are drooping and are larger than male flowers. Fruit is large, red in color and velvety.
Indian Academy of Sciences (India)
Andira inermis (wright) DC. , Dog Almond of Fabaceae is a handsome lofty evergreen tree. Leaves are alternate and pinnately compound with 4–7 pairs of leaflets. Flowers are fragrant and are borne on compact branched inflorescences. Fruit is ellipsoidal one-seeded drupe that is peculiar to members of this family.
Indian Academy of Sciences (India)
narrow towards base. Flowers are large and attrac- tive, but emit unpleasant foetid smell. They appear in small numbers on erect terminal clusters and open at night. Stamens are numerous, pink or white. Style is slender and long, terminating in a small stigma. Fruit is green, ovoid and indistinctly lobed. Flowering Trees.
Indian Academy of Sciences (India)
Muntingia calabura L. (Singapore cherry) of. Elaeocarpaceae is a medium size handsome ever- green tree. Leaves are simple and alternate with sticky hairs. Flowers are bisexual, bear numerous stamens, white in colour and arise in the leaf axils. Fruit is a berry, edible with several small seeds embedded in a fleshy pulp ...
Indian Academy of Sciences (India)
. Stamens are fused into a purple staminal tube that is toothed. Fruit is about 0.5 in. across, nearly globose, generally 5-seeded, green but yellow when ripe, quite smooth at first but wrinkled in drying, remaining long on the tree ajier ripening.
Mark J. Ambrose
2012-01-01
Tree mortality is a natural process in all forest ecosystems. However, extremely high mortality also can be an indicator of forest health issues. On a regional scale, high mortality levels may indicate widespread insect or disease problems. High mortality may also occur if a large proportion of the forest in a particular region is made up of older, senescent stands....
Indian Academy of Sciences (India)
Guaiacum officinale L. (LIGNUM-VITAE) of Zygophyllaceae is a dense-crowned, squat, knobbly, rough and twisted medium-sized ev- ergreen tree with mottled bark. The wood is very hard and resinous. Leaves are compound. The leaflets are smooth, leathery, ovate-ellipti- cal and appear in two pairs. Flowers (about 1.5.
Guidance and search help resource listing examples of common queries that can be used in the Google Search Appliance search request, including examples of special characters, or query term seperators that Google Search Appliance recognizes.
Performance of a Two-Level Call Admission Control Scheme for DS-CDMA Wireless Networks
Directory of Open Access Journals (Sweden)
Fapojuwo Abraham O
2007-01-01
Full Text Available We propose a two-level call admission control (CAC scheme for direct sequence code division multiple access (DS-CDMA wireless networks supporting multimedia traffic and evaluate its performance. The first-level admission control assigns higher priority to real-time calls (also referred to as class 0 calls in gaining access to the system resources. The second level admits nonreal-time calls (or class 1 calls based on the resources remaining after meeting the resource needs for real-time calls. However, to ensure some minimum level of performance for nonreal-time calls, the scheme reserves some resources for such calls. The proposed two-level CAC scheme utilizes the delay-tolerant characteristic of non-real-time calls by incorporating a queue to temporarily store those that cannot be assigned resources at the time of initial access. We analyze and evaluate the call blocking, outage probability, throughput, and average queuing delay performance of the proposed two-level CAC scheme using Markov chain theory. The analytic results are validated by simulation results. The numerical results show that the proposed two-level CAC scheme provides better performance than the single-level CAC scheme. Based on these results, it is concluded that the proposed two-level CAC scheme serves as a good solution for supporting multimedia applications in DS-CDMA wireless communication systems.
Performance of a Two-Level Call Admission Control Scheme for DS-CDMA Wireless Networks
Directory of Open Access Journals (Sweden)
Abraham O. Fapojuwo
2007-11-01
Full Text Available We propose a two-level call admission control (CAC scheme for direct sequence code division multiple access (DS-CDMA wireless networks supporting multimedia traffic and evaluate its performance. The first-level admission control assigns higher priority to real-time calls (also referred to as class 0 calls in gaining access to the system resources. The second level admits nonreal-time calls (or class 1 calls based on the resources remaining after meeting the resource needs for real-time calls. However, to ensure some minimum level of performance for nonreal-time calls, the scheme reserves some resources for such calls. The proposed two-level CAC scheme utilizes the delay-tolerant characteristic of non-real-time calls by incorporating a queue to temporarily store those that cannot be assigned resources at the time of initial access. We analyze and evaluate the call blocking, outage probability, throughput, and average queuing delay performance of the proposed two-level CAC scheme using Markov chain theory. The analytic results are validated by simulation results. The numerical results show that the proposed two-level CAC scheme provides better performance than the single-level CAC scheme. Based on these results, it is concluded that the proposed two-level CAC scheme serves as a good solution for supporting multimedia applications in DS-CDMA wireless communication systems.
On Chinese and Western Family Trees: Mechanism and Performance
Directory of Open Access Journals (Sweden)
Elton S SIQUEIRA
2016-10-01
Full Text Available Family tree is an efficient data structure to store the kinship information in a family. There are basically two kinds of trees: Western Family Tree (WFT and Oriental Family Tree such as Chinese Family Tree (CFT. To get an insight of their efficiency in the context of family kinship presentation and information extraction, in this paper we develop WFT and CFT presentation models and search algorithms, comparing their search performance and inherent mechanism. The study reveals that the computational cost is higher in CFT model, but it provides a greater gain in information retrieval and produces more details of the kinship between individuals in the family.
Anonymity for key-trees with adaptive adversaries
Beye, M.; Veugen, P.J.M.
2012-01-01
Hash-lock authentication protocols for Radio Frequency IDentification (RFID) tags incur heavy search on the server. Key-trees have been proposed as a way to reduce search times, but because partial keys in such trees are shared, key compromise affects several tags. Buttyán [4] and Beye and Veugen
Privacy for Key-Trees with Adaptive Adversaries
Beye, M.; Veugen, P.J.M.
2011-01-01
Hash-lock authentication protocols for Radio Frequency IDentification (RFID) tags incur heavy search on the server. Key-trees have been proposed as a way to reduce search times, but because partial keys in such trees are shared, key compromise affects several tags. Butty´an [3] and Beye and Veugen
Solutions of the two-level problem in terms of biconfluent Heun functions
Energy Technology Data Exchange (ETDEWEB)
Ishkhanyan, Artur [Engineering Center of Armenian National Academy of Sciences, Ashtarak (Armenia)]. E-mail: artur@ec.sci.am; Suominen, Kalle-Antti [Helsinki Institute of Physics, Helsinki (Finland); Department of Applied Physics, University of Turku, Turku (Finland)
2001-08-17
Five four-parametric classes of quantum mechanical two-level models permitting solutions in terms of the biconfluent Heun function are derived. Three of these classes are generalizations of the well known classes of Landau-Zener, Nikitin and Crothers. It is shown that two other classes describe super- and sublinear and essentially nonlinear level crossings, as well as processes with three crossing points. In particular, these classes include two-level models where the field amplitude is constant and the detuning varies as {delta}{sub 0}t+{delta}{sub 2}t{sup 3} or {approx}t{sup 1/3}. For the essentially nonlinear cubic-crossing model, {delta}{sub t}{approx}{delta}{sub 2}t{sup 3}, the general solution of the two-level problem is shown to be expressed as series of confluent hypergeometric functions. (author)
Two-Level Solutions to Exponentially Complex Problems in Glass Science
DEFF Research Database (Denmark)
Mauro, John C.; Smedskjær, Morten Mattrup
Glass poses an especially challenging problem for physicists. The key to making progress in theoretical glass science is to extract the key physics governing properties of practical interest. In this spirit, we discuss several two-level solutions to exponentially complex problems in glass science....... Topological constraint theory, originally developed by J.C. Phillips, is based on a two-level description of rigid and floppy modes in a glass network and can be used to derive quantitatively accurate and analytically solvable models for a variety of macroscopic properties. The temperature dependence...... that captures both primary and secondary relaxation modes. Such a model also offers the ability to calculate the distinguishability of particles during glass transition and relaxation processes. Two-level models can also be used to capture the distribution of various network-forming species in mixed...
Crossing rule for a PT-symmetric two-level time-periodic system
International Nuclear Information System (INIS)
Moiseyev, Nimrod
2011-01-01
For a two-level system in a time-periodic field we show that in the non-Hermitian PT case the level crossing is of two quasistationary states that have the same dynamical symmetry property. At the field's parameters where the two levels which have the same dynamical symmetry cross, the corresponding quasienergy states coalesce and a self-orthogonal state is obtained. This situation is very different from the Hermitian case where a crossing of two quasienergy levels happens only when the corresponding two quasistationary states have different dynamical symmetry properties and, unlike the situation in the non-Hermitian case, the spectrum remains complete also when the two levels cross.
Kir2.1 channels set two levels of resting membrane potential with inward rectification.
Chen, Kuihao; Zuo, Dongchuan; Liu, Zheng; Chen, Haijun
2018-04-01
Strong inward rectifier K + channels (Kir2.1) mediate background K + currents primarily responsible for maintenance of resting membrane potential. Multiple types of cells exhibit two levels of resting membrane potential. Kir2.1 and K2P1 currents counterbalance, partially accounting for the phenomenon of human cardiomyocytes in subphysiological extracellular K + concentrations or pathological hypokalemic conditions. The mechanism of how Kir2.1 channels contribute to the two levels of resting membrane potential in different types of cells is not well understood. Here we test the hypothesis that Kir2.1 channels set two levels of resting membrane potential with inward rectification. Under hypokalemic conditions, Kir2.1 currents counterbalance HCN2 or HCN4 cation currents in CHO cells that heterologously express both channels, generating N-shaped current-voltage relationships that cross the voltage axis three times and reconstituting two levels of resting membrane potential. Blockade of HCN channels eliminated the phenomenon in K2P1-deficient Kir2.1-expressing human cardiomyocytes derived from induced pluripotent stem cells or CHO cells expressing both Kir2.1 and HCN2 channels. Weakly inward rectifier Kir4.1 or inward rectification-deficient Kir2.1•E224G mutant channels do not set such two levels of resting membrane potential when co-expressed with HCN2 channels in CHO cells or when overexpressed in human cardiomyocytes derived from induced pluripotent stem cells. These findings demonstrate a common mechanism that Kir2.1 channels set two levels of resting membrane potential with inward rectification by balancing inward currents through different cation channels such as hyperpolarization-activated HCN channels or hypokalemia-induced K2P1 leak channels.
DEFF Research Database (Denmark)
Nysteen, Anders; McCutcheon, Dara; Mørk, Jesper
2015-01-01
We analytically treat the scattering of two counterpropagating photons on a two-level emitter embedded in an optical waveguide. We find that the nonlinearity of the emitter can give rise to significant pulse-dependent directional correlations in the scattered photonic state, which could be quanti......We analytically treat the scattering of two counterpropagating photons on a two-level emitter embedded in an optical waveguide. We find that the nonlinearity of the emitter can give rise to significant pulse-dependent directional correlations in the scattered photonic state, which could...
Experimental Research into the Two-Level Cylindrical Cyclone with a Different Number of Channels
Directory of Open Access Journals (Sweden)
Egidijus Baliukas
2014-10-01
Full Text Available The multichannel two-level cyclone has been designed for separating solid particles from airflow and built at the Laboratory of Environmental Protection Technologies of Vilnius Gediminas Technical University. The conducted research is aimed at determining air flow distribution at two levels and channels of the multichannel cyclone. The multifunctional meter Testo-400 and the dynamic Pitot tube have been used form easuring air flow rates in the channels. The obtained results show that the equal volume of air gets into two levels installed inside the cyclone, and rates are distributed equally in the channels of these levels. The maximum air flow rate is recorded in the first channel and occurs when half-rings are set in such positions so that 75% of air flow returns to the previous channel. The biggest aerodynamic resistance is 1660 Pa and has been recorded in the cyclone having eight channels under air flow distribution ratio 75/25. The highest air purification efficiency has been observed in the two-level six-channel cyclone under air flow distribution ratio 75/25. The effectiveness of separating granite particles is 92.1% and that of wood particles – 91.1 when the particles are up to 20 μm in diameter.
Polynomial pseudosupersymmetry underlying a two-level atom in an external electromagnetic field
International Nuclear Information System (INIS)
Samsonov, B.F.; Shamshutdinova, V.V.; Gitman, D.M.
2005-01-01
Chains of transformations introduced previously were studied in order to obtain electric fields with a time-dependent frequency for which the equation of motion of a two-level atom in the presence of these fields can be solved exactly. It is shown that a polynomial pseudosupersymmetry may be associated to such chains
Ultimate temperature for laser cooling of two-level neutral atoms
International Nuclear Information System (INIS)
Bagnato, V.S.; Zilio, S.C.
1989-01-01
We present a simple pedagogical method to evaluate the minimum attainable temperature for laser cooling of two-level neutral atoms. Results are given as a function of the laser detuning and intensity. We also discuss the use of this approach to predict the minimum temperature of neutral atoms confined in magnetic traps. (author) [pt
Resonant retuning of Rabi oscillations in a two-level system
International Nuclear Information System (INIS)
Leonov, A.V.; Feranchuk, I.D.
2009-01-01
The evolution of a two-level system in a single-mode quantum field is considered beyond the rotating wave approximation. The existence of quasi-degenerate energy levels is shown to influence the essential characteristics of temporal and amplitude Rabi oscillations of the system in a resonant manner. (authors)
An Owen-type value for games with two-level communication structures
van den Brink, René; Khmelnitskaya, Anna Borisovna; van der Laan, Gerard
We introduce an Owen-type value for games with two-level communication structure, which is a structure where the players are partitioned into a coalition structure such that there exists restricted communication between as well as within the a priori unions of the coalition structure. Both types of
Reactive Power Impact on Lifetime Prediction of Two-level Wind Power Converter
DEFF Research Database (Denmark)
Zhou, Dao; Blaabjerg, Frede; Lau, M.
2013-01-01
The influence of reactive power injection on the dominating two-level wind power converter is investigated and compared in terms of power loss and thermal behavior. Then the lifetime of both the partial-scale and full-scale power converter is estimated based on the widely used Coffin-Manson model...
A two-level strategy to realize life-cycle production optimization in an operational setting
Essen, van G.M.; Hof, Van den P.M.J.; Jansen, J.D.
2012-01-01
We present a two-level strategy to improve robustness against uncertainty and model errors in life-cycle flooding optimization. At the upper level, a physics-based large-scale reservoir model is used to determine optimal life-cycle injection and production profiles. At the lower level these profiles
Random model of two-level atoms interacting with electromagnetic field
International Nuclear Information System (INIS)
Kireev, A.N.; Meleshko, A.N.
1983-12-01
A phase transition has been studied in a random system of two-level atoms interacting with an electromagnetic field. It is shown that superradiation can arise when there is short-range order in a spin-subsystem. The existence of long-range order is irrelevant for this phase transition
Excitation of graphene plasmons as an analogy with the two-level system
Energy Technology Data Exchange (ETDEWEB)
Fu, Jiahui [Microwave and Electromagnetic Laboratory, Harbin Institute of Technology, No. 92, Xidazhi Street, Nangang District, Harbin City, Heilongjiang Province (China); Lv, Bo, E-mail: lb19840313@126.com [Microwave and Electromagnetic Laboratory, Harbin Institute of Technology, No. 92, Xidazhi Street, Nangang District, Harbin City, Heilongjiang Province (China); Li, Rujiang [College of Information Science and Electronic Engineering, Zhejiang University, Hangzhou 310027 (China); Ma, Ruyu; Chen, Wan; Meng, Fanyi [Microwave and Electromagnetic Laboratory, Harbin Institute of Technology, No. 92, Xidazhi Street, Nangang District, Harbin City, Heilongjiang Province (China)
2016-02-15
The excitation of graphene plasmons (GPs) is presented as an interaction between the GPs and the incident electromagnetic field. In this Letter, the excitation of GPs in a plasmonic system is interpreted as an analogy with the two-level system by taking the two-coupled graphene-covered gratings as an example. Based on the equivalent circuit theory, the excitation of GPs in the graphene-covered grating is equivalent to the resonance of an oscillator. Thus, according to the governing equation, the electric currents at the resonant frequencies for two-coupled graphene-covered gratings correspond to the energy states in a two-level system. In addition, the excitation of GPs in different two-coupled graphene-covered gratings is numerically studied to validate our theoretical model. Our work provides an intuitive understanding of the excitation of GPs using an analogy with the two-level system. - Highlights: • The excitation of graphene plasmons (GPs) in graphene-covered grating is equivalent to the resonance of an oscillator. • We establish the equivalent circuit of two-level system to analyze the resonant character. • The excitation of GPs in different two-coupled graphene-covered gratings are numerically studied to validate our theoretical model.
Analysis of Two-Level Support Systems with Time-Dependent Overflow - A Banking Application
DEFF Research Database (Denmark)
Barth, Wolfgang; Manitz, Michael; Stolletz, Raik
2010-01-01
In this paper, we analyze the performance of call centers of financial service providers with two levels of support and a time-dependent overflow mechanism. Waiting calls from the front-office queue flow over to the back office if a waiting-time limit is reached and at least one back-office agent...
Excitation of graphene plasmons as an analogy with the two-level system
International Nuclear Information System (INIS)
Fu, Jiahui; Lv, Bo; Li, Rujiang; Ma, Ruyu; Chen, Wan; Meng, Fanyi
2016-01-01
The excitation of graphene plasmons (GPs) is presented as an interaction between the GPs and the incident electromagnetic field. In this Letter, the excitation of GPs in a plasmonic system is interpreted as an analogy with the two-level system by taking the two-coupled graphene-covered gratings as an example. Based on the equivalent circuit theory, the excitation of GPs in the graphene-covered grating is equivalent to the resonance of an oscillator. Thus, according to the governing equation, the electric currents at the resonant frequencies for two-coupled graphene-covered gratings correspond to the energy states in a two-level system. In addition, the excitation of GPs in different two-coupled graphene-covered gratings is numerically studied to validate our theoretical model. Our work provides an intuitive understanding of the excitation of GPs using an analogy with the two-level system. - Highlights: • The excitation of graphene plasmons (GPs) in graphene-covered grating is equivalent to the resonance of an oscillator. • We establish the equivalent circuit of two-level system to analyze the resonant character. • The excitation of GPs in different two-coupled graphene-covered gratings are numerically studied to validate our theoretical model.
A two-level strategy to realize life-cycle production optimization in an operational setting
Essen, van G.M.; Hof, Van den P.M.J.; Jansen, J.D.
2013-01-01
We present a two-level strategy to improve robustness against uncertainty and model errors in life-cycle flooding optimization. At the upper level, a physics-based large-scale reservoir model is used to determine optimal life-cycle injection and production profiles. At the lower level these profiles
Localization of a two-level atom via the absorption spectrum
International Nuclear Information System (INIS)
Xu, Jun; Hu, Xiang-Ming
2007-01-01
We show that it is possible to localize a two-level atom as it passes through a standing-wave field by measuring the probe-field absorption. There is 50% detecting probability of the atom at the nodes of the standing-wave field in the subwavelength domain when the probe field is tuned resonant with the atomic transition
Efficient two-level preconditionined conjugate gradient method on the GPU
Gupta, R.; Van Gijzen, M.B.; Vuik, K.
2011-01-01
We present an implementation of Two-Level Preconditioned Conjugate Gradient Method for the GPU. We investigate a Truncated Neumann Series based preconditioner in combination with deflation and compare it with Block Incomplete Cholesky schemes. This combination exhibits fine-grain parallelism and
A spatial scan statistic for nonisotropic two-level risk cluster.
Li, Xiao-Zhou; Wang, Jin-Feng; Yang, Wei-Zhong; Li, Zhong-Jie; Lai, Sheng-Jie
2012-01-30
Spatial scan statistic methods are commonly used for geographical disease surveillance and cluster detection. The standard spatial scan statistic does not model any variability in the underlying risks of subregions belonging to a detected cluster. For a multilevel risk cluster, the isotonic spatial scan statistic could model a centralized high-risk kernel in the cluster. Because variations in disease risks are anisotropic owing to different social, economical, or transport factors, the real high-risk kernel will not necessarily take the central place in a whole cluster area. We propose a spatial scan statistic for a nonisotropic two-level risk cluster, which could be used to detect a whole cluster and a noncentralized high-risk kernel within the cluster simultaneously. The performance of the three methods was evaluated through an intensive simulation study. Our proposed nonisotropic two-level method showed better power and geographical precision with two-level risk cluster scenarios, especially for a noncentralized high-risk kernel. Our proposed method is illustrated using the hand-foot-mouth disease data in Pingdu City, Shandong, China in May 2009, compared with two other methods. In this practical study, the nonisotropic two-level method is the only way to precisely detect a high-risk area in a detected whole cluster. Copyright © 2011 John Wiley & Sons, Ltd.
Two-Level Designs to Estimate All Main Effects and Two-Factor Interactions
Eendebak, P.T.; Schoen, E.D.
2017-01-01
We study the design of two-level experiments with N runs and n factors large enough to estimate the interaction model, which contains all the main effects and all the two-factor interactions. Yet, an effect hierarchy assumption suggests that main effect estimation should be given more prominence
Exact Solution of the Two-Level System and the Einstein Solid in the Microcanonical Formalism
Bertoldi, Dalia S.; Bringa, Eduardo M.; Miranda, E. N.
2011-01-01
The two-level system and the Einstein model of a crystalline solid are taught in every course of statistical mechanics and they are solved in the microcanonical formalism because the number of accessible microstates can be easily evaluated. However, their solutions are usually presented using the Stirling approximation to deal with factorials. In…
VC-dimension of univariate decision trees.
Yildiz, Olcay Taner
2015-02-01
In this paper, we give and prove the lower bounds of the Vapnik-Chervonenkis (VC)-dimension of the univariate decision tree hypothesis class. The VC-dimension of the univariate decision tree depends on the VC-dimension values of its subtrees and the number of inputs. Via a search algorithm that calculates the VC-dimension of univariate decision trees exhaustively, we show that our VC-dimension bounds are tight for simple trees. To verify that the VC-dimension bounds are useful, we also use them to get VC-generalization bounds for complexity control using structural risk minimization in decision trees, i.e., pruning. Our simulation results show that structural risk minimization pruning using the VC-dimension bounds finds trees that are more accurate as those pruned using cross validation.
Surface tree languages and parallel derivation trees
Engelfriet, Joost
1976-01-01
The surface tree languages obtained by top-down finite state transformation of monadic trees are exactly the frontier-preserving homomorphic images of sets of derivation trees of ETOL systems. The corresponding class of tree transformation languages is therefore equal to the class of ETOL languages.
E.G. McPherson; F. Ferrini
2010-01-01
We know that âtrees are good,â and most people believe this to be true. But if this is so, why are so many trees neglected, and so many tree wells empty? An individualâs attitude toward trees may result from their firsthand encounters with specific trees. Understanding how attitudes about trees are shaped, particularly aversion to trees, is critical to the business of...
Rahman, P. A.
2018-05-01
This scientific paper deals with the two-level backbone computer networks with arbitrary topology. A specialized method, offered by the author for calculation of the stationary availability factor of the two-level backbone computer networks, based on the Markov reliability models for the set of the independent repairable elements with the given failure and repair rates and the methods of the discrete mathematics, is also discussed. A specialized algorithm, offered by the author for analysis of the network connectivity, taking into account different kinds of the network equipment failures, is also observed. Finally, this paper presents an example of calculation of the stationary availability factor for the backbone computer network with the given topology.
Directory of Open Access Journals (Sweden)
Yuan Li
2013-01-01
Full Text Available This paper presents two-level iteration penalty finite element methods to approximate the solution of the Navier-Stokes equations with friction boundary conditions. The basic idea is to solve the Navier-Stokes type variational inequality problem on a coarse mesh with mesh size H in combining with solving a Stokes, Oseen, or linearized Navier-Stokes type variational inequality problem for Stokes, Oseen, or Newton iteration on a fine mesh with mesh size h. The error estimate obtained in this paper shows that if H, h, and ε can be chosen appropriately, then these two-level iteration penalty methods are of the same convergence orders as the usual one-level iteration penalty method.
Dynamics of quantum Fisher information in a two-level system coupled to multiple bosonic reservoirs
Wang, Guo-You; Guo, You-Neng; Zeng, Ke
2015-11-01
We consider the optimal parameter estimation for a two-level system coupled to multiple bosonic reservoirs. By using quantum Fisher information (QFI), we investigate the effect of the Markovian reservoirs’ number N on QFI in both weak and strong coupling regimes for a two-level system surrounded by N zero-temperature reservoirs of field modes initially in the vacua. The results show that the dynamics of QFI non-monotonically decays to zero with revival oscillations at some time in the weak coupling regime depending on the reservoirs’ parameters. Furthermore, we also present the relations between the QFI flow, the flows of energy and information, and the sign of the decay rate to gain insight into the physical processes characterizing the dynamics. Project supported by the Hunan Provincial Innovation Foundation for Postgraduate, China (Grant No. CX2014B194) and the Scientific Research Foundation of Hunan Provincial Education Department, China (Grant No. 13C039).
Minimax terminal approach problem in two-level hierarchical nonlinear discrete-time dynamical system
Energy Technology Data Exchange (ETDEWEB)
Shorikov, A. F., E-mail: afshorikov@mail.ru [Ural Federal University, 19 S. Mira, Ekaterinburg, 620002, Russia Institute of Mathematics and Mechanics, Ural Branch of Russian Academy of Sciences, 16 S. Kovalevskaya, Ekaterinburg, 620990 (Russian Federation)
2015-11-30
We consider a discrete–time dynamical system consisting of three controllable objects. The motions of all objects are given by the corresponding vector nonlinear or linear discrete–time recurrent vector relations, and control system for its has two levels: basic (first or I level) that is dominating and subordinate level (second or II level) and both have different criterions of functioning and united a priori by determined informational and control connections defined in advance. For the dynamical system in question, we propose a mathematical formalization in the form of solving a multistep problem of two-level hierarchical minimax program control over the terminal approach process with incomplete information and give a general scheme for its solving.
A modified two-level three-phase quasi-soft-switching inverter
DEFF Research Database (Denmark)
Liu, Yusheng; Wu, Weimin; Blaabjerg, Frede
2014-01-01
A traditional Voltage Source Inverter (VSI) has higher efficiency than a Current Voltage Source (CSI) due to the less conduction power loss. However, the reverse recovery of the free-wheeling diode limits the efficiency improvement for the silicon devices based hard-switching VSI. The traditional...... quasi-soft-switching inverter can alternate between VSI and CSI by using a proper control scheme and thereby reduce the power losses caused by the reverse recovery of the free-wheeling diode. Nevertheless, slightly extra conduction power loss of the auxiliary switch is also introduced. In order...... to reduce the extra conduction power loss and the voltage stress across the DC-link capacitor, a modified two-level three-phase quasi-soft-switching inverter is proposed by using a SiC MOSFET instead of an IGBT. The principle of the modified two-level three-phase quasi-soft-switching inverter is analyzed...
Revisional Surgery for Hallux Valgus with Serial Osteotomies at Two Levels
Directory of Open Access Journals (Sweden)
Jason B. T. Lim
2011-01-01
Full Text Available The aetiology and form of hallux valgus (HV is varied with many corrective procedures described. We report a 39-year-old woman, previously treated with a Chevron osteotomy, who presented with recurrent right HV, metatarsus primus varus, and associated bunion. Osteotomies were performed at two levels as a revisional procedure. This report highlights (1 limitations of the Chevron osteotomy and (2 the revisional procedure of the two level osteotomies: (i proximal opening-wedge basal osteotomy and (ii distal short Scarf with medial closing wedges. If a Chevron osteotomy is used inappropriately, for example, in an attempt to correct too large a deformity, it may angulate laterally causing a malunion with an increased distal metatarsal articular angle. Secondly, it is feasible to correct this combined deformity using a combination of proximal opening-wedge and distal short Scarf osteotomies.
Non-zero temperature two-mode squeezing for time-dependent two-level systems
International Nuclear Information System (INIS)
Aliaga, J.; Gruver, J.L.; Proto, A.N.; Cerdeira, H.A.
1994-01-01
A Maximum Entropy Principle density matrix method, valid for systems with temperature different from zero, is presented making it possible two-mode squeezed states in two-level systems with relevant operators and Hamiltonian connected with O(3,2). A method which allows one to relate the appearance of squeezing to the relevant operators, included in order to define the density matrix of the system is given. (author). 14 refs, 1 fig
Urea metabolism in buffalo calves fed on rations containing two levels of crude protein
International Nuclear Information System (INIS)
Verma, D.N.; Singh, U.B.; Lal, M.; Varma, A.; Ranjhan, S.K.
1974-01-01
Urea entry rates into the body pools of Murrah Buffalo calves have been estimated using a single injection isotope dilution technique using 14 C-urea. The animals were fed two levels of crude proteins, namely, 13 percent lower and 19 percent higher than N.R.C. recommendations. Results show that the recycling of urea is significantly better in animals given low crude protein contents. (M.G.B.)
Experiences of building a medical data acquisition system based on two-level modeling.
Li, Bei; Li, Jianbin; Lan, Xiaoyun; An, Ying; Gao, Wuqiang; Jiang, Yuqiao
2018-04-01
Compared to traditional software development strategies, the two-level modeling approach is more flexible and applicable to build an information system in the medical domain. However, the standards of two-level modeling such as openEHR appear complex to medical professionals. This study aims to investigate, implement, and improve the two-level modeling approach, and discusses the experience of building a unified data acquisition system for four affiliated university hospitals based on this approach. After the investigation, we simplified the approach of archetype modeling and developed a medical data acquisition system where medical experts can define the metadata for their own specialties by using a visual easy-to-use tool. The medical data acquisition system for multiple centers, clinical specialties, and diseases has been developed, and integrates the functions of metadata modeling, form design, and data acquisition. To date, 93,353 data items and 6,017 categories for 285 specific diseases have been created by medical experts, and over 25,000 patients' information has been collected. OpenEHR is an advanced two-level modeling method for medical data, but its idea to separate domain knowledge and technical concern is not easy to realize. Moreover, it is difficult to reach an agreement on archetype definition. Therefore, we adopted simpler metadata modeling, and employed What-You-See-Is-What-You-Get (WYSIWYG) tools to further improve the usability of the system. Compared with the archetype definition, our approach lowers the difficulty. Nevertheless, to build such a system, every participant should have some knowledge in both medicine and information technology domains, as these interdisciplinary talents are necessary. Copyright © 2018 Elsevier B.V. All rights reserved.
Feedback controlled dephasing and population relaxation in a two-level system
International Nuclear Information System (INIS)
Wang Jin
2009-01-01
This Letter presents the maximum achievable stability and purity that can be obtained in a two-level system with both dephasing and population relaxation processes by using homodyne-mediated feedback control. An analytic formula giving the optimal amplitudes of the driving and feedback for the steady-state is also presented. Experimental examples are used to show the importance of controlling the dephasing process.
FAST COMMUNICATION: A PDE Based Two Level Model of the Masking Property of the Human Ear
Xin, Jack; Qi, Yingyong
2003-01-01
Human ear has the masking property that certain audible sound becomes inaudible in the presence of another sound. Masking is quantified by the raised threshold from the absolute hearing threshold in quiet. It is of scientific and practical importance to compute masking thresholds. Empirical models on masking have applications in low bit rate digital music compression. A first principle based two level model is developed with partial differential equation (PDE) at the periphe...
Effective Hamiltonians, two level systems, and generalized Maxwell-Bloch equations
International Nuclear Information System (INIS)
Sczaniecki, L.
1981-02-01
A new method is proposed involving a canonical transformation leading to the non-secular part of time-independent perturbation calculus. The method is used to derive expressions for effective Shen-Walls Hamiltonians which, taken in the two-level approximation and on the inclusion of non-Hamiltonian terms into the dynamics of the system, lead to generalized Maxwell-Bloch equations. The rotating wave approximation is written anew within the framework of our formalism. (author)
Understanding of phase modulation in two-level systems through inverse scattering
International Nuclear Information System (INIS)
Hasenfeld, A.; Hammes, S.L.; Warren, W.S.
1988-01-01
Analytical and numerical calculations describe the effects of shaped radiation pulses on two-level systems in terms of quantum-mechanical scattering. Previous results obtained in the reduced case of amplitude modulation are extended to the general case of simultaneous amplitude and phase modulation. We show that an infinite family of phase- and amplitude-modulated pulses all generate rectangular inversion profiles. Experimental measurements also verify the theoretical analysis
The simulation of the non-Markovian behaviour of a two-level system
Semina, I.; Petruccione, F.
2016-05-01
Non-Markovian relaxation dynamics of a two-level system is studied with the help of the non-linear stochastic Schrödinger equation with coloured Ornstein-Uhlenbeck noise. This stochastic Schrödinger equation is investigated numerically with an adapted Platen scheme. It is shown, that the memory effects have a significant impact to the dynamics of the system.
Minimum time control of a pair of two-level quantum systems with opposite drifts
International Nuclear Information System (INIS)
Romano, Raffaele; D’Alessandro, Domenico
2016-01-01
In this paper we solve two equivalent time optimal control problems. On one hand, we design the control field to implement in minimum time the SWAP (or equivalent) operator on a two-level system, assuming that it interacts with an additional, uncontrollable, two-level system. On the other hand, we synthesize the SWAP operator simultaneously, in minimum time, on a pair of two-level systems subject to opposite drifts. We assume that it is possible to perform three independent control actions, and that the total control strength is bounded. These controls either affect the dynamics of the target system, under the first perspective, or, simultaneously, the dynamics of both systems, in the second view. We obtain our results by using techniques of geometric control theory on Lie groups. In particular, we apply the Pontryagin maximum principle, and provide a complete characterization of singular and nonsingular extremals. Our analysis shows that the problem can be formulated as the motion of a material point in a central force, a well known system in classical mechanics. Although we focus on obtaining the SWAP operator, many of the ideas and techniques developed in this work apply to the time optimal implementation of an arbitrary unitary operator. (paper)
Two-Level Micro-to-Nanoscale Hierarchical TiO2 Nanolayers on Titanium Surface
Directory of Open Access Journals (Sweden)
Elena G. Zemtsova
2016-12-01
Full Text Available Joint replacement is being actively developed within modern orthopedics. One novel material providing fast implantation is bioactive coatings. The synthesis of targeted nanocoatings on metallic nanotitanium surface is reported in this paper. TiO2-based micro- and nanocoatings were produced by sol-gel synthesis using dip-coating technology with subsequent fast (shock drying in hot plate mode at 400 °C. As a result of shock drying, the two-level hierarchical TiO2 nanolayer on the nanotitanium was obtained. This two-level hierarchy includes nanorelief of porous xerogel and microrelief of the micron-sized “defect” network (a crack network. The thickness of TiO2 nanolayers was controlled by repeating dip-coating process the necessary number of times after the first layer deposition. The state of the MS3T3-E1 osteoblast cell line (young cells that form bone tissue on the two-level hierarchical surface has been studied. Particularly, adhesion character, adhesion time and morphology have been studied. The reported results may serve the starting point for the development of novel bioactive coatings for bone and teeth implants.
International Nuclear Information System (INIS)
Tan, Xinsheng; Yu, Haifeng; Yu, Yang; Han, Siyuan
2015-01-01
We demonstrate a fast method to detect microscopic two-level systems in a superconducting phase qubit. By monitoring the population leak after sweeping the qubit bias flux, we are able to measure the two-level systems that are coupled with the qubit. Compared with the traditional method that detects two-level systems by energy spectroscopy, our method is faster and more sensitive. This method supplies a useful tool to investigate two-level systems in solid-state qubits
DEFF Research Database (Denmark)
Bahr, Patrick
2012-01-01
Tree automata are traditionally used to study properties of tree languages and tree transformations. In this paper, we consider tree automata as the basis for modular and extensible recursion schemes. We show, using well-known techniques, how to derive from standard tree automata highly modular...
David J. Nowak; Jeffrey T. Walton; James Baldwin; Jerry. Bond
2015-01-01
Information on street trees is critical for management of this important resource. Sampling of street tree populations provides an efficient means to obtain street tree population information. Long-term repeat measures of street tree samples supply additional information on street tree changes and can be used to report damages from catastrophic events. Analyses of...
Barking up the wrong tree: injuries due to falls from trees in Solomon Islands.
Negin, Joel; Vizintin, Pavle; Houasia, Patrick; Martiniuk, Alexandra L C
2014-12-11
To investigate tree-related injuries in Solomon Islands by the types of trees involved, who is affected and the types of injuries caused. Descriptive case series of all cases of injuries related to trees presenting to the National Referral Hospital in Honiara from 1994 to 2011. Data were collected by the attending clinician using a Trauma Epidemiology form, which provides information on age, sex, cause of injury and type of fracture. Number of injuries by tree type, sex and age. Of the 7651 injuries in the database, 1107 (14%) were caused by falls from trees. Falls from coconut trees led to the highest number of injuries, followed by falls from mango, guava, apple and nut trees. Overall, 85% of injuries occurred in individuals aged trees, 77% of patients were aged tree types. Overall, 71% of injuries occurred among males. Of all injuries, 92% were fractures, 3% were dislocations and 5% were non-fracture, non-dislocation injuries. The arm (including wrist, elbow and hand) was the most common location of injury across all tree types. Distal radius fractures in the forearm were particularly common, as were ulna fractures. While mangos and guavas are undeniably delicious, the quest for their flesh can be hazardous. Children will always climb trees, but the search for food among children in lower-income settings may lead to higher rates of injury.
International Nuclear Information System (INIS)
Shlesinger, Michael F
2009-01-01
There are a wide variety of searching problems from molecules seeking receptor sites to predators seeking prey. The optimal search strategy can depend on constraints on time, energy, supplies or other variables. We discuss a number of cases and especially remark on the usefulness of Levy walk search patterns when the targets of the search are scarce.
Morville, Peter
2010-01-01
What people are saying about Search Patterns "Search Patterns is a delight to read -- very thoughtful and thought provoking. It's the most comprehensive survey of designing effective search experiences I've seen." --Irene Au, Director of User Experience, Google "I love this book! Thanks to Peter and Jeffery, I now know that search (yes, boring old yucky who cares search) is one of the coolest ways around of looking at the world." --Dan Roam, author, The Back of the Napkin (Portfolio Hardcover) "Search Patterns is a playful guide to the practical concerns of search interface design. It cont
Consequences of Common Topological Rearrangements for Partition Trees in Phylogenomic Inference.
Chernomor, Olga; Minh, Bui Quang; von Haeseler, Arndt
2015-12-01
In phylogenomic analysis the collection of trees with identical score (maximum likelihood or parsimony score) may hamper tree search algorithms. Such collections are coined phylogenetic terraces. For sparse supermatrices with a lot of missing data, the number of terraces and the number of trees on the terraces can be very large. If terraces are not taken into account, a lot of computation time might be unnecessarily spent to evaluate many trees that in fact have identical score. To save computation time during the tree search, it is worthwhile to quickly identify such cases. The score of a species tree is the sum of scores for all the so-called induced partition trees. Therefore, if the topological rearrangement applied to a species tree does not change the induced partition trees, the score of these partition trees is unchanged. Here, we provide the conditions under which the three most widely used topological rearrangements (nearest neighbor interchange, subtree pruning and regrafting, and tree bisection and reconnection) change the topologies of induced partition trees. During the tree search, these conditions allow us to quickly identify whether we can save computation time on the evaluation of newly encountered trees. We also introduce the concept of partial terraces and demonstrate that they occur more frequently than the original "full" terrace. Hence, partial terrace is the more important factor of timesaving compared to full terrace. Therefore, taking into account the above conditions and the partial terrace concept will help to speed up the tree search in phylogenomic inference.
Allegheny County / City of Pittsburgh / Western PA Regional Data Center — Trees cared for and managed by the City of Pittsburgh Department of Public Works Forestry Division. Tree Benefits are calculated using the National Tree Benefit...
Fast Structural Search in Phylogenetic Databases
Directory of Open Access Journals (Sweden)
William H. Piel
2005-01-01
Full Text Available As the size of phylogenetic databases grows, the need for efficiently searching these databases arises. Thanks to previous and ongoing research, searching by attribute value and by text has become commonplace in these databases. However, searching by topological or physical structure, especially for large databases and especially for approximate matches, is still an art. We propose structural search techniques that, given a query or pattern tree P and a database of phylogenies D, find trees in D that are sufficiently close to P . The “closeness” is a measure of the topological relationships in P that are found to be the same or similar in a tree D in D. We develop a filtering technique that accelerates searches and present algorithms for rooted and unrooted trees where the trees can be weighted or unweighted. Experimental results on comparing the similarity measure with existing tree metrics and on evaluating the efficiency of the search techniques demonstrate that the proposed approach is promising
International Nuclear Information System (INIS)
Mestel, B D; Osbaldestin, A H
2004-01-01
Generalizing from the case of golden mean frequency to a wider class of quadratic irrationals, we extend our renormalization analysis of the self-similarity of correlation functions in a quasiperiodically forced two-level system. We give a description of all piecewise-constant periodic orbits of an additive functional recurrence generalizing that present in the golden mean case. We establish a criterion for periodic orbits to be globally bounded, and also calculate the asymptotic height of the main peaks in the correlation function
Quantum averaging and resonances: two-level atom in a one-mode classical laser field
Directory of Open Access Journals (Sweden)
M. Amniat-Talab
2007-06-01
Full Text Available We use a nonperturbative method based on quantum averaging and an adapted from of resonant transformations to treat the resonances of the Hamiltonian of a two-level atom interacting with a one-mode classical field in Floquet formalism. We illustrate this method by extraction of effective Hamiltonians of the system in two regimes of weak and strong coupling. The results obtained in the strong-coupling regime, are valid in the whole range of the coupling constant for the one-photon zero-field resonance.
Aspects of two-level systems under external time-dependent fields
Energy Technology Data Exchange (ETDEWEB)
Bagrov, V.G.; Wreszinski, W.F. [Tomsk State University and Tomsk Institute of High Current Electronics (Russian Federation); Barata, J.C.A.; Gitman D.M. [Universidade de Sao Paulo, Instituto de Fisica (Brazil)]. E-mails: jbarata@fma.if.usp.br; gitman@fma.if.usp.br
2001-12-14
The dynamics of two-level systems in time-dependent backgrounds is under consideration. We present some new exact solutions in special backgrounds decaying in time. On the other hand, following ideas of Feynman et al, we discuss in detail the possibility of reducing the quantum dynamics to a classical Hamiltonian system. This, in particular, opens the possibility of directly applying powerful methods of classical mechanics (e.g. KAM methods) to study the quantum system. Following such an approach, we draw conclusions of relevance for 'quantum chaos' when the external background is periodic or quasi-periodic in time. (author)
Sato, Shinji
2015-01-01
Characteristics of the 2011 Tohoku Tsunami have been revealed by collaborative tsunami surveys extensively performed under the coordination of the Joint Tsunami Survey Group. The complex behaviors of the mega-tsunami were characterized by the unprecedented scale and the low occurrence frequency. The limitation and the performance of tsunami countermeasures were described on the basis of tsunami surveys, laboratory experiments and numerical analyses. These findings contributed to the introduction of two-level tsunami hazards to establish a new strategy for tsunami disaster mitigation, combining structure-based flood protection designed by the Level-1 tsunami and non-structure-based damage reduction planned by the Level-2 tsunami.
Teleporting the one-qubit state via two-level atoms with spontaneous emission
Energy Technology Data Exchange (ETDEWEB)
Hu Mingliang, E-mail: mingliang0301@xupt.edu.cn, E-mail: mingliang0301@163.com [School of Science, Xi' an University of Posts and Telecommunications, Xi' an 710061 (China)
2011-05-14
We study quantum teleportation via two two-level atoms coupled collectively to a multimode vacuum field and prepared initially in different atomic states. We concentrated on the influence of the spontaneous emission, collective damping and dipole-dipole interaction of the atoms on fidelity dynamics of quantum teleportation and obtained the region of spatial distance between the two atoms over which the state can be teleported nonclassically. Moreover, we showed through concrete examples that entanglement of the channel state is the prerequisite but not the only essential quantity for predicting the teleportation fidelity.
A January angular momentum balance in the OSU two-level atmospheric general circulation model
Kim, J.-W.; Grady, W.
1982-01-01
The present investigation is concerned with an analysis of the atmospheric angular momentum balance, based on the simulation data of the Oregon State University two-level atmospheric general circulation model (AGCM). An attempt is also made to gain an understanding of the involved processes. Preliminary results on the angular momentum and mass balance in the AGCM are shown. The basic equations are examined, and questions of turbulent momentum transfer are investigated. The methods of analysis are discussed, taking into account time-averaged balance equations, time and longitude-averaged balance equations, mean meridional circulation, the mean meridional balance of relative angular momentum, and standing and transient components of motion.
Thermal analysis of two-level wind power converter under symmetrical grid fault
DEFF Research Database (Denmark)
Zhou, Dao; Blaabjerg, Frede
2013-01-01
In this paper, the case of symmetrical grid fault when using the multi-MW wind turbine of partial-scale and full-scale two-level power converter are designed and investigated. Firstly, the different operation behaviors of the relevant power converters under the voltage dip will be described......) condition as well as the junction temperature. For the full-scale wind turbine system, the most thermal stressed power device in the grid-side converter will appear at the grid voltage below 0.5 pu, and for the partial-scale wind turbine system, the most thermal stressed power device in the rotor...
Elimination of two level fluctuators in superconducting quantum bits by an epitaxial tunnel barrier
International Nuclear Information System (INIS)
Oh, Seongshik; Cicak, Katarina; Kline, Jeffrey S.; Sillanpaeae, Mika A.; Osborn, Kevin D.; Whittaker, Jed D.; Simmonds, Raymond W.; Pappas, David P.
2006-01-01
Quantum computing based on Josephson junction technology is considered promising due to its scalable architecture. However, decoherence is a major obstacle. Here, we report evidence for improved Josephson quantum bits (qubits) using a single-crystal Al 2 O 3 tunnel barrier. We have found an ∼80% reduction in the density of the spectral splittings that indicate the existence of two-level fluctators (TLFs) in amorphous tunnel barriers. The residual ∼20% TLFs can be attributed to interfacial effects that may be further reduced by different electrode materials. These results show that decoherence sources in the tunnel barrier of Josephson qubits can be identified and eliminated
Geometric manipulation of the quantum states of two-level atoms
International Nuclear Information System (INIS)
Tian, Mingzhen; Barber, Zeb W.; Fischer, Joe A.; Babbitt, Wm. Randall
2004-01-01
Manipulation of the quantum states of two-level atoms has been investigated using laser-controlled geometric phase change, which has the potential to build robust quantum logic gates for quantum computing. For a qubit based on two electronic transition levels of an atom, two basic quantum operations that can make any universal single qubit gate have been designed employing resonant laser pulses. An operation equivalent to a phase gate has been demonstrated using Tm 3+ doped in a yttrium aluminum garnet crystal
Oscillations of Doppler-Raby of two level atom moving in resonator
International Nuclear Information System (INIS)
Kozlovskij, A.V.
2001-01-01
The interaction of the two-level atom with the quantum mode of the high-quality resonator uniformly moving by the classic trajectory, is considered. The recurrent formula for the probability of the atom transition with the photon radiation is determined through the dressed states method. It is shown, that the ratio between the Doppler shift value of the atom transition and the Raby frequency value of the atom-field system qualitatively effects the dependence of the moving atom transition probability on its position in the resonator, as well as on its value [ru
Limitations of two-level emitters as nonlinearities in two-photon controlled-PHASE gates
DEFF Research Database (Denmark)
Nysteen, Anders; McCutcheon, Dara P. S.; Heuck, Mikkel
2017-01-01
We investigate the origin of imperfections in the fidelity of a two-photon controlled-PHASE gate based on two-level-emitter nonlinearities. We focus on a passive system that operates without external modulations to enhance its performance. We demonstrate that the fidelity of the gate is limited...... by opposing requirements on the input pulse width for one-and two-photon-scattering events. For one-photon scattering, the spectral pulse width must be narrow compared with the emitter linewidth, while two-photon-scattering processes require the pulse width and emitter linewidth to be comparable. We find...
Probe transparency in a two-level medium embedded by a squeezed vacuum
International Nuclear Information System (INIS)
Swain, S.; Zhou, P.
1994-08-01
Effect of the detuning on the probe absorption spectra of a two-level system with and without a classically driven field in a squeezed vacuum is investigated. For a strong squeezing, there is a threshold which determines the positions and widths of the absorption peaks, for the squeezed parameter M. In a large detuning, the spectra exhibit some resemblance to the Fano spectrum. The squeezing-induced transparency occurs at the frequency 2ω L - ω A in the minimum-uncertainty squeezed vacuum. This effect is not phase-sensitive. (author). 15 refs, 8 figs
FPGA Hardware Acceleration of a Phylogenetic Tree Reconstruction with Maximum Parsimony Algorithm
BLOCK, Henry; MARUYAMA, Tsutomu
2017-01-01
In this paper, we present an FPGA hardware implementation for a phylogenetic tree reconstruction with a maximum parsimony algorithm. We base our approach on a particular stochastic local search algorithm that uses the Progressive Neighborhood and the Indirect Calculation of Tree Lengths method. This method is widely used for the acceleration of the phylogenetic tree reconstruction algorithm in software. In our implementation, we define a tree structure and accelerate the search by parallel an...
Algorithms for optimal dyadic decision trees
Energy Technology Data Exchange (ETDEWEB)
Hush, Don [Los Alamos National Laboratory; Porter, Reid [Los Alamos National Laboratory
2009-01-01
A new algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data sets. This paper enhances and extends this algorithm by: introducing an adaptive grid search for the regularization parameter that guarantees optimal solutions for all relevant trees sizes, revising the core tree-building algorithm so that its run time is substantially smaller for most regularization parameter values on the grid, and incorporating new data structures and data pre-processing steps that provide significant run time enhancement in practice.
SCREENING OF MEDIUM COMPOUNDS USING A TWO-LEVEL FACTORIAL DESIGN FOR SACCHAROMYCES BOULARDII
Directory of Open Access Journals (Sweden)
GUOWEI SHU
2016-04-01
Full Text Available Even if the probiotic effect of Saccharomyces boulardii is has been reported, this yeast is rarely used in medium composition. Based on single factor experiment, two-level factorial design was employed to evaluate the effect of carbon sources (sucrose, glucose, nitrogen sources (soy peptone, beef extract, yeast extract, calf serum, malt extract and salts (K2HPO4, KH2PO4, MgSO4, Na2HPO4, NaH2PO4, CaCl2, sodium citrate, sodium glutamate on the growth of S. boulardii. At the same time, the optical density (OD in the medium was measured at 560 nm after 36 h of incubation. The result of two-level factorial design experiment showed that calf serum (p = 0.0214 and sodium citrate (p = 0.0045 are the significant growth factors of S. boulardii, sucrose (p = 0.0861 and malt extract (p = 0.0763 are important factors. In addition, sucrose and sodium citrate showed positive effect on the growth of S. boulardii. However, calf serum and malt extract showed negative effect on the growth. And we determined that the optimum medium composition for S. boulardii was as follow: 37.5 g·L-1 sucrose, 6 g·L-1 calf serum, 6 g·L-1 malt extract, 5 g·L-1 sodium citrate.
Directory of Open Access Journals (Sweden)
Shen-yan Chen
2015-01-01
Full Text Available This paper presents an Improved Genetic Algorithm with Two-Level Approximation (IGATA to minimize truss weight by simultaneously optimizing size, shape, and topology variables. On the basis of a previously presented truss sizing/topology optimization method based on two-level approximation and genetic algorithm (GA, a new method for adding shape variables is presented, in which the nodal positions are corresponding to a set of coordinate lists. A uniform optimization model including size/shape/topology variables is established. First, a first-level approximate problem is constructed to transform the original implicit problem to an explicit problem. To solve this explicit problem which involves size/shape/topology variables, GA is used to optimize individuals which include discrete topology variables and shape variables. When calculating the fitness value of each member in the current generation, a second-level approximation method is used to optimize the continuous size variables. With the introduction of shape variables, the original optimization algorithm was improved in individual coding strategy as well as GA execution techniques. Meanwhile, the update strategy of the first-level approximation problem was also improved. The results of numerical examples show that the proposed method is effective in dealing with the three kinds of design variables simultaneously, and the required computational cost for structural analysis is quite small.
Two-level method for unsteady Navier-Stokes equations based on a new projection
International Nuclear Information System (INIS)
Hou Yanren; Li Kaitai
2004-12-01
A two-level algorithm for the two dimensional unsteady Navier-Stokes equations based on a new projection is proposed and investigated. The approximate solution is solved as a sum of a large eddy component and a small eddy component, which are in the sense of the new projection, constructed in this paper. These two terms advance in time explicitly. Actually, the new algorithm proposed here can be regarded as a sort of postprocessing algorithm for the standard Galerkin method (SGM). The large eddy part is solved by SGM in the usual L 2 -based large eddy subspace while the small eddy part (the correction part) is obtained in its complement subspace in the sense of the new projection. The stability analysis indicates the improvement of the stability comparing with SGM of the same scale, and the L 2 -error estimate shows that the scheme can improve the accuracy of SGM approximation for half order. We also propose a numerical implementation based on Lagrange multiplier for this two-level algorithm. (author)
Development and evaluation of a two-level functional structure for the thin film encapsulation
International Nuclear Information System (INIS)
Lee, Jae-Wung; Sharma, Jaibir; Singh, Navab; Kwong, Dim-Lee
2013-01-01
This paper reports a two level capping structure for encapsulating micro-electro-mechanical system (MEMS) devices. The two level capping solves the main issue of the longer release time as well as safe sealing in thin film encapsulation (TFE). In this technique, the first cap layer has many etch holes, which were uniformly distributed on it to enhance the removal of the sacrificial layer. The second cap layer forms a cap on every etch hole in the first cap layer to protect the mass loading on MEMS devices. This technique was found to be very effective in reducing the release time of the TFE. For the 1200 µm × 1200 µm sized cavity encapsulation, this technique decreases the release time of the TFE by a factor of 24 in comparison to the sidewall located channel scheme. The presented technique also helps in reducing the size of TFE as the etch holes are uniformly distributed on the TFE itself. Wide seal rings were not required to accommodate sidewall channels. (paper)
Two-level Robust Measurement Fusion Kalman Filter for Clustering Sensor Networks
Institute of Scientific and Technical Information of China (English)
ZHANG Peng; QI Wen-Juan; DENG Zi-Li
2014-01-01
This paper investigates the distributed fusion Kalman filtering over clustering sensor networks. The sensor network is partitioned as clusters by the nearest neighbor rule and each cluster consists of sensing nodes and cluster-head. Using the minimax robust estimation principle, based on the worst-case conservative system with the conservative upper bounds of noise variances, two-level robust measurement fusion Kalman filter is presented for the clustering sensor network systems with uncertain noise variances. It can significantly reduce the communication load and save energy when the number of sensors is very large. A Lyapunov equation approach for the robustness analysis is presented, by which the robustness of the local and fused Kalman filters is proved. The concept of the robust accuracy is presented, and the robust accuracy relations among the local and fused robust Kalman filters are proved. It is proved that the robust accuracy of the two-level weighted measurement fuser is equal to that of the global centralized robust fuser and is higher than those of each local robust filter and each local weighted measurement fuser. A simulation example shows the correctness and effectiveness of the proposed results.
Protecting quantum coherence of two-level atoms from vacuum fluctuations of electromagnetic field
International Nuclear Information System (INIS)
Liu, Xiaobao; Tian, Zehua; Wang, Jieci; Jing, Jiliang
2016-01-01
In the framework of open quantum systems, we study the dynamics of a static polarizable two-level atom interacting with a bath of fluctuating vacuum electromagnetic field and explore under which conditions the coherence of the open quantum system is unaffected by the environment. For both a single-qubit and two-qubit systems, we find that the quantum coherence cannot be protected from noise when the atom interacts with a non-boundary electromagnetic field. However, with the presence of a boundary, the dynamical conditions for the insusceptible of quantum coherence are fulfilled only when the atom is close to the boundary and is transversely polarizable. Otherwise, the quantum coherence can only be protected in some degree in other polarizable direction. -- Highlights: •We study the dynamics of a two-level atom interacting with a bath of fluctuating vacuum electromagnetic field. •For both a single and two-qubit systems, the quantum coherence cannot be protected from noise without a boundary. •The insusceptible of the quantum coherence can be fulfilled only when the atom is close to the boundary and is transversely polarizable. •Otherwise, the quantum coherence can only be protected in some degree in other polarizable direction.
Ramsey interferometry with a two-level generalized Tonks-Girardeau gas
International Nuclear Information System (INIS)
Mousavi, S. V.; Campo, A. del; Lizuain, I.; Muga, J. G.
2007-01-01
We propose a solvable generalization of the Tonks-Girardeau model that describes a coherent one-dimensional (1D) gas of cold two-level bosons which interact with two external fields in a Ramsey interferometer. They also interact among themselves by idealized, infinitely strong contact potentials, with interchange of momentum and internal state. We study the corresponding Ramsey fringes and the quantum projection noise which, essentially unaffected by the interactions, remains that for ideal bosons. The dual system of this gas, an ideal gas of two-level fermions coupled by the interaction with the separated fields, produces the same fringes and noise fluctuations. The cases of time-separated and spatially separated fields are studied. For spatially separated fields the fringes may be broadened slightly by increasing the number of particles, but only for large particle numbers far from present experiments with Tonks-Girardeau gases. The uncertainty in the determination of the atomic transition frequency diminishes, essentially with the inverse root of the particle number. The difficulties to implement the model experimentally and possible shortcomings of strongly interacting 1D gases for frequency standards and atomic clocks are discussed
A Weighted Two-Level Bregman Method with Dictionary Updating for Nonconvex MR Image Reconstruction
Directory of Open Access Journals (Sweden)
Qiegen Liu
2014-01-01
Full Text Available Nonconvex optimization has shown that it needs substantially fewer measurements than l1 minimization for exact recovery under fixed transform/overcomplete dictionary. In this work, two efficient numerical algorithms which are unified by the method named weighted two-level Bregman method with dictionary updating (WTBMDU are proposed for solving lp optimization under the dictionary learning model and subjecting the fidelity to the partial measurements. By incorporating the iteratively reweighted norm into the two-level Bregman iteration method with dictionary updating scheme (TBMDU, the modified alternating direction method (ADM solves the model of pursuing the approximated lp-norm penalty efficiently. Specifically, the algorithms converge after a relatively small number of iterations, under the formulation of iteratively reweighted l1 and l2 minimization. Experimental results on MR image simulations and real MR data, under a variety of sampling trajectories and acceleration factors, consistently demonstrate that the proposed method can efficiently reconstruct MR images from highly undersampled k-space data and presents advantages over the current state-of-the-art reconstruction approaches, in terms of higher PSNR and lower HFEN values.
Detuning-induced stimulated Raman adiabatic passage in dense two-level systems
Deng, Li; Lin, Gongwei; Niu, Yueping; Gong, Shangqing
2018-05-01
We investigate the coherence generation in dense two-level systems under detuning-induced stimulated Raman adiabatic passage (D-STIRAP). In the dense two-level system, the near dipole-dipole (NDD) interaction should be taken into consideration. With the increase in the strength of the NDD interaction, it is found that a switchlike transition of the generated coherence from maximum value to zero appears. Meanwhile, the adiabatic condition of the D-STIRAP is destroyed in the presence of the NDD interaction. In order to avoid the sudden decrease in the generated coherence and maintain the maximum value, we can use stronger detuning pulse or pump pulse, between which increasing the intensity of the detuning pulse is of more efficiency. Except for taking advantage of such maximum coherence in the high density case into areas like enhancing the four-wave mixing process, we also point out that the phenomenon of the coherence transition can be applied as an optical switch.
A novel two-level dynamic parallel data scheme for large 3-D SN calculations
International Nuclear Information System (INIS)
Sjoden, G.E.; Shedlock, D.; Haghighat, A.; Yi, C.
2005-01-01
We introduce a new dynamic parallel memory optimization scheme for executing large scale 3-D discrete ordinates (Sn) simulations on distributed memory parallel computers. In order for parallel transport codes to be truly scalable, they must use parallel data storage, where only the variables that are locally computed are locally stored. Even with parallel data storage for the angular variables, cumulative storage requirements for large discrete ordinates calculations can be prohibitive. To address this problem, Memory Tuning has been implemented into the PENTRAN 3-D parallel discrete ordinates code as an optimized, two-level ('large' array, 'small' array) parallel data storage scheme. Memory Tuning can be described as the process of parallel data memory optimization. Memory Tuning dynamically minimizes the amount of required parallel data in allocated memory on each processor using a statistical sampling algorithm. This algorithm is based on the integral average and standard deviation of the number of fine meshes contained in each coarse mesh in the global problem. Because PENTRAN only stores the locally computed problem phase space, optimal two-level memory assignments can be unique on each node, depending upon the parallel decomposition used (hybrid combinations of angular, energy, or spatial). As demonstrated in the two large discrete ordinates models presented (a storage cask and an OECD MOX Benchmark), Memory Tuning can save a substantial amount of memory per parallel processor, allowing one to accomplish very large scale Sn computations. (authors)
International Nuclear Information System (INIS)
Slavcheva, G.; Hess, O.
2005-01-01
We propose and develop a method for theoretical description of circularly (elliptically) polarized optical pulse resonant coherent interactions with two-level atoms. The method is based on the time-evolution equations of a two-level quantum system in the presence of a time-dependent dipole perturbation for electric dipole transitions between states with total angular-momentum projection difference (ΔJ z =±1) excited by a circularly polarized electromagnetic field [Feynman et al., J. Appl. Phys. 28, 49 (1957)]. The adopted real-vector representation approach allows for coupling with the vectorial Maxwell's equations for the optical wave propagation and thus the resulting Maxwell pseudospin equations can be numerically solved in the time domain without any approximations. The model permits a more exact study of the ultrafast coherent pulse propagation effects taking into account the vector nature of the electromagnetic field and hence the polarization state of the optical excitation. We demonstrate self-induced transparency effects and formation of polarized solitons. The model represents a qualitative extension of the well-known optical Maxwell-Bloch equations valid for linearly polarized light and a tool for studying coherent quantum control mechanisms
Entanglement of a nonlinear two two-level atoms interacting with ...
Indian Academy of Sciences (India)
S Abdel-Khalek
2017-12-08
Dec 8, 2017 ... [4,5], superdense coding [6], quantum cryptography. [7,8] and quantum metrology [9]. These quantum infor- mation tasks cannot be carried out by classical resources and they rely on entangled states. This recognition led to an intensive search for mathematical tools that would enable a proper quantification ...
Wu, Yufeng
2012-03-01
Incomplete lineage sorting can cause incongruence between the phylogenetic history of genes (the gene tree) and that of the species (the species tree), which can complicate the inference of phylogenies. In this article, I present a new coalescent-based algorithm for species tree inference with maximum likelihood. I first describe an improved method for computing the probability of a gene tree topology given a species tree, which is much faster than an existing algorithm by Degnan and Salter (2005). Based on this method, I develop a practical algorithm that takes a set of gene tree topologies and infers species trees with maximum likelihood. This algorithm searches for the best species tree by starting from initial species trees and performing heuristic search to obtain better trees with higher likelihood. This algorithm, called STELLS (which stands for Species Tree InfErence with Likelihood for Lineage Sorting), has been implemented in a program that is downloadable from the author's web page. The simulation results show that the STELLS algorithm is more accurate than an existing maximum likelihood method for many datasets, especially when there is noise in gene trees. I also show that the STELLS algorithm is efficient and can be applied to real biological datasets. © 2011 The Author. Evolution© 2011 The Society for the Study of Evolution.
SUBJECT «NUMBER SYSTEMS» IN TWO-LEVELED FORMAT PREPARATION TEACHERS OF MATHEMATICS
Directory of Open Access Journals (Sweden)
V. I. Igoshin
2017-01-01
Full Text Available The aim of this article is to analyze the format of a two-leveled training – bachelor and master – future teachers of mathematics from the point of view of the content of mathematical material, which is to develop prospective teachers of mathematics at those two levels, shaping their professional competence.Methods. The study involves the theoretical methods: the analysis of pedagogical and methodical literature, normative documents; historical, comparative and logical analysis of the content of pedagogical mathematical education; forecasting, planning and designing of two-leveled methodical system of training of future teachers of mathematics.Results and scientific novelty. The level differentiation of the higher education system requires developing the appropriate curricula for undergraduate and graduate programs. The fundamental principle must be the principle of continuity – the magister must continue to deepen and broaden knowledge and skills, along with competences acquired, developed and formed on the undergraduate level. From these positions, this paper examines the course «Number Systems» – the most important in terms of methodology course for future mathematics teachers, and shows what content should be filled with this course at the undergraduate level and the graduate level. At the undergraduate level it is proposed to study classical number systems – natural, integer, rational, real and complex. Further extensions of the number systems are studied at the graduate level. The theory of numeric systems is presented as a theory of algebraic systems, arising at the intersection of algebra and mathematical logic. Here we study algebras over a field, division algebra over a field, an alternative algebra with division over the field, Jordan algebra, Lie algebra. Comprehension of bases of the theory of algebras by the master of the «mathematical education» profile will promote more conscious
Directory of Open Access Journals (Sweden)
Ning Zhang
2017-01-01
Full Text Available Background: Advanced ankylosing spondylitis is often associated with thoracolumbar kyphosis, resulting in an abnormal spinopelvic balance and pelvic morphology. Different osteotomy techniques have been used to correct AS deformities, unfortunnaly, not all AS patients can gain spinal sagittal balance and good horizontal vision after osteotomy. Materials and Methods: Fourteen consecutive AS patients with severe thoracolumbar kyphosis who were treated with two-level PSO were studied retrospectively. All were male with a mean age of 34.9 ± 9.6 years. The followup ranged from 1–5 years. Preoperative computer simulations using the Surgimap Spinal software were performed for all patients, and the osteotomy level and angle determined from the computer simulation were used surgically. Spinal sagittal parameters were measured preoperatively, after the computer simulation, and postoperatively and included thoracic kyphosis (TK, lumbar lordosis (LL, sagittal vertical axis (SVA, pelvic incidence, pelvic tilt (PT, and sacral slope (SS. The level of correlation between the computer simulation and postoperative parameters was evaluated, and the differences between preoperative and postoperative parameters were compared. The visual analog scale (VAS for back pain and clinical outcome was also assessed. Results: Six cases underwent PSO at L1 and L3, five cases at L2 and T12, and three cases at L3 and T12. TK was corrected from 57.8 ± 15.2° preoperatively to 45.3 ± 7.7° postoperatively (P < 0.05, LL from 9.3 ± 17.5° to −52.3 ± 3.9° (P < 0.001, SVA from 154.5 ± 36.7 to 37.8 ± 8.4 mm (P < 0.001, PT from 43.3 ± 6.1° to 18.0 ± 0.9° (P < 0.001, and SS from 0.8 ± 7.0° to 26.5 ± 10.6° (P < 0.001. The LL, VAS, and PT of the simulated two-level PSO were highly consistent with, or almost the same as, the postoperative parameters. The correlations between the computer simulations and postoperative parameters were significant. The VAS decreased
Comprehensive solutions to the Bloch equations and dynamical models for open two-level systems
Skinner, Thomas E.
2018-01-01
The Bloch equation and its variants constitute the fundamental dynamical model for arbitrary two-level systems. Many important processes, including those in more complicated systems, can be modeled and understood through the two-level approximation. It is therefore of widespread relevance, especially as it relates to understanding dissipative processes in current cutting-edge applications of quantum mechanics. Although the Bloch equation has been the subject of considerable analysis in the 70 years since its inception, there is still, perhaps surprisingly, significant work that can be done. This paper extends the scope of previous analyses. It provides a framework for more fully understanding the dynamics of dissipative two-level systems. A solution is derived that is compact, tractable, and completely general, in contrast to previous results. Any solution of the Bloch equation depends on three roots of a cubic polynomial that are crucial to the time dependence of the system. The roots are typically only sketched out qualitatively, with no indication of their dependence on the physical parameters of the problem. Degenerate roots, which modify the solutions, have been ignored altogether. Here the roots are obtained explicitly in terms of a single real-valued root that is expressed as a simple function of the system parameters. For the conventional Bloch equation, a simple graphical representation of this root is presented that makes evident the explicit time dependence of the system for each point in the parameter space. Several intuitive, visual models of system dynamics are developed. A Euclidean coordinate system is identified in which any generalized Bloch equation is separable, i.e., the sum of commuting rotation and relaxation operators. The time evolution in this frame is simply a rotation followed by relaxation at modified rates that play a role similar to the standard longitudinal and transverse rates. These rates are functions of the applied field, which
AUTHOR|(SzGeCERN)749939
2015-01-01
As the volume of electronically available information grows, relevant items become harder to find. This work presents an approach to personalizing search results in scientific publication databases. This work focuses on re-ranking search results from existing search engines like Solr or ElasticSearch. This work also includes the development of Obelix, a new recommendation system used to re-rank search results. The project was proposed and performed at CERN, using the scientific publications available on the CERN Document Server (CDS). This work experiments with re-ranking using offline and online evaluation of users and documents in CDS. The experiments conclude that the personalized search result outperform both latest first and word similarity in terms of click position in the search result for global search in CDS.
Canyon of current suppression in an interacting two-level quantum dot
DEFF Research Database (Denmark)
Karlström, O; Pedersen, Jonas Nyvold; Samuelsson, P
2011-01-01
Motivated by the recent discovery of a canyon of conductance suppression in a two-level equal-spin quantum dot system [Phys. Rev. Lett. 104, 186804 (2010)], the transport through this system is studied in detail. At low bias and low temperature a strong current suppression is found around...... the electron-hole symmetry point independent of the couplings, in agreement with previous results. By means of a Schrieffer–Wolff transformation we are able to give an intuitive explanation to this suppression in the low-energy regime. In the general situation, numerical simulations are carried out using...... for the current suppression. It is also shown how broadening, interference, and a finite interaction energy cause a shift of the current minimum away from degeneracy. Finally we see how an increased population of the upper level leads to current peaks on each side of the suppression line. At sufficiently high...
Propagation of an attosecond pulse in a dense two-level medium
International Nuclear Information System (INIS)
Song Xiaohong; Gong Shangqing; Yang Weifeng; Xu Zhizhan
2004-01-01
We investigate the propagation of attosecond pulse in a dense two-level medium by using an iterative predictor-corrector finite-difference time-domain method. We find when attosecond pulse is considered, that the standard area theorem will break down even for small area pulses: ideal self-induced transparency cannot occur even for a 2π pulse, while the pulses whose areas are not integer multiples of 2π, such as 1.8π and 2.2π pulses, cannot evolve to 2π pulses as predicted by the standard area theorem. Significantly higher spectra components can occur on all these small area propagating pulses due to strong carrier reshaping. Furthermore, these higher spectral components dependent sensitively on the pulse area: the larger the pulse area is, the more evident are these higher spectral components
Information Entropy Squeezing of a Two-Level Atom Interacting with Two-Mode Coherent Fields
Institute of Scientific and Technical Information of China (English)
LIU Xiao-Juan; FANG Mao-Fa
2004-01-01
From a quantum information point of view we investigate the entropy squeezing properties for a two-level atom interacting with the two-mode coherent fields via the two-photon transition. We discuss the influences of the initial state of the system on the atomic information entropy squeezing. Our results show that the squeezed component number,squeezed direction, and time of the information entropy squeezing can be controlled by choosing atomic distribution angle,the relative phase between the atom and the two-mode field, and the difference of the average photon number of the two field modes, respectively. Quantum information entropy is a remarkable precision measure for the atomic squeezing.
Transmission-line resonators for the study of individual two-level tunneling systems
Brehm, Jan David; Bilmes, Alexander; Weiss, Georg; Ustinov, Alexey V.; Lisenfeld, Jürgen
2017-09-01
Parasitic two-level tunneling systems (TLS) emerge in amorphous dielectrics and constitute a serious nuisance for various microfabricated devices, where they act as a source of noise and decoherence. Here, we demonstrate a new test bed for the study of TLS in various materials which provides access to properties of individual TLS as well as their ensemble response. We terminate a superconducting transmission-line resonator with a capacitor that hosts TLS in its dielectric. By tuning TLS via applied mechanical strain, we observe the signatures of individual TLS strongly coupled to the resonator in its transmission characteristics and extract the coupling components of their dipole moments and energy relaxation rates. The strong and well-defined coupling to the TLS bath results in pronounced resonator frequency fluctuations and excess phase noise, through which we can study TLS ensemble effects such as spectral diffusion, and probe theoretical models of TLS interactions.
Entanglement for a Bimodal Cavity Field Interacting with a Two-Level Atom
International Nuclear Information System (INIS)
Liu Jia; Chen Ziyu; Bu Shenping; Zhang Guofeng
2009-01-01
Negativity has been adopted to investigate the entanglement in a system composed of a two-level atom and a two-mode cavity field. Effects of Kerr-like medium and the number of photon inside the cavity on the entanglement are studied. Our results show that atomic initial state must be superposed, so that the two cavity field modes can be entangled. Moreover, we also conclude that the number of photon in the two cavity mode should be equal. The interaction between modes, namely, the Kerr effect, has a significant negative contribution. Note that the atom frequency and the cavity frequency have an indistinguishable effect, so a corresponding approximation has been made in this article. These results may be useful for quantum information in optics systems.
Energy Technology Data Exchange (ETDEWEB)
Mueller, Clemens [ARC Centre of Excellence for Engineered Quantum Systems, The University of Queensland, Brisbane (Australia); Lisenfeld, Juergen [Physikalisches Institut, Karlsruhe Institute of Technology, Karlsruhe (Germany); Shnirman, Alexander [Institut fuer Theory der Kondensierten Materie, Karlsruhe Institute of Technology, Karlsruhe (Germany); LD Landau Institute for Theoretical Physics, Moscow (Russian Federation); Poletto, Stefano [IBM TJ Watson Research Centre, Yorktown Heights (United States)
2016-07-01
Since the very first experiments, superconducting circuits have suffered from strong coupling to environmental noise, destroying quantum coherence and degrading performance. In state-of-the-art experiments, it is found that the relaxation time of superconducting qubits fluctuates as a function of time. We present measurements of such fluctuations in a 3D-transmon circuit and develop a qualitative model based on interactions within a bath of background two-level systems (TLS) which emerge from defects in the device material. In our model, the time-dependent noise density acting on the qubit emerges from its near-resonant coupling to high-frequency TLS which experience energy fluctuations due to their interaction with thermally fluctuating TLS at low frequencies. We support the model by providing experimental evidence of such energy fluctuations observed in a single TLS in a phase qubit circuit.
Two-Level Hierarchical FEM Method for Modeling Passive Microwave Devices
Polstyanko, Sergey V.; Lee, Jin-Fa
1998-03-01
In recent years multigrid methods have been proven to be very efficient for solving large systems of linear equations resulting from the discretization of positive definite differential equations by either the finite difference method or theh-version of the finite element method. In this paper an iterative method of the multiple level type is proposed for solving systems of algebraic equations which arise from thep-version of the finite element analysis applied to indefinite problems. A two-levelV-cycle algorithm has been implemented and studied with a Gauss-Seidel iterative scheme used as a smoother. The convergence of the method has been investigated, and numerical results for a number of numerical examples are presented.
Estimation of Missing Observations in Two-Level Split-Plot Designs
DEFF Research Database (Denmark)
Almimi, Ashraf A.; Kulahci, Murat; Montgomery, Douglas C.
2008-01-01
Inserting estimates for the missing observations from split-plot designs restores their balanced or orthogonal structure and alleviates the difficulties in the statistical analysis. In this article, we extend a method due to Draper and Stoneman to estimate the missing observations from unreplicated...... two-level factorial and fractional factorial split-plot (FSP and FFSP) designs. The missing observations, which can either be from the same whole plot, from different whole plots, or comprise entire whole plots, are estimated by equating to zero a number of specific contrast columns equal...... to the number of the missing observations. These estimates are inserted into the design table and the estimates for the remaining effects (or alias chains of effects as the case with FFSP designs) are plotted on two half-normal plots: one for the whole-plot effects and the other for the subplot effects...
Thermal analysis of multi-MW two-level wind power converter
DEFF Research Database (Denmark)
Zhou, Dao; Blaabjerg, Frede; Mogens, Lau
2012-01-01
In this paper, the multi-MW wind turbine of partial-scale and full-scale two-level power converter with DFIG and direct-drive PMSG are designed and compared in terms of their thermal performance. Simulations of different configurations regarding loss distribution and junction temperature...... in the power device in the whole range of wind speed are presented and analyzed. It is concluded that in both partial-scale and full-scale power converter the most thermal stressed power device in the generator-side converter will have higher mean junction temperature and larger junction temperature...... fluctuation compared to grid-side converter at the rated wind speed. Moreover, the thermal performance of the generator-side converter in the partial-scale power converter becomes crucial around the synchronous operating point and should be considered carefully....
Two-Level Verification of Data Integrity for Data Storage in Cloud Computing
Xu, Guangwei; Chen, Chunlin; Wang, Hongya; Zang, Zhuping; Pang, Mugen; Jiang, Ping
Data storage in cloud computing can save capital expenditure and relive burden of storage management for users. As the lose or corruption of files stored may happen, many researchers focus on the verification of data integrity. However, massive users often bring large numbers of verifying tasks for the auditor. Moreover, users also need to pay extra fee for these verifying tasks beyond storage fee. Therefore, we propose a two-level verification of data integrity to alleviate these problems. The key idea is to routinely verify the data integrity by users and arbitrate the challenge between the user and cloud provider by the auditor according to the MACs and ϕ values. The extensive performance simulations show that the proposed scheme obviously decreases auditor's verifying tasks and the ratio of wrong arbitration.
Nonlinear Jaynes–Cummings model for two interacting two-level atoms
International Nuclear Information System (INIS)
Santos-Sánchez, O de los; González-Gutiérrez, C; Récamier, J
2016-01-01
In this work we examine a nonlinear version of the Jaynes–Cummings model for two identical two-level atoms allowing for Ising-like and dipole–dipole interplays between them. The model is said to be nonlinear in the sense that it can incorporate both a general intensity-dependent interaction between the atomic system and the cavity field and/or the presence of a nonlinear medium inside the cavity. As an example, we consider a particular type of atom-field coupling based upon the so-called Buck–Sukumar model and a lossless Kerr-like cavity. We describe the possible effects of such features on the evolution of some quantities of current interest, such as atomic excitation, purity, concurrence, the entropy of the field and the evolution of the latter in phase space. (paper)
Two Level Versus Matrix Converters Performance in Wind Energy Conversion Systems Employing DFIG
Reddy, Gongati Pandu Ranga; Kumar, M. Vijaya
2017-10-01
Wind power capacity has received enormous growth during past decades. With substantial development of wind power, it is expected to provide a fifth of world's electricity by the end of 2030. In wind energy conversion system, the power electronic converters play an important role. This paper presents the two level and matrix converters performance in wind energy conversion system employing Doubly Fed Induction Generator (DFIG). The DFIG is a wound rotor induction generator. Because of the advantages of the DFIG over other generators it is being used for most of the wind applications. This paper also discusses control of converters using the space vector pulse width modulation technique. The MATLAB/SIMULINK ® software is used to study the performance of the converters.
Phonon induced optical gain in a current carrying two-level quantum dot
Energy Technology Data Exchange (ETDEWEB)
Eskandari-asl, Amir, E-mail: amir.eskandari.asl@gmail.com [Department of Physics, Shahid Beheshti University, G.C. Evin, Tehran 1983963113 (Iran, Islamic Republic of); School of Nano Science, Institute for Research in Fundamental Sciences (IPM), P.O. Box: 19395-5531, Tehran, Iran (Iran, Islamic Republic of)
2017-05-15
In this work we consider a current carrying two level quantum dot (QD) that is coupled to a single mode phonon bath. Using self-consistent Hartree-Fock approximation, we obtain the I-V curve of QD. By considering the linear response of our system to an incoming classical light, we see that depending on the parametric regime, the system could have weak or strong light absorption or may even show lasing. This lasing occurs at high enough bias voltages and is explained by a population inversion considering side bands, while the total electron population in the higher level is less than the lower one. The frequency at which we have the most significant lasing depends on the level spacing and phonon frequency and not on the electron-phonon coupling strength.
TWO-LEVEL HIERARCHICAL COORDINATION QUEUING METHOD FOR TELECOMMUNICATION NETWORK NODES
Directory of Open Access Journals (Sweden)
M. V. Semenyaka
2014-07-01
Full Text Available The paper presents hierarchical coordination queuing method. Within the proposed method a queuing problem has been reduced to optimization problem solving that was presented as two-level hierarchical structure. The required distribution of flows and bandwidth allocation was calculated at the first level independently for each macro-queue; at the second level solutions obtained on lower level for each queue were coordinated in order to prevent probable network link overload. The method of goal coordination has been determined for multilevel structure managing, which makes it possible to define the order for consideration of queue cooperation restrictions and calculation tasks distribution between levels of hierarchy. Decisions coordination was performed by the method of Lagrange multipliers. The study of method convergence has been carried out by analytical modeling.
On Two-Level State-Dependent Routing Polling Systems with Mixed Service
Directory of Open Access Journals (Sweden)
Guan Zheng
2015-01-01
Full Text Available Based on priority differentiation and efficiency of the system, we consider an N+1 queues’ single-server two-level polling system which consists of one key queue and N normal queues. The novel contribution of the present paper is that we consider that the server just polls active queues with customers waiting in the queue. Furthermore, key queue is served with exhaustive service and normal queues are served with 1-limited service in a parallel scheduling. For this model, we derive an expression for the probability generating function of the joint queue length distribution at polling epochs. Based on these results, we derive the explicit closed-form expressions for the mean waiting time. Numerical examples demonstrate that theoretical and simulation results are identical and the new system is efficient both at key queue and normal queues.
Intensity profiles of superdeformed bands in Pb isotopes in a two-level mixing model
International Nuclear Information System (INIS)
Wilson, A. N.; Szigeti, S. S.; Rogers, J. I.; Davidson, P. M.; Cardamone, D. M.
2009-01-01
A recently developed two-level mixing model of the decay out of superdeformed bands is applied to examine the loss of flux from the yrast superdeformed bands in 192 Pb, 194 Pb, and 196 Pb. Probability distributions for decay to states at normal deformations are calculated at each level. The sensitivity of the results to parameters describing the levels at normal deformation and their coupling to levels in the superdeformed well is explored. It is found that except for narrow ranges of the interaction strength coupling the states, the amount of intensity lost is primarily determined by the ratio of γ decay widths in the normal and superdeformed wells. It is also found that while the model can accommodate the observed fractional intensity loss profiles for decay from bands at relatively high excitation, it cannot accommodate the similarly abrupt decay from bands at lower energies if standard estimates of the properties of the states in the first minimum are employed
Photon echo with a few photons in two-level atoms
International Nuclear Information System (INIS)
Bonarota, M; Dajczgewand, J; Louchet-Chauvet, A; Le Gouët, J-L; Chanelière, T
2014-01-01
To store and retrieve signals at the single photon level, various photon echo schemes have resorted to complex preparation steps involving ancillary shelving states in multi-level atoms. For the first time, we experimentally demonstrate photon echo operation at such a low signal intensity without any preparation step, which allows us to work with mere two-level atoms. This simplified approach relies on the so-coined ‘revival of silenced echo’ (ROSE) scheme. Low noise conditions are obtained by returning the atoms to the ground state before the echo emission. In the present paper we manage ROSE in photon counting conditions, showing that very strong control fields can be compatible with extremely weak signals, making ROSE consistent with quantum memory requirements. (paper)
Dynamical Evolution of an Effective Two-Level System with {\\mathscr{P}}{\\mathscr{T}} Symmetry
Du, Lei; Xu, Zhihao; Yin, Chuanhao; Guo, Liping
2018-05-01
We investigate the dynamics of parity- and time-reversal (PT ) symmetric two-energy-level atoms in the presence of two optical and a radio-frequency (rf) fields. The strength and relative phase of fields can drive the system from unbroken to broken PT symmetric regions. Compared with the Hermitian model, Rabi-type oscillation is still observed, and the oscillation characteristics are also adjusted by the strength and relative phase in the region of unbroken PT symmetry. At exception point (EP), the oscillation breaks down. To better understand the underlying properties we study the effective Bloch dynamics and find the emergence of the z components of the fixed points is the feature of the PT symmetry breaking and the projections in x-y plane can be controlled with high flexibility compared with the standard two-level system with PT symmetry. It helps to study the dynamic behavior of the complex PT symmetric model.
Faithful state transfer between two-level systems via an actively cooled finite-temperature cavity
Sárkány, Lőrinc; Fortágh, József; Petrosyan, David
2018-03-01
We consider state transfer between two qubits—effective two-level systems represented by Rydberg atoms—via a common mode of a microwave cavity at finite temperature. We find that when both qubits have the same coupling strength to the cavity field, at large enough detuning from the cavity mode frequency, quantum interference between the transition paths makes the swap of the excitation between the qubits largely insensitive to the number of thermal photons in the cavity. When, however, the coupling strengths are different, the photon-number-dependent differential Stark shift of the transition frequencies precludes efficient transfer. Nevertheless, using an auxiliary cooling system to continuously extract the cavity photons, we can still achieve a high-fidelity state transfer between the qubits.
Two-level modulation scheme to reduce latency for optical mobile fronthaul networks.
Sung, Jiun-Yu; Chow, Chi-Wai; Yeh, Chien-Hung; Chang, Gee-Kung
2016-10-31
A system using optical two-level orthogonal-frequency-division-multiplexing (OFDM) - amplitude-shift-keying (ASK) modulation is proposed and demonstrated to reduce the processing latency for the optical mobile fronthaul networks. At the proposed remote-radio-head (RRH), the high data rate OFDM signal does not need to be processed, but is directly launched into a high speed photodiode (HSPD) and subsequently emitted by an antenna. Only a low bandwidth PD is needed to recover the low data rate ASK control signal. Hence, it is simple and provides low-latency. Furthermore, transporting the proposed system over the already deployed optical-distribution-networks (ODNs) of passive-optical-networks (PONs) is also demonstrated with 256 ODN split-ratios.
Indoor Semantic Modelling for Routing: The Two-Level Routing Approach for Indoor Navigation
Directory of Open Access Journals (Sweden)
Liu Liu
2017-11-01
Full Text Available Humans perform many activities indoors and they show a growing need for indoor navigation, especially in unfamiliar buildings such as airports, museums and hospitals. Complexity of such buildings poses many challenges for building managers and visitors. Indoor navigation services play an important role in supporting these indoor activities. Indoor navigation covers extensive topics such as: 1 indoor positioning and localization; 2 indoor space representation for navigation model generation; 3 indoor routing computation; 4 human wayfinding behaviours; and 5 indoor guidance (e.g., textual directories. So far, a large number of studies of pedestrian indoor navigation have presented diverse navigation models and routing algorithms/methods. However, the major challenge is rarely referred to: how to represent the complex indoor environment for pedestrians and conduct routing according to the different roles and sizes of users. Such complex buildings contain irregular shapes, large open spaces, complicated obstacles and different types of passages. A navigation model can be very complicated if the indoors are accurately represented. Although most research demonstrates feasible indoor navigation models and related routing methods in regular buildings, the focus is still on a general navigation model for pedestrians who are simplified as circles. In fact, pedestrians represent different sizes, motion abilities and preferences (e.g., described in user profiles, which should be reflected in navigation models and be considered for indoor routing (e.g., relevant Spaces of Interest and Points of Interest. In order to address this challenge, this thesis proposes an innovative indoor modelling and routing approach – two-level routing. It specially targets the case of routing in complex buildings for distinct users. The conceptual (first level uses general free indoor spaces: this is represented by the logical network whose nodes represent the spaces and edges
Categorizing ideas about trees: a tree of trees.
Fisler, Marie; Lecointre, Guillaume
2013-01-01
The aim of this study is to explore whether matrices and MP trees used to produce systematic categories of organisms could be useful to produce categories of ideas in history of science. We study the history of the use of trees in systematics to represent the diversity of life from 1766 to 1991. We apply to those ideas a method inspired from coding homologous parts of organisms. We discretize conceptual parts of ideas, writings and drawings about trees contained in 41 main writings; we detect shared parts among authors and code them into a 91-characters matrix and use a tree representation to show who shares what with whom. In other words, we propose a hierarchical representation of the shared ideas about trees among authors: this produces a "tree of trees." Then, we categorize schools of tree-representations. Classical schools like "cladists" and "pheneticists" are recovered but others are not: "gradists" are separated into two blocks, one of them being called here "grade theoreticians." We propose new interesting categories like the "buffonian school," the "metaphoricians," and those using "strictly genealogical classifications." We consider that networks are not useful to represent shared ideas at the present step of the study. A cladogram is made for showing who is sharing what with whom, but also heterobathmy and homoplasy of characters. The present cladogram is not modelling processes of transmission of ideas about trees, and here it is mostly used to test for proximity of ideas of the same age and for categorization.
Melgar, Miguel A; Tobler, William D; Ernst, Robert J; Raley, Thomas J; Anand, Neel; Miller, Larry E; Nasca, Richard J
2014-01-01
Background Loss of lumbar lordosis has been reported after lumbar interbody fusion surgery and may portend poor clinical and radiographic outcome. The objective of this research was to measure changes in segmental and global lumbar lordosis in patients treated with presacral axial L4-S1 interbody fusion and posterior instrumentation and to determine if these changes influenced patient outcomes. Methods We performed a retrospective, multi-center review of prospectively collected data in 58 consecutive patients with disabling lumbar pain and radiculopathy unresponsive to nonsurgical treatment who underwent L4-S1 interbody fusion with the AxiaLIF two-level system (Baxano Surgical, Raleigh NC). Main outcomes included back pain severity, Oswestry Disability Index (ODI), Odom's outcome criteria, and fusion status using flexion and extension radiographs and computed tomography scans. Segmental (L4-S1) and global (L1-S1) lumbar lordosis measurements were made using standing lateral radiographs. All patients were followed for at least 24 months (mean: 29 months, range 24-56 months). Results There was no bowel injury, vascular injury, deep infection, neurologic complication or implant failure. Mean back pain severity improved from 7.8±1.7 at baseline to 3.3±2.6 at 2 years (p lordosis, defined as a change in Cobb angle ≤ 5°, was identified in 84% of patients at L4-S1 and 81% of patients at L1-S1. Patients with loss or gain in segmental or global lordosis experienced similar 2-year outcomes versus those with less than a 5° change. Conclusions/Clinical Relevance Two-level axial interbody fusion supplemented with posterior fixation does not alter segmental or global lordosis in most patients. Patients with postoperative change in lordosis greater than 5° have similarly favorable long-term clinical outcomes and fusion rates compared to patients with less than 5° lordosis change. PMID:25694920
E. Gregory McPherson; Paula J. Peper
2012-01-01
This paper describes three long-term tree growth studies conducted to evaluate tree performance because repeated measurements of the same trees produce critical data for growth model calibration and validation. Several empirical and process-based approaches to modeling tree growth are reviewed. Modeling is more advanced in the fields of forestry and...
Kevin T. Smith
2009-01-01
Landscape trees have real value and contribute to making livable communities. Making the most of that value requires providing trees with the proper care and attention. As potentially large and long-lived organisms, trees benefit from commitment to regular care that respects the natural tree system. This system captures, transforms, and uses energy to survive, grow,...
Classification and regression trees
Breiman, Leo; Olshen, Richard A; Stone, Charles J
1984-01-01
The methodology used to construct tree structured rules is the focus of this monograph. Unlike many other statistical procedures, which moved from pencil and paper to calculators, this text's use of trees was unthinkable before computers. Both the practical and theoretical sides have been developed in the authors' study of tree methods. Classification and Regression Trees reflects these two sides, covering the use of trees as a data analysis method, and in a more mathematical framework, proving some of their fundamental properties.
DNCON2: improved protein contact prediction using two-level deep convolutional neural networks.
Adhikari, Badri; Hou, Jie; Cheng, Jianlin
2018-05-01
Significant improvements in the prediction of protein residue-residue contacts are observed in the recent years. These contacts, predicted using a variety of coevolution-based and machine learning methods, are the key contributors to the recent progress in ab initio protein structure prediction, as demonstrated in the recent CASP experiments. Continuing the development of new methods to reliably predict contact maps is essential to further improve ab initio structure prediction. In this paper we discuss DNCON2, an improved protein contact map predictor based on two-level deep convolutional neural networks. It consists of six convolutional neural networks-the first five predict contacts at 6, 7.5, 8, 8.5 and 10 Å distance thresholds, and the last one uses these five predictions as additional features to predict final contact maps. On the free-modeling datasets in CASP10, 11 and 12 experiments, DNCON2 achieves mean precisions of 35, 50 and 53.4%, respectively, higher than 30.6% by MetaPSICOV on CASP10 dataset, 34% by MetaPSICOV on CASP11 dataset and 46.3% by Raptor-X on CASP12 dataset, when top L/5 long-range contacts are evaluated. We attribute the improved performance of DNCON2 to the inclusion of short- and medium-range contacts into training, two-level approach to prediction, use of the state-of-the-art optimization and activation functions, and a novel deep learning architecture that allows each filter in a convolutional layer to access all the input features of a protein of arbitrary length. The web server of DNCON2 is at http://sysbio.rnet.missouri.edu/dncon2/ where training and testing datasets as well as the predictions for CASP10, 11 and 12 free-modeling datasets can also be downloaded. Its source code is available at https://github.com/multicom-toolbox/DNCON2/. chengji@missouri.edu. Supplementary data are available at Bioinformatics online.
Formalized Verification of Snapshotable Trees: Separation and Sharing
DEFF Research Database (Denmark)
Mehnert, Hannes; Sieczkowski, Filip; Birkedal, Lars
2012-01-01
We use separation logic to specify and verify a Java program that implements snapshotable search trees, fully formalizing the speci- cation and verication in the Coq proof assistant. We achieve local and modular reasoning about a tree and its snapshots and their iterators, al- though...... for full functional specication and verication, whether by separation logic or by other formalisms....
Verification of Snapshotable Trees using Access Permissions and Typestate
DEFF Research Database (Denmark)
Mehnert, Hannes; Aldrich, Jonathan
2012-01-01
We use access permissions and typestate to specify and ver- ify a Java library that implements snapshotable search trees, as well as some client code. We formalize our approach in the Plural tool, a sound modular typestate checking tool. We describe the challenges to verify- ing snapshotable tree...
Learning Type Extension Trees for Metal Bonding State Prediction
DEFF Research Database (Denmark)
Frasconi, Paolo; Jaeger, Manfred; Passerini, Andrea
2008-01-01
Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities. They can be efficiently learned with a greedy search strategy driven by a generalized relational information gain and a discr......Type Extension Trees (TET) have been recently introduced as an expressive representation language allowing to encode complex combinatorial features of relational entities. They can be efficiently learned with a greedy search strategy driven by a generalized relational information gain...
Speeding Up Neighbour-Joining Tree Construction
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Fagerberg, Rolf; Mailund, Thomas
A widely used method for constructing phylogenetic trees is the neighbour-joining method of Saitou and Nei. We develope heuristics for speeding up the neighbour-joining method which generate the same phylogenetic trees as the original method. All heuristics are based on using a quad-tree to guide...... the search for the next pair of nodes to join, but di#er in the information stored in quad-tree nodes, the way the search is performed, and in the way the quad-tree is updated after a join. We empirically evaluate the performance of the heuristics on distance matrices obtained from the Pfam collection...... of alignments, and compare the running time with that of the QuickTree tool, a well-known and widely used implementation of the standard neighbour-joining method. The results show that the presented heuristics can give a significant speed-up over the standard neighbour-joining method, already for medium sized...
Spectral density of Cooper pairs in two level quantum dot–superconductors Josephson junction
Energy Technology Data Exchange (ETDEWEB)
Dhyani, A., E-mail: archana.d2003@gmail.com [Department of Physics, University of Petroleum and Energy Studies, Dehradun 248007, Uttarakhand (India); Rawat, P.S. [Department of Nuclear Science and Technology, University of Petroleum and Energy Studies, Dehradun 248007, Uttarakhand (India); Tewari, B.S., E-mail: bstewari@ddn.upes.ac.in [Department of Physics, University of Petroleum and Energy Studies, Dehradun 248007, Uttarakhand (India)
2016-09-15
Highlights: • The present work deals with the study of the electronic spectral density of electron pairs and its effect in charge transport in superconductor-quantum dot-superconductor junctions. • The charge transfer across such junctions can be controlled by changing the positions of the dot level. • The Josephson supercurrent can also be tuned by controlling the position of quantum dot energy levels. - Abstract: In the present paper, we report the role of quantum dot energy levels on the electronic spectral density for a two level quantum dot coupled to s-wave superconducting leads. The theoretical arguments in this work are based on the Anderson model so that it necessarily includes dot energies, single particle tunneling and superconducting order parameter for BCS superconductors. The expression for single particle spectral function is obtained by using the Green's function equation of motion technique. On the basis of numerical computation of spectral function of superconducting leads, it has been found that the charge transfer across such junctions can be controlled by the positions and availability of the dot levels.
Induced absorption and stimulated emission in a driven two-level atom
International Nuclear Information System (INIS)
Mavroyannis, C.
1992-01-01
We have considered the induced processes that occur in a driven two-level atom, where a laser photon is absorbed and emitted by the ground and by the excited states of the atom, respectively. In the low-intensity limit of the laser field, the induced spectra arising when a laser photon is absorbed by the ground state of the atom consist of two peaks describing induced absorption and stimulated-emission processes, respectively, where the former prevails over the latter. Asymmetry of the spectral lines occurs at off-resonance and its extent depends on the detuning of the laser field. The physical. process where a laser photon is emitted by the excited state is the reverse of that arising from the absorption of a laser photon by the ground state of the atom. The former differs from the latter in that the emission of a laser photon by the excited state occurs in the low frequency regime and that the stimulated-emission process prevails over that of the induced absorption. In this case, amplification of ultrashort pulses is likely to occur without the need of population inversion between the optical transitions. The computed spectra are graphically presented and discussed. (author)
A distributed monitoring system for photovoltaic arrays based on a two-level wireless sensor network
Su, F. P.; Chen, Z. C.; Zhou, H. F.; Wu, L. J.; Lin, P. J.; Cheng, S. Y.; Li, Y. F.
2017-11-01
In this paper, a distributed on-line monitoring system based on a two-level wireless sensor network (WSN) is proposed for real time status monitoring of photovoltaic (PV) arrays to support the fine management and maintenance of PV power plants. The system includes the sensing nodes installed on PV modules (PVM), sensing and routing nodes installed on combiner boxes of PV sub-arrays (PVA), a sink node and a data management centre (DMC) running on a host computer. The first level WSN is implemented by the low-cost wireless transceiver nRF24L01, and it is used to achieve single hop communication between the PVM nodes and their corresponding PVA nodes. The second level WSN is realized by the CC2530 based ZigBee network for multi-hop communication among PVA nodes and the sink node. The PVM nodes are used to monitor the PVM working voltage and backplane temperature, and they send the acquired data to their PVA node via the nRF24L01 based first level WSN. The PVA nodes are used to monitor the array voltage, PV string current and environment irradiance, and they send the acquired and received data to the DMC via the ZigBee based second level WSN. The DMC is designed using the MATLAB GUIDE and MySQL database. Laboratory experiment results show that the system can effectively acquire, display, store and manage the operating and environment parameters of PVA in real time.
Domain decomposition method of stochastic PDEs: a two-level scalable preconditioner
International Nuclear Information System (INIS)
Subber, Waad; Sarkar, Abhijit
2012-01-01
For uncertainty quantification in many practical engineering problems, the stochastic finite element method (SFEM) may be computationally challenging. In SFEM, the size of the algebraic linear system grows rapidly with the spatial mesh resolution and the order of the stochastic dimension. In this paper, we describe a non-overlapping domain decomposition method, namely the iterative substructuring method to tackle the large-scale linear system arising in the SFEM. The SFEM is based on domain decomposition in the geometric space and a polynomial chaos expansion in the probabilistic space. In particular, a two-level scalable preconditioner is proposed for the iterative solver of the interface problem for the stochastic systems. The preconditioner is equipped with a coarse problem which globally connects the subdomains both in the geometric and probabilistic spaces via their corner nodes. This coarse problem propagates the information quickly across the subdomains leading to a scalable preconditioner. For numerical illustrations, a two-dimensional stochastic elliptic partial differential equation (SPDE) with spatially varying non-Gaussian random coefficients is considered. The numerical scalability of the the preconditioner is investigated with respect to the mesh size, subdomain size, fixed problem size per subdomain and order of polynomial chaos expansion. The numerical experiments are performed on a Linux cluster using MPI and PETSc parallel libraries.
Ranjan, R.; Menon, S.
2018-04-01
The two-level simulation (TLS) method evolves both the large-and the small-scale fields in a two-scale approach and has shown good predictive capabilities in both isotropic and wall-bounded high Reynolds number (Re) turbulent flows in the past. Sensitivity and ability of this modelling approach to predict fundamental features (such as backscatter, counter-gradient turbulent transport, small-scale vorticity, etc.) seen in high Re turbulent flows is assessed here by using two direct numerical simulation (DNS) datasets corresponding to a forced isotropic turbulence at Taylor's microscale-based Reynolds number Reλ ≈ 433 and a fully developed turbulent flow in a periodic channel at friction Reynolds number Reτ ≈ 1000. It is shown that TLS captures the dynamics of local co-/counter-gradient transport and backscatter at the requisite scales of interest. These observations are further confirmed through a posteriori investigation of the flow in a periodic channel at Reτ = 2000. The results reveal that the TLS method can capture both the large- and the small-scale flow physics in a consistent manner, and at a reduced overall cost when compared to the estimated DNS or wall-resolved LES cost.
Robust Methods for Moderation Analysis with a Two-Level Regression Model.
Yang, Miao; Yuan, Ke-Hai
2016-01-01
Moderation analysis has many applications in social sciences. Most widely used estimation methods for moderation analysis assume that errors are normally distributed and homoscedastic. When these assumptions are not met, the results from a classical moderation analysis can be misleading. For more reliable moderation analysis, this article proposes two robust methods with a two-level regression model when the predictors do not contain measurement error. One method is based on maximum likelihood with Student's t distribution and the other is based on M-estimators with Huber-type weights. An algorithm for obtaining the robust estimators is developed. Consistent estimates of standard errors of the robust estimators are provided. The robust approaches are compared against normal-distribution-based maximum likelihood (NML) with respect to power and accuracy of parameter estimates through a simulation study. Results show that the robust approaches outperform NML under various distributional conditions. Application of the robust methods is illustrated through a real data example. An R program is developed and documented to facilitate the application of the robust methods.
Entanglement Criteria of Two Two-Level Atoms Interacting with Two Coupled Modes
Baghshahi, Hamid Reza; Tavassoly, Mohammad Kazem; Faghihi, Mohammad Javad
2015-08-01
In this paper, we study the interaction between two two-level atoms and two coupled modes of a quantized radiation field in the form of parametric frequency converter injecting within an optical cavity enclosed by a medium with Kerr nonlinearity. It is demonstrated that, by applying the Bogoliubov-Valatin canonical transformation, the introduced model is reduced to a well-known form of the generalized Jaynes-Cummings model. Then, under particular initial conditions for the atoms (in a coherent superposition of its ground and upper states) and the fields (in a standard coherent state) which may be prepared, the time evolution of state vector of the entire system is analytically evaluated. In order to understand the degree of entanglement between subsystems (atom-field and atom-atom), the dynamics of entanglement through different measures, namely, von Neumann reduced entropy, concurrence and negativity is evaluated. In each case, the effects of Kerr nonlinearity and detuning parameter on the above measures are numerically analyzed, in detail. It is illustrated that the amount of entanglement can be tuned by choosing the evolved parameters, appropriately.
Multilevel Converter by Cascading Two-Level Three-Phase Voltage Source Converter
Directory of Open Access Journals (Sweden)
Abdullrahman A. Al-Shamma’a
2018-04-01
Full Text Available This paper proposes a topology using isolated, cascaded multilevel voltage source converters (VSCs and employing two-winding magnetic elements for high-power applications. The proposed topology synthesizes 6 two-level, three-phase VSCs, so the power capability of the presented converter is six times the capability of each VSC module. The characteristics of the proposed topology are demonstrated through analyzing its current relationships, voltage relationships and power capability in detail. The power rating is equally shared among the VSC modules without the need for a sharing algorithm; thus, the converter operates as a single three-phase VSC. The comparative analysis with classical neutral-point clamped, flying capacitor and cascaded H-bridge exhibits the superior features of fewer insulated gate bipolar transistors (IGBTs, capacitor requirement and fewer diodes. To validate the theoretical performance of the proposed converter, it is simulated in a MATLAB/Simulink environment and the results are experimentally demonstrated using a laboratory prototype.
Acoustic interactions between inversion symmetric and asymmetric two-level systems
International Nuclear Information System (INIS)
Churkin, A; Schechter, M; Barash, D
2014-01-01
Amorphous solids, as well as many disordered lattices, display remarkable universality in their low temperature acoustic properties. This universality is attributed to the attenuation of phonons by tunneling two-level systems (TLSs), facilitated by the interaction of the TLSs with the phonon field. TLS-phonon interaction also mediates effective TLS–TLS interactions, which dictates the existence of a glassy phase and its low energy properties. Here we consider KBr:CN, the archetypal disordered lattice showing universality. We calculate numerically, using conjugate gradients method, the effective TLS–TLS interactions for inversion symmetric (CN flips) and asymmetric (CN rotations) TLSs, in the absence and presence of disorder, in two and three dimensions. The observed dependence of the magnitude and spatial power law of the interaction on TLS symmetry, and its change with disorder, characterizes TLS–TLS interactions in disordered lattices in both extreme and moderate dilutions. Our results are in good agreement with the two-TLS model, recently introduced to explain long-standing questions regarding the quantitative universality of phonon attenuation and the energy scale of ≈1–3 K below which universality is observed. (paper)
International Nuclear Information System (INIS)
Marquette, Ian; Links, Jon
2012-01-01
We study the Bethe ansatz/ordinary differential equation (BA/ODE) correspondence for Bethe ansatz equations that belong to a certain class of coupled, nonlinear, algebraic equations. Through this approach we numerically obtain the generalized Heine–Stieltjes and Van Vleck polynomials in the degenerate, two-level limit for four cases of integrable Bardeen–Cooper–Schrieffer (BCS) pairing models. These are the s-wave pairing model, the p + ip-wave pairing model, the p + ip pairing model coupled to a bosonic molecular pair degree of freedom, and a newly introduced extended d + id-wave pairing model with additional interactions. The zeros of the generalized Heine–Stieltjes polynomials provide solutions of the corresponding Bethe ansatz equations. We compare the roots of the ground states with curves obtained from the solution of a singular integral equation approximation, which allows for a characterization of ground-state phases in these systems. Our techniques also permit the computation of the roots of the excited states. These results illustrate how the BA/ODE correspondence can be used to provide new numerical methods to study a variety of integrable systems. (paper)
SPONGY (SPam ONtoloGY: Email Classification Using Two-Level Dynamic Ontology
Directory of Open Access Journals (Sweden)
Seongwook Youn
2014-01-01
Full Text Available Email is one of common communication methods between people on the Internet. However, the increase of email misuse/abuse has resulted in an increasing volume of spam emails over recent years. An experimental system has been designed and implemented with the hypothesis that this method would outperform existing techniques, and the experimental results showed that indeed the proposed ontology-based approach improves spam filtering accuracy significantly. In this paper, two levels of ontology spam filters were implemented: a first level global ontology filter and a second level user-customized ontology filter. The use of the global ontology filter showed about 91% of spam filtered, which is comparable with other methods. The user-customized ontology filter was created based on the specific user’s background as well as the filtering mechanism used in the global ontology filter creation. The main contributions of the paper are (1 to introduce an ontology-based multilevel filtering technique that uses both a global ontology and an individual filter for each user to increase spam filtering accuracy and (2 to create a spam filter in the form of ontology, which is user-customized, scalable, and modularized, so that it can be embedded to many other systems for better performance.
Quasiparticle-induced decoherence of microscopic two-level-systems in superconducting qubits
Energy Technology Data Exchange (ETDEWEB)
Bilmes, Alexander; Lisenfeld, Juergen; Zanker, Sebastian; Weiss, Georg; Ustinov, Alexey V. [PHI, KIT, Karlsruhe (Germany); Marthaler, Michael; Schoen, Gerd [TFP, KIT, Karlsruhe (Germany)
2016-07-01
Parasitic Two-Level-Systems (TLS) are one of the main sources of decoherence in superconducting nano-scale devices such as SQUIDs, resonators and quantum bits (qubits), although the TLS' microscopic nature remains unclear. We use a superconducting phase qubit to detect TLS contained within the tunnel barrier of the qubit's Al/AlOx/Al Josephson junction. If the TLS transition frequency lies within the 6-10 GHz range, we can coherently drive it by resonant microwave pulses and access its quantum state by utilizing the strong coupling to the qubit. Our previous measurements of TLS coherence in dependence of the temperature indicate that quasiparticles (QPs), which diffuse from the superconducting Al electrodes into the oxide layer, may give rise to TLS energy loss and dephasing. Here, we probe the TLS-QP interaction using a reliable method of in-situ QP injection via an on-chip dc-SQUID that is pulse-biased beyond its switching current. The QP density is calibrated by measuring associated characteristic changes to the qubit's energy relaxation rate. We will present experimental data which show the QP-induced TLS decoherence in good agreement to theoretical predictions.
Amplification without inversion, fast light and optical bistability in a duplicated two-level system
International Nuclear Information System (INIS)
Ebrahimi Zohravi, Lida; Vafafard, Azar; Mahmoudi, Mohammad
2014-01-01
The optical properties of a weak probe field in a duplicated two-level system are investigated in multi-photon resonance (MPR) condition and beyond it. It is shown that by changing the relative phase of applied fields, the absorption switches to the amplification without inversion in MPR condition. By applying the Floquet decomposition to the equations of motion beyond MPR condition, it is shown that the phase-dependent behavior is valid only in MPR condition. Moreover, it is demonstrated that the group velocity of light pulse can be controlled by the intensity of the applied fields and the gain-assisted superluminal light propagation (fast light) is obtained in this system. In addition, the optical bistability (OB) behavior of the system is studied beyond MPR condition. We apply an indirect incoherent pumping field to the system and it is found that the group velocity and OB behavior of the system can be controlled by the incoherent pumping rate. - Highlights: • We studied the optical properties of DTL system under MPR condition and beyond it. • By changing the relative phase, the absorption switches to the amplification without inversion in MPR condition. • The gain-assisted superluminal light propagation (fast light) is obtained in this system. • The optical bistability (OB) behavior of the system is studied beyond MPR condition. • The incoherent pumping rate has a major role in controlling the group velocity and OB behavior of the system
Automatic QRS complex detection using two-level convolutional neural network.
Xiang, Yande; Lin, Zhitao; Meng, Jianyi
2018-01-29
The QRS complex is the most noticeable feature in the electrocardiogram (ECG) signal, therefore, its detection is critical for ECG signal analysis. The existing detection methods largely depend on hand-crafted manual features and parameters, which may introduce significant computational complexity, especially in the transform domains. In addition, fixed features and parameters are not suitable for detecting various kinds of QRS complexes under different circumstances. In this study, based on 1-D convolutional neural network (CNN), an accurate method for QRS complex detection is proposed. The CNN consists of object-level and part-level CNNs for extracting different grained ECG morphological features automatically. All the extracted morphological features are used by multi-layer perceptron (MLP) for QRS complex detection. Additionally, a simple ECG signal preprocessing technique which only contains difference operation in temporal domain is adopted. Based on the MIT-BIH arrhythmia (MIT-BIH-AR) database, the proposed detection method achieves overall sensitivity Sen = 99.77%, positive predictivity rate PPR = 99.91%, and detection error rate DER = 0.32%. In addition, the performance variation is performed according to different signal-to-noise ratio (SNR) values. An automatic QRS detection method using two-level 1-D CNN and simple signal preprocessing technique is proposed for QRS complex detection. Compared with the state-of-the-art QRS complex detection approaches, experimental results show that the proposed method acquires comparable accuracy.
A Two-Level Task Scheduler on Multiple DSP System for OpenCL
Directory of Open Access Journals (Sweden)
Li Tian
2014-04-01
Full Text Available This paper addresses the problem that multiple DSP system does not support OpenCL programming. With the compiler, runtime, and the kernel scheduler proposed, an OpenCL application becomes portable not only between multiple CPU and GPU, but also between embedded multiple DSP systems. Firstly, the LLVM compiler was imported for source-to-source translation in which the translated source was supported by CCS. Secondly, two-level schedulers were proposed to support efficient OpenCL kernel execution. The DSP/BIOS is used to schedule system level tasks such as interrupts and drivers; however, the synchronization mechanism resulted in heavy overhead during task switching. So we designed an efficient second level scheduler especially for OpenCL kernel work-item scheduling. The context switch process utilizes the 8 functional units and cross path links which was superior to DSP/BIOS in the aspect of task switching. Finally, dynamic loading and software managed CACHE were redesigned for OpenCL running on multiple DSP system. We evaluated the performance using some common OpenCL kernels from NVIDIA, AMD, NAS, and Parboil benchmarks. Experimental results show that the DSP OpenCL can efficiently exploit the computing resource of multiple cores.
Two-level image authentication by two-step phase-shifting interferometry and compressive sensing
Zhang, Xue; Meng, Xiangfeng; Yin, Yongkai; Yang, Xiulun; Wang, Yurong; Li, Xianye; Peng, Xiang; He, Wenqi; Dong, Guoyan; Chen, Hongyi
2018-01-01
A two-level image authentication method is proposed; the method is based on two-step phase-shifting interferometry, double random phase encoding, and compressive sensing (CS) theory, by which the certification image can be encoded into two interferograms. Through discrete wavelet transform (DWT), sparseness processing, Arnold transform, and data compression, two compressed signals can be generated and delivered to two different participants of the authentication system. Only the participant who possesses the first compressed signal attempts to pass the low-level authentication. The application of Orthogonal Match Pursuit CS algorithm reconstruction, inverse Arnold transform, inverse DWT, two-step phase-shifting wavefront reconstruction, and inverse Fresnel transform can result in the output of a remarkable peak in the central location of the nonlinear correlation coefficient distributions of the recovered image and the standard certification image. Then, the other participant, who possesses the second compressed signal, is authorized to carry out the high-level authentication. Therefore, both compressed signals are collected to reconstruct the original meaningful certification image with a high correlation coefficient. Theoretical analysis and numerical simulations verify the feasibility of the proposed method.
SPONGY (SPam ONtoloGY): email classification using two-level dynamic ontology.
Youn, Seongwook
2014-01-01
Email is one of common communication methods between people on the Internet. However, the increase of email misuse/abuse has resulted in an increasing volume of spam emails over recent years. An experimental system has been designed and implemented with the hypothesis that this method would outperform existing techniques, and the experimental results showed that indeed the proposed ontology-based approach improves spam filtering accuracy significantly. In this paper, two levels of ontology spam filters were implemented: a first level global ontology filter and a second level user-customized ontology filter. The use of the global ontology filter showed about 91% of spam filtered, which is comparable with other methods. The user-customized ontology filter was created based on the specific user's background as well as the filtering mechanism used in the global ontology filter creation. The main contributions of the paper are (1) to introduce an ontology-based multilevel filtering technique that uses both a global ontology and an individual filter for each user to increase spam filtering accuracy and (2) to create a spam filter in the form of ontology, which is user-customized, scalable, and modularized, so that it can be embedded to many other systems for better performance.
Crises-induced intermittencies in a coherently driven system of two-level atoms
International Nuclear Information System (INIS)
Pando L, C.L.; Perez, G.; Cerdeira, H.A.
1993-04-01
We study the coherent dynamics of a thin layer of two-level atoms driven by an external coherent field and a phase conjugated mirror (PCM). Since the variables of the system are defined on the Bloch sphere, the third dimension is provided by the temporal modulation of the Rabi frequencies, which are induced by a PCM which reflects an electric field with a carrier frequency different from the incident one. We show that as the PCM gain coefficient is changed period doubling leading to chaos occurs. We find crises of attractor merging and attractor widening types related to homoclinic and heteroclinic tangencies respectively. For the attractor merging crises we find the critical exponent for the characteristic time of intermittency versus the control parameter which is given by the gain coefficient of the PCM. We show that during the crises of attractor widening type, another crisis due to attractor destruction occurs as the control parameter is changed. The latter is due to the collision of the old attractor with its basin boundary when a new attractor is created. This new attractor is stable only in a very small interval in the neighborhood of this second crisis. (author). 31 refs, 15 figs
Dynamics of a quantum two-level system under the action of phase-diffusion field
Energy Technology Data Exchange (ETDEWEB)
Sobakinskaya, E.A. [Institute for Physics of Microstructures of RAS, Nizhny Novgorod, 603950 (Russian Federation); Pankratov, A.L., E-mail: alp@ipm.sci-nnov.ru [Institute for Physics of Microstructures of RAS, Nizhny Novgorod, 603950 (Russian Federation); Vaks, V.L. [Institute for Physics of Microstructures of RAS, Nizhny Novgorod, 603950 (Russian Federation)
2012-01-09
We study a behavior of quantum two-level system, interacting with noisy phase-diffusion field. The dynamics is shown to split into two regimes, determined by the coherence time of the phase-diffusion field. For both regimes we present a model of quantum system behavior and discuss possible applications of the obtained effect for spectroscopy. In particular, the obtained analytical formula for the macroscopic polarization demonstrates that the phase-diffusion field does not affect the absorption line shape, which opens up an intriguing possibility of noisy spectroscopy, based on broadband sources with Lorentzian line shape. -- Highlights: ► We study dynamics of quantum system interacting with noisy phase-diffusion field. ► At short times the phase-diffusion field induces polarization in the quantum system. ► At long times the noise leads to polarization decay and heating of a quantum system. ► Simple model of interaction is derived. ► Application of the described effects for spectroscopy is discussed.
Injury patterns of child abuse: Experience of two Level 1 pediatric trauma centers.
Yu, Yangyang R; DeMello, Annalyn S; Greeley, Christopher S; Cox, Charles S; Naik-Mathuria, Bindi J; Wesson, David E
2018-05-01
This study examines non-accidental trauma (NAT) fatalities as a percentage of all injury fatalities and identifies injury patterns in NAT admissions to two level 1 pediatric trauma centers. We reviewed all children (<5years old) treated for NAT from 2011 to 2015. Patient demographics, injury sites, and survival were obtained from both institutional trauma registries. Of 4623 trauma admissions, 557 (12%) were due to NAT. However, 43 (46%) of 93 overall trauma fatalities were due to NAT. Head injuries were the most common injuries sustained (60%) and led to the greatest increased risk of death (RR 5.1, 95% CI 2.0-12.7). Less common injuries that increased the risk of death were facial injuries (14%, RR 2.9, 95% CI 1.6-5.3), abdominal injuries (8%, RR 2.8, 95% CI 1.4-5.6), and spinal injuries (3%, RR 3.9, 95% CI 1.8-8.8). Although 76% of head injuries occurred in infants <1year, children ages 1-4years old with head injuries had a significantly higher case fatality rate (27% vs. 6%, p<0.001). Child abuse accounts for a large proportion of trauma fatalities in children under 5years of age. Intracranial injuries are common in child abuse and increase the risk of death substantially. Preventing NAT in infants and young children should be a public health priority. Retrospective Review. II. Copyright © 2018. Published by Elsevier Inc.
Bayesian feedback versus Markovian feedback in a two-level atom
International Nuclear Information System (INIS)
Wiseman, H.M.; Mancini, Stefano; Wang Jin
2002-01-01
We compare two different approaches to the control of the dynamics of a continuously monitored open quantum system. The first is Markovian feedback, as introduced in quantum optics by Wiseman and Milburn [Phys. Rev. Lett. 70, 548 (1993)]. The second is feedback based on an estimate of the system state, developed recently by Doherty and Jacobs [Phys. Rev. A 60, 2700 (1999)]. Here we choose to call it, for brevity, Bayesian feedback. For systems with nonlinear dynamics, we expect these two methods of feedback control to give markedly different results. The simplest possible nonlinear system is a driven and damped two-level atom, so we choose this as our model system. The monitoring is taken to be homodyne detection of the atomic fluorescence, and the control is by modulating the driving. The aim of the feedback in both cases is to stabilize the internal state of the atom as close as possible to an arbitrarily chosen pure state, in the presence of inefficient detection and other forms of decoherence. Our results (obtained without recourse to stochastic simulations) prove that Bayesian feedback is never inferior, and is usually superior, to Markovian feedback. However, it would be far more difficult to implement than Markovian feedback and it loses its superiority when obvious simplifying approximations are made. It is thus not clear which form of feedback would be better in the face of inevitable experimental imperfections
Risk Analysis of a Two-Level Supply Chain Subject to Misplaced Inventory
Directory of Open Access Journals (Sweden)
Lijing Zhu
2017-06-01
Full Text Available Misplaced inventory is prevalent in retail stores and may lead to the overall poor performance of the supply chain. We explore the impact of misplaced inventory on a two-level supply chain, which consists of a risk-neutral supplier and a risk-averse retailer. The supplier decides the wholesale price to maximize her profit, whereas the retailer decides the order quantity to maximize his utility. Under the Conditional Value-at-Risk (CVaR criterion, we formulate the problem as a Stackelberg game model and obtain the equilibrium solutions in three cases: (i information asymmetry about inventory errors exists; (ii the retailer shares information about inventory errors with the supplier; and (iii in order to reduce misplaced inventory, the supply chain deploys Radio-Frequency Identification (RFID technology. The benefits of information sharing and RFID implementation are explored. A revenue and cost sharing contract is proposed to coordinate the supply chain and to allocate the cost savings from RFID implementation among supply chain participants. Finally, we provide managerial insights for risk-averse decision makers that are considering investing in the RFID technology.
Testing a Quantum Heat Pump with a Two-Level Spin
Directory of Open Access Journals (Sweden)
Luis A. Correa
2016-04-01
Full Text Available Once in its non-equilibrium steady state, a nanoscale system coupled to several heat baths may be thought of as a “quantum heat pump”. Depending on the direction of its stationary heat flows, it may function as, e.g., a refrigerator or a heat transformer. These continuous heat devices can be arbitrarily complex multipartite systems, and yet, their working principle is always the same: they are made up of several elementary three-level stages operating in parallel. As a result, it is possible to devise external “black-box” testing strategies to learn about their functionality and performance regardless of any internal details. In particular, one such heat pump can be tested by coupling a two-level spin to one of its “contact transitions”. The steady state of this external probe contains information about the presence of heat leaks and internal dissipation in the device and, also, about the direction of its steady-state heat currents. Provided that the irreversibility of the heat pump is low, one can further estimate its coefficient of performance. These techniques may find applications in the emerging field of quantum thermal engineering, as they facilitate the diagnosis and design optimization of complex thermodynamic cycles.
SPONGY (SPam ONtoloGY): Email Classification Using Two-Level Dynamic Ontology
2014-01-01
Email is one of common communication methods between people on the Internet. However, the increase of email misuse/abuse has resulted in an increasing volume of spam emails over recent years. An experimental system has been designed and implemented with the hypothesis that this method would outperform existing techniques, and the experimental results showed that indeed the proposed ontology-based approach improves spam filtering accuracy significantly. In this paper, two levels of ontology spam filters were implemented: a first level global ontology filter and a second level user-customized ontology filter. The use of the global ontology filter showed about 91% of spam filtered, which is comparable with other methods. The user-customized ontology filter was created based on the specific user's background as well as the filtering mechanism used in the global ontology filter creation. The main contributions of the paper are (1) to introduce an ontology-based multilevel filtering technique that uses both a global ontology and an individual filter for each user to increase spam filtering accuracy and (2) to create a spam filter in the form of ontology, which is user-customized, scalable, and modularized, so that it can be embedded to many other systems for better performance. PMID:25254240
DEFF Research Database (Denmark)
Insinga, Andrea R.; Sundaram, Aarthi; Hazelton, Drew W.
2018-01-01
The two level undercut-profile substrate (2LUPS) has been introduced as a concept for subdividing rare-earth-Ba$_{2}$Cu$_{3}$O$_{7}$ (REBCO) coated conductors (CC) into narrow filaments which reduces the AC losses and improves field stability for DC magnets. The 2LUPS consists of two levels...
Building Very Large Neighbour-Joining Trees
DEFF Research Database (Denmark)
Simonsen, Martin; Mailund, Thomas; Pedersen, Christian Nørgaard Storm
2010-01-01
, and the NJ method in general, becomes a problem when inferring phylogenies with 10000+ taxa. In this paper we present two extentions of RapidNJ which reduce memory requirements and enable RapidNJ to infer very large phylogenetic trees efficiently. We also present an improved search heuristic for Rapid...
International Nuclear Information System (INIS)
Haasl, D.F.; Roberts, N.H.; Vesely, W.E.; Goldberg, F.F.
1981-01-01
This handbook describes a methodology for reliability analysis of complex systems such as those which comprise the engineered safety features of nuclear power generating stations. After an initial overview of the available system analysis approaches, the handbook focuses on a description of the deductive method known as fault tree analysis. The following aspects of fault tree analysis are covered: basic concepts for fault tree analysis; basic elements of a fault tree; fault tree construction; probability, statistics, and Boolean algebra for the fault tree analyst; qualitative and quantitative fault tree evaluation techniques; and computer codes for fault tree evaluation. Also discussed are several example problems illustrating the basic concepts of fault tree construction and evaluation
Top-k Keyword Search Over Graphs Based On Backward Search
Directory of Open Access Journals (Sweden)
Zeng Jia-Hui
2017-01-01
Full Text Available Keyword search is one of the most friendly and intuitive information retrieval methods. Using the keyword search to get the connected subgraph has a lot of application in the graph-based cognitive computation, and it is a basic technology. This paper focuses on the top-k keyword searching over graphs. We implemented a keyword search algorithm which applies the backward search idea. The algorithm locates the keyword vertices firstly, and then applies backward search to find rooted trees that contain query keywords. The experiment shows that query time is affected by the iteration number of the algorithm.
Mary Torsello; Toni McLellan
The goals of hazard tree management programs are to maximize public safety and maintain a healthy sustainable tree resource. Although hazard tree management frequently targets removal of trees or parts of trees that attract wildlife, it can take into account a diversity of tree values. With just a little extra planning, hazard tree management can be highly beneficial...
Cornière (de), Alexandre
2016-01-01
Search engines enable advertisers to target consumers based on the query they have entered. In a framework with horizontal product differentiation, imperfect product information and in which consumers incur search costs, I study a game in which advertisers have to choose a price and a set of relevant keywords. The targeting mechanism brings about three kinds of efficiency gains, namely lower search costs, better matching, and more intense product market price-competition. A monopolistic searc...
DEFF Research Database (Denmark)
Baumbach, Jan; Guo, Jiong; Ibragimov, Rashid
2015-01-01
We study the tree edit distance problem with edge deletions and edge insertions as edit operations. We reformulate a special case of this problem as Covering Tree with Stars (CTS): given a tree T and a set of stars, can we connect the stars in by adding edges between them such that the resulting...... tree is isomorphic to T? We prove that in the general setting, CST is NP-complete, which implies that the tree edit distance considered here is also NP-hard, even when both input trees having diameters bounded by 10. We also show that, when the number of distinct stars is bounded by a constant k, CTS...
Tunkelang, Daniel
2009-01-01
We live in an information age that requires us, more than ever, to represent, access, and use information. Over the last several decades, we have developed a modern science and technology for information retrieval, relentlessly pursuing the vision of a "memex" that Vannevar Bush proposed in his seminal article, "As We May Think." Faceted search plays a key role in this program. Faceted search addresses weaknesses of conventional search approaches and has emerged as a foundation for interactive information retrieval. User studies demonstrate that faceted search provides more
Lambda-Based Data Processing Architecture for Two-Level Load Forecasting in Residential Buildings
Directory of Open Access Journals (Sweden)
Gde Dharma Nugraha
2018-03-01
Full Text Available Building energy management systems (BEMS have been intensively used to manage the electricity consumption of residential buildings more efficiently. However, the dynamic behavior of the occupants introduces uncertainty problems that affect the performance of the BEMS. To address this uncertainty problem, the BEMS may implement load forecasting as one of the BEMS modules. Load forecasting utilizes historical load data to compute model predictions for a specific time in the future. Recently, smart meters have been introduced to collect electricity consumption data. Smart meters not only capture aggregation data, but also individual data that is more frequently close to real-time. The processing of both smart meter data types for load forecasting can enhance the performance of the BEMS when confronted with uncertainty problems. The collection of smart meter data can be processed using a batch approach for short-term load forecasting, while the real-time smart meter data can be processed for very short-term load forecasting, which adjusts the short-term load forecasting to adapt to the dynamic behavior of the occupants. This approach requires different data processing techniques for aggregation and individual of smart meter data. In this paper, we propose Lambda-based data processing architecture to process the different types of smart meter data and implement the two-level load forecasting approach, which combines short-term and very short-term load forecasting techniques on top of our proposed data processing architecture. The proposed approach is expected to enhance the BEMS to address the uncertainty problem in order to process data in less time. Our experiment showed that the proposed approaches improved the accuracy by 7% compared to a typical BEMS with only one load forecasting technique, and had the lowest computation time when processing the smart meter data.
Absorption spectrum of a two-level atom in a bad cavity with injected squeezed vacuum
Zhou, Peng; Swain, S.
1996-02-01
We study the absorption spectrum of a coherently driven two-level atom interacting with a resonant cavity mode which is coupled to a broadband squeezed vacuum through its input-output mirror in the bad cavity limit. We study the modification of the two-photon correlation strength of the injected squeezed vacuum inside the cavity, and show that the equations describing probe absorption in the cavity environment are formally identical to these in free space, but with modified parameters describing the squeezed vacuum. The two photon correlations induced by the squeezed vacuum are always weaker than in free space. We pay particular attention to the spectral behaviour at line centre in the region of intermediate trength driving intensities, where anomalous spectral features such as hole-burning and dispersive profiles are displayed. These unusual spectral features are very sensitive to the squeezing phase and the Rabi frequency of the driving field. We also derive the threshold value of the Rabi frequency which gives rise to the transparency of the probe beam at the driving frequency. When the Rabi frequency is less than the threshold value, the probe beam is absorbed, whilst the probe beam is amplified (without population inversion under certain conditions) when the Rabi frequency is larger than this threshold. The anomalous spectral features all take place in the vicinity of the critical point dividing the different dynamical regimes, probe absorption and amplification, of the atomic radiation. The physical origin of the strong amplification without population inversion, and the feasibility of observing it, are discussed.
A two level mutation-selection model of cultural evolution and diversity.
Salazar-Ciudad, Isaac
2010-11-21
Cultural evolution is a complex process that can happen at several levels. At the level of individuals in a population, each human bears a set of cultural traits that he or she can transmit to its offspring (vertical transmission) or to other members of his or her society (horizontal transmission). The relative frequency of a cultural trait in a population or society can thus increase or decrease with the relative reproductive success of its bearers (individual's level) or the relative success of transmission (called the idea's level). This article presents a mathematical model on the interplay between these two levels. The first aim of this article is to explore when cultural evolution is driven by the idea's level, when it is driven by the individual's level and when it is driven by both. These three possibilities are explored in relation to (a) the amount of interchange of cultural traits between individuals, (b) the selective pressure acting on individuals, (c) the rate of production of new cultural traits, (d) the individual's capacity to remember cultural traits and to the population size. The aim is to explore the conditions in which cultural evolution does not lead to a better adaptation of individuals to the environment. This is to contrast the spread of fitness-enhancing ideas, which make individual bearers better adapted to the environment, to the spread of "selfish" ideas, which spread well simply because they are easy to remember but do not help their individual bearers (and may even hurt them). At the same time this article explores in which conditions the adaptation of individuals is maximal. The second aim is to explore how these factors affect cultural diversity, or the amount of different cultural traits in a population. This study suggests that a larger interchange of cultural traits between populations could lead to cultural evolution not improving the adaptation of individuals to their environment and to a decrease of cultural diversity
Helping to increase tree crops
Energy Technology Data Exchange (ETDEWEB)
NONE
1970-07-01
Tree crops such as coffee, coconuts, palm oil, citrus fruits and cocoa are of major importance to the economies of countries in Africa, Asia and Latin America, and may be a prime source of foreign exchange earnings. The search for ways to improve efficiently the yields of crops like these - now being aided by the Division of Atomic Energy in Food and Agriculture operated jointly with the Food and Agriculture Organization - thus has a clearly defined practical goal. D. Nethsinghe deals here with some of the work. (author)
Helping to increase tree crops
International Nuclear Information System (INIS)
1970-01-01
Tree crops such as coffee, coconuts, palm oil, citrus fruits and cocoa are of major importance to the economies of countries in Africa, Asia and Latin America, and may be a prime source of foreign exchange earnings. The search for ways to improve efficiently the yields of crops like these - now being aided by the Division of Atomic Energy in Food and Agriculture operated jointly with the Food and Agriculture Organization - thus has a clearly defined practical goal. D. Nethsinghe deals here with some of the work. (author)
IND - THE IND DECISION TREE PACKAGE
Buntine, W.
1994-01-01
A common approach to supervised classification and prediction in artificial intelligence and statistical pattern recognition is the use of decision trees. A tree is "grown" from data using a recursive partitioning algorithm to create a tree which has good prediction of classes on new data. Standard algorithms are CART (by Breiman Friedman, Olshen and Stone) and ID3 and its successor C4 (by Quinlan). As well as reimplementing parts of these algorithms and offering experimental control suites, IND also introduces Bayesian and MML methods and more sophisticated search in growing trees. These produce more accurate class probability estimates that are important in applications like diagnosis. IND is applicable to most data sets consisting of independent instances, each described by a fixed length vector of attribute values. An attribute value may be a number, one of a set of attribute specific symbols, or it may be omitted. One of the attributes is delegated the "target" and IND grows trees to predict the target. Prediction can then be done on new data or the decision tree printed out for inspection. IND provides a range of features and styles with convenience for the casual user as well as fine-tuning for the advanced user or those interested in research. IND can be operated in a CART-like mode (but without regression trees, surrogate splits or multivariate splits), and in a mode like the early version of C4. Advanced features allow more extensive search, interactive control and display of tree growing, and Bayesian and MML algorithms for tree pruning and smoothing. These often produce more accurate class probability estimates at the leaves. IND also comes with a comprehensive experimental control suite. IND consists of four basic kinds of routines: data manipulation routines, tree generation routines, tree testing routines, and tree display routines. The data manipulation routines are used to partition a single large data set into smaller training and test sets. The
African Journals Online (AJOL)
Search tips: Search terms are case-insensitive; Common words are ignored; By default only articles containing all terms in the query are returned (i.e., AND is implied); Combine multiple words with OR to find articles containing either term; e.g., education OR research; Use parentheses to create more complex queries; e.g., ...
2011-03-01
To minimize the severity of run-off-road collisions of vehicles with trees, departments of transportation (DOTs) : commonly establish clear zones for trees and other fixed objects. Caltrans clear zone on freeways is 30 feet : minimum (40 feet pref...
Minnesota's Forest Trees. Revised.
Miles, William R.; Fuller, Bruce L.
This bulletin describes 46 of the more common trees found in Minnesota's forests and windbreaks. The bulletin contains two tree keys, a summer key and a winter key, to help the reader identify these trees. Besides the two keys, the bulletin includes an introduction, instructions for key use, illustrations of leaf characteristics and twig…
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Sioutas, Spyros; Pantazos, Kostas
2015-01-01
We present a new overlay, called the Deterministic Decentralized tree (D2-tree). The D2-tree compares favorably to other overlays for the following reasons: (a) it provides matching and better complexities, which are deterministic for the supported operations; (b) the management of nodes (peers...
DEFF Research Database (Denmark)
Baumbach, Jan; Guo, Jian-Ying; Ibragimov, Rashid
2013-01-01
We study the tree edit distance problem with edge deletions and edge insertions as edit operations. We reformulate a special case of this problem as Covering Tree with Stars (CTS): given a tree T and a set of stars, can we connect the stars in by adding edges between them such that the resulting ...
Sweeney, Debra; Rounds, Judy
2011-01-01
Trees are great inspiration for artists. Many art teachers find themselves inspired and maybe somewhat obsessed with the natural beauty and elegance of the lofty tree, and how it changes through the seasons. One such tree that grows in several regions and always looks magnificent, regardless of the time of year, is the birch. In this article, the…
DEFF Research Database (Denmark)
Finbow, Arthur; Frendrup, Allan; Vestergaard, Preben D.
cardinality then G is a total well dominated graph. In this paper we study composition and decomposition of total well dominated trees. By a reversible process we prove that any total well dominated tree can both be reduced to and constructed from a family of three small trees....
SILVA tree viewer: interactive web browsing of the SILVA phylogenetic guide trees.
Beccati, Alan; Gerken, Jan; Quast, Christian; Yilmaz, Pelin; Glöckner, Frank Oliver
2017-09-30
Phylogenetic trees are an important tool to study the evolutionary relationships among organisms. The huge amount of available taxa poses difficulties in their interactive visualization. This hampers the interaction with the users to provide feedback for the further improvement of the taxonomic framework. The SILVA Tree Viewer is a web application designed for visualizing large phylogenetic trees without requiring the download of any software tool or data files. The SILVA Tree Viewer is based on Web Geographic Information Systems (Web-GIS) technology with a PostgreSQL backend. It enables zoom and pan functionalities similar to Google Maps. The SILVA Tree Viewer enables access to two phylogenetic (guide) trees provided by the SILVA database: the SSU Ref NR99 inferred from high-quality, full-length small subunit sequences, clustered at 99% sequence identity and the LSU Ref inferred from high-quality, full-length large subunit sequences. The Tree Viewer provides tree navigation, search and browse tools as well as an interactive feedback system to collect any kinds of requests ranging from taxonomy to data curation and improving the tool itself.
TreePics: visualizing trees with pictures
Directory of Open Access Journals (Sweden)
Nicolas Puillandre
2017-09-01
Full Text Available While many programs are available to edit phylogenetic trees, associating pictures with branch tips in an efficient and automatic way is not an available option. Here, we present TreePics, a standalone software that uses a web browser to visualize phylogenetic trees in Newick format and that associates pictures (typically, pictures of the voucher specimens to the tip of each branch. Pictures are visualized as thumbnails and can be enlarged by a mouse rollover. Further, several pictures can be selected and displayed in a separate window for visual comparison. TreePics works either online or in a full standalone version, where it can display trees with several thousands of pictures (depending on the memory available. We argue that TreePics can be particularly useful in a preliminary stage of research, such as to quickly detect conflicts between a DNA-based phylogenetic tree and morphological variation, that may be due to contamination that needs to be removed prior to final analyses, or the presence of species complexes.
The off-resonant aspects of decoherence and a critique of the two-level approximation
International Nuclear Information System (INIS)
Savran, Kerim; Hakioglu, T; Mese, E; Sevincli, Haldun
2006-01-01
Conditions in favour of a realistic multilevelled description of a decohering quantum system are examined. In this regard the first crucial observation is that the thermal effects, contrary to the conventional belief, play a minor role at low temperatures in the decoherence properties. The system-environment coupling and the environmental energy spectrum dominantly affect the decoherence. In particular, zero temperature quantum fluctuations or non-equilibrium sources can be present and influential on the decoherence rates in a wide energy range allowed by the spectrum of the environment. A crucial observation against the validity of the two-level approximation is that the decoherence rates are found to be dominated not by the long time resonant but the short time off-resonant processes. This observation is demonstrated in two stages. Firstly, our zero temperature numerical results reveal that the calculated short time decoherence rates are Gaussian-like (the time dependence of the density matrix is led by the second time derivative at t = 0). Exact analytical results are also permitted in the short time limit, which, consistent with our numerical results, reveal that this specific Gaussian-like behaviour is a property of the non-Markovian correlations in the environment. These Gaussian-like rates have no dependence on any spectral parameter (position and the width of the spectrum) except, in totality, the spectral area itself. The dependence on the spectral area is a power law. Furthermore, the Gaussian-like character at short times is independent of the number of levels (N), but the numerical value of the decoherence rates is a monotonic function of N. In this context, we demonstrate that leakage, as a characteristic multilevel effect, is dominated by the non-resonant processes. The long time behaviour of decoherence is also examined. Since our spectral model allows Markovian environmental correlations at long times, the decoherence rates in this regime become
Franklin, Oskar; Palmroth, Sari; Näsholm, Torgny
2014-11-01
Tree breeding and biotechnology can enhance forest productivity and help alleviate the rising pressure on forests from climate change and human exploitation. While many physiological processes and genes are targeted in search of genetically improved tree productivity, an overarching principle to guide this search is missing. Here, we propose a method to identify the traits that can be modified to enhance productivity, based on the differences between trees shaped by natural selection and 'improved' trees with traits optimized for productivity. We developed a tractable model of plant growth and survival to explore such potential modifications under a range of environmental conditions, from non-water limited to severely drought-limited sites. We show how key traits are controlled by a trade-off between productivity and survival, and that productivity can be increased at the expense of long-term survival by reducing isohydric behavior (stomatal regulation of leaf water potential) and allocation to defense against pests compared with native trees. In contrast, at dry sites occupied by naturally drought-resistant trees, the model suggests a better strategy may be to select trees with slightly lower wood density than the native trees and to augment isohydric behavior and allocation to defense. Thus, which traits to modify, and in which direction, depend on the original tree species or genotype, the growth environment and wood-quality versus volume production preferences. In contrast to this need for customization of drought and pest resistances, consistent large gains in productivity for all genotypes can be obtained if root traits can be altered to reduce competition for water and nutrients. Our approach illustrates the potential of using eco-evolutionary theory and modeling to guide plant breeding and genetic technology in selecting target traits in the quest for higher forest productivity. © The Author 2014. Published by Oxford University Press. All rights reserved
International Nuclear Information System (INIS)
Balasubramanian, K.
1982-01-01
A method is developed for obtaining the spectra of trees of NMR and chemical interests. The characteristic polynomials of branched trees can be obtained in terms of the characteristic polynomials of unbranched trees and branches by pruning the tree at the joints. The unbranched trees can also be broken down further until a tree containing just two vertices is obtained. The effectively reduces the order of the secular determinant of the tree used at the beginning to determinants of orders atmost equal to the number of vertices in the branch containing the largest number of vertices. An illustrative example of a NMR graph is given for which the 22 x 22 secular determinant is reduced to determinants of orders atmost 4 x 4 in just the second step of the algorithm. The tree pruning algorithm can be applied even to trees with no symmetry elements and such a factoring can be achieved. Methods developed here can be elegantly used to find if two trees are cospectral and to construct cospectral trees
Refining discordant gene trees.
Górecki, Pawel; Eulenstein, Oliver
2014-01-01
Evolutionary studies are complicated by discordance between gene trees and the species tree in which they evolved. Dealing with discordant trees often relies on comparison costs between gene and species trees, including the well-established Robinson-Foulds, gene duplication, and deep coalescence costs. While these costs have provided credible results for binary rooted gene trees, corresponding cost definitions for non-binary unrooted gene trees, which are frequently occurring in practice, are challenged by biological realism. We propose a natural extension of the well-established costs for comparing unrooted and non-binary gene trees with rooted binary species trees using a binary refinement model. For the duplication cost we describe an efficient algorithm that is based on a linear time reduction and also computes an optimal rooted binary refinement of the given gene tree. Finally, we show that similar reductions lead to solutions for computing the deep coalescence and the Robinson-Foulds costs. Our binary refinement of Robinson-Foulds, gene duplication, and deep coalescence costs for unrooted and non-binary gene trees together with the linear time reductions provided here for computing these costs significantly extends the range of trees that can be incorporated into approaches dealing with discordance.
Hamadi, Youssef; Saubion, Frédéric
2012-01-01
Autonomous combinatorial search (AS) represents a new field in combinatorial problem solving. Its major standpoint and originality is that it considers that problem solvers must be capable of self-improvement operations. This is the first book dedicated to AS.
NASA Indexing Benchmarks: Evaluating Text Search Engines
Esler, Sandra L.; Nelson, Michael L.
1997-01-01
The current proliferation of on-line information resources underscores the requirement for the ability to index collections of information and search and retrieve them in a convenient manner. This study develops criteria for analytically comparing the index and search engines and presents results for a number of freely available search engines. A product of this research is a toolkit capable of automatically indexing, searching, and extracting performance statistics from each of the focused search engines. This toolkit is highly configurable and has the ability to run these benchmark tests against other engines as well. Results demonstrate that the tested search engines can be grouped into two levels. Level one engines are efficient on small to medium sized data collections, but show weaknesses when used for collections 100MB or larger. Level two search engines are recommended for data collections up to and beyond 100MB.
The Cost of Cache-Oblivious Searching
DEFF Research Database (Denmark)
Bender, Michael A.; Brodal, Gert Stølting; Fagerberg, Rolf
2003-01-01
, multilevel memory hierarchies can be modelled. It is shown that as k grows, the search costs of the optimal k-level DAM search structure and of the optimal cache-oblivious search structure rapidly converge. This demonstrates that for a multilevel memory hierarchy, a simple cache-oblivious structure almost......Tight bounds on the cost of cache-oblivious searching are proved. It is shown that no cache-oblivious search structure can guarantee that a search performs fewer than lg e log B N block transfers between any two levels of the memory hierarchy. This lower bound holds even if all of the block sizes...... the random placement of the rst element of the structure in memory. As searching in the Disk Access Model (DAM) can be performed in log B N + 1 block transfers, this result shows a separation between the 2-level DAM and cacheoblivious memory-hierarchy models. By extending the DAM model to k levels...
A survey of decision tree classifier methodology
Safavian, S. R.; Landgrebe, David
1991-01-01
Decision tree classifiers (DTCs) are used successfully in many diverse areas such as radar signal classification, character recognition, remote sensing, medical diagnosis, expert systems, and speech recognition. Perhaps the most important feature of DTCs is their capability to break down a complex decision-making process into a collection of simpler decisions, thus providing a solution which is often easier to interpret. A survey of current methods is presented for DTC designs and the various existing issues. After considering potential advantages of DTCs over single-state classifiers, subjects of tree structure design, feature selection at each internal node, and decision and search strategies are discussed.
Transforming phylogenetic networks: Moving beyond tree space.
Huber, Katharina T; Moulton, Vincent; Wu, Taoyang
2016-09-07
Phylogenetic networks are a generalization of phylogenetic trees that are used to represent reticulate evolution. Unrooted phylogenetic networks form a special class of such networks, which naturally generalize unrooted phylogenetic trees. In this paper we define two operations on unrooted phylogenetic networks, one of which is a generalization of the well-known nearest-neighbor interchange (NNI) operation on phylogenetic trees. We show that any unrooted phylogenetic network can be transformed into any other such network using only these operations. This generalizes the well-known fact that any phylogenetic tree can be transformed into any other such tree using only NNI operations. It also allows us to define a generalization of tree space and to define some new metrics on unrooted phylogenetic networks. To prove our main results, we employ some fascinating new connections between phylogenetic networks and cubic graphs that we have recently discovered. Our results should be useful in developing new strategies to search for optimal phylogenetic networks, a topic that has recently generated some interest in the literature, as well as for providing new ways to compare networks. Copyright © 2016 Elsevier Ltd. All rights reserved.
Oliver, B. M.
Attention is given to the approaches which would provide the greatest chance of success in attempts related to the discovery of extraterrestrial advanced cultures in the Galaxy, taking into account the principle of least energy expenditure. The energetics of interstellar contact are explored, giving attention to the use of manned spacecraft, automatic probes, and beacons. The least expensive approach to a search for other civilizations involves a listening program which attempts to detect signals emitted by such civilizations. The optimum part of the spectrum for the considered search is found to be in the range from 1 to 2 GHz. Antenna and transmission formulas are discussed along with the employment of matched gates and filters, the probable characteristics of the signals to be detected, the filter-signal mismatch loss, surveys of the radio sky, the conduction of targeted searches.
DEFF Research Database (Denmark)
Song, Zhanfeng; Tian, Yanjun; Yan, Zhuo
2016-01-01
This paper proposed a direct power control strategy for three-phase two-level voltage-source rectifiers based on extended-state observation. Active and reactive powers are directly regulated in the stationary reference frame. Similar to the family of predictive controllers whose inherent characte......This paper proposed a direct power control strategy for three-phase two-level voltage-source rectifiers based on extended-state observation. Active and reactive powers are directly regulated in the stationary reference frame. Similar to the family of predictive controllers whose inherent...
Abo-Kahla, D. A. M.; Abdel-Aty, M.; Farouk, A.
2018-05-01
An atom with only two energy eigenvalues is described by a two-dimensional state space spanned by the two energy eigenstates is called a two-level atom. We consider the interaction between a two-level atom system with a constant velocity. An analytic solution of the systems which interacts with a quantized field is provided. Furthermore, the significant effect of the temperature on the atomic inversion, the purity and the information entropy are discussed in case of the initial state either an exited state or a maximally mixed state. Additionally, the effect of the half wavelengths number of the field-mode is investigated.
Favre, Charles
2004-01-01
This volume is devoted to a beautiful object, called the valuative tree and designed as a powerful tool for the study of singularities in two complex dimensions. Its intricate yet manageable structure can be analyzed by both algebraic and geometric means. Many types of singularities, including those of curves, ideals, and plurisubharmonic functions, can be encoded in terms of positive measures on the valuative tree. The construction of these measures uses a natural tree Laplace operator of independent interest.
Coded Splitting Tree Protocols
DEFF Research Database (Denmark)
Sørensen, Jesper Hemming; Stefanovic, Cedomir; Popovski, Petar
2013-01-01
This paper presents a novel approach to multiple access control called coded splitting tree protocol. The approach builds on the known tree splitting protocols, code structure and successive interference cancellation (SIC). Several instances of the tree splitting protocol are initiated, each...... instance is terminated prematurely and subsequently iterated. The combined set of leaves from all the tree instances can then be viewed as a graph code, which is decodable using belief propagation. The main design problem is determining the order of splitting, which enables successful decoding as early...
Morocco - Fruit Tree Productivity
Millennium Challenge Corporation — Date Tree Irrigation Project: The specific objectives of this evaluation are threefold: - Performance evaluation of project activities, like the mid-term evaluation,...
Taxon ordering in phylogenetic trees by means of evolutionary algorithms
Directory of Open Access Journals (Sweden)
Cerutti Francesco
2011-07-01
Full Text Available Abstract Background In in a typical "left-to-right" phylogenetic tree, the vertical order of taxa is meaningless, as only the branch path between them reflects their degree of similarity. To make unresolved trees more informative, here we propose an innovative Evolutionary Algorithm (EA method to search the best graphical representation of unresolved trees, in order to give a biological meaning to the vertical order of taxa. Methods Starting from a West Nile virus phylogenetic tree, in a (1 + 1-EA we evolved it by randomly rotating the internal nodes and selecting the tree with better fitness every generation. The fitness is a sum of genetic distances between the considered taxon and the r (radius next taxa. After having set the radius to the best performance, we evolved the trees with (λ + μ-EAs to study the influence of population on the algorithm. Results The (1 + 1-EA consistently outperformed a random search, and better results were obtained setting the radius to 8. The (λ + μ-EAs performed as well as the (1 + 1, except the larger population (1000 + 1000. Conclusions The trees after the evolution showed an improvement both of the fitness (based on a genetic distance matrix, then close taxa are actually genetically close, and of the biological interpretation. Samples collected in the same state or year moved close each other, making the tree easier to interpret. Biological relationships between samples are also easier to observe.
International Nuclear Information System (INIS)
Sandulescu, A.; Stefanescu, E.
1987-07-01
On the basis of Lindblad theory of open quantum systems we obtain new optical equations for the system of two-level atom interacting with a single mode of the electromagnetic field. The conventional Block equations in a generalized form with field phases are obtained in the hypothesis that all the terms are slowly varying in the rotating frame.(authors)
Analytical Design of Passive LCL Filter for Three-phase Two-level Power Factor Correction Rectifiers
DEFF Research Database (Denmark)
Kouchaki, Alireza; Nymand, Morten
2017-01-01
This paper proposes a comprehensive analytical LCL filter design method for three-phase two-level power factor correction rectifiers (PFCs). The high frequency converter current ripple generates the high frequency current harmonics that need to be attenuated with respect to the grid standards...
DEFF Research Database (Denmark)
Malossi, Nicola; Bason, Mark George; Viteau, Matthieu
2013-01-01
We present experimental results on the preparation of a desired quantum state in a two-level system with the maximum possible fidelity using driving protocols ranging from generalizations of the linear Landau-Zener protocol to transitionless driving protocols that ensure perfect following of the ...
Failure diagnosis and fault tree analysis
International Nuclear Information System (INIS)
Weber, G.
1982-07-01
In this report a methodology of failure diagnosis for complex systems is presented. Systems which can be represented by fault trees are considered. This methodology is based on switching algebra, failure diagnosis of digital circuits and fault tree analysis. Relations between these disciplines are shown. These relations are due to Boolean algebra and Boolean functions used throughout. It will be shown on this basis that techniques of failure diagnosis and fault tree analysis are useful to solve the following problems: 1. describe an efficient search of all failed components if the system is failed. 2. Describe an efficient search of all states which are close to a system failure if the system is still operating. The first technique will improve the availability, the second the reliability and safety. For these problems, the relation to methods of failure diagnosis for combinational circuits is required. Moreover, the techniques are demonstrated for a number of systems which can be represented by fault trees. (orig./RW) [de
Kevin T. Smith
2009-01-01
Trees and tree care can capture the best of people's motivations and intentions. Trees are living memorials that help communities heal at sites of national tragedy, such as Oklahoma City and the World Trade Center. We mark the places of important historical events by the trees that grew nearby even if the original tree, such as the Charter Oak in Connecticut or...
Siddeq, M. M.; Rodrigues, M. A.
2015-09-01
Image compression techniques are widely used on 2D image 2D video 3D images and 3D video. There are many types of compression techniques and among the most popular are JPEG and JPEG2000. In this research, we introduce a new compression method based on applying a two level discrete cosine transform (DCT) and a two level discrete wavelet transform (DWT) in connection with novel compression steps for high-resolution images. The proposed image compression algorithm consists of four steps. (1) Transform an image by a two level DWT followed by a DCT to produce two matrices: DC- and AC-Matrix, or low and high frequency matrix, respectively, (2) apply a second level DCT on the DC-Matrix to generate two arrays, namely nonzero-array and zero-array, (3) apply the Minimize-Matrix-Size algorithm to the AC-Matrix and to the other high-frequencies generated by the second level DWT, (4) apply arithmetic coding to the output of previous steps. A novel decompression algorithm, Fast-Match-Search algorithm (FMS), is used to reconstruct all high-frequency matrices. The FMS-algorithm computes all compressed data probabilities by using a table of data, and then using a binary search algorithm for finding decompressed data inside the table. Thereafter, all decoded DC-values with the decoded AC-coefficients are combined in one matrix followed by inverse two levels DCT with two levels DWT. The technique is tested by compression and reconstruction of 3D surface patches. Additionally, this technique is compared with JPEG and JPEG2000 algorithm through 2D and 3D root-mean-square-error following reconstruction. The results demonstrate that the proposed compression method has better visual properties than JPEG and JPEG2000 and is able to more accurately reconstruct surface patches in 3D.
International Nuclear Information System (INIS)
Kalay, Z; Ben-Naim, E
2015-01-01
We study fragmentation of a random recursive tree into a forest by repeated removal of nodes. The initial tree consists of N nodes and it is generated by sequential addition of nodes with each new node attaching to a randomly-selected existing node. As nodes are removed from the tree, one at a time, the tree dissolves into an ensemble of separate trees, namely, a forest. We study statistical properties of trees and nodes in this heterogeneous forest, and find that the fraction of remaining nodes m characterizes the system in the limit N→∞. We obtain analytically the size density ϕ s of trees of size s. The size density has power-law tail ϕ s ∼s −α with exponent α=1+(1/m). Therefore, the tail becomes steeper as further nodes are removed, and the fragmentation process is unusual in that exponent α increases continuously with time. We also extend our analysis to the case where nodes are added as well as removed, and obtain the asymptotic size density for growing trees. (paper)
J.R. Simpson; E.G. McPherson
2011-01-01
Urban trees can produce a number of benefits, among them improved air quality. Biogenic volatile organic compounds (BVOCs) emitted by some species are ozone precursors. Modifying future tree planting to favor lower-emitting species can reduce these emissions and aid air management districts in meeting federally mandated emissions reductions for these compounds. Changes...
L. Linsen; B.J. Karis; E.G. McPherson; B. Hamann
2005-01-01
In computer graphics, models describing the fractal branching structure of trees typically exploit the modularity of tree structures. The models are based on local production rules, which are applied iteratively and simultaneously to create a complex branching system. The objective is to generate three-dimensional scenes of often many realistic- looking and non-...
Indian Academy of Sciences (India)
Adansonia digitata L. ( The Baobab Tree) of Bombacaceae is a tree with swollen trunk that attains a dia. of 10m. Leaves are digitately compound with leaflets up to 18cm. long. Flowers are large, solitary, waxy white, and open at dusk. They open in 30 seconds and are bat pollinated. Stamens are many. Fruit is about 30 cm ...
International Nuclear Information System (INIS)
Bass, L.; Wynholds, H.W.; Porterfield, W.R.
1975-01-01
Described is an operational system that enables the user, through an intelligent graphics terminal, to construct, modify, analyze, and store fault trees. With this system, complex engineering designs can be analyzed. This paper discusses the system and its capabilities. Included is a brief discussion of fault tree analysis, which represents an aspect of reliability and safety modeling
Tree biology and dendrochemistry
Kevin T. Smith; Walter C. Shortle
1996-01-01
Dendrochemistry, the interpretation of elemental analysis of dated tree rings, can provide a temporal record of environmental change. Using the dendrochemical record requires an understanding of tree biology. In this review, we pose four questions concerning assumptions that underlie recent dendrochemical research: 1) Does the chemical composition of the wood directly...
Harvey A. Holt
1989-01-01
Controlling individual unwanted trees in forest stands is a readily accepted method for improving the value of future harvests. The practice is especially important in mixed hardwood forests where species differ considerably in value and within species individual trees differ in quality. Individual stem control is a mechanical or chemical weeding operation that...
Dettenmaier, Megan; Kuhns, Michael; Unger, Bethany; McAvoy, Darren
2017-01-01
This fact sheet describes the complex relationship between forests and climate change based on current research. It explains ways that trees can mitigate some of the risks associated with climate change. It details the impacts that forests are having on the changing climate and discuss specific ways that trees can be used to reduce or counter carbon emissions directly and indirectly.
Structural Equation Model Trees
Brandmaier, Andreas M.; von Oertzen, Timo; McArdle, John J.; Lindenberger, Ulman
2013-01-01
In the behavioral and social sciences, structural equation models (SEMs) have become widely accepted as a modeling tool for the relation between latent and observed variables. SEMs can be seen as a unification of several multivariate analysis techniques. SEM Trees combine the strengths of SEMs and the decision tree paradigm by building tree…
Matching Subsequences in Trees
DEFF Research Database (Denmark)
Bille, Philip; Gørtz, Inge Li
2009-01-01
Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the root and ends at a leaf. In this paper we propose this problem as a useful query primitive for XML data, and provide new...
The Search for Extraterrestrial Intelligence (SETI)
Tarter, Jill
The search for evidence of extraterrestrial intelligence is placed in the broader astronomical context of the search for extrasolar planets and biomarkers of primitive life elsewhere in the universe. A decision tree of possible search strategies is presented as well as a brief history of the search for extraterrestrial intelligence (SETI) projects since 1960. The characteristics of 14 SETI projects currently operating on telescopes are discussed and compared using one of many possible figures of merit. Plans for SETI searches in the immediate and more distant future are outlined. Plans for success, the significance of null results, and some opinions on deliberate transmission of signals (as well as listening) are also included. SETI results to date are negative, but in reality, not much searching has yet been done.
Environmental tritium in trees
International Nuclear Information System (INIS)
Brown, R.M.
1979-01-01
The distribution of environmental tritium in the free water and organically bound hydrogen of trees growing in the vicinity of the Chalk River Nuclear Laboratories (CRNL) has been studied. The regional dispersal of HTO in the atmosphere has been observed by surveying the tritium content of leaf moisture. Measurement of the distribution of organically bound tritium in the wood of tree ring sequences has given information on past concentrations of HTO taken up by trees growing in the CRNL Liquid Waste Disposal Area. For samples at background environmental levels, cellulose separation and analysis was done. The pattern of bomb tritium in precipitation of 1955-68 was observed to be preserved in the organically bound tritium of a tree ring sequence. Reactor tritium was discernible in a tree growing at a distance of 10 km from CRNL. These techniques provide convenient means of monitoring dispersal of HTO from nuclear facilities. (author)
Fatmaa El Zahraa Mohamed Abdou
2004-01-01
A general study about the internet search engines, the study deals main 7 points; the differance between search engines and search directories, components of search engines, the percentage of sites covered by search engines, cataloging of sites, the needed time for sites appearance in search engines, search capabilities, and types of search engines.
Generalising tree traversals and tree transformations to DAGs
DEFF Research Database (Denmark)
Bahr, Patrick; Axelsson, Emil
2017-01-01
We present a recursion scheme based on attribute grammars that can be transparently applied to trees and acyclic graphs. Our recursion scheme allows the programmer to implement a tree traversal or a tree transformation and then apply it to compact graph representations of trees instead. The resul......We present a recursion scheme based on attribute grammars that can be transparently applied to trees and acyclic graphs. Our recursion scheme allows the programmer to implement a tree traversal or a tree transformation and then apply it to compact graph representations of trees instead...... as the complementing theory with a number of examples....
Automated tracking of the vascular tree on DSA images
International Nuclear Information System (INIS)
Alperin, N.; Hoffmann, K.R.; Doi, K.
1990-01-01
Determination of the vascular tree structure is important for reconstruction of three-dimensional vascular tree from biplane images, for assessment of the significance of a lesion, and for planning treatment for arteriovenous malformation. To automate these analyses, the authors of this paper are developing a method to determine the vascular tree structure from digital subtraction angiography (DSA) images. The authors have previously described a vessel tracking method, based on the double-square-box technique. To improve the tracking accuracy, they have developed and integrated with the previous method a connectivity test and guided-sector-search technique. The connectivity test, based on region growing techniques, eliminates tracking across nonvessel regions. The guided sector-search method incorporates information from a larger are of the image to guide the search for the next tracking point
Directory of Open Access Journals (Sweden)
Ahmet Mete Vural
2016-09-01
Full Text Available This paper presents the design details of a two-level space vector pulse width modulation algorithm in PSCAD that is able to generate pulses for three-phase two-level DC/AC converters with two different switching patterns. The presented FORTRAN code is generic and can be easily modified to meet many other kinds of space vector modulation strategies. The code is also editable for hardware programming. The new component is tested and verified by comparing its output as six gating signals with those of a similar component in MATLAB library. Moreover the component is used to generate digital signals for closed-loop control of STATCOM for reactive power compensation in PSCAD. This add-on can be an effective tool to give students better understanding of the space vector modulation algorithm for different control tasks in power electronics area, and can motivate them for learning.
Non-Hermitian wave packet approximation for coupled two-level systems in weak and intense fields
Energy Technology Data Exchange (ETDEWEB)
Puthumpally-Joseph, Raiju; Charron, Eric [Institut des Sciences Moléculaires d’Orsay (ISMO), CNRS, Univ. Paris-Sud, Université Paris-Saclay, F-91405 Orsay (France); Sukharev, Maxim [Science and Mathematics Faculty, College of Letters and Sciences, Arizona State University, Mesa, Arizona 85212 (United States)
2016-04-21
We introduce a non-Hermitian Schrödinger-type approximation of optical Bloch equations for two-level systems. This approximation provides a complete and accurate description of the coherence and decoherence dynamics in both weak and strong laser fields at the cost of losing accuracy in the description of populations. In this approach, it is sufficient to propagate the wave function of the quantum system instead of the density matrix, providing that relaxation and dephasing are taken into account via automatically adjusted time-dependent gain and decay rates. The developed formalism is applied to the problem of scattering and absorption of electromagnetic radiation by a thin layer comprised of interacting two-level emitters.
Energy Technology Data Exchange (ETDEWEB)
Shorikov, A. F. [Ural Federal University, 19 S. Mira, Ekaterinburg, 620002, Russia and Institute of Mathematics and Mechanics, Ural Division of Russian Academy of Sciences, 16 S. Kovalevskaya, Ekaterinburg, 620990 (Russian Federation)
2014-11-18
We consider a discrete-time dynamical system consisting of three controllable objects. The motions of all objects are given by the corresponding vector linear or convex discrete-time recurrent vector relations, and control system for its has two levels: basic (first or I level) that is dominating and subordinate level (second or II level) and both have different criterions of functioning and united a priori by determined informational and control connections defined in advance. For the dynamical system in question, we propose a mathematical formalization in the form of solving a multistep problem of two-level hierarchical minimax program control over the terminal approach process with incomplete information and give a general scheme for its solution.
International Nuclear Information System (INIS)
Ruschhaupt, A.; Muga, J. G.
2006-01-01
We present a generalized two-level scheme for an 'atom diode', namely, a laser device that lets a two-level ground-state atom pass in one direction, say from left to right, but not in the opposite direction. The laser field is composed of two lateral state-selective mirror regions and a central pumping region. We demonstrate the robustness of the scheme and propose a physical realization. It is shown that the inclusion of a counterintuitive laser field blocking the excited atoms on the left side of the device is essential for a perfect diode effect. The reason for this, the diodic behavior, and the robustness may be understood with an adiabatic approximation. The conditions to break down the approximation, which imply also the diode failure, are analyzed
International Nuclear Information System (INIS)
Petrov, Nikolay; Todorova, Galina; Kolev, Nikola; Damian, Frederic
2011-01-01
The accurate and efficient MOC calculation scheme in APOLLO2, developed by CEA for generating multi-parameterized cross-section libraries for PWR assemblies, has been adapted to hexagonal assemblies. The neutronic part of this scheme is based on a two-level calculation methodology. At the first level, a multi-cell method is used in 281 energy groups for cross-section definition and self-shielding. At the second level, precise MOC calculations are performed in a collapsed energy mesh (30-40 groups). In this paper, the application and validation of the two-level scheme for hexagonal assemblies is described. Solutions for a VVER assembly are compared with TRIPOLI4® calculations and direct 281g MOC solutions. The results show that the accuracy is close to that of the 281g MOC calculation while the CPU time is substantially reduced. Compared to the multi-cell method, the accuracy is markedly improved. (author)
A recursive algorithm for trees and forests
Guo, Song; Guo, Victor J. W.
2017-01-01
Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on $\\{1,2,\\ldots,n\\}$. Classical formulas for counting various trees such as rooted trees, bipartite trees, tripartite trees, plane trees, $k$-ary plane trees, $k$-edge colored trees follow immediately from our recursive relations.
DEFF Research Database (Denmark)
Petersen, Ritika Singh; Keller, Stephan Sylvest; Hansen, Ole
2015-01-01
obtained by defining a reservoir and a separating trench with different depths of 85 and 125 μm, respectively, in a single embossing step. The fabrication of the required two leveled stamp is done using a modified DEEMO (dry etching, electroplating and molding) process. Dry etching using the Bosch process...... and electroplating are optimized to obtain a stamp with smooth stamp surfaces and a positive sidewall profile. Using this stamp, hot embossing is performed successfully with excellent yield and high replication fidelity....
An EOQ Model with Stock-Dependent Demand under Two Levels of Trade Credit and Time Value of Money
H.A.O. Jia-Qin; M.O. Jiangtao
2013-01-01
Since the value of money changes with time, it is necessary to take account of the influence of time factor in making the replenishment policy. In this study, to investigate the influence of the time value of money to the inventory strategy, an inventory system for deteriorating items with stock-dependent demand is investigated under two levels of trade credit. The method to efficiently determine the optimal cycle time is presented. Numerical examples are provided to demonstrate the model and...
Coherent control of the group velocity in a dielectric slab doped with duplicated two-level atoms
Ziauddin; Chuang, You-Lin; Lee, Ray-Kuang; Qamar, Sajid
2016-01-01
Coherent control of reflected and transmitted pulses is investigated theoretically through a slab doped with atoms in a duplicated two-level configuration. When a strong control field and a relatively weak probe field are employed, coherent control of the group velocity is achieved via changing the phase shift ϕ between control and probe fields. Furthermore, the peak values in the delay time of the reflected and transmitted pulses are also studied by varying the phase shift ϕ.
Phylogenetic trees in bioinformatics
Energy Technology Data Exchange (ETDEWEB)
Burr, Tom L [Los Alamos National Laboratory
2008-01-01
Genetic data is often used to infer evolutionary relationships among a collection of viruses, bacteria, animal or plant species, or other operational taxonomic units (OTU). A phylogenetic tree depicts such relationships and provides a visual representation of the estimated branching order of the OTUs. Tree estimation is unique for several reasons, including: the types of data used to represent each OTU; the use ofprobabilistic nucleotide substitution models; the inference goals involving both tree topology and branch length, and the huge number of possible trees for a given sample of a very modest number of OTUs, which implies that fmding the best tree(s) to describe the genetic data for each OTU is computationally demanding. Bioinformatics is too large a field to review here. We focus on that aspect of bioinformatics that includes study of similarities in genetic data from multiple OTUs. Although research questions are diverse, a common underlying challenge is to estimate the evolutionary history of the OTUs. Therefore, this paper reviews the role of phylogenetic tree estimation in bioinformatics, available methods and software, and identifies areas for additional research and development.
Entropy squeezing for a two-level atom in two-mode Raman coupled model with intrinsic decoherence
Institute of Scientific and Technical Information of China (English)
Zhang Jian; Shao Bin; Zou Jian
2009-01-01
In this paper,we investigate the entropy squeezing for a two-level atom interacting with two quantized fields through Raman coupling.We obtain the dynamical evolution of the total system under the influence of intrinsic decoherence when the two quantized fields are prepared in a two-mode squeezing vacuum state initially.The effects of the field squeezing factor,the two-level atomic transition frequency,the second field frequency and the intrinsic decoherence on the entropy squeezing are discussed.Without intrinsic decoherence,the increase of field squeezing factor can break the entropy squeezing.The two-level atomic transition frequency changes only the period of oscillation but not the strength of entropy squeezing.The influence of the second field frequency is complicated.With the intrinsic decoherence taken into consideration,the results show that the stronger the intrinsic decoherence is,the more quickly the entropy squeezing will disappear.The increase of the atomic transition frequency can hasten the disappearance of entropy squeezing.
Energy Technology Data Exchange (ETDEWEB)
Schanen, Michel; Marin, Oana; Zhang, Hong; Anitescu, Mihai
2016-01-01
Adjoints are an important computational tool for large-scale sensitivity evaluation, uncertainty quantification, and derivative-based optimization. An essential component of their performance is the storage/recomputation balance in which efficient checkpointing methods play a key role. We introduce a novel asynchronous two-level adjoint checkpointing scheme for multistep numerical time discretizations targeted at large-scale numerical simulations. The checkpointing scheme combines bandwidth-limited disk checkpointing and binomial memory checkpointing. Based on assumptions about the target petascale systems, which we later demonstrate to be realistic on the IBM Blue Gene/Q system Mira, we create a model of the expected performance of our checkpointing approach and validate it using the highly scalable Navier-Stokes spectralelement solver Nek5000 on small to moderate subsystems of the Mira supercomputer. In turn, this allows us to predict optimal algorithmic choices when using all of Mira. We also demonstrate that two-level checkpointing is significantly superior to single-level checkpointing when adjoining a large number of time integration steps. To our knowledge, this is the first time two-level checkpointing had been designed, implemented, tuned, and demonstrated on fluid dynamics codes at large scale of 50k+ cores.
Duarte, Marcio de Souza; Paulino, Pedro Veiga Rodrigues; Valadares Filho, Sebastião de Campos; Paulino, Mario Fonseca; Detmann, Edenio; Zervoudakis, Joanis Tilemahos; Monnerat, João Paulo Ismerio dos Santos; Viana, Gabriel da Silva; Silva, Luiz Henrique P; Serão, Nicola Vergara Lopes
2011-04-01
The effects of two levels of concentrate and ruminally undegradable protein (RUP) on performance, intake, digestibility, carcass characteristics, meat quality traits, and commercial cuts yield were assessed. Twenty crossbred heifers (240 kg average body weight) were used. At the beginning of the trial, four animals were slaughtered as reference group and the 16 remaining animals were randomly assigned to four treatments, in a 2 × 2 factorial design: two levels of concentrate (40% and 80%, dry matter (DM) basis) and two levels of RUP (48.79% and 27.19% of CP). At the end of the trial, all the animals were slaughtered. There was no interaction (P > 0.05) between concentrate and RUP levels. Dry matter intake and nutrients digestibility was not affected (P > 0.05) by RUP level. Heifers fed the highest RUP level had greater (P 0.05) DMI and ADG. Heifers fed diets with 80% concentrate had greater intake of TDN and EE, and lower intake of NDF (P RUP levels did not affect (P > 0.05) the carcass characteristics and carcass gain composition. Heifers fed 80% concentrate diets had larger (P 0.05) the composition of carcass gain. There was no effect (P > 0.05) of RUP and concentrate levels on meat quality traits and commercial cut yields.
Entropy squeezing for a two-level atom in two-mode Raman coupled model with intrinsic decoherence
International Nuclear Information System (INIS)
Jian, Zhang; Bin, Shao; Jian, Zou
2009-01-01
In this paper, we investigate the entropy squeezing for a two-level atom interacting with two quantized fields through Raman coupling. We obtain the dynamical evolution of the total system under the influence of intrinsic decoherence when the two quantized fields are prepared in a two-mode squeezing vacuum state initially. The effects of the field squeezing factor, the two-level atomic transition frequency, the second field frequency and the intrinsic decoherence on the entropy squeezing are discussed. Without intrinsic decoherence, the increase of field squeezing factor can break the entropy squeezing. The two-level atomic transition frequency changes only the period of oscillation but not the strength of entropy squeezing. The influence of the second field frequency is complicated. With the intrinsic decoherence taken into consideration, the results show that the stronger the intrinsic decoherence is, the more quickly the entropy squeezing will disappear. The increase of the atomic transition frequency can hasten the disappearance of entropy squeezing. (classical areas of phenomenology)
Directory of Open Access Journals (Sweden)
Irena Czycholl
2018-01-01
Full Text Available To enhance feasibility, the Animal Welfare Indicators (AWIN assessment protocol for horses consists of two levels: the first is a visual inspection of a sample of horses performed from a distance, the second a close-up inspection of all horses. The aim was to analyse whether information would be lost if only the first level were performed. In this study, 112 first and 112 second level assessments carried out on a subsequent day by one observer were compared by calculating the Spearman’s Rank Correlation Coefficient (RS, Intraclass Correlation Coefficients (ICC, Smallest Detectable Changes (SDC and Limits of Agreements (LoA. Most indicators demonstrated sufficient reliability between the two levels. Exceptions were the Horse Grimace Scale, the Avoidance Distance Test and the Voluntary Human Approach Test (e.g., Voluntary Human Approach Test: RS: 0.38, ICC: 0.38, SDC: 0.21, LoA: −0.25–0.17, which could, however, be also interpreted as a lack of test-retest reliability. Further disagreement was found for the indicator consistency of manure (RS: 0.31, ICC: 0.38, SDC: 0.36, LoA: −0.38–0.36. For these indicators, an adaptation of the first level would be beneficial. Overall, in this study, the division into two levels was reliable and might therewith have the potential to enhance feasibility in other welfare assessment schemes.
On defining a unique phylogenetic tree with homoplastic characters.
Goloboff, Pablo A; Wilkinson, Mark
2018-05-01
This paper discusses the problem of whether creating a matrix with all the character state combinations that have a fixed number of steps (or extra steps) on a given tree T, produces the same tree T when analyzed with maximum parsimony or maximum likelihood. Exhaustive enumeration of cases up to 20 taxa for binary characters, and up to 12 taxa for 4-state characters, shows that the same tree is recovered (as unique most likely or most parsimonious tree) as long as the number of extra steps is within 1/4 of the number of taxa. This dependence, 1/4 of the number of taxa, is discussed with a general argumentation, in terms of the spread of the character changes on the tree used to select character state distributions. The present finding allows creating matrices which have as much homoplasy as possible for the most parsimonious or likely tree to be predictable, and examination of these matrices with hill-climbing search algorithms provides additional evidence on the (lack of a) necessary relationship between homoplasy and the ability of search methods to find optimal trees. Copyright © 2018 Elsevier Inc. All rights reserved.
International Nuclear Information System (INIS)
Aldama, Mariana Espinosa
2015-01-01
The gravity apple tree is a genealogical tree of the gravitation theories developed during the past century. The graphic representation is full of information such as guides in heuristic principles, names of main proponents, dates and references for original articles (See under Supplementary Data for the graphic representation). This visual presentation and its particular classification allows a quick synthetic view for a plurality of theories, many of them well validated in the Solar System domain. Its diachronic structure organizes information in a shape of a tree following similarities through a formal concept analysis. It can be used for educational purposes or as a tool for philosophical discussion. (paper)
Visualizing phylogenetic tree landscapes.
Wilgenbusch, James C; Huang, Wen; Gallivan, Kyle A
2017-02-02
Genomic-scale sequence alignments are increasingly used to infer phylogenies in order to better understand the processes and patterns of evolution. Different partitions within these new alignments (e.g., genes, codon positions, and structural features) often favor hundreds if not thousands of competing phylogenies. Summarizing and comparing phylogenies obtained from multi-source data sets using current consensus tree methods discards valuable information and can disguise potential methodological problems. Discovery of efficient and accurate dimensionality reduction methods used to display at once in 2- or 3- dimensions the relationship among these competing phylogenies will help practitioners diagnose the limits of current evolutionary models and potential problems with phylogenetic reconstruction methods when analyzing large multi-source data sets. We introduce several dimensionality reduction methods to visualize in 2- and 3-dimensions the relationship among competing phylogenies obtained from gene partitions found in three mid- to large-size mitochondrial genome alignments. We test the performance of these dimensionality reduction methods by applying several goodness-of-fit measures. The intrinsic dimensionality of each data set is also estimated to determine whether projections in 2- and 3-dimensions can be expected to reveal meaningful relationships among trees from different data partitions. Several new approaches to aid in the comparison of different phylogenetic landscapes are presented. Curvilinear Components Analysis (CCA) and a stochastic gradient decent (SGD) optimization method give the best representation of the original tree-to-tree distance matrix for each of the three- mitochondrial genome alignments and greatly outperformed the method currently used to visualize tree landscapes. The CCA + SGD method converged at least as fast as previously applied methods for visualizing tree landscapes. We demonstrate for all three mtDNA alignments that 3D
Chien, Andy; Lai, Dar-Ming; Wang, Shwu-Fen; Hsu, Wei-Li; Cheng, Chih-Hsiu; Wang, Jaw-Lin
2016-08-01
A prospective, time series design. The purpose of this study is two-fold: firstly, to investigate the impact of altered cervical alignment and range of motion (ROM) on patients' self-reported outcomes after anterior cervical discectomy and fusion (ACDF), and secondly, to comparatively differentiate the influence of single- and two-level ACDF on the cervical ROM and adjacent segmental kinematics up to 12-month postoperatively. ACDF is one of the most commonly employed surgical interventions to treat degenerative disc disease. However, there are limited in vivo data on the impact of ACDF on the cervical kinematics and its association with patient-reported clinical outcomes. Sixty-two patients (36 males; 55.63 ± 11.6 yrs) undergoing either a single- or consecutive two-level ACDF were recruited. The clinical outcomes were assessed with the Pain Visual Analogue Scale (VAS) and the Neck Disability Index (NDI). Radiological results included cervical lordosis, global C2-C7 ROM, ROM of the Functional Spinal Unit (FSU), and its adjacent segments. The outcome measures were collected preoperatively and then at 3, 6, and 12-month postoperatively. A significant reduction of both VAS and NDI was found for both groups from the preoperative to 3-month period (P < 0.01). Pearson correlation revealed no significant correlation between global ROM with neither VAS (P = 0.667) nor NDI (P = 0.531). A significant reduction of global ROM was identified for the two-level ACDF group at 12 months (P = 0.017) but not for the single-level group. A significant interaction effect was identified for the upper adjacent segment ROM (P = 0.024) but not at the lower adjacent segment. Current study utilized dynamic radiographs to comparatively evaluate the biomechanical impact of single- and two-level ACDF. The results highlighted that the two-level group demonstrated a greater reduction of global ROM coupled with an increased upper adjacent segmental compensatory motions that
Tree-growth analyses to estimate tree species' drought tolerance
Eilmann, B.; Rigling, A.
2012-01-01
Climate change is challenging forestry management and practices. Among other things, tree species with the ability to cope with more extreme climate conditions have to be identified. However, while environmental factors may severely limit tree growth or even cause tree death, assessing a tree
Big trees, old trees, and growth factor tables
Kevin T. Smith
2018-01-01
The potential for a tree to reach a great size and to live a long life frequently captures the public's imagination. Sometimes the desire to know the age of an impressively large tree is simple curiosity. For others, the date-of-tree establishment can make a big diff erence for management, particularly for trees at historic sites or those mentioned in property...
A bijection between phylogenetic trees and plane oriented recursive trees
Prodinger, Helmut
2017-01-01
Phylogenetic trees are binary nonplanar trees with labelled leaves, and plane oriented recursive trees are planar trees with an increasing labelling. Both families are enumerated by double factorials. A bijection is constructed, using the respective representations a 2-partitions and trapezoidal words.
A Suffix Tree Or Not a Suffix Tree?
DEFF Research Database (Denmark)
Starikovskaya, Tatiana; Vildhøj, Hjalte Wedel
2015-01-01
In this paper we study the structure of suffix trees. Given an unlabeled tree r on n nodes and suffix links of its internal nodes, we ask the question “Is r a suffix tree?”, i.e., is there a string S whose suffix tree has the same topological structure as r? We place no restrictions on S, in part...
Optimal Fungal Space Searching Algorithms.
Asenova, Elitsa; Lin, Hsin-Yu; Fu, Eileen; Nicolau, Dan V; Nicolau, Dan V
2016-10-01
Previous experiments have shown that fungi use an efficient natural algorithm for searching the space available for their growth in micro-confined networks, e.g., mazes. This natural "master" algorithm, which comprises two "slave" sub-algorithms, i.e., collision-induced branching and directional memory, has been shown to be more efficient than alternatives, with one, or the other, or both sub-algorithms turned off. In contrast, the present contribution compares the performance of the fungal natural algorithm against several standard artificial homologues. It was found that the space-searching fungal algorithm consistently outperforms uninformed algorithms, such as Depth-First-Search (DFS). Furthermore, while the natural algorithm is inferior to informed ones, such as A*, this under-performance does not importantly increase with the increase of the size of the maze. These findings suggest that a systematic effort of harvesting the natural space searching algorithms used by microorganisms is warranted and possibly overdue. These natural algorithms, if efficient, can be reverse-engineered for graph and tree search strategies.
Minnesota Department of Natural Resources — The National Land Cover Database 2001 tree canopy layer for Minnesota (mapping zones 39-42, 50-51) was produced through a cooperative project conducted by the...
DEFF Research Database (Denmark)
Lobo, Albin
Climate change creates new challenges in forest management. The increase in temperature may in the long run be beneficial for the forests in the northern latitudes, but the high rate at which climate change is predicted to proceed will make adaptation difficult because trees are long living sessile...... organisms. The aim of the present thesis is therefore to explore genetic resilience and phenotypic plasticity mechanisms that allows trees to adapt and evolve with changing climates. The thesis focus on the abiotic factors associated with climate change, especially raised temperatures and lack...... age of these tree species and the uncertainty around the pace and effect of climate, it remains an open question if the native populations can respond fast enough. Phenotypic plasticity through epigenetic regulation of spring phenology is found to be present in a tree species which might act...
International Nuclear Information System (INIS)
Keeney, R.; Renn, O.; Winterfeldt, D. von; Kotte, U.
1985-01-01
What are the targets and criteria on which national energy policy should be based. What priorities should be set, and how can different social interests be matched. To answer these questions, a new instrument of decision theory is presented which has been applied with good results to controversial political issues in the USA. The new technique is known under the name of value tree analysis. Members of important West German organisations (BDI, VDI, RWE, the Catholic and Protestant Church, Deutscher Naturschutzring, and ecological research institutions) were asked about the goals of their organisations. These goals were then ordered systematically and arranged in a hierarchical tree structure. The value trees of different groups can be combined into a catalogue of social criteria of acceptability and policy assessment. The authors describe the philosophy and methodology of value tree analysis and give an outline of its application in the development of a socially acceptable energy policy. (orig.) [de
DEFF Research Database (Denmark)
Somchaipeng, Kerawit; Sporring, Jon; Johansen, Peter
2007-01-01
We propose MultiScale Singularity Trees (MSSTs) as a structure to represent images, and we propose an algorithm for image comparison based on comparing MSSTs. The algorithm is tested on 3 public image databases and compared to 2 state-of-theart methods. We conclude that the computational complexity...... of our algorithm only allows for the comparison of small trees, and that the results of our method are comparable with state-of-the-art using much fewer parameters for image representation....
DEFF Research Database (Denmark)
Jaeger, Manfred
2006-01-01
We introduce type extension trees as a formal representation language for complex combinatorial features of relational data. Based on a very simple syntax this language provides a unified framework for expressing features as diverse as embedded subgraphs on the one hand, and marginal counts...... of attribute values on the other. We show by various examples how many existing relational data mining techniques can be expressed as the problem of constructing a type extension tree and a discriminant function....
Merged Search Algorithms for Radio Frequency Identification Anticollision
Directory of Open Access Journals (Sweden)
Bih-Yaw Shih
2012-01-01
The arbitration algorithm for RFID system is used to arbitrate all the tags to avoid the collision problem with the existence of multiple tags in the interrogation field of a transponder. A splitting algorithm which is called Binary Search Tree (BST is well known for multitags arbitration. In the current study, a splitting-based schema called Merged Search Tree is proposed to capture identification codes correctly for anticollision. Performance of the proposed algorithm is compared with the original BST according to time and power consumed during the arbitration process. The results show that the proposed model can reduce searching time and power consumed to achieve a better performance arbitration.
2014-01-01
With a view to creating new landscapes and making its population of trees safer and healthier, this winter CERN will complete the tree-felling campaign started in 2010. Tree felling will take place between 15 and 22 November on the Swiss part of the Meyrin site. This work is being carried out above all for safety reasons. The trees to be cut down are at risk of falling as they are too old and too tall to withstand the wind. In addition, the roots of poplar trees are very powerful and spread widely, potentially damaging underground networks, pavements and roadways. Compensatory tree planting campaigns will take place in the future, subject to the availability of funding, with the aim of creating coherent landscapes while also respecting the functional constraints of the site. These matters are being considered in close collaboration with the Geneva nature and countryside directorate (Direction générale de la nature et du paysage, DGNP). GS-SE Group
E.G. McPherson
2007-01-01
Benefit-based tree valuation provides alternative estimates of the fair and reasonable value of trees while illustrating the relative contribution of different benefit types. This study compared estimates of tree value obtained using cost- and benefit-based approaches. The cost-based approach used the Council of Landscape and Tree Appraisers trunk formula method, and...
Attack Trees with Sequential Conjunction
Jhawar, Ravi; Kordy, Barbara; Mauw, Sjouke; Radomirović, Sasa; Trujillo-Rasua, Rolando
2015-01-01
We provide the first formal foundation of SAND attack trees which are a popular extension of the well-known attack trees. The SAND at- tack tree formalism increases the expressivity of attack trees by intro- ducing the sequential conjunctive operator SAND. This operator enables the modeling of
International Nuclear Information System (INIS)
Lee, Dong-Yeob; Lee, Sang-Ho; Maeng, Dae-Hyeon
2010-01-01
The clinical and radiological outcomes of two-level anterior lumbar interbody fusion (ALIF) with percutaneous pedicle screw fixation (PSF) were evaluated in 24 consecutive patients who underwent two level ALIF with percutaneous PSF for segmental instability and were followed up for more than 3 years. Clinical outcomes were assessed using a visual analogue scale (VAS) score and the Oswestry Disability Index (ODI). Sagittal alignment, bone union, and adjacent segment degeneration (ASD) were assessed using radiography and magnetic resonance imaging. The mean age of the patients at the time of operation was 56.3 years (range 39-70 years). Minor complications occurred in 2 patients in the perioperative period. At a mean follow-up duration of 39.4 months (range 36-42 months), VAS scores for back pain and leg pain, and ODI score decreased significantly (from 6.5, 6.8, and 46.9% to 3.0, 1.9, and 16.3%, respectively). Clinical success was achieved in 22 of the 24 patients. The mean segmental lordosis, whole lumbar lordosis, and sacral tilt significantly increased after surgery (from 25.1deg, 39.2deg, and 32.6deg to 32.9deg, 44.5deg, and 36.6deg, respectively). Solid fusion was achieved in 21 patients. ASD was found in 8 of the 24 patients. No patient underwent revision surgery due to nonunion or ASD. Two-level ALIF with percutaneous PSF yielded satisfactory clinical and radiological outcomes and could be a useful alternative to posterior fusion surgery. (author)
Energy Technology Data Exchange (ETDEWEB)
Lee, Dong-Yeob; Lee, Sang-Ho; Maeng, Dae-Hyeon [Wooridul Spine Hospital, Seoul (Korea, Republic of)
2010-08-15
The clinical and radiological outcomes of two-level anterior lumbar interbody fusion (ALIF) with percutaneous pedicle screw fixation (PSF) were evaluated in 24 consecutive patients who underwent two level ALIF with percutaneous PSF for segmental instability and were followed up for more than 3 years. Clinical outcomes were assessed using a visual analogue scale (VAS) score and the Oswestry Disability Index (ODI). Sagittal alignment, bone union, and adjacent segment degeneration (ASD) were assessed using radiography and magnetic resonance imaging. The mean age of the patients at the time of operation was 56.3 years (range 39-70 years). Minor complications occurred in 2 patients in the perioperative period. At a mean follow-up duration of 39.4 months (range 36-42 months), VAS scores for back pain and leg pain, and ODI score decreased significantly (from 6.5, 6.8, and 46.9% to 3.0, 1.9, and 16.3%, respectively). Clinical success was achieved in 22 of the 24 patients. The mean segmental lordosis, whole lumbar lordosis, and sacral tilt significantly increased after surgery (from 25.1deg, 39.2deg, and 32.6deg to 32.9deg, 44.5deg, and 36.6deg, respectively). Solid fusion was achieved in 21 patients. ASD was found in 8 of the 24 patients. No patient underwent revision surgery due to nonunion or ASD. Two-level ALIF with percutaneous PSF yielded satisfactory clinical and radiological outcomes and could be a useful alternative to posterior fusion surgery. (author)
Institute of Scientific and Technical Information of China (English)
李春先; 方卯发
2003-01-01
We study the squeezing for a two-level atom in the Jaynes-Cummings model with intensity-dependent coupling using quantum information entropy, and examine the influences of the initial state of the system on the squeezed component number and direction of the information entropy squeezing. Our results show that, the squeezed component number depends on the atomic initial distribution angle, while the squeezed direction is determined by both the phases of the atom and the field for the information entropy squeezing. Quantum information entropy is shown to be a remarkable precision measure for atomic squeezing.
Entropy as a measure of the noise extent in a two-level quantum feedback controlled system
Institute of Scientific and Technical Information of China (English)
Wang Tao-Bo; Fang Mao-Fa; Hu Yao-Hua
2007-01-01
By introducing the von Neumann entropy as a measure of the extent of noise, this paper discusses the entropy evolution in a two-level quantum feedback controlled system. The results show that the feedback control can induce the reduction of the degree of noise, and different control schemes exhibit different noise controlling ability, the extent of the reduction also related with the position of the target state on the Bloch sphere. It is shown that the evolution of entropy can provide a real time noise observation and a systematic guideline to make reasonable choice of control strategy.
Comparison of PI and PR current controllers applied on two-level VSC-HVDC transmission system
DEFF Research Database (Denmark)
Manoloiu, A.; Pereria, H.A.; Teodorescu, Remus
2015-01-01
This paper analyzes differences between αβ and dq reference frames regarding the control of two-level VSC-HVDC current loop and dc-link voltage outer loop. In the first part, voltage feedforward effect is considered with PI and PR controllers. In the second part, the feedforward effect is removed...... and the PR gains are tuned to keep the dynamic performance. Also, the power feedforward is removed and the outer loop PI controller is tuned in order to maintain the system dynamic performance. The paper is completed with simulation results, which highlight the advantages of using PR controller....
On the deviation from the sech2 superradiant emission law in a two-level atomic system
International Nuclear Information System (INIS)
Goncalves, A.E.
1990-01-01
The atomic superradiant emission is treated in the single particle mean field approximation. A single particle Hamiltonian, which represents a dressed two-level atom in a radiation field, can be obtained and it is verified that it describes the transient regime of the emission process. While the line shape emission for a bare atom follows the sech 2 law, for the dressed atom the line shape deviates appreciably from this law and it is verified that the deviation depends crucially on the ratio of the dynamic frequency shift to the transition frequency. This kind of deviation is observed in experimental results. (Author) [pt
2L-PCA: a two-level principal component analyzer for quantitative drug design and its applications.
Du, Qi-Shi; Wang, Shu-Qing; Xie, Neng-Zhong; Wang, Qing-Yan; Huang, Ri-Bo; Chou, Kuo-Chen
2017-09-19
A two-level principal component predictor (2L-PCA) was proposed based on the principal component analysis (PCA) approach. It can be used to quantitatively analyze various compounds and peptides about their functions or potentials to become useful drugs. One level is for dealing with the physicochemical properties of drug molecules, while the other level is for dealing with their structural fragments. The predictor has the self-learning and feedback features to automatically improve its accuracy. It is anticipated that 2L-PCA will become a very useful tool for timely providing various useful clues during the process of drug development.
Nishina, K.; Takenaka, C.; Ishizuka, S.; Hashimoto, S.; Yagai, Y.
2012-12-01
Some forest operations such as thinning and harvesting management could cause changes in N cycling and N2O emission from soils, since thinning and harvesting managements are accompanied with changes in aboveground environments such as an increase of slash falling and solar radiation on the forest floor. However, a considerable uncertainty exists in effects of thinning and harvesting on N2O fluxes regarding changes in belowground environments by cutting trees. To focus on the effect of changes in belowground environments on the N2O emissions from soils, we conducted a tree manipulation experiment in Japanese cedar (Cryptomeria japonica) stand without soil compaction and slash falling near the chambers and measured N2O flux at 50 cm and 150 cm distances from the tree trunk (stump) before and after cutting. We targeted 5 trees for the manipulation and established the measurement chambers to the 4 directions around each targeted tree relative to upper slope (upper, left, right, lower positions). We evaluated the effect of logging on the emission by using hierarchical Bayesian model. HB model can evaluate the variability in observed data and their uncertainties in the estimation with various probability distributions. Moreover, the HB model can easily accommodate the non-linear relationship among the N2O emissions and the environmental factors, and explicitly take non-independent data (nested structure of data) for the estimation into account by using random effects in the model. Our results showed tree cutting stimulated N2O emission from soils, and also that the increase of N2O flux depended on the distance from the trunk (stump): the increase of N2O flux at 50 cm from the trunk (stump) was greater than that of 150 cm from the trunk. The posterior simulation of the HB model indicated that the stimulation of N2O emission by tree cut- ting could reach up to 200 cm in our experimental plot. By tree cutting, the estimated N2O emission at 0-40 cm from the trunk doubled
Sweet orange trees grafted on selected rootstocks fertilized with nitrogen, phosphorus and potassium
Quaggio,José Antônio; Mattos Junior,Dirceu; Cantarella,Heitor; Stuchi,Eduardo Sanches; Sempionato,Otávio Ricardo
2004-01-01
The majority of citrus trees in Brazil are grafted on 'Rangpur lime' (Citrus limonia Osb.) rootstock. Despite its good horticultural performance, search for disease tolerant rootstock varieties to improve yield and longevity of citrus groves has increased. The objective of this work was to evaluate yield efficiency of sweet oranges on different rootstocks fertilized with N, P, and potassium. Tree growth was affected by rootstock varieties; trees on 'Swingle' citrumelo [Poncirus trifoliata (L....
Using Knowledge about the Opponent in Game-Tree Search.
1992-09-01
Schaeffer’s stimulating enthusiasm and dynamism spurred me on when I seemed to be stuck in perpetual check. Though I interacted with Jaime Carbonell...and Gene, Pierre, Fang and XiaoGang, Sabine and Consuelo. To them, and all the others I had to omit here, my sincere thanks. Finally, all of this
Garman, Nancy
1999-01-01
Describes common options and features to consider in evaluating which meta search engine will best meet a searcher's needs. Discusses number and names of engines searched; other sources and specialty engines; search queries; other search options; and results options. (AEF)
A Two-Level Sensorless MPPT Strategy Using SRF-PLL on a PMSG Wind Energy Conversion System
Directory of Open Access Journals (Sweden)
Amina Echchaachouai
2017-01-01
Full Text Available In this paper, a two-level sensorless Maximum Power Point Tracking (MPPT strategy is presented for a variable speed Wind Energy Conversion System (WECS. The proposed system is composed of a wind turbine, a direct-drive Permanent Magnet Synchronous Generator (PMSG and a three phase controlled rectifier connected to a DC load. The realised generator output power maximization analysis justifies the use of the Field Oriented Control (FOC giving the six Pulse Width Modulation (PWM signals to the active rectifier. The generator rotor speed and position required by the FOC and the sensorless MPPT are estimated using a Synchronous Reference Frame Phase Locked Loop (SRF-PLL. The MPPT strategy used consists of two levels, the first level is a power regulation loop and the second level is an extremum seeking bloc generating the coefficient gathering the turbine characteristics. Experimental results validated on a hardware test setup using a DSP digital board (dSPACE 1104 are presented. Figures illustrating the estimated speed and angle confirm that the SRF-PLL is able to give an estimated speed and angle which closely follow the real ones. Also, the power at the DC load and the power at the generator output indicate that the MPPT gives optimum extracted power. Finally, other results show the effectiveness of the adopted approach in real time applications.
Nasehi, R.
2018-06-01
We study the effect of the Goos–Hänchen (GH) shifts through a cavity with degenerate two-level systems in the line of . For this purpose, we focus on the transverse magnetic field (TMF) in a Floquet frame to obtain the giant GH shifts. Physically, the collisional effects of TMF lead to increasing the population trapping in the ground state. However, we demonstrate that the population trapping generates the large negative or positive GH shifts and simultaneously switches from superluminal to subluminal (or vice versa). Also, we investigate the other optical properties such as the longitudinal magnetic field (LMF), which plays an important role in the control of the GH shifts and leads to the generation of new subsystems. In the next step, we evaluate the GH shifts beyond the multi-photon resonance condition by the control of TMF. Moreover, we compute the appearance of negative and positive GH shifts by setting the width of the incident Gaussian beams in the presence of a multi-photon resonance condition. Our results show that superluminal or subluminal light propagation can be simultaneously controlled by adjusting the rates of the TMF and LMF. The significant effects of these factors on the degenerate two-level systems provide different applications such as slow light, optical switches and quantum information storage.
Bellamy, Richard; Weale, Albert
2015-01-01
ABSTRACT The crisis of the euro area has severely tested the political authority of the European Union (EU). The crisis raises questions of normative legitimacy both because the EU is a normative order and because the construction of economic and monetary union (EMU) rested upon a theory that stressed the normative value of the depoliticization of money. However, this theory neglected the normative logic of the two-level game implicit in EMU. It also neglected the need for an impartial and publically acceptable constitutional order to acknowledge reasonable disagreements. By contrast, we contend that any reconstruction of the EU's economic constitution has to pay attention to reconciling a European monetary order with the legitimacy of member state governance. The EU requires a two-level contract to meet this standard. Member states must treat each other as equals and be representative of and accountable to their citizens on an equitable basis. These criteria entail that the EU's political legitimacy requires a form of demoicracy that we call ‘republican intergovernmentalism’. Only rules that could be acceptable as the product of a political constitution among the peoples of Europe can ultimately meet the required standards of political legitimacy. Such a political constitution could be brought about through empowering national parliaments in EU decision-making. PMID:26924935
Experimental study of magnetocaloric effect in the two-level quantum system KTm(MoO4)2
Tarasenko, R.; Tkáč, V.; Orendáčová, A.; Orendáč, M.; Valenta, J.; Sechovský, V.; Feher, A.
2018-05-01
KTm(MoO4)2 belongs to the family of binary alkaline rare-earth molybdates. This compound can be considered to be an almost ideal quantum two-level system at low temperatures. Magnetocaloric properties of KTm(MoO4)2 single crystals were investigated using specific heat and magnetization measurement in the magnetic field applied along the easy axis. Large conventional magnetocaloric effect (-ΔSM ≈ 10.3 J/(kg K)) was observed in the magnetic field of 5 T in a relatively wide temperature interval. The isothermal magnetic entropy change of about 8 J/(kgK) has been achieved already for the magnetic field of 2 T. Temperature dependence of the isothermal entropy change under different magnetic fields is in good agreement with theoretical predictions for a quantum two-level system with Δ ≈ 2.82 cm-1. Investigation of magnetocaloric properties of KTm(MoO4)2 suggests that the studied system can be considered as a good material for magnetic cooling at low temperatures.
International Nuclear Information System (INIS)
Grace, Matthew; Brif, Constantin; Rabitz, Herschel; Walmsley, Ian A; Kosut, Robert L; Lidar, Daniel A
2007-01-01
Methods of optimal control are applied to a model system of interacting two-level particles (e.g., spin-half atomic nuclei or electrons or two-level atoms) to produce high-fidelity quantum gates while simultaneously negating the detrimental effect of decoherence. One set of particles functions as the quantum information processor, whose evolution is controlled by a time-dependent external field. The other particles are not directly controlled and serve as an effective environment, coupling to which is the source of decoherence. The control objective is to generate target one- and two-qubit unitary gates in the presence of strong environmentally-induced decoherence and under physically motivated restrictions on the control field. The quantum-gate fidelity, expressed in terms of a novel state-independent distance measure, is maximized with respect to the control field using combined genetic and gradient algorithms. The resulting high-fidelity gates demonstrate the feasibility of precisely guiding the quantum evolution via optimal control, even when the system complexity is exacerbated by environmental coupling. It is found that the gate duration has an important effect on the control mechanism and resulting fidelity. An analysis of the sensitivity of the gate performance to random variations in the system parameters reveals a significant degree of robustness attained by the optimal control solutions
Wang, Raymond Yu; Ng, Cho Nam
2015-01-01
The problem of trust is a paradigmatic social dilemma. Previous literature has paid much academic attention on effects of peer punishment and altruistic third-party punishment on trust and human cooperation in dyadic interactions. However, the effects of centralized sanctioning institutions on decentralized reciprocity in hierarchical interactions remain to be further explored. This paper presents a formal two-level trust game with incomplete information which adds an authority as a strategic purposive actor into the traditional trust game. This model allows scholars to examine the problem of trust in more complex game theoretic configurations. The analysis demonstrates how the centralized institutions might change the dynamics of reciprocity between the trustor and the trustee. Findings suggest that the sequential equilibria of the newly proposed two-level model simultaneously include the risk of placing trust for the trustor and the temptation of short-term defection for the trustee. Moreover, they have shown that even a slight uncertainty about the type of the newly introduced authority might facilitate the establishment of trust and reciprocity in social dilemmas.
Directory of Open Access Journals (Sweden)
Raymond Yu Wang
Full Text Available The problem of trust is a paradigmatic social dilemma. Previous literature has paid much academic attention on effects of peer punishment and altruistic third-party punishment on trust and human cooperation in dyadic interactions. However, the effects of centralized sanctioning institutions on decentralized reciprocity in hierarchical interactions remain to be further explored. This paper presents a formal two-level trust game with incomplete information which adds an authority as a strategic purposive actor into the traditional trust game. This model allows scholars to examine the problem of trust in more complex game theoretic configurations. The analysis demonstrates how the centralized institutions might change the dynamics of reciprocity between the trustor and the trustee. Findings suggest that the sequential equilibria of the newly proposed two-level model simultaneously include the risk of placing trust for the trustor and the temptation of short-term defection for the trustee. Moreover, they have shown that even a slight uncertainty about the type of the newly introduced authority might facilitate the establishment of trust and reciprocity in social dilemmas.
Directory of Open Access Journals (Sweden)
Zohreh Molamohamadi
2014-01-01
Full Text Available In the traditional inventory system, it was implicitly assumed that the buyer pays to the seller as soon as he receives the items. In today’s competitive industry, however, the seller usually offers the buyer a delay period to settle the account of the goods. Not only the seller but also the buyer may apply trade credit as a strategic tool to stimulate his customers’ demands. This paper investigates the effects of the latter policy, two-level trade credit, on a retailer’s optimal ordering decisions within the economic order quantity framework and allowable shortages. Unlike most of the previous studies, the demand function of the customers is considered to increase with time. The objective of the retailer’s inventory model is to maximize the profit. The replenishment decisions optimally are obtained using genetic algorithm. Two special cases of the proposed model are discussed and the impacts of parameters on the decision variables are finally investigated. Numerical examples demonstrate the profitability of the developed two-level supply chain with backorder.
Bellamy, Richard; Weale, Albert
2015-02-07
The crisis of the euro area has severely tested the political authority of the European Union (EU). The crisis raises questions of normative legitimacy both because the EU is a normative order and because the construction of economic and monetary union (EMU) rested upon a theory that stressed the normative value of the depoliticization of money. However, this theory neglected the normative logic of the two-level game implicit in EMU. It also neglected the need for an impartial and publically acceptable constitutional order to acknowledge reasonable disagreements. By contrast, we contend that any reconstruction of the EU's economic constitution has to pay attention to reconciling a European monetary order with the legitimacy of member state governance. The EU requires a two-level contract to meet this standard. Member states must treat each other as equals and be representative of and accountable to their citizens on an equitable basis. These criteria entail that the EU's political legitimacy requires a form of demoi cracy that we call 'republican intergovernmentalism'. Only rules that could be acceptable as the product of a political constitution among the peoples of Europe can ultimately meet the required standards of political legitimacy. Such a political constitution could be brought about through empowering national parliaments in EU decision-making.
Du, Ding-Zhu
2001-01-01
This book is a collection of articles studying various Steiner tree prob lems with applications in industries, such as the design of electronic cir cuits, computer networking, telecommunication, and perfect phylogeny. The Steiner tree problem was initiated in the Euclidean plane. Given a set of points in the Euclidean plane, the shortest network interconnect ing the points in the set is called the Steiner minimum tree. The Steiner minimum tree may contain some vertices which are not the given points. Those vertices are called Steiner points while the given points are called terminals. The shortest network for three terminals was first studied by Fermat (1601-1665). Fermat proposed the problem of finding a point to minimize the total distance from it to three terminals in the Euclidean plane. The direct generalization is to find a point to minimize the total distance from it to n terminals, which is still called the Fermat problem today. The Steiner minimum tree problem is an indirect generalization. Sch...
Traditional agroforestry systems, tree uses and management in ...
African Journals Online (AJOL)
protecting or planting the trees and shrubs on farms. ... Inadequate supply of seedlings, poor extension services, a nd lack ofland as well as ... integrated research, adoption of better land management techniques and ..... of elite men moving to town and urban centres in search of .... grazing in small scale farming areas.
Demography of exploited tree species in the Bolivian Amazon
Zuidema, P.A.
2000-01-01
Tropical forests are threatened world-wide. Therefore, there is a search for ways to use the forests in a sustainable way, as this could assist in the conservation of these special ecosystems. Non-timber products collected from trees in tropical forests are often mentioned as examples of
Bounds on Average Time Complexity of Decision Trees
Chikalov, Igor
2011-01-01
In this chapter, bounds on the average depth and the average weighted depth of decision trees are considered. Similar problems are studied in search theory [1], coding theory [77], design and analysis of algorithms (e.g., sorting) [38]. For any
Visualization of Uncertain Contour Trees
DEFF Research Database (Denmark)
Kraus, Martin
2010-01-01
Contour trees can represent the topology of large volume data sets in a relatively compact, discrete data structure. However, the resulting trees often contain many thousands of nodes; thus, many graph drawing techniques fail to produce satisfactory results. Therefore, several visualization methods...... were proposed recently for the visualization of contour trees. Unfortunately, none of these techniques is able to handle uncertain contour trees although any uncertainty of the volume data inevitably results in partially uncertain contour trees. In this work, we visualize uncertain contour trees...... by combining the contour trees of two morphologically filtered versions of a volume data set, which represent the range of uncertainty. These two contour trees are combined and visualized within a single image such that a range of potential contour trees is represented by the resulting visualization. Thus...
DEFF Research Database (Denmark)
Durhuus, Bergfinnur Jøgvan; Napolitano, George Maria
2012-01-01
The Ising model on a class of infinite random trees is defined as a thermodynamiclimit of finite systems. A detailed description of the corresponding distribution of infinite spin configurations is given. As an application, we study the magnetization properties of such systems and prove that they......The Ising model on a class of infinite random trees is defined as a thermodynamiclimit of finite systems. A detailed description of the corresponding distribution of infinite spin configurations is given. As an application, we study the magnetization properties of such systems and prove...... that they exhibit no spontaneous magnetization. Furthermore, the values of the Hausdorff and spectral dimensions of the underlying trees are calculated and found to be, respectively,¯dh =2 and¯ds = 4/3....
ColorTree: a batch customization tool for phylogenic trees.
Chen, Wei-Hua; Lercher, Martin J
2009-07-31
Genome sequencing projects and comparative genomics studies typically aim to trace the evolutionary history of large gene sets, often requiring human inspection of hundreds of phylogenetic trees. If trees are checked for compatibility with an explicit null hypothesis (e.g., the monophyly of certain groups), this daunting task is greatly facilitated by an appropriate coloring scheme. In this note, we introduce ColorTree, a simple yet powerful batch customization tool for phylogenic trees. Based on pattern matching rules, ColorTree applies a set of customizations to an input tree file, e.g., coloring labels or branches. The customized trees are saved to an output file, which can then be viewed and further edited by Dendroscope (a freely available tree viewer). ColorTree runs on any Perl installation as a stand-alone command line tool, and its application can thus be easily automated. This way, hundreds of phylogenic trees can be customized for easy visual inspection in a matter of minutes. ColorTree allows efficient and flexible visual customization of large tree sets through the application of a user-supplied configuration file to multiple tree files.
Giri, B. C.; Maiti, T.
2013-05-01
This article develops a single-manufacturer and single-retailer supply chain model under two-level permissible delay in payments when the manufacturer follows a lot-for-lot policy in response to the retailer's demand. The manufacturer offers a trade credit period to the retailer with the contract that the retailer must share a fraction of the profit earned during the trade credit period. On the other hand, the retailer provides his customer a partial trade credit which is less than that of the manufacturer. The demand at the retailer is assumed to be dependent on the selling price and the trade credit period offered to the customers. The average net profit of the supply chain is derived and an algorithm for finding the optimal solution is developed. Numerical examples are given to demonstrate the coordination policy of the supply chain and examine the sensitivity of key model-parameters.
International Nuclear Information System (INIS)
Zabolotskii, A.A.
1995-01-01
The inverse problem is considered for a spectral problem, which is formally equivalent to a system of Bloch equations for an inhomogeneously broadened transition interacting with the electric field. Two cases are considered to demonstrate that, for any given frequency interval, one can determine the pulse of the shape which corresponds to the interaction with only this frequency interval. In the general case, the pulse shape is described by a nonlinear periodic wave. The first example is the resonance interaction of light with a gas of two-level atoms. The second example is interaction of a linearly polarized light with the molecular J-J transition, where J much-gt 1. In the latter case, the role of inhomogeneous broadening belongs to the frequency shift induced by the applied magnetic field. 10 refs
Quantum correlations between each two-level system in a pair of atoms and general coherent fields
Directory of Open Access Journals (Sweden)
S. Abdel-Khalek
Full Text Available The quantitative description of the quantum correlations between each two-level system in a two-atom system and the coherent fields initially defined in a coherent state in the framework of power-law potentials (PLPCSs is considered. Specifically, we consider two atoms locally interacting with PLPCSs and take into account the different terms of interactions, the entanglement and quantum discord are studied including the time-dependent coupling and photon transition effects. Using the monogamic relation between the entanglement of formation and quantum discord in tripartite systems, we show that the control and preservation of the different kinds of quantum correlations greatly benefit from the combination of the choice of the physical quantities. Finally, we explore the link between the dynamical behavior of quantum correlations and nonclassicality of the fields with and without atomic motion effect. Keywords: Quantum correlations, Monogamic relation, Coherent states, Power-law potentials, Wehrl entropy
Cascaded two-photon nonlinearity in a one-dimensional waveguide with multiple two-level emitters
Roy, Dibyendu
2013-01-01
We propose and theoretically investigate a model to realize cascaded optical nonlinearity with few atoms and photons in one-dimension (1D). The optical nonlinearity in our system is mediated by resonant interactions of photons with two-level emitters, such as atoms or quantum dots in a 1D photonic waveguide. Multi-photon transmission in the waveguide is nonreciprocal when the emitters have different transition energies. Our theory provides a clear physical understanding of the origin of nonreciprocity in the presence of cascaded nonlinearity. We show how various two-photon nonlinear effects including spatial attraction and repulsion between photons, background fluorescence can be tuned by changing the number of emitters and the coupling between emitters (controlled by the separation). PMID:23948782
Temporal Bell-type inequalities for two-level Rydberg atoms coupled to a high-Q resonator
International Nuclear Information System (INIS)
Huelga, S.F.; Marshall, T.W.; Santos, E.
1996-01-01
Following the strategy of showing specific quantum effects by means of the violation of a classical inequality, a pair of Bell-type inequalities is derived on the basis of certain additional assumptions, whose plausibility is discussed in detail. Such inequalities are violated by the quantum mechanical predictions for the interaction of a two-level Rydberg atom with a single mode sustained by a high-Q resonator. The experimental conditions required in order to show the existence of forbidden values, according to a hidden variables formalism, in a real experiment are analyzed for various initial field statistics. In particular, the revival dynamics expected for the interaction with a coherent field leads to classically forbidden values, which would indicate a purely quantum effect. copyright 1996 The American Physical Society
International Nuclear Information System (INIS)
Ray, Aditi
2004-01-01
The dynamics of a two-level atom driven by a single laser beam and three-level atom (Lambda configuration) irradiated by two laser beams are studied taking into account of the quantized center-of-mass motion of the atom. It is shown that the trapped atom system under appropriate resonance condition exhibits the large time-scale revivals when the index of the vibrational sideband responsible for the atomic electronic transition is greater than unity. The revival times are shown to be dependent on the initial number of vibrational excitations and the magnitude of the Lamb-Dicke parameter. The sub-Poissonian statistics in vibrational quantum number is observed at certain time intervals. The minimum time of interaction for which the squeezed states of motional quadrature are generated is found to be decreasing with the increase in the Lamb-Dicke parameter
DEFF Research Database (Denmark)
Kouchaki, Alireza; Nymand, Morten
2016-01-01
This paper presents LCL filter design method for three-phase two-level power factor correction (PFC) using line impedance stabilization network (LISN). A straightforward LCL filter design along with variation in grid impedance is not simply achievable and inevitably lead to an iterative solution...... for filter. By introducing of fast power switches for PFC applications such as silicon-carbide, major current harmonics around the switching frequency drops in the region that LISN can actively provide well-defined impedance for measuring the harmonics (i.e. 9 kHz- 30MHz). Therefore, LISN can be replaced...... is derived using the current ripple behavior of converter-side inductor. The grid-side inductor is achieved as a function of LISN impedance to fulfill the grid regulation. To verify the analyses, an LCL filter is designed for a 5 kW SiC-based PFC. The simulation and experimental results support the validity...
International Nuclear Information System (INIS)
Zhong Ming; Tong Peiqing
2011-01-01
The Loschmidt echo (LE) of a central two-level qubit coupled to nonuniform anisotropic XY chains in a transverse field is studied. A general formula for LE is derived, which we use to discuss the influence of the criticality of the environment on LE. It is found that for the periodic XY chain the behaviors of LE in the vicinity of the critical points are similar to those of the uniform case. It is different for the disordered transverse Ising chains. For the aperiodic chains, if the surrounding systems are bounded chains, the behaviors of LE are similar to those of the uniform case, while if the surrounding systems are unbounded chains, they are similar to those of the disordered case.
Chung, Kun-Jen
2013-09-01
An inventory problem involves a lot of factors influencing inventory decisions. To understand it, the traditional economic production quantity (EPQ) model plays rather important role for inventory analysis. Although the traditional EPQ models are still widely used in industry, practitioners frequently question validities of assumptions of these models such that their use encounters challenges and difficulties. So, this article tries to present a new inventory model by considering two levels of trade credit, finite replenishment rate and limited storage capacity together to relax the basic assumptions of the traditional EPQ model to improve the environment of the use of it. Keeping in mind cost-minimisation strategy, four easy-to-use theorems are developed to characterise the optimal solution. Finally, the sensitivity analyses are executed to investigate the effects of the various parameters on ordering policies and the annual total relevant costs of the inventory system.
Dynamics of a Landau-Zener transitions in a two-level system driven by a dissipative environment
Ateuafack, M. E.; Diffo, J. T.; Fai, L. C.
2016-02-01
The paper investigates the effects of a two-level quantum system coupled to transversal and longitudinal dissipative environment. The time-dependent phase accumulation, LZ transition probability and entropy in the presence of fast-ohmic, sub-ohmic and super-ohmic quantum noise are derived. Analytical results are obtained in terms of temperature, dissipation strength, LZ parameter and bath cutoff frequency. The bath is observed to modify the standard occupation difference by a decaying random phase factor and also produces dephasing during the transfer of population. The dephasing characteristics or the initial non-zero decoherence rate are observed to increase in time with the bath temperature and depend on the system-bath coupling strength and cutoff frequency. These parameters are found to strongly affect the memory and thus tailor the coherence process of the system.
Dynamics of a Landau–Zener transitions in a two-level system driven by a dissipative environment
Energy Technology Data Exchange (ETDEWEB)
Ateuafack, M.E., E-mail: esouamath@yahoo.fr [Mesoscopic and Multilayer Structures Laboratory, Department of Physics, Faculty of Science, University of Dschang (Cameroon); Diffo, J.T., E-mail: diffojaures@yahoo.com [Mesoscopic and Multilayer Structures Laboratory, Department of Physics, Faculty of Science, University of Dschang (Cameroon); Department of Physics, Higher Teachers' Training College, The University of Maroua, PO Box 55 Maroua (Cameroon); Fai, L.C., E-mail: corneliusfai@yahoo.fr [Mesoscopic and Multilayer Structures Laboratory, Department of Physics, Faculty of Science, University of Dschang (Cameroon)
2016-02-15
The paper investigates the effects of a two-level quantum system coupled to transversal and longitudinal dissipative environment. The time-dependent phase accumulation, LZ transition probability and entropy in the presence of fast-ohmic, sub-ohmic and super-ohmic quantum noise are derived. Analytical results are obtained in terms of temperature, dissipation strength, LZ parameter and bath cutoff frequency. The bath is observed to modify the standard occupation difference by a decaying random phase factor and also produces dephasing during the transfer of population. The dephasing characteristics or the initial non-zero decoherence rate are observed to increase in time with the bath temperature and depend on the system-bath coupling strength and cutoff frequency. These parameters are found to strongly affect the memory and thus tailor the coherence process of the system.
Energy Technology Data Exchange (ETDEWEB)
Grassi, G. [Commissariat a l' Energie Atomique, CEA de Saclay, DM2S/SERMA/LENR, 91191, Gif-sur-Yvette (France)
2006-07-01
We present a non-linear space-angle two-level acceleration scheme for the method of the characteristics (MOC). To the fine level on which the MOC transport calculation is performed, we associate a more coarsely discretized phase space in which a low-order problem is solved as an acceleration step. Cross sections on the coarse level are obtained by a flux-volume homogenisation technique, which entails the non-linearity of the acceleration. Discontinuity factors per surface are introduced as additional degrees of freedom on the coarse level in order to ensure the equivalence of the heterogeneous and the homogenised problem. After each fine transport iteration, a low-order transport problem is iteratively solved on the homogenised grid. The solution of this problem is then used to correct the angular moments of the flux resulting from the previous free transport sweep. Numerical tests for a given benchmark have been performed. Results are discussed. (authors)
International Nuclear Information System (INIS)
Grassi, G.
2006-01-01
We present a non-linear space-angle two-level acceleration scheme for the method of the characteristics (MOC). To the fine level on which the MOC transport calculation is performed, we associate a more coarsely discretized phase space in which a low-order problem is solved as an acceleration step. Cross sections on the coarse level are obtained by a flux-volume homogenisation technique, which entails the non-linearity of the acceleration. Discontinuity factors per surface are introduced as additional degrees of freedom on the coarse level in order to ensure the equivalence of the heterogeneous and the homogenised problem. After each fine transport iteration, a low-order transport problem is iteratively solved on the homogenised grid. The solution of this problem is then used to correct the angular moments of the flux resulting from the previous free transport sweep. Numerical tests for a given benchmark have been performed. Results are discussed. (authors)
Directory of Open Access Journals (Sweden)
Yi-hung Chiou
2010-04-01
Full Text Available The goal of this article is to investigate the conditions under which ASEAN states are more likely to pursue regional economic integration, namely, a series of ASEAN Free Trade Area (AFTA agreements/ protocols. Adopting Putnam’s two-level-games model, this article examines the influences of domestic politics, political elites’ preferences, economic performance, and external impacts. Through the construction of a set of hypotheses, this article investigates five AFTA agreements/ protocols and the conditions of ASEAN states during the 1992–2003 period. The findings indicate that political leaders’ preferences have played a pivotal role in the development of the AFTA. Economic performance and domestic support in individual states has also affected the AFTA. The close link between AFTA agreements and external impacts reveals that the AFTA’s inherent nature is defensive.
Design of a Two-level Adaptive Multi-Agent System for Malaria Vectors driven by an ontology
Directory of Open Access Journals (Sweden)
Etang Josiane
2007-07-01
Full Text Available Abstract Background The understanding of heterogeneities in disease transmission dynamics as far as malaria vectors are concerned is a big challenge. Many studies while tackling this problem don't find exact models to explain the malaria vectors propagation. Methods To solve the problem we define an Adaptive Multi-Agent System (AMAS which has the property to be elastic and is a two-level system as well. This AMAS is a dynamic system where the two levels are linked by an Ontology which allows it to function as a reduced system and as an extended system. In a primary level, the AMAS comprises organization agents and in a secondary level, it is constituted of analysis agents. Its entry point, a User Interface Agent, can reproduce itself because it is given a minimum of background knowledge and it learns appropriate "behavior" from the user in the presence of ambiguous queries and from other agents of the AMAS in other situations. Results Some of the outputs of our system present a series of tables, diagrams showing some factors like Entomological parameters of malaria transmission, Percentages of malaria transmission per malaria vectors, Entomological inoculation rate. Many others parameters can be produced by the system depending on the inputted data. Conclusion Our approach is an intelligent one which differs from statistical approaches that are sometimes used in the field. This intelligent approach aligns itself with the distributed artificial intelligence. In terms of fight against malaria disease our system offers opportunities of reducing efforts of human resources who are not obliged to cover the entire territory while conducting surveys. Secondly the AMAS can determine the presence or the absence of malaria vectors even when specific data have not been collected in the geographical area. In the difference of a statistical technique, in our case the projection of the results in the field can sometimes appeared to be more general.
International Nuclear Information System (INIS)
Wang, Wenbin; Zhao, Fei; Peng, Rui
2014-01-01
Inspection is always an important preventive maintenance (PM) activity and can have different depths and cover all or part of plant systems. This paper introduces a two-level inspection policy model for a single component plant system based on a three-stage failure process. Such a failure process divides the system′s life into three stages: good, minor defective and severe defective stages. The first level of inspection, the minor inspection, can only identify the minor defective stage with a certain probability, but can always reveal the severe defective stage. The major inspection can however identify both defective stages perfectly. Once the system is found to be in the minor defective stage, a shortened inspection interval is adopted. If however the system is found to be in the severe defective stage, we may delay the maintenance action if the time to the next planned PM window is less than a threshold level, but otherwise, replace immediately. This corresponds to the well adopted maintenance policy in practice such as periodic inspections with planned PMs. A numerical example is presented to demonstrate the proposed model by comparing with other models. - Highlights: • The system′s deterioration goes through a three-stage process, namely, normal, minor defective and severe defective. • Two levels of inspections are proposed, e.g., minor and major inspections. • Once the minor defective stage is found, instead of taking a maintenance action, a shortened inspection interval is recommended. • When the severe defective stage is found, we delay the maintenance according to the threshold to the next PM. • The decision variables are the inspection intervals and the threshold to PM
Finding Minimum-Power Broadcast Trees for Wireless Networks
Arabshahi, Payman; Gray, Andrew; Das, Arindam; El-Sharkawi, Mohamed; Marks, Robert, II
2004-01-01
Some algorithms have been devised for use in a method of constructing tree graphs that represent connections among the nodes of a wireless communication network. These algorithms provide for determining the viability of any given candidate connection tree and for generating an initial set of viable trees that can be used in any of a variety of search algorithms (e.g., a genetic algorithm) to find a tree that enables the network to broadcast from a source node to all other nodes while consuming the minimum amount of total power. The method yields solutions better than those of a prior algorithm known as the broadcast incremental power algorithm, albeit at a slightly greater computational cost.
MulRF: a software package for phylogenetic analysis using multi-copy gene trees.
Chaudhary, Ruchi; Fernández-Baca, David; Burleigh, John Gordon
2015-02-01
MulRF is a platform-independent software package for phylogenetic analysis using multi-copy gene trees. It seeks the species tree that minimizes the Robinson-Foulds (RF) distance to the input trees using a generalization of the RF distance to multi-labeled trees. The underlying generic tree distance measure and fast running time make MulRF useful for inferring phylogenies from large collections of gene trees, in which multiple evolutionary processes as well as phylogenetic error may contribute to gene tree discord. MulRF implements several features for customizing the species tree search and assessing the results, and it provides a user-friendly graphical user interface (GUI) with tree visualization. The species tree search is implemented in C++ and the GUI in Java Swing. MulRF's executable as well as sample datasets and manual are available at http://genome.cs.iastate.edu/CBL/MulRF/, and the source code is available at https://github.com/ruchiherself/MulRFRepo. ruchic@ufl.edu Supplementary data are available at Bioinformatics online. © The Author 2014. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.
Embedding complete ternary tree in hypercubes using AVL trees
S.A. Choudum; I. Raman (Indhumathi)
2008-01-01
htmlabstractA complete ternary tree is a tree in which every non-leaf vertex has exactly three children. We prove that a complete ternary tree of height h, TTh, is embeddable in a hypercube of dimension . This result coincides with the result of [2]. However, in this paper, the embedding utilizes
Balgooy, van M.M.J.
1998-01-01
With the publication of the second volume of the series ‘Malesian Seed Plants’, entitled ‘Portraits of Tree Families’, I would like to refer to the Introduction of the first volume, ‘Spot-characters’ for a historical background and an explanation of the aims of this series. The present book treats
Indian Academy of Sciences (India)
Melia dubia Cav. of Meliaceae is a large deciduous tree. Leaves are compound with toothed leaflets. Flowers are small, greenish-yellow in much-branched inflorescences. Fruits are green, ellipsoidal with a single seed covered by hard portion ( as in a mango fruit) and surrounded by fleshy pulp outside. The bark is bitter ...
Programming macro tree transducers
DEFF Research Database (Denmark)
Bahr, Patrick; Day, Laurence E.
2013-01-01
transducers can be concisely represented in Haskell, and demonstrate the benefits of utilising such an approach with a number of examples. In particular, tree transducers afford a modular programming style as they can be easily composed and manipulated. Our Haskell representation generalises the original...
Mark J. Ambrose
2014-01-01
Tree mortality is a natural process in all forest ecosystems. Extremely high mortality, however, can also be an indicator of forest health issues. On a regional scale, high mortality levels may indicate widespread insect or disease problems. High mortality may also occur if a large proportion of the forest in a particular region is made up of older, senescent stands....
A Universal Phylogenetic Tree.
Offner, Susan
2001-01-01
Presents a universal phylogenetic tree suitable for use in high school and college-level biology classrooms. Illustrates the antiquity of life and that all life is related, even if it dates back 3.5 billion years. Reflects important evolutionary relationships and provides an exciting way to learn about the history of life. (SAH)
Czech Academy of Sciences Publication Activity Database
Balcar, B.; Doucha, Michal; Hrušák, M.
2015-01-01
Roč. 32, č. 1 (2015), s. 69-81 ISSN 0167-8094 R&D Projects: GA AV ČR IAA100190902 Institutional support: RVO:67985840 Keywords : forcing * Boolean algebras * base tree Subject RIV: BA - General Mathematics Impact factor: 0.614, year: 2015 http://link.springer.com/article/10.1007/s11083-013-9316-2
International Nuclear Information System (INIS)
Richard, Jean-Marc
2010-01-01
A brief review review is presented of models tentatively leading to stable multiquarks. A new attempt is presented, based on a Steiner-tree model of confinement, which is inspired by by QCD. It leads to more attraction than the empirical colour-additive model used in earlier multiquark calculations, and predict several multiquark states in configurations with different flavours.
Tree Transduction Tools for Cdec
Directory of Open Access Journals (Sweden)
Austin Matthews
2014-09-01
Full Text Available We describe a collection of open source tools for learning tree-to-string and tree-to-tree transducers and the extensions to the cdec decoder that enable translation with these. Our modular, easy-to-extend tools extract rules from trees or forests aligned to strings and trees subject to different structural constraints. A fast, multithreaded implementation of the Cohn and Blunsom (2009 model for extracting compact tree-to-string rules is also included. The implementation of the tree composition algorithm used by cdec is described, and translation quality and decoding time results are presented. Our experimental results add to the body of evidence suggesting that tree transducers are a compelling option for translation, particularly when decoding speed and translation model size are important.
Selecting Landscape Plants: Shade Trees
Relf, Diane; Appleton, Bonnie Lee, 1948-2012; Close, David
2015-01-01
Because of the permanency of trees and their importance in the landscape, care must be taken to select the best species for each situation. This publication goes over how to choose landscape trees that are shade tolerant.
Directory of Open Access Journals (Sweden)
Majid Gholipour
2013-08-01
Full Text Available Background: The prevalence of obesity has risen enormously over the past few decad-es. Both food intake (Appetite and energy expenditure can influence body weight. Acylated ghrelin enhances appetite, and its plasma level is suppressed by growth horm-one. The present study, examines the effects of an intermittent exercise with progress-ive intensities on acylated ghrelin, appetite, and growth hormone in inactive male students with two levels of obesity.Methods: Eleven inactive males were allocated into two groups on the basis of their body mass index (BMI. Six subjects in group one, BMI= 31.18±0.92 kg/m2, and five subjects in group two, BMI= 36.94±2.25 kg/m2, ran on the treadmill with progressive intensities of 50, 60, 70 and 80% of VO2max for 10, 10, 5, and 2 min respectively. Blood samples were collected before the exercise (as the resting values, after each workload (during the exercise, and at 30, 60, and 120 min (during recovery.Results: Plasma acylated ghrelin concentrations and hunger ratings in two groups were decreased and remained significantly lower than resting values (P=0.008 and P=0.002 respectively at the end of the trial and there was no significant differences between groups. Growth hormone levels in two groups were increased and remained significant-ly higher than resting values (groups one P=0.012, group two P=0.005 at the end of the trial and there was no significant differences between groups. In addition, there were no significant differences between area under the curves (AUC values over total periods for acylated ghrelin, hunger ratings, and growth hormone in two groups.Conclusion: These findings indicate that individuals with two levels of obesity have the same response to the different intensities of treadmill running and two hours thereafter during recovery period, which can be considered for designing a more effective weighting loss training program.
Adjustable chain trees for proteins
DEFF Research Database (Denmark)
Winter, Pawel; Fonseca, Rasmus
2012-01-01
A chain tree is a data structure for changing protein conformations. It enables very fast detection of clashes and free energy potential calculations. A modified version of chain trees that adjust themselves to the changing conformations of folding proteins is introduced. This results in much...... tighter bounding volume hierarchies and therefore fewer intersection checks. Computational results indicate that the efficiency of the adjustable chain trees is significantly improved compared to the traditional chain trees....
Introduction to fault tree analysis
International Nuclear Information System (INIS)
Barlow, R.E.; Lambert, H.E.
1975-01-01
An elementary, engineering oriented introduction to fault tree analysis is presented. The basic concepts, techniques and applications of fault tree analysis, FTA, are described. The two major steps of FTA are identified as (1) the construction of the fault tree and (2) its evaluation. The evaluation of the fault tree can be qualitative or quantitative depending upon the scope, extensiveness and use of the analysis. The advantages, limitations and usefulness of FTA are discussed
Gear, Jim
1993-01-01
The Re-Think Tree is a simple framework to help individuals assess and improve their behaviors related to environmental issues. The branches of the tree in order of priority are refuse, reduce, re-use, and recycle. Roots of the tree include such things as public opinion, education, and watchdog groups. (KS)
Nyhuis, Jane
Referring as often as possible to traditional Hopi practices and to materials readily available on the reservation, the illustrated booklet provides information on the care and maintenance of young fruit trees. An introduction to fruit trees explains the special characteristics of new trees, e.g., grafting, planting pits, and watering. The…
Inferences from growing trees backwards
David W. Green; Kent A. McDonald
1997-01-01
The objective of this paper is to illustrate how longitudinal stress wave techniques can be useful in tracking the future quality of a growing tree. Monitoring the quality of selected trees in a plantation forest could provide early input to decisions on the effectiveness of management practices, or future utilization options, for trees in a plantation. There will...
Genetic transformation of forest trees
African Journals Online (AJOL)
Admin
In this review, the recent progress on genetic transformation of forest trees were discussed. Its described also, different applications of genetic engineering for improving forest trees or understanding the mechanisms governing genes expression in woody plants. Key words: Genetic transformation, transgenic forest trees, ...
Chen, Hao; Kong, Chao; Hai, Wenhua
2018-06-01
We investigate quantum dynamics of a two-level ion trapped in the Lamb-Dicke regime of a δ -kicked optical lattice, based on the exact generalized coherent states rotated by a π / 2 pulse of Ramsey type experiment. The spatiotemporal evolutions of the spin-motion entangled states in different parameter regions are illustrated, and the parameter regions of different degrees of quantum stability described by the quantum fidelity are found. Time evolutions of the probability for the ion being in different pseudospin states reveal that the ultrafast entanglement generation and population transfers of the system can be analytically controlled by managing the laser pulses. The probability in an initially disentangled state shows periodic collapses (entanglement) and revivals (de-entanglement). Reduction of the stability degree results in enlarging the period of de-entanglement, while the instability and potential chaos will cause the sustained entanglement. The results could be justified experimentally in the existing setups and may be useful in engineering quantum dynamics for quantum information processing.
Heydari, Jafar; Norouzinasab, Yousef
2015-12-01
In this paper, a discount model is proposed to coordinate pricing and ordering decisions in a two-echelon supply chain (SC). Demand is stochastic and price sensitive while lead times are fixed. Decentralized decision making where downstream decides on selling price and order size is investigated. Then, joint pricing and ordering decisions are extracted where both members act as a single entity aim to maximize whole SC profit. Finally, a coordination mechanism based on quantity discount is proposed to coordinate both pricing and ordering decisions simultaneously. The proposed two-level discount policy can be characterized from two aspects: (1) marketing viewpoint: a retail price discount to increase the demand, and (2) operations management viewpoint: a wholesale price discount to induce the retailer to adjust its order quantity and selling price jointly. Results of numerical experiments demonstrate that the proposed policy is suitable to coordinate SC and improve the profitability of SC as well as all SC members in comparison with decentralized decision making.
Abbout, Adel
2016-08-05
Using the tools of random matrix theory we develop a statistical analysis of the transport properties of thermoelectric low-dimensional systems made of two electron reservoirs set at different temperatures and chemical potentials, and connected through a low-density-of-states two-level quantum dot that acts as a conducting chaotic cavity. Our exact treatment of the chaotic behavior in such devices lies on the scattering matrix formalism and yields analytical expressions for the joint probability distribution functions of the Seebeck coefficient and the transmission profile, as well as the marginal distributions, at arbitrary Fermi energy. The scattering matrices belong to circular ensembles which we sample to numerically compute the transmission function, the Seebeck coefficient, and their relationship. The exact transport coefficients probability distributions are found to be highly non-Gaussian for small numbers of conduction modes, and the analytical and numerical results are in excellent agreement. The system performance is also studied, and we find that the optimum performance is obtained for half-transparent quantum dots; further, this optimum may be enhanced for systems with few conduction modes.
Sohail, Amjad; Zhang, Yang; Zhang, Jun; Yu, Chang-Shui
2016-06-28
We analytically study the optomechanically induced transparency (OMIT) in the N-cavity system with the Nth cavity driven by pump, probing laser fields and the 1st cavity coupled to mechanical oscillator. We also consider that one atom could be trapped in the ith cavity. Instead of only illustrating the OMIT in such a system, we are interested in how the number of OMIT windows is influenced by the cavities and the atom and what roles the atom could play in different cavities. In the resolved sideband regime, we find that, the number of cavities precisely determines the maximal number of OMIT windows. It is interesting that, when the two-level atom is trapped in the even-labeled cavity, the central absorptive peak (odd N) or dip (even N) is split and forms an extra OMIT window, but if the atom is trapped in the odd-labeled cavity, the central absorptive peak (odd N) or dip (even N) is only broadened and thus changes the width of the OMIT windows rather than induces an extra window.
Energy Technology Data Exchange (ETDEWEB)
Sarabi, B.; Ramanayaka, A. N. [Laboratory for Physical Sciences, College Park, Maryland 20740 (United States); Department of Physics, University of Maryland, College Park, Maryland 20742 (United States); Burin, A. L. [Department of Chemistry, Tulane University, New Orleans, Louisiana 70118 (United States); Wellstood, F. C. [Department of Physics, University of Maryland, College Park, Maryland 20742 (United States); Joint Quantum Institute, University of Maryland, College Park, Maryland 20742 (United States); Osborn, K. D. [Laboratory for Physical Sciences, College Park, Maryland 20740 (United States); Joint Quantum Institute, University of Maryland, College Park, Maryland 20742 (United States)
2015-04-27
Random tunneling two-level systems (TLSs) in dielectrics have been of interest recently because they adversely affect the performance of superconducting qubits. The coupling of TLSs to qubits has allowed individual TLS characterization, which has previously been limited to TLSs within (thin) Josephson tunneling barriers made from aluminum oxide. Here, we report on the measurement of an individual TLS within the capacitor of a lumped-element LC microwave resonator, which forms a cavity quantum electrodynamics (CQED) system and allows for individual TLS characterization in a different structure and material than demonstrated with qubits. Due to the reduced volume of the dielectric (80 μm{sup 3}), even with a moderate dielectric thickness (250 nm), we achieve the strong coupling regime as evidenced by the vacuum Rabi splitting observed in the cavity spectrum. A TLS with a coherence time of 3.2 μs was observed in a film of silicon nitride as analyzed with a Jaynes-Cummings spectral model, which is larger than seen from superconducting qubits. As the drive power is increased, we observe an unusual but explicable set of continuous and discrete crossovers from the vacuum Rabi split transitions to the Glauber (coherent) state.
Abbout, Adel; Ouerdane, Henni; Goupil, Christophe
2016-01-01
Using the tools of random matrix theory we develop a statistical analysis of the transport properties of thermoelectric low-dimensional systems made of two electron reservoirs set at different temperatures and chemical potentials, and connected through a low-density-of-states two-level quantum dot that acts as a conducting chaotic cavity. Our exact treatment of the chaotic behavior in such devices lies on the scattering matrix formalism and yields analytical expressions for the joint probability distribution functions of the Seebeck coefficient and the transmission profile, as well as the marginal distributions, at arbitrary Fermi energy. The scattering matrices belong to circular ensembles which we sample to numerically compute the transmission function, the Seebeck coefficient, and their relationship. The exact transport coefficients probability distributions are found to be highly non-Gaussian for small numbers of conduction modes, and the analytical and numerical results are in excellent agreement. The system performance is also studied, and we find that the optimum performance is obtained for half-transparent quantum dots; further, this optimum may be enhanced for systems with few conduction modes.
Shen, H Z; Shao, X Q; Wang, G C; Zhao, X L; Yi, X X
2016-01-01
The quantum phase transition (QPT) describes a sudden qualitative change of the macroscopic properties mapped from the eigenspectrum of a quantum many-body system. It has been studied intensively in quantum systems with the spin-boson model, but it has barely been explored for systems in coupled spin-boson models. In this paper, we study the QPT with coupled spin-boson models consisting of coupled two-level atoms embedded in three-dimensional anisotropic photonic crystals. The dynamics of the system is derived exactly by means of the Laplace transform method, which has been proven to be equivalent to the dissipationless non-Markovian dynamics. Drawing on methods for analyzing the ground state, we obtain the phase diagrams through two exact critical equations and two QPTs are found: one QPT is that from the phase without one bound state to the phase with one bound state and another is that from one phase with the bound state having one eigenvalue to another phase where the bound state has two eigenvalues. Our analytical results also suggest a way of control to overcome the effect of decoherence by engineering the spectrum of the reservoirs to approach the non-Markovian regime and to form the bound state of the whole system for quantum devices and quantum statistics.
International Nuclear Information System (INIS)
Liao, Ping; Yu, Song; Luo, Bin; Shen, Jing; Gu, Wanyi; Guo, Hong
2011-01-01
We theoretically propose a scheme of phase-controlled all-optical switching due to the effect of degenerate four-wave mixing (FWM) and coherent population oscillation (CPO) in a two-level system driven by a strong coupling field and two weak symmetrically detuned fields. The results show that the phase of the FWM field can be utilized to switch between constructive and destructive interference, which can lead to the transmission or attenuation of the probe field and thus switch the field on or off. We also find the intensity of the coupling field and the propagation distance have great influence on the performance of the switching. In our scheme, due to the quick response in semiconductor systems, a fast all-optical switching can be realized at low light level. -- Highlights: ► We study a new all-optical switching based on coherent population oscillation. ► The phase of the FWM field can be utilized to switch the probe field on or off. ► A fast and low-light-level switching can be realized in semiconductors.
International Nuclear Information System (INIS)
Malossi, N; Arimondo, E; Ciampini, D; Mannella, R; Bason, M G; Viteau, M; Morsch, O
2013-01-01
A fundamental requirement in quantum information processing and in many other areas of science is the capability of precisely controlling a quantum system by preparing a quantum state with the highest fidelity and/or in the fastest possible way. Here we present an experimental investigation of a two level system, characterized by a time-dependent Landau-Zener Hamiltonian, aiming to test general and optimal high-fidelity control protocols. The experiment is based on a Bose-Einstein condensate (BEC) loaded into an optical lattice, then accelerated, which provides a high degree of control over the experimental parameters. We implement generalized Landau-Zener sweeps, comparing them with the well-known linear Landau-Zener sweep. We drive the system from an initial state to a final state with fidelity close to unity in the shortest possible time (quantum brachistochrone), thus reaching the ultimate speed limit imposed by quantum mechanics. On the opposite extreme of the quantum control spectrum, the aim is not to minimize the total transition time but to maximize the adiabaticity during the time-evolution, the system being constrained to the adiabatic ground state at any time. We implement such transitionless superadiabatic protocols by an appropriate transformation of the Hamiltonian parameters. This transformation is general and independent of the physical system.
International Nuclear Information System (INIS)
Hausinger, Johannes; Grifoni, Milena
2010-01-01
We study the dissipative dynamics of a two-level system (TLS) exposed to strong ac driving. By combining Floquet theory with Van Vleck perturbation theory in the TLS tunneling matrix element, we diagonalize the time-dependent Hamiltonian and provide corrections to the renormalized Rabi frequency of the TLS, which are valid for both a biased and unbiased TLS and go beyond the known high-frequency and rotating-wave results. In order to mimic environmental influences on the TLS, we couple the system weakly to a thermal bath and solve analytically the corresponding Floquet-Bloch-Redfield master equation. We give a closed expression for the relaxation and dephasing rates of the TLS and discuss their behavior under variation of the driving amplitude. Further, we examine the robustness of coherent destruction of tunneling (CDT) and driving-induced tunneling oscillations (DITO). We show that also for a moderate driving frequency an almost complete suppression of tunneling can be achieved for short times and demonstrate the sensitiveness of DITO to a change of the external parameters.
Directory of Open Access Journals (Sweden)
Ryuto Shigenobu
2017-05-01
Full Text Available High penetration of distributed generators (DGs using renewable energy sources (RESs is raising some important issues in the operation of modern power system. The output power of RESs fluctuates very steeply, and that include uncertainty with weather conditions. This situation causes voltage deviation and reverse power flow. Several methods have been proposed for solving these problems. Fundamentally, these methods involve reactive power control for voltage deviation and/or the installation of large battery energy storage system (BESS at the interconnection point for reverse power flow. In order to reduce the installation cost of static var compensator (SVC, Distribution Company (DisCo gives reactive power incentive to the cooperating customers. On the other hand, photovoltaic (PV generator, energy storage and electric vehicle (EV are introduced in customer side with the aim of achieving zero net energy homes (ZEHs. This paper proposes not only reactive power control but also active power flow control using house BESS and EV. Moreover, incentive method is proposed to promote participation of customers in the control operation. Demand response (DR system is verified with several DR menu. To create profit for both side of DisCo and customer, two level optimization approach is executed in this research. Mathematical modeling of price elasticity and detailed simulations are executed by case study. The effectiveness of the proposed incentive menu is demonstrated by using heuristic optimization method.
International Nuclear Information System (INIS)
Parkhomenko, A.I.; Shalagin, A.M.
2006-01-01
One studied theoretically spectrum of absorption (intensification) of a weak sounding field by two-level atoms moving in a strong resonance laser field and colliding with buffer gas atoms. The analysis was performed for the case of small frequencies of collisions in contrast to the Doppler width of absorption line (gas low pressure) with regard to the arbitrary variation of a radiation induced dipole moment phase at elastic collisions of gas particles. The effects of phase memory are found to result in very strong quantitative and qualitative transformation of a test field spectrum even in case of infrequent collisions when the well-known Dike mechanism of manifestation of phase memory effects (elimination of the Doppler widening due to limitation of spatial motion of particles by collisions) does not work. Strong influence of phase memory effects on spectral resonances at gas low pressure results from the fact that phase retaining collisions change dependence on velocity of the partial index of refraction n(v) (index of refraction for particles moving with v velocity) [ru
Molamohamadi, Zohreh; Arshizadeh, Rahman; Ismail, Napsiah
2015-05-01
In the classical inventory model, it was assumed that the retailer must settle the accounts of the purchased items as soon as they are received. In practice, however, the supplier usually offers a full or partial delay period to the retailer to pay for the amount of the purchasing costs. In the partial trade credit contract, which is mostly applied to avoid non-payment risks, the retailer must pay for a portion of the purchased goods at the time of ordering and may delay settling the rest until the end of the predefined agreed upon period, so-called credit period. This paper assumes a two-level partial trade credit where both supplier and retailer offer a partial trade credit to their downstream members. The objective here is to determine the retailer's ordering policy of a deteriorating item by formulating his economic order quantity (EOQ) inventory system with backorder as a cost minimization problem. The sensitivity of the variables on different parameters has been also analyzed by applying numerical examples.
Mang, Andreas; Biros, George
2017-01-01
We propose an efficient numerical algorithm for the solution of diffeomorphic image registration problems. We use a variational formulation constrained by a partial differential equation (PDE), where the constraints are a scalar transport equation. We use a pseudospectral discretization in space and second-order accurate semi-Lagrangian time stepping scheme for the transport equations. We solve for a stationary velocity field using a preconditioned, globalized, matrix-free Newton-Krylov scheme. We propose and test a two-level Hessian preconditioner. We consider two strategies for inverting the preconditioner on the coarse grid: a nested preconditioned conjugate gradient method (exact solve) and a nested Chebyshev iterative method (inexact solve) with a fixed number of iterations. We test the performance of our solver in different synthetic and real-world two-dimensional application scenarios. We study grid convergence and computational efficiency of our new scheme. We compare the performance of our solver against our initial implementation that uses the same spatial discretization but a standard, explicit, second-order Runge-Kutta scheme for the numerical time integration of the transport equations and a single-level preconditioner. Our improved scheme delivers significant speedups over our original implementation. As a highlight, we observe a 20 × speedup for a two dimensional, real world multi-subject medical image registration problem.
A Novel Scheme to Minimize Hop Count for GAF in Wireless Sensor Networks: Two-Level GAF
Directory of Open Access Journals (Sweden)
Vaibhav Soni
2015-01-01
Full Text Available In wireless sensor networks, geographic adaptive fidelity (GAF is one of the most popular energy-aware routing protocols. It conserves energy by identifying equivalence between sensors from a routing perspective and then turning off unnecessary sensors, while maintaining the connectivity of the network. Nevertheless, the traditional GAF still cannot reach the optimum energy usage since it needs more number of hops to transmit data packets to the sink. As a result, it also leads to higher packet delay. In this paper, we propose a modified version of GAF to minimize hop count for data routing, called two-level GAF (T-GAF. Furthermore, we use a generalized version of GAF called Diagonal-GAF (DGAF where two diagonal adjacent grids can also directly communicate. It has an advantage of less overhead of coordinator election based on the residual energy of sensors. Analysis and simulation results show significant improvements of the proposed work comparing to traditional GAF in the aspect of total hop count, energy consumption, total distance covered by the data packet before reaching the sink, and packet delay. As a result, compared to traditional GAF, it needs 40% to 47% less hop count and consumes 27% to 35% less energy to extend the network lifetime.
TREE SELECTING AND TREE RING MEASURING IN DENDROCHRONOLOGICAL INVESTIGATIONS
Directory of Open Access Journals (Sweden)
Sefa Akbulut
2004-04-01
Full Text Available Dendrochronology is a method of dating which makes use of the annual nature of tree growth. Dendrochronology may be divided into a number of subfields, each of which covers one or more aspects of the use of tree ring data: dendroclimatology, dendrogeomorphology, dendrohydrology, dendroecology, dendroarchaelogy, and dendrogylaciology. Basic of all form the analysis of the tree rings. The wood or tree rings can aid to dating past events about climatology, ecology, geology, hydrology. Dendrochronological studies are conducted either on increment cores or on discs. It may be seen abnormalities on tree rings during the measurement like that false rings, missing rings, reaction wood. Like that situation, increment cores must be extracted from four different sides of each tree and be studied as more as on tree.
Tree Colors: Color Schemes for Tree-Structured Data.
Tennekes, Martijn; de Jonge, Edwin
2014-12-01
We present a method to map tree structures to colors from the Hue-Chroma-Luminance color model, which is known for its well balanced perceptual properties. The Tree Colors method can be tuned with several parameters, whose effect on the resulting color schemes is discussed in detail. We provide a free and open source implementation with sensible parameter defaults. Categorical data are very common in statistical graphics, and often these categories form a classification tree. We evaluate applying Tree Colors to tree structured data with a survey on a large group of users from a national statistical institute. Our user study suggests that Tree Colors are useful, not only for improving node-link diagrams, but also for unveiling tree structure in non-hierarchical visualizations.
Rate of tree carbon accumulation increases continuously with tree size.
Stephenson, N L; Das, A J; Condit, R; Russo, S E; Baker, P J; Beckman, N G; Coomes, D A; Lines, E R; Morris, W K; Rüger, N; Alvarez, E; Blundo, C; Bunyavejchewin, S; Chuyong, G; Davies, S J; Duque, A; Ewango, C N; Flores, O; Franklin, J F; Grau, H R; Hao, Z; Harmon, M E; Hubbell, S P; Kenfack, D; Lin, Y; Makana, J-R; Malizia, A; Malizia, L R; Pabst, R J; Pongpattananurak, N; Su, S-H; Sun, I-F; Tan, S; Thomas, D; van Mantgem, P J; Wang, X; Wiser, S K; Zavala, M A
2014-03-06
Forests are major components of the global carbon cycle, providing substantial feedback to atmospheric greenhouse gas concentrations. Our ability to understand and predict changes in the forest carbon cycle--particularly net primary productivity and carbon storage--increasingly relies on models that represent biological processes across several scales of biological organization, from tree leaves to forest stands. Yet, despite advances in our understanding of productivity at the scales of leaves and stands, no consensus exists about the nature of productivity at the scale of the individual tree, in part because we lack a broad empirical assessment of whether rates of absolute tree mass growth (and thus carbon accumulation) decrease, remain constant, or increase as trees increase in size and age. Here we present a global analysis of 403 tropical and temperate tree species, showing that for most species mass growth rate increases continuously with tree size. Thus, large, old trees do not act simply as senescent carbon reservoirs but actively fix large amounts of carbon compared to smaller trees; at the extreme, a single big tree can add the same amount of carbon to the forest within a year as is contained in an entire mid-sized tree. The apparent paradoxes of individual tree growth increasing with tree size despite declining leaf-level and stand-level productivity can be explained, respectively, by increases in a tree's total leaf area that outpace declines in productivity per unit of leaf area and, among other factors, age-related reductions in population density. Our results resolve conflicting assumptions about the nature of tree growth, inform efforts to undertand and model forest carbon dynamics, and have additional implications for theories of resource allocation and plant senescence.
YBYRÁ facilitates comparison of large phylogenetic trees.
Machado, Denis Jacob
2015-07-01
The number and size of tree topologies that are being compared by phylogenetic systematists is increasing due to technological advancements in high-throughput DNA sequencing. However, we still lack tools to facilitate comparison among phylogenetic trees with a large number of terminals. The "YBYRÁ" project integrates software solutions for data analysis in phylogenetics. It comprises tools for (1) topological distance calculation based on the number of shared splits or clades, (2) sensitivity analysis and automatic generation of sensitivity plots and (3) clade diagnoses based on different categories of synapomorphies. YBYRÁ also provides (4) an original framework to facilitate the search for potential rogue taxa based on how much they affect average matching split distances (using MSdist). YBYRÁ facilitates comparison of large phylogenetic trees and outperforms competing software in terms of usability and time efficiency, specially for large data sets. The programs that comprises this toolkit are written in Python, hence they do not require installation and have minimum dependencies. The entire project is available under an open-source licence at http://www.ib.usp.br/grant/anfibios/researchSoftware.html .
tropiTree: An NGS-Based EST-SSR Resource for 24 Tropical Tree Species
Russell, Joanne R.; Hedley, Peter E.; Cardle, Linda; Dancey, Siobhan; Morris, Jenny; Booth, Allan; Odee, David; Mwaura, Lucy; Omondi, William; Angaine, Peter; Machua, Joseph; Muchugi, Alice; Milne, Iain; Kindt, Roeland; Jamnadass, Ramni; Dawson, Ian K.
2014-01-01
The development of genetic tools for non-model organisms has been hampered by cost, but advances in next-generation sequencing (NGS) have created new opportunities. In ecological research, this raises the prospect for developing molecular markers to simultaneously study important genetic processes such as gene flow in multiple non-model plant species within complex natural and anthropogenic landscapes. Here, we report the use of bar-coded multiplexed paired-end Illumina NGS for the de novo development of expressed sequence tag-derived simple sequence repeat (EST-SSR) markers at low cost for a range of 24 tree species. Each chosen tree species is important in complex tropical agroforestry systems where little is currently known about many genetic processes. An average of more than 5,000 EST-SSRs was identified for each of the 24 sequenced species, whereas prior to analysis 20 of the species had fewer than 100 nucleotide sequence citations. To make results available to potential users in a suitable format, we have developed an open-access, interactive online database, tropiTree (http://bioinf.hutton.ac.uk/tropiTree), which has a range of visualisation and search facilities, and which is a model for the efficient presentation and application of NGS data. PMID:25025376
International Nuclear Information System (INIS)
1981-09-01
Suggestion are made concerning the method of the fault tree analysis, the use of certain symbols in the examination of system failures. This purpose of the fault free analysis is to find logical connections of component or subsystem failures leading to undesirable occurrances. The results of these examinations are part of the system assessment concerning operation and safety. The objectives of the analysis are: systematical identification of all possible failure combinations (causes) leading to a specific undesirable occurrance, finding of reliability parameters such as frequency of failure combinations, frequency of the undesirable occurrance or non-availability of the system when required. The fault tree analysis provides a near and reconstructable documentation of the examination. (orig./HP) [de
International Nuclear Information System (INIS)
Brandhuber, Andreas; Spence, Bill; Travaglini, Gabriele
2011-01-01
We review two novel techniques used to calculate tree-level scattering amplitudes efficiently: MHV diagrams, and on-shell recursion relations. For the MHV diagrams, we consider applications to tree-level amplitudes and focus in particular on the N=4 supersymmetric formulation. We also briefly describe the derivation of loop amplitudes using MHV diagrams. For the recursion relations, after presenting their general proof, we discuss several applications to massless theories with and without supersymmetry, to theories with massive particles, and to graviton amplitudes in general relativity. This article is an invited review for a special issue of Journal of Physics A: Mathematical and Theoretical devoted to 'Scattering amplitudes in gauge theories'. (review)
Tree Rings: Timekeepers of the Past.
Phipps, R. L.; McGowan, J.
One of a series of general interest publications on science issues, this booklet describes the uses of tree rings in historical and biological recordkeeping. Separate sections cover the following topics: dating of tree rings, dating with tree rings, tree ring formation, tree ring identification, sample collections, tree ring cross dating, tree…
Directory of Open Access Journals (Sweden)
Rob Garbutt
2013-10-01
Full Text Available Our paper focuses on the materiality, cultural history and cultural relations of selected artworks in the exhibition Wood for the trees (Lismore Regional Gallery, New South Wales, Australia, 10 June – 17 July 2011. The title of the exhibition, intentionally misreading the aphorism “Can’t see the wood for the trees”, by reading the wood for the resource rather than the collective wood[s], implies conservation, preservation, and the need for sustaining the originating resource. These ideas have particular resonance on the NSW far north coast, a region once rich in rainforest. While the Indigenous population had sustainable practices of forest and land management, the colonists deployed felling and harvesting in order to convert the value of the local, abundant rainforest trees into high-value timber. By the late twentieth century, however, a new wave of settlers launched a protest movements against the proposed logging of remnant rainforest at Terania Creek and elsewhere in the region. Wood for the trees, curated by Gallery Director Brett Adlington, plays on this dynamic relationship between wood, trees and people. We discuss the way selected artworks give expression to the themes or concepts of productive labour, nature and culture, conservation and sustainability, and memory. The artworks include Watjinbuy Marrawilil’s (1980 Carved ancestral figure ceremonial pole, Elizabeth Stops’ (2009/10 Explorations into colonisation, Hossein Valamanesh’s (2008 Memory stick, and AñA Wojak’s (2008 Unread book (in a forgotten language. Our art writing on the works, a practice informed by Bal (2002, Muecke (2008 and Papastergiadis (2004, becomes a conversation between the works and the themes or concepts. As a form of material excess of the most productive kind (Grosz, 2008, p. 7, art seeds a response to that which is in the air waiting to be said of the past, present and future.
Recursive Trees for Practical ORAM
Directory of Open Access Journals (Sweden)
Moataz Tarik
2015-06-01
Full Text Available We present a new, general data structure that reduces the communication cost of recent tree-based ORAMs. Contrary to ORAM trees with constant height and path lengths, our new construction r-ORAM allows for trees with varying shorter path length. Accessing an element in the ORAM tree results in different communication costs depending on the location of the element. The main idea behind r-ORAM is a recursive ORAM tree structure, where nodes in the tree are roots of other trees. While this approach results in a worst-case access cost (tree height at most as any recent tree-based ORAM, we show that the average cost saving is around 35% for recent binary tree ORAMs. Besides reducing communication cost, r-ORAM also reduces storage overhead on the server by 4% to 20% depending on the ORAM’s client memory type. To prove r-ORAM’s soundness, we conduct a detailed overflow analysis. r-ORAM’s recursive approach is general in that it can be applied to all recent tree ORAMs, both constant and poly-log client memory ORAMs. Finally, we implement and benchmark r-ORAM in a practical setting to back up our theoretical claims.
Effects of apple branch biochar on soil C mineralization and nutrient cycling under two levels of N.
Li, Shuailin; Liang, Chutao; Shangguan, Zhouping
2017-12-31
The incorporation of biochar into soil has been proposed as a strategy for enhancing soil fertility and crop productivity. However, there is limited information regarding the responses of soil respiration and the C, N and P cycles to the addition of apple branch biochar at different rates to soil with different levels of N. A 108-day incubation experiment was conducted to investigate the effects of the rate of biochar addition (0, 1, 2 and 4% by mass) on soil respiration and nutrients and the activities of enzymes involved in C, N and P cycling under two levels of N. Our results showed that the application of apple branch biochar at rates of 2% and 4% increased the C-mineralization rate, while biochar amendment at 1% decreased the C-mineralization rate, regardless of the N level. The soil organic C and microbial biomass C and P contents increased as the rate of biochar addition was increased to 2%. The biochar had negative effects on β-glucosidase, N-acetyl-β-glucosaminidase and urease activity in N-poor soil but exerted a positive effect on all of these factors in N-rich soil. Alkaline phosphatase activity increased with an increase in the rate of biochar addition, but the available P contents after all biochar addition treatments were lower than those obtained in the treatments without biochar. Biochar application at rates of 2% and 4% reduced the soil nitrate content, particularly in N-rich soil. Thus, apple branch biochar has the potential to sequester C and improve soil fertility, but the responses of soil C mineralization and nutrient cycling depend on the rate of addition and soil N levels. Copyright © 2017 Elsevier B.V. All rights reserved.
Directory of Open Access Journals (Sweden)
Álvaro Morales
2014-04-01
Full Text Available Corn (Zea mays L. silage (CS is a nutritious food that can be used as a supplement in dairy cows. The aim of this study was to determine the effect of supplementation with two amounts of CS on milk production and composition, live weight and body condition, as well as on some blood indicators for energy and protein metabolism on dairy cows in early lactation and grazing low mass pasture during autumn. The study was carried out in 40 Holstein Friesian cows over 57 d. Prior to experimental treatment, milk production and days of lactation averaged 24.1 ± 2.8 kg d-1 and 62 ± 14 d, respectively. The dietary treatments consisted of two levels of supplementation with CS; 4.5 and 9 kg DM cow-1 d-1 (treatments LCS and HCS, respectively. Additionally, all the cows received a pasture allowance of 21 and 3 kg DM cow-1 d-1 of concentrate. Milk composition was determined using infrared spectrophotometry, while blood indicators were obtained using an autoanalyzer. There were not differences between treatments regarding milk production or composition, total DM or energy intake. Herbage and protein intake was higher for LCS treatment (P < 0.001. Increasing supplementation decreased (P < 0.001 daily weight gain but did not affect body condition. Plasma concentrations of βOH-butyrate were lower (P = 0.038 for the LCS treatment; while urea concentrations were higher (P = 0.003, with no differences for non-esterified fatty acids (NEFA concentrations. Supplementation with 4.5 kg d-1 of CS was sufficient to meet the production requirements of the cows.
Nolan, Brodie; Tien, Homer; Sawadsky, Bruce; Rizoli, Sandro; McFarlan, Amanda; Phillips, Andrea; Ackery, Alun
2017-01-01
Helicopter emergency medical services (HEMS) have become an engrained component of trauma systems. In Ontario, transportation for trauma patients is through one of three ways: scene call, modified scene call, or interfacility transfer. We hypothesize that differences exist between these types of transports in both patient demographics and patient outcomes. This study compares the characteristics of patients transported by each of these methods to two level 1 trauma centers and assesses for any impact on morbidity or mortality. As a secondary outcome reasons for delay were identified. A local trauma registry was used to identify and abstract data for all patients transported to two trauma centers by HEMS over a 36-month period. Further chart abstraction using the HEMS patient care reports was done to identify causes of delay during HEMS transport. During the study period HEMS transferred a total of 911 patients of which 139 were scene calls, 333 were modified scene calls and 439 were interfacility transfers. Scene calls had more patients with an ISS of less than 15 and had more patients discharged home from the ED. Modified scene calls had more patients with an ISS greater than 25. The most common delays that were considered modifiable included the sending physician doing a procedure, waiting to meet a land EMS crew, delays for diagnostic imaging and confirming disposition or destination. Differences exist between the types of transports done by HEMS for trauma patients. Many identified reasons for delay to HEMS transport are modifiable and have practical solutions. Future research should focus on solutions to identified delays to HEMS transport. Key words: helicopter emergency medical services; trauma; prehospital care; delays.
Ghafouri, H. R.; Mosharaf-Dehkordi, M.; Afzalan, B.
2017-07-01
A simulation-optimization model is proposed for identifying the characteristics of local immiscible NAPL contaminant sources inside aquifers. This model employs the UTCHEM 9.0 software as its simulator for solving the governing equations associated with the multi-phase flow in porous media. As the optimization model, a novel two-level saturation based Imperialist Competitive Algorithm (ICA) is proposed to estimate the parameters of contaminant sources. The first level consists of three parallel independent ICAs and plays as a pre-conditioner for the second level which is a single modified ICA. The ICA in the second level is modified by dividing each country into a number of provinces (smaller parts). Similar to countries in the classical ICA, these provinces are optimized by the assimilation, competition, and revolution steps in the ICA. To increase the diversity of populations, a new approach named knock the base method is proposed. The performance and accuracy of the simulation-optimization model is assessed by solving a set of two and three-dimensional problems considering the effects of different parameters such as the grid size, rock heterogeneity and designated monitoring networks. The obtained numerical results indicate that using this simulation-optimization model provides accurate results at a less number of iterations when compared with the model employing the classical one-level ICA. A model is proposed to identify characteristics of immiscible NAPL contaminant sources. The contaminant is immiscible in water and multi-phase flow is simulated. The model is a multi-level saturation-based optimization algorithm based on ICA. Each answer string in second level is divided into a set of provinces. Each ICA is modified by incorporating a new knock the base model.
Directory of Open Access Journals (Sweden)
Aditi Khanna
2017-01-01
Full Text Available Quality decisions are one of the major decisions in inventory management. It affects customer’s demand, loyalty and customer satisfaction and also inventory costs. Every manufacturing process is inherent to have some chance causes of variation which may lead to some defectives in the lot. So, in order to cater the customers with faultless products, an inspection process is inevitable, which may also be prone to errors. Thus for an operations manager, maintaining the quality of the lot and the screening process becomes a challenging task, when his objective is to determine the optimal order quantity for the inventory system. Besides these operational tasks, the goal is also to increase the customer base which eventually leads to higher profits. So, as a promotional tool, trade credit is being offered by both the retailer and supplier to their respective customers to encourage more frequent and higher volume purchases. Thus taking into account of these facts, a strategic production model is formulated here to study the combined effects of imperfect quality items, faulty inspection process, rework process, sales return under two level trade credit. The present study is a general framework for many articles and classical EPQ model. An analytical method is employed which jointly optimizes the retailer’s credit period and order quantity, so as to maximize the expected total profit per unit time. To study the behavior and application of the model, a numerical example has been cited and a comprehensive sensitivity analysis has been performed. The model can be widely applicable in manufacturing industries like textile, footwear, plastics, electronics, furniture etc.
On the Performance Optimization of Two-Level Three-Phase Grid-Feeding Voltage-Source Inverters
Directory of Open Access Journals (Sweden)
Issam A. Smadi
2018-02-01
Full Text Available The performance optimization of the two-level, three-phase, grid-feeding, voltage-source inverter (VSI is studied in this paper, which adopts an online adaptive switching frequency algorithm (OASF. A new degree of freedom has been added to the employed OASF algorithm for optimal selection of the weighting factor and overall system optimization design. Toward that end, a full mathematical formulation, including the impact of the coupling inductor and the controller response time, is presented. At first, the weighting factor is selected to favor the switching losses, and the controller gains are optimized by minimizing the integral time-weighted absolute error (ITAE of the output active and reactive power. Different loading and ambient temperature conditions are considered to validate the optimized controller and its fast response through online field programmable gate array (FPGA-in-the-loop. Then, the weighting factor is optimally selected to reduce the cost of the L-filter and the heat-sink. An optimization problem to minimize the cost design at the worst case of loading condition for grid-feeding VSI is formulated. The results from this optimization problem are the filter inductance, the thermal resistance of the heat-sink, and the optimal switching frequency with the optimal weighting factor. The VSI test-bed using the optimized parameters is used to verify the proposed work experimentally. Adopting the OASF algorithm that employs the optimal weighting factor for grid-feeding VSI, the percentages of the reductions in the slope of the steady state junction temperature profile compared to fixed frequencies of 10 kHz, 14.434 kHz, and 20 kHz are about 6%, 30%, and 18%, respectively.
Directory of Open Access Journals (Sweden)
Sandra Yamile Martínez
2010-12-01
Full Text Available Objetive: To identify biopsychosocial characteristics preceding the pregnancy in teenagers that went to see the doctor in two level one medical centers in Popayán. Method: Descriptive study, gathering and analysing qualitative and quantitative information. Results: 38 teenagers with an average age of 16.37 years at conception. 90% (34 were first-time mothers. 73% (28 were attending high school and 68% (26 were from a low socioeconomic background. 36.8% (14 were planning a future involving study and work. 46% (17 had dropped out from school. The young girls average age and of commencing sexual activities are 12.89 and 15.32 respectively. 71% 27 had a sexual partner and mentioned that the main reasons for getting pregnant were falling in love and loneliness. Dysfunctional families were a notable feature with 32% (12 coming from broken nuclear families. In order of frequency, social activities in their free time 22/38; 34.2% (13 spend time with their boyfriends. 55%( 21 did not use any contraceptive. 50% (19 heard negative comments against teenage motherhood before their pregnancy. 63% (24 did not plan to get pregnant. 71% 27 had their mother, cousins or a friend with a history of teenage pregnancy. Conclusions: In this population, pregnancy is perhaps a way to establish the sexual identity. It is probable that there is an influence of the repetitive generational pattern of pregnancy at an early age. Teenagers find it viable to adopt adult roles to establish their identity creating a false identity, in addition the limited support from their parents lead them to a marriage or pregnancy as a way to reaffirm their role.
Banerjee, Amartya S; Lin, Lin; Suryanarayana, Phanish; Yang, Chao; Pask, John E
2018-06-12
We describe a novel iterative strategy for Kohn-Sham density functional theory calculations aimed at large systems (>1,000 electrons), applicable to metals and insulators alike. In lieu of explicit diagonalization of the Kohn-Sham Hamiltonian on every self-consistent field (SCF) iteration, we employ a two-level Chebyshev polynomial filter based complementary subspace strategy to (1) compute a set of vectors that span the occupied subspace of the Hamiltonian; (2) reduce subspace diagonalization to just partially occupied states; and (3) obtain those states in an efficient, scalable manner via an inner Chebyshev filter iteration. By reducing the necessary computation to just partially occupied states and obtaining these through an inner Chebyshev iteration, our approach reduces the cost of large metallic calculations significantly, while eliminating subspace diagonalization for insulating systems altogether. We describe the implementation of the method within the framework of the discontinuous Galerkin (DG) electronic structure method and show that this results in a computational scheme that can effectively tackle bulk and nano systems containing tens of thousands of electrons, with chemical accuracy, within a few minutes or less of wall clock time per SCF iteration on large-scale computing platforms. We anticipate that our method will be instrumental in pushing the envelope of large-scale ab initio molecular dynamics. As a demonstration of this, we simulate a bulk silicon system containing 8,000 atoms at finite temperature, and obtain an average SCF step wall time of 51 s on 34,560 processors; thus allowing us to carry out 1.0 ps of ab initio molecular dynamics in approximately 28 h (of wall time).
Making CSB + -Trees Processor Conscious
DEFF Research Database (Denmark)
Samuel, Michael; Pedersen, Anders Uhl; Bonnet, Philippe
2005-01-01
of the CSB+-tree. We argue that it is necessary to consider a larger group of parameters in order to adapt CSB+-tree to processor architectures as different as Pentium and Itanium. We identify this group of parameters and study how it impacts the performance of CSB+-tree on Itanium 2. Finally, we propose......Cache-conscious indexes, such as CSB+-tree, are sensitive to the underlying processor architecture. In this paper, we focus on how to adapt the CSB+-tree so that it performs well on a range of different processor architectures. Previous work has focused on the impact of node size on the performance...... a systematic method for adapting CSB+-tree to new platforms. This work is a first step towards integrating CSB+-tree in MySQL’s heap storage manager....
Submodular unsplittable flow on trees
DEFF Research Database (Denmark)
Adamaszek, Anna Maria; Chalermsook, Parinya; Ene, Alina
2016-01-01
We study the Unsplittable Flow problem (UFP) on trees with a submodular objective function. The input to this problem is a tree with edge capacities and a collection of tasks, each characterized by a source node, a sink node, and a demand. A subset of the tasks is feasible if the tasks can...... simultaneously send their demands from the source to the sink without violating the edge capacities. The goal is to select a feasible subset of the tasks that maximizes a submodular objective function. Our main result is an O(k log n)-approximation algorithm for Submodular UFP on trees where k denotes...... the pathwidth of the given tree. Since every tree has pathwidth O(log n), we obtain an O(log2 n) approximation for arbitrary trees. This is the first non-trivial approximation guarantee for the problem and it matches the best approximation known for UFP on trees with a linear objective function. Our main...
Khina, Anatoly
2016-08-15
We consider the problem of stabilizing an unstable plant driven by bounded noise over a digital noisy communication link, a scenario at the heart of networked control. To stabilize such a plant, one needs real-time encoding and decoding with an error probability profile that decays exponentially with the decoding delay. The works of Schulman and Sahai over the past two decades have developed the notions of tree codes and anytime capacity, and provided the theoretical framework for studying such problems. Nonetheless, there has been little practical progress in this area due to the absence of explicit constructions of tree codes with efficient encoding and decoding algorithms. Recently, linear time-invariant tree codes were proposed to achieve the desired result under maximum-likelihood decoding. In this work, we take one more step towards practicality, by showing that these codes can be efficiently decoded using sequential decoding algorithms, up to some loss in performance (and with some practical complexity caveats). We supplement our theoretical results with numerical simulations that demonstrate the effectiveness of the decoder in a control system setting.
Rate of tree carbon accumulation increases continuously with tree size
Stephenson, N.L.; Das, A.J.; Condit, R.; Russo, S.E.; Baker, P.J.; Beckman, N.G.; Coomes, D.A.; Lines, E.R.; Morris, W.K.; Rüger, N.; Álvarez, E.; Blundo, C.; Bunyavejchewin, S.; Chuyong, G.; Davies, S.J.; Duque, Á.; Ewango, C.N.; Flores, O.; Franklin, J.F.; Grau, H.R.; Hao, Z.; Harmon, M.E.; Hubbell, S.P.; Kenfack, D.; Lin, Y.; Makana, J.-R.; Malizia, A.; Malizia, L.R.; Pabst, R.J.; Pongpattananurak, N.; Su, S.-H.; Sun, I-F.; Tan, S.; Thomas, D.; van Mantgem, P.J.; Wang, X.; Wiser, S.K.; Zavala, M.A.
2014-01-01
Forests are major components of the global carbon cycle, providing substantial feedback to atmospheric greenhouse gas concentrations. Our ability to understand and predict changes in the forest carbon cycle—particularly net primary productivity and carbon storage - increasingly relies on models that represent biological processes across several scales of biological organization, from tree leaves to forest stands. Yet, despite advances in our understanding of productivity at the scales of leaves and stands, no consensus exists about the nature of productivity at the scale of the individual tree, in part because we lack a broad empirical assessment of whether rates of absolute tree mass growth (and thus carbon accumulation) decrease, remain constant, or increase as trees increase in size and age. Here we present a global analysis of 403 tropical and temperate tree species, showing that for most species mass growth rate increases continuously with tree size. Thus, large, old trees do not act simply as senescent carbon reservoirs but actively fix large amounts of carbon compared to smaller trees; at the extreme, a single big tree can add the same amount of carbon to the forest within a year as is contained in an entire mid-sized tree. The apparent paradoxes of individual tree growth increasing with tree size despite declining leaf-level and stand-level productivity can be explained, respectively, by increases in a tree’s total leaf area that outpace declines in productivity per unit of leaf area and, among other factors, age-related reductions in population density. Our results resolve conflicting assumptions about the nature of tree growth, inform efforts to understand and model forest carbon dynamics, and have additional implications for theories of resource allocation and plant senescence.
Joshi, Vinayak S; Reinhardt, Joseph M; Garvin, Mona K; Abramoff, Michael D
2014-01-01
The separation of the retinal vessel network into distinct arterial and venous vessel trees is of high interest. We propose an automated method for identification and separation of retinal vessel trees in a retinal color image by converting a vessel segmentation image into a vessel segment map and identifying the individual vessel trees by graph search. Orientation, width, and intensity of each vessel segment are utilized to find the optimal graph of vessel segments. The separated vessel trees are labeled as primary vessel or branches. We utilize the separated vessel trees for arterial-venous (AV) classification, based on the color properties of the vessels in each tree graph. We applied our approach to a dataset of 50 fundus images from 50 subjects. The proposed method resulted in an accuracy of 91.44% correctly classified vessel pixels as either artery or vein. The accuracy of correctly classified major vessel segments was 96.42%.
Roy, Chiranjeeb
In this thesis we study the role of nonradiative degrees of freedom on quantum optical properties of mesoscopic quantum dots placed in the structured electromagnetic reservoir of a photonic crystal. We derive a quantum theory of the role of acoustic and optical phonons in modifying the optical absorption lineshape, polarization dynamics, and population dynamics of a two-level atom (quantum dot) in the "colored" electromagnetic vacuum of a photonic band gap (PBG) material. This is based on a microscopic Hamiltonian describing both radiative and vibrational processes quantum mechanically. Phonon sidebands in an ordinary electromagnetic reservoir are recaptured in a simple model of optical phonons using a mean-field factorization of the atomic and lattice displacement operators. Our formalism is then used to treat the non-Markovian dynamics of the same system within the structured electromagnetic density of states of a photonic crystal. We elucidate the extent to which phonon-assisted decay limits the lifetime of a single photon-atom bound state and derive the modified spontaneous emission dynamics due to coupling to various phonon baths. We demonstrate that coherent interaction with undamped phonons can lead to enhanced lifetime of a photon-atom bound state in a PBG by (i) dephasing and reducing the transition electric dipole moment of the atom and (ii) reducing the quantum mechanical overlap of the state vectors of the excited and ground state (polaronic shift). This results in reduction of the steady-state atomic polarization but an increase in the fractionalized upper state population in the photon-atom bound state. We demonstrate, on the other hand, that the lifetime of the photon-atom bound state in a PBG is limited by the lifetime of phonons due to lattice anharmonicities (break-up of phonons into lower energy phonons) and purely nonradiative decay. We demonstrate how these additional damping effects limit the extent of the polaronic (Franck-Condon) shift of
DEFF Research Database (Denmark)
Lykke, Marianne; Price, Susan; Delcambre, Lois
2012-01-01
Professional, workplace searching is different from general searching, because it is typically limited to specific facets and targeted to a single answer. We have developed the semantic component (SC) model, which is a search feature that allows searchers to structure and specify the search to co...
DEFF Research Database (Denmark)
2006-01-01
Sound search is provided by the major search engines, however, indexing is text based, not sound based. We will establish a dedicated sound search services with based on sound feature indexing. The current demo shows the concept of the sound search engine. The first engine will be realased June...
Rajashekar, TB
1998-01-01
The World Wide Web is emerging as an all-in-one information source. Tools for searching Web-based information include search engines, subject directories and meta search tools. We take a look at key features of these tools and suggest practical hints for effective Web searching.
Kawagoe, Kiyotomo
2001-01-01
Searches for new particles and new physics were extensively performed at LEP. Although no evidence for new particle/physics was discovered, the null results set very stringent limits to theories beyond the standard model. In this paper, searches at LEP and anomalies observed in the searches are presented. Future prospect of searches at the new energy frontier machines is also discussed.
On Determining if Tree-based Networks Contain Fixed Trees.
Anaya, Maria; Anipchenko-Ulaj, Olga; Ashfaq, Aisha; Chiu, Joyce; Kaiser, Mahedi; Ohsawa, Max Shoji; Owen, Megan; Pavlechko, Ella; St John, Katherine; Suleria, Shivam; Thompson, Keith; Yap, Corrine
2016-05-01
We address an open question of Francis and Steel about phylogenetic networks and trees. They give a polynomial time algorithm to decide if a phylogenetic network, N, is tree-based and pose the problem: given a fixed tree T and network N, is N based on T? We show that it is [Formula: see text]-hard to decide, by reduction from 3-Dimensional Matching (3DM) and further that the problem is fixed-parameter tractable.
Trees in the city: valuing street trees in Portland, Oregon
G.H. Donovan; D.T. Butry
2010-01-01
We use a hedonic price model to simultaneously estimate the effects of street trees on the sales price and the time-on-market (TOM) of houses in Portland. Oregon. On average, street trees add $8,870 to sales price and reduce TOM by 1.7 days. In addition, we found that the benefits of street trees spill over to neighboring houses. Because the provision and maintenance...
Application of Goal Tree-Success Tree model as the knowledge-base of operator advisory systems
International Nuclear Information System (INIS)
Kim, I.S.; Modarres, M.
1987-01-01
The most important portion of an expert system development is the articulation of knowledge by the expert and its satisfactory formulation in a suitable knowledge representation scheme for mechanization by a computer. A 'deep knowledge' approach called Goal Tree-Success Tree model is devised to represent complex dynamic domain knowledge. This approach can hierarchically model the underlying principles of a given process domain (for example nuclear power plant operations domain). The Goal Tree-Success Tree can then be used to represent the knowledge-base and provide means of selecting an efficient search routine in the inference engine of an expert system. A prototype expert system has been developed to demonstrate the method. This expert system models the operation of a typical system used in the pressurized water reactors. The expert system is modeled for real-time operations if an interface between plant parameters and the expert system is established. The real-time operation provides an ability to quickly remedy minor disturbances that can quickly lead to a system malfunction or trip. A description of both the Goal Tree-Success Tree model and the prototype expert system is presented. (orig.)
Pyndri: a Python Interface to the Indri Search Engine
Van Gysel, C.; Kanoulas, E.; de Rijke, M.; Jose, J.M.; Hauff, C.; Altıngovde, I.S.; Song, D.; Albakour, D.; Watt, S.; Tait, J.
2017-01-01
We introduce pyndri, a Python interface to the Indri search engine. Pyndri allows to access Indri indexes from Python at two levels: (1) dictionary and tokenized document collection, (2) evaluating queries on the index. We hope that with the release of pyndri, we will stimulate reproducible, open
Systolic trees and systolic language recognition by tree automata
Energy Technology Data Exchange (ETDEWEB)
Steinby, M
1983-01-01
K. Culik II, J. Gruska, A. Salomaa and D. Wood have studied the language recognition capabilities of certain types of systolically operating networks of processors (see research reports Cs-81-32, Cs-81-36 and Cs-82-01, Univ. of Waterloo, Ontario, Canada). In this paper, their model for systolic VLSI trees is formalised in terms of standard tree automaton theory, and the way in which some known facts about recognisable forests and tree transductions can be applied in VLSI tree theory is demonstrated. 13 references.
Kubisch, Petra; Hertel, Dietrich; Leuschner, Christoph
2015-01-01
While most temperate broad-leaved tree species form ectomycorrhizal (EM) symbioses, a few species have arbuscular mycorrhizas (AM). It is not known whether EM and AM tree species differ systematically with respect to fine root morphology, fine root system size and root functioning. In a species-rich temperate mixed forest, we studied the fine root morphology and biomass of three EM and three AM tree species from the genera Acer, Carpinus, Fagus, Fraxinus, and Tilia searching for principal dif...
Myanmar Language Search Engine
Pann Yu Mon; Yoshiki Mikami
2011-01-01
With the enormous growth of the World Wide Web, search engines play a critical role in retrieving information from the borderless Web. Although many search engines are available for the major languages, but they are not much proficient for the less computerized languages including Myanmar. The main reason is that those search engines are not considering the specific features of those languages. A search engine which capable of searching the Web documents written in those languages is highly n...
Armstrong, Mark
2016-01-01
The paper discusses situations in which consumers search through their options in a deliberate order, in contrast to more familiar models with random search. Topics include: network effects (consumers may be better off following the same search order as other consumers); the use of price and non-price advertising to direct search; the impact of consumers starting a new search with their previous supplier; the incentive sellers have to merge or co-locate with other sellers; and the incentive a...