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

World Conference on Complex Systems (WCCS)

作者： Carlos M. Fernandes Juan L. J. Laredo Juan Julián Merelo Carlos Cotta Agostinho C. Rosa Department of Computer Architecture and Technology University of Granada Spain Systems and Robotics Institute Technical University of Lisbon Portugal University of Luxembourg Luxembourg Department Lenguages y Ciencias de la Computación University of Málaga Spain

This paper proposes a swarm intelligence framework for distributed population-based metaheuristics that uses stigmergy and similarity measures as basic modeling rules with a local range of action for structuring the neighborhood. The system - which can be described as a cellular automaton with short-term memory - displays complex and emergent behavior whose most visible trait is the self-organization of a population of particles into dynamic clusters. These clusters tend to gather similar particles (similarity here is measured as the algebraic difference between randomly assigned fitness values). During the execution of the algorithm, the particles move through a grid of nodes leaving a mark with the fitness value of the particle in each node they visit. When deciding where to move, the particles take into account the marks in the neighborhood and tend to travel to nodes with marks that minimize the difference between the particle's fitness and the mark's fitness. A kind of hierarchical behavior is also modeled by forcing the particles to move toward nodes with better fitness values. We show that these simple rules conduct the system to a critical state in which clusters are constantly created and broken, while maintaining a typical pattern of clusters and paths. In addition, we demonstrate that the system's variables display noise, which is one of the signatures of Self-Organized Criticality (SOC). Since it does not require the tuning of control parameters to precise values, we hypothesize that the proposed system converges to SOC.

关键词： Sociology Statistics Heuristic algorithms System-on-a-chip Noise Particle swarm optimization Tuning

来源：评论

学校读者我要写书评

暂无评论

Lane recognition for moving vehicles using multiple on-car RFID receiver antennas — Algorithm and its experimental results

Lane recognition for moving vehicles using multiple on-car R...

引用

IEEE Symposium on Intelligent Vehicle

作者： Hiroaki Togashi Cristian Borcea Shigeki Yamada Department of Informatics Graduate University for Advanced Studies (SOKENDAI) Tokyo Japan Department of Computer Science New Jersey Institute of Technology New Jersey USA Information Systems Architecture Research Division National Institute of Information Tokyo Japan

Accurate lane recognition for moving vehicles is important for lane keeping and lane changing assistance systems. Additionally, this information could be leveraged by Intelligent Transportation Systems to suggest lane changes for improved traffic load balancing across lanes. This paper presents a position estimation algorithm for moving vehicles based on RFID (Radio Frequency Identification) active sensors placed on roadsides and lane boundaries, and multiple on-car RFID receiver antennas. To improve localization accuracy, the algorithm proposes two novel ideas: (1) compute pair-wise position estimates using the RSSI (Received Signal Strength Indication) of all pairs of signals received from RFIDs, and (2) compute the final position as a weighted average of these pair-wise estimates using a dynamic weighting function that assigns higher weights to positions estimated based on closer RFIDs. The results from our field experiments indicate that the proposed method achieves 0.7-meter localization accuracy when RFIDs are placed at 0.5-meter intervals and a vehicle has 8 antennas. This accuracy allows a moving vehicle to recognize which lane it is in. The localization accuracy of the proposed method was found to be mostly stable for any type of road shape and any number of lanes. A further 14% accuracy improvement is achieved when RFIDs are placed at 0.25-meter intervals and the RFIDs located farther than 30-meter are excluded from computation.

关键词： Radiofrequency identification Vehicles Accuracy Estimation Receiving antennas Roads

来源：评论

学校读者我要写书评

暂无评论

Analysing the performance of different population structures for an agent-based evolutionary algorithm 1

引用

5th International Conference on Learning and Intelligent Optimization, LION 2011

作者： Laredo, J.L.J. Merelo, J.J. Fernandes, C.M. Mora, A.M. Arenas, M.G. Castillo, P.A. Garcia-Sanchez, P. Department of Architecture and Computer Technology University of Granada Spain

ISBN: (数字)9783642255663

ISBN: (纸本)9783642255656

The Evolvable Agent model is a Peer-to-Peer Evolutionary Algorithm [4] which focuses on distributed optimisation over Peer-to-Peer infrastructures [7]. The main idea of the model is that every agent (i.e. individual) is designated as a peer (i.e. network node) and adopts a decentralised population structure defined by the underlying Peer-to-Peer protocol newscast [3]. That way, the population structure acquires a small network diameter which allows a fast dissemination of the best solutions. Additionally, speed of propagation holds with scaling network sizes due to the logarithmic growth of the network diameter.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A current-mode electronically controllable multifunction biquadratic filter using CCCIIs

A current-mode electronically controllable multifunction biq...

引用

International Conference on Telecommunications and Signal Processing (TSP)

