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

作者： Sarker, Biplab Kumer Tripathi, Anil Kumar Vidyarthi, Deo Prakash Yang, Laurence T. Uehara, Kuniaki Grad. Sch. of Science and Technology Kobe University Kobe-shi 657-8501 Japan Department of Computer Engineering I.T. Banaras Hindu University Varanasi India Department of Computer Science Banaras Hindu University Varanasi India Department of Computer Science St. Francis Xavier University Canada

In a Distributed Computing Systems (DCS) tasks submit. ted to it. are usually partitioned into different modules and these modules may be allocated to different processing nodes so as to achieve minimum turn around time of the tasks utilizing the maximum resources of the existing system such as CPU speed, memory capacities etc. The problem lies on how to obtain the optimal allocation of these multiple tasks by keeping in mind that no processing node is overloaded due to this allocation. This paper proposes an algorithm A*RS, using well-known A*, which aims to reduce the search space and time for task allocation. It aims at minimization of turn around time of tasks in the way so that processing nodes do not become overloaded due to this allocation. Our experimental results justify the claims with necessary supports by comparing it with the earlier algorithm for multiple tasks allocation.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Multi-Modal Speech Recognition Using Optical-Flow Analysis for Lip Images

Multi-Modal Speech Recognition Using Optical-Flow Analysis f...

引用

作者： Tamura, Satoshi Iwano, Koji Furui, Sadaoki Department of Computer Science Grad. Sch. of Info. Sci./Engineering Tokyo Institute of Technology 2-12-1 Ookayama Meguro-ku Tokyo 152-8552 Japan

This paper proposes a multi-modal speech recognition method using optical-flow analysis for lip images. Optical flow is defined as the distribution of apparent velocities in the movement of brightness patterns in an image. Since the optical flow is computed without extracting the speaker's lip contours and location, robust visual features can be obtained for lip movements. Our method calculates two kinds of visual feature sets in each frame. The first feature set consists of variances of vertical and horizontal components of optical-flow vectors. These are useful for estimating silence/pause periods in noisy conditions since they represent movement of the speaker's mouth. The second feature set consists of maximum and minimum values of integral of the optical flow. These are expected to be more effective than the first set since this feature set has not only silence/pause information but also open/close status of the speaker's mouth. Each of the feature sets is combined with an acoustic feature set in the framework of HMM-based recognition. Triphone HMMs are trained using the combined parameter sets extracted from clean speech data. Noise-corrupted speech recognition experiments have been carried out using audio-visual data from 11 male speakers uttering connected digits. The following improvements of digit accuracy over the audio-only recognition sch.me have been achieved when the visual information was used only for silence HMM: 4% at SNR = 5 dB and 13% at SNR = 10 dB using the integral information of optical flow as the visual feature set.

关键词： Speech recognition

来源：评论

学校读者我要写书评

暂无评论

A needle in a haystack: Local one-class optimization

A needle in a haystack: Local one-class optimization

引用

Proceedings, Twenty-First International Conference on Machine Learning, ICML 2004

作者： Crammer, Koby Chechik, Gal Sch. of Comp. Sci. and Engineering Hebrew University of Jerusalem Jerusalem 91925 Israel Robotics Laboratory Computer Science Department Stanford University Stanford CA 94305 United States

ISBN: (纸本)1581138385

This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to find a small-radius ball that covers as many data points as possible. It rises naturally in a wide range of applications, from finding gene-modules to extracting documents' topics, where many data points are irrelevant to the task at hand, or in applications where only positive examples are available. Most previous approaches to this problem focus on identifying and discarding a possible set of outliers. In this paper we adopt an opposite approach which directly aims to find a small set of coherently structured regions, by using a loss function that focuses on local properties of the data. We formalize the learning task as an optimization problem using the Information-Bottleneck principle. An algorithm to solve this optimization problem is then derived and analyzed. Experiments on gene expression data and a text document corpus demonstrate the merits of our approach.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

A new method for independent task sch.duling in nonlinearly DAG clustering

A new method for independent task scheduling in nonlinearly ...

引用

Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

作者： Hua, Qiang-Sheng Chen, Zhi-Gang Lau, Francis C. M. Sch. of Info. Sci. and Engineering Central South University Changsha 410083 China Department of Computer Science University of Hong Kong Pokfulam Road Hong Kong Hong Kong

