检索结果-南通市图书馆

A malware detection model based on a negative selection algorithm with penalty factor

Science china(Information Sciences) 2010年第12期53卷 2461-2471页

作者： ZHANG PengTao 1,2., WANG Wei 1,2.& TAN Ying 1,2.1 Department of machine Intelligence, School of Electronics Engineering and Computer Science, peking University,{2., china 2.key laboratory of machine perception, ministry of education, peking University,{2., china 1. Department of machine Intelligence School of Electronics Engineering and Computer Science Peking University Beijing 100871 China2. Key Laboratory of Machine Perception Ministry of Education Peking University Beijing 100871 China

A malware detection model based on a negative selection algorithm with penalty factor (NSAPF) is proposed in this paper. This model extracts a malware instruction library (MIL), containing instructions that tend to appear in malware, through deep instruction analysis with respect to instruction frequency and file frequency. From the MIL, the proposed model creates a malware candidate signature library (MCSL) and a benign program malware-like signature library (BPMSL) by splitting programs orderly into various short bit strings. Depending on whether a signature matches "self", the NSAPF further divides the MCSL into two malware detection signature libraries (MDSL1 and MDSL2., and uses these as a two-dimensional reference for detecting suspicious programs. The model classifies suspicious programs as malware and benign programs by matching values of the suspicious programs with MDSL1 and MDSL2. Introduction of a penalty factor C in the negative selection algorithm enables this model to overcome the drawback of traditional negative selection algorithms in defining the harmfulness of "self" and "nonself", and focus on the harmfulness of the code, thus greatly improving the effectiveness of the model and also enabling the model to satisfy the different requirements of users in terms of true positive and false positive rates. Experimental results confirm that the proposed model achieves a better true positive rate on completely unknown malware and a better generalization ability while keeping a low false positive rate. The model can balance and adjust the true positive and false positive rates by adjusting the penalty factor C to achieve better performance.

关键词： penalty factor negative selection algorithm signature extraction artificial immune system mal- ware detection

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

A new algorithm for fast mining frequent itemsets using N-lists

引用

Science china(Information Sciences) 2012年第9期55卷 2008-2030页

作者： DENG ZhiHong ,WANG ZhongHui & JIANG JiaJian key laboratory of {2. perception(ministry of education),School of Electronics Engineering and Computer Science,peking University,beijing 100871,china 1. key laboratory of {2. perception (ministry of education) School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

Mining frequent itemsets has emerged as a fundamental problem in data mining and plays an essential role in many important data mining *** this paper,we propose a novel vertical data representation called N-list,which originates from an FP-tree-like coding prefix tree called PPC-tree that stores crucial information about frequent *** on the N-list data structure,we develop an efficient mining algorithm,PrePost,for mining all frequent *** of PrePost is achieved by the following three ***,N-list is compact since transactions with common prefixes share the same nodes of the ***,the counting of itemsets’ supports is transformed into the intersection of N-lists and the complexity of intersecting two N-lists can be reduced to O(m + n) by an efficient strategy,where m and n are the cardinalities of the two N-lists ***,PrePost can directly find frequent itemsets without generating candidate itemsets in some cases by making use of the single path property of *** have experimentally evaluated PrePost against four state-of-the-art algorithms for mining frequent itemsets on a variety of real and synthetic *** experimental results show that the PrePost algorithm is the fastest in most *** though the algorithm consumes more memory when the datasets are sparse,it is still the fastest one.

关键词： data mining frequent itemset mining data structure N-lists algorithm

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Mining geographic episode association patterns of abnormal events in global earth science data

引用

Science china(Technological Sciences) 2008年第S1期51卷 155-164页

作者： WU TianShu,SONG GuoJie,MA XiuJun,XIE KunQing,GAO XiaoPing & JIN XingXing key laboratory of {2. perception,ministry of education,and Department of {2. Intelligence,peking University,beijing 100871,china 1. key laboratory of {2. perception Ministry of Education and Department of Machine Intelligence Peking University Beijing 100871 China

Abnormal events in earth science have great influence on both the natural envi-ronment and the human society. Finding association patterns among these events has great significance. Because data in earth science has characteristics of mass,high dimension,spatial autocorrelation and time delay,existing mining technolo-gies cannot be directly used on it. We propose a RSNN (range-based searching nearest neighbors) spatial clustering algorithm to reduce the data size and auto-correlation. Based on the clustered data,we propose a GEAM (geographic episode association pattern mining) algorithm which can deal with events time lags and find interesting patterns with specific constraints,to mine the association patterns. We carried out experiments on global climate datasets and found many interesting association patterns. Some of the patterns are coincident with known knowledge in climate science,which indicates the correctness and feasibilities of our methods,and the others are unknown to us before,which will give new information to this research field.

关键词： abnormal events association patterns high dimensional clustering earth science data

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Further results on the margin explanation of boosting:new algorithm and experiments

引用

Science china(Information Sciences) 2012年第7期55卷 1551-1562页

作者： WANG LiWei 1,DENG XiaoCheng 2.,JING ZhaoXiang 1 & FENG JuFu 1 1 key laboratory of {2. perception,MOE,peking University,beijing 100871,china 2.Microsoft Search Technology Center Asia,beijing 100080,china 1. key laboratory of {2. perception MOE Peking University Beijing 100871 China2. Microsoft Search Technology Center Asia Beijing 100080 China

Understanding the empirical success of boosting algorithms is an important theoretical problem in machine *** of the most influential works is the margin theory,which provides a series of upper bounds for the generalization error of any voting classifier in terms of the margins of the training *** an equilibrium margin (Emargin) bound which is sharper than previously well-known margin bounds is *** this paper,we conduct extensive experiments to test the Emargin ***,we develop an efficient algorithm that,given a boosting classifier (or a voting classifier in general),learns a new voting classifier which usually has a smaller Emargin *** then compare the performances of the two classifiers and find that the new classifier often has smaller test errors,which agrees with what the Emargin theory predicts.

关键词： boosting margin Emargin theory

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Consensus of high-order dynamic multi-agent systems with switching topology and time-varying delays

引用

控制理论与应用（英文版） 2010年第1期8卷 52-60页

作者： Fangcui JIANG,Long WANG,Guangming XIE(Institute of Intelligent Engineering,Center for Systems and Control,College of Engineering,and key laboratory of {2. perception(ministry of education),peking University,beijing 100871,china) Institute of Intelligent Engineering Center for Systems and Control College of Engineering and Key Laboratory of Machine Perception (Ministry of Education) Peking University Beijing China

This paper studies the consensus problems for a group of agents with switching topology and time-varying communication delays, where the dynamics of agents is modeled as a high-order integrator. A linear distributed consensus protocol is proposed, which only depends on the agent＇s own information and its neighbors＇ partial information. By introducing a decomposition of the state vector and performing a state space transformation, the closed-loop dynamics of the multi-agent system is converted into two decoupled subsystems. Based on the decoupled subsystems, some sufficient conditions for the convergence to consensus are established, which provide the upper bounds on the admissible communication delays. Also, the explicit expression of the consensus state is derived. Moreover, the results on the consensus seeking of the group of high-order agents have been extended to a network of agents with dynamics modeled as a completely controllable linear time-invariant system. It is proved that the convergence to consensus of this network is equivalent to that of the group of high-order agents. Finally, some numerical examples are given to demonstrate the effectiveness of the main results.

关键词： Consensus problems Distributed control Multi-agent systems Switching topology Time-varying delays Lyapunov-Krasovskii approach

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Laplacian smoothing transform for face recognition

引用

Science china(Information Sciences) 2010年第12期53卷 2415-2428页

作者： GU SuiCheng, TAN Ying & HE XinGui key laboratory of {2. perception (MOE) Department of {2. Intelligence, School of Electronics Engineering and Computer Science peking University, beijing 100871, china 1. key laboratory of {2. perception (MOE) Department of machine Intelligence School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

In this paper, we investigate how to extract the lowest frequency features from an image. A novel Laplacian smoothing transform (LST) is proposed to transform an image into a sequence, by which low frequency features of an image can be easily extracted for a discriminant learning method for face recognition. Generally, the LST is able to be an efficient dimensionality reduction method for face recognition problems. Extensive experimental results show that the LST method performs better than other pre-processing methods, such as discrete cosine transform (DCT), principal component analysis (PCA) and discrete wavelet transform (DWT), on ORL, Yale and PIE face databases. Under the leave one out strategy, the best performance on the ORL and Yale face databases is 99.75% and 99.4%; however, in this paper, we improve both to 100% with a fast linear feature extraction method for the first time.

关键词： Laplacian smoothing transform (LST) face recognition principal component analysis (PCA) discrete cosine transform (DCT) discrete wavelet transform (DWT) linear discriminant analysis (LDA)

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Capability description and discovery of Internetware entity

引用

Science china(Information Sciences) 2010年第4期53卷 685-703页

作者： WANG PuWei1*, JIN Zhi2.3* & LIU HongYan4 1key laboratory of Data Engineering and Knowledge Engineering of the{2., Renmin University of china, beijing 100872. china 2.0} laboratory of High Confidence Software Technologies of the{2., peking University, beijing 100871, china 3Academy of Mathematics and System Sciences, Chinese Academy of Sciences, beijing 100190, china 4Department of Management Science and Engineering, Tsinghua University, beijing 100084, china 1. key laboratory of Data Engineering and Knowledge Engineering of the{2. Renmin University of China Beijing 100872 China2. Key Laboratory of High Confidence Software Technologies of the Ministry of Education Peking University Beijing 100871 China3. Academy of Mathematics and System Sciences Chinese Academy of Sciences Beijing 100190 China4. Department of Management Science and Engineering Tsinghua University Beijing 100084 China

Internetware can be formed through aggregation of Internetware entities bottom-up to satisfy the user's requirements. In the process, capability description of Internetware entity plays an important role. This paper proposes a capability description of Internetware entity based on environment ontology. The environment ontology includes environment entities and possible interactions with the environment entities in a particular domain. Tree-like hierarchical state machines are also included in the ontology to describe domain life-cycle of the environment entities. On the basis of the ideas, the capability of Internetware entity is embodied by interacting with environment entities and the changes of the environment entities during the interactions. Finally, this paper describes the matchmaking between capability descriptions of Internetware entities to support the discovery of Internetware entity. An example of online education course is given to illustrate the ideas.

关键词： Internetware capability description domain environment ontology tree-like hierarchical state machine

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

ViWoSG:A distributed scene graph of ultra-massive distributed virtual environments

引用

Science in china(Series F) 2009年第3期52卷 457-469页

作者： WANG GuoPing, LI Sheng, WANG ShaoRong, LU Bin & LI WenHang key Lab of machine {2. and Intelligent, MOE Department of Computer Science, peking University, beijing 100871, china key Lab of machine {2. and Intelligent MOE Beijing China Department of Computer Science Peking University Beijing 100871 China

An ultra-massive distributed virtual environment generally consists of ultra-massive terrain data and a large quantity of objects and their attribute data, such as 2./3D geometric models, audio/video, images, vectors, characteristics, etc. In this paper, we propose a novel method for constructing distributed scene graphs with high extensibility. This method can support high concurrent interaction of clients and implement various tasks such as editing, querying, accessing and motion controlling. Some application experiments are performed to demonstrate its efficiency and soundness.

关键词： VR distributed system scene graph ultra-massive distributed scene graph

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A new method for adaptive color image filtering

引用

Chinese Science Bulletin 2000年第13期45卷 1230-1235页

作者： JIANG Gangyi, YU Mei & YU Bokang1. Department, of Information & Electronic Engineering, Hang/hou University of Commerce, Hangzhou 310035, china 2. Department, of Electronic Engineering, Hangzhou institute of Electronics Engineering, Hangzhou 310037, china 3. State {2. laboratory on machine perception, peking University, beijing 100871, china Correspondence should be addressed to Yu Mei Department of Information & Electronic Engineering Hangzhou University of Commerce Hangzhou China State key laboratory on {2. perception Peking University Beijing China Department of Electronic Engineering Hangzhou Institute of Electronics Engineering Hangzhou China

An adaptive color image filter (ACIF) is proposed in this note. Through analyzing noise corruption of color image, efficient locally adaptive filters are chosen for image enhancement. The proposed adaptive color image filter combines advantages of both nonlinear vector filters and linear filters, it attenuates noise and preserves edges and details very well. Experimental results show that the proposed filter performs better than vector median filter, directional-distance filter, directional-magnitude vector filter, adaptive nearest-neighbor filter, and α-trimmed mean filter.

关键词： color image noise analysis locally adaptive filters adaptive color image filter (ACIF).

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Effects of task demand and contextual expectancy on sentence comprehension:Evidence from P600 in brain potentials

Effects of task demand and contextual expectancy on sentence...

引用

第十二届全国心理学学术大会

作者： Xiaoming Jiang~1,Jia Li~1,Xiaolin Zhou~(1,2.3) 1 Center for Brain and Cognitive Sciences and Department of Psychology,peking University,beijing {2., china, 2.key laboratory of machine perception,ministry of education, 3 key laboratory of Computational Linguistics,ministry of education, peking University,beijing {2.,china,

Three ERP(event - related potential) experiments were conducted to examine the effects of task demand and contextual expectancy on sentence *** with the structure"subject noun + verb + adjective + object noun"were *** contextual expectancy towards the object noun was either high or low and the semantic relationship between the object noun and the preceding adjective was either maintained or mismatched. In Experiment 1,participants were asked to read sentences and make semantic plausibility judgment to each of *** addition to a N400 effect,the mismatching object noun elicited a P600 effect as compared with the matching noun,but this effect appeared in sentences with high expectancy,not in sentences with low *** Experiment 2.participants were asked to read sentences for comprehension and to complete an

关键词： P600 sentence comprehension task demand contextual expectancy

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：