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

2009 IEEE Global Telecommunications Conference, GLOBECOM 2009

作者： Liu, Liang Zhang, Xi Ma, Huadong Networking and Information Systems Laboratory Department of Electrical and Computer Engineering Texas A and M University College Station TX 77843 United States Beijing Key Lab. of Intelligent Telecomm. Software and Multimedia Beijing University of Posts and Telecomm. Beijing 100876 China

ISBN: (纸本)9781424441488

As a fundamental problem of wireless sensor networks, the minimal exposure path problem corresponding to the sensor network's worst-case coverage plays an important role in the applications for detecting intrusions. However, most existing works about minimal exposure path are based on omnidirectional sensors. In contrast, this paper studies the minimal exposure path problem for directional sensor networks. We first develop a directional sensing model: directional sensitivity model. Then, we formulate the minimal exposure path problem by using two sensing intensity functions: all-sensor intensity function and maximum-sensor intensity function, and generate two weighted grids to convert the minimal exposure path problem into two discrete geometric problems. Based on the above weighted grids, we also develop two approximation algorithms to find the minimal exposure path for the directional sensitive model. We conduct extensive simulations to validate and evaluate our proposed models and algorithms.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Exposure-path prevention in directional sensor networks using sector model based percolation

Exposure-path prevention in directional sensor networks usin...

引用

2009 IEEE International Conference on Communications, ICC 2009

作者： Liang, Liu Xi, Zhang Huadong, Ma Networking and Information Systems Laboratory Department of Electrical and Computer Engineering Texas A and M University College Station TX 77843 United States Beijing Key Lab. of Intelligent Telecomm. Software and Multimedia Beijing University of Posts and Telecomm. Beijing 100876 China

ISBN: (纸本)9781424434350

In wireless sensor networks, most existing works on region coverage mainly concentrate on the omnidirectional sensor based full coverage, which ensures that all points in the sensor-deployed region are covered. In contrast, this paper studies the problem of exposure-path prevention for the region coverage in directional sensor networks. Because the exposure paths are prevented as long as no moving objects or phenomena can go through a sensor-deployed region without being detected, exposure-path prevention does not require full coverage, and instead it only needs the partial coverage. Towards this end, we apply the percolation theory to solve the exposure path problem for directional sensor networks. In particular, we map the exposure path problem into a sector based percolation model, and then derive the bounds of critical density where directional sensors are deployed according to a 2-dimensional Poisson process. Also conducted is a set of extensive simulations to validate and evaluate our developed models and schemes. ©2009 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

High-Performance Cloud Computing: A View of Scientific Applications

High-Performance Cloud Computing: A View of Scientific Appli...

引用

International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)

作者： Christian Vecchiola Suraj Pandey Rajkumar Buyya Cloud computing and Distributed Systems (CLOUDS) Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia

Scientific computing often requires the availability of a massive number of computers for performing large scale experiments. Traditionally, these needs have been addressed by using high-performance computing solutions and installed facilities such as clusters and super computers, which are difficult to setup, maintain, and operate. Cloud computing provides scientists with a completely new model of utilizing the computing infrastructure. Compute resources, storage resources, as well as applications, can be dynamically provisioned (and integrated within the existing infrastructure) on a pay per use basis. These resources can be released when they are no more needed. Such services are often offered within the context of a service level agreement (SLA), which ensure the desired quality of service (QoS). Aneka, an enterprise cloud computing solution, harnesses the power of compute resources by relying on private and public clouds and delivers to users the desired QoS. Its flexible and service based infrastructure supports multiple programming paradigms that make Aneka address a variety of different scenarios: from finance applications to computational science. As examples of scientific computing in the cloud, we present a preliminary case study on using Aneka for the classification of gene expression data and the execution of fMRI brain imaging workflow.

关键词： Cloud computing Quality of service Application software Scientific computing Availability Large-scale systems Context-aware services Finance computer applications Gene expression

来源：评论

学校读者我要写书评

暂无评论

Emotion classification based on gamma-band EEG

Emotion classification based on gamma-band EEG

引用

Annual International Conference of the IEEE engineering in Medicine and Biology Society (EMBC)

