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

International Symposium on Code Generation and Optimization, CGO 2007

作者： Codina, Josep M. Sánchez, Jesús González, Antonio Dep. of Computer Architecture UPC Barcelona Spain Intel Barcelona Research Center Intel Labs UPC Barcelona Spain

ISBN: (纸本)0769527647

This paper presents an instruction scheduling and cluster assignment approach for clustered processors. The proposed technique makes use of a novel representation named the scheduling graph which describes all possible schedules. A powerful deduction process is applied to this graph, reducing at each step the set of possible schedules. In contrast to traditional list scheduling techniques, the proposed scheme tries to establish relations among instructions rather than assigning each instruction to a particular cycle. The main advantage is that wrong or poor schedules can be anticipated and discarded earlier. In addition, cluster assignment of instructions is performed using another novel concept called virtual clusters, which define sets of instructions that must execute in the same cluster. These clusters are managed during the deduction process to identify incompatibilities among instructions. The mapping of virtual to physical clusters is postponed until the scheduling of the instructions has finalized. The advantages this novel approach features include: (1) accurate scheduling information when assigning, and, (2) accurate information of the cluster assignment constraints imposed by scheduling decisions. We have implemented and evaluated the proposed scheme with superblocks extracted from SpecInt95 and MediaBench. The results show that this approach produces better schedules than the previous state-of-the-art. Speed-ups are up to 15%, with average speed-ups ranging from 2.5% (2-Clusters) to 9.5% (4-Clusters). ©2007 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Multipoint organizational evolutionary algorithm for globally minimizing functions of many variables

Multipoint organizational evolutionary algorithm for globall...

引用

2007 2nd International Conference on Pervasive Computing and Applications, ICPCA'07

作者： Yanping, Lu Shaozi, Li Changle, Zhou Intelligent Multimedia Technology Lab. Computer Science Dep. Xiamen University Xiamen China

ISBN: (纸本)1424409713

In this paper, we design a variant of the organizational evolutionary algorithm (OEA), called the multipoint organizational evolutionary algorithm (mOEA), for global optimization of multimodal functions. Our objective is to apply crossover strategy of multiple points to enhance the OEA, so that the resulting algorithm can improve the precision of the solutions and have a fast convergence rate. In the mOEA, crossover among many leaders enables the diversity of the leader swarm to be preserved to discourage premature convergence. Another new organizational operator, the integrating operation replacing Annexing manipulation, guarantees members of each organization to converge to the leader fast and also have a good diversity due to mutation. Experiments on six complex optimization benchmark functions with 30 or 100 dimensions and very large numbers of local minima show that, comparing with the original OEA and CLPSO, mOEA effectively converges faster, results in better optima, is more robust. © 2007 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Eccentric error and compensation in rotationally symmetric laser triangulation

引用

仪器仪表学报 2007年第9期28卷 1548-1553页

作者： Wang Lei Gao Jun Wang Xiaojia Johannes Eckstein Peter Ott Lab of Image Information Processing School of Computer and Information Hefei University of Technology Hefei 230009 China Optical Engineering Lab. Heilbronn University Heilbronn D-74081 Germany Dep. of Mechanical and Electrical Engineering Xiamen University Xiamen 361005 China

Rotationally symmetric triangulation(RST)sensor has more flexibility and less uncertainty limits because of the abaxial rotationally symmetric optical *** if the incident laser is eccentric,the symmetry of the image will descend,and it will result in the eccentric error especially when some part of the imaged ring is *** model of rotationally symmetric triangulation that meets the Schimpflug condition is presented in this *** error from eccentric incident laser is *** is pointed out that the eccentric error is composed of two parts,one is a cosine in circumference and proportional to the eccentric dep.rture factor,and the other is a much smaller quadric factor of the *** the ring is complete,the first error factor is zero because it is integrated in whole ring, but if some part of the ring is blocked,the first factor will be the main *** verifies the result of the a- *** last,a compensation method to the error when some part of the ring is lost is presented based on neural *** results of experiment show that the compensation will make the absolute maximum error descend to half,and the standard deviation of error descends to 1/3.

关键词：补偿作用旋转对称激光三角测量法偏心因子视力测量神经网络

来源：评论

学校读者我要写书评

暂无评论

StorySurfer: A playful book browsing installation for children's libraries 07

StorySurfer: A playful book browsing installation for childr...

引用

6th international Conference on Interaction Design And Children, IDC 2007

