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

MLEA： A Solution for Users of Android in UTPVirtual

computer Technology and Application 2011年第5期2卷 406-412页

作者： Gisela Torres de Clunie Sergio Crespo Coelho da Silva Pinto Aris Linet Castillo Lucas Monteiro Braz Tasia Serrao Norman Rangel Jeanette Riley Olinda de Barraza Kexy Rodriguez Computer Systems Engineering Department Technological University of Panama Panama 0819 Panama Computer Science Research and Graduate Program in Applied Computing University of the Sinos Valley （UNISINOS） RS 93022-000 Brazil CIDITIC Technological University of Panama Panama 0819 Panama

This paper describes a design of an educational platform for a mobile learning architecture, which is a state of the an topic in distance education. The product will allow users to interact in an efficient, flexible, and transparent fashion with a web-based education environment, in this case Module Object-Oriented Dynamic Learning Environment （Moodle）, using Android mobile devices. In order to provide a strong and lasting architecture, the Service Oriented Architecture （SOA） methodology is used given that it allows easy software re-utilization as well as integration of heterogeneous services. The architecture is based on web services implemented with Representational State Transfer （REST）, as it has been demonstrated to be lighter and less consuming than other protocols, for devices with limited resources such as mobile devices. Web services provide the communication means between the server side and the client side of the architecture, whereas agents are used to deliver the services itself. The authors propose the development of an environment that facilitates the integration of various educational resources to support m-learning. An important aspect of the proposal is the offering of a tool to provide customized alerts for students and teachers, enabling them to remain updated about activities taking place in the courses.

关键词： Distance learning virtual education m-learning service oriented architecture （SOA） mobile learning mobile computing interoperability representational state transfer （REST）.

来源：评论

学校读者我要写书评

暂无评论

Structure and magnetic properties characterization of electrodeposited Co37Fe63 alloys containing oxygen for magnetic recording applications

Structure and magnetic properties characterization of electr...

引用

作者： Elhalawaty, S. Carpenter, R.W. George, J. Brankovic, S.R. Materials Science and Engineering Graduate Program School for Engineering of Matter Transport and Energy Arizona State University 85287-6106 United States LeRoy Eyring Center for Solid State Science Arizona State University AZ 85287-9506 United States Center for Nanomagnetic Systems University of Houston TX 77204-4005 United States Electrical and Computer Engineering Department University of Houston TX 77204-4005 United States

ISBN: (纸本)9781118029473

Soft and high magnetic moment Co37Fe63 films were electro-deposited with variable additives on Cu/Ti/Si substrates. The correlation between structure and magnetic properties has been investigated. TEM showed the crystal structure of the films to be BCC with a 〈111〉 texture, and a grain size in the range of 10-20 nm. Oxygen in the deposited films has been identified by EDS and EELS using HAADF STEM. SIMS analysis revealed the presence of hydrogen and oxygen in the deposited CoFe films. Electron microscopy results showed that the oxygen was mainly distributed along the grain boundaries in the CoFe film. In regions where oxygen was present in the films, the Fe content was enhanced relative to Co. The magnetic properties of the deposits have been measured by Vibrating Sample Magnetometer (VSM), quantifying the impact of incorporated oxygen in the film on the saturation magnetization and the coercivity.

关键词： Magnetic properties

来源：评论

学校读者我要写书评

暂无评论

Agile parallel bioinformatics workflow management using Pwrake

引用

BMC Research Notes 2011年第1期4卷 1-8页

作者： Mishima, Hiroyuki Sasaki, Kensaku Tanaka, Masahiro Tatebe, Osamu Yoshiura, Koh-Ichiro Department of Human Genetics Nagasaki University Graduate School of Biomedical Sciences Nagasaki Nagasaki 1-12-4 Sakamoto Japan Nagasaki University Global Center of Excellence Program Nagasaki Nagasaki 1-12-4 Sakamoto Japan Center for Computational Sciences University of Tsukuba Tsukuba Ibaraki 1-1-1 Tennodai Japan Core Research for Evolutional Science and Technology Japan Science and Technology Agency Kawaguchi Saitama 4-1-8 Honcho Japan Departmentent of Computer Science Graduate School of Systems and Information Engineering University of Tsukuba Tsukuba Ibaraki 1-1-1 Tennodai Japan

