检索结果-内蒙古大学图书馆

IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM)

作者： Kim, Young-Keun Kim, Kyung-Soo Handong Global Univ Dept Mech & Control Engn Pohang South Korea Korea Adv Inst Sci & Technol Dept Mech Eng Daejeon South Korea

ISBN: (纸本)9781479957361

This paper proposes a generalized algorithm of detecting six-degree-of-freedom (6-DOF) motions of an object with unknown surface curvature. The proposed system is a 6-DOF motion detection system for long distance range based on low cost laser distance sensors and a vision sensor. This does not require prior information on the geometric configurations of the feature points nor the surface curvature of the object. Simulations are conducted to validate the proposed algorithm on a regularly curved object.

关键词： Cameras Laser beams Measurement by laser beam Sensor systems Surface emitting lasers measurement by laser beam Sensor systems laser beams Cameras surface curvature Surface emitting lasers Feature Points generalized algorithm vision sensors Motion detection Curved

来源：评论

学校读者我要写书评

暂无评论

Theory of quanputers

引用

Journal of Mathematical Sciences 2008年第2期153卷 159-166页

作者： Makhaldiani, N. Laboratory of Information Technologies Joint Institute for Nuclear Research Dubna Moscow Region Russian Federation

In this paper, quantum computers are considered as a part of the family of the reversible, linearly-extended, dynamical systems called quanputers. For classical problems an operational reformulation is given. A universal algorithm for solving classical and quantum problems on quanputers is formulated. © 2008 Springer Science+Business Media, Inc.

关键词： DYNAMICAL SYSTEMS Quantum computers theories generalized algorithm family

来源：评论

学校读者我要写书评

暂无评论

Computation of many-particle quantum trajectories with exchange interaction: application to the simulation of nanoelectronic devices

引用

JOURNAL OF PHYSICS-CONDENSED MATTER 2013年第32期25卷 325601-325601页

作者： Alarcon, A. Yaro, S. Cartoixa, X. Oriols, X. Univ Autonoma Barcelona Dept Elect Engn Bellaterra 08193 Spain

Following Oriols (2007 Phys. Rev. Lett. 98 066803), an algorithm to deal with the exchange interaction in non-separable quantum systems is presented. The algorithm can be applied to fermions or bosons and, by construction, it exactly ensures that any observable is totally independent of the interchange of particles. It is based on the use of conditional Bohmian wave functions which are solutions of single-particle pseudo-Schrodinger equations. The exchange symmetry is directly defined by demanding symmetry properties of the quantum trajectories in the configuration space with a universal algorithm, rather than through a particular exchange-correlation functional introduced into the single-particle pseudo-Schrodinger equation. It requires the computation of N-2 conditional wave functions to deal with N identical particles. For separable Hamiltonians, the algorithm reduces to the standard Slater determinant for fermions (or permanent for bosons). A numerical test for a two-particle system, where exact solutions for non-separable Hamiltonians are computationally accessible, is presented. The numerical viability of the algorithm for quantum electron transport (in a far-from-equilibrium time-dependent open system) is demonstrated by computing the current and fluctuations in a nano-resistor, with exchange and Coulomb interactions among electrons.

关键词： many-particle quantum exchange interaction nanoelectronic devices SLATER METHOD Fermions trajectory generalized algorithm Hamiltonian quanta Exchange interaction configuration space Bosons

来源：评论

学校读者我要写书评

暂无评论

Multidiscontinuity algorithm for world-line Monte Carlo simulations

引用

Physical Review E 2013年第1期87卷 013310-013310页

作者： Yasuyuki Kato []Theoretical Division T-4 and CNLS Los Alamos National Laboratory Los Alamos New Mexico 87545 USA

