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

2010 IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Weizhong Zhang Tamer Inanc Alberto Elfes Department of Automation University of Electronic Science and Technology Chengdu China Electrical and Computer Engineering University of Louisville KY USA Faculty of Electrical and Computer Engineering University of Louisville KY USA NASA Jet Propulsion Laboratory CA USA

The 40th anniversary of Apollo 11 project with man landing on the moon reminds the world again by what science and engineering can do if the man is determined to do. However, a huge step can only be achieved step by step which may be relatively small at the beginning. Robotic exploration can provide necessary information needed to do the further step safely, with less cost, more conveniently. Trajectory generation for a robotic vehicle is an essential part of the total mission planning. To save energy by exploiting possible resources such as wind will assist a robotic explorer extend its life span and perform tasks more reliably. In this paper, we propose to utilize Nonlinear Trajectory Generation (NTG) methodology to generate energy efficient trajectores for the JPL Aerobot by exploiting wind. The Aerobot model is decoupled into longitudinal and lateral dynamics with control inputs as elevator deflection δ e , thrust demand δ T , vectoring angle δ v for the longitudinal motion, aileron deflection δ a , rudder deflection δ r for the lateral motion. The outputs are the velocities and orientation of the Aerobot. The Aerobot state space model parameters are obtained from experimental identification on AURORA Airship since the actual JPL Aerobot is similar to the AURORA Airship. In this paper, the results show that with the state-space model, the proposed trajectory generation method can guide the Aerobot to take advantage of previously known wind profile to generate an energy-efficient trajectory.

关键词： Trajectory Robots Atmospheric modeling Elevators Three dimensional displays Planets Mathematical model

来源：评论

学校读者我要写书评

暂无评论

On user arrival patterns in the wireless network

引用

Journal of Computational Information Systems 2010年第14期6卷 4827-4834页

作者： Yang, Chunxia Wu, Hongfa Itoh, Masaru Zhou, Tao Institute of Information and System Science Nanjing University of Information Science and Technology Nanjing 210044 China Faculty of Information Science Aichi Institute of Technology Toyota 4700392 Japan School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 610054 China

Wireless local network traces have become an important source of information regarding user activity patterns in the wireless network. Based on the traces at the University of Southern California, this study investigates the temporal statistics of inter-arrival time denoting a time interval between two consecutive arrivals at an access point. The found results for individuals are as follows: the distribution function of inter-arrival time takes on various forms including exponential form, heavy-tail type where the tail can be well fitted by a power-law decaying function and wide power-law form which spans in a wide scale range from several seconds to two days or so. For a group arrival at a common access point, we also find a similar power-law distribution. All these results indicate that there don't exist potential, statistically identical arrivals and that simulating network traffic cannot be done with Poisson models. © 2010 Binary Information Press.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Observability and Controllability Verification in Multi-Agent Systems through Decentralized Laplacian Spectrum Estimation

Observability and Controllability Verification in Multi-Agen...

引用

2010 49th IEEE Conference on Decision and Control

作者： Mauro Franceschelli Simone Martini Magnus Egerstedt Antonio Bicchi Alessandro Giua Dept. of Electrical and Electronic Engineering University of Cagliari Italy Interdepartmental Research Center "E.Piaggio" Faculty of Engineering - University of Pisa Dept. of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA USA

ISBN: (纸本)9781424477456

In this paper we show how the decentralized estimation of the spectrum of a network can be used to infer its controllability and observability properties. The proposed approach is applied to networked multi-agent systems whose local interaction rule is based on Laplacian feedback. We provide a decentralized necessary and sufficient condition for observability and controllability based on the estimated eigenvalues. Furthermore we show an example of application of the proposed method and show that the estimated spectrum can also be envisioned as a tool for decentralized formation identification.

关键词： Observability controllability Decentralized Sufficient conditions Spectrum Analysis Laplacian operator Spectra

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Indirect adaptive control for a class of unknown nonlinear systems based on LS-SVM

Indirect adaptive control for a class of unknown nonlinear s...

引用

International Conference on Information and Automation (ICIA)