作者： Eriksson, Eva Lykke-Olesen, Andreas IDC - Interaction Design Collegium Dep. of Computer Science and Engineering Chalmers University of Technology SE-41296 Gothenburg Sweden Department of Design Aarhus School of Architecture DK-8000 Aarhus C Denmark

ISBN: (纸本)9781595937476

In this paper, we present a large-scale interactive book browsing installation for children's libraries called StorySurfer. The StorySurfer prototype is developed within the Interactive Children's Library project, which includes interests from within design, research, industry, and libraries. The objective of the project is to give room for and encourage the physical activities of children, while pursuing to connect these with the basic digital and analogue services of the library e.g. borrowing and handing in books, searching for information, and providing access to a rich variety of media. Copyright 2007 ACM.

关键词： Digital libraries

来源：评论

学校读者我要写书评

暂无评论

Using omnidirectional BTS and different evolutionary approaches to solve the RND problem

引用

11th International Conference on computer Aided Systems Theory, EUROCAST 2007

作者： Vega-Rodríguez, Miguel A. Gómez-Pulido, Juan A. Alba, Enrique Vega-Pérez, David Priem-Mendes, Silvio Molina, Guillermo Dep. Techn. of Computers and Communications Univ. of Extremadura Caceres Spain Dep. of Computer Science Univ. of Malaga Malaga Spain Polytechnic Institute of Leiria School of Technology and Management Leiria Portugal

ISBN: (纸本)9783540758662

RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor networks. This problem consists in covering a certain geographical area by using the smallest number of radio antennas achieving the biggest cover rate. To date, several radio antenna models have been used: square coverage antennas, omnidirectional antennas that cover a circular area, etc. In this work we use omnidirectional antennas. On the other hand, RND is an NP-hard problem;therefore its solution by means of evolutionary algorithms is appropriate. In this work we study different evolutionary approaches to tackle this problem. PBIL (Population-Based Incremental Learning) is based on genetic algorithms and competitive learning (typical in neural networks). DE (Differential Evolution) is a very simple population-based stochastic function minimizer used in a wide range of optimization problems, including multi-objective optimization. SA (Simulated Annealing) is a classic trajectory descent optimization technique. Finally, CHC is a particular class of evolutionary algorithm which does not use mutation and relies instead on incest prevention and disruptive crossover. Due to the complexity of such a large analysis including so many techniques, we have used not only sequential algorithms, but also grid computing with BOINC in order to execute thousands of experiments in only several days using around 100 computers. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Mobile telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Management of UWB pieocell clusters: UCELLS project approach

Management of UWB pieocell clusters: UCELLS project approach

引用

2008 IEEE International Conference on Ultra-Wideband, ICUWB 2008

作者： Llorente, R. Cartaxo, A. Uguen, B. Duplicy, J. Romme, J. Puche, J.F. Schmertz, D. Lostanlen, Y. Baflales, R. Marti, J. Fibre-Radio Group Nanophotonics Technology Centre Universidad Politécnica de Valencia Camino de Vera s/n 46022 Valencia Spain Optical Communications Group Instituto de Telecomunicações Dep. Electrical and Computer Engineering Av. Rovisco Pais 1 1049-001 Lisboa Portugal Institut d'Electronique et de Télécommunications de Rennes UMR CNRS 6164 Rennes France Agilent Labs. Wingepark 51 3110 Rotselaar Belgium IMST GmbH Carl-Friedrich-Gauss-Str. 2 47475 Kamp-Lintfort NRW Germany DAS Photonics S.L. Ciudad Politécnica de la Innovación Camino de Vera s/n Edificio 9B 46022 Valencia Spain Wisair Ltd. Or Towers 27 Habarzel Str. Tel-Aviv 69710 Israel Siradel S.A.S 3 allée Adolphe Bobierre CS 24343 Rennes France Spain

ISBN: (纸本)9781424418275

In this paper the UWB cellular architecture proposed in the IST- UCELLS project is described. This architecture targets to provide Gb/s indoor connectivity employing very low-cost UWB transceivers. The pieocell clustering of UWB transmitter overcomes the severe range limitation of stand-alone UWB technology. A photonic analog-to-digital converter (Ph-ADC) is developed in UCELLS for localization, fingerprinting and spectral management of UWB transceivers. This approach minimizes interferences and optimizes the user capacity in the pieocell cluster area. ©2008 IEEE.

关键词： Analog to digital conversion

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Interconnection Networks Using Full-System Simulators: Lessons Learned

Evaluation of Interconnection Networks Using Full-System Sim...

引用

Annual Symposium on Simulation

