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

IEEE 7th International Conference on Computational Cybernetics, ICCC 2009

作者： Kambayashi, Yasushi Yamachi, Hidemi Tsujimura, Yasuhiro Yamamoto, Hisashi Department of Computer and Information Engineering Nippon Institute of Technology 4-1 Gakuedai Miyashiro-cho Minamisaitama-gun Saitama 345-8501 Japan Faculty of System Design Tokyo Metropolitan University 6-6 Asahigaoka Hino City Tokyo 191-0065 Japan

ISBN: (纸本)9781424453115

Route selection is one of the most important problems for a car navigation system. Given a pair of origin and destination, there are many possible routes. Most current car navigation systems propose the shortest path from the origin to the destination. Selecting the shortest path is not a hard problem, but the shortest path is not always what the user wants;what the user really wants to have is the most comfortable route for him or her to drive. In other words, the driver wants to have a car navigation system to propose the subjectively optimal route for him or her. Finding such a route requires enumerating all the possible routes, and is known as a NP-complete problem. In order to reduce computational complexity, we employed a GA to find a (subjectively) quasi-optimal route for the driver. In the previous paper, we reported our attempt to integrate uncomfortable-turns to our GA-based route selection algorithm. Even though GA provided a quasi-optimal route in most cases and certainly much faster than exhaustive search, we have found that the classical Dijkstra algorithm can be used to find subjectively the most comfortable route by changing the data structure. In this paper, we show how the data structure that represents routes can be modified to assist Dijkstra's algorithm to find subjectively optimal driving route. The numerical experiments demonstrate the feasibility of our route selection based on Dijkstra algorithm with extended data structure. ©2009IEEE.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Analytical analysis of limited power penalty on optical cross add and drop multiplexer (OXADM) - With OXC comparison

引用

Journal of Optical Communications 2009年第3期30卷 179-185页

作者： Ab-Rahman, Mohammad Syuhaimi Md. Nor, Mohd Khairul Anwar Dollah, Mohd Norhisham Department of Electrical Electronic and System Engineering Spectrum Technology Research Division Computer and Network Security Research Group 43600 UKM Bangi Selangor Malaysia

This paper highlights the limited power penalty condition of OXADM that effect the number of maximum nodes that can be cascaded in optical network. If the limited power penalty condition is violated, the power penalty will become infinity. The condition for limited power penalty for OXADM occur when incoherent crosstalk multiply with the number of maximum nodes;(MN-1)L. Therefore the value must be less than 174, otherwise it will become infinity. It was found that as the number of ports and number of carriers increase, the number of maximum nodes decrease. When compared with conventional OXC device, it was found that the number of maximum nodes for OXC is larger than OXADM. This is due to large power penalty in OXADM. In addition, the accumulation function in OXADM reduces the scalability of this device. The objective of this paper is to study the limited power penalty condition of OXADM in order to avoid infinity. In addition, according to the limited power penalty condition, the relationship between number of maximum nodes against number of ports and number of carriers are also studied. Hence, the results are compared with conventional OXC device.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Study about Recommendation Based on Underlying Desires

A Study about Recommendation Based on Underlying Desires

引用

International Conference on Biometrics and Kansei Engineering, ICBAKE

作者： Masahiro Sawai Yoshifumi Okada Tomomasa Nagashima Hiroshi Kubo Satellite Venture Business Laboratory Muroran Institute of Technology Muroran Japan Department of Computer Science and System Engineering Muroran Institute of Technology Muroran Japan

Today, consumers have been able to buy various items with development of e-commerce sites and so on, while it made difficult to find items suitable for the consumer's preference from many items. Because of such situation, recommendation systems that can present items suitable for user's preference have been required. When a person prefers an item, but hesitates what to do, it is an important criterion whether the person's desires is satisfied by the item or ***, we analyzed relationship between consumer's desires and preferred items by evaluation grid method, recommending items based on constructed evaluation grids. Moreover we investigated effectiveness of recommendation based on desires in our experiment and discussed about cross-category recommendation such as recommendation of item that have different attributes or categories.

