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

International Conference on Computational Intelligence and security

作者： Tieming Chen Xiaoming Pan Yiguang Xuan Jixia Ma Jie Jiang College of Computer Science & Technology Zhejiang University of Technology Hangzhou China State Key Laboratory of Software Development Environment Beihang University Beijing China Zhejiang Key Laboratory of Information Security Hangzhou China

Network intrusion detection system needs to handle huge data selected from network environments which usually contain lots of irrelevant or redundant features. It makes intrusion detection with high resource consumption, as well as results in poor performance of real-time processing and intrusion detection rate. Without loss of generality, feature selection can effectively improve the classification model performance, study on the feature selection-based intrusion detection method is therefore very necessary. This paper proposes a simple and quick inconsistency-based feature selection method. Data inconsistency is firstly employed to find the optimal features, and the sequential forward search is then utilized to facilitate the selection of subset features. The tests on KDD99 benchmark data show that the proposed feature selection method can directly eliminate irrelevant and redundant features, without degenerating the classification performance. Furthermore, due to experiments, the intrusion detection performance using the proposed method is also a little advantageous than that with the general CFS method.

关键词： Feature extraction Intrusion detection Classification algorithms Artificial neural networks Data mining Support vector machines Probes

来源：评论

学校读者我要写书评

暂无评论

New resampling algorithm for generic particle filters

New resampling algorithm for generic particle filters

引用

作者： Fu, X. Jia, Y. Du, J. Yu, F. Beijing 100191 China Ministry of Education Beijing 100191 China Key Laboratory of Intelligent Telecommunications Software and Multimedia School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing 100876 China School of Electrical Engineering and Automation Henan Polytechnic University Jiaozuo 454000 Henan China

ISBN: (纸本)9781424474264

This paper is devoted to the resampling problem of particle filters. We firstly demonstrate the performance of classical Resampling algorithm (also called as systematic resampling algorithm) using a novel metaphor, through which the existing defects of Resampling algorithm is vividly reflected simultaneously. In order to avoid these defects, the exquisite resampling (ER) algorithm is induced which involves some exquisite actions such as comparing the weights by stages and generating the new particles based on quasi-Monte Carlo method. Simulations indicate that the proposed ER algorithm can reduce the sample impoverishment effectively and improve the accuracy of estimation evidently, which confirm that ER algorithm is a competitive alternative to Resampling algorithm. © 2010 AACC.

关键词： Defects

来源：评论

学校读者我要写书评

暂无评论

LyDAR: A LYrics Density based Approach to non-homogeneous music Resizing

LyDAR: A LYrics Density based Approach to non-homogeneous mu...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Zhang Liu Chaokun Wang Lu Guo Yiyuan Bai Jianmin Wang School of Software Tsinghua University Beijing China Tsinghua National Laboratory for Information Science and Technology China Key Laboratory of Information System Security Ministry of Education China

In many scenarios, such as TV/radio advertising production, animation production, and presentation, music pieces are constrained in the metric of time. For example, an editor wants to use a 320s song to fit a 280s animation or to accompany a 265s radio advertisement. Current music resizing approach scales the whole piece of music in a uniform manner. However, it will degrade the effect of the compressed song and make perceptual artifacts. In this paper, a novel music resizing approach, called LyDAR (LYrics Density based Approach to non-homogeneous music Resizing), is proposed, in which the resizing operation is guided by music structural analysis. Firstly, a useful concept, lyrics density, is presented, which takes advantage of lyrics to analyze the musical structure and can be used to describe the compression-resistance for different parts of a song. Secondly, two music resizing scheduling algorithms, LDF and LDGF, are developed to schedule compression over different parts of a music piece. Finally, both subjective and objective experiments are conducted to show that LyDAR can effectively and efficiently generate compressed versions of songs with good quality.

关键词： Generators Schedules Production Measurement Music Animation Media

来源：评论

学校读者我要写书评

暂无评论

Dynamically Analyzing Time Constraints in Workflow Systems with Fixed-Date Constraint

Dynamically Analyzing Time Constraints in Workflow Systems w...

引用

International Asia-Pacific Web Conference (APWEB)

