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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Gradient compared ℓp-LMS algorithms for sparse system identification

Gradient compared ℓp-LMS algorithms for sparse system ident...

引用

Chinese Control and Decision Conference, CCDC

作者： Yong Feng Jiasong Wu Rui Zeng Limin Luo Huazhong Shu School of Biological Science and Medical Engineering Southeast University Nanjing China Laboratory of Image Science and Technology the Key Laboratory of Computer Network and Information Integration Southeast University Nanjing China Laboratory of Image Science and Technology Southeast University Nanjing China

In this paper, we propose two novel p-norm penalty least mean square (ℓ p -LMS) algorithms as supplements of the conventional ℓ p -LMS algorithm established for sparse adaptive filtering recently. A gradient comparator is employed to selectively apply the zero attractor of p-norm constraint for only those taps that have the same polarity as that of the gradient of the squared instantaneous error, which leads to the new proposed gradient compared p-norm constraint LMS algorithm (ℓ p GC-LMS). We explain that the ℓ p GC-LMS can achieve lower mean square error than the standard ℓ p -LMS algorithm theoretically and experimentally. To further improve the performance of the filter, the ℓ p NGC-LMS algorithm is derived using a new gradient comparator which takes the sign-smoothed version of the previous one. The performance of the ℓpNGC-LMS is superior to that of the ℓpGC-LMS in theory and in simulations. Moreover, these two comparators can be easily applied to other norm constraint LMS algorithms to derive some new approaches for sparse adaptive filtering. The numerical simulation results show that the two proposed algorithms achieve better performance than the standard LMS algorithm and ℓ p -LMS algorithm in terms of convergence rate and steady-state behavior in sparse system identification settings.

关键词： Least squares approximations Standards Convergence System identification Signal processing algorithms Steady-state Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Latency-aware routing with bandwidth assignment for Software Defined networks

Latency-aware routing with bandwidth assignment for Software...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Qiongyu Zhang Liehuang Zhu Meng Shen Mingzhong Wang Fan Li Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing Institute of Technology P. R. China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education P. R. China Faculty of Arts and Business University of the Sunshine Coast Queensland Australia

Reducing the flow latency is of great importance in traffic management, which benefits both service providers and end users. Routing design and flow scheduling are typical ways to improve the flow transmission efficiency. However, existing studies usually consider them separately, due to the complexity of joint consideration. Here, we propose a latency-aware routing scheme with bandwidth assignment in the Software Defined networks, which can efficiently reduce the flow latency with a moderate complexity, to combine the routing and scheduling together.

关键词： Routing Bandwidth Processor scheduling Complexity theory Bismuth Software Mathematical model

来源：评论

学校读者我要写书评

暂无评论

A Clustering-Based Similarity Measurement for Collaborative Filtering 2

A Clustering-Based Similarity Measurement for Collaborative ...

引用

2nd International Conference on Advanced Cloud and Big Data, CBD 2014

作者： Gu, Liang Yang, Peng Dong, Yongqiang School of Computer Science and Engineering Southeast University Nanjing211189 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing211189 China

ISBN: (纸本)9781479980857

Similarity measurement is a crucial process in collaborative filtering. User similarity is computed solely based on the numerical ratings of users. In this paper, we argue that the social information of users should be also taken into consideration to improve the performance of traditional similarity measurements. To achieve this, we propose a clustering-based similarity measurement approach incorporating user social information. In order to cluster the users effectively, we propose a novel distance metric based on taxonomy tree which can easily process the numerical and categorical information of users. Meanwhile, we also address how to determine the contribution of different types of information in the distance metric. After clustering the users, we introduce the incorporating strategy of our proposed similarity measurement. We perform a series of experiments on a real world dataset and compare the performance of our approach against that of traditional approaches. Experiments demonstrate that the proposed approach considerably outperforms the traditional approaches. © 2014 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Self-adaptive anonymous communication scheme under SDN architecture

Self-adaptive anonymous communication scheme under SDN archi...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Tingting Zeng Meng Shen Mingzhong Wang Liehuang Zhu Fan Li Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications Beijing Institute of Technology P. R. China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education P. R. China Faculty of Arts and Business University of the Sunshine Coast Queensland Australia

Communication privacy and latency perceived by users have become great concerns for delay-sensitive Internet services. Existing anonymous communication systems either provide high anonymity at an expense of prolonged latency (e.g., mix-net), or offer better real-time performance by sacrificing the ability against traffic analysis attacks (e.g., Onion Routing). The emerging Software-Defined networking (SDN) introduces additional challenges to communication anonymity, due to the existence of a centralized controller that has a global view of the entire network traffic. In this paper, we propose a new anonymous communication scheme for delay-sensitive services under SDN scenarios, which can simultaneously protect communication privacy and reduce the end-to-end latency. A self-adaptive method based on the mix-net framework is designed to dynamically modify the waiting threshold of mix nodes, which helps to reduce the communication latency. In order to preserve the degree of anonymity, the self-adaptive method is incorporated with a random walking strategy for packets forwarding. Both theoretical analysis and experimental results prove that our scheme provides a moderate degree of anonymity and effectively reduces the latency derived from mix-net by up to 50%.

