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

2009 2nd International Conference on computer Science and Its Applications, CSA 2009

作者： Cho, Sang-Hyun Kang, Hang-Bong Yoo, Jang-Hee Dept. of Computer Engineering Catholic University of Korea Bucheon Korea Republic of Dept. of Digital Media Catholic University of Korea Bucheon Korea Republic of Software and Contents Research Laboratory Electronics and Telecommunications Research Institute Daejeon Korea Republic of

ISBN: (纸本)9781424449460

Background generation is very important for accurate object tracking in the video surveillance system. Traditional background generation techniques cause some problems when there have been non-moving objects for a long time. To overcome this problem, we propose a new background generation method using mean-shift and Fast Marching Method (FMM) that fuse pixel information along temporal and spatial dimensions. The mode of pixel value density along time axis is estimated by mean-shift algorithm and spatial information is evaluated by FMM, and then they are fused together to generate desirable background for nonmoving objects for a certain period. Experimental results show that our proposed method is more efficient than the traditional method. © 2009 IEEE.

关键词： Security systems

来源：评论

学校读者我要写书评

暂无评论

Face image modeling by multilinear subspace analysis with missing values 09

Face image modeling by multilinear subspace analysis with mi...

引用

17th ACM International Conference on Multimedia, MM'09, with Co-located Workshops and Symposiums

作者： Geng, Xin Smith-Miles, Kate Zhou, Zhi-Hua Wang, Liang School of Mathematical Sciences Monash University VIC 3800 Australia School of Computer Science and Engineering Southeast University Nanjing 210096 China National Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China Dept. of Computer Science and Software Eng. University of Melbourne VIC 3010 Australia

ISBN: (纸本)9781605586083

The main difficulty in face image modeling is to decompose those semantic factors contributing to the formation of the face images, such as identity, illumination and pose. One promising way is to organize the face images in a higher-order tensor with each mode corresponding to one contributory factor. Then, a technique called Multilinear Subspace Analysis (MSA) is applied to decompose the tensor into the mode-n product of several mode matrices, each of which represents one semantic factor. In practice, however, it is usually difficult to obtain such a complete training tensor since it requires a large amount of face images with all possible combinations of the states of the contributory factors. To solve the problem, this paper proposes a method named M2SA, which can work on the training tensor with massive missing values. Thus M2SA can be used to model face images even when there are only a small number of face images with limited variations which will cause missing values in the training tensor). Experiments on face recognition show that M2SA can work reasonably well with up to 70% missing values in the training tensor. Copyright 2009 ACM.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

LITSEEK: Public health Literature Search by metadata enhancement with External Knowledge bases

LITSEEK: Public health Literature Search by metadata enhance...

引用

3rd ACM International Workshop on Data and Text Mining in Bioinformatics, DTMBIO'09, Co-located with the 18th ACM International Conference on Information and Knowledge Management, CIKM 2009

作者： Prabhu, Priyanka Sharad Navathe, Shamkant B. Tyler, Stephen Dasigi, Venu Narkhede, Neha Palanisamy, Balaji College of Computing Georgia Institute of Technology Atlanta GA 30332-0280 United States Dept. of Computer Science and Software Engineering Southern Polytechnic State University Marietta GA 30060-2855 United States

ISBN: (纸本)9781605588032

Biomedical literature is an important source of information in any researcher's investigation of genes, risk factors, diseases and drugs. Often the information searched by public health researchers is distributed across multiple disparate sources that may include publications from PubMed, genomic, proteomic and pathway databases, gene expression and clinical resources and biomedical ontologies. The unstructured nature of this information makes it difficult to find relevant parts from it manually and comprehensive knowledge is further difficult to synthesize automatically. In this paper we report on LITSEEK (LITerature Search by metadata Enhancement with External Knowledgebases), a system we have developed for the benefit of researchers at the Centers for Disease Control (CDC) to enable them to search the HuGE (Human Genome for Epidemiology) database of PubMed articles, from a pharmacogenomic perspective. Besides analyzing text using TFIDF ranking and indexing of the important terms, the proposed system incorporates an automatic consultation with PharmGKB - a human-curated knowledge base about drugs, related diseases and genes, as well as with the Gene Ontology, a human-curated, well accepted ontology. We highlight the main components of our approach and illustrate how the search is enhanced by incorporating additional concepts in terms of genes/drugs/diseases (called metadata for ease of reference) from PharmGKB. Various measurements are reported with respect to the addition of these metadata terms. Preliminary results in terms of precision based on expert user feedback from CDC are encouraging. Further evaluation of the search procedure by actual researchers is under way. Copyright 2009 ACM.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Semi-Supervised learning using label mean 09

Semi-Supervised learning using label mean

引用

26th Annual International Conference on Machine Learning, ICML'09

