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

15th World Congress of the International Federation of Automatic Control, 2002

作者： Yu, Xinghuo Zhihong, Man Feng, Yong Guan, Zhihong Faculty of Informatics and Communication Central Queensland University RockhamptonQLD4702 Australia School of Computer Engineering Nanyang Technological University Singapore Singapore Department of Electrical Engineering Harbin Institute of Technology Harbin150006 China Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan Hubei430074 China

ISBN: (纸本)9783902661746

In this paper, a nonsingular terminal sliding mode concept is introduced for the control of a class of nonlinear dynamical systems. This nonsingular terminal sliding mode control not only enables the Lnite time convergence of the system equilibrium, but also eliminates the singularity problem associated with conventional terminal sliding mode control. Simulations are presented to show the effectiveness of the design. Copyright © 2002 IFAC.

关键词： Sliding mode control

来源：评论

学校读者我要写书评

暂无评论

Discrepancy as a quality measure for avoiding classification bias

Discrepancy as a quality measure for avoiding classification...

引用

IEEE International Symposium on Intelligent Control (ISIC)

作者： K. Iwata N. Ishii Department of Systems Science Graduate School of Informatics Kyoto University Sakyo Kyoto Japan Department of Intelligence and Computer Science Nagoya Institute of Technology Nagoya Japan

This paper discusses how to create initial data to achieve a good performance on active learning of multilayer perceptrons. The initial training data plays an important role for active learning performance, because any active learning algorithm generates additional training data based on existing data. In this paper on active learning of a multi-layer perceptron in the case of little initial data, we verify an effect of the bias of the initial data using discrepancy. Discrepancy is a measure of the uniformity of data distribution. We then discuss a method for generation of initial data using a low-discrepancy sequence. In our experimental results of the classification problem, we found that initial data with a low discrepancy avoids classification bias. Hence, discrepancy as a measure is a quality guide to avoid classification bias, and low-discrepancy sequences provide a good strategy to generate initial data on active learning of multi-layer perceptrons.

关键词： Training data Multilayer perceptrons informatics computer science Humans Computational modeling computer simulation Random number generation H infinity control Costs

来源：评论

学校读者我要写书评

暂无评论

Prefix and Projection onto State in Duration Calculus

引用

Electronic Notes in Theoretical computer science 2002年第6期65卷 101-119页

作者： Dimitar P. Guelev Dang Van Hung School of Computer Science University of Birmingham UK Institute of Mathematics and Informatics Bulgarian Academy of Sciences Sofia Bulgaria International Institute for Software Technology The United Nations University UNU/IIST P.O. Box 3058 Macau SAR China

We study a new operator of projection onto state and the prefix operator in the extension μ HDC of DC by quantifiers over state and a polyadic least fixed point operator. We give axioms and rules to enable deduction in the extension of μ HDC by the new operators. Our axioms can be used to eliminate the new operators from formulas in a practically significant fragment of μ HDC . This entails the decidability of certain subfragments of this fragment is preserved in the presence of the new operators.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Estimation of clock offset from one-way delay measurement on asymmetric paths

Estimation of clock offset from one-way delay measurement on...

引用

Workshops on Applications and the Internet (SAINT)

作者： M. Tsuru T. Takine Y. Oie GENESIS Project Telecommunications Advancement Organization of Japan Japan Department of Applied Mathematics and Physics Graduate School of Informatics Kyoto University Japan Department of Computer Science and Electronics Kyushu Institute of Technology Japan

ISBN: (纸本)0769514502

As the Internet is shifting towards a reliable QoS-aware network, accurately synchronized clocks distributed on the Internet are becoming more significant. The network time protocol (NTP) is broadly deployed on the Internet for clock synchronization among distributed hosts, but is weak in asymmetric paths, i.e., it cannot accurately estimate the clock offset between two hosts when the forward and backward paths between them have different one-way delays. In this paper, we focus on estimating the offset and skew of a clock from one-way delay measurement between two hosts, and propose an idea for improvement of such estimations, which reduces estimation errors when the forward and backward paths have different bandwidths, a major factor in asymmetric delays.

关键词： Delay estimation Clocks Synchronization Bandwidth IP networks Protocols Internet Estimation error Application software Web server

来源：评论

学校读者我要写书评

暂无评论

Inferring traffic flow characteristics from aggregated-flow measurement

Inferring traffic flow characteristics from aggregated-flow ...

引用

Symposium on Applications and the Internet (SAINT)

ISBN: (纸本)0769514472

In the Internet, a statistical perspective of global traffic flows has been considered as an important key to network management. Nonetheless, it is expensive or sometime difficult to measure statistics of each flow separately. Therefore, it is of practical importance to infer unobservable statistical characteristics of individual flows from characteristics of the aggregated-flows that are easily measured at some links (router interfaces) in the network. We propose a new approach to such inference problems, and provide some examples of inferring unobservable arrival rates of packets on each flow from measurement of the aggregated-flows. Our method is applicable to cases not covered by the existing methods for the OD traffic matrix inference. We also show simulation results, which indicate the potential of our approach.

关键词： Fluid flow measurement Telecommunication traffic Traffic control Routing Mathematics Physics informatics computer science IP networks computer network management

来源：评论

学校读者我要写书评

暂无评论

NONSINGULAR TERMINAL SLIDING MODE CONTROL OF A CLASS OF NONLINEAR DYNAMICAL SYSTEMS

引用

IFAC Proceedings Volumes 2002年第1期35卷 161-165页

作者： Xinghuo Yu Man Zhihong Yong Feng Zhihong Guan Faculty of Informatics and Communication Central Queensland University Rockhampton QLD 4702 Australia School of Computer Engineering Nanyang Technological University Singapore Department of Electrical Engineering Harbin Institute of Technology Harbin 150006 China Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan Hubei 430074 China