For the parallel tasks represented by the Directed Acyclic Graph (DAG), if it is linearly clustered, the ordering of the execution time of the tasks in each cluster is based on their arrows in the DAG. But for nonlinearly clustering, the ordering of the independent tasks in each cluster is not easily decided. Improper ordering of these independent tasks will greatly increase the sch.duling length of the DAG. We discuss the shortcomings of current sch.duling algorithms and the reason behind poor performance, and then propose some new node information to be extracted which is used by a new independent tasks sch.duling algorithm based on the Maximized Parallelism Degree (MPD). Experimental results show that the MPD algorithm can yield better performance than the previous algorithms.

关键词： Parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

Kernels and distances for structured data

Kernels and distances for structured data

引用

作者： Gärtner, Thomas Lloyd, John W. Flach, Peter A. Fraunhofer Inst. Autonome I.S. Germany Department of Computer Science University of Bristol United Kingdom Department of Computer Science III University Of Bonn Germany Res. Sch. of Info. Sci./Engineering Australian National University Machine Learning Department of Computer Science University of Bristol United Kingdom

This paper brings together two strands of machine learning of increasing importance: kernel methods and highly structured data. We propose a general method for constructing a kernel following the syntactic structure of the data, as defined by its type signature in a higher-order logic. Our main theoretical result is the positive definiteness of any kernel thus defined. We report encouraging experimental results on a range of real-world data sets. By converting our kernel to a distance pseudo-metric for 1-nearest neighbour, we were able to improve the best accuracy from the literature on the Diterpene data set by more than 10%.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Development, evaluation and benchmarking of simulation software for biomolecule-based computing

引用

Natural Computing 2004年第4期3卷 427-442页

作者： Blain, Derrel Garzon, Max Shin, Soo-Yong Zhang, Byoung-Tak Kashiwamura, Satoshi Yamamoto, Masahito Kameda, Atsushi Ohuchi, Azuma Computer Science Division The University of Memphis Memphis TN 38152-3240 United States Biointelligence Lab. Sch. of Computer Science/Engineering Seoul National University 151-742 Seoul South Korea Graduate School of Engineering Hokkaido University Kita-ku Sapporo 060-8628 North 13 West 8 Japan Japan Science/Technology Corporation Saitama Japan Grad. Sch. of Info. Sci./Technology Hokkaido University Kita-ku Sapporo 060-0814 North 14 West 9 Japan

Simulators for biomolecular computing, (both in vitro and in silico), have come to play an important role in experimentation, analysis, and evaluation of the efficiency and scalability of DNA and biomolecule based computing. Simulation in silico of DNA computing is useful to support DNA-Computing algorithm design and to reduce the cost and effort of lab experiments. Although many simulations have now been developed, there exists no standard for simulation software in this area. Reliability, performance benchmarks, user interfaces, and accessibility are arguably the most important criteria for development and wide spread use of simulation software for BMC. The requirements and evaluation of such software packages for DNA computing software are discussed, particularly questions about software development, appropriate user environments, standardization of benchmark data sets, and centrally available common repositories for software and/or data. © 2004 Kluwer Academic Publishers.

关键词： Access and common repository Benchmarking DNA-based computing Evaluation Simulation Software architecture User interfaces

来源：评论

学校读者我要写书评

暂无评论

Systems information in set pair analysis and its applications

Systems information in set pair analysis and its application...

引用

Proceedings of 2004 International Conference on Machine Learning and Cybernetics

作者： Jiang, Yun-Liang Xu, Cong-Fu Yao, Yuan Zhao, Ke-Qin College of Computer Science Zhejiang University Hangzhou 310027 China Sch. of Information and Engineering Huzhou University Huzhou 313000 China Inst. of Zhuji Connection Math. Zhuji 311811 China

ISBN: (纸本)0780384032