作者： Yu-Feng, Li Kwok, James T. Zhi-Hua, Zhou National Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Dept. Computer Science and Engineering Hong Kong University of Science and Technology Clear Water Bay Hong Kong Hong Kong

ISBN: (纸本)9781605585161

Semi-Supervised Support Vector Machines(S3VMs) typically directly estimate the label assignments for the unlabeled instances. This is often inefficient even with recent advances in the efficient training of the (supervised) SVM. In this paper, we show that S3VMs, with knowledge of the means of the class labels of the unlabeled data, is closely related to the supervised SVM with known labels on all he unlabeled data. This motivates us to first estimate the label means of the unlabeled data. Two versions of the meanS3VM, which work by maximizing the margin between the label means, are proposed. The first one is based on multiple kernel learning, while the second one is based on alternating optimization. Experiments show that both of the proposed algorithms achieve highly competitive and sometimes even the best performance as compared to the state-of-the-art semi-supervised learners. Moreover, they are more efficient than existing *** 2009.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised learning using label mean

Semi-supervised learning using label mean

引用

26th International Conference On Machine Learning, ICML 2009

作者： Li, Yu-Feng Kwok, James T. Zhou, Zhi-Hua National Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Dept. Computer Science and Engineering Hong Kong University of Science and Technology Clear Water Bay Hong Kong Hong Kong

ISBN: (纸本)9781605585161

Semi-Supervised Support Vector Machines (S3VMs) typically directly estimate the label assignments for the unlabeled instances. This is often inefficient even with recent advances in the efficient training of the (supervised) SVM. In this paper, we show that S3VMs, with knowledge of the means of the class labels of the unlabeled data, is closely related to the supervised SVM with known labels on all the unlabeled data. This motivates us to first estimate the label means of the unlabeled data. Two versions of the mean S3VM, which work by maximizing the margin between the label means, are proposed. The first one is based on multiple kernel learning, while the second one is based on alternating optimization. Experiments show that both of the proposed algorithms achieve highly competitive and sometimes even the best performance as compared to the state-of-the-art semi-supervised learners. Moreover, they are more efficient than existing S3VMs.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Reasoning Intra-Dependency in Commitments for Robust Scheduling 09

Reasoning Intra-Dependency in Commitments for Robust Schedul...

引用

International Conference on Autonomous Agents and Multiagent Systems

作者： Mingzhong Wang Kotagiri Ramamohanarao Jinjun Chen Dept. of Computer Science and Software Engineering The University of Melbourne Faculty of ICT Swinburne University of Technology

ISBN: (纸本)9781615673346

Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considering the active role of agents in them. Therefore, in this paper we propose to augment agents with the ability of reasoning about and manipulating their commitments to maximize the system utility. We adopt a bottom-up approach by first investigating the intra-dependency between each commitment's preconditions and result which leads to a novel classification of commitments as well as a formalism to express various types of complex commitment. Within this framework, we provide a set of inference rules to benefit an agent by means of commitment refactoring which enables composition and/or decomposition of its commitments to optimize runtime performance. We also discuss the pros and cons of an agent scheduling and executing its commitments in parallel. We propose a reasoning strategy and an algorithm to minimize possible loss when the commitment is broken and maximize the overall system robustness and performance. Experiments show that concurrent schedules based on the features of commitments can boost the system performance significantly.

关键词： Design Reliability Performance Commitment machines Commitment refactoring Agent interaction Robustness Scheduling

来源：评论

学校读者我要写书评

暂无评论

Asymmetric group key agreement

Asymmetric group key agreement

引用

28th Annual International Conference on the Theory and Applications of Cryptographic Techniques, EUROCRYPT 2009

作者： Qianhong, Wu Yi, Mu Susilo, Willy Bo, Qin Domingo-Ferrer, Josep Universitat Rovira i Virgili Dept. of Comp. Eng. and Maths UNESCO Department of Data Privacy Tarragona Catalonia Spain Key Lab. of Aerospace Information Security and Trusted Computing School of Computer Wuhan University China Centre for Computer and Information Security Research School of Computer Science and Software Engineering University of Wollongong Australia Dept. of Maths School of Science Xi'an University of Technology China

ISBN: (纸本)3642010008