作者： Chunli Xie Cheng Shao Dandan Zhao Juan Wang College of Electromechanical and Information Engineering Dalian Nationalities of University Dalian Liaoning China Faculty of Electronic Information and Electrical Engineering Dalian University of Technology Dalian Liaoning China School of Computer Science and Engineering Dalian Nationalities of University Dalian Liaoning China

ISBN: (纸本)9781424457014

An indirect adaptive control approach based on LS-SVM is proposed for a class of nonlinear dynamic systems with unknown nonlinearities in this paper. The LS-SVM technique is employed to perform approximating unknown nonlinear functions. The updating rule of LS-SVM parameters is derived from Lyapunov stability theory. The proposed control law can guarantee that the output tracking error and the states of the obtained closed-loop systems are uniformly ultimately bounded. The effectiveness and robustness of the presented control scheme are demonstrated in the case of van der Pol system.

关键词： Adaptive control Nonlinear systems Support vector machines Control systems Artificial neural networks Function approximation computer errors Uncertainty Least squares approximation Nonlinear control systems

来源：评论

学校读者我要写书评

暂无评论

Embedded microcontroller-based sealing synchronization scheme for continuous automatic F/F/S packaging machines

Embedded microcontroller-based sealing synchronization schem...

引用

International Conference on computer and Automation engineering, ICCAE

作者： Yingui Liu Jiali Wu Shuyu Xu Shuxin Wang Guozhi Song Mingzhe Liu Faculty of Electrical Engineering Tianjin Electronic Information Vocational Technology College Tianjin China School of Electronic Engineering and Computer Science Queen Mary University of London London UK Research & Development Centre Tianjin Fuhang Instrument New-Tech Industry Company Limited Tianjin China

ISBN: (纸本)9781424455690

It has been proved through the study of continuous automatic Form/Fill/Seal packaging machine that the final outlook quality of the package pouch is largely depended on the precise coordination between vertical seal drawing movement and horizontal non-constant speed rotation movement, i.e. to ensure the vertical seal drawing speed is the same with the linear speed of the horizontal seal rotation at the moment of the sealing operation. Currently the mechanical non-constant speed transmission is still the mainstream device to implement this coordination. In this paper we investigate the problems existed in such systems and propose a new embedded microcontroller-based sealing control to coordinate the working between vertical and horizontal sealing systems. We discuss the physical design and mathematical model to show how it can simplify the current mechanical transmission systems and improve the stability and reliability of the packaging machine. New embedded microcontroller-based sealing synchronization control also can ensure the accurate seal and cut position and satisfy the requirement of high-speed packaging to greatly improve the quality and also productivity of the production as what has been testified in some industrial applications. It also has the ability to automatically adjust the horizontal sealing cycle according to the pouch size.

关键词： Packaging machines Seals Control systems Mathematical model Stability Automatic control Productivity Production Testing Industrial control

来源：评论

学校读者我要写书评

暂无评论

A feedforward neural network compression with near to lossless image quality and lossy compression ratio

A feedforward neural network compression with near to lossle...

引用

Student Conference on Research and Development (SCOReD)

作者： W. K. Yeo David F. W. Yap K. C. Lim D. P. Andito M. K. Suaidi T. H. Oh Universiti Teknikal Malaysia Melaka Hang Tuah Jaya Malaysia Faculty of Electronic and Computer Engineering University Teknikal Malaysia Melaka Hang Tuah Jaya Malaysia Multimedia University Malacca Malaysia Faculty of Engineering and Technology Multimedia University Jalan Ayer Keroh Lama Melaka Malaysia

In this paper, a novel image compression algorithm is proposed by introducing the feedforward neural network (FFN) instead of the quantization block of a general image compression algorithm. In this new method, after the spatial information of the target image is transformed into the equivalent frequency domain, the FFN stores each of the transformed coefficients in the network synaptic weights. By storing just the network weight values, the amount of information need to be retained for decompression purpose is much lesser compared to lossless method which stores information pertinent to each pixel in the image. As a consequence, a better compression ratio can be achieved by the FFN compression method as compare to lossless compression. Furthermore, during the decompression stage the FFN is capable of reproducing every single frequency component (coefficient values) with small margin of error due to the fact that no information is reduced unlike in lossy methods where some psychovisual redundancies are removed in the quantization. Results show that this new proposed compression algorithm (FFN compression) is capable of achieving the competitive advantage of lossy methods which is the compression ratio without compromising the image quality, the advantage of lossless methods.