作者： Mu Li Bao-Liang Lu Department of Computer Science and Engineering MOE-Microsoft Key Laboratory of Intelligent Computing and Intelligent Systems Shanghai JiaoTong University Shanghai China

In this paper, we use EEG signals to classify two emotions-happiness and sadness. These emotions are evoked by showing subjects pictures of smile and cry facial expressions. We propose a frequency band searching method to choose an optimal band into which the recorded EEG signal is filtered. We use common spatial patterns (CSP) and linear-SVM to classify these two emotions. To investigate the time resolution of classification, we explore two kinds of trials with lengths of 3s and 1s. Classification accuracies of 93.5% plusmn 6.7% and 93.0%plusmn6.2% are achieved on 10 subjects for 3s-trials and 1s-trials, respectively. Our experimental results indicate that the gamma band (roughly 30-100 Hz) is suitable for EEG-based emotion classification.

关键词： Electroencephalography Frequency Neuroscience Psychology Humans computer displays Emotion recognition USA Councils Spatial resolution Signal resolution

来源：评论

学校读者我要写书评

暂无评论

Abstraction Strategy of software Knowledge Reuse for Adaptable Knowledge and Information systems

Abstraction Strategy of Software Knowledge Reuse for Adaptab...

引用

International Conference on Information and Multimedia Technology (ICIMT)

作者： Yinglin Wang Department of Computer Science and Engineering MOE-Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiaotong University Shanghai China

Nowadays enterprise information and knowledge systems provide technical platforms for the integration and collaboration of business processes among multi-organizations of enterprises. However, software systems supporting enterprise business processes are hard to be adapted and deployed to satisfy the ever-changing requirements of enterprises. In this paper we put forward an adaptable enterprise information system framework in which we use four levels of abstractions. At the meta-meta model level, the ontology schema is used which provides the specification language for other more specific levels. At the meta-model level, the extended OSM model is used, and the generic elements obtained from analyzing the commonality of requirements are included. At the model level, the commonalities of sub-domains, such as the patterns of tasks in a specific domain are analyzed and generalized for future reuse. The intermediate specifications of the business processes and work flows are used in this level. At the application level, specific elements and requirements of the applications will be added and customized via the tools developed at the abstracted levels. A case study of knowledge management system based on this four level abstraction is discussed.

关键词： Information systems Knowledge management Management information systems Ontologies Enterprise resource planning ISO standards Online Communities/Technical Collaboration Information management Multimedia systems computer science

来源：评论

学校读者我要写书评

暂无评论

Cooperative mapping of multiple PTZ cameras in automated surveillance systems

Cooperative mapping of multiple PTZ cameras in automated sur...

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Chung-Chen Chen Yi Yao Anis Drira Andreas Koschan Mongi Abidi Imaging Robotics and Intelligent Systems Laboratory Department of Electrical Engineering & Computer Science University of Tennessee Knoxville TN USA

Due to the capacity of pan-tilt-zoom (PTZ) cameras to simultaneously cover a panoramic area and maintain high resolution imagery, researches in automated surveillance systems with multiple PTZ cameras have become increasingly important. Most existing algorithms require the prior knowledge of intrinsic parameters of the PTZ camera to infer the relative positioning and orientation among multiple PTZ cameras. To overcome this limitation, we propose a novel mapping algorithm that derives the relative positioning and orientation between two PTZ cameras based on a unified polynomial model. This reduces the dependence on the knowledge of intrinsic parameters of PTZ camera and relative positions. Experimental results demonstrate that our proposed algorithm presents substantially reduced computational complexity and improved flexibility at the cost of slightly decreased pixel accuracy, as compared with the work of Chen and Wang. This slightly decreased pixel accuracy can be compensated by consistent labeling approaches without added cost for the application of automated surveillance systems along with changing configurations and a larger number of PTZ cameras.

关键词： Surveillance Costs Robot vision systems Smart cameras Computational complexity intelligent robots Image resolution Polynomials Labeling Simultaneous localization and mapping

来源：评论

学校读者我要写书评

暂无评论

A Metadata Search Approach with Branch and Bound Algorithm to Keyword Query in Relational Databases

A Metadata Search Approach with Branch and Bound Algorithm t...

