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

IEEE International Conference on Industrial Engineering and Engineering management, IEEM2010

作者： Li, Ya-Ju Chou, Wei-Chung Chen, Chen-Yuan Shih, Bih-Yaw Chen, Lien-Tung Chung, Pei-Yin Department of Computer Science National Pingtung University of Education No. 4-18 Ming Shen Rd. Pingtung 90003 Taiwan Doctoral Program in Management National Kaohsiung First University of Science and Technology Kaohsiung Taiwan Department of Management Information System Yung-Ta Institute of Technology and Commerce Pingtung 90003 Taiwan Department of Information Management Meiho University 23 Pingguang Rd. Neipu Pingtung Taiwan

ISBN: (纸本)9781424485031

A behavioral strategy designed for a humanoid robot for the purpose of obstacle avoidance based on four ultrasonic sensors for the learning behavior and performance is proposed and implemented with an autonomous humanoid robot. A mechanical structure with 4 degrees of freedom is designed so that a small-size humanoid robot named ARSR is able to accomplish three types of walking motion. One experiment is presented to illustrate ow the the proposed bipedal structure lets the ARSR move forward, turn left and turn right. Four ultrasonic sensors are mounted on the ARSR to obtain environmental information and detect obstacles. Based on the information obtained from these sensors, a decision tree method is proposed to decide upon one behavior from three possible types of movement: walk forward, turn left and turn right. An experiment is carried out to show how the robot can autonomously avoid obstacles to effectively arrive at its destination. Based on the mechanic design and development, we will get a good agreement for the learning behavior and performance. ©2010 IEEE.

关键词： Anthropomorphic robots

来源：评论

学校读者我要写书评

暂无评论

Filtering false data via authentic consensus in vehicle ad hoc networks

引用

International Journal of Autonomous and Adaptive Communications Systems 2010年第2期3卷 217-235页

作者： Cao, Zhen Kong, Jiejun Gerla, Mario Chen, Zhong Hu, Jianbin School of Electronics Engineering and Computer Science Peking University Beijing 100871 China Key Laboratory of High Confidence Software Technologies Ministry of Education Beijing China Department of Computer Science University of California Los Angeles CA 90095 United States

Emerging applications in vehicle ad hoc networks (VANETs) not only open tremendous business opportunities and navigation benefits, they also pose formidable research challenges in security provisioning. A critical security threat to VANETs is false data injection, that is, an attacker disseminates false information to disrupt the behaviour of the other drivers. Information-driven operations of vehicular networks make false data injection a very effective attack. As the first line of defence, this paper presents the notion of proof-ofrelevance (PoR), which consists in proving that the event reporter is authentically relevant to the event it has reported. The PoR is accomplished by collecting authentic consensus on the event from witness vehicles in a cooperative way. Event reports from attackers who fail to provide this PoR are disregarded, making the network immune to bogus data. A formal security analysis is present to show that our scheme is provable secure. Performance evaluation demonstrates the effectiveness and efficiency of the proposed scheme. Copyright © 2010 Inderscience Enterprises Ltd.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Text Pattern Learning Using Minimum Description Length

Unsupervised Text Pattern Learning Using Minimum Description...

引用

2010 4th International Universal Communication Symposium(第四届国际普遍交流学术研讨会 IUCS 2010)

作者： Ke Wu Jiangsheng Yu Hanpin Wang Fei Cheng Department of Computer Science and Technology School of Electronics Engineering and Computer Science Key Laboratory of High Confidence Software Technologies Ministry of Education Peking University Beijing China Department of Mathematics Beijing Jiaotong University Beijing China

The knowledge of text patterns in a domainspecific corpus is valuable in many natural language processing (NLP) applications such as information extraction, question-answering system, and etc. In this paper, we propose a simple but effective probabilistic language model for modeling the indecomposability of text patterns. Under the minimum description length (MDL) principle, an efficient unsupervised learning algorithm is implemented and the experiment on an English critical writing corpus has shown promising coverage of patterns compared with human summary.

关键词： Dictionaries Merging Unsupervised learning Probabilistic logic Humans Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Local Methods for Estimating SimRank Score

Local Methods for Estimating SimRank Score

引用

International Asia-Pacific Web Conference (APWEB)

