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

Semantic configuration management model using a path dependence flow graph

Systems and Computers in Japan 1999年第5期30卷 47-55页

作者： Naoi, Kuniaki Takahashi, Naohisa NTT Software Laboratories Musashino 180 Japan NTT Optical Netwk. Syst. Labs. Musashino 180 Japan Waseda University Global Computing Laboratory NTT Software Laboratories Technical University Berlin Germany Info. Processing Society of Japan Japan Soc. Software Sci. Technol. ACM IEEE Computer Society University of Electro-Communications Tokyo Institute of Technology NTT Elec. Commun. Laboratories Parallel Distributed Arch.'s Res. G. NTT Optical Netwk. Syst. Labs. Info. Processing Society of Japan ACM

If a program is not executed as expected, we say that a semantic error has occurred in the program. As is well known, semantic errors sometimes appear in a program because the modification intention was not correctly reflected in the new configuration. In order to avoid as many semantic errors as possible, as well as to efficiently locate errors, the authors are developing a semantic configuration management (SCM) model that is capable of efficiently performing various analyses of programs in a unified framework. Previously, the following techniques have been proposed in the SCM model: an analysis technique for detecting infeasible paths (IFPs) from the program, and an analysis technique for generating various kinds of slices in a unified framework. This paper proposes a technique for accurately computing program slices using the IFPs in the SCM model. Next, it proposes a technique for improving the accuracy of detecting semantic errors during merging of several modifications by using accurate program slices. In addition, new applications are proposed for the various slices.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Benchmarking the task graph scheduling algorithms

Benchmarking the task graph scheduling algorithms

引用

International Symposium on parallel processing

作者： Y.-K. Kwok I. Ahmad Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA Department of Computer Science Hong Kong University of Science and Technology Hong Kong China

The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NP-completeness of the problem has instigated researchers to propose a myriad of heuristic algorithms. While these algorithms are individually reported to be efficient, it is not clear how effective they are and how well they compare against each other. A comprehensive performance evaluation and comparison of these algorithms entails addressing a number of difficult issues. One of the issues is that a large number of scheduling algorithms are based upon radically different assumptions, making their comparison on a unified basis a rather intricate task. Another issue is that there is no standard set of benchmarks that can be used to evaluate and compare these algorithms. Furthermore, most algorithms are evaluated using small problem sizes, and it is not clear how their performance scales with the problem size. The authors first provide a taxonomy for classifying various algorithms into different categories according to their assumptions and functionalities. They then propose a set of benchmarks which are of diverse structures without being biased towards a particular scheduling technique and still allow variations in important parameters. They have evaluated 15 scheduling algorithms, and compared them using the proposed benchmarks. Based upon the design philosophies and principles behind these algorithms, they interpret the results and discuss why some algorithms perform better than the others.

关键词： Scheduling algorithm Processor scheduling parallel processing Concurrent computing Heuristic algorithms Laboratories Computer science Taxonomy Algorithm design and analysis Scalability

来源：评论

学校读者我要写书评

暂无评论

Optimal and near-optimal allocation of precedence-constrained tasks to parallel processors: defying the high complexity using effective search techniques

Optimal and near-optimal allocation of precedence-constraine...

引用

International Conference on parallel processing (ICPP)

作者： I. Ahmad Yu-Kwong Kwok Department of Computer Science Hong Kong University of Science and Technology Hong Kong China Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

Obtaining an optimal schedule for a set of precedence-constrained tasks with arbitrary costs is a well-known NP-complete problem. However, optimal solutions are desired in many situations. In this paper we propose search-based algorithms for determining optimal schedules for moderately large problem sizes. The first algorithm which is based on the A* search technique uses a computationally efficient cost function for guiding the search with reduced complexity. We propose a number of state-pruning techniques to reduce the size of the search space. For further lowering the complexity, we parallelize the search. The parallel version is based on reduced interprocessor communication and is guided by static and dynamic load-balancing schemes to evenly distribute the search states to the processors. We also propose an approximate algorithm that guarantees a bounded deviation from the optimal solution but takes considerably shorter time. Based on an extensive experimental evaluation of the algorithms, we conclude that the parallel algorithm with pruning techniques is an efficient scheme for generating optimal solutions for medium to moderately large problems while the approximate algorithm is a useful alternative if slightly degraded solutions are acceptable.

关键词： Optimal scheduling Processor scheduling Computational efficiency Costs Concurrent computing Network topology Scheduling algorithm Computer science Laboratories Multiprocessor interconnection networks

来源：评论

学校读者我要写书评

暂无评论

An efficient local address generation for the block-cyclic distribution 3

An efficient local address generation for the block-cyclic d...

引用

3rd International Conference on Algorithms and Architectures for parallel processing, ICA3PP 1997

