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

2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010

作者： Muñoz, Daniel M. Llanos, Carlos H. Dos S. Coelho, Leandro Ayala-Rincón, Mauricio Department of Mechanical Engineering Automation and Control Group/GRACG University of Brasilia Brasilia D.F. Brazil Industrial and Systems Engineering Graduate Program Pontifical Catholic University of Parana Curitiba Parana Brazil Department of Computer Science and Mathematics University of Brasilia Brasilia D.F. Brazil

ISBN: (纸本)9781424464388

Meta-heuristics are efficient techniques for solving large scale optimization problems in which traditional mathematical techniques are impractical or provide sub-optimal solutions. The Shuffled Frog Leaping algorithm (SFLA) is a stochastic iterative method, bio-inspired on the memetic evolution of a group of frogs when seeking for food, which combines the social behavior-based of the particle swarm optimization technique (PSO) and the global information exchange of memetic algorithms. However, the SFLA algorithm suffers on large execution times, being this problem clearly evident when solving complex optimization problems for embedded applications. This drawback can be overcome by exploiting the parallel capabilities of the SFLA. This paper proposes a hardware parallel implementation of the SFLA algorithm (HPSFLA) using FPGAs (Field programmable gate Arrays) and the efficient floating-point arithmetic. The proposed architecture allows the SFLA to improve the functionality of the algorithm as well as to decrease the execution times by implementing parallel frogs and parallel memeplexes. Three well-known benchmark problems have been used to validate the implemented algorithm and simulation results demonstrate that the HPSFLA speeds-up by factors of 362, 727 and 211 a C-code implementation using an embedded microprocessor for the Sphere, Rastrigin and Rosenbrock benchmarks problems, respectively. Synthesis, simulation and execution time results demonstrate the effectiveness of the proposed HPSFLA architecture for embedded optimization systems. © 2010 IEEE.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Comparison between two FPGA implementations of the particle swarm optimization algorithm for high-performance embedded applications

Comparison between two FPGA implementations of the particle ...

引用

2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010

作者： Muñoz, Daniel M. Llanos, Carlos H. Dos S. Coelho, Leandro Ayala-Rincón, Mauricio Department of Mechanical Engineering Automation and Control Group/GRACO University of Brasilia Brasilia D.F. Brazil Industrial and Systems Engineering Graduate Program LAS/PPGPES Pontifical Catholic University of Parana Curitiba Parana Brazil Department of Computer Science and Mathematics University of Brasilia Brasilia D.F. Brazil

ISBN: (纸本)9781424464388

Particle Swarm Optimization (PSO) algorithms have been proposed to solve engineering problems that require to find an optimal point of operation. There are several embedded applications which requires to solve online optimization problems with a high performance. However, the PSO suffers on large execution times, and this fact becomes evident when using Reduced Instruction Set computer (RISC) microprocessors in which the operational frequencies are low in comparison with the high operational frequencies of traditional personal computers (PCs). This paper compares two hardware implementations of the parallel PSO algorithm using an efficient floating-point arithmetic which perform computations with large dynamic range and high precision. The full-parallel and the partially-parallel PSO architectures allow the parallel capabilities of the PSO to be exploited in order to decrease the running time. Three well-known benchmark test functions have been used to validate the hardware architectures and a comparison in terms of cost in logic area, quality of the solution and performance is reported. In addition, a comparison of the execution time between the hardware and two C-code software implementations, based on a Intel Core Duo at 1.6GHz and a embedded Microblaze microprocessor at 50MHz, are presented. © 2010 IEEE.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Accelerating the Shuffled Frog Leaping algorithm by parallel implementations in FPGAs

Accelerating the Shuffled Frog Leaping algorithm by parallel...

引用

International Conference on Bio-Inspired Computing: Theories and Applications, BICTA

