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

International Conference on Computational Intelligence and Security Workshops (CISW)

作者： Lu Chen Huanguo Zhang Liqiang Zhang Liang Cai School of Computer State Key Lab of Software Engineering Wuhan University of China Wuhan China Institute of Electronic Technology People''s Liberation Army Information and Engineering University Zhengzhou China

The information measurement of the NAR (network access requester) is the key element for trusted network access. The only issues TNC (trusted network connection) proposed the conception of integrity measurement and pointed out that only if the measurements passed can the NAS ((network access server) let the endpoint enter. But no concrete techniques are expatiated in TNC, and the related specification IMM (integrity measurement model) is too complex to implement. Virtually, the measurement cannot be localized to the integrity. In this paper, a new information measurement architecture is proposed, in which not only the integrity information of the platform, but also the identity of user and platform, and the information of system availability are considered. The related techniques (information collection and verification etc.) are illustrated, and the trust chain transfer is analyzed at the end.

关键词： Information security computer networks software measurement software engineering Physics computing computer aided manufacturing Distributed computing Computational intelligence computer security

来源：评论

学校读者我要写书评

暂无评论

An Ant Colony Optimization Algorithm for Solving the Multidimensional Knapsack Problems 07

An Ant Colony Optimization Algorithm for Solving the Multidi...

引用

IEEE/WIC/ACM International Conference on Intelligent Agent technology (IAT)

作者： Junzhong Ji Zhen Huang Chunnian Liu Xuejing Liu Ning Zhong College of Computer Science and Technology Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology Beijing University of Technology Beijing China School of Information Engineering Shijiazhuang University of Economics Shijiazhuang China Department of Information Engineering Maebashi Institute of Technology Maebashi Japan

ISBN: (纸本)9780769530277

Ant colony optimization (ACO) algorithm is a metaheuristic and stochastic search technology, which has been one of the effective tools for solving discrete optimization problems. However, there are two bottlenecks for large-scaled optimization problems: the ACO algorithm needs too much time to convergent and the solutions may not be really optimal. This paper proposes a novel ACO algorithm for the multidimensional knapsack problems (MKP), which employs a new pheromone diffusion model and a mutation scheme. First, in light of the preference to better solutions, the association distances among objects are mined in each iteration with top-k strategy. Then, a pheromone diffusion model based on info fountain of an object is established, which strengthens the collaborations among ants. Finally, an unique mutation scheme is applied to optimizing the evolution results of each step. The experimental results for the benchmark testing set of MKPs show that the proposed algorithm can not only get much more optimal solutions but also greatly enhance convergence speed.

关键词： Ant colony optimization Multidimensional systems Genetic mutations Intelligent agent software algorithms Benchmark testing Educational institutions computer science Laboratories software tools

来源：评论

学校读者我要写书评

暂无评论

Discovering Protein Complexes from Protein-Protein Interaction Data by Local Cluster Detecting Algorithm

Discovering Protein Complexes from Protein-Protein Interacti...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Juan Liu Bin Liu Deyi Li School of Computer Wuhan University of China Wuhan China Wuhan University Wuhan Hubei CN State Key Laboratory of Software Engineering Wuhan University of China Wuhan China Institute of Computing Technology Chinese Academy and Sciences Beijing China

Proteins are usually grouped into complexes to perform functional tasks in organisms. So discovery of protein complexes is critical to understand principles of cellular organization and function. Recently high-throughput techniques have produced large amount of protein-protein interaction (PPI) data, which make it possible to detect protein complexes automatically from PPI data by using computational method. In this paper, we propose a local cluster detection algorithm (LCDA) to find the protein complexes. Super to other methods existed, LCDA is able to find both non-overlapping and overlapping clusters. The experiment results show that LCDA can detect protein complexes with very high accuracies.

关键词： Clustering algorithms Protein engineering Nuclear magnetic resonance Organisms Complex networks software algorithms software engineering computers Detection algorithms Crystallography

来源：评论

学校读者我要写书评

暂无评论

Presentation and Visualization of Redundant Code: Working Session Summary

Presentation and Visualization of Redundant Code: Working Se...

引用

Duplication, Redundancy, and Similarity in software 2006

作者： Walenstein, Andrew Cordy, Jim Evans, Will Hassan, Ahmed Kamiya, Toshihiro Kapser, Cory Merlo, Ettore University of Louisiana at Lafayette Center for Advanced Computer Studies P.O. Box 44330 LafayetteLA70504-4330 United States Queen's University School of Computing KingstonONK7L 3N6 Canada University of British Columbia Department of Computer Science 201-2366 Main Mall VancouverBCV6T 1Z4 Canada University of Victoria Electrical and Computer Engineering Engineering Office Wing 315 P.O. Box 3055 VictoriaBCV8W 3P6 Canada Information Technology Research Institute Ubiquitous Software Group University of Waterloo David R. Cheriton School of Computer Science WaterlooONN2L 3G1 Canada C.P. 6079 Succ. Centre Ville MontréalQCH3C 3A7 Canada

This report summarizes the proceedings of a workshop discussion session presentation and visualization of aspects relating to duplicated, copied, or cloned code. The main outcomes of the working session were: (a) a realization that two researchers had independently generated very similar methods for browsing and visualization clone "clusters", and (b) a list of questions for visualization, particularly in relation to how the "proximity" of clones may relate to interest in the clone. © Duplication, Redundancy, and Similarity in software *** rights reserved.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Support Vector Regression with Feature Selection for the Multivariate Calibration of Spectrofluorimetric Determination of Aromatic Amino Acids

Support Vector Regression with Feature Selection for the Mul...

引用

IEEE Symposium on Bioinformatics and Bioengineering (BIBE)

作者： Guo-Zheng Li Hao-Hua Meng Mary Qu Yang Jack Y. Yang School of Computer Science & Engineering Shanghai University Shanghai China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China National Human Genome Research Institute U.S. Department of Health and Human Services National Institutes of Health DHHS Bethesda MD USA Harvard Medical School Harvard University Cambridge MA USA

Several artificial intelligent methods, including support vector regression (SVR), artificial neural networks (ANNs), and partial least square (PLS) are used for the multivariate calibration in the determination of the three aromatic amino acids (phenylalanine, tyrosine and tryptophan) in their mixtures by fluorescence spectroscopy. The results of the leave-one-out method show that SVR perform better than other methods, and appear to be good methods for this task. Furthermore, feature selection is performed for SVR to remove redundant features and a novel algorithm named PRIFER (prediction risk based feature selection for support vector regression) is proposed. Results on the above multivariate calibration data set show that PRIFER is a powerful tool for solving the multivariate calibration problems.

关键词： Calibration Amino acids Fluorescence Humans Bioinformatics Artificial neural networks Prediction algorithms Chemistry Kernel Spectroscopy

来源：评论

学校读者我要写书评

暂无评论

Developing a computer science-specific learning taxonomy 07

Developing a computer science-specific learning taxonomy

引用

2007 Working Group Reports on ITiCSE on Innovation and technology in computer Science Education, ITiCSE-WGR 2007

作者： Fuller, Ursula Johnson, Colin G. Ahoniemi, Tuukka Cukierman, Diana Hernán-Losada, Isidoro Jackova, Jana Lahtinen, Essi Lewis, Tracy L. Thompson, Donna McGee Riedesel, Charles Thompson, Errol Computing Laboratory University of Kent CanterburyCT2 7NF United Kingdom Institute of Software Systems Tampere University of Technology Tampere Finland School of Computing Science Simon Fraser University BurnabyBC Canada Department of Lenguajes Y Sistemas Informáticos Universidad Rey Juan Carlos Madrid Spain Faculty of Management Science and Informatics University of Zilina Zilina Slovakia Department of Information Technology Radford University RadfordVA24142 United States Department of Learning Commons Simon Fraser University BurnabyBC Canada Department of Computer Science and Engineering University of Nebraska Lincoln 259 Avery Hall LincolnNE68588-0115 United States Massey University Wellington New Zealand

ISBN: (纸本)9781450378420

Bloom's taxonomy of the cognitive domain and the SOLO taxonomy are being increasingly widely used in the design and assessment of courses, but there are some drawbacks to their use in computer science. This paper reviews the literature on educational taxonomies and their use in computer science education, identifies some of the problems that arise, proposes a new taxonomy and discusses how this can be used in application-oriented courses such as programming.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

Authenticated Key Agreement in Group Settings

引用

Journal of Beijing institute of technology 2006年第2期15卷 186-189页

作者：李明王勇谷大武白英彩 Department of Computer Science and Engineering Shanghai Jiao Tong University School of Software Beijing Institute of Technology

An enhanced definition of implicit key authentication and a secure group key agreement scheme from pairings are presented. This scheme combines the merits of group public key and key trees to achieve a communication-efficient and authenticated group key agreement protocol. Besides, it avoids dependence on signature or MAC by involving member＇s long-term keys and short-term keys in the group key. Furthermore, the idea behind this design can be employed as a general approach to extend the authenticated two-party Diffie-Hellman protocols to group settings.

关键词： key agreement implicit key authentication key tree pairings

来源：评论

学校读者我要写书评

暂无评论

An application-semantics-based relaxed transaction model for internetware

引用

Science in China(Series F) 2006年第6期49卷 774-791页

作者： HUANG Tao DING Xiaoning WEI Jun Technology Center of Software Engineering Institute of Software Chinese Academy of Sciences Beijing 100080 China Key laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing100080 China Graduate School of Chinese Academy of Sciences Beijing 100080 China

An internetware application is composed by existing individual services, while transaction processing is a key mechanism to make the composition reliable. The existing research of transactional composite service （TCS） depends on the analysis to composition structure and exception handling mechanism in order to guarantee the relaxed atomicity. However, this approach cannot handle some application-specific requirements and causes lots of unnecessary failure recoveries or even aborts. In this paper, we propose a relaxed transaction model, including system mode, relaxed atomicity criterion, static checking algorithm and dynamic enforcement algorithm. Users are able to define different relaxed atomicity constraint for different TCS according to application-specific requirements, including acceptable configurations and the preference order. The checking algorithm determines whether the constraint can be guaranteed to be satisfied. The enforcement algorithm monitors the execution and performs transaction management work according to the constraint. Compared to the existing work, our approach can handle complex application requirements, avoid unnecessary failure recoveries and perform the transaction management work automatically.

关键词： internetware service composition relaxed atomicity relaxed transaction mode.

来源：评论

学校读者我要写书评

暂无评论

On the quality of service of failure detectors based on control theory

On the quality of service of failure detectors based on cont...

引用

20th International Conference on Advanced Information Networking and Applications

作者： Xiong, Naixue Yang, Yan Chen, Jianxun He, Yanxiang School of Information Science Japan Advanced Institute of Science and Technology Japan Computer Science and Technology School Wuhan University of Science and Technology China State Key Lab of Software Engineering Computer School Wuhan University China

ISBN: (纸本)0769524664

The detection of failures is a fundamental issue for fault tolerance in distributed systems. Recently, many people have come to realize that failure detection ought to be provided as some form of generic service, similar to IP address lookup. However, this has not been successful so far;one of the reasons being the fact that classical failure detectors were not designed to satisfy several application requirements simultaneously. More specifically, traditional implementations of failure detectors are often tuned for running over local networks and fail to address some important problems found in wide-area distributed systems with a large number of monitored components. In this paper, we study the quality of service (QoS) of failure detectors. We first present a novel failure detector scheme combined with control theory that can help in solving or optimizing some problems. Furthermore, this paper discusses the design and analysis of implementing a scalable failure detection service for such large wide-area distributed systems considering dynamically adjusting the heartbeat streams, so that it satisfies the bottleneck router requirements. We further show how the online failure detector control algorithm can be used to design a controller, analyze the theoretical aspects of the proposed algorithm and verify its agreement. Simulation results show the efficiency of our scheme in terms of high utilization of the bottleneck link fast response and good stability of the bottleneck router buffer occupancy as well as of the controlled sending rates. In conclusion, the new failure detector algorithm provides a better QoS than an algorithm that is proposed by Stelling et al [1, 2].

关键词： Telecommunication services

来源：评论

学校读者我要写书评

暂无评论

MEMS: A method for evaluating middleware architectures

引用

2nd International Conference on Quality of software Architectures

作者： Liu, Yan Gorton, Ian Bass, Len Hoang, Cuong Abanmi, Suhail National ICT Australia (NICTA) School of Computer Science and Engineering University of New South Wales Australia Software Engineering Institute United States Engineering Faculty University of Technology Sydney Australia

ISBN: (纸本)9783540488194

Middleware architectures play a crucial role in determining the overall quality of many distributed applications. Systematic evaluation methods for middleware architectures are therefore important to thoroughly assess the impact of design decisions on quality goals. This paper presents MEMS, a scenario-based evaluation approach. MEMS provides a principled way of evaluating middleware architectures by leveraging generic qualitative and quantitative evaluation techniques such as prototyping, testing, rating, and analysis. It measures middleware architectures by rating multiple quality attributes, and the outputs aid the determination of the suitability of alternative middleware architectures to meet an application's quality goals. MEMS also benefits middleware development by uncovering potential problems at early stage, making it cheaper and quicker to fix design problems. The paper describes a case study to evaluate the security architecture of grid middleware architectures for managing secure conversations and access control. The results demonstrate the practical utility of MENIS for evaluating middleware architectures for multiple quality attributes.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：