关键词： Filtering History computer science systems engineering and theory Collaboration Spatial databases Biometrics Satellites Laboratories Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Query for Semantic Web Services Using SPARQL-DL

Query for Semantic Web Services Using SPARQL-DL

引用

International Symposium on Knowledge Acquisition and Modeling, KAM

作者： Hai Wang Sheping Zhai Lin Fan Institute of Computer System Structure and Networks Xi''an Jiaotong University Xi'an China Computer Science and Technology Department Xi''an Institute of Posts and Telecommunications Xi'an China

Current methods of service discovery, using the same mechanism to describe both request and advertisement and does not take into account the asymmetry between the two. Service advertisement discovery is a complete description of descriptive, information-rich features, and service request description is concerned only with some of the characteristics of services, usually does not constitute a complete description of the service. In this paper, we propose to use semantic Web query language SPARQL-DL as the service request description language to retrieve OWL-S form published services. Treat the service discovery issue as query against the knowledge base. Through the experiment, confirmed that the method is practical, simple, reliable and easy-to-use.

关键词： Semantic Web Logic Database languages Web services Plugs Knowledge acquisition computer networks Telecommunication computing computer science Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Feature extraction of electroencephalogram of photic evoked spikes with slow burst and its automatic detection

Feature extraction of electroencephalogram of photic evoked ...

引用

ICROS-SICE International Joint Conference 2009, ICCAS-SICE 2009

作者： Nishida, Shigeto Sugi, Takenao Ikeda, Akio Nagamine, Takashi Shibasaki, Hiroshi Nakamura, Masatoshi Department of Computer and Communication Engineering Fukuoka Institute of Technology Fukuoka Japan Department of Electrical and Electronic Engineering Saga University Saga Japan Department of Neurology Kyoto University School of Medicine Kyoto Japan Department of System Neuroscience Sapporo Medical University Sapporo Japan Takeda General Hospital Kyoto Japan Department of Advanced Systems Control Engineering Saga University Saga Japan

ISBN: (纸本)9784907764333

A method for detecting spikes and slow burst in photic evoked electroencephalogram (EEG) was proposed. The spikes were detected by combining methods of the morphological filter and the similarity coefficient in the time domain. The slow burst was detected by using pole of AR model in the frequency domain. The proposed method was applied for the photic evoked EEG data containing spikes and slow burst, and brought satisfactory coincidence with the results interpreted by a qualified electroencephalographer. © 2009 SICE.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

A Security Model for VoIP Steganography

A Security Model for VoIP Steganography

引用

The First International Conference on Multimedia Information Networking and Security(第一届国际多媒体网络信息安全会议 MINES 2009)

作者： Zhiwei Yu Clark Thomborson Junning Fu Jianmin Wang Chaokun Wang Department of Computer Science and Technology Tsinghua University Department of Computer Science The University of Auckland New Zealand School of Software Tsinghua University Key Laboratory for Information System Security Ministry of

In 2005, an extensive taxonomy of threats for VoIP was published by a prominent industry group. Strangely, this taxonomy does not identify stegocommunication as a threat, even though many steganographic channels have been identified in VoIP protocols. To avoid such security gaps in the future, we argue that stegocommunication should be added to the traditional list of network threats: interruption, interception, modification, fabrication. The stegocommunication threat arises when the communication channel is purchased, provided, or supervised by anyone other than the communicating parties. We illustrate a stegocommunication threat to a business owner Charles. If Charles purchases a VoIP service for business-related communications by an employee Alice, then he faces the risk that Alice may undetectably communicate a business secret to an outside party Bob. In this insider-threat scenario, Charles can mitigate his security risk by installing a stegodetector.

关键词： VoIP Steganography Security Model

来源：评论

学校读者我要写书评

暂无评论

Event-Driven Scheduling for P2P VoD

Event-Driven Scheduling for P2P VoD

引用

ChinaGrid Annual Conference (ChinaGrid)