关键词： Real-time systems Relays Entropy Lead Distance measurement Annealing Probabilistic logic

来源：评论

学校读者我要写书评

暂无评论

Make your webpage carry abundant secret information unawarely

Make your webpage carry abundant secret information unawarel...

引用

15th IEEE International Conference on High Performance Computing and Communications, HPCC 2013 and 11th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing, EUC 2013

作者： Guo, Xiaojun Cheng, Guang Zhu, Chengang Zhou, Aiping Pan, Wubin Truong, Dinhtu School of Computer Science and Engineering Southeast University Nanjing 210096 China School of Information Engineering Tibet Nationalities Institute Xianyang 712082 China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing 210096 China

ISBN: (纸本)9780769550886

How to embed more secret message into web page with keeping good imperceptibility simultaneously is a trade-off problem for information hiding schemes. This paper presents a novel web page information hiding method based on three inherent features of current web page's HTML Code matrix. This method firstly exploits chaotic transform to deal with secret message, then embeds each bit of secret message into cover web page according to the random odevity of character amount contained by each row(column) in cover web page's HTML code matrix. Its process is very simple to understand and easy to implement. It can improve the largest embedded capacity (LEC) of cover web page greatly with keeping good imperceptibility at the same time. We test our approach on two test data sets which include 1000 web pages in total. The experiment results show that the max LECs for these two data sets are up to 11291 bits and 13545 bits respectively. The average LECs for two data sets has improvement of 80.2% and 24% more than that of other web page information hiding method. © 2013 IEEE.

关键词： HTML

来源：评论

学校读者我要写书评

暂无评论

Webshell detection techniques in web applications 5

Webshell detection techniques in web applications

引用

5th International Conference on Computing Communication and networking Technologies, ICCCNT 2014

作者： Dinh Tu, Truong Guang, Cheng Xiaojun, Guo Wubin, Pan School of Computer Science and Engineering Southeast University Nanjing210096 China Department of Information Technology Tuyhoa Industrial College Phuyen620900 Viet Nam Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

ISBN: (纸本)9781479926961

With widely adoption of online services, malicious web sites have become a malignant tumor of the Internet. Through system vulnerabilities, attackers can upload malicious files (which are also called webshells) to web server to create a backdoor for hackers' further attacks. Therefore, finding and detecting webshell inside web application source code are crucial to secure websites. In this paper, we propose a novel method based on the optimal threshold values to identify files that contain malicious codes from web applications. Our detection system will scan and look for malicious codes inside each file of the web application, and automatically give a list of suspicious files and a detail log analysis table of each suspicious file for administrators to check further. The Experimental results show that our approach is applicable to identify webshell more efficient than some other approaches. © 2014 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Availability-Aware Virtual network Embedding for Multi-tier Applications in Cloud networks

Availability-Aware Virtual Network Embedding for Multi-tier ...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Meng Shen Xu Ke Fuliang Li Fan Li Liehuang Zhu Lei Guan Ministry of Education Key Laboratory of Computer Network and Information Integration (Southeast University) P. R. China Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications School of Computer Science Beijing Institute of Technology P. R. China Tsinghua University Beijing Beijing CN College of Information Science and Engineering Northeastern University P. R. China DNSLAB China Internet Network Iniormation Center Beijing P. R. China School of Management & Economics Beijing Institute of Technology P. R. China

ISBN: (纸本)9781479989386

There is a growing trend for service providers (SPs) to migrate their multi-tier applications from local clusters to public cloud networks. In the cloud environment, it is a great concern of SPs to improve the availability of their virtual networks, in addition to guarantees of their virtual resource requirements, such as VMs and bandwidth. However, meeting these requirements results in an inefficient utilization of physical resources, which goes against the operational goal of cloud providers. To address this challenge, in this paper, we propose an availability-aware virtual network embedding framework that simultaneously improves the availability of virtual networks and the resource efficiency. We first propose a new metric to quantify the availability cost of a multi-tier virtual network, and then formulate the embedding problem as a joint optimization of the aggregated bandwidth and availability costs. Due to the NP-hardness of the embedding problem, we devise a heuristic algorithm that can solve the problem in polynomial time. Extensive simulation results show that the proposed algorithm enables CP to achieve various trade-offs between resource efficiency and availability, and to gain more revenue (e.g., 16.1% under a datacenter load of 80%) than the availability-agonistic algorithm.

关键词： Bandwidth Cloud computing Topology network topology Servers Optimization Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：