Background: In bioinformatics projects, scientific workflow systems are widely used to manage computational procedures. Full-featured workflow systems have been proposed to fulfil the demand for workflow management. However, such systems tend to be over-weighted for actual bioinformatics practices. We realize that quick deployment of cutting-edge software implementing advanced algorithms and data formats, and continuous adaptation to changes in computational resources and the environment are often prioritized in scientific workflow management. These features have a greater affinity with the agile software development method through iterative development phases after trial and error. Here, we show the application of a scientific workflow system Pwrake to bioinformatics workflows. Pwrake is a parallel workflow extension of Ruby's standard build tool Rake, the flexibility of which has been demonstrated in the astronomy domain. Therefore, we hypothesize that Pwrake also has advantages in actual bioinformatics workflows. Findings. We implemented the Pwrake workflows to process next generation sequencing data using the Genomic Analysis Toolkit (GATK) and Dindel. GATK and Dindel workflows are typical examples of sequential and parallel workflows, respectively. We found that in practice, actual scientific workflow development iterates over two phases, the workflow definition phase and the parameter adjustment phase. We introduced separate workflow definitions to help focus on each of the two developmental phases, as well as helper methods to simplify the descriptions. This approach increased iterative development efficiency. Moreover, we implemented combined workflows to demonstrate modularity of the GATK and Dindel workflows. Conclusions: Pwrake enables agile management of scientific workflows in the bioinformatics domain. The internal domain specific language design built on Ruby gives the flexibility of rakefiles for writing scientific workflows. Furthermore, readability

关键词： Ruby Iterative Development Agile Software Development Host Language Bioinformatics Domain

来源：评论

学校读者我要写书评

暂无评论

Complex-valued functional link network design by orthogonal least squares method for function approximation problems

Complex-valued functional link network design by orthogonal ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Md. Faijul Amin Ramasamy Savitha Muhammad Ilias Amin Kazuyuki Murase Department of Systems Design Engineering Graduate School of Engineering University of Fukui Fukui Japan School of Electrical and Electronics Engineering Nanyang Technological University Singapore Department of Computer Science and Engineering United International University Dhaka Bangladesh Research and Education Program for Life Science University of Fukui Fukui Japan

This paper presents a fully complex-valued functional link network (CFLN). The CFLN is a single-layered neural network, which introduces nonlinearity in the input layer using nonlinear functions of the original input variables. In this study, we consider multivariate polynomials as the nonlinear functions. Unlike multilayer neural networks, the CFLN is free from local minima problem, and it offers very fast learning in parameters because of its linear structure. In the complex domain, polynomial based CFLN has an additional advantage of not requiring activation functions, which is a major concern in the complex-valued neural networks. However, it is important to select a smaller subset of polynomial terms (monomials) for faster and better performance, since the number of all possible monomials may be quite large. In this paper, we use the orthogonal least squares method in a constructive fashion (starting from lower degree to higher) for the selection of a parsimonious subset of monomials. Simulation results demonstrate that computing CFLN in purely complex domain is advantageous than in double-dimensional real domain, in terms of number of connection parameters, faster design, and possibly generalization performance. Moreover, our proposed CFLN compares favorably with several other multilayer networks in the complex domain.

关键词： Polynomials Nonhomogeneous media Educational institutions Algorithm design and analysis Function approximation Neural networks Input variables

来源：评论

学校读者我要写书评

暂无评论

Hardware Particle Swarm Optimization with passive congregation for embedded applications

Hardware Particle Swarm Optimization with passive congregati...

引用

Southern Conference on programmable Logic

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

Achieving high performance optimization algorithms for embedded applications can be very challenging, particularly when several requirements such as high accuracy computations, short elapsed time, area cost, low power consumption and portability must be accomplished. This paper proposes a hardware implementation of the Particle Swarm Optimization algorithm with passive congregation (HPPSOpc), which was developed using several floating-point arithmetic libraries. The passive congregation is a biological behavior which allows the swarm to preserve its integrity, balancing between global and local search. The HPPSOpc architecture was implemented on a Virtex5 FPGA device and validated using two multimodal benchmark problems. Synthesis, simulation and execution time results demonstrates that the passive congregation approach is a low cost solution for solving embedded optimization problems with a high performance.