作者： Daniel M. Muñoz Carlos H. Llanos Leandro dos S. Coelho Mauricio Ayala-Rincón Department of Mechanical Engineering University of Brasilia Brasilia D.F Brazil Industrial and Systems Engineering Graduate Program Pontifical Catholic University of Parana Curitiba Parana Brazil Department of Computer Science and Mathematics University of Brasilia Brasilia D.F Brazil

Meta-heuristics are efficient techniques for solving large scale optimization problems in which traditional mathematical techniques are impractical or provide suboptimal solutions. The Shuffled Frog Leaping algorithm (SFLA) is a stochastic iterative method, bio-inspired on the memetic evolution of a group of frogs when seeking for food, which combines the social behavior-based of the particle swarm optimization technique (PSO) and the global information exchange of memetic algorithms. However, the SFLA algorithm suffers on large execution times, being this problem clearly evident when solving complex optimization problems for embedded applications. This drawback can be overcome by exploiting the parallel capabilities of the SFLA. This paper proposes a hardware parallel implementation of the SFLA algorithm (HPSFLA) using FPGAs (Field programmable gate Arrays) and the efficient floating-point arithmetic. The proposed architecture allows the SFLA to improve the functionality of the algorithm as well as to decrease the execution times by implementing parallel frogs and parallel memeplexes. Three well-known benchmark problems have been used to validate the implemented algorithm and simulation results demonstrate that the HPSFLA speeds-up by factors of 362, 727 and 211 a C-code implementation using an embedded microprocessor for the Sphere, Rastrigin and Rosenbrock benchmarks problems, respectively. Synthesis, simulation and execution time results demonstrate the effectiveness of the proposed HPSFLA architecture for embedded optimization systems.

关键词： Mathematics Field programmable gate arrays Table lookup

来源：评论

学校读者我要写书评

暂无评论

Hardware Architecture for Particle Swarm Optimization Using Floating-Point Arithmetic

Hardware Architecture for Particle Swarm Optimization Using ...

引用

International Conference on Intelligent systems Design and Applications (ISDA)

作者： Daniel M. Muñoz Arboleda Carlos H. Llanos Leandro dos_S. Coelho Mauricio Ayala-Rincón Department of Mechanical Engineering University of Brasilia Brasília Brazil Industrial and Systems Engineering Graduate Program Pontificial Catholic University of Paraná Curitiba Brazil Departments of Computer Science and Mathematics University of Brasilia Brasília Brazil

High computational cost for solving large engineering optimization problems point out the design of parallel optimization algorithms. Population based optimization algorithms provide parallel capabilities that can be explored by their implementations done directly in hardware. This paper presents a hardware implementation of particle swarm optimization algorithms using an efficient floating-point arithmetic which performs the computations with high precision. All the architectures are parameterizable by bit-width, allowing the designer to choose the suitable format according to the requirements of the optimization problem. Synthesis and simulation results demonstrate that the proposed architecture achieves satisfactory results obtaining a better performance in therms of elapsed time than conventional software implementations.

关键词： Hardware Particle swarm optimization Floating-point arithmetic computer architecture Design optimization Computational efficiency Design engineering Algorithm design and analysis High performance computing Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Time Series Mining Approach for Noninvasive Intracranial Pressure Assessment: An Investigation of Different Regularization Techniques

Time Series Mining Approach for Noninvasive Intracranial Pre...

引用

computer Science and Information engineering, CSIE, WRI World Congress on FLAGGED

作者： Shaozhi Wu Peng Xu Shadnaz Asgari Marvin Bergsneider Xiao Hu Biomedical Engineering Graduate Program Henry Samueli School of Engineering and Applied Science University of California Los Angeles USA Neural Systems and Dynamics Laboratory Department of Neurosurgery the David Geffen School of Medicine University of California Los Angeles USA School of Computer Science and Engineering University of Electronic Science and Technology Chengdu China

