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

15th International Symposium on Artificial Life and Robotics, AROB '10

作者： Yamasaki, Takahiro Hayashi, Eiji Department of Mechanical Information Science and Technology Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology 680-4 Kawazu Iizuka-City Fukuoka Prefecture Japan

ISBN: (纸本)9784990288044

We are attempting to develop a system so that a user is able to let robots perform an intellectual action that has a healing and friendly feeling. Based on the development process of the actions and consciousness of animals[1], we constructed a structure model which connects consciousness and action hierarchically, built a valuation function for action selection, and developed software to control the action of a robot. This software is called Consciousness-Based Architecture (CBA). With it, our aim is to connect a user and robot as closely as possible and to allow smooth communications between them by developing an emotional system that takes notice of consciousness. In our system, the robotic arm's finger is outfitted with a small Web camera, which allows the arm to recognize external information so that the robot can select various actions that comply with certain factors in the outside environment. Furthermore, by using the actuator of the robotic arm, the system we have built provides a correspondence between the robot's internal states, such as the degree of rotation angle, and the outside temperature. In the present study, a motivation model which considers the outside environment and the internal states has been built into the CBA, and the behavior of the robotic arm has been verified. © 2010 ISAROB.

关键词： Motivation

来源：评论

学校读者我要写书评

暂无评论

Design of robotic behavior that imitates animal consciousness - Development of method for pursuing or escaping from an object

Design of robotic behavior that imitates animal consciousnes...

引用

15th International Symposium on Artificial Life and Robotics, AROB '10

作者： Kurogi, Kouichirou Hayashi, Eiji Department of Mechanical Information Science and Technology Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology 680-4 Kawazu Iizuka-City Fukuoka Prefecture Japan

ISBN: (纸本)9784990288044

In this research, in order to aim at "user affinity," a trial to give a robot "consciousness" like a person or an animal is performed. User affinity here includes the function of providing healing, being easy to be with or providing a sense of closeness to a user, or not being boring to a user. Our "the discovery mechanism model of consciousness and action" was built as a trial intending to provide "consciousness" first. For it, we developed a software architecture whereby the system controls the action of an artificial animal based on this model. This architecture is called Consciousness-based Architecture (CBA). Moreover, our newly built "motivation model" is based on the assumption that a certain motive exists in action of an animal;this gives a robot the motive of action. The dopamine generating mechanism of an animal is modeled and included in the the robot arm, thus combining the CBA and the motivation model. Book research has determined how a robot's motivation is affected by a change in the dopamine amount in emergencies. In addition, a system for pursuing a missing object was built. © 2010 ISAROB.

关键词： Animals

来源：评论

学校读者我要写书评

暂无评论

Symbolic descriptor and state space model of interconnected linear systems with algebraic loops

Symbolic descriptor and state space model of interconnected ...

引用

IEEE International Symposium on computer-Aided Control System Design

作者： Koga, Masanobu Anan, Satoru Department of Systems Design and Informatics Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology 680-4 Kawazu Iizuka Fukuoka Japan Department of Creative Informatics Kyushu Institute of Technology 680-4 Kawazu Iizuka Fukuoka Japan

ISBN: (纸本)9781424453542

This paper proposes a method which gives symbolic model of the interconnected linear system using the adjacency matrix which represent the system. When there exist any algebraic loops in the system, they are reduced to the self loops by the edge contraction. If the weight matrix of the self loop is nonsingular, it is removed and the symbolic state space model is obtained, otherwise the symbolic descriptor model is obtained. We introduce a new interactive graphical software tool which have been developed for modeling and simulation of control systems using the proposed method. © 2010 IEEE.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

A study on differences in properties of the logistic maps over integers affected by rounding

A study on differences in properties of the logistic maps ov...

引用

2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010

作者： Miyazaki, Takeru Araki, Shunsuke Uehara, Satoshi Faculty of Environmental Engineering University of Kitakyushu 1-1 Hibikino Wakamatsu Kitakyushu Fukuoka 808-0135 Japan Graduate School of Computer Science and Systems Engineering Kyushu Institute of Technology 680-4 Kawazu Iizuka Fukuoka 820-8503 Japan

ISBN: (纸本)9781424460175

On the studies of the logistic map, many reports are presented because of the simple structure of the equation. Calculations with finite precision are usually used for implementations of the map for computers. Then a rounding is needed to these calculations. There are five major methods to implement rounding, but there was not any paper on the rounding of the map. In the present paper, we get some experimental results that the properties of sequences change greatly by roundings, and give some theoretical analyses of them. Then we will give principal reasons that the map with a floor function for rounding generates long aperiodic subsequences. © 2010 IEEE.

关键词： aperiodic subsequence chaos directed graphs finite precision floating point arithmetic floor function iterative methods logistic map

来源：评论

学校读者我要写书评

暂无评论

Suitable representation of values on the logistic map with finite precision

Suitable representation of values on the logistic map with f...

引用

2010 20th International Symposium on Information Theory and Its Applications, ISITA 2010 and the 2010 20th International Symposium on Spread Spectrum Techniques and Applications, ISSSTA 2010

