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

Development and Experimental Research of Data analysis algorithm of Animal's Daily Activities in Automated Information Management System for Livestock Enterprises

Development and Experimental Research of Data Analysis Algor...

引用

International Conference on Stability and Control Processes in Memory of V.I. Zubov (SCP)

作者： Antonov, Lev Privezentsev, Denis Orlov, Alexey Vladimir State Univ Dept Phys & Appl Math Murom Inst Branch Murom Russia Vladimir State Univ Dept Syst Comp Aided Design Murom Inst Branch Murom Russia

ISBN: (纸本)9781467376983

The task of identifying critical fluctuations of the production characteristics from the normal value are considered in the article. An algorithm based on the least squares method, which allows for an increase of efficiency and accuracy in identifying problematic situations in production is developed in the course of research. Experimental research of the developed algorithm was performed using four different metrics.

关键词： Management Information Systems livestock enterprises analysis of algorithm Normal Range Daily Activities critical fluctuations

来源：评论

学校读者我要写书评

暂无评论

A grid-based Bader analysis algorithm without lattice bias

引用

JOURNAL OF PHYSICS-CONDENSED MATTER 2009年第8期21卷 084204 (7p-084204 (7p页

作者： Tang, W. Sanville, E. Henkelman, G. Univ Texas Austin Dept Chem & Biochem Austin TX 78712 USA Univ Loughborough Dept Math Sci Loughborough LE11 3TU Leics England

A computational method for partitioning a charge density grid into Bader volumes is presented which is efficient, robust, and scales linearly with the number of grid points. The partitioning algorithm follows the steepest ascent paths along the charge density gradient from grid point to grid point until a charge density maximum is reached. In this paper, we describe how accurate off-lattice ascent paths can be represented with respect to the grid points. This improvement maintains the efficient linear scaling of an earlier version of the algorithm, and eliminates a tendency for the Bader surfaces to be aligned along the grid directions. As the algorithm assigns grid points to charge density maxima, subsequent paths are terminated when they reach previously assigned grid points. It is this grid-based approach which gives the algorithm its efficiency, and allows for the analysis of the large grids generated from plane-wave-based density functional theory calculations.

关键词： grid-based Bader analysis algorithm lattice bias grid direction Paths grid point algorithms Charge density Byways analysis of algorithm grids Grid computing computational methods

来源：评论

学校读者我要写书评

暂无评论

Convergence analysis of standard particle swarm optimization algorithm and its improvement

引用

SOFT COMPUTING 2018年第12期22卷 4047-4070页

作者： Qian, Weiyi Li, Ming Bohai Univ Coll Math & Phys Jinzhou 121000 Peoples R China

Standard particle swarm optimization (PSO) algorithm is a kind of stochastic optimization algorithm. Its convergence, based on probability theory, is analyzed in detail. We prove that the standard PSO algorithm is convergence with probability 1 under certain condition. Then, a new improved particle swarm optimization (IPSO) algorithm is proposed to ensure that IPSO algorithm is convergence with probability 1. In order to balance the exploration and exploitation abilities of IPSO algorithm, we propose the exploration and exploitation operators and weight the two operators in IPSO algorithm. Finally, IPSO algorithm is tested on 13 benchmark test functions and compared with the other algorithms published in the recent literature. The numerical results confirm that IPSO algorithm has the better performance in solving nonlinear functions.

关键词： Standard particle swarm optimization analysis of algorithm Convergence in probability Global optimization

来源：评论

学校读者我要写书评

暂无评论

analysis of a randomized rendezvous algorithm

引用

INFORMATION AND COMPUTATION 2003年第1期184卷 109-128页

作者： Métivier, Y Saheb, N Zemmari, A Univ Bordeaux 1 ENSEIRB LaBRI F-33405 Talence France

In this paper we propose and analyze a randomized algorithm to get rendezvous between neighbours in an anonymous graph. We examine in particular the probability to obtain at least one rendezvous and the expected number of rendezvous. We study the rendezvous number distribution in the cases of chain graphs, rings, and complete graphs. The last part is devoted to the efficiency of the proposed algorithm. (C) 2003 Elsevier Science (USA). All rights reserved.

关键词： randomized algorithm analysis of algorithm efficiency graph rendezvous

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of algorithms for Coordination of Earth Observation by CubeSat Constellations

引用

JOURNAL OF AEROSPACE INFORMATION SYSTEMS 2017年第8期14卷 451-471页

作者： Kennedy, Andrew K. Cahoy, Kerri L. MIT Dept Aeronaut & Astronaut Bldg 37-35477 Massachusetts Avenue Cambridge MA 02139 USA

Two algorithms that coordinate activities across a resource-constrained, Earth-observing CubeSat constellation are presented. The Resource-Aware SmallSat Planner algorithm performs online planning of activities for a satellite while keeping the satellite's resources within constraints. The Limited Communication Constellation Coordinator algorithm performs coordination of observations across the constellation to reduce average revisit times for a set of targets. The algorithms are simulated for 24 h with an 18 satellite Low Earth Orbit constellation. Three orbital geometries are examined, with different configurations of intersatellite and satellite-to-ground communications links to share planning information. Results indicate that coordination through Resource-Aware SmallSat Planner/Limited Communication Constellation Coordinator and a background communications constellation improves observation performance, with sensor-averaged revisit times of 197, 203, and 225 min (over three orbital geometries) versus 204, 211, and 240 min for a baseline random sensor selection method. The results also reveal that the constellations studied perform poorly at sharing planning information via only downlinks and crosslinks and point to the need for a method of calculating the information sharing utility of such links in a coordinated constellation. These findings are relevant for Federated Satellite Systems because they provide guidance on next steps toward integrating large networks of heterogeneous small satellites into large-scale, coordinated, Earth-observing systems.

关键词： Satellite systems Cross-linked activity algorithms analysis of algorithm satellites Communication Research CONSTELLATIONS earth observation Coordinator

来源：评论

学校读者我要写书评

暂无评论

De-Ghosting and Target Extraction algorithm analysis for the PCL-PET Fusion System 16

De-Ghosting and Target Extraction Algorithm Analysis for the...

引用

16th International Radar Symposium (IRS)

作者： Lamentowski, Leszek Brenner, Tadeusz Nieszporski, Maciej PIT RADWAR SA Ul Poligonowa 30 PL-04051 Warsaw Poland Warsaw Univ Technol Dept Math Methods Phys PL-02093 Warsaw Poland

ISBN: (纸本)9783954048533

The topic of data fusion on the level of plots in a multistatic, multiband netted radar is widely recognized as a topic of interest in the radar community. PCL-PET system currently under development in PIT-RADWAR S.A. is an example of such approach. Earlier analyses have shown, that unique capabilities provided by the two types of the passive sensors will greatly enchance parameters of the combined sensor. The plot correlation and de-ghosting algorithm has proven to be the most computationally complex problem in the PCL-PET fusion. In this paper we present some remarks concerning the nature of this computational complexity along with results of simulations showing complexity scaling with the changing simulation parameters. We also present our simulation software being developed for further analysis of the topic.

关键词： extraction of object analysis of algorithm passive seasor radar Simulation parameter Data fusion emulation program Fusion reactions Fusion, biological FUSION fusion (melting) complexity classes

来源：评论

学校读者我要写书评

暂无评论

algorithmS FOR DE BRUIJN SEQUENCES - A CASE-STUDY IN THE EMPIRICAL-analysis of algorithmS

引用

COMPUTER JOURNAL 1992年第1期35卷 88-90页

作者： VASSALLO, M RALSTON, A SUNY BUFFALO DEPT COMP SCIBUFFALONY 14260

The following paper presents an analysis of algorithms for De Bruijn sequences. It is unusual in that the analysis is carried out empirically rather than analytically.

关键词： algorithms analysis of algorithm analysis Case studies

来源：评论

学校读者我要写书评

暂无评论

Distributed Stable States for Process Networks - algorithm, analysis, and Experiments on Intel SCC 13

Distributed Stable States for Process Networks - Algorithm, ...

引用

50th ACM/EDAC/IEEE Design Automation Conference (DAC)

作者： Rai, Devendra Schor, Lars Stoimenov, Nikolay Thiele, Lothar Swiss Fed Inst Technol Comp Engn & Networks Lab CH-8092 Zurich Switzerland

ISBN: (纸本)9781450320719

Technology scaling is a common trend in current embedded systems. It has promoted the use of multi-core, multiprocessor, and distributed platforms. Such systems usually require run-time migration of distributed applications between the different nodes of the platform in order to balance the workload or to tolerate faults. Before an application can be migrated, it needs to be brought to a stable state such that restarting the application after migration does not violate its functional correctness. An application in a stable state does not change its context any further, and therefore, stabilization is a prerequisite for any application migration. Process networks are a common model of computation for specifying distributed applications. However, most results on the migration of process networks do not provide an algorithm to put a general process network into a stable state, suitable for migration. This paper proposes a technique which efficiently and correctly brings a process network executing on a distributed system to a known stable state. The correctness of the technique is independent of the temporal characteristics of the system and the topology of the process network. The required modifications of a process network are lightweight and preserve its original functionality. A model characterizing the timing properties of the technique is provided. The feasibility and efficiency of the proposed approach and the respective model are validated with experimental results on Intel's SCC platform.

关键词： different nodes platform order cyber process Steady state Immigration Migrations Platform Technology analysis of algorithm accuracy class Distribute Network Stress corrosion cracking

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

THE AVERAGE PERFORMANCE analysis OF A CLOSEST-PAIR algorithm

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1984年第2期16卷 125-130页

作者： CHANG, RC LEE, RCT NATL TSINGHUA UNIV DEPT ELECT ENGNHSINCHU 300TAIWAN

Bentley proposed a divide-and-conquer approach to solve the planar closest pair problem. In this paper, we shall show that the average case performance of this algorithm is proportional to the number of points being e... 详细信息

关键词： analysis of algorithm closest-pair problems computational geometry geometric probability probabilistic analysis of algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：