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

International Conference on Computing, Management and Telecommunications (ComManTel)

作者： Truong Dinh Tu Cheng Guang Liang Yi Xin School of Computer Science and Engineering Southeast University Nanjing China Department of Information Technologies Tuyhoa Industrial College Phuyen Vietnam Ministry of Education Key Laboratory of Computer Network and Information Integration Nanjing China

Modern botnets such as Zeus and Conficker commonly utilize a technique called domain fluxing or a Domain Generation Algorithm (DGA) to generate a large number of pseudo-random domain names dynamically for botnet operators to control their bots. These botnets are becoming one of the most serious threats to the Internet security on a global scale. In this paper, we present a method based on analyzing the similar periodic time intervals series of DNS queries to identify DGA-bot infected machines. This method passively captures all DNS traffic from the gateway of monitor network. Firstly, we group queries of the same domain name that is requested by hosts, and then extracts time interval series between adjacent queries. Secondly, we measure the similar periodicity of DNS queries by calculating the squared Euclidean distance between each pair of their time interval series. Finally, we apply a hierarchical clustering algorithm to cluster high similar domain names. The experiment results show that the domain names are generated by the same botnet or DGA would be grouped into the same cluster, thus all of the hosts that query to these clusters are marked as compromised hosts running a domain-flux botnet within monitor network.

关键词： Correlation Servers Monitoring Time measurement Clustering algorithms Time series analysis Euclidean distance

来源：评论

学校读者我要写书评

暂无评论

Grover algorithm for multi-objective searching with iteration auto-controlling

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8794卷 357-364页

作者： Zhu, Wanning Chen, Hanwu Liu, Zhihao Xue, Xilin Department of Computer Science and Engineering Southeast University Nanjing211189 China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing211189 China

This paper presents an improved Grover searching algorithm [1] which can auto-control the iterative processing when the number of target states is unknown. The final amplitude of the target states will be decreased if this number is unknown. So the question is how to perform Grover searching algorithm without the number of target states? As for this question, there are two conventional solutions. One solution tries to find the number of target states before performing the original algorithm. The other solution guesses a random k as the number of target states before performing the original algorithm. Both the two solutions need O(√N) additional times Oracle calls than original algorithm and the answer of the first solution is non-deterministic while the second solution needs to check the correctness of the result. Assuming an operator which can judge the sign of the phases of superposition state, based on this technical, this paper shows a novel solution, which can perform Grover searching algorithm even if the number of target states is unknown. This solution only needs adding one gate, which can judge the sign of phase, and one more time Oracle call than the original algorithm. © 2014 Springer International Publishing Switzerland.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

A novel PSO for portfolio optimization based on heterogeneous multiple population strategy

A novel PSO for portfolio optimization based on heterogeneou...

引用

Congress on Evolutionary Computation

作者： Xushan Yin Qingjian Ni Yuqing Zhai College of Software Engineering Southeast University Nanjing China MOE Key Lab of Computer Network & Information Integration P.R.China

ISBN: (纸本)9781479974931

The problem of portfolio selection in the field of financial engineering has received more attention in recent years. This paper presents a novel heterogeneous multiple population particle swarm optimization algorithm (HMPPSO) for solving a generalized Markowitz mean-variance portfolio selection model. The proposed HMPPSO is based on heterogeneous multiple population strategy, in which the whole population is divided into several sub-populations and all the sub-populations evolve with different PSO variants. The communication between the sub-populations is executed at regular intervals to maintain the information exchange inside the entire population and coordinate exploration and exploitation according to certain migration rules. The generalized portfolio selection model is classified as a quadratic mixed-integer programming model for which no computational efficient algorithms have been proposed. We employ the proposed HMPPSO to find the solution for the model and compare the performance of HMPPSO with several classic PSO variants. The test data set is the weekly prices from March, 1992 to September, 1997 including the following indices: Hang Seng in Hong Kong, DAX 100 in Germany, FTSE 100 in UK, S&P 100 in USA and Nikkei 225 in Japan. The computational results demonstrate that HMPPSO is much effective and robust, especially for problems with high dimensions, thus provides an effective solution for the portfolio optimization problem.

关键词： Portfolios Sociology Statistics Optimization Computational modeling Standards Particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

PBNA: An Improved Probabilistic Biological network Alignment Method