A data mining framework has been proposed to estimate intracranial pressure (ICP) non-invasively in our previous work. In the corresponding approach, the feature vector extracted from arterial blood pressure (ABP) and flow velocity (FV) is translated to the estimated errors by the mapping function for each entry in the database. In this paper, three different mapping function solutions, linear least squares (LLS), truncated singular value decomposition (TSVD) and standard Tikhonov regularization (STR) are systemically tested to compare the possible effects of different solutions on the non-invasive ICP estimation. The conducted comparison demonstrated that the selection of mapping function solution actually influences the estimation. Among the tested three solutions for mapping function, TSVD and STR show better ICP estimation performance with smaller ICP errors than LLS.

关键词： Cranial pressure Data mining Biomedical engineering Data engineering Spatial databases computer science Feature extraction Arterial blood pressure Biomedical measurements Laboratories

来源：评论

学校读者我要写书评

暂无评论

Comparison of Different Approaches to ICP Dominated Pulse Extraction

Comparison of Different Approaches to ICP Dominated Pulse Ex...

引用

International Conference on Bioinformatics and Biomedical engineering (ICBBE)

作者： Peng Xu Shaozhi Wu Shadnaz Asgari Magdalena Kasprowicz Marvin Bergsneider Xiao Hu Center of Neuroinformatics School of Life Science and Technology University of Electronic Science and Technology Chengdu China Neural Systems and Dynamics Laboratory Department of Neurosurgery the David Geffen School of Medicine University of California Los Angeles USA School of Computer Science and Engineering University of Electronic Science and Technology Chengdu China Biomedical Engineering Graduate Program Henry Samueli School of Engineering and Applied Science University of California Los Angeles USA University of California Los Angeles Los Angeles CA US

Changes of ICP waveform morphology are characterized with different patients' states like hypertension, hydrocephalus and traumatic brain injury etc. Morphological clustering and analysis of ICP pulse (MOCAIP) approach is recently developed to extract ICP morphology feature, in which hierarchical clustering is used to extract the dominated pulse. In this paper, we evaluate the feasibility of using principle component analysis (PCA) and independent component analysis (ICA) to extract dominated pulse. The comparative study among clustering, PCA and ICP based approaches shows that PCA approach may be an alternative of clustering approach to extract dominated pulse in a faster fashion when dataset is of large size.

关键词： Independent component analysis Morphology Principal component analysis Biomedical engineering Feature extraction Electrocardiography Tellurium Hypertension Data mining Laboratories

来源：评论

学校读者我要写书评

暂无评论

Abstracts from the 2011 Joint Annual Meeting of the Society for Northwestern Vertebrate Biology and Washington Chapter of the Wildlife Society, Held at the Wesley Inn, Gig Harbor, Washington, March 23–25, 2011

引用

Northwestern Naturalist 2011年第2期92卷 136-166页

