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

作者： Barnes, Nick Baumgartner, Peter Caetano, Tiberio Durrant-Whyte, Hugh Klein, Gerwin Sanderson, Penelope Sattar, Abdul Stuckey, Peter Thiebaux, Sylvie Van Hentenryck, Pascal Walsh, Toby NICTA Australia Software Systems Research Group NICTA Australia Machine Learning Research Group NICTA Australia Trustworthy Systems Project NICTA Australia University of Queensland Australia Institute for Integrated and Intelligent Systems Griffith University Australia Department of Computing and Information Systems University of Melbourne Australia School of Computer Science Australian National University Australia Melbourne School of Engineering Australia

National Information and Communications Technology Australia (NICTA) is the largest ICT research center in Australia, having been established 10 years ago in 2002. It has five laboratories in four Australian capital cities: Sydney, Canberra, Melbourne, and Brisbane. There are currently around 700 staff and Ph.D. students working at NICTA. In June 2009, the 100th Ph.D. student to study at NICTA graduated. At present and averaged over the year, one new Ph.D. student studying at NICTA graduates every 10 days. NICTA has close links with its university members (Australian National University, the University of New South Wales, and the University of Melbourne) as well as with its partner universities (University of Sydney, Griffith University, Queensland University of Technology, University of Queensland, and most recently Monash University). Many of the researchers at NICTA are seconded from these universities. In addition, most of the other researchers at NICTA hold adjunct positions at one of these universities, enabling them to teach courses and supervise Ph.D. students. NICTA also has close links with a number of other research organizations (including Australia's CSIRO, France's INRIA, Japan's NII, and Germany's Fraunhofer Institute) and major companies (including Microsoft, Google, SAP, and Ericsson). Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Bias analyses of spontaneous facial expression database

Bias analyses of spontaneous facial expression database

引用

International Conference on Pattern Recognition

作者： Zhaoyu Wang Shangfei Wang Yachen Zhu Qiang Ji Key Laboratory of Computing and Communicating Software of Anhui Province School of Computer Science and Technology University of Science and Technology of China Hefei Anhui China Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute Troy NY USA

ISBN: (纸本)9781467322164

In this paper, cross-corpora evaluations are used to analyze the bias of spontaneous facial expression databases. Local binary pattern, Gabor, eigenface and fisherface features are extracted and applied to the four spontaneous expression databases: USTC-NVIE, VAM, Belfast Naturalistic and SEMAINE to recognize arousal (high/low) and valance (positive/negative) respectively. Experimental results indicate that there exists bias among different spontaneous expression databases. The emotion-induction methods, the variety of subjects and the quantity of raters may have caused such a bias.

关键词： Databases Feature extraction Face recognition Videos Principal component analysis Training

来源：评论

学校读者我要写书评

暂无评论

Detecting Approximate Periodic Patterns 1st

Detecting Approximate Periodic Patterns

引用

1st Mediterranean Conference on Algorithms, MedAlg 2012

作者： Amir, Amihood Apostolico, Alberto Eisenberg, Estrella Landau, Gad M. Levy, Avivit Lewenstein, Noa Department of Computer Science Bar-Ilan University Ramat-Gan52900 Israel Department of Computer Science Johns Hopkins University BaltimoreMD21218 United States College of Computing Georgia Institute of Technology 801 Atlantic Drive AtlantaGA30318 United States Dipartimento di Ingegneria dell’ Informazione Università diPadova Via Gradenigo 6/A Padova35131 Italy Department of Computer Science University of Haifa Mount Carmel Haifa31905 Israel Department of Computer Science and Engineering Polytechnic Institute of New York University 6 Metrotech Center BrooklynNY11201 United States Department of Software Engineering Shenkar College 12 Anna Frank Ramat-Gan Israel CRI Haifa University Mount Carmel Haifa31905 Israel Netanya College Netanya Israel

ISBN: (纸本)9783642348617

Given ɛ ∈ [0, 1), the ɛ-Relative Error Periodic Pattern Problem (REPP) is the following: INPUT: An n-long sequence S of numbers si ∈ N in increasing order. OUTPUT: The longest ɛ-relative error periodic pattern, i.e., the longest subsequence si1,si2,…,sik of S, for which there exists a number p such that the absolute difference between any two consecutive numbers in the subsequence is at least p and at most p(1 + ɛ). The best known algorithm for this problem has O(n3 ) time complexity. This bound is too high for large inputs in practice. In this paper we give a new algorithm for finding the longest ɛ-relative error periodic pattern (the REPP problem). Our method is based on a transformation of the input sequence into a different representation: the ɛ-active maximal intervals list L, defined in this paper. We show that the transformation of S to the list L can be done efficiently (quadratic in n and linear in the size of L) and prove that our algorithm is linear in the size of L. This enables us to prove that our algorithm works in sub-cubic time on inputs for which the best known algorithm works in O(n3 ) time. Moreover, though it may happen that our algorithm would still be cubic, it is never worse than the known O(n3 )-algorithm and in many situations its complexity is O(n2 )time. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Asymptotic throughput for large-scale wireless networks with general node density