引用

Tsinghua Science and Technology 2014年第6期19卷 658-667页

作者： Muwei Zhao Wei Zhong Jieyue He School of Computer Science and Engineering and also with MOE Key Laboratory of Computer Network and Information IntegrationSoutheast University Division of Math and Computer Science University of South Carolina Upstate Spartanburg SC 29303USA

Biological network alignment is an important research topic in the field of bioinformatics. Nowadays almost every existing alignment method is designed to solve the deterministic biological network alignment ***, it is worth noting that interactions in biological networks, like many other processes in the biological realm,are probabilistic events. Therefore, more accurate and better results can be obtained if biological networks are characterized by probabilistic graphs. This probabilistic information, however, increases difficulties in analyzing networks and only few methods can handle the probabilistic information. Therefore, in this paper, an improved Probabilistic Biological network Alignment（PBNA） is proposed. Based on Iso Rank, PBNA is able to use the probabilistic information. Furthermore, PBNA takes advantages of Contributor and Probability Generating Function（PGF） to improve the accuracy of node similarity value and reduce the computational complexity of random variables in similarity matrix. Experimental results on dataset of the Protein-Protein Interaction（PPI） networks provided by Todor demonstrate that PBNA can produce some alignment results that ignored by the deterministic methods, and produce more biologically meaningful alignment results than Iso Rank does in most of the cases based on the Gene Ontology Consistency（GOC） measure. Compared with Prob method, which is designed exactly to solve the probabilistic alignment problem, PBNA can obtain more biologically meaningful mappings in less time.

关键词： probabilistic biological network network alignment protein interaction network

来源：评论

学校读者我要写书评

暂无评论

Statistical error analysis of HTL algorithm via LTO and RO stability hypothesis

引用

Journal of information and Computational Science 2014年第16期11卷 5765-5773页

作者： Wu, Jianzhang Yu, Xiao Gao, Wei School of Computer Science and Engineer Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing China School of Continuing Education Southeast University Nanjing China School of Information Yunnan Normal University Kunming China

There are abundant parameters to estimate if training and testing samples are drawn from the different probability distribution in supervised machine learning algorithm setting. Hypothesis transfer learning is a trick to get over this limitation in practical engineering, and the source hypotheses trained on a source domain can only be utilized. In this paper, we define the LTO and RO stability hypothesis for hypothesis transfer learning algorithm, and the statistical error is bounded in terms of these stability hypotheses.

关键词： Stability

来源：评论

学校读者我要写书评

暂无评论

The 5th International Conference on Biomedical Engineering and Biotechnology (ICBEB 2016) Abstracts

引用

BMC MEDICAL IMAGING 2016年第SUPPL 1期16卷 65-65页

作者： [Anonymous] Department of MRI Shandong Medical Imaging Research Institute Affiliated to Shandong University Jinan Shandong 250021 People’s Republic of China Department of Interventional Radiology Shandong Provincial Hospital Affiliated to Shandong University Jinan Shandong 250021 People’s Republic of China College of Information Science and Technology Engr. Research Center of Digitized Textile & Fashion Tech. for Ministry of Education Donghua University Shanghai 201620 China Intelligent multimedia information processing Lab College of Software Northeastern University Shenyang Liaoning Province 110004 China Institute of Biomedical and Health Engineering Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen 518055 China School of Computer Science and Technology Nanjing Normal University Nanjing China Department of Electrical Engineering The City College of New York CUNY New York USA Jiangsu Key Laboratory of 3D Printing Equipment and Manufacturing Nanjing China School of Electronic Science and Engineering Nanjing University Nanjing Jiangsu 210046 China College of Engineering Nanyang Technological University Singapore 639798 Singapore School of Electronic Information Shanghai Dianji University Shanghai China School of Natural Sciences and Mathematics Shepherd University Shepherdstown WV 25443 USA Davis College of Agriculture Natural Resources and Design West Virginia University Morgantown WV 26505 USA State Key Laboratory of Millimeter Waves Southeast University Nanjing 210096 China Center of Medical Physics and Technology Hefei Institutes of Physical Science Chinese Academy of Sciences Hefei China College of Agricultural and Life Sciences University of Florida Gainesville FL 32611 USA Courant Institute of Mathematical Sciences New York University New York NY 10012 USA Translational Imaging Division & MRI Unit Columbia University and New York State Psychiatric Institute New York NY 10032 USA Guangxi Key Laboratory of Manufacturing System & Adv