作者： Michael J. Adams Christopher A. Pearl Jessica Y. Adkins Daniel D. Roby Ladd Bayliss Peter J. Loschl Donald E. Lyons Yasuko Suzuki Hannah E. Anderson Sarah T. Hamman Keith B. Aubry Catherine M. Raley John J. Rohrer Eric C. Lofroth Scott H. Fitkin Michael L. Best Hartwell H. Welsh Jamie B. Bettaso Don T. Ashton Hartwell H. Welsh Scott McBain Lindsay M. Biga Andrew R. Blaustein Susan F. Brady R. Steven Wagner Daniel J. Selski James E. Johnson R. Bruce Bury Wynn W. Cudmore Hartwell H. Welsh Nathan D. Chelgren Tara Chestnut Chaucney W. Anderson Julie Kirshtein Megan T. Cook Tiffany S. Garcia Stephen Corn Erin Muths Amanda Kissel Rick Scherer Eric Delvin Jonathan D. Bakker Peter W. Dunwiddie Diana L. Dishman Deborah A. Duffield Harriet R. Huber Dyanna M. Lambourn Karen M. Dvornich Greg Falxa Gary M. Fellers Patrick M. Kleeman David Miller Brandon Fessler Jason T. Irwin Daniel D. Beck R. Steven Wagner Marc P. Hayes John A. Frew Christian E. Grue Chris R. Friesen Robert T. Mason Stevan J. Arnold Suzanne Estes Tiffany S. Garcia Katie M. Dugger Josh Johnson Mike Rochelle A. J. Kroll Stephanie S. Gervasi Caren S. Goldberg Dan Davis Erica Bree Rosenblum Bill Bosworth Lisette P. Waits Purnima Govindarajulu Gregory A. Green Steve Negri Jennifer R. Griffiths Daniel E. Schindler Christian E. Grue Karen M. Dvornich Adam G. Hansen David A. Beauchamp Casey M. Baldwin Marc P. Hayes Gretchen Padgett-Flohr Blake R. Hossack Winsor H. Lowe Paul Stephen Corn Aaron N. Johnston Kris Kendell Dave Prescott Scott Stevens Peter M. Kiffney Carol Volk Kerensa A. King Christian E. Grue James M. Grassley Andrew J. Kroll Matt Hane Josh Johnston Mike Rochelle Stuart Farber Niels Leuthold Michael J. Adams John P. Hayes Bo Li Michael T. Brett Kent B. Livezey Ilon E. Logan Teresa J. Lorenz Kimberly A. Sullivan Amanda V. Bakian Deanna Lynch Nancy Thomas Krysten Schuler Steven Jeffries Joshua Malt Kelly R. McAllister Joanne P. Schuett-Hames Aimee P. McIntyre Jay E. Jones Eric M. Lund Frithiof T. Waterstrat Jack N. Giovanini Stephen D. Duke Marc P. Hayes US Forest Service Pacific Northwest Research Station Olympia WA 98512 kaubry@fs.fed.us US Forest Service Okanogan-Wenatchee National Forest Methow Valley Ranger District Winthrop WA 98862 British Columbia Ministry of Environment Victoria BC V8W9M1 Washington Department of Fish and Wildlife Winthrop WA 98862 Humboldt State University 1 Harpst St. Arcata CA 95521 addsmike14@*** US Forest Service Pacific Southwest Research Station 1700 Bayside Dr. Arcata CA 95521 hwelsh@fs.fed.us US Fish and Wildlife Service Arcata Field Office 1655 Heindon Road Arcata CA 95521 jamie_bettaso@fws.gov Redwood Sciences Laboratory US Forest Service1700 Bayview Drive Arcata CA 99521 dashton@fs.fed.us hwelsh@fs.fed.us McBain &amp Trush 980 7th Street Arcata CA 95521 scott@*** Oregon State University Environmental Sciences Graduate Program Corvallis OR 97331 lindsay.biga@science.oregonstate.edu Oregon State University Department of Zoology Corvallis OR 97331 US Geological Survey Forest and Rangeland Ecosystem Science Center 3200 SW Jefferson Way Corvallis OR 97331 buryb@usgs.gov Life Science Department Chemeketa Community College Salem OR 97309 wynn.cudmore@chemeketa.edu US Forest Service Redwood Sciences Laboratory 1700 Bayview Drive Arcata CA 95521 hwelsh@fs.fed.us USGS Oregon Water Science Center 2130 SW 5th Avenue Portland OR 97207 chestnut@usgs.gov USGS Headquarters 12201 Sunrise Valley Drive Reston VA 20192 US Geological Survey Northern Rocky Mountain Science Center Aldo Leopold Wilderness Research Institute 790 E. Beckwith Avenue Missoula MT 59801 scorn@usgs.gov US Geological Survey Fort Collins Science Center 2150 Centre Avenue Building C Fort Collins CO 80526 Department of Biological Sciences Simon Fraser University Burnaby BC V5A 1S6 Colorado State University Department of Fishery and Wildlife Biology Fort Collins CO 80523 The Nature Conservancy 120 Union Ave SE Olympia WA 98501 edelvin@tnc.org School of Forest Resources University of Washington Seattle WA