作者： Xu Jia Hongyan Liu Li Zou Jun He Xiaoyong Du Yuanzhe Cai Ministry of Education Key Laboratories of Data Engineering and Knowledge Engineering China Department of Computer Science Renmin University of China China Department of Management Science and Engineering Tsinghua University China Department of Computer Science University of Texas Arlington TX USA

SimRank is a well known algorithm which conducts link analysis to measure similarity between each pair of nodes (nodepair). But it suffers from high computational cost, limiting its usage in large-scale datasets. Moreover, Links between nodes are changing over time. It may be desirable to quickly approximate the similarity score between certain nodepair without performing a large-scale computation on the entire graph. In our approach we propose a method to efficiently estimate the similarity score using only a small subgraph of the entire graph. We call this novel algorithm “Local-SimRank”. The experimental results conducted on real datasets and synthetic dataset show that our algorithm efficiently produces good approximations to the global SimRank scores. Meanwhile, we prove that the Local-SimRank score LS(a, b) is always less than original SimRank score S(a, b) mathematically.

关键词： computer science Application software Web pages Data engineering Knowledge engineering Algorithm design and analysis Large-scale systems computer science education Conference management Knowledge management

来源：评论

学校读者我要写书评

暂无评论

Improving Histogram-based Reversible Data Hiding by Tictactoemidlet Predictions

Improving Histogram-based Reversible Data Hiding by Tictacto...

引用

International Conference on Genetic and Evolutionary Computing (ICGEC)

作者： Cheng-Hsing Yang Fu-Hau Hsu Min-Hao Wu Shiuh-Jeng Wang Department of Computer Science National Ping Tung University of Education Ping Tung Taiwan Department of Computer Science and Information Engineering National Central University Jhongli Taiwan Department of Information Management Central Police University Taoyuan Taiwan

Reversible data hiding has drawn considerable attention in recent years. In this paper, we used the tictactoemidlet predictions to achieve a histogram-based reversible data hiding. The histogram is created by exploiting all difference values between pixels and their predictive values. Experimental results show that our methods are capable of providing a great embedding capacity without making noticeable distortion. In the one-level hiding, our methods remain image qualities larger than 48 dB and have the best capacity. Moreover, in the multilevel case our methods perform better than other existed methods. Our methods can successfully increase the embedding capacity from histogram-based data hiding and remain the image quality well.

关键词： Pixel Histograms PSNR Nickel Prediction methods Silicon Multimedia communication

来源：评论

学校读者我要写书评

暂无评论

A novel direction-based diurnal mobility model for handoff estimation in cellular networks

A novel direction-based diurnal mobility model for handoff e...

引用

IEEE India Conference (INDICON)

作者： Samir K Sadhukhan Swarup Mandal Partha Bhaumik Debashis Saha Indian Institute of Management Calcutta India Wipro Technologies Limited Kolkata India Department of Computer Science University of California Davis USA

In real-life scenario where users mostly know their destinations a priori, their movement is not purely random (as assumed in random walk model); rather it is somewhat direction-based and depends on the present location and the final destination. For instance, an office goer often returns home in the evening (i.e., mobility is diurnal). While no existing research has studied direction-based diurnal mobility model which could be of immense importance to cellular operators, we formulate a Markov model for such movement and give a theoretical upper bound of cell boundary crossings (i.e., expected number of handoffs) by the user. We have theoretically calculated the number of handoffs based on our proposed mobility model and verified the result in a simulated environment. We find that a majority of inter-RNC/MSC handoffs [4] comes from only a few cells which should be made dual-homed by the operators for their cost reduction.

关键词： Markov processes Land mobile radio cellular systems Computational modeling Mathematical model Conferences Probability Analytical models

来源：评论

学校读者我要写书评

暂无评论

The study of constructivism oriented web-based learning on the performance of technological college students

The study of constructivism oriented web-based learning on t...

引用

International Conference on computer science and Information Technology (CSIT)

作者： David W. S. Tai Liang-Chu Lai Yang-Chih Hu Yu-Te Wang Jia-Ling Chen College of Management Hung Kuang University Taichung Taiwan Department of Industrial Education and Technology NCUE Changhua Taiwan Department of Computer Science and Information Management HKU Taichung Taiwan

