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

International Conference on Multimedia and Ubiquitous Engineering (MUE)

作者： Lei Ji Zheng Qin Kai Chen Huan Li Key Laboratory for Information System Security Ministry of Education School of Software Dongguan University of Technology Guangdong China Tsinghua National Laboratory for Information Science and Technology China Department of Computer Science and Technology Tsinghua University Beijing China

Visual codebook based texture analysis and image recognition is popular for its robustness to affine transformation and illumination variation. It is based on the affine invariable descriptors of local patches extracted by region detector, and then represents the image by histogram of the codebook constructed by the feature vector quantization. The most commonly used vector quantization method is k-means. But due to the limitations of predefined number of clusters and local minimum update rule, we show that k-means would fail to code the most discriminable descriptors. Another defect of k-means is that the computational complexity is extremely high. In this paper, we proposed a nonparametric vector quantization method based on mean shift, and use locality-sensitive hashing (LSH) to reduce the cost of the nearest neighborhood query in the mean-shift iterations. The performance of proposed method is demonstrated in several image classification tasks. We also show that the Information Gain or Mutual Information based feature selection based on our codebook further improves the performance.

关键词： Detectors Accuracy Feature extraction Histograms Support vector machine classification Kernel Lighting

来源：评论

学校读者我要写书评

暂无评论

No-go theorem for one-way quantum computing on naturally occurring two-level systems

引用

Physical Review A 2011年第5期83卷 050301(R)-050301(R)页

作者： Jianxin Chen Xie Chen Runyao Duan Zhengfeng Ji Bei Zeng Department of Computer Science and Technology Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China Department of Physics Massachusetts Institute of Technology Cambridge Massachusetts USA Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney New South Wales Australia Perimeter Institute for Theoretical Physics Waterloo Ontario Canada State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Institute for Quantum Computing and Department of Combinatorics and Optimization University of Waterloo Waterloo Ontario Canada

The ground states of some many-body quantum systems can serve as resource states for the one-way quantum computing model, achieving the full power of quantum computation. Such resource states are found, for example, in spin-52 and spin-32 systems. It is, of course, desirable to have a natural resource state in a spin-12, that is, qubit system. Here, we give a negative answer to this question for frustration-free systems with two-body interactions. In fact, it is shown to be impossible for any genuinely entangled qubit state to be a nondegenerate ground state of any two-body frustration-free Hamiltonian. What is more, we also prove that every spin-12 frustration-free Hamiltonian with two-body interaction always has a ground state that is a product of single- or two-qubit states. In other words, there cannot be any interesting entanglement features in the ground state of such a qubit Hamiltonian.

关键词： Ground state

来源：评论

学校读者我要写书评

暂无评论

LIR-OSGi: Extends OSGi to support distributed and heterogeneous ubiquitous computing system

LIR-OSGi: Extends OSGi to support distributed and heterogene...

引用

International Conference on Pervasive Computing and Applications (ICPCA)

作者： Jinzhao Liu Xiaojuan Lu Dan Wang Xin Liu Yongqiang Lu Yu Chen Department of Computer Science and Technology Beijing University of Technology Beijing China General Hospital of PLA Second Artillery USA Research Institute of Information Technology Key Laboratory of Pervasive Computing Ministry of Education Tsinghua University Beijing China System Software and Software Engineering Group Laboratory of Pervasive Computing Department of Computer Science and Technology Tsinghua University Beijing China

ISBN: (纸本)9781457702099

As an emerging portable service platform, OSGi is now taking a more and more important role in Ubiquitous Computing environment. As a module management framework, OSGi provides the functions of dynamic loading and unloading software modules at runtime. But its use is limited because it is centralized and single programming language supported. In this paper we present LIR-OSGi, an extended framework of OSGi, which is designed to add the distribution and programming language independence to OSGi. Meanwhile it is easy to use for developers because of the transparence of service invocation and automation of distribution. Not like OSGi which can be applied only on the Java platform, LIR-OSGi makes programs which may be written in different programming languages be able to call each other transparently so that it can be applied in many different platforms such as DotNet Framework and so on. This brings much convenience to the program development in a distributed and heterogeneous environment.

关键词： Servers Sockets Indexes Program processors Logic gates Dynamic compiler

来源：评论

学校读者我要写书评

暂无评论

Smoothness in noise reduction of chaotic time series

Smoothness in noise reduction of chaotic time series

引用

2011 International Conference on computers, Communications, Control and Automation

作者： Chenxi Shao Jiangong Ji Jingyuan Shao Lipeng Xiao Department of Computer Science and Technology University of Science and Technology of China Department of Modern Physics and Nonlinear Science Center University of Science and Technology of China Anhui Province Key Laboratory of Software in Computing and Communication Information center Jianghuai Automobile Co.Ltd.

Noise is an omnipresent phenomenon. It obscures the real behavior of dynamical system. Lots of methods are proposed to remove the noise contaminating time series. However, almost all the methods consider the noise reduction in the phase space and often sharp points are kept. Different with these methods, this paper proposes a method directly on the time series itself, considering the gauss noise feature and the smoothness of the real data, uses curve-fitting way to eliminate the sharp points. The numeral results verify the effectiveness of our method.

关键词： smoothness,noise reduction,curve-fitting,Local-Geometric-Projection

来源：评论

学校读者我要写书评

暂无评论

iLight: Indoor device-free passive tracking using wireless sensor networks

iLight: Indoor device-free passive tracking using wireless s...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：