引用

International Conference on computer sciences and Convergence Information Technology (ICCIT)

作者： Jarunee Saelee Veera Boonjing Software Systems Engineering Laboratory Department of Computer Science Faculty of Science King Mongkut's Institute of Technology Ladkrabang Bangkok Thailand

Search engines on the Web have popularized the keyword-based search paradigm, while searching in databases users need to know a database schema and a query language. Keyword search techniques on the Web cannot directly be applied to databases because the data on the Internet and database are in different forms. So keyword search systems in relational databases have recently proposed. However existing systems limit type of keywords to database value terms, and generally assumed that answers are in instance level. Thus, this research aims to propose an effective approach for free-form keyword searching in databases which allows users to search either with database value terms, metadata terms or user terms. The metadata model accommodates these terms as well as underlying database semantics. Moreover, we present a branch and bound algorithm used for finding the optimal answer graphs. Our preliminary experiment results confirm precision of our approach.

关键词： Relational databases Keyword search Database languages Internet Motion pictures software systems Data engineering systems engineering and theory Laboratories computer science

来源：评论

学校读者我要写书评

暂无评论

Information Theoretic Interpretation of Error Criteria

引用

自动化学报 2009年第10期35卷 1302-1309页

作者： CHEN Ba-Dong HU Jin-Chun ZHU Yu SUN Zeng-Qi Institute of Manufacturing Engineering Department .of Precision Instruments and Mechanology Tsinghua University Beijing 100084 P.R. China State Key Laboratory of Intelligent Technology and Systems Department of Computer Science and Technology Tsinghua University Beijing 100084 P.R. China

Error criteria (or error cost functions) play significant roles in statistical estimation problems. In this paper, we study error criteria from the viewpoint of information theory. The relationships between error criteria and error's entropy criterion are investigated. It is shown that an error criterion is equivalent to the error's entropy criterion plus a Kullback-Leibler information divergence (KL-divergence). Based on this result, two important properties of the error criteria are proved. Particularly, the optimum error criterion can be interpreted via the meanings of entropy and KL-divergence. Furthermore, a novel approach is proposed for the choice of p-power error criteria, in which a KL-divergence based cost is minimized. The proposed method is verified by Monte Carlo simulation experiments.

关键词：误差标准误差成本函数估计熵 KL发散

来源：评论

学校读者我要写书评

暂无评论

Perfect Distinguishability of Quantum Operations

引用

Physical Review Letters 2009年第21期103卷 210501-210501页

作者： Runyao Duan Yuan Feng Mingsheng Ying State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing 100084 China and Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney New South Wales 2007 Australia

We provide a feasible necessary and sufficient condition for when an unknown quantum operation (quantum device) secretly selected from a set of known quantum operations can be identified perfectly within a finite number of queries, and thus complete the characterization of the perfect distinguishability of quantum operations. We further design an optimal protocol which can achieve the perfect discrimination between two quantum operations by a minimal number of queries. Interestingly, we find that an optimal perfect discrimination between two isometries is always achievable without auxiliary systems or entanglement.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Canonical Coin systems for CHANGE-MAKING Problems

Canonical Coin Systems for CHANGE-MAKING Problems

引用

2009 Ninth International Conference on Hybrid intelligent systems(第九届混合智能系统国际会议 HIS 2009)

作者： Xuan Cai Department of Computer Science and Engineering Shanghai Jiao Tong University BASICS MOE-Microsoft Laboratory for Intelligent Computing and Intelligent Systems Shanghai 200240 China

The CHANGE-MAKING problem is to represent a given value with the fewest coins under a given coin system. As a variation of the knapsack problem, it is known to be NP-hard. Nevertheless, in most real money systems, the greedy algorithm yields optimal solutions. In this paper, we study what type of coin systems that guarantee the optimality of the greedy algorithm. We provide new proofs for a suf cient and necessary condition for the so-called canonical coin systems with 4 or 5 types of coins, and a suf cient condition for non-canonical coin systems, respectively. Moreover, we propose an O(m2) algorithm that decides whether a tight coin system is canonical.

关键词： CHANGE-MAKING problems canonical coin systems combinatorial problems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：