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

Computational Intelligence for Modeling Human Sensations in Virtual Environments

Journal of advanced Computational Intelligence and Intelligent Informatics 2004年第3期8卷 302-312页

作者： Lee, Ka Keung Xu, Yangsheng Advanced Robotics Lab Department of Automation and Computer-Aided Engineering The Chinese University of Hong Kong Hong Kong Hong Kong

In this research, computational intelligence techniques are applied towards the modeling of human sensations in virtual environments. We specifically focus on the following important questions: (1) how to efficiently model the relationship between human sensations and the physical stimuli presented to humans, (2) how to validate the human sensation models, and (3) how to reduce the size of the input data when it gets large and how to select the information which is most important to human sensation modeling. In order to provide an experimental testbed for the implementation of the proposed learning and analysis techniques, a full-body motion virtual reality interface capable of recording human sensations is developed. We propose using cascade neural networks with node-decoupled extended Kalman filter training for modeling human sensation in virtual environments. For the purpose of sensation model validation, we propose using a stochastic similarity measure based on hidden Markov models to calculate the relative similarity between model-generated sensation and actual human sensation. Next, we investigate a number of feature extraction and input selection techniques for reducing the input data size in human sensation modeling. We propose and develop a new input selection method based on independent component analysis, which is capable of reducing the data size and selecting the stimuli information that is most important to the human sensation. © Fuji Technology Press Ltd. Creative Commons CC BY-ND: This is an Open Access article distributed under the terms of the Creative Commons Attribution-NoDerivatives 4.0 International License (http://***/licenses/by-nd/4.0/).

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

The multi-objective optimization of beam pattern in the nonuniform array antenna using the evolutionary algorithm

The multi-objective optimization of beam pattern in the nonu...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Jaehyun Park Joohwan Chun Dongkyun Nam Cheol Hoon Park Scientific Computing Lab Department of Electrical Engineering and Computer Science Korea Advanced Institute of Science and Technology Daejeon South Korea Neural Networks and Machine Intelligence Lab Department of Electrical Engineering and Computer Science Korea Advanced Institute of Science and Technology Daejeon South Korea

ISBN: (纸本)0780385217

This paper is about the optimization of beamforming weights in the nonlinear array antenna system. We consider the multi-objective optimization using the evolutionary algorithm. First, we constrain two variables - the width of the main-lobe, the level of the side-lobe. Second, we constrain an additional variable, the energy of beamforming weights, on the former system. In each case, we compute the costs of beamforming weights in each generation. At the end of generations, we can get the Pareto frontier which means the optimal solution set. To demonstrate the performance of the proposed optimization, we compare the results between the proposed algorithm and the conventional window method.

关键词： Antenna arrays Evolutionary computation Array signal processing Linear antenna arrays Phased arrays Optimization methods Antennas and propagation Paper technology Telephony Electronic mail

来源：评论

学校读者我要写书评

暂无评论

The disjoint path-pair matrix approach for online routing in reliable WDM networks

The disjoint path-pair matrix approach for online routing in...

引用

IEEE International Conference on Communications (ICC)

作者： M. Tacca P. Monti A. Fumagalli Optical Networking Advanced Research (OpNeAR) Lab Erik Jonsson School of Engineering and Computer Science University of Texas Dallas Richardson TX USA

In reliable wavelength division multiplexed (WDM) networks, the optimal choice of routing and wavelength assignment (RWA) for the working and protection path-pair is often a complex problem to solve. To cope with such problem complexity, this paper presents the disjoint path-pair matrix (DPM) approach. With the DPM approach, the RWA problem complexity - i.e., the size of the solution space - can be significantly reduced by limiting the number of candidate path-pairs considered in the optimization. Simulation results are collected using the DPM approach to solve the online RWA problem in a network based on the shared path protection switching scheme with differentiated reliability. When compared to the conventional k-shortest paths approach, the DPM approach requires up to one order of magnitude less candidate path-pairs. In addition, the DPM approach finds solutions with reduced hop length of both the working and protection paths by up to 3% and 14%, respectively.

关键词： Intelligent networks WDM networks Wavelength division multiplexing computer network reliability Wavelength routing Wavelength assignment Protection switching Telecommunication traffic Optical fiber networks Reliability engineering

来源：评论

学校读者我要写书评

暂无评论

High Quality Gate Insulator for Very-Low Temperature Poly-Si TFT Employing Nitrous Oxygen Plasma Pre-Treatment

引用

MRS Online Proceedings Library 2004年第1期814卷 290-295页

作者： Moon Young Shin Sang-Myeon Han Min-Cheol Lee Hee-Sun Shin Min-Koo Han Jang-Yeon Kwon Takashi Noguchi School of Electric Engineering and Computer Science (#50) Seoul National University Seoul Korea Samsung Advanced Institute of Technology MD Lab Ki-Heung Eup Yong-In Kyoung-Ki Do Korea

We have proposed nitrous oxide (N2O) plasma pre-treatment in order to reduce the oxide charge densities as well as to increase the breakdown field of silicon dioxide film for flexible display. Our experimental results show that the proposed treatment improved both the flat-band voltage from −3V to −1.8V and the breakdown voltage of gate oxide from 7MV/cm to 9.5MV/cm, respectively. The proposed treatment also improved poly-Si TFT characteristics such as low sub-threshold swing of 0.43V/dec.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Digital beamforming algorithms for the VSB DTV receiver system

Digital beamforming algorithms for the VSB DTV receiver syst...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Jaehyun Park Joohwan Chun Jae-Hwui Bae Seung Won Kim Scientific Computing Lab Department of Electrical Engineering and Computer Science Korea Advanced Institute of Science and Technology Daejeon South Korea Electronics and Telecommnications Research Institute Daejeon South Korea

ISBN: (纸本)0780382552

The paper proposes digital beamforming algorithms for vestigial sideband (VSB) based digital TV (DTV) receivers. We consider two types of beamforming algorithms, based on selection and adaptive beamforming algorithms. In the selection beamforming scheme, we make N fixed beams and select one. To do this, we compare the correlations of the received signal through each fixed beam with the pilot symbols. In the adaptive beamforming scheme, we use the least mean square algorithm to get beamforming weights. To be applicable to the VSB system, we modify the standard beamforming algorithms used in cellular communication systems. To apply these algorithms, we have developed a simple VSB system simulator including VSB modulator, synchronizers, and an equalizer. In the VSB modulator, we use the Hilbert transform and the raised-cosine filter. In the synchronizers, we implement the Gardner detector to recover timing synchronization. We use a decision-feedback equalizer. We demonstrate the performance of the proposed system under the Brazil channel model, and show that the beamforming algorithms can improve the overall system performance matching with other parts in the simulation.

关键词： Array signal processing Digital TV TV receivers Least mean square algorithms Communication standards Filters Detectors Timing Decision feedback equalizers System performance

来源：评论

学校读者我要写书评

暂无评论

Mobile agent gain scheduler control in inter-continental intelligent space

Mobile agent gain scheduler control in inter-continental int...

引用

SICE Annual Conference

作者： R. Vanijjirattikhan P.T. Szemes M.-Y. Chow H. Hashimoto Advanced Diagnosis Automation and Control Lab Department of Electrical and Computer Engineering North Carolina State University Raleigh NC USA Institute of Industrial Science University of Tokyo Tokyo Japan

ISBN: (纸本)4907764227

Intelligent space (iSpace) is a space (room, corridor, or street), which has distributed sensory intelligence and it is equipped with mobile agents. In this paper new concept of the iSpace to connect distant places, over packet switched network is introduced. Experimental iSpace of Hashimoto lab, University of Tokyo, Japan and advanced Diagnosis Automation and Control lab, North Carolina State University, USA is connected to form an inter-continental intelligent space. Conventionally, in order to control an application over a data network, a specified control of teleoperation algorithm is usually required for controller design to compensate network delay effects. Therefore an existing controller has to be redesigned or replaced by a new controller system. This replacement process is usually costly, inconvenient, and time-consuming. In this paper, a novel methodology to enable existing controllers for networked control and teleoperation by middleware is introduced. Mobile agent located in Japan is controlled by tracking controller located in USA to show the effectiveness of the middleware methodology.

关键词： Mobile agents Intelligent agent Intelligent control Automatic control Intelligent sensors Control systems Middleware Packet switching Automation Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A selection beamforming algorithm combined with the spatial equalizer for the VSB DTV receiver system

A selection beamforming algorithm combined with the spatial ...

引用

IEEE Conference on Vehicular Technology (VTC)

ISBN: (纸本)0780385217

The paper proposes a new digital beamforming algorithm for vestigial sideband (VSB) based digital TV receivers. We consider a selection beamforming (SBF) algorithm combined with a spatial equalizer. To realize this, we make fixed beams for the SBF. We then select several beams which satisfy some criteria. We put them into the spatial equalizer. In the SBF, we mitigate the effect of multipath. This helps the synchronizer operating in the channel where the multipath signals are strong. To reduce the multipath component, which still exists in the beams due to the beam-pattern sidelobe, we choose some beams and combine them based on the least mean squares algorithm. To apply this algorithm, we have developed a simple VSB system simulator including VSB modulator. synchronizers, and an equalizer. We show that the proposed algorithms can improve the overall system performance, matching with other parts in the simulation.

关键词： Array signal processing Equalizers Digital TV Receiving antennas TV receivers Digital modulation AWGN Telephony Optical modulation Demodulation

来源：评论

学校读者我要写书评

暂无评论

Robust PCPs of proximity, shorter PCPs and applications to coding

Robust PCPs of proximity, shorter PCPs and applications to c...

引用

Proceedings of the 36th Annual ACM Symposium on Theory of Computing

作者： Ben-Sasson, Eli Goldreich, Oded Harsha, Prahladh Sudan, Madhu Vadhan, Salil Radcliffe Inst. for Advanced Study Cambridge MA 02139 United States Department of Computer Science Weizmann Institute of Science Rehovot Israel Comp. Sci. and Artif. Intell. Lab. Massachusetts Inst. of Technology Cambridge MA 02139 United States Division of Engineering Harvard University Cambridge MA 02138 United States

We continue the study of the trade-off between the length of PCPs and their query complexity, establishing the following main results (which refer to proofs of satisfiability of circuits of size n): 1. We present PCPs of length exp(Õ(log log n)2)·n that can be verified by making o(log log n) Boolean queries. 2. For every Ε > 0, we present PCPs of length exp(logΕ n)·n that can be verified by making a constant number of Boolean queries In both cases, false assertions are rejected with constant probability (which may be set to be arbitrarily close to 1). The multiplicative overhead on the length of the proof, introduced by transforming a proof into a probabilistically checkable one, is just quasi-polylogarithmic in the first case (of query complexity o(log log n)), and 2 (log n)Ε, for any Ε > 0, in the second case (of constant query complexity). In con trast, previous results required at least 2 √log n overhead in the length, even to get query complexity 2√log n. Our techniques include the introduction of a new variant of PCPs that we call "Robust PCPs of proximity". These new PCPs facilitate proof composition, which is a central ingredient in construction of PCP systems. (A related notion and its composition properties were discovered independently by Dinur and Reingold.) Our main technical contribution is a construction of a "length-efficient" Robust PCP of proximity. While the new construction uses many of the standard techniques in PCPs, it does differ from previous constructions in fundamental ways, and in particular does not use the "parallelization" step of Arora et. al. The alternative approach may be of independent interest. We also obtain analogous quantitative results for locally testable codes. In addition, we introduce a relaxed notion of locally decodable codes, and present such codes mapping k information bits to codewords of length k1+Ε, for any Ε > 0.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Optimal ramped-gate soft programming of over-erased flash EEPROM cells at given current

Optimal ramped-gate soft programming of over-erased flash EE...

引用

2004 7th International Conference on Solid-State and Integrated Circuits Technology Proceedings, ICSICT 2004

作者： Quan, Wu-Yun Baek, Chang-Ki Kim, Dae M. Gang, Ruan Huang, Yiping ASIC and System State-Key Research Lab. Department of Microelectronics Fudan University 220 Handan-road 200433 Shanghai China School of Electrical Engineering and Computer Science ISRC Seoul National University Kwanak P.O. Box 34 Seoul 151-744 Korea Republic of Korea Institute for Advanced Study 207-43 Cheongryangri Seoul Korea Republic of

Presented herein is an efficient simulation technique enabling systematic investigation of the soft programming over-erased flash EEPROM cells. The simulation provides a method by which to find the optimal soft programming technique for given current. The method requires only the cell performance data and allows investigation of the soft programming under various bias conditions. In principle, the methodology can also be used to investigate the programming and erase operations. © 2004 IEEE.

关键词： Flash memory

来源：评论

学校读者我要写书评

暂无评论

Sparse controller realisation with small roundoff noise

Sparse controller realisation with small roundoff noise

引用

作者： Li, G. Wu, J. Chen, S. Sch. of Elec./Electron. Engineering Nanyang Technological University Singapore 639798 Natl. Key Lab. Indust. Contr. T. Inst. of Advanced Process Control Zhejiang University Hangzhou 310027 China Sch. of Electron./Computer Science University of Southampton Highfield Southampton SO17 1BJ United Kingdom

The effect of roundoff noise in a digital controller is analysed for a digital feedback control system. An analytical expression for the roundoff noise gain, defined as the ratio between the variances of the output error and the rounding error, is obtained. The problem of identifying the minimum roundoff noise realisations can be solved using an existing procedure. Noting that the optimal realisations are fully parametrised, based on a polynomial operator approach a new sparse controller realisation is derived. This realisation is a generalisation of the direct forms in the classical shift operator and the prevailing delta-operator. It provides more degrees of freedom with which to reduce the roundoff noise. The problem of finding optimal polynomial operators can be solved by an exhaustive search, and a design example is given. It is shown that with the proposed sparse realisation the optimal polynomial operators can outperform the shift- and delta-operators.

关键词： Discrete time control systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：