作者： Araki, Shunsuke Kakizaki, Ken'ichi Miyazaki, Takeru Uehara, Satoshi Graduate School of Computer Science and Systems Engineering Kyushu Institute of Technology 680-4 Kawazu Iizuka Fukuoka 820-8502 Japan Faculty of Environmental Engineering University of Kitakyushu 1-1 Hibikino Wakamatsu Kitakyushu Fukuoka 806-0135 Japan

ISBN: (纸本)9781424460175

We are investigating the logistic map over integers and its pseudorandom number generator. Focusing on differences between the logistic maps over floating-point numbers and over integers, we herein show that the integer format is a suitable representation for implementing the logistic map on computers with limited memories. © 2010 IEEE.

关键词： Number theory

来源：评论

学校读者我要写书评

暂无评论

Systematic identification of applications for a cluster of femto-satellites

Systematic identification of applications for a cluster of f...

引用

作者： Sundaramoorthy, Prem P. Verhoeven, C.J.M. Electronic Research Laboratory Faculty of Electrical Engg Mathematics and Computer Science Delft University of Technology Mekelweg 4 2628 CD Delft Netherlands Department of Space Systems Engineering Faculty of Aerospace Engineering Delft University of Technology Kluyverweg 1 2629 HS Delft Netherlands

ISBN: (纸本)9781617823688

Embracing reduced requirements and leveraging commercial technology has led to a fast growing small satellite industry. Although most interest in small satellites has hovered around the micro-satellites through to the pico-satellites, academic interest now extends up to the sub 100 g range of satellites as well. Femto-satellites with a mass range between 10 g and 100 g could in the future be mass produced and hundreds to thousands of femto-satellites can be deployed as a cluster to enhance, for example, the situational awareness of the Earth's environment. Femto-satellite is seen to form the next class of miniature satellites which will exploit spacecraft engineering, swarm science and mission design to realize exciting new space missions. Consequently, there has been considerable research interest in the sub 100 g range of satellites and the advantage of distributed satellites in space. However, most of the research work has been limited to a bottom-up approach to realize an individual femto-satellite with as much functionality as possible, without sufficient attention to the realization of an application using these distributed femto-satellites in space. This has resulted in an ambiguous top tier of space applications whose realization with a cluster of femto-satellites is arguable. The paper outlines the different realizations of distributed systems in space and identifies the most suitable candidate for femto-satellites. The aim is to map the user requirements for applications to the scaled capability of a cluster of femto-satellites, thereby aiding to systematically identify potential applications for femto-clusters. The principal challenge is that there exists no simple means to scale the capability of an individual femto-satellite to the capability of a distributed cluster of femto-satellites. Scaling certain capabilities is not straightforward. For example, when we consider a user requirement such as orbit control, the inherent virtue of a distributed system

关键词： Satellites

来源：评论

学校读者我要写书评

暂无评论

Dipole localization of EEG and its application to detection of origin of epilepsy

Dipole localization of EEG and its application to detection ...

引用

作者： Yamanoi, Takahiro Yamazaki, Toshimasa Department of Electronics and Information Engineering Faculty of Engineering Hokkai-Gakuen University Nishi 11-1-1 Minami 26 Chuo-ku Sapporo 064-0926 Japan Department of Bioscience and Bioinformatics Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology 680-4 Kawazu Iizuka 820-8502 Japan

ISBN: (纸本)9781424496730

The paper introduces a confidential region proposed by T. Yamazaki et al., which is equipped with the equivalent dipole source localization software;SinaPointPro (NEC Corporation). This confidence limit is defined on a direction ofthe radius. This method enables to detect the origin ofthe epilepsy. And also the paper treats a series of its applications by the present author. The author and his collaborators have recorded electroencephalograms (EEGs) from subjects viewing four types of Kanji and arrows representing directional meaning. Subjects were asked to read them silently. The equivalent current dipole source localization (ECDL) method has been applied to these event rerated potentials: averaged EEGs. ECDs were localized to the right and left frontal lobes at latency after 500ms in both cases. Polarities of ERPs were also opposite in the case of opposite directions, and the moments oflocalized ECDs at these latencies were opposite. Pathways of ECDs in silent reading are almost the same in cases of Kanji and arrow. In these cases, no ECD was localized to the Wernike's area and the angler gyrus those are related to the auditory language area, however, ECDs were localized to the Broca's area that is said to be the language area for speech. © 2010 TSI Press.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Convex optimization-based beamforming

Convex optimization-based beamforming

引用

作者： Gershman, Alex Sidiropoulos, Nicholas Shahbazpanahi, Shahram Bengtsson, Mats Ottersten, Björn Communication Systems Group Institute of Telecommunications Darmstadt University of Technology Merckstr Germany Department of Electronic and Computer Engineering Technical University of Crete Chania Greece Faculty of Engineering and Applied Science University of Ontario Institute of Technology 2000 Simcoe Street North Oshawa ON L1H 7K4 Canada School of Electrical Engineering Royal Institute of Technology SE-10044 Stockholm Sweden