关键词： Image coding Transform coding Classification algorithms Quantization Encoding Manganese Transforms

来源：评论

学校读者我要写书评

暂无评论

Video network traffic and quality comparison of VP8 and H.264 SVC

Video network traffic and quality comparison of VP8 and H.26...

引用

3rd Workshop on Mobile Video Delivery, MoViD 2010, Co-located with ACM Multimedia 2010

作者： Seeling, Patrick Fitzek, Frank H.P. Ertli, Gergö Pulipaka, Akshay Reisslein, Martin Dept. of Computing and New Media Technologies University of Wisconsin-Stevens Point Stevens Point WI 54481 United States Dept. of Electronic Systems University of Aalborg Aalborg DK-9220 Denmark Faculty of Electrical Engineering and Informatics Budapest University of Technology and Economics György square 3 1111 Budapest Goldmann Hungary School of Electrical Computer and Energy Engineering Arizona State University Tempe AZ 85287-5706 United States

ISBN: (纸本)9781450301657

Google has recently released the video compression format VP8 to the open source community. This new compression format competes against the existing H.264 video standard developed by the ITU-T Video Coding Experts Group (VCEG) in collaboration with the ISO/IEC Moving Picture Experts Group (MPEG). This paper compares these two video coding standards in terms of video bit rate-distortion (quality) performance and the video network traffic variability with different long video sequences. We find that VP8 presently does not fulfill its promise to achieve twice the quality at half the bandwidth compared to H.264. The rate-distortion (RD) performance of VP8 is rather slightly below the RD performance of H.264. On the positive side, in contrast to H.264, VP8 has no license fees.

关键词： Image compression

来源：评论

学校读者我要写书评

暂无评论

An Approximate Actual Network Performance Evaluation Method

An Approximate Actual Network Performance Evaluation Method

引用

International Conference on Intelligent Systems, Modelling and Simulation (ISMS)

作者： Jozef B. Lewoc Antoni Izworski Slawomir Skowronski Georgi Marko Dimirovski Vesna Ojleska Leader Leading Designer Research Design and Translation Agency Wroclaw Poland Electronic Faculty Wroclaw University of Technology Wroclaw Poland Informatics and Management Faculty Wroclaw University of Technology Wroclaw Poland Computer Engineering Dogus University Istanbul Turkey Cyril and Methodius University of Skopje Skopje Macedonia

ISBN: (纸本)9781424459841;9780769539737

Since early eighties, not too many happened in analytical methods of performance valuation for actual computer and communication networks. The methods of the classic queuing theory (the mean value analysis, the convolution method) adopt unrealistic assumptions. The stochastic queuing network methods are not adequate for investigation of actual networks. Therefore, the paper presents an approximate method based on many-year performance evaluation experience and some heuristics. The approach is based on the notion of the closed route within the computer network under investigation; the complete network being described as a collection of such closed routes. The method was successfully validated by simulation and measurements. Some more complex approximations, feasible due to development of the computing tools, are also proposed.

关键词： computer networks Communication networks computer network management Queueing analysis Wide area networks Packet switching Intelligent networks Telecommunication traffic Traffic control Switches

来源：评论

学校读者我要写书评

暂无评论

Monte-Carlo Tree Search for a reentrant scheduling problem

Monte-Carlo Tree Search for a reentrant scheduling problem

引用

International Conference on computers & Industrial engineering (CIE)

作者： Shimpei Matsumoto Noriaki Hirosue Kyohei Itonaga Nobuyuki Ueno Hiroaki Ishii Faculty of Applied Information Science Hiroshima Institute of Technology Hiroshima Japan Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology Iizuka Japan Division of Electrical Electronic and Information Engineering Oita National College of Technology Oita Japan Department ofmanagement and Information Systems Prefuctural University of Hiroshima Hiroshima Japan Department of Mathematical Sciences School of Science and Technology Kwansei Gakuin University Japan

关键词： Proposals

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：