作者： Rui Han Yingbo Liu Lijie Wen Jianmin Wang School of Software Tsinghua University Beijing China Ministry of Education Key Laboratory of Information System Security China Tsinghua National Laboratory for Information Science and Technology China

In workflow management systems (WFMSs), time management plays an essential role in controlling the lifecycle of business processes. Especially, run-time analysis of time constraints is necessary to help process manager proactively detect possible deadline violations and appropriately handle these violations. Traditional time constraint analyses either present deterministic results which are too restrictive in highly uncertain workflow processes, or only consider static analysis at workflow build-time. For such an issue, this paper proposes a dynamic approach for analyzing time constraints during process execution. To be specific, based on a Petri-net-extended stochastic model, this approach first analyzes activity instances' continuous probabilities of satisfying time constraints when a process instance is initiated. Afterwards, during the execution of this process instance, the approach dynamically updates these probabilities whenever an activity instance is completed. Moreover, an example process instance in real-world WFMSs shows the practicality of our approach.

关键词： Time factors Information analysis Laboratories Workflow management software Runtime Stochastic processes Monitoring Upper bound Management information systems Information security

来源：评论

学校读者我要写书评

暂无评论

Application of Logical Petri Nets in Web service composition

Application of Logical Petri Nets in Web service composition

引用

International Conference on Mechatronics and Automation

作者： Zhu, ChangYan Du, YuYue College of Information Science and Engineering ShanDong University of Science and Technology Qingdao 266510 China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100080 China Shandong University of Science and Techonology Qingdao 266510 China

ISBN: (纸本)9781424451418

In the process of Web service composition, there are several cases about working up an atomic Web service;as well as the outputs of Web service have many possibilities because of the different requirements from users. In order to address these uncertainties, Logical Petri Net(LPN) is introduced into the system of Web service composition, these problems can be well solved using the LPN's feature-passing value indeterminacy. And a model of Web service composition is proposed with the technology of ontology and Agent. Based on this model, an approach of Web service composition is presented in this paper. © 2010 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

A Face-Based Shape Matching Method for IGES Surface Model

A Face-Based Shape Matching Method for IGES Surface Model

引用

International Conference on Shape Modeling and Applications

作者： Kai-Mo Hu Bin Wang Yi Gao Qi-Ming Yuan Jun-Hai Yong Key Laboratory of Information System Security Ministry of Education Beijing China Department of Computer Science and Technology Tsinghua University Beijing China Tsinghua National Laboratory for Information Science and Technology Beijing China School of Software Tsinghua University Beijing China

ISBN: (纸本)9781424472598;9780769540726

IGES is a widely used standard for mechanical data exchange. In this paper, we present a new method for the retrieval task of IGES surface model. Based on this method, a novel distinctive face selection strategy is proposed and evaluated. In the training database, each model is treated as a set of disordered faces, and their features are extracted and stored respectively. The Discounted Cumulative Gain (DCG) value of each face is then calculated and stored for later utilization. To retrieve models in the testing database, we first forecast each face's DCG value by searching its most similar face's DCG value in training database, and then the top k faces with highest forecasted DCGs are selected as query input. A greedy algorithm is finally applied to get the total similarity. Experimental results show that our algorithm is superior or at least comparable to some of the most powerful methods in finding parts with similar functionality in most cases.

关键词： Shape Information retrieval Predictive models Design automation Spatial databases Educational technology Laboratories Testing Greedy algorithms Computer science

来源：评论

学校读者我要写书评

暂无评论

Runtime Protecting System for Java Applications with Dynamic Data Flow Analyzing

Runtime Protecting System for Java Applications with Dynamic...

引用

The 2010 2nd International Conference on Future Computer and Communication(第二届未来计算机与通信国际会议 ICFCC 2010)

作者： Bo Feng Miao Zhang Guoai Xu Xinxin Niu Zhengming Hu Information Security Center State Key Laboratory of Networking and Switching Technology/ National Engineering Laboratory for Disaster Backup and Recovery Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781424458219;9781424458240