引用

Wireless Networks 2012年第5期19卷 559-575页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Yunhao Liu Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China The Tsinghua National Laboratory for Information Science and Technology (TNLIST) Department of Computer Science and Engineering Tongji University Shanghai China The Department of Computer Science Illinois Institute of Technology Chicago USA The TNLIST and School of Software Tsinghua University Beijing China CSE The Hong Kong University of Science and Technology Kowloon Hong Kong

We study the asymptotic throughput for a large-scale wireless ad hoc network consisting of n nodes under the generalized physical model. We directly compute the throughput of multicast sessions to unify the unicast and broadcast throughputs. We design two multicast schemes based on the so-called ordinary arterial road system and parallel arterial road system, respectively. Correspondingly, we derive the achievable multicast throughput by taking account of all possible cases of n s = ω(1) and 1 ≤ n d ≤ n − 1, rather than only the cases of $$n_s=\Uptheta(n)$$ as in most related works, where n s and n d denote the number of sessions and the number of destinations of each session, respectively. Furthermore, we consider the network with a general node density $$\lambda \in [1,n]$$ , while the models in most related works are either random dense network (RDN) or random extended network (REN) where the density is λ = n and λ = 1, respectively, which further enhances the generality of this work. Particularly, for the special case of our results by letting λ = 1 and $$n_s=\Uptheta(n)$$ , we show that for some regimes of n d , the multicast throughputs achieved by our schemes are better than those derived by the well-known percolation-based schemes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Function Substitution: Towards Constraint Solving in software Testing

Function Substitution: Towards Constraint Solving in Softwar...

引用

International Conference on Quality software

作者： Xin Feng Simon Marr Tony O'Callaghan Zhi Quan Zhou Jacques Carette Division of Science and Technology BNU-HKBU United International College Zhuhai China Marine Robotics Research Centre University of Limerick Limerick Ireland Interaction Design Centre University of Limerick Limerick Ireland School of Computer Science and Software Engineering University of Wollongong Wollongong Australia Department of Computing and Software McMaster University Hamilton Canada

Constraint solving is a fundamental tenet of most test case generation strategies. However, conventional constraint solving methods were not designed in consideration of that aspect of test case generation. It has led to a situation where test case generation techniques can miss test cases when constraints contain function invocations. This is due to the fact that, when solving constraints to generate test cases, function invocations are not effectively handled and, as a result, solutions to some constraints are not found even though they do exist. This problem occurs in both specification-based and code-based testing. To address the problem, this paper presents a function substitution method that transforms test case constraints that contain certain types of functions into equivalent constraints that do not contain those functions. The transformation preserves the solution space and avoids missed test cases. As a result, the completeness of test case generation can be improved.

关键词： Educational institutions Input variables Marketing and sales software Frequency modulation software testing

来源：评论

学校读者我要写书评

暂无评论

Locating malicious nodes for data aggregation in wireless networks

Locating malicious nodes for data aggregation in wireless ne...

引用

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

作者： Xiaohua Xu Qian Wang Jiannong Cao Peng-Jun Wan Kui Ren Yuanfang Chen Department of Computer Science Illinois Institute of Technology Chicago IL USA Department of Electrical and Computer Engineering Illinois Institute of Technology Chicago IL USA Department of Computing Hong Kong Polytechnic University Hong Kong China School of Software Dalian University of Technology China

ISBN: (纸本)9781467307734;9781467307758

Data aggregation, as a primitive communication task in wireless networks, can reduce the communication complexity. However, in-network aggregation usually brings an unavoidable security defect. Some malicious nodes may control a large percentage of the whole network data and compel the network misbehave in an arbitrary manner. Thus, locating the malicious nodes to prevent them from further disaster is a practical challenge for data aggregation schemes. Based on the grouping and localization techniques, we propose a novel integrated protocol to locate malicious nodes. The proposed protocol does not rely on any special hardware and requests only incomplete information of the network from the security schemes. We also conduct simulation study to evaluate the proposed protocol.

关键词： Protocols Wireless sensor networks Aggregates Wireless networks Communication system security Security

来源：评论

学校读者我要写书评

暂无评论

Model-driven tenant development for PaaS-based SaaS

Model-driven tenant development for PaaS-based SaaS

引用

IEEE International Conference on Cloud computing Technology and science (CloudCom)

作者： Wei-Tek Tsai Wu Li Babak Esmaeili Wenjun Wu Department of Computer Science and Technology INLIST Tsinghua University Beijing China School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ USA State Key Laboratory of Software Development Environment Beihang University Beijing China

This paper proposes key SaaS (software-as-a-Service) design strategies for those SaaS systems that run on top of a commercial PaaS (Platform-as-a-Service) system such as GAE (Google App Engine)[1]. Specifically, this paper proposes a model-based approach for customization, multi-tenancy architecture, scalability, and redundancy & recovery techniques for GAE. The ACDATER (Actors, Conditions, Data, Actions, Timing, Events, and Relationship) model is used for various features, and then automated code generation is used to generate code based on the model specified. Simulation can be performed to ensure correctness before deployment.

