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

作者： Liu, Hai Chen, Maobian Department of Computer Engineering and Technology Guangdong Institute of Science and Technology Zhuhai Guangdong 519090 China Network Center Guangzhou Productivity Promotion Center Guangzhou 510030 China

ISBN: (纸本)9781424465408

with the fact of rapid development of the World Wide Web, the web usage has imposed a heavy load on the network and server infrastructure, and significant delays are not uncommon. To mitigate the effects of these increased usages, there has been much research and work in web caching. Web caching reduces network load, server load, and the latency of responses. However, one main disadvantage of web caching is that a stale page might be returned to clients if the origin version has changed and there is no consistency mechanism to maintain. In this paper, we present a survey of contemporary cache consistency mechanisms in use on the Web today and examine recent research in web cache consistency. In addition, we analyze the performance of each algorithm of caching consistency using communication traffic model in details. © 2010 IEEE.

关键词： Cache Consistency Web

来源：评论

学校读者我要写书评

暂无评论

Attribute-Based Signature with Policy-and-Endorsement Mechanism

引用

Journal of computer Science & technology 2010年第6期25卷 1293-1304页

作者：王怀习朱岩冯荣权 Stephen S.Yau LMAM School of Mathematical SciencesPeking University Electronic Engineering Institute Institute of Computer Science and Technology Peking University Key Laboratory of Network and Software Security Assurance (Peking University) Ministry of Education Information Assurance Center and School of Computing Informatics and Decision Systems Engineering Arizona State University

In this paper a new signature scheme,called Policy-Endorsing Attribute-Based Signature,is developed to correspond with the existing Ciphertext-Policy Attribute-Based *** signature provides a policy-and-endorsement *** this mechanism a single user,whose attributes satisfy the predicate,endorses the *** signature allows the signer to announce his endorsement using an access policy without having to reveal the identity of the *** security of this signature,selfless anonymity and existential unforgeability,is based on the Strong Diffie-Hellman assumption and the Decision Linear assumption in bilinear map groups.

关键词： cryptography fine-grained access control attribute-based signature policy-and-endorsement selfless anonymity existential unforgeability

来源：评论

学校读者我要写书评

暂无评论

Optimization of probabilistic neural networks based on center neighbor

Optimization of probabilistic neural networks based on cente...

引用

International Conference on E-Business and E-Government

作者： Liu, Lianzhong Li, Chunfang Qian, Lipu Key Laboratory of Beijing Network Technology School of Computer Science and Engineering Beihang University Beijing China Network Center Heibei Institute of Physical Education Beihang University Beijing China Network Center Heibei Institute of Physical Education Shijiazhuang China

ISBN: (纸本)9780769539973

Probabilistic Neural networks (PNN) learn quickly from examples in one pass and asymptotically achieve the Bayes-optimal decision boundaries. The major disadvantage of PNN is that it requires one node or neuron for each training sample. Various clustering techniques have been proposed to reduce this requirement to one node per cluster center. Decision boundaries of clustering centers are approximation to training samples. A new optimization of PNN is investigated here using iteratively computing the centers of each class samples unrecognized and add the nearest neighbors to pattern layer. This algorithm takes into account not only the approximation of probability density but also the necessary of classification. For compensating the loss of generalization accuracy to some degree, ensemble learning technique is introduced to boost the accuracy in test dataset. Experiments on UCI show the appropriate tradeoff in training time, number of nodes and generalization ability. © 2010 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

The research of information security risk assessment method based on fault tree

The research of information security risk assessment method ...

引用

作者： Tao, Huang Xiao Liang, Cai Chi, Wu Qun, Huang Li Network and Computer Center Huazhong University of Science and Technology Wuhan China School of Software Engineering Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9788988678251

Fault tree technology has been broadly used in the industry system but seldom used in the field of risk assessment for information system. In this study, by consulting the standard of BS7799, the fault tree technology is introduced to evaluate the risks of information system. Based on integrity, usability and confidentiality of information system, fault tree model for the information system is established. This model can quantitatively calculate the risk faced by the system;tree framework structure was adopted to analyze faults, which can be easily understood and programmed;Importance of every bottom faults was carefully analyzed, which offers the new model and effective implementation for the risk analysis and the searching of fault sources. In this research, an idiographic example was used to demonstrate the method and to validate the algorithms.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