In this article, an overview of advanced convex optimization approaches to-multisensor beamforming is presented, and connections are drawn between different types of optimization-based beamformers that apply to a broad class of receive, transmit, and network beamformer design problems. It is demonstrated that convex optimization provides an indispensable set of tools for beamforming, enabling rigorous formulation and effective solution of both long-standing and emerging design problems. © 2010 IEEE.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

Monte-Carlo tree search for a reentrant scheduling problem

Monte-Carlo tree search for a reentrant scheduling problem

引用

40th International Conference on computers and Industrial engineering, CIE40 2010

作者： Matsumoto, Shimpei Hirosue, Noriaki Itonaga, Kyohei Ueno, Nobuyuki Ishii, Hiroaki Faculty of Applied Information Science Hiroshima Institute of Technology 2-1-1 Miyake Saeki-ku Hiroshima 731-5193 Japan Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology Kawazu 680-4 Iizuka 820-8502 Japan Division of Electrical Electronic and Information Engineering Advanced Courses of Oita National College of Technology 1666 Oaza-Maki Oita 870-0152 Japan Department of Management and Information Systems Prefectural University of Hiroshima 1-1-71 Ujina-higashi Minami-ku Hiroshima 734-8558 Japan Department of Mathematical Sciences School of Science and Technology Kwansei Gakuin University 2-1 Gakuen Sanda 669-1337 Japan

ISBN: (纸本)9781424472956

This paper reports application results of Monte-Carlo Tree Search (MCTS) for a practical problem. In this paper, a reentrant scheduling problem is considered as a practical problem which has been addressed by our previous works. MCTS introduced by Coulom is a best-first search where the pseudorandom simulations guide the solution of problem. Recent improvements on MCTS have produced strong computer Go program, which has a large search space, and the success is a hot topic for selecting the best move. So far, most of reports about MCTS have been on two-player game, and MCTS has been applied rarely in one-player perfect-information games. MCTS does not need an admissible heuristic, so the application of MCTS for one-player games might be an interesting alternative. Additionally, one-player games like puzzles are determinately operated only by one player's decision, so sequences of changes in state are describable as a network diagram of interdependence of operations. Therefore if MCTS for one-player games is considered as a meta-heuristic algorithm, we can use this algorithm for not only many practical problems, but also combinatorial optimization problems. Especially as MCTS does not fully depend on evaluation function, so the solutions based on MCTS remain effective if objective function of problem is modified. This paper firstly investigated on the application of Single Player MCTS (SP-MCTS) introduced by Schadd et al. Next this paper showed the effectiveness of new simulation strategies on SP-MCTS by numerical experiments. Based on the results, this paper discussed the application potentiality of SP-MCTS for a practical reentrant scheduling problem.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Evaluating Simulation Heuristics in Monte‐Carlo Tree Search and its Application to a Production Scheduling

引用

AIP Conference Proceedings 2010年第1期1285卷 109-123页

作者： Shimpei Matsumoto Kosuke Kato Noriaki Hirosue Hiroaki Ishii aDepartment of Information Systems and Management Faculty of Applied Information Science Hiroshima Institute of Technology 2‐1‐1 Miyake Saeki‐ku Hiroshima 731‐5193 Japan bDepartment of Computer Science Faculty of Applied Information Science Hiroshima Institute of Technology 2‐1‐1 Miyake Saeki‐ku Hiroshima 731‐5193 Japan cDepartment of Artificial Intelligence Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology Kawazu 680‐4 Iizuka 820‐8502 Japan dDepartment of Mathematical Sciences School of Science and Technology Kwansei Gakuin University 2‐1 Gakuen Sanda 669‐1337 Japan

This paper reports simulation heuristics of Monte‐Carlo Tree Search (MCTS) and shows an application example. MCTS introduced by Coulom is a best‐first search where pseudorandom simulations guide the solution of problem. Recent improvements on MCTS have produced strong computer Go program, which has a large search space, and the success is a hot topic for selecting the best move. So far, most of reports about MCTS have been on two‐player games, and MCTS has been used rarely for one‐player perfect‐information games. MCTS does not need admissible heuristic, so the application of MCTS for one‐player games might be an interesting alternative. Additionally, one‐player games like puzzles are determinately operated only by one player’s decision, so the sequences of changes in state are describable as a network diagram with interdependence between operations. If MCTS for one‐player games is available as a meta‐heuristic algorithm, we can use this algorithm for not only combinatorial optimization problems, but also many practical problems. Especially, as MCTS does not fully depend on evaluation function, so the solutions based on MCTS remain effective if objective function is modified. This paper firstly investigates on the application of Single Player MCTS (SP‐MCTS) introduced by Schadd et al. to a puzzle game called Bubble Breaker. Next this paper shows the effectiveness of new simulation strategies of SP‐MCTS, and considers the differences between each parameter. Based on the results, this paper discusses the application potentiality of SP‐MCTS for a scheduling problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：