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

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Xufei Mao ShaoJie Tang Xiaohua Xu Xiang-Yang Li Huadong Ma Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia BUPT Beijing China Department of Computer Science Illinois Institute of Technology Chicago IL USA

Target tracking is a main application of wireless sensor networks (WSNs), and has been studied widely [4], [10]. In this work, we study indoor passive tracking problem using WSNs, in which we assume no equipment is carried by the target and the tracking procedure is passive. We propose to use light to track a moving target in WSNs. To our best knowledge, this is the first work which tracks a moving object by using light sensors and general light sources. We design a novel probabilistic protocol (system) iLight to track a moving target and several efficient methods to compute the target's moving patterns (like height, etc.) at the same time. We implement and evaluate our tracking system iLight in a testbed consisting of 40 sensor nodes, 10 general light sources and one base station. Through extensive experiments, we show that iLight can track a moving target efficiently and accurately.

关键词： Sensors Light sources Wireless sensor networks Target tracking Wireless communication Monitoring Trajectory

来源：评论

学校读者我要写书评

暂无评论

Expression and evaluation of reputation based on fuzzy set theory

引用

Journal of Information and Computational science 2011年第1期8卷 129-138页

作者： Sun, Hua Yu, Huiqun Yang, Nianhua Li, Li Department of Computer Science and Engineering East China University of Science and Technology Shanghai 200237 China School of Information Science and Engineering Xinjiang University Urumqi 830046 China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai 201112 China

In the heterogeneous and open networks, reputation can help users to make a decision about whether or not to have a transaction with other entities. The feedback data used to evaluate the reputation always comes from different entities in different systems and is expressed in different forms. The variety of forms will increase difficulty of the integrated evaluation. This paper first introduces the different express forms of the reputation, and then gives a detail description about how to translate the feedback reputation information using different form into fuzzy form, and evaluates the integrated reputation based on fuzzy number of fuzzy set theory. The data shows that fuzzy form is more accordant with the definition and evaluation of the reputation, and the methods based on fuzzy set is convenient for the entities to predict the behavior of the object entities. © 2011 Binary Information Press.

关键词： Fuzzy set theory

来源：评论

学校读者我要写书评

暂无评论

Face recognition based on local uncorrelated and weighted global uncorrelated discriminant transforms

Face recognition based on local uncorrelated and weighted gl...

引用

IEEE International Conference on Image Processing

作者： Xiaoyuan Jing Sheng Li David Zhang Jingyu Yang State Key Laboratory for Software Engineering Wuhan University of China Wuhan China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China College of Automation Nanjing University of Posts and Telecommunications China Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong China College of Computer Science Nanjing University of Science and Technology of PLA China

Feature extraction is one of the most important problems in image recognition tasks. In many applications such as face recognition, it is desirable to eliminate the redundancy among the extracted discriminant features. In this paper, we propose two novel feature extraction approaches named local uncorrelated discriminant transform (LUDT) and weighted global uncorrelated discriminant transform (WGUDT) for face recognition, respectively. LUDT and WGUDT separately construct the local uncorrelated constraints and the weighted global uncorrelated constraints. Then they iteratively calculate the optimal discriminant vectors that maximize the Fisher criterion under the corresponding statistical uncorrelated constraints, respectively. The proposed LUDT and WGUDT approaches are evaluated on the public AR and FERET face databases. Experimental results demonstrate that the proposed approaches outperform several representative feature extraction methods.

关键词： Feature extraction Vectors Databases Face Face recognition Transforms

来源：评论

学校读者我要写书评

暂无评论

Verifiable reputation management scheme based on RSA threshold secret sharing in P2P networks

引用

Journal of Computational Information Systems 2011年第8期7卷 2770-2778页

作者： Sun, Hua Yu, Huiqun Yang, Nianhua Li, Li Department of Computer Science and Engineering East China University of Science and Technology Shanghai 200237 China School of Information Science and Engineering Xinjiang University Urumqi 830046 Xinjiang China Shanghai Key Laboratory of Computer Software Evaluating and Testing Shanghai 201112 China