作者： Kwon, Oh-Young Kim, Tae-Geun Han, Tack-Don Yang, Sung-Bong Kim, Shin-Dug Distributed Computing Lab. Systems Engineering Research Institute 1 Ueun-dong Yusong-gu Taejon305-333 Korea Republic of Parallel Processing System Laboratory Dept. of Computer Science Yonsei University Seoul120-749 Korea Republic of

ISBN: (纸本)0780342291

In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, an efficient compiling method is required. In this paper, two local address generation methods for the block-cyclic distribution are presented. One is a simple local address generation method that is modified from the virtual-block scheme. The other is a linear-time ΔM table construction method. The array elements of A(l:h:s) to be accessed at run-time build up a family of lines. By using the equation of the lines, a ΔM table can be generated in O(k) time. Experimental results show that a simple local address generation method has poor performance but a linear-time ΔM table generation method is faster than other algorithms in ΔM table generation time and access time for 10,000 array elements. © 1997 IEEE.

关键词： Virtual addresses

来源：评论

学校读者我要写书评

暂无评论

An efficient local address generation for the block-cyclic distribution

An efficient local address generation for the block-cyclic d...

引用

IEEE International Conference on Algorithms and Architectures for parallel processing (ICAP)

作者： Oh-Young Kwon Tae-Geun Kim Tack-Don Han Sung-Bong Yang Shin-Dug Kim Distributed Computing Laboratory Systems Engineering Research Institute Taejon South Korea Parallel Processing System Laboratory Department of Computer Science Yonsei University Seoul South Korea

ISBN: (纸本)0780342291

In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, an efficient compiling method is required. In this paper, two local address generation methods for the block-cyclic distribution are presented. One is a simple local address generation method that is modified from the virtual-block scheme. The other is a linear-time /spl Delta/M table construction method. The array elements of A(l:h:s) to be accessed at run-time build up a family of lines. By using the equation of the lines, a /spl Delta/M table can be generated in O(k) time. Experimental results show that a simple local address generation method has poor performance but a linear-time /spl Delta/M table generation method is faster than other algorithms in /spl Delta/M table generation time and access time for 10,000 array elements.

关键词： Runtime Equations distributed computing Systems engineering and theory parallel processing Laboratories Computer science parallel languages Upper bound Automata

来源：评论

学校读者我要写书评

暂无评论

parallel AND distributed TLM COMPUTATION WITH SIGNAL-processing FOR ELECTROMAGNETIC-FIELD MODELING

引用

INTERNATIONAL JOURNAL OF NUMERICAL MODELLING-ELECTRONIC NETWORKS DEVICES AND FIELDS 1995年第3-4期8卷 169-185页

作者： SO, PPM ESWARAPPA, C HOEFER, WJR NSERC/MPR Teltech Research Chair in RF Engineering Department of Electrical and Computer Engineering University of Victoria Victoria British Columbia V8W 3P6 Canada Poman So received his B.Sc. degree in computer science and physics from the University of Toronto Toronto Onatario Canada in 1985. He obtained his B.A. Sc. and M.A.Sc. degrees in electrical engineering (summa cum laude) from the University of Ottawa Ottawa Ontario Canada in 1987 and 1989 respectively. Mr So was a research engineer in the University of Ottawa from January 1989 to October 1991 his research interests included CAD techniques of microwave circuits and numerical methods for electromagnetic wave modelling. He specialized in the development of electromagnetic engineering CAD software and successfully implemented a number of electromagnetic wave simulators based on the two-dimensional and three-dimensional transmission-line matrix methods. From August 1990 to February 1991 he accompanied Professor W. J. R. Hoefer to Rome Italy and Sophia Antiopolas France. During that time he implemented a parallel version of the 3D-TLM simulator for the CM-2 Connection Machine using C-Star and X Windows Library. He is a research engineer and a Ph.D. student at the University of Victoria Victoria British Columbia Canada. He ported the 2D- and 3D-TLM simulators to DECmpp 1200 massively parallel computer using MPL C and C++. He also combined OSA90/hope a commercially available microwave CAD program with a 2D-TLM simulation module for geometry optimization using the Datapipe technique of OSA90/hope. Recently he has developed a distributed client-server computing technique for the TLM method this technique could accelerate the TLM simulation by more than an order of magnitude. Channabasappa Eswarappa received the M.Tech. degree in electrical engineering from the Indian Institute of Technology Kanpur India in 1983 and Ph. D. degree from the University of Ottawa Canada in 1990. He worked as an Assistant Executive Engineer and later as

This paper describes the implementation of transmission-line matrix (TLM) method algorithms on a massively parallel computer (DECmpp 12000), the technique of distributed computing in the UNIX environment, and the combination of TLM analysis with Prony's method as well as with autoregressive moving average (ARMA) digital signal processing for electromagnetic field modelling. By combining these advanced computation techniques, typical electromagnetic field modelling of microwave structures by TLM analysis can be accelerated by a few orders of magnitude.