作者： Somchai Srisakultiew Aekkarat Noppakarn Somchai Yurungroangsak Montree Siripruchyanun Computer Engineering Faculty of Engineering and Architecture Rajamangala University of Technology Nakhon Ratchasima Thailand Department of Electrical Engineering Faculty of Engineering Thonburi University Bangkok Thailand Department of Teacher Training in Electrical Engineering Faculty of Technical Education King Mongkut's University of Technology North Bangkok Bangkok Thailand

This article presents a current-mode multifunction biquadratic filter performing completely standard functions low-pass, high-pass, band-pass, band-reject and all-pass functions. The circuit principle is based on second-generation current-controlled current conveyor (CCCII) with three input terminals and one output terminal. The features of the circuit are that, the pole frequency can be electronically tuned via the input bias currents. The circuit topology is very simple, consisting of merely 2 CCCIIs and 2 grounded capacitors. Without any external resistor and using only grounded elements, the proposed circuit is very comfortable to further develop into an integrated circuit architecture. The PSpice simulation results are shown. The given results agree well with the theoretical anticipation. The total power consumption is approximately 1.87mW at ±1.5V power supply voltages.

关键词： Band pass filters Filtering theory Transfer functions Q factor Gain Circuit topology Capacitors

来源：评论

学校读者我要写书评

暂无评论

The sandpile mutation operator for genetic algorithms 1

引用

5th International Conference on Learning and Intelligent Optimization, LION 2011

作者： Fernandes, C.M. Laredo, J.L.J. Mora, A.M. Rosa, A.C. Merelo, J.J. Department of Architecture and Computer Technology University of Granada Spain Portugal

ISBN: (数字)9783642255663

ISBN: (纸本)9783642255656

This paper describes an alternative mutation control scheme for Genetic Algorithms (GAs) inspired by the Self-Organized Criticality (SOC) theory. The strategy, which mimics a SOC system known as sandpile, is able to generate mutation rates that, unlike those given by other methods of adaptive parameter control, oscillate between very low values and cataclysmic mutations. In order to attain the desired behaviour, the sandpile is not just attached to a GA;it is also modified in an attempt to link its rates to the stage of the search, i.e., the fitness distribution of the population. Due to its characteristics, the sandpile mutation arises as a promising candidate for efficient and yet simple and context-independent approach to dynamic optimization. An experimental study confirms this assumption: a GA with sandpile mutation outperforms a recently proposed SOC-based GA for dynamic optimization. Furthermore, the proposed method does not increase traditional GAs' parameter set. © Springer-Verlag Berlin Heidelberg 2011.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Statistical analysis of different artificial intelligent techniques applied to Intrusion Detection System

Statistical analysis of different artificial intelligent tec...

引用

IEEE International Conference on Multimedia Computing and Systems (ICMCS)

作者： Hind Tribak Blanca L. Delgado-Márquez P. Rojas O. Valenzuela H. Pomares I. Rojas 1.-Dpt. of Computer Architecture and Computer Technology University of Granada Spain Department International andSpanish Economics Faculty of Economics and Business University of Granada Spain 3.- Dpt International and Spanish Economics Faculty of Economics Business 4.-ETSICCP University of Granada Spain Department of Applied Mathematics University of Granada Spain 2.-Dpt. of Applied Mathematics

Intrusion Detection System (IDS) which are increasingly a key part of system defense are used to identify abnormal activities in a computer system. In general, the traditional IDS relies on the extensive knowledge of security experts, in particular, on their familiarity with the computer system to be protected. To reduce this dependence, various data-mining and machine learning techniques have been used in the literature. The experiments and evaluations of the proposed intrusion detection system are performed with the NSL-KDD intrusion detection dataset. We will apply different learning algorithms on NSL-KDD data set, to recognize between normal and attack connections and compare their performing in different scenarios- discretization, features selections and algorithm method for classification- using a powerful statistical analysis: ANOVA. In this study, both the accuracy of the configuration of different system and methodologies used, and also the computational time and complexity of the methodologies are analyzed.

关键词： Data mining Security Hidden Markov models Probes Ions Marine animals Analysis of variance

来源：评论

学校读者我要写书评

暂无评论

Theoretical Treatment of Target Coverage in Wireless Sensor Networks

引用

Journal of computer Science & technology 2011年第1期26卷 117-129页

作者：谷雨赵保华计宇生李颉 School of Computer Science University of Science and Technology of China State Key Laboratory of Networking and Switching Technology Information Systems Architecture Science Research Division National Institute of InformaticsTokyoJapan Department of Computer Science University of TsukubaTsukuba Science CityIbarakiJapan