来源：评论

学校读者我要写书评

暂无评论

Bilinear model for ontology mapping

引用

computer Modelling and New Technologies 2014年第8期18卷 368-372页

作者： Wu, Jian-Zhang Xiao, Yu Gao, Wei School of Computer Science and Engineer Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing China School of Continuing Education Southeast University Nanjing China School of Information Science and Technology Yunnan Normal University Kunming China

As a model of concept representation, ontology has widely applied to various disciplines. Ontology mapping is used to create the link between different ontologies. In this paper, we present a new ontology mapping algorithm by virtue of bilinear model. The linear mapping pair is given by the iterative procedure. Two strategies are manifested to obtain the finally ontology mapping. The simulation experimental results show that the proposed new technologies have high accuracy and efficiency on ontology mapping in certain applications.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Disambiguation-free partial label learning 14

Disambiguation-free partial label learning

引用

14th SIAM International Conference on Data Mining, SDM 2014

作者： Zhang, Min-Ling School of Computer Science and Engineering MOE Key Laboratory of Computer Network and Information Integration Southeast University Nanjing210096 China

ISBN: (纸本)9781510811515

Partial label learning deals with the problem where each training example is associated with a set of candidate labels, among which only one is correct. The common strategy is to try to disambiguate their candidate labels, such as by identifying the ground-truth label iteratively or by treating each candidate label equally. Nevertheless, the above disambiguation strategy is prone to be misled by the false positive label(s) within candidate label set. In this paper, a new disambiguation-free approach to partial label learning is proposed by employing the well-known error-correcting output codes (ECOC) techniques. Specifically, to build the binary classifier with respect to each column coding, any partially labeled example will be regarded as a positive or negative training example only if its candidate label set entirely falls into the coding dichotomy. Experiments on controlled and real-world data sets clearly validate the effectiveness of the proposed approach. Copyright © SIAM.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Conflict Resolution in Partially Ordered OWL DL Ontologies 21

Conflict Resolution in Partially Ordered OWL DL Ontologies

引用

21st European Conference on Artificial Intelligence (ECAI)

作者： Ji, Qiu Gao, Zhiqiang Huang, Zhisheng School of Computer Science and Engineering Southeast University Key Laboratory of Computer Network and Information Integration China Department of Mathematics and Computer Science Vrije University Amsterdam Netherlands

ISBN: (纸本)9781614994190;9781614994183

Inconsistency handling in OWL DL ontologies is an important problem because an ontology can easily be inconsistent when it is generated or modified. Current approaches to dealing with inconsistent ontologies often assume that there exists a total order over axioms and use such an order to select axioms to remove. However, in some cases, such as ontology merging, a total order may not be available and we only have a partial order over axioms. In this paper, we consider a general notion of logical inconsistency and define the notion of conflict of an inconsistent ontology. We then propose a general approach to resolving inconsistency of a partially ordered ontology. We instantiate this approach by proposing two algorithms to calculate prioritized hitting sets for a set of conflicts. We implement the algorithms and provide evaluation results on the efficiency and effectiveness by considering both artificial and real-life data sets.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of two-hop-relay cellular systems with queueing capability

Performance analysis of two-hop-relay cellular systems with ...

引用

2015 International Conference on information and Communications Technologies, ICT 2015

作者： Lu, Weifeng Gu, Mengmeng Yang, Luxi College of Computer Nanjing University of Posts and Telecommunications Nanjing210023 China School of Information Science and Engineering SouthEast University Nanjing210096 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing Jiangsu210023 China Key Lab of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Jiangsu Province Nanjing Jiangsu210023 China

ISBN: (纸本)9781849199940

In this paper, we present a two-hop-relay WCDMA cellular system with queueing capability, where a call can wait in the incoming buffer at the congested Base Transceiver Station (BTS) if no channel is immediately available, so as to reduce the call blocking rate. We develop an analytic model based on Multidimensional Markov chains. Then based on this model, we can obtain the average transmission rate and the queuing delay performance of the system respectively. Finally, through numerical calculation, we analyze the impact of the various parameters on the performance of the two-hop-relay WCDMA cellular system with queueing capability.

关键词： Queueing theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：