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

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

来源：评论

学校读者我要写书评

暂无评论

Knowledge reuse through categorical breakdown analysis: A method for collaborative systems evaluation

Knowledge reuse through categorical breakdown analysis: A me...

引用

2nd International Conferences on Advances in computer-Human Interactions, ACHI 2009

作者： Humphries, Will McCrickard, D. Scott Neale, Dennis Center for HCI Department of Computer Science Virginia Tech. Blacksburg VA United States Center for HCI Industrial and Systems Engineering Dept. Virginia Tech. Blacksburg VA United States

ISBN: (纸本)9780769535296

Designing CSCW systems that support the widely varying needs of targeted users is difficult. There is no silver bullet technology that enables users to effectively collaborate with one another in different contexts. We propose a method of collaborative systems evaluation that enables novice evaluators to make insightful observations about the systems they evaluate at a level comparable to experts in certain situations. These observations come in the form of a categorical breakdown analysis of a laboratory study. The quantity and type of breakdowns can then be connected to recommended CSCW tools and features developed and described in the related literature. We conducted a study to explore the results generated when the method was applied by both experts and novices in the field of CSCW. We observed that experts found the method to be usable, and that novices capitalized on the knowledge embodied in the breakdown categories to make categorizations similar to those of experts. © 2009 IEEE.

关键词： computer supported cooperative work

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Verification of real-time DEVS models

Verification of real-time DEVS models

引用

DEVS Integrative M and S Symposium, DEVS 2009, Part of the 2009 Spring Simulation Multiconference, SpringSim 2009

作者： Saadawi, Hesham Wainer, Gabriel School of Computer Science Carleton University Ottawa ON . K1S 5B6 Canada Dept. of Systems and Computer Engineering Carleton University Ottawa ON . K1S 5B6 Canada

Discrete Event System Specification (DEVS) has been widely used to describe hierarchical models of discrete systems. DEVS has also been used successfully to model with Real-Time constraints. In this paper, we introduce a methodology to verify Real-Time DEVS models, and describe the methodology by using a case study of a DEVS model of an elevator system. Our methodology applies recent advances in theoretical model checking to DEVS models. The methodology also handles the cases where theoretical approach is not feasible to cross the gap between abstract Timed Automata models and the complexity of the DEVS Real-time implementation by empirical software engineering methods. The case study is a system composed of an elevator along an elevator controller, and we show how the methodology can be applied to a real case like this one in order to improve the quality of such real-time applications.

关键词： Elevators

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Visualization and statistical analysis of fuzzy-neuro learning vector quantization based on particle swarm optimization for recognizing mixture odors

Visualization and statistical analysis of fuzzy-neuro learni...

引用

20th Anniversary MHS 2009 and Micro-Nano Global COE - 2009 International Symposium on Micro-NanoMechatronics and Human Science

作者： Jatmiko, W. Rochmatullah Kusumoputro, B. Sanabila, H.R. Sekiyama, K. Fukuda, T. Faculty Computer Science University of Indonesia Depok West Java 16424 Indonesia Faculty of Engineering University of Indonesia Depok West Java 16424 Indonesia Dept. of Micro-Nano Systems Engineering Nagoya University Chikusa-ku Nagoya Japan

ISBN: (纸本)9781424450954

An electronic nose system had been developed by using 16 quartz resonator sensitive membranes-basic resonance frequencies 20 MHz as a sensor, and analyzed the measurement data through various neural network as a pattern recognition system. The developed system showed high recognition probability to discriminate various single odors even mixture odor to its high generality properties;however the system still need improvement. In order to improve the performance of the proposed system, development of the sensor and other neural network are being sought. This paper explains the improvement of the capability of that system from the point of neural network system. It has been proved from our previous work that FLVQ (Fuzzy Learning Vector Quantization) which is LVQ (Learning Vector Quantization) together with fuzzy theory shows high recognition capability compared with other neural networks, however FLVQ have a weakness for selecting the best codebook vector that will influence the result of recognition. This problem will be anticipated by adding the PSO (Particle Swarm Optimization) method to select the best codebook vector. Then experiment show that the new recognition system (FLVQ-PSO) has produced higher capability compared to the earlier mentioned system. ©2009 IEEE.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

Localizing multiple odor sources in dynamic environment using ranged subgroup PSO with flow of wind based on open dynamic engine library

Localizing multiple odor sources in dynamic environment usin...

引用

20th Anniversary MHS 2009 and Micro-Nano Global COE - 2009 International Symposium on Micro-NanoMechatronics and Human Science

作者： Jatmiko, W. Pambuko, W. Mursanto, P. Muis, A. Kusumoputro, B. Sekiyama, K. Fukuda, T. Faculty of Computer Science University of Indonesia Depok West Java 16424 Indonesia Faculty of Engineering University of Indonesia Depok West Java 16424 Indonesia Dept. of Micro-Nano Systems Engineering Nagoya University Chikusa-ku Nagoya Japan

ISBN: (纸本)9781424450954

A new algorithm based on Modified Particle Swarm Optimization (MPSO) which follows a local gradient of the chemical concentration within a plume and follow direction of the wind velocity is investigated. Moreover, the niche or parallel search characteristic is adopted on MPSO to solve the multi-peak and multi-source problem. When using parallel MPSO, subgroup of robot is introduced then each subgroup can locate the odor source. Unfortunately, there is a possibility that more that one subgroup locates one odor sources. This is inefficient because other subgroups locate other source, then we proposed a ranged subgroup method for coping for that problem, then the searching performance will increase. Then ODE (Open Dynamics Engine) library is used for physical modeling of the robot like friction, balancing moment and others. Finally the statistical analysis shows that the new approach is technically sounds. ©2009 IEEE.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Optimal decompositions of matrices with grades into binary and graded matrices

Optimal decompositions of matrices with grades into binary a...

引用

6th International Conference on Concept Lattices and Their Applications, CLA 2008

作者： Bartl, Eduard Belohlavek, Radim Konecny, Jan Dept. Systems Science and Industrial Engineering T. J. Watson School of Engineering and Applied Science Binghamton University-SUNY PO Box 6000 Binghamton NY 13902-6000 United States Dept. Computer Science Palacky University Olomouc Tomkova 40 CZ-779 00 Olomouc Czech Republic

The paper contributes to factor analysis of relational data. We study the problem of decomposition of object-attribute matrices with grades, i.e. matrices whose entries contain degrees to which objects have attributes. The degrees are taken from a bounded partially ordered scale. Examples of such matrices are binary matrices, matrices with entries from a finite chain, or matrices with entries from the unit interval [0, 1]. We study the problem of decomposition of a given object-attribute matrix I with grades into an object-factor matrix A and a binary factorattribute matrix B, with the number of factors as small as possible. We present a theorem describing optimal decompositions. The theorem shows that decompositions which use as factors particular formal concepts associated to I are optimal in that the number of factors involved is the smallest possible. Furthermore, we present an approximation algorithm for finding those decompositions and illustrative examples. © 2008 Radim Belohlavek.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：