In this paper we propose an innovative verifiable reputation management scheme based on RSA threshold secret sharing in P2P networks. This scheme employs RSA threshold secret sharing theory to realize management of the reputation information. The dealer divides reputation information into n secret shadows and distributes them to n different participants. The reputation information can be reconstructed by any t or more participants, and cannot be done by any fewer than t participants. The dealer also distributes the validation shadows corresponding to the secret shadows to the participants at the same time. Any unlawful participant arguing itself holding secret shadow or rightful participant offering false secret shadow will be recognized for its unable to break through RSA cryptography, so the scheme is secure and verifiable. © 2005 by Binary Information Press.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Improve the Effectiveness of Test Case Generation on EFSM via Automatic Path Feasibility Analysis

Improve the Effectiveness of Test Case Generation on EFSM vi...

引用

IEEE International Symposim on High Assurance Systems Engineering

作者： Rui Yang Zhenyu Chen Baowen Xu W. Eric Wong Jie Zhang School of Electronic Engineering Huaihai Institute of Technology Lianyungang China Computer Science and Technology Nanjing University Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Nanjing University Nanjing Jiangsu CN Department of Computer Science University of Texas Dallas Richardson TX USA

A typical approach utilized for automated test case generation is to create a model of the implementation under test. Extended Finite state Machine (EFSM) is among the most popular models for model-based testing. However, automated test case generation on EFSM models is still a challenge task as a result of the fact that an EFSM model may contain infeasible paths. In this article we present a novel approach that combines static analysis and dynamic analysis techniques to address the problems of path infeasibility in the process of test case generation on EFSM models. A metric is presented for the purpose of finding a path subset that has few paths, long path length and goodness feasibility to meet adequacy coverage criteria. In addition, we develop an executable model to obtain run-time information feedback and introduce the Scatter Search into test case generation. Based on the executable model, the expected outputs associated with test data are also collected for construction of test oracles automatically. The experimental results show that our approach has good effectiveness for test case generation on EFSM models, and the method that combines static analysis and dynamic analysis can speed up the process of test case generation greatly.

关键词： Data models Analytical models Context Measurement Testing Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Evaluating coverage quality through best covered pathes in wireless sensor networks 11

Evaluating coverage quality through best covered pathes in w...

引用

International Workshop on Quality of Service

作者： ShaoJie Tang XuFei Mao Xiang-Yang Li Guojun Dai Department of Computer Science Illinois Institute of Technology Chicago IL USA Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia BUPT Beijing China Institute of Computer Application Technology Hangzhou Dianzi University Hangzhou China

Coverage quality is one critical metric to evaluate the Quality of Service (QoS) provided by wireless sensor net works. In this paper, we address maximum support coverage problem (a.k.a. best case coverage) in wireless sensor networks. Most of the existing work assume that the coverage degree is 1, i.e. every point on the resultant path should fall within the sensing range of at least one sensor node. Here we study the k -coverage problem, in which every point on the resultant path is covered by at least k sensors while optimizing certain objectives. We present tackle this problem under both centralized and distributed setting. The time complexity is bounded by O(k 2 n log n) where n is the number of deployed sensor nodes. To the best of our knowledge, this is the first work that presents polynomial time algorithms that find optimal k-support paths for a general k.

关键词： Wireless sensor networks Polynomials Sensors Joining processes Euclidean distance Observability Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Extracting Academic Information from Conference Web Pages

Extracting Academic Information from Conference Web Pages

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Peng Wang Yue You Baowen Xu Jianyu Zhao School of Computer Science and Engineering South East University Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China College of Software Engineering South East University Nanjing China Department of Computer Science and Engineering Shanghai Jiaotong University China

Conference Web pages are the main platforms to share the conference information and organize conference events. To discover the academic knowledge from such Web pages for building academic ontologies or social networks, it is necessary to extract academic information from conference Web pages. This paper proposes an approach to extract academic information from conference Web pages. Firstly, Web pages are segmented into text blocks by analyzing the visual feature and DOM structure. Then Bayes Network is used to classify these text blocks into predefined categories, and the quality of initial classification results are improved after post-processing. Finally, the academic information is extracted from the classified text blocks. Our experimental results on the real world datasets show that the proposed method is highly effective and efficient for extracting academic information from conference Web pages, and it has average 90% precision and 89% recall.

关键词： Web pages Data mining Semantics Algorithm design and analysis Feature extraction Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

Estimate Aggregation with Delay Constraints in Multihop Wireless Sensor Networks

Estimate Aggregation with Delay Constraints in Multihop Wire...

引用

IEEE/ACM International Conference on Cyber-Physical Systems (ICCPS)