The purpose of this study is to build e-learning system for constructivist programming design course. Base on the e-learning system, researchers carried out experimental teaching and investigated how constructivist programming design course influenced college students' performance. The results were shown as follows: (1) After eliminating the effects of the pretest, the achievement score of programming design of the collaborative web-based learning group (experimental group) was significantly higher than that of the traditional learning group (control group). (2) After eliminating the effects of the pretest, the attitude toward programming design of the experimental group was significantly positive than that of the control group.

关键词： Radio access networks Particle measurements Atmospheric measurements Hardware

来源：评论

学校读者我要写书评

暂无评论

Secret Embedding and Reconstruction for Authentications in Steganography upon Secret Sharing Systems

Secret Embedding and Reconstruction for Authentications in S...

引用

International Conference on Future Information Technology (FutureTech)

作者： Yu-Ting Chen Cheng-Hsing Yang Shiuh-Jeng Wang Department of Information Management Central Police University Taoyuan Taiwan Department of Computer Science National Ping Tung University of Education Ping Tung Taiwan

In this paper, we propose an enhanced authentication scheme that aims at the detection of stego-image preventing the fake share offers from the share-holder. Inspired by the past one study of Wang et al. scheme, the secret reconstruction is not complete in the course of shadow stego-images upon the secret sharing systems. Besides, the PSNR evaluations to the embedded images are furthermore superior to the past studies upon our revised algorithms. In other words, the secret embedding and reconstruction is definitely fulfilled upon the secret sharing systems. The qualities of the stego-images also do meet the requirement of steganography in better fidelity upon human vision systems.

关键词： Authentication Steganography Cryptography Image reconstruction Polynomials Humans Proposals Cyclic redundancy check Robustness Information management

来源：评论

学校读者我要写书评

暂无评论

An iterative auction mechanism for combinatorial exchanges

An iterative auction mechanism for combinatorial exchanges

引用

IEEE International Conference on Automation science and Engineering (CASE)

作者： Shantanu Biswas Y. Narahari Education & Research Research Laboratory Infosys Technologies Limited Bangalore India Electronic Commerce Laboratory Department of Computer Science and Automation Indian Institute of Science Bangalore India

Combinatorial exchanges are double sided marketplaces with multiple sellers and multiple buyers trading with the help of combinatorial bids. The allocation and other associated problems in such exchanges are known to be among the hardest to solve among all economic mechanisms. In this paper, we develop computationally efficient iterative auction mechanisms for solving combinatorial exchanges. Our mechanisms satisfy Individual-rationality (IR) and budget-nonnegativity (BN) properties. We also show that our method is bounded and convergent. Our numerical experiments show that our algorithm produces good quality solutions and is computationally efficient.

关键词： Resource management Iterative methods Equations Supply and demand Linear programming Procurement Transportation

来源：评论

学校读者我要写书评

暂无评论

A grey-fuzzy controller for optimization technique in wireless networks

引用

World Academy of science, Engineering and Technology 2010年 41卷 1126-1134页

作者： Wang, Yao-Tien Yu, Hsiang-Fu Chiou, Dung Chen Department of Information Management Kainan University Lu jhu Taoyuan County Taiwan Department of Computer Science National Taipei University of Education Taipei Taiwan Department of Information Management Kainan University Lu jhu Taoyuan County Taiwan

In wireless and mobile communications, this progress provides opportunities for introducing new standards and improving existing services. Supporting multimedia traffic with wireless networksquality of service (QoS). In this paper, a grey-fuzzy controller for radio resource management (GF-RRM) is presented to maximize the number of the served calls and QoS provision in wireless networks. In a wireless network, the call arrival rate, the call duration and the communication overhead between the base stations and the control center are vague and uncertain. In this paper, we develop a method to predict the cell load and to solve the RRM problem based on the GF-RRM, and support the present facility has been built on the application-level of the wireless networks. The GF-RRM exhibits the better adaptability, fault-tolerant capability and performance than other algorithms. Through simulations, we evaluate the blocking rate, update overhead, and channel acquisition delay time of the proposed method. The results demonstrate our algorithm has the lower blocking rate, less updated overhead, and shorter channel acquisition delay.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：