In this paper, a nonsingular terminal sliding mode concept is introduced for the control of a class of nonlinear dynamical systems. This nonsingular terminal sliding mode control not only enables the £nite time convergence of the system equilibrium, but also eliminates the singularity problem associated with conventional terminal sliding mode control. Simulations are presented to show the effectiveness of the design.

关键词： Sliding modes £nite time nonlinear systems stability

来源：评论

学校读者我要写书评

暂无评论

Learning relational rule from examples that are neither positive nor negative

引用

Systems and computers in Japan 2001年第14期32卷 34-40页

作者： Ichise, Ryutaro Numao, Masayuki Knowledge Systems Research Intelligent Systems Research Division National Institute of Informatics Tokyo 101-8430 Japan Department of Computer Science Graduate School of Information Science and Engineering Tokyo Institute of Technology Tokyo 152-8552 Japan

Over the past decade, several inductive logic programming (ILP) systems have been developed. However, the normal ILP system does not have enough power to induce logic programs in some domains. Therefore, various new ILP systems, such as nonmonotonic ILP, that apply new learning tasks, have been proposed. In the present paper, a new learning task, called relational learning from nondichotomizable examples, is proposed for relational domains. The scheme of this task is similar to that of normal ILP, with the exception of the training examples. Normally, conventional ILP uses positive and negative examples in the training process. However, the examples of the proposed learning task are not strictly positive or negative: the training examples have a continuous scale. This new learning task is defined and a new method for learning this task is proposed. A new ILP system, SYNGIP (for SYNthesized system using Genetic programming and Inductive logic Programming), is developed based on this method and the performance of SYNGIP is compared experimentally to that of the conventional ILP method for the task of human feeling acquisition. © 2001 Scripta Technica, Syst. Comp. Jpn.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Inferring link characteristics from end-to-end path measurements

Inferring link characteristics from end-to-end path measurem...

引用

IEEE International Conference on Communications (ICC)

作者： M. Tsuru T. Takine Y. Oie Kitakyushu Research Center Telecommunications Advancement Organization of Japan Japan Department of Applied Mathematics and Physics Graduate School of Informatics Kyoto University Japan Department of Computer Science and Electronics Kyushu Institute of Technology Japan

In the Internet, because of huge scale and distributed administration, it is of practical importance to infer network-internal characteristics that cannot be measured directly. We propose a general method of determining characteristics of links from given characteristics of end-to-end paths. Our method can be applied to an arbitrary path-topology. Furthermore we show the general conditions that the link characteristics to be inferred must satisfy. Packet loss and queuing delay time are shown to satisfy them. Case studies which our method can treat are also provided.

关键词： Quality of service Delay effects Internet Network topology Mathematics Physics informatics computer science IP networks Current measurement

来源：评论

学校读者我要写书评

暂无评论

Aggregate-join query processing in parallel database systems 4

Aggregate-join query processing in parallel database systems

引用

4th International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region, HPC-Asia 2000

作者： Taniar, D. Jiang, Y. Liu, K.H. Leung, C.H.C. Department of Computer Science Royal Melbourne Institute of Technology GPO Box 2476V MelbourneVIC3001 Australia School of Communications and Informatics Victoria University MelbourneVIC Australia

ISBN: (纸本)0769505902

Queries containing aggregate functions often combine multiple tables through join operations. We call these queries "aggregate-join" queries. In parallel processing of such queries, it must be decided which attribute to be used as a partitioning attribute, particularly join attribute or group-by attribute. Based on the partitioning attribute, we discuss three parallel aggregate-join query processing methods, namely: Join Partition Method (JPM), Aggregate Partition Method (APM), and Hybrid Partition Method (HPM). The JPM and APM models use the join attribute, and the group-by attribute, respectively, as the partitioning attribute. The HPM model combines the other two methods using a logically hybrid architecture. © 2000 IEEE.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Locating information with uncertainty in fully interconnected networks 14th

引用

14th International Conference on Distributed Computing, DISC 2000

作者： Kirousis, Lefteris M. Kranakis, Evangelos Krizanc, Danny Stamatiou, Yannis C. University of Patras Department of Computer Engineering and Informatics RioPatras26500 Greece Carleton University School of Computer Science OttawaONK1S 5B6 Canada Wesleyan University Department of Mathematics MiddletownCT06459 United States University of Patras Department of Computer Engineering and Informatics Rio Patras Greece and Computer Technology Institute Kolokotroni 3 GR-262 21 Patras26500 Greece

ISBN: (纸本)3540411437

We consider the problem of searching for a piece of information in a fully interconnected computer network (or clique) by exploiting advice about its location from the network nodes. Each node contains a database that "knows" what kind of documents or information are stored in other nodes (e.g. a node could be a Web server that answers queries about documents stored on the Web). The databases in each node, when queried, provide a pointer that leads to the node that contains the information. However, this information is up-to-date (or correct) with some bounded probability. While, in principle, one may always locate the information by simply visiting the network nodes in some prescribed ordering, this requires a time complexity in the order of the number of nodes of the network. In this paper, we provide algorithms for locating an information node in the complete communication network, that take advantage of advice given from network nodes. The nodes may either give correct advice, by pointing directly to the information node, or give wrong advice by pointing elsewhere. We show that, on the average, if the probability p that a node provides correct advice is asymptotically larger than 1/ra, where n is the number of the computer nodes, then the average time complexity for locating the information node is, asymptotically, 1/p or 2/p depending on the available memory. The probability p may, in general. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：