A group key agreement (GKA) protocol allows a set of users to establish a common secret via open networks. Observing that a major goal of GKAs for most applications is to establish a confiDential channel among group members, we revisit the group key agreement definition and distinguish the conventional (symmetric) group key agreement from asymmetric group key agreement (ASGKA) protocols. Instead of a common secret key, only a shared encryption key is negotiated in an ASGKA protocol. This encryption key is accessible to attackers and corresponds to different decryption keys, each of which is only computable by one group member. We propose a generic construction of one-round ASGKAs based on a new primitive referred to as aggregatable signaturebased broadcast (ASBB), in which the public key can be simultaneously used to verify signatures and encrypt messages while any signature can be used to decrypt ciphertexts under this public key. Using bilinear pairings, we realize an efficient ASBB scheme equippe d with useful properties. Following the generic construction, we instantiate a one-round ASGKA protocol tightly reduced to the decision Bilinear Diffie-Hellman Exponentiation (BDHE) assumption in the standard model. © International Association for Cryptologic Research 2009.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

A mobile decision support web 2.0 service to improve the customers satisfaction in their m-commerce experiences

Frontiers in Artificial Intelligence and Applications

引用

Frontiers in Artificial Intelligence and Applications 2009年第1期201卷 137-146页

作者： Pérez, I.J. Alonso, S. Cabrerizo, F.J. Herrera-Viedma, E. Dept. of Computer Science and Artificial Intelligence University of Granada 18071 Granada Spain Dept. of Software Engineering University of Granada 18071 Granada Spain 28040 Madrid Spain

ISBN: (纸本)9781607500520

The aim of this paper is to present a new mobile decision support web service applied to improve the customer satisfaction in decision making situations related with m-commerce. The application is included as a new mobile web service under a social net framework such as web 2.0. It allows that users with the same user profile that the potential customer can act as a set of shop assistants that advices him/her according with their experiences. To facilitate the system-user interaction the service uses computing with words tools and implements an ease to use mobile interface. Therefore, users can provide their advice at anytime and anywhere by using their own mobile devices. © 2009 The authors and IOS Press. All rights reserved.

关键词： Decision support systems

来源：评论

学校读者我要写书评

暂无评论

Registration of multimodality medical image using ordinary procrustes analysis and maximum likelihood framework

Registration of multimodality medical image using ordinary p...

引用

Medical Imaging 2009: Biomedical Applications in Molecular, Structural, and Functional Imaging

作者： Cho, Wanhyun Park, Jonghyun Kim, Sunwor Lee, Myungeun Park, Soonyoung Lim, Junsik Lee, Gueesang Le, Huy Phat Kim, Soohyung Jeongd, Changbu Division of Mathematics and Statistics Chonnam National University S. Korea Korea Republic of School of Electronics and Computer Engineering Chonnam National University S. Korea Korea Republic of Dept. of Electronics Engineering Mokpo National University S. Korea Korea Republic of Dept. of Internet Software Honam University S. Korea Korea Republic of

ISBN: (纸本)9780819475138

We propose a new registration method that can do the alignment of two medical images using simultaneously the ordinary Procrustes analysis as well as a maximum likelihood framework with the EM algorithm. In an initial registration, we first extract the feature points representing the shape information from the boundary of the segmented object, and then we apply the ordinary Procrustes analysis to register exactly two sets of extracted feature points. For the final registration, we define a new alignment measure with the log-likelihood function derived by the Bayes theory and the maximum likelihood method with EM algorithm. In the E-step, we compute the posterior distribution of label variable by taking expectation for the log-likelihood function. And in the M-step, we derive the estimators for all parameters by maximizing the log-likelihood function. Then, we can optimize the transformation parameters for the final image registration by applying iteratively this measure. Finally, we conduct the various experiments to analyze the accuracy and precision of the proposed method. The experimental results show that our method has great potential power to register various images given by multimodality instruments. © 2009 SPIE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A New Method to Generate Attack Graphs

A New Method to Generate Attack Graphs

引用

2009 Third IEEE International Conference on Secure Integration and Reliability Improvement SSIRI 2009(第三届IEEE安全软件集成及可信性改进国际会议)

作者： Anming Xie Guodong Chen Yonggang Wang Zhong Chen Jianbin Hu Institute of Software School of Electronics Engineering and Computer Science Peking University Be Dept. Of Electronic Engineering The First Aeronautical College of Air Force China Institute of Software School of Electronics Engineering and Computer Science Peking University Be Institute of Software School of Electronics Engineering and Computer Science Peking University Be Institute of Software School of Electronics Engineering and Computer Science Peking University Be

ISBN: (纸本)9780769537580

To address the scalability problem in attack graphs generation, we propose a novel method to generate attack graphs automatically. Our approach constructs a two-tier attack graph framework, which includes a host access graph and some sub-attack graphs. A subattack graph describes concrete attack scenarios from one source host to one target host, while the host access graph describes the attacker's privilege transition among hosts. Our sub-attack graphs and host access graph have remarkable smaller scales and can help network administrators to find the key hosts in attack sequences. Analysis shows that the upper bound computational cost of our model is O(N3), which could also be competed in real time. The following experiment validates our approach.

关键词： network security attack graphs host access graph sub-attack graph

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：