关键词： Mathematical models

来源：评论

学校读者我要写书评

暂无评论

Multiagent fault‐diagnosis expert system in power systems

引用

European Transactions on Electrical Power 1995年第5期5卷 341-347页

作者： Wang, J.P. Trécat, J. Dr. Jianping Wang is a doctor fellow in the Faculte Polytechnique de Mons in Belgium. His current research field is parallel processing applications in power systems. Dr. Wang obtained his BS degree from Southwest Jiaotong University in P.R. Chinain 1982. From 1982 to 1990 he was appointed as an assistant lecturer. lecturer and associate professor respectively in the electrical engineering department of Southwest Jiaotong University. He obtained his Ph.D in the FacultC Polytechnique de Mons in July of 1993. (BD Dolez 3 1 FPMS B-7000 Mons Belgium T +32-65/37 41 87 Fax +32-65/37 43 00) Professor J. Trécat is a director in the power system laboratory in the Faculty Polytechnique de Mons. He obtained his Ph.D in the University of Manchester Institute of Science and Technology(UM1ST) in U.K. in 1970. He has been working in the fields of power system automation artificial intelligence application and computer vision in the Facult6 Polytechnique de Mons since 1970. He is a senior member of IEEE and he has made much contribution both in electrical engineering education and research. (BD Dolez 3 I FPMS B-7000 Mons T +32-651374185. Fax +32-6513743 00)

In order to solve the speed problem and shallow reasoning problem met in current research in fault diagnosis expert system, this paper presents a model based parallel fault diagnosis expert system for energy management systems (EMS). The Petri net model, which corresponds to the relationship between power system components and their protection systems, has been used for the inference in fault diagnosis. A multiagent parallel processing expert system, which is based on five transputers in Sun workstation, has been built for fault diagnosis purposes. The test results show that this expert system is not only fast but also has better performances. Copyright © 1995 John Wiley & Sons, Ltd.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reply

引用

Trends in Neurosciences 1993年第5期16卷 P177-178页

作者： Mitsuo Kawato Hiroaki Gomi ATR Human Information Processing Research Laboratories Kyoto 619-02 Japan Laboratory of Parallel Distributed Processing Research Institute for Electronic Science Hokkaido University Sapporo Hokkaido 060 Japan

来源：评论

学校读者我要写书评

暂无评论

Inverse dynamics of speech motor control 93

Inverse dynamics of speech motor control

引用

Proceedings of the 7th International Conference on Neural Information processing Systems

作者： Makoto Hirayama Eric Vatikiotis-Bateson Mitsuo Kawato ATR Human Information Processing Research Laboratories Kyoto Japan ATR Human Information Processing Research Laboratories Kyoto Japan and Laboratory of Parallel Distributed Processing Research Institute for Electronic Science Hokkaido University Sapporo Hokkaido Japan

Progress has been made in computational implementation of speech production based on physiological data. An inverse dynamics model of the speech articulator's musculo-skeletal system, which is the mapping from articulator trajectories to electromyographic (EMG) signals, was modeled using the acquired forward dynamics model and temporal (smoothness of EMG activation) and range constraints. This inverse dynamics model allows the use of a faster speech motor control scheme, which can be applied to phoneme-to-speech synthesis via musclo-skeletal system dynamics, or to future use in speech recognition. The forward acoustic model, which is the mapping from articulator trajectories to the acoustic parameters, was improved by adding velocity and voicing information inputs to distinguish acoustic parameter differences caused by changes in source characteristics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Physiologically based speech synthesis 92

Physiologically based speech synthesis

引用

Proceedings of the 6th International Conference on Neural Information processing Systems

作者： Makoto Hirayama Eric Vatikiotis-Bateson Kiyoshi Honda Yasuharu Koike Mitsuo Kawato ATR Human Information Processing Research Laboratories Soraku-gun Kyoto Japan ATR Auditory and Visual Perception Research Laboratories ATR Human Information Processing Research Laboratories Soraku-gun Kyoto Japan and Laboratory of Parallel Distributed Processing Research Institute for Electronic Science Hokkaido University Sapporo Hokkaido Japan

ISBN: (纸本)9781558602748

This study demonstrates a paradigm for modeling speech production based on neural networks. Using physiological data from speech utterances, a neural network learns the forward dynamics relating motor commands to muscles and the ensuing articulator behavior that allows articulator trajectories to be generated from motor commands constrained by phoneme input strings and global performance parameters. From these movement trajectories, a second neural network generates PARCOR parameters that are then used to synthesize the speech acoustics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：