The problem of uncertainty knowledge has been tackled for a long time by philosophers, logicians and mathematicians. Recently it becomes a crucial issue for computer scientists, particularly in the area of artificial intelligence (AI). The Set pair analysis (SPA) theory, proposed by Keqin Zhao, is a novel uncertainty theory. The core of this theory is to consider certainties and uncertainties as a certain-uncertain system, and to depict uniformly all kinds of uncertainties such as random uncertainty, fuzzy uncertainty, indeterminate-known uncertainty, unknown and unexpected incident uncertainty, and uncertainty that results from imperfective information, using a connection degree formula that can fully embody its idea. SPA has been applied to many fields successfully such as industry, agriculture, forestry, education, physical education, military affairs, traffic, data fusion, decision-making, forecasting, comprehensive evaluation, and network planning, etc. The reason is that there exists abundant systems information such as system structure information, system theory information, etc, in SPA. In this paper, the systems information in SPA is discussed, and its applications are also given.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Management of web data models based on graph transformation

Management of web data models based on graph transformation

引用

Proceedings - IEEE/WIC/ACM International Conference on Web Intelligence, WI 2004

作者： Song, Guanglei Zhang, Kang Wong, Raymond K. Kong, Jun Department of Computer Science University of Texas at Dallas Richardson TX 75083-0688 United States Sch. of Comp. Sci. and Engineering University of New South Wales Sydney NSW 2052 Australia

ISBN: (纸本)0769521002

Based on the Reserved Graph Grammar (RGG), this paper presents a unified framework to manage model-based information on the Web in a hierarchical structure. The framework allows models, sch.mas, and data instances to be represented explicitly and uniformly. The uniform representation of the framework also enables simple user-defined graph transformation rules for different Web data models to translate sch.mas and data instances between different formats. In addition, the framework implements a set of prototype tools for users to identify meta-primitives at the meta-model level, to define a model or sch.ma by specifying a set of graph grammar rules and to draw the structure of data instances. These features promote a wide scope of Web-related applications, such as information exchange between different organizations, and integration of data coming from heterogeneous information sources. © 2004 IEEE.

关键词： World Wide Web

来源：评论

学校读者我要写书评

暂无评论

Development and performance test of a micromachined resonant accelerometer

Development and performance test of a micromachined resonant...

引用

Advances in Fracture and Failure Prevention: Proceedings of the Fifth International Conference on Fracture and Strength of Solids (FEOFS2003): Second International Conference on Physics and Chemistry of Fracture and Failure Prevention (2nd ICPCF)

作者： Sung, Sangkyung Kang, Taesam Hyun, Chul Lee, Byeungleul Lee, Jang Gyu Park, Chan Gook Lee, Young Jae Sch. of Elec. Eng./Computer Science Seoul National University Shilim 9-dong Gwanak-gu Seoul Korea Republic of Department of Aerospace Engineering Konkuk University Kwangjin-gu Seoul Korea Republic of Sch. of Mech./Aerosp. Engineering Seoul National University Shilim 9-dong Gwanak-gu Seoul Korea Republic of

In this paper, presented are design, analysis, and experimental result of a tunable surface micromachined resonant accelerometer, ACRC-RXL. Also fabrication process of mechanical structure is illustrated. We used 40[μm] thick epitaxially grown polysilicon as structural layer and sealing area. With the exception of the CMP process, for smoothing the bonding area, the fabrication processes are simple as the conventional surface micromachining process. Experimental results show that the developed accelerometer has a performance of bias stability about 0.5mg and dynamic range over 10g.

关键词： Accelerometers

来源：评论

学校读者我要写书评

暂无评论

A BGP attack against traffic engineering

A BGP attack against traffic engineering

引用

Proceedings of the 2004 Winter Simulation Conference

作者： Kim, Jintae Ko, Steven Y. Nicol, David M. Dimitropoulos, Xenofontas A. Riley, George F. Department of Computer Science Univ. Illinois at Urbana-Champaign Urbana IL 61801 United States Sch. of Elec. and Comp. Engineering Georgia Institute of Technology Atlanta GA 30332 United States

As the Internet grows, traffic engineering has become a widely-used technique to control the flow of packets. For the inter-domain routing, traffic engineering relies on configurations of the Border Gateway Protocol (BGP). While it is recognized that the misconfiguration of BGP can cause negative effects on the Internet, we consider attack methods that disable traffic engineering regardless of the correctness of configurations. We focus on the redirection of traffic as our attack objective, and present attack scenarios on some dominant sample network topologies to achieve this objective. We also evaluate and validate these attacks using two different discrete-event simulators, one that models BGP behavior on a network, and another that emulates it using direct-execution of working BGP code.

关键词： Telecommunication traffic

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：