With the rapidly development of the computer and internet technology, the security problem of software is more and more concerned. In this paper we present a runtime protecting system for java applications with dynamic data flow analyzing. We proposed the runtime software protecting algorithm and discussed the design and implementation of the runtime protecting system for java applications. At last, we compared runtime protecting system with static code analysis and analyze the performance of our implementation.

关键词： Runtime Protecting Dynamic Data Flow security

来源：评论

学校读者我要写书评

暂无评论

Research on systematic metrics of network survivability

Research on systematic metrics of network survivability

引用

International Conference on Information Science and engineering (ICISE)

作者： Liang Ming Dongxia Wang Lufeng Zhang Chunlei Wang Jian Tang Jinjing Zhao Nation Key Laboratory of Science and Technology on Information System Security Beijing Institute of System Engineering Beijing China Department of Computer Science and Technology Tsinghua University Beijing 100084 China

As networks develop into large-scale systems, survivability of network systems is imperative. The systematic metrics of network survivability are used to measure or evaluate network survivability. This Paper summarizes the systematic metrics and their lack for measuring or computing network survivability while providing an easy way to reference baseline of the current state. It also provides some principles of network survivability metrics, and divides the current network survivability metrics into three types: target-based network survivability metrics, method-based network survivability metrics, and description-based network survivability metrics. At last, the trend of network survivability metrics is given: A set of quantitative, user-orientation, hierarchical and systematic survivability metrics, which can reflect full aspects and characters during the whole process of survivable networks, are required.

关键词： Measurement Conferences Information systems Computational modeling Systematics Computer security

来源：评论

学校读者我要写书评

暂无评论

A Framework for the Elicitation and Analysis of Information technology Service Requirements and Their Alignment with Enterprise Business Goals

A Framework for the Elicitation and Analysis of Information ...

引用

IEEE Annual Computer software and Applications Conference Workshops (COMPSACW)

作者： Didar Zowghi Zhi Jin School of Software Faculty of Engineering and IT Sydney University of Technology Sydney Australia Key Laboratory of High Confidence Software Technologies Peking University Beijing China

As the economies of the world have become increasingly dependant on Information technology (IT) services, there is a need for service designers and developers to focus on co-value creation between service providers and service consumers. Developers need to conduct a more rigorous and systematic identification, elicitation, and analysis of IT service requirements than ever before so that the resulting IT services are closely aligned with the enterprise business requirements. Research in Services Science from the business and management discipline has mostly focused on the delivery and management of services experience from the business perspective. Much of the research focus in Service Oriented Computing (SOC) so far has been on the design and delivery of services (especially Web Services), but engineering of IT service requirements has received much less attention. The overall aims of the proposed research is the design and development of an integrated framework and its supporting toolset for the systematic identification, elicitation, and analysis of IT service requirements that satisfy consumers' needs and are closely aligned with their enterprise business goals.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On an attack on RSA with small CRT-exponents

引用

Science China(Information Sciences) 2010年第8期53卷 1511-1518页

作者： HAN LiDong 1,2 , WANG XiaoYun 3 & XU GuangWu 3,4 1 key laboratory of Cryptologic technology and Information security, Ministry of Education, Shandong University, Jinan 250100, China 2 School of Mathematics, Shandong University, Jinan 250100, China 3 Institute for Advanced Study, Tsinghua University, beijing 100084, China 4 Department of Electrical engineering and Computer Science, University of Wisconsin-Milwaukee, Milwaukee, WI 53201, USA 1. Key Laboratory of Cryptologic Technology and Information Security Ministry of Education Shandong University Jinan 250100 China2. School of Mathematics Shandong University Jinan 250100 China3. Institute for Advanced Study Tsinghua University Beijing 100084 China4. Department of Electrical Engineering and Computer Science University of Wisconsin-Milwaukee Milwaukee WI 53201 USA

This paper concerns the RSA system with private CRT-exponents. Since Chinese remainder representation provides efficiency in computation, such system is of some practical significance. In this paper, an existing attack to small private CRT-exponents is analyzed. It is indicated that this attack makes nice use of lattice in RSA analysis, but some argument does not hold in general. Several counterexamples are constructed. Refinements and more precise statements of the attack are given.

关键词： RSA CRT cryptanalysis continued fraction lattice reduction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：