The target coverage is an important yet challenging problem in wireless sensor networks, especially when both coverage and energy constraints should be taken into account. Due to its nonlinear nature, previous studies of this problem have mainly focused on heuristic algorithms; the theoretical bound remains unknown. Moreover, the most popular method used in the previous literature, i.e., discretization of continuous time, has yet to be justified. This paper fills in these gaps with two theoretical results. The first one is a formal justification for the method. We use a simple example to illustrate the procedure of transforming a solution in time domain into a corresponding solution in the pattern domain with the same network lifetime and obtain two key observations. After that, we formally prove these two observations and use them as the basis to justify the method. The second result is an algorithm that can guarantee the network lifetime to be at least （1 - ε） of the optimal network lifetime, where ε can be made arbitrarily small depending on the required precision. The algorithm is based on the column generation （CG） theory, which decomposes the original problem into two sub-problems and iteratively solves them in a way that approaches the optimal solution. Moreover, we developed several constructive approaches to further optimize the algorithm. Numerical results verify the efficiency of our CG-based algorithm.

关键词： target coverage wireless sensor networks time-dependent solution pattern-based solution column generation

来源：评论

学校读者我要写书评

暂无评论

Using Data-Level Parallelism to Accelerate Instruction -Level Redundancy

Using Data-Level Parallelism to Accelerate Instruction -Leve...

引用

World Automation Congress

作者： Yu Hu Zhong liang Chen Xiaowei Li Key Laboratory of Computer System and Architecture Institute of Computing Technology CAS Beijing 100190 China Department of Electrical and Computer Engineering Northeastern University Boston MA 02115 USA

ISBN: (纸本)9781467344975

Instruction-level redundancy is an effective scheme to reduce the susceptibility of microprocessors to soft errors, offering high error detection and recovery capability;however, it usually incurs significant performance degradation due to resource racing. Motivated by the fact that narrow-width operands are commonly seen in applications, we exploit data-level parallelism to accelerate instruction-level redundancy. For the instructions within sphere of replication (SoR) of data-level redundancy, normal and redundant versions of the narrow-width operand of the instruction are folded into one register to share the same functional unit during execution hence alleviating resource racing. The other instructions are all protected by instructionlevel redundancy. We run SPECint2000 benchmarks on a modified version of SimpleScalar simulator, and synthesize the extra hardware to evaluate area overhead of the proposed pipeline. Experimental results show that our acceleration scheme outperforms conventional instruction-level redundancy by 13% in IPC. Besides, the extra area overhead is negligible.

关键词： Keywords Data-level redundancy Instruction-level redundancy Narrow-width value Sphere of replication

来源：评论

学校读者我要写书评

暂无评论

Depth-supported real-time video segmentation with the Kinect

Depth-supported real-time video segmentation with the Kinect

引用

IEEE Workshop on Applications of computer Vision (WACV)

作者： Alexey Abramov Karl Pauwels Jeremie Papon Florentin Wörgötter Babette Dellen BCCN Göttingen III Physikalisches Institut Georg-August-University of Goettingen Gottingen Germany Computer Architecture and Technology Department University of Granada Granada Spain Institut de Robòtica i Informàtica Industrial (CSIC-UPC) Barcelona Spain

We present a real-time technique for the spatiotemporal segmentation of color/depth movies. Images are segmented using a parallel Metropolis algorithm implemented on a GPU utilizing both color and depth information, acquired with the Microsoft Kinect. Segments represent the equilibrium states of a Potts model, where tracking of segments is achieved by warping obtained segment labels to the next frame using real-time optical flow, which reduces the number of iterations required for the Metropolis method to encounter the new equilibrium state. By including depth information into the framework, true objects boundaries can be found more easily, improving also the temporal coherency of the method. The algorithm has been tested for videos of medium resolutions showing human manipulations of objects. The framework provides an inexpensive visual front end for visual preprocessing of videos in industrial settings and robot labs which can potentially be used in various applications.

关键词： Image segmentation Image color analysis Cameras Kernel Streaming media Calibration Optical imaging

来源：评论

学校读者我要写书评

暂无评论

Prevention flow-control for low latency torus networks-on-chip 11

Prevention flow-control for low latency torus networks-on-ch...

引用

Proceedings of the Fifth ACM/IEEE International Symposium on Networks-on-Chip

作者： Joshi, Arpit Mutyam, Madhu Computer Architecture and Systems Lab. Department of Computer Science and Engineering Indian Institute of Technology Madras India

ISBN: (纸本)9781450307208

The challenge for on-chip networks is to provide low latency communication in a very low power budget. To reduce the latency and keep the simplicity of a mesh network, torus network is proposed. As torus networks have inherent circular dependency, additional effort is needed to prevent deadlock, even if deadlock free routing algorithms are used. We describe a novel flow-control mechanism to address cost/performance constraints in torus networks and ensure freedom from deadlock. Flow-control is achieved using a prevention mechanism which uses virtual cut-through switching, and deadlock freedom is achieved by considering only a single packet buffer per input port. We can simplify the router design by having a simple switch allocator, which prioritizes in-flight packets, and a single packet buffer per input port, which eliminates the need for virtual channels. Experimental validation reveals that our design achieves significant improvement in throughput, as compared to the traditional design, using significantly fewer buffers. © 2011 ACM.

关键词： Flow control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：