An algorithm of decision tree construction based on attribute support degree

An algorithm of decision tree construction based on attribut...

引用

2010 International Conference on Educational and Information technology, ICEIT 2010

作者： Lin, Qing Ding, Zongzhuan Yong, Jianping Zhou, Jun School of Computer Science and Telecommunications Engineering Jiangsu University Zhenjiang Jiangsu China School of Computer Science and Technology Nanjing University of Science and Technology Nanjing China Network Center Zhenjiang College Zhenjiang Jiangsu China

ISBN: (纸本)9781424480340

Decision tree algorithms are widely used in data mining and classification systems, because of theirs faster speed, higher accuracy and easier structures. The key to constructing a good decision tree lies in the reasonable choice of attributes. Based on rough set theory and granular computing theory, the paper proposes a concept of attribute support degree to select attributes, using the concept a novel decision tree construction algorithm is presented. The results of experiments on the UCI dataset show that, the decision tree constructed by the new approach tend to have better classification accuracy and stability than ID3 and C4.S. © 2010 IEEE.

关键词： Granular computing

来源：评论

学校读者我要写书评

暂无评论

Considering behavior of sender in spam mail detection

Considering behavior of sender in spam mail detection

引用

6th International Conference on networked Computing, INC2010

作者： Naksomboon, S. Charnsripinyo, C. Wattanapongsakorn, N. Computer Engineering Department King Mongkut's University of Technology Thonburi 126 Pracha-Utid Tung-Kru Bangkok 10140 Thailand Network Technology Laboratory National Electronics and Computer Technology Center Klong Luang Pathumthani 10120 Thailand

ISBN: (纸本)9788988678206

Recently, the number of spam mails is exponentially growing. It affects the costs of organizations and annoying the email recipient. Spammers always try to find the way to avoid filtering out from the email system. At the same time, as an email recipient or network system/administrator, we try to have an effective spam mail filtering technique to catch the spam mails. The problems of spam mail filtering are that each user has different perspective toward spam mails;so there are many types of spam mails, while the challenge is how to detect the various types and forms of spam mails. In this paper, behaviors of spammers are used to customize the filtering rule. The information from the spam messages also can be used to filter spam mails and it can give higher accuracy than the keyword-based method does. We propose a spam classification approach using Random Forest algorithm. Spam Assassin Corpus is selected as a database for classification. It consists of 6,047 email messages, where 4,150 of them are the legitimate messages and the other 1,897 messages are the spam mails.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

A new approach for internet worm detection and classification

A new approach for internet worm detection and classificatio...

引用

6th International Conference on networked Computing, INC2010

作者： Sarnsuwan, N. Charnsripinyo, C. Wattanapongsakorn, N. Computer Engineering Department King Mongkut's University of Technology Thonburi 126 Pracha-Utid Tung-Kru Bangkok 10140 Thailand Network Technology Laboratory National Electronics and Computer Technology Center Klong Luang Pathumthani 10120 Thailand

ISBN: (纸本)9788988678206

To detect internet worm, many academic approaches have been proposed. In this paper, we provide a new approach to detect internet worm. We consider behaviors of internet worm that is different from the normal pattern of internet activities. We consider all network packets before they reach to the end-user by extracting a certain number of features of internet worm from these packets. Our network features mainly consist of characteristics of IP address, port, protocol and some flags of packet header. These features are used to detect and classify behavior of internet worm by using 3 different data mining algorithms which are Bayesian network, Decision Tree and Random Forest. In addition, our approach not only can classify internet worm apart from the normal data, but also can classify network attacks that have similar behaviors to the internet worm behaviors. Our approach provides good results with detection rate over 99.6 percent and false alarm rate is close to zero with Random forest algorithm. In addition, our model can classify behaviors of DoS and Port Scan attacks with detection rate higher than 98 percent and false alarm rate equal to zero.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