作者： Haitao Zhang Huadong Ma Xiang-Yang Li Beijing Key Laboratory of Intelligent Telecommunication Software and Multimedia Beijing University of Posts and Telecommunications Beijing China Department of Computer Science Illinois Institute of Technology Chicago USA

Using wireless sensor networks (WSNs) to observe physical processes for control systems has attracted much attention recently. For some real-time control applications, controllers need to accurately estimate the process state within rigid delay constraints. In this paper, we jointly consider state estimation and scheduling problems in multihop WSNs. For accurately estimating a process state as well as satisfying rigid delay constraints, we propose an in-network estimation approach which includes two coupled parts: the estimation operations performed at sensor nodes and an aggregation scheduling algorithm. Our in-network estimation operation performed at intermediate relay nodes not only optimally fuses the estimates obtained from different sensors but also predicts upper stream sensors' estimates which can not be aggregated to the sink before deadlines. Our estimate-based aggregation scheduling algorithm, which is interference-free, is able to aggregate as much estimate information as possible from a network to a sink within delay constraints. We prove the unbiasedness of in-network estimation, and theoretically analyze the optimality of our approach. Our simulation results corroborate the theoretical results.

关键词： Estimation Delay Wireless sensor networks Interference Protocols Relays Scheduling algorithm

来源：评论

学校读者我要写书评

暂无评论

Class-imbalance learning based discriminant analysis

Class-imbalance learning based discriminant analysis

引用

Asian Conference on Pattern Recognition (ACPR)

作者： Xiaoyuan Jing Chao Lan Min Li Yongfang Yao David Zhang Jingyu Yang State Key Laboratory of Software Engineering Wuhan University of China Wuhan China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China College of Automation Nanjing University of Posts and Telecommunications Nanjing China Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong China College of Computer Science Nanjing University of Science and Technology of PLA Nanjing China

Feature extraction is an important research topic in the field of pattern recognition. The class-specific idea tends to recast a traditional multi-class feature extraction and recognition task into several binary class problems, and therefore inevitably class imbalance problem, where the minority class is the specific class, and the majority class consists of all the other classes. However, discriminative information from binary class problems is usually limited, and imbalanced data may have negative effect on the recognition performance. For solving these problems, in this paper, we propose two novel approaches to learn discriminant features from imbalanced data, named class-balanced discrimination (CBD) and orthogonal CBD (OCBD). For a specific class, we select a reduced counterpart class whose data are nearest to the data of specific class, and further divide them into smaller subsets, each of which has the same size as the specific class, to achieve balance. Then, each subset is combined with the minority class, and linear discriminant analysis (LDA) is performed on them to extract discriminative vectors. To further remove redundant information, we impose orthogonal constraint on the extracted discriminant vectors among correlated classes. Experimental results on three public image databases demonstrate that the proposed approaches outperform several related image feature extraction and recognition methods.

关键词： Databases Feature extraction Vectors Correlation Handwriting recognition Training Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Automatic Generation of Canonical Views for CAD Models

Automatic Generation of Canonical Views for CAD Models

引用

IEEE International Conference on computer-Aided Design and computer Graphics

作者： Kaimo Hu Bin Wang Bin Yuan Junhai Yong Key Laboratory for Information System Security Ministry of Education Beijing China Department of Computer Science and Technology Tsinghua University Beijing China School of Software Tsinghua University Beijing China Tsinghua National Laboratory for Information Science and Technology Beijing China

Selecting the best views for 3D objects is useful for many applications. However, with the existing methods applied in CAD models, the results neither exhibit the 3D structures of the models fairly nor conform to human's browsing habits. In this paper, we present a robust method to generate the canonical views of CAD models, and the above problem is solved by considering the geometry and visual salient features simultaneously. We first demonstrate that for a CAD model, the three coordinate axes can be approximately determined by the scaled normals of its faces, such that the pose can be robustly normalized. A graph-based algorithm is also designed to accelerate the searching process. Then, a convex hull based method is applied to infer the upright orientation. Finally, four isometric views are selected as candidates, and the one whose depth image owns the most visual features is selected. Experiments on the Engineering Shape Benchmark (ESB) show that the views generated by our method are pleasant, informative and representative. We also apply our method in the calculation of model rectilinearity, and the results demonstrate its high performance.

关键词： Solid modeling Design automation Mathematical model Visualization Three dimensional displays Equations Computational modeling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：