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

International Conference on networked Computing (INC)

作者： N. Sarnsuwan C. Charnsripinyo N. Wattanapongsakorn Computer Engineering Department King Mongkut''s University of Technology Thonburi Bangkok Thailand Network Technology Laboratory National Electronics and Computer Technology Center Klong Luang Pathum Thani Thailand

ISBN: (纸本)9781424469864;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.

关键词： Internet computer worms IP networks Data mining Telecommunication traffic Intrusion detection computer networks Support vector machines Support vector machine classification Bayesian methods

来源：评论

学校读者我要写书评

暂无评论

An effective simple method to reduce bandwidth usage over an access link in IPTV multicast delivery services

An effective simple method to reduce bandwidth usage over an...

引用

IEEE Region 10 International Conference TENCON

作者： Masao Ikezaki Takeshige Sugahara Masayoshi Shimamura Takeshi Ikenaga Department of Electrical Electronic and Computer Engineering Kyushu Institute of Technology Fukuoka Japan Network Design Research Center Kyushu Institute of Technology Fukuoka Japan

In this paper, an effective simple method for reducing bandwidth usage over an access link in the IPTV multicast delivery services is proposed. The IPTV services are required to meet rapid channel switching as well as conventional analog TV services, but these services encounter issues to achieve rapid channel switching. One of significant problems is overloaded bandwidth consumption due to repeated channel switching behavior by users' channel request. This problem is caused by multicast leave processing, i.e., edge routers (ER) cannot stop transmission immediately due to the leave processing, so that ERs are required to stop unnecessary distributions. The feature of our proposed method is a reduction of bandwidth usage for transmitting IP multicast packets on the access link between ER and home access gateways (HG). We show effectiveness of the proposed method and efficiency of simple algorithm from the perspective of practical level through simulation evaluations.

关键词： Bandwidth Switches Erbium IPTV Delay Servers Mercury (metals)

来源：评论

学校读者我要写书评

暂无评论

Liu et al. reply.

引用

Nature 2011年第7369期478卷 E4-E5页

作者： Liu, Yang-Yu Slotine, Jean-Jacques Barabási, Albert-László 1 1] Center for Complex Network Research and Departments of Physics Computer Science and Biology Northeastern University Boston Massachusetts 02115 USA Center for Cancer Systems Biology Dana-Farber Cancer Institute Boston Massachusetts 02115 USA 2 1] Nonlinear Systems Laboratory Massachusetts Institute of Technology Cambridge Massachusetts 02139 USA Department of Mechanical Engineering and Department of Brain and Cognitive Sciences Massachusetts Institute of Technology Cambridge Massachusetts 02139 USA 3 1] Center for Complex Network Research and Departments of Physics Computer Science and Biology Northeastern University Boston Massachusetts 02115 USA Department of Medicine Brigham and Women's Hospital Harvard Medical School Boston Massachusetts 02115 USA

Replying to F.-J. Müller & A. Schuppert Nature 478, 10.1038/nature10543 (2011) Müller and Schuppert1 describe an exception to our finding2 that roughly 80% of the nodes must be controlled to gain full control over gene regulatory networks. Yet our result hides subtleties that reveal as much about controllability as about the limits of our current understanding of biological networks.

关键词： Physics Applied physics and engineering

来源：评论

学校读者我要写书评

暂无评论

Coalition Formation Games for Improving Data Delivery in Delay Tolerant networks

Coalition Formation Games for Improving Data Delivery in Del...

引用

2010 IEEE Global Telecommunications Conference GLOBECOM 2010

作者： Dusit Niyato Ping Wang Walid Saad Are Hjorungnes Center of Multimedia and Network Technology (CeMNet) School of Computer Engineering Nanyang Technological University Singapore UNIK-University Graduate Center University of Oslo Kjeller Norway

Delay tolerant networks (DTNs) can be composed of multiple heterogeneous groups (i.e., communities) of nodes. The nodes from these communities can cooperate with each other in order to carry and forward data packets so that the performance (e.g., delay) can be improved. However, this cooperation will incur additional cost on the nodes. In this paper, we first develop an analytical model to investigate the performance gain from cooperation of multiple communities in a DTN. Then, we propose a coalitional game model for analyzing the cooperation decisions of multiple rational communities based on the tradeoff between performance gains and associated costs. As a solution to the proposed game, we determine the stable coalitional structure, i.e., the structure where no community can improve its payoff by changing its cooperation decisions. The proposed analytical and game models will be useful for the performance and cost optimization of multi-community DTNs.

关键词： Communities Peer to peer computing Delay Markov processes Games Analytical models Throughput

来源：评论

学校读者我要写书评

暂无评论

News filtering and summarization on the Web

News filtering and summarization on the Web

引用

作者： Wu, Xindong Wu, Gong-Qing Xie, Fei Zhu, Zhu Hu, Xue-Gang Lu, Hao Li, Huiqian School of Computer Science and Information Engineering Hefei University of Technology China Zhejiang Taobao Network China Key Laboratory of Complex Systems and Intelligence Science Institute of Automation Chinese Academy of Sciences China Center for Social Computing and Parallel Systems Institute of Automation Chinese Academy of Sciences China

The news filtering and summarization (NFAS) system can automatically recognize Web news pages, retrieve each news page's title and news content, and extract key phrases. This extraction method substantially outper...

关键词：