关键词： software as a service Databases Computational modeling Scalability Reliability Data models

来源：评论

学校读者我要写书评

暂无评论

Digital art: Evaluation, appreciation, critique (invited SIG)

Digital art: Evaluation, appreciation, critique (invited SIG...

引用

30th ACM Conference on Human Factors in computing Systems, CHI 2012

作者： England, David Fantauzzacoffin, Jill Bryan-Kinns, Nick Latulipe, Celine Candy, Linda Sheridan, Jennifer School of Computing and Maths Liverpool John Moores University Liverpool United Kingdom Department of Digital Media Georgia Institute of Technology Atlanta GA United States School of Electronic Engineering and Computer Science Queen Mary University of London London. E1 4N United Kingdom Department of Software and Information Systems University of North Carolina at Charlotte Charlotte NC United States Creativity and Cognition Studios University of Technology Sydney NSW Australia BigDog Interactive Ltd. London United Kingdom

ISBN: (纸本)9781450310161

This SIG examines the vexed question of evaluation of Digital Art and how lessons on evaluation can be exchanged between the arts and mainstream HCI. We start by looking at critiques of standard approaches to evaluation in HCI. We then look at approaches, which have been developed in Digital Art to merge qualitative and quantitative methods. These investigations set the agenda for the SIG with the aim of uncovering the audience's knowledge and attempts at Digital Art evaluation, appreciation and critique. The chief outcome will be an exchange of experiences and proposals for ways forward for both the Digital Arts community and the broader CHI community. © 2012 Authors.

关键词： Arts computing

来源：评论

学校读者我要写书评

暂无评论

Productive information system oriented trust chain scheme

引用

Telkomnika 2012年第5期10卷 1093-1100页

作者： Tian, Li-Ye Shen, Chang-Xiang Department of Electronic and Information Engineering Naval Aeronautical and Astronautical University China Beijing Key Laboratory of Trusted Computing College of Computer Science and Technology Beijing University of Technology China State Key Laboratory of Information Security Chinese Academy of Sciences Institute of Software China

Productive information system has high-level security requirements, but Trusted computing Group's solution of trust chain isn't competent. After analysis and comparison of two different trust transfer ways, a new trust chain scheme was designed and its architecture was shown. With independent TPCM as a trust root, this scheme combined the advantages of linear and radial transfer. So that stronger cryptographic algorithm could be adopted by TPCM and applications' trust attenuation decreased a lot. This scheme was described formally by 6 linear temporal logic rules. It was proved that based on these rules, this scheme could transfer trust from trust root to applications. Meanwhile, it could actively report and handle exceptions in trust chain building and system running. Conclusion and future work were given at the end of this manuscript. © 2012 Universitas Ahmad Dahlan.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

Brain Computer Interface by use of Electro-encephalograms from Right Frontal Area

Brain Computer Interface by use of Electro-encephalograms fr...

引用

International Conference on Soft computing and Intelligent Systems

作者： Takahiro Yamanoi Toshimasa Yamazaki Michio Sugeno Hisashi Toyoshima Shin-ichi Ohnishi Elie Sanchez Division of Life Science and Technology Hokkai-Gakuen University Department of Bioscience and Bioinformatics Kyushu Institute of Technology European Center for Soft Computing Edificio Cientifico Tecnologico Japan Technical Software Division of Electronics and Information Engineering Hokkai-Gakuen University MIF Faculty of Medicine The University of Mediterranean

ISBN: (纸本)9781467327428

In order to develop a brain computer interface (BCI), some of the present authors have investigated the brain activity during human recognition of characters and symbols representing directional meaning. They have recorded electroencephalograms (EEGs) from subjects viewing four types of arrows: "↑", "↓", "←" and "→" that were presented on a CRT. The arrows denote direction for upward, downward, leftward and rightward, respectively. Subjects were asked to read them silently. EEGs were averaged for each stimulus type and direction, and event related potentials (ERPs) were obtained. The equivalent current dipole source localization (ECDL) method has been applied to these ERPs. In both cases, ECDs were localized to areas related to the working memory for spatial perception, i. e. the right upper or the right middle frontal areas. And the opposite directional arrows had opposite dipoles in these areas. Taking into account these facts, the authors investigated a single trial EEGs of the subject precisely after the latency at 400ms, and determined effective sampling latencies for the discriminant analysis to four types of arrows. We sampled EEG data at latencies from 400ms to 900ms at 25ms intervals by the four channels such as Fp2, F4, C4 and F8. Data were resampled -1ms and -2ms backward. Results of the discriminant analysis with jack knife method for four types objective variates, the mean discriminant rate for seven sample subjects was almost 85%.

关键词： Component Electroencephalogram Directional symbol Silent reading Discriminant analysis Brain computer interface

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：