作者： Bin Cheng Hai Jin Xiaofei Liao Bo Li Services Computing Technology and System Laboratory Cluster and Grid Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology China Department of Computer Science Hong Kong University of Science and Technology Hong Kong China

Scheduling is essential in peer-to-peer (P2P) video-on-demand (VoD) applications to obtain desirable user experience and high sharing efficiency. Existing systems and proposals largely utilize scheduling mechanisms that are periodical in nature. We refer these as time-driven scheduling. In this paper we argue that the time-driven scheduling algorithm is not efficient for P2P VoD due to its inadequate resource utilization and inability in quickly adapting to the potential dynamics in such systems. We propose an event-driven scheduling algorithm for P2P VoD systems, in which the scheduler is triggered by events such as peer churn or/and random seeks. We evaluate our design through extensive simulations, and the experimental results show that event-driven scheduling outperforms time-driven scheduling in terms of both user experience and system scalability.

关键词： Scheduling algorithm Dynamic scheduling Processor scheduling Peer to peer computing Large-scale systems Bandwidth computer science Resource management Discrete event simulation Scalability

来源：评论

学校读者我要写书评

暂无评论

An Improved Genetic Algorithm for Solving Conic Fitting Problems

An Improved Genetic Algorithm for Solving Conic Fitting Prob...

引用

computer Science and Information Engineering, CSIE, WRI World Congress on FLAGGED

作者： Song Gao Chunping Li Computer Science and Technology Department Key Laboratory of Information System Security Tsinghua University China School of Software Key Laboratory of Information System Security Tsinghua University China

This paper presents an improved genetic algorithm for solving conic fitting problem. We first use several parallel small-populations genetic algorithms to obtain initial population, which has better average fitness. The range of mutation operator is also set to be gradually reduced with the growing of generation to guarantee the proportion of outstanding individuals within the population. An experiment shows that our improvements on genetic algorithm can remarkably increase the average fitness of population during evolution and enhance the performance of the algorithm as a whole.

关键词： Genetic algorithms Genetic mutations Skeleton computer science Laboratories Information systems Information security Power system modeling Equations Testing

来源：评论

学校读者我要写书评

暂无评论

A 54GOPS 51.8mW analog-digital mixed mode Neural Perception Engine for fast object detection

A 54GOPS 51.8mW analog-digital mixed mode Neural Perception ...

引用

Custom Integrated Circuits Conference (CICC)

作者： Minsu Kim Joo-Young Kim Seungjin Lee Jinwook Oh Hoi-Jun Yoo Semiconductor System Laboratory Department of Electronic Engineering and Computer Science Korea Advanced Institute of Science and Technology Daejeon South Korea

A mixed mode Neural Perception Engine (NPE) is proposed as the pre-processing accelerator of multi-object recognition processor to reduce the computational complexity and increase its efficiency. It consists of Motion Estimator (ME), Visual Attention Engine (VAE) and Object Detection Engine (ODE). The fabricated chip achieves 54 GOPS 51.8 mW NPE. By implementing a fast and robust neuro-fuzzy algorithm in analog-digital mixed circuits, the area and power of the ODE is reduced by 59% and 44%, respectively, compared to those of all digital implementation. The NPE can increase the frame rate by 2.09x and reduce power consumption by 38% of the multi-object recognition processor.

关键词： Analog-digital conversion Engines Object detection Energy consumption Signal processing Motion estimation Analog circuits Object recognition Heuristic algorithms Laboratories

来源：评论

学校读者我要写书评

暂无评论

Complex Network Model for Software system and Complexity Measurement

Complex Network Model for Software System and Complexity Mea...

引用

computer Science and Information Engineering, CSIE, WRI World Congress on FLAGGED

This paper proposes a new method for measuring the complexity of software systems based on complex network theory. We first construct the complex network model for software system. Then, the complexity of a homogeneous system is defined according to the entropy theory. With the experiments on open source software systems, we show that our method can reveal the complexity on different aspects of software systems,such as inheritance and understanding complexity.

关键词： Complex networks Software systems Software measurement Packaging Object oriented modeling computer science Laboratories Information systems Information security Open source software

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：