作者： Javier Navaridas Fco. Javier Ridruejo Jose Miguel-Alonso Dep. of Computer Architecture and Technology University of Basque Country (UPV-EHU) Donostia San Sebastian Spain

In this paper we show the difficulties encountered when performing full system simulation of a distributed memory parallel system. To illustrate the problem, we have chosen a workbench that evaluates the impact on application performance of some simple congestion-control mechanism that can be implemented in the interconnection network. Applications of choice are some of those included in the NAS parallel benchmarks. Running a full-system, execution-driven simulation that combines Simics with an interconnection network simulator, we observe some unexpected, negative interactions of overlapping congestion control techniques implemented at the network level and at the host level. Each MPI implementation uses a different protocol stack, and some of them work without TCP. We compare and contrast results obtained with MPICH, LA-MPI and LAM

关键词： Multiprocessor interconnection networks Storage area networks Economic indicators

来源：评论

学校读者我要写书评

暂无评论

Agent-based distributed group key establishment in wireless sensor networks

Agent-based distributed group key establishment in wireless ...

引用

2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WOWMOM

作者： Chatzigiannakis, Ioannis Konstantinou, Elisavet Liagkou, Vasiliki Spirakis, Paul Computer Technology Institute P.O. Box 1122 26110 Patras Greece Department of Computer Engineering and Informatics University of Patras 26500 Patras Greece Dep. of Information and Communication Systems Engineering University of the Aegean 83200 Samos Greece

ISBN: (纸本)1424409926

Wireless sensor networks are comprised of a vast number of ultra-small autonomous computing, communication and sensing devices, with restricted energy and computing capabilities, that co-operate to accomplish a large sensing task. Such networks can be very useful in practice, e.g. in the local monitoring of ambient conditions and reporting them to a control center. In this paper we propose a distributed group key establishment protocol that uses mobile agents (software) and is particularly suitable for energy constrained, dynamically evolving ad-hoc networks. Our approach totally avoids the construction and the maintenance of a distributed structure that reflects the topology of the network. Moreover, it trades-off complex message exchanges by performing some amount of additional local computations in order to be applicable at dense and dynamic sensor networks. The extra computations are simple for the devices to implement and are evenly distributed across the participants of the network leading to good energy balance. We evaluate the performance of our protocol in a simulated environment and compare our results with existing group key establishment protocols. The security of the protocol is based on the Diffie-Hellman problem and we used in our experiments its elliptic curve analog. Our findings basically indicate the feasibility of implementing our protocol in real sensor network devices and highlight the advantages and disadvantages of each approach given the available technology and the corresponding efficiency (energy, time) criteria. ©2007 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

RWA algorithm for scheduled lightpath demands in WDM networks

引用

5th International Symposium on Parallel and Distributed Processing and Applications/ISPA 2007 International Workshops

作者： Park, Sooycon Yang, Jong S. Kim, Moonseong Bang, Young-Cheol Dep. of Computer Engineering Korea Polytechnic University South Korea Korea Institute of Industrial Technology Evaluation and Planning South Korea School of Info. and Comm. Engineering Sungkyunkwan University South Korea

ISBN: (纸本)9783540747413

We have proposed and evaluated a novel heuristic algorithm of routing and wavelength assignment (RWA) for scheduled lightpath demands (SLD). Our algorithm is shown here to have a performance gain in terms of the number of wavelengths up to 65.8% compared with the most recently introduced method, TDP_RWA, and works on directed and undirected optical networks. Also, we show the execution time of our proposed method is feasible.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

On efficiency group multicasting algorithm with multiple minimum Steiner trees

On efficiency group multicasting algorithm with multiple min...

引用

7th International Conference on Computational Science (ICCS 2007)

作者： Kim, Moonseong Kang, Minseok Choo, Hyunseung Yang, Jong S. Bang, Young-Cheol School of Info. and Comm. Engineering Sungkyunkwan University South Korea Dep. of Computer Engineering Korea Polytechnic University South Korea Korea Institute of Industrial Technology Evaluation and Planning South Korea

ISBN: (纸本)9783540725879

In this paper, we study the problem of constructing minimum cost group multicast trees with bandwidth reservations. Our algorithm uses multiple candidate paths to select a path from source to each destination member in each multicast tree construction. We show that our proposed algorithm performs better in terms of total tree cost for real life networks over well-known algorithm GKMB. The enhancement is up to about 10% similar to 25% in terms of normalized surcharge for the GKMB tree cost.

关键词： group multicast routing algorithm minimum Steiner trees group KMB (GKMB) algorithm and minimum cost multicast tree (MCMT) algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：