We introduce a multidiscontinuity algorithm for the efficient global update of world-line configurations in Monte Carlo simulations of interacting quantum systems. This algorithm is a generalization of the two-discontinuity algorithms introduced in Refs. [N. Prokof'ev, B. Svistunov, and I. Tupitsyn, Phys. Lett. A 238, 253 (1998)] and [O. F. Syljuåsen and A. W. Sandvik, Phys. Rev. E 66, 046701 (2002)]. This generalization is particularly effective for studying Bose-Einstein condensates (BECs) of composite particles. In particular, we demonstrate the utility of the generalized algorithm by simulating a Hamiltonian for an S=1 antiferromagnet with strong uniaxial single-ion anisotropy. The multidiscontinuity algorithm not only solves the freezing problem that arises in this limit, but also allows the efficient computing of the off-diagonal correlator that characterizes a BEC of composite particles.

关键词： COMPOSITE PARTICLES Monte Carlo technique algorithms generalized algorithm Generalization

来源：评论

学校读者我要写书评

暂无评论

Universal algorithm for the analysis of charge distributions in segmented electrodes of gas detectors

引用

EUROPEAN PHYSICAL JOURNAL A 2012年第5期48卷 60-60页

作者： Carbone, D. Cappuzzello, F. Cavallaro, M. Ist Nazl Fis Nucl Lab Nazl Sud Via S Sofia 62 I-95125 Catania Italy Univ Catania Dipartimento Fis & Astron I-95125 Catania Italy

A general algorithm to extract the center of gravity of charge distributions generated in a patterned electrode is presented. The results obtained analyzing the data produced by the gas focal plane detector of the MAGNEX spectrometer are discussed. The algorithm is characterized by an unprecedented efficiency and accuracy when dealing with data with small signal-to-noise ratio. A clear recovery of the smooth position distribution from the quantized one obtained with standard algorithms is observed. The optimized algorithm is also able to naturally mitigate the cross-talk phenomena that are quite strong in this kind of compact detectors.

关键词： plate detector Optimization algorithms Center of gravity Gas detectors algorithms generalized algorithm Electrodes CHARGE DISTRIBUTION analysis of algorithm

来源：评论

学校读者我要写书评

暂无评论

Critical sets of the total variance can detect all stochastic local operations and classical communication classes of multiparticle entanglement

引用

Physical Review A 2012年第4期86卷 040304(R)-040304(R)页

作者： Adam Sawicki Michał Oszmaniec Marek Kuś School of Mathematics University of Bristol University Walk Bristol BS8 1TW United Kingdom Center for Theoretical Physics PAS Aleja Lotników 32/46 02-668 Warszawa Poland

We present a general algorithm for finding all classes of pure multiparticle states equivalent under stochastic local operations and classical communication (SLOCC). We parametrize all SLOCC classes by the critical sets of the total variance function. Our method works for arbitrary systems of distinguishable and indistinguishable particles. We also show how to calculate the Morse indices of critical points which have the interpretation of the number of independent nonlocal perturbations increasing the variance and hence entanglement of a state. We illustrate our method by two examples.

关键词： Variance perturbation Entanglement Equivalent critical point generalized algorithm Countries (nations) parameterization Classes interpretation local operation

来源：评论

学校读者我要写书评

暂无评论

Is it really possible to grow isotropic on-lattice diffusion-limited aggregates?

引用

JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL 2006年第12期39卷 2843-2852页

作者： Alves, SG Ferreira, SC Univ Fed Minas Gerais Dept Fis BR-30161970 Belo Horizonte MG Brazil Univ Fed Vicosa Dept Fis BR-36571000 Vicosa MG Brazil

In a recent paper (Bogoyavlenskiy V A 2002 J. PhYs. A: Math. Gen. 35 2533), an algorithm aiming to generate isotropic clusters of the on-lattice diffusion-limited aggregation (DLA) model was proposed. The procedure consists of aggregation probabilities proportional to the squared number of occupied sites (k(2)). In the present work, we analysed this algorithm using the noise reduced version of the DLA model and large-scale simulations. In the noiseless limit, instead of isotropic patterns, a 45 degrees (30 degrees) rotation in the anisotropy directions of the clusters grown on square (triangular) lattices was observed. A generalized algorithm, in which the aggregation probability is proportional to k(v), was proposed. The exponent v has a nonuniversal critical value v, for which the patterns generated in the noiseless limit exhibit the original (axial) anisotropy for v < v(c) and the rotated one (diagonal) for v > v(c). The values v(c) = 1.395 +/- 0.005 and v(c) = 0.82 +/- 0.01 were found for square and triangular lattices, respectively. Moreover, large-scale simulations show that there is a nontrivial relation between the noise reduction and anisotropy direction. The case v = 2 (Bogoyavlenskiy's rule) is an example where the patterns exhibit the axial anisotropy for small and the diagonal one for large noise reduction.

关键词： KINETIC CRITICAL PHENOMENON LAPLACIAN GROWTH MODELS agglomeration critical phenomena Noise reduction Proportional crystal lattices large sizes Isotropic Anisotropy generalized algorithm

来源：评论

学校读者我要写书评

暂无评论

Tool for BiV capture diagnosis

引用

PACE-PACING AND CLINICAL ELECTROPHYSIOLOGY 2014年第8期37卷 1087-1087页

作者： Cacko, Andrzej Tataj, Emanuel Kocon, Maciej Grabowski, Marcin Med Univ Warsaw Dept Cardiol 1 Warsaw Poland Med Univ Warsaw Dept Med Informat & Telemed Warsaw Poland Warsaw Univ Technol Inst Elect Syst Warsaw Poland

We read with interest the article by Jastrzebski et al. on the universal algorithm for the diagnosis of biventricular (BiV) capture in patients with cardiac resynchronization therapy (CRT).1 Authors proposed an algorithm based on the standard 12-lead electrocardiogram (ECG) with high sensitivity and specificity for detection of the loss of left ventricle (LV) capture, 97% and 90%, respectively.

关键词： 12 lead ecg Cardiac Resynchronization Therapy algorithms Left Ventricle generalized algorithm electrochemical grinding Electrocardiography Sensitivity and Specificity

来源：评论

学校读者我要写书评

暂无评论

Anonymous Meeting in Networks 13

Anonymous Meeting in Networks

引用

Symposium on Discrete algorithms

作者： Yoann Dieudonné Andrzej Pelc MIS Université de Picardie Jules Verne Amiens France. Département d'informatique Université du Québec en Outaouais Gatineau Québec J8X 3X7 Canada.

ISBN: (纸本)9781627484855

A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node. Agents are anonymous (identical), execute the same deterministic algorithm and move in synchronous rounds along links of the network. An. initial configuration of agents is called gatherable if there exists a deterministic algorithm (even dedicated to this particular configuration) that achieves meeting of all agents in one node. Which configurations are gatherable and how to gather all of them deterministically by the same algorithm? We give a complete solution of this gathering problem in arbitrary networks. We characterize all gatherable configurations and give two universal deterministic gathering algorithms, i.e., algorithms that gather all gatherable configurations. The first algorithm works under the assumption that an upper bound n on the size of the network is known. In this case our algorithm guarantees gathering with detection, i.e., the existence of a round for any gatherable configuration, such that all agents are at the same node and all declare that gathering is accomplished. If no upper bound on the size of the network is known, we show that a universal algorithm for gathering with detection does not exist. Hence, for this harder scenario, we construct a second universal gathering algorithm, which guarantees that, for any gatherable configuration all agents eventually get to one node and stop, although they cannot tell if gathering is over. The time of the first algorithm is polynomial in the upper bound n on the size of the network, and the time of the second algorithm is polynomial in the (unknown) size itself. Our results have an important consequence for the leader election problem for anonymous agents in arbitrary graphs. Leader election is a fundamental symmetry breaking problem in distributed computing. Its goal is to assign, in some common round, value 1(leader) to one of the

关键词： Anonymous Meeting mobile agents leader election problem harvesting Mobile agents Agents collection Network Polynomial configurations generalized algorithm

来源：评论

学校读者我要写书评

暂无评论

Twice-universal piecewise linear regression via infinite depth context trees

Twice-universal piecewise linear regression via infinite dep...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： N. D. Vanli M. O. Sayin T. Gozey S. S. Kozat Dept. of Electr. & Electron. Eng. Bilkent Univ. Ankara Turkey

ISBN: (纸本)9781467369985

We investigate the problem of sequential piecewise linear regression from a competitive framework. For an arbitrary and unknown data length n, we first introduce a method to partition the regressor space. Particularly, we present a recursive method that divides the regressor space into O(n) disjoint regions that can result in approximately 1.5n different piecewise linear models on the regressor space. For each region, we introduce a universal linear regressor whose performance is nearly as well as the best linear regressor whose parameters are set non-causally. We then use an infinite depth context tree to represent all piecewise linear models and introduce a universal algorithm to achieve the performance of the best piecewise linear model that can be selected in hindsight. In this sense, the introduced algorithm is twice-universal such that it sequentially achieves the performance of the best model that uses the optimal regression parameters. Our algorithm achieves this performance only with a computational complexity upper bounded by O(n) in the worst-case and O(log(n)) under certain regularity conditions. We provide the explicit description of the algorithm as well as the upper bounds on the regret with respect to the best nonlinear and piecewise linear models, and demonstrate the performance of the algorithm through simulations.

关键词： Sequential infinite depth context tree nonlinear piecewise linear regression linear models Piecewise Sequential nonlinearity generalized algorithm recursion method Regression (Psychology) Regret Linear Regression algorithms Infinite

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：