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

Lecture Notes in Computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6790 LNCS卷 117-137页

作者： Chong, Suan Khai Gaber, Mohamed Medhat Krishnaswamy, Shonali Loke, Seng Wai Centre for Distributed Systems and Software Engineering Monash University 900 Dandenong Rd Caulfield East VIC 3145 Australia School of Computing University of Portsmouth Portsmouth Hampshire PO1 3HE United Kingdom Department of Computer Science and Computer Engineering La Trobe University Victoria 3086 Australia

ISBN: (纸本)9783642230738

Extensive data generated by peers of nodes in wireless sensor networks (WSNs) needs to be analysed and processed in order to extract information that is meaningful to the user. Data processing techniques that achieve this goal on sensor nodes are required to operate while meeting resource constraints such as memory and power to prolong a sensor network's lifetime. This survey serves to provide a comprehensive examination of such techniques, enabling developers of WSN applications to select and implement data processing techniques that perform efficiently for their intended WSN application. It presents a general analysis of the issue of energy conservation in sensor networks and an up-to-date classification and evaluation of data processing techniques that have factored in energy constraints of sensors. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

RASS: A real-time, accurate and scalable system for tracking transceiver-free objects

RASS: A real-time, accurate and scalable system for tracking...

引用

IEEE International Conference on Pervasive computing and Communications (PerCom)

作者： Dian Zhang Yunhuai Liu Lionel M. Ni College of Software Shenzhen University China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China Shenzhen Institutes of Advanced Technology Chinese Academy and Sciences China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiaotong University China

Transceiver-free object tracking is to trace a moving object without carrying any communication device in an environment where the environment is pre-deployed with some monitoring nodes. Among all the tracking technologies, RF-based technology is an emerging research field facing many challenges. Although we proposed the original idea, until now there is no method achieving scalability without sacrificing latency and accuracy. In this paper, we put forward a real-time tracking system RASS, which can achieve this goal and is promising in the applications like the safeguard system. Our basic idea is to divide the tracking field into different areas, with adjacent areas using different communication channels. So the interference among different areas can be prevented. For each area, three communicating nodes are deployed on the ceiling as a regular triangle to monitor this area. In each triangle area, we use a Support Vector Regression (SVR) model to locate the object. This model simulates the relationship between the signal dynamics caused by the object and the object position. It not only considers the ideal case of signal dynamics caused by the object, but also utilizes their irregular information. As a result it can reach the tracking accuracy to around 1m by just using three nodes in a triangle area with 4m in each side. The experiments show that the tracking latency of the proposed RASS system is bounded by only about 0.26s. Our system scales well to a large deployment field without sacrificing the latency and accuracy.

关键词： Accuracy Wireless communication Wireless sensor networks Interference Lead Synchronization Predictive models

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Prioritization of quality requirements: State of practice in eleven companies

Prioritization of quality requirements: State of practice in...

引用

IEEE International Conference on Requirements engineering

作者： Richard Berntsson Svensson Tony Gorschek Björn Regnell Richard Torkar Ali Shahrokni Robert Feldt Aybuke Aurum Department of Computer Science Lund University Lund Sweden School of Computing Blekinge Institute of Technology Karlskrona Sweden Software Engineering and Technology Chalmers University of Technology Goteborg Sweden School of Information Systems Technology and Management University of New South Wales Sydney Australia

Requirements prioritization is recognized as an important but challenging activity in software product development. For a product to be successful, it is crucial to find the right balance among competing quality requirements. Although literature offers many methods for requirements prioritization, the research on prioritization of quality requirements is limited. This study identifies how quality requirements are prioritized in practice at 11 successful companies developing software intensive systems. We found that ad-hoc prioritization and priority grouping of requirements are the dominant methods for prioritizing quality requirements. The results also show that it is common to use customer input as criteria for prioritization but absence of any criteria was also common. The results suggests that quality requirements by default have a lower priority than functional requirements, and that they only get attention in the prioritizing process if decision-makers are dedicated to invest specific time and resources on QR prioritization. The results of this study may help future research on quality requirements to focus investigations on industry-relevant issues.

关键词： Companies Interviews Industries Ad hoc networks Instruments Planning Telecommunications

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Strong Security Enabled Certificateless Aggregate Signatures Applicable to Mobile Computation

Strong Security Enabled Certificateless Aggregate Signatures...

引用

International Conference on Intelligent Networking and Collaborative Systems (INCOS)

作者： Hu Xiong Qianhong Wu Zhong Chen Key Laboratory of Network and Software Security Assurance of the Ministry of Education Institute of Software School of Electronics Engineering and Computer Science Peking University Beijing China Department of Computer Engineering and Mathematics UNESCO Chair in Data Pr Universitat Rovira i Virgili Tarragona Spain Key Laboratory of AeroSpace Information Security and Trusted Computing Ministry of Education School of Computer Wuhan University of China China

An aggregate signature scheme allows a public algorithm to aggregate n signatures of n distinct messages from n signers into a single signature. By validating the single resulting signature, one can be convinced that the messages have been endorsed by all the signers. Certificateless aggregate signatures allow the signers to authenticate messages without suffering from the complex certificate management in the traditional public key cryptography or the key escrow problem in identity-based cryptography. In this paper, we present a new efficient certificate less aggregate signature scheme. Compared with up-to-date certificate less aggregate signatures, our scheme is equipped with a number of attracting features: (1) it is shown to be secure under the standard computational Diffie-Hellman assumption in the random oracle model, (2) the security is proven in the strongest security model so far, (3) the signers do not need to be synchronized, and (4) its performance is comparable to the most efficient up-to-date schemes. These features are desirable in a mobile networking and computing environment where the storage/computation capacity of the end devices are limited, and due to the wireless connection and distributed feature, the computing devices are easy to be attacked and hard to be synchronized.