Unsupervised ensemble anomaly detection through time-periodical packet sampling

Unsupervised ensemble anomaly detection through time-periodi...

引用

IEEE Conference on computer Communications Workshops, INFOCOM 2010

作者： Nawata, Shuichi Uchida, Masato Gu, Yu Tsuru, Masato Oie, Yuji Graduate School of Computer Science and Systems Engineering Kyushu Institute of Technology Japan Network Design Research Center Kyushu Institute of Technology Japan NEC Laboratories America United States

ISBN: (纸本)9781424467396

We propose an anomaly detection method that trains a baseline model describing the normal behavior of network traffic without using manually labeled traffic data. The trained baseline model is used as the basis for comparison with the audit network traffic. The proposed method can be carried out in an unsupervised manner through the use of time-periodical packet sampling for a different purpose from which it was intended. That is, we take advantage of the lossy nature of packet sampling for the purpose of extracting normal packets from the unlabeled original traffic data. By using real traffic traces, we show that the proposed method is comparable in terms of false positive and false negative rates on detecting anomalies regarding TCP SYN packets to the conventional method that requires manually labeled traffic data to train the baseline model. In addition, in order to mitigate the possible performance variation due to probabilistic nature of sampled traffic data, we devise an ensemble anomaly detection method that exploits multiple baseline models in parallel. Experimental results show that the proposed ensemble anomaly detection performs well and is not affected by the variability of time-periodical packet sampling. ©2010 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A distance-optimized load balancing scheme for network management

A distance-optimized load balancing scheme for network manag...

引用

6th International Conference on networking and Services, ICNS 2010, Includes LMPCNA 2010;INTENSIVE 2010

作者： Sun, Yantao Yang, Fangnan Liu, Qiang Shi, Zhiqiang School of Computer and Information Technology Beijing Jiaotong University Beijing China Multimedia Communication and Network Engineering Research Center Institute of Software Chinese Academy of Sciences Beijing China

ISBN: (纸本)9780769539690

Load balancing is an important factor, which influences the performance of DNMS (distributed network management system). In this paper, a two-layer load balancing scheme is proposed for DNMS based on the latest research works on physical topology. In the scheme, the management tasks are distributed to a number of stations for reducing the burden of center management station, the processing time of every station is balanced to almost equal for fairness and the management tasks are allocated to nearest station for saving bandwidth. Experiments show, compared with the centralized methods and general distributed method, it works stably and save over 26 percent of bandwidth occupied by management data in the testing network. This scheme has been used in an actual application. © 2010 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Graph cut-based fast texture synthesis with CUDA

Graph cut-based fast texture synthesis with CUDA

引用

2010 International Conference on computer Design and Applications, ICCDA 2010

作者： Zou, Kun Xu, Xiang Yang, Liang Li, Yueqiao Zhang, Jun Department of Computer Engineering University of Electronic Science and Technology China Zhongshan Institute Zhongshan China Network Maintenance Center China Telecom Corporation Limited Guangzhou Branch Guangzhou China

ISBN: (纸本)9781424471638

This paper presents a graph cut-based fast texture synthesis algorithm which utilizes CUDA to greatly accelerate the synthesis speed. The whole sample serves as a patch and is laid into the synthesized image repeatedly to build the final texture, and graph cut is used to determine the optimal patch boundaries. To speed up the synthesis speed, the patch locations are only selected based on a small set, which consists of some optimal relative offsets between two patches and is constructed in the preprocessing step. The matching errors during patch selection are also estimated without much computation from the information provided by this step. The graph cut algorithm is implemented every time a patch is laid, resulting in its becoming the bottleneck of the synthesis process. This problem is solved by virtue of the CUDA implementation of the maxflow/mincut algorithm. Graph construction and the preprocessing step are also accelerated with CUDA. The speed of the synthesis is several to dozens of times faster than the traditional algorithm without GPU acceleration. © 2010 IEEE.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：