来源：评论

学校读者我要写书评

暂无评论

Graph cut-based fast texture synthesis with CUDA

Graph cut-based fast texture synthesis with CUDA

引用

International Conference on computer Design and Applications (ICCDA)

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

ISBN: (纸本)9781424471645;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.

关键词： Acceleration network synthesis Tiles computer graphics Optimization methods Concurrent computing Runtime Design engineering Telecommunication computing Image processing

来源：评论

学校读者我要写书评

暂无评论

Validating SERVQUAL in information system empirical results from an e-learning system

Validating SERVQUAL in information system empirical results ...

引用

International Conference on Information Science and engineering (ICISE)

作者： Ruobin Wang Mengmeng Zhang Shilai Ma School of Management and Economics Beijing Institute of Technology Computer and Network Center North-China University of Technology Beijing China College of Information Engineering North-China University of Technology Beijing China

User's experiences are affected by service quality of information systems. Hence, measurement on information system service quality is urgently needed for the related quantitative research. An empirical study is proceeded to validate an IS-adapted SERVQUAL model in the context of e-learning system use. The data from a survey on e-learning system users are employed to validate the model with confirmatory factor analysis. Results show that the IS-adapted SERVQUAL model bears good fitness and effectiveness, and it can be used in future research relating to service quality.

关键词： Electronic learning Context Adaptation model Reliability Data analysis Correlation

来源：评论

学校读者我要写书评

暂无评论

Enhancing fairness: A novel C2C e-commerce community member reputation algorithm based on transaction social networks

Enhancing fairness: A novel C2C e-commerce community member ...

引用

IADIS International Conference WWW/Internet 2010

作者： Feng, Wangsen Zhang, Bei Xia, Yunni Li, Jiajing Meng, Tao Key Laboratory of Network and Software Security Assurance of Ministry of Education Computing Center Peking University Beijing 100871 China College of Computer Science Chongqing University Chongqing 400044 China School of Mechanical Electronic and Information Engineering China University of Mining and Technology Beijing 100083 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9789728939250

Today, almost all the C2C e-commerce community member reputation evaluating algorithms are time sensitive. The reputation of a community member is accumulated after transactions and the increment of reputation after a successful transaction is computed based on the score given by his or her transaction partner. Since people always tend to do business with those with high reputation value, the reputation of members joined in C2C community at different time will vary greatly although they may provide the same commodity quality and service. It is unfair to new comers. In this paper, we propose a novel algorithm to overcome the shortcoming. Based on the transaction social network, our algorithm employs the random walk strategy to compute member reputation and enhance system fairness. © 2010 IADIS.

关键词： Electronic commerce

来源：评论

学校读者我要写书评

暂无评论

Using an integrated feature set to generalize and justify the Chinese-to-English transferring rule of the 'ZHE' aspect

引用

Journal of Zhejiang University-Science C(computers and Electronics) 2010年第9期11卷 663-676页

作者： Yun-hua QU Tian-jiong TAO Serge SHAROFF Narisong JIN Ruo-yuan GAO Nan ZHANG Yu-ting YANG Cheng-zhi XU School of International Studies Zhejiang University Hangzhou 310058 China Institute of Fluid Physics China Academy of Engineering Physics Mianyang 621900 China Center for Translation Studies University of Leeds Leeds LS2 9JT UK Center for Applied Linguistics Hangzhou Normal University Hangzhou 310012 China School of Computer Science and Technology Zhejiang University Hangzhou 310027 China Sensor Network and Application Research Center Graduate School Chinese Academy of Sciences Beijing 100049 China School of Economics Zhejiang University Hangzhou 310027 China Zhejiang University City College Hangzhou 310015 China

In machine translation(MT) practice,there is an urgent need for constructing a set of Chinese-to-English aspect transferring rules to define the transferring *** integrated feature set was used to generalize and justify the Chinese-to-English transferring rule of the 'ZHE' aspect(ZHE Rule).A ZHE classification model was built in this *** impacts of each set of temporal,lexical aspectual,and syntactic features,and their integrated impacts,on the accuracy of the ZHE Rule were *** 600 misclassified corpus sentences were manually examined.A 10-fold cross-validation was used with a decision tree *** main results are:(1) The ZHE Rule was generalized and justified to have a higher accuracy under the two metrics:the precision rate and the areas under the receiver operating characteristic curve(AUC).(2) The temporal,lexical aspectual,and syntactic feature sets have an integrated contribution to the accuracy of the ZHE *** syntactic and temporal features have an impact on ZHE aspect derivations,while the lexical aspectual features are not predictive of ZHE aspect derivation.(3) While associated with active verbs,the ZHE aspect can denote a perfective *** study suggests that the temporal and syntactic features are the predictive ZHE aspect classification features and that the ZHE Rule with an overall precision rate of 80.1% is accurate enough to be further explored in MT *** machine learning method,decision tree,can be applied to the automatic aspect transferring in MT research and aspectual interpretations in linguistic research.

关键词： ZHE aspect transferring rule(ZHE Rule) Machine learning Decision tree Aspect classification Integrated feature set

来源：评论

学校读者我要写书评

暂无评论

An algorithm of decision tree construction based on attribute support degree

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

引用

International Conference on Educational and Information technology (ICEIT)

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

ISBN: (纸本)9781424480333

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.5.

关键词： Iris Classification tree analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：