来源：评论

学校读者我要写书评

暂无评论

Recommending mobile content using content diffusion and user preference transition

Recommending mobile content using content diffusion and user...

引用

2008 International Conference on e-Learning, e-Business, Enterprise Information systems, and e-Government, EEE 2008

作者： Lee, Tong Queue Lee, Eunchang Park, Young Park, Yongtae Department of Mobile Internet Dongyang Technical College Seoul Korea Republic of Graduate Program in Technology and Management Seoul National University Seoul Korea Republic of Department of Computer Science and Information Systems Bradley University Peoria IL United States Department of Industrial Engineering Seoul National University Seoul Korea Republic of

ISBN: (纸本)1601320639

Recommendation accuracy is especially important in mobile e-commerce environments due to the limited screen size of mobile devices and relatively expensive connection costs. Mobile content tends to be fashionable and are geared for young users. This paper presents a novel method of building a more accurate recommender system for mobile content in a mobile ecommerce environment. The method is based on collaborative filtering, and models content diffusion and user preference transition and incorporates them in constructing pseudo ratings from implicit feedback data. In a variety of experiments, recommender systems based on the method showed significantly better recommendation accuracy than a pure collaborative filtering-based recommender system.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

DLM: A distributed Large Memory System using remote memory swapping over cluster nodes

DLM: A distributed Large Memory System using remote memory s...

引用

IEEE International Conference on Cluster Computing

作者： Hiroko Midorikawa Motoyoshi Kurokawa Ryutaro Himeno Mitsuhisa Sato Department of Computer and Information Science Seikei University Musashino Tokyo Japan Graduate School of Systems and Information Engineering University of Tsukuba Tennodai Tsukuba Ibaraki Japan Advanced Center of Computing and Communication Wako Saitama Japan Research Program for Computational Science RIKEN Wako Saitama Japan

Emerging 64 bitOSpsilas supply a huge amount of memory address space that is essential for new applications using very large data. It is expected that the memory in connected nodes can be used to store swapped pages efficiently, especially in a dedicated cluster which has a high-speed network such as 10 GbE and Infiniband. In this paper, we propose the distributed large memory system (DLM), which provides very large virtual memory by using remote memory distributed over the nodes in a cluster. The performance of DLM programs using remote memory is compared to ordinary programs using local memory. The results of STREAM, NPB and Himeno benchmarks show that the DLM achieves better performance than other remote paging schemes using a block swap device to access remote memory. In addition to performance, DLM offers the advantages of easy availability and high portability, because it is a user-level software without the need for special hardware. To obtain high performance, the DLM can tune its parameters independently from kernel swap parameters. We also found that DLMpsilas independence of kernel swapping provides more stable behavior.

关键词： Kernel Arrays Memory management Servers Bandwidth Performance evaluation Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Real-time recognition of traffic signs using opponent color filters

Real-time recognition of traffic signs using opponent color ...

引用

14th World Congress on Intelligent Transport systems, ITS 2007

作者： Baba, Kyoko Hirai, Yuzo Master's Program in Graduate School of Systems and Information Engineering University of Tsukuba 1-1-1 Ten-nodai Tsukuba Ibaraki 305-8573 Japan Department of Computer Science Graduate School of Systems and Information Engineering University of Tsukuba 1-1-1 Ten-nodai Tsukuba Ibaraki 305-8573 Japan

ISBN: (纸本)9781617387777

In order to assist driver's vision, a real-time recognition system for traffic signs is proposed. After detecting sign candidates, biologically inspired opponent-color filters are used to extract symbol parts of signs. After normalizing the size of symbol, structural features are calculated to identify the sign. 5572 segmented images are used to design the algorithm. In a real-time system, the same sign in a sequence of frames is tracked, and a majority vote is used to integrate the recognition results. For test data, 93.8% recall rate and 99.3% precision rate could be attained. In-vehicle experiment also showed high recall and precision rates.

关键词： Traffic signs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：