关键词： Aggregates Games Generators Synchronization Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Polynomial-time hierarchy of computable reals

引用

Journal of Computational Information Systems 2011年第4期7卷 1108-1115页

作者： Chen, Qingliang Su, Kaile Wu, Lijun Department of Computer Science Jinan University Guangzhou 510632 China Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Key Laboratory of High Confidence Software Technologies Ministry of Education Peking University Beijing China Institute for Integrated and Intelligent Systems Griffith University Brisbane Australia School of Computer Science and Engineering University of Electronic Science and Technology Chengdu 610054 China

In mathematics, various representations of real numbers have been investigated and all these representations are proved to be mathematically equivalent. Furthermore, it is known that all effective versions of these representations lead to the same class of "computable real numbers". However, when subrecursive (such as primitive recursive) is taken into account, these representations can lead to different notions of "computable real numbers". This paper will look into the polynomial-time version of the problem for computable real numbers under different representations. We will summarize the known results to exhibit the comprehensive hierarchy they form. Our goal is to clarify systematically how the polynomial-time computability depends on the representations of the real numbers. Copyright © 2011 Binary Information Press.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Design of a Robot Cloud Center

Design of a Robot Cloud Center

引用

International Symposium on Autonomous Decentralized Systems (ISADAS)

作者： Zhihui Du Weiqiang Yang Yinong Chen Xin Sun Xiaoying Wang Chen Xu Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing China School of Software and Microelectronics Peking University Beijing China School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ USA International School Beijing University of Posts and Telecommunications Beijing China

Service-oriented architecture and cloud computing have become the prevalent computing paradigm. In this paradigm, computing resources can be accessed like other utility services available in today's society. In the meantime, robotics applications are joining the trend. More and more robot applications are shifting from manufacture to non-manufacture and service industries. However, for the on-demand supply of the large-scale heterogeneous robots, It is still a problem have not yet been studied, including the fundamental management and efficiency issues in using of these resources. In this paper, we design a framework of "Robot Cloud Center" (RCC) following the general cloud computing paradigm to address the current limitations in capacity and versatility of robotic applications. In this framework, a robot can be provided as a service just like a public utility service so that everyone can access the powerful robotic services easily, efficiently, and cheaply. Based on a given scenario, a robot scheduling algorithm in RCC is proposed to take advantage of the heterogeneous robot resources to meet the end user's requirement with the minimum cost.

关键词： Service robots Computer architecture Service oriented architecture Hardware Cloud computing Computational modeling

来源：评论

学校读者我要写书评

暂无评论

IT 2008: The history of a new computing discipline

引用

Communications of the ACM 2010年第12期53卷 133-141页

作者： Lunt, Barry Ekstrom, J. Reichgelt, Han Bailey, Michael Leblanc, Richard Department of IT Brigham Young University Provo UT United States Computing and Software Engineering Southern Polytechnic State University Marietta GA United States Adaptive Computing Provo UT United States Department of Computer Science and Software Engineering Seattle University Seattle WA United States

The IT model curriculum represents an excellent starting point toward understanding more about IT as an academic discipline. The early 1990s saw the emergence of the Internet from the environs of the technical cognoscenti into the dot-com world with an interface for the masses. Additionally, the personal computer had reached the point that essentially everyone in all enterprises had one, and used it heavily. The increased complexity and importance of computing technologies for the success of organizations and individuals led to a growing need for professionals to select, create, apply, integrate, and administer an organizational IT infrastructure. Organizations typically filled these positions using individuals with widely varying backgrounds whose educational experiences often provided poor preparation for the demands of the position. The skill sets needed for the new breed of network and system administrators were not provided by the more algorithmically and analytically oriented computer science programs of the time. Moreover, information systems programs, with the business education requirements of their accreditation bodies, were equally unwilling or unable to include the technical depth required. In response to this new educational need, programs arose such as those from Purdue University and Pennsylvania College of Technology, which were called Information Systems (IS) and Computer science (CS) respectively, but were something else entirely. These programs, and others like them, had sprung up independently and spontaneously to satisfy the needs of employers for workers with skills in networks, distributed systems, and beginning in the mid-1990s, the Web. By the peak of the dot-com boom in 2000, there were at least 17 institutions around the U.S. that had or were forming programs with similar characteristics, and which were most commonly called "Information Technology." The largest of them was at Rochester Institute of Technology (RIT) in Rochester, NY, with o

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Finding Data Tractable Description Logics for computing a Minimum Cost Diagnosis Based on ABox Decomposition

引用

Tsinghua science and Technology 2010年第6期15卷 623-632页

作者：杜剑峰漆桂林 Jeff Z.Pan Guangdong University of Foreign Studies State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences School of Computer Science and Engineering Southeast University Department of Computing Science the University of Aberdeen

Ontology diagnosis, a well-known approach for handling inconsistencies in a description logic （DL） based ontology, computes a diagnosis of the ontology, i.e., a minimal subset of axioms in the ontology whose removal restores consistency. However, ontology diagnosis is computationally hard, especially computing a minimum cost diagnosis （MCD） which is a diagnosis such that the sum of the removal costs attached to its axioms is minimized. This paper addresses this problem by finding data tractable DLs for computing an MCD which allow computing an MCD in time polynomial in the size of the ABox of a given ontology. ABox decomposition is used to find a sufficient and necessary condition to identify data tractable DLs for computing an MCD under the unique name assumption （UNA） among all fragments of that are at least as expressive as without inverse roles. The most expressive, data tractable DL identified is without inverse roles or qualified existential restrictions.

关键词： ontology diagnosis minimum cost diagnosis description logics data tractability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：