关键词： Hardware computer architecture Software Field programmable gate arrays Benchmark testing Optimization Software algorithms

来源：评论

学校读者我要写书评

暂无评论

Opposition-based shuffled PSO with passive congregation applied to FM matching synthesis

Opposition-based shuffled PSO with passive congregation appl...

引用

Congress on Evolutionary Computation

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

Synthesis of musical instruments or human voice is a time consuming process which requires theoretical and experimental knowledge about the synthesis engine. Commonly, performers need to deal with synthesizer interfaces and a process of trial and error for creating musical sounds similar to a target sound. This drawback can be overcome by adjusting automatically the synthesizer parameters using optimization algorithms. In this paper a hybrid particle swarm optimization (PSO) algorithm is proposed to solve the frequency modulation (FM) matching synthesis problem. The proposed algorithm takes advantage of a shuffle process for exchanging information between particles and applies the selective passive congregation and the opposition-based learning approaches to preserve swarm diversity. Both approaches for injecting diversity are based on simple operators, preserving the easy implementation philosophy of the particle swarm optimization. The proposed hybrid particle swarm optimization algorithm was validated for a three-nested FM synthesizer, which represents a 6-dimensional multimodal optimization problem with strong epistasis. Simulation results revealed that the proposed algorithm presented promising results in terms of quality of solutions.

关键词： Frequency modulation Optimization Equations Convergence Particle swarm optimization Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

AN EQUIVALENCY CONDITION OF NONSINGULARITY IN NONLINEAR SEMIDEFINITE programMING

引用

Journal of systems science & Complexity 2010年第4期23卷 822-829页

作者： Chengjin LI Wenyu SUN Raimundo J. B. de SAMPAIO School of Mathematical Sciences Nanjing Normal and Computer Science Fujian Normal University Wenyu SUN University Nanjing 210046 China School of Mathematics Fuzhou 350007 China School of Mathematical Sciences Nanjing Normal University Nanjing 210046 China Pontifical Catholic University of Parana ( PUCPR) Graduate Program in Production and Systems Engineering (PPGEPS) CEP 81611-970 Curitiba Parana Brazil

In this paper,an equivalency condition of nonsingularity in nonlinear semidefinite programming,which can be viewed as a generalization of the equivalency condition of nonsingularity for linearsemidefinite programming,... 详细信息

关键词： Equivalency condition of nonsingularity nonlinear semidefinite programming semidefinite programming.

来源：评论

学校读者我要写书评

暂无评论

Hardware particle swarm optimization based on the attractive-repulsive scheme for embedded applications

Hardware particle swarm optimization based on the attractive...

引用

2010 International Conference on Reconfigurable Computing and FPGAs, ReConFig 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 DF 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 DF Brazil

ISBN: (纸本)9780769543147

Particle Swarm Optimization (PSO) algorithms have been proposed to solve engineering problems that require to find an optimal point of operation. However, the PSO algorithm suffers from premature convergence and high elapsed time when solving multimodal and large scale engineering problems. This problem becomes an evident drawback for embedded applications in which the microcontrollers often operates at low computational capacity. This paper proposes a hardware implementation of a parallel self-adaptive PSO algorithm based on an attractive-repulsive scheme and using the efficient floating-point arithmetic which performs computations with large dynamic range and high precision. The parallel capabilities of the PSO are exploited by implementing parallel particles directly in hardware in order to decrease the running time. In addition, the attractive-repulsive technique avoids the premature convergence problem by self-adapting the swarm behavior according to its diversity. Synthesis and simulation results for benchmark test problems were performed, demonstrating the correctness of the proposed architectures. Finally, an elapsed time comparison between the hardware and software implementations shows the suitableness of the proposed architecture for embedded applications. © 2010 IEEE.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Accelerating the Shuffled Frog Leaping algorithm by parallel implementations in FPGAs

Accelerating the Shuffled Frog Leaping algorithm by parallel...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：