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

7th Chinese Semantic Web Symposium and the 2nd Chinese Web ScienceConference, CSWS 2013

作者： Zhou, Zhangquan Qi, Guilin Key Laboratory of Computer Network and Information Integration of State Education Ministry School of Computer Science and Engineering Southeast University China

ISBN: (纸本)9783642540240

Finding justifications plays an important role in the development and maintenance of ontologies. It helps users or developers to understand the entailments by presenting the minimal subsets of the ontology which are responsible for the entailment (called justification). In our previous work, we have proposed a backtracking algorithm for finding justifications in description logic ΕL+, which underpins OWL 2 EL, a profile of the latest version of Web Ontology Language (OWL). However, the algorithm is not implemented. In this paper, we implement this algorithm and conduct experiments on some real world ontologies, including Snomed-CT. We compare our algorithm with a black-box algorithm for finding all justification in OWL 2 EL. The experimental results show that in most cases, the backtracking algorithm outperforms the black-box one. © Springer-Verlag Berlin Heidelberg 2013.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Multi-label classification with unlabeled data: An inductive approach 5

Multi-label classification with unlabeled data: An inductive...

引用

5th Asian Conference on Machine Learning, ACML 2013

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

The problem of multi-label classification has attracted great interests in the last decade. Multi-label classification refers to the problems where an example that is represented by a single instance can be assigned to more than one category. Until now, most of the researches on multi-label classification have focused on supervised settings whose assumption is that large amount of labeled training data is available. Unfortunately, labeling training example is expensive and time-consuming, especially when it has more than one label. However, in many cases abundant unlabeled data is easy to obtain. Current attempts toward exploiting unlabeled data for multi-label classification work under the transductive setting, which aim at making predictions on existing unlabeled data while can not generalize to new unseen data. In this paper, the problem of inductive semi-supervised multi-label classification is studied, where a new approach named iMLCU, i.e. inductive Multi-Label Classification with Unlabeled data, is proposed. We formulate the inductive semi-supervised multi-label learning as an optimization problem of learning linear models and ConCave Convex Procedure (CCCP) is applied to optimize the non-convex optimization problem. Empirical studies on twelve diversified real-word multi-label learning tasks clearly validate the superiority of iMLCU against the other well-established multi-label learning approaches. © 2013 L. Wu & M.-L. Zhang.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

A centralized latency optimization solution for tree-based application layer multicast

A centralized latency optimization solution for tree-based a...

引用

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

作者： Xinchang Zhang Weidong Gu Lu Wang Xiaomin Zhu Meng Sun DNSLAB China Internet Network Information Center Beijing China Shandong Key Laboratory of Computer Networks Shandong Computer Science Center (National Supercomputing Center in Jinan) Jinan China

ISBN: (纸本)9781479975761

Most application layer multicast (ALM) protocols build the delivery tree by the distributed way, which is necessary for large-scale group applications because of its good scalability. However, it is difficult for the distributed way to obtain high performance. To address the above problem, we study a VM-assisted ALM tree optimization solution (called ALMTO). The proposed solution uses cloud virtual machines (VMs) to collect the structure information on the ALM tree, and uses a centralized way to effectively reduce average latency of the ALM tree built by the distribute way.

关键词： Optimization Vegetation Peer-to-peer computing Protocols Switches Topology Sun

来源：评论

学校读者我要写书评

暂无评论

A linearization regression method to determine life data distribution type

A linearization regression method to determine life data dis...

引用

3rd International Conference on Manufacture Engineering, Quality and Production System, ICMEQP 2014

作者： Qin, Jin Lei Niu, Yu Guang Li, Zheng Information and Network Management Center North China Electric Power University Baoding China State Key Laboratory of Alternate Electric Power System with Renewable Energy Sources North China Electric Power University Beijing China Department of Computer Science and Technology North China Electric Power University Baoding China

ISBN: (纸本)9783038350910

The law of equipments or products life is the calculation fundament of reliability indexes in power plant. Aim to how to determine the most fitted life distribution type, the linear regression and correlation coefficient had been employed in this paper. The linearization of common distribution like as: exponential distribution, normal distribution and logarithmic normal distribution, is complied with the principle of linear regression. After the comparison of correlation coefficient, the most fitted distribution type is quickly found out. The result also shows that the inferred distribution type is in accord with the facts. We may draw the conclusion from this research that the optimized linear regression and correlation coefficient is effective and valid for the inference of life data distribution type. © (2014) Trans Tech Publications, Switzerland.

关键词： Linearization

来源：评论

学校读者我要写书评

暂无评论

Multi-user access control scheme based on resources hierarchies for perceptual layer of IoT

引用

Tien Tzu Hsueh Pao/Acta Electronica Sinica 2014年第1期42卷 28-35页

作者： Ma, Jun Guo, Yuan-Bo Ma, Jian-Feng Liu, Xi-Meng Li, Qi School of Computer Science and Technology Xidian University Xi'an Shaanxi 710071 China PLA Information Engineering University Zhengzhou Henan 450004 China Shaanxi Key Laboratory of Network and System Security Xidian University Xi'an Shaanxi 710071 China

A novel hierarchical access control scheme for perceptual layer of the IoT is presented based on resources hierarchies, which could conform to the secure and efficient access requirement of multi-user. In the scheme, every hierarchical node is composed of perceptual nodes which provide resources with the same levels of security. More hierarchical nodes can be modeled as a set of partially ordered classes. With this mode, a deterministic key derivation algorithm is designed, which makes every user and perceptual node possesses a single key material to get some keys, and obtains the resources at the presented class and all descendant classes in the hierarchy. Furthermore, a mechanism of Merkle tree is introduced to guarantee secure and efficient multi-user key material derivation by independent of each hash link. Compared with previous proposals, the scheme is more suitable for multi-user to access resources of perceptual layer in IoT.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

A Density-Based Space Filling Curve for Location Privacy-Preserving

A Density-Based Space Filling Curve for Location Privacy-Pre...

引用

IEEE International Conference on Services Computing (SCC)

作者： Feng Tian Xiaolin Gui Jian An Pan Yang Xuejun Zhang School of Electronic and Information Engineering Xi'an Jiaotong University Xi'an China Shaanxi Province Key Laboratory of Computer Network Xi'an Jiaotong University Xi'an China

Location-aware devices and cloud computing services have triggered the widespread development of location-based applications. However, such applications require users to disclose their actual locations, which raises serious privacy concerns. As a kind of spatial transformation method, the standard Hilbert curve (SHC) is widely used in privacy preserving for spatial data. But there are still many limitations for SHC, such as high CPU cost, using the unified partition granularity and inability to support partial region authorization, etc. In this paper, we present a density-based space filling curve (DSC) for spatial data transformation, which partition the space based on the density of points of interest (POI) and supports partial authorization of the space, and need relatively low CPU cost. Our experiments show that the security risk of DSC is lower than that of SHC, and DSC provides better index building and range query processing performance than SHC.

关键词： Spatial databases Indexes Cryptography Outsourcing Data privacy Partitioning algorithms Filling

来源：评论

学校读者我要写书评

暂无评论

Execution recovery in transactional composite service

Execution recovery in transactional composite service

引用

2013 IEEE 20th International Conference on Web Services, ICWS 2013

作者： Cao, Jiuxin Zhou, Tao Zhu, Gongrui Liu, Bo Luo, Junzhou School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration of MoE of China Southeast University Nanjing 211189 China

ISBN: (纸本)9780768550251

In the composite service which runs for a long time under the heterogeneous and loose-coupled circumstance, the failure of service tends to occur. The transaction and recovery mechanism is urgently needed in order to guarantee the end-to-end QoS of the workflow and satisfy the user requirement. In this paper we address the composite service recovery issue in the way of substitution with the consideration of QoS constraint, based on our previous research work of the transactional construction and processing rules and the global optimization service selection algorithm, TSSA. Firstly, the service execution graph (SEG) is introduced and a service execution solution selection algorithm is proposed to choose one from the solution set of TSSA which has the highest success rate of recovery. Then, the concepts of execution backup path and switch cost are introduced and a search algorithm is presented to search for the optimal backup path when current service failure occurs. Meanwhile, a local induction algorithm based on positive feedback is described which could rapidly construct an transactional execution path when no backup execution path can be found in SEG and also guarantees the transactional constraint of composite service. Finally, experimental results show the recovery algorithm proposed in this paper is efficient and has high reliability. © 2013 IEEE.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

Parallel execution of data-intensive web services based on data-flow constructs and I/O operation ratio

International Journal of Database Theory and Application

引用

International Journal of Database Theory and Application 2014年第4期7卷 129-138页

作者： Yu, Dongjin Zhu, Qi Shao, Jianhua Li, Chang Yuan, Youwei Li, Wanqing School of Computer Hangzhou Dianzi University Hangzhou China Zhejiang Topcheer Information Technology Co. Ltd Hangzhou China Zhejiang Provincial Key Laboratory of Network Technology and Information Security China

Data-intensive applications, such as data mining and data visualization, need to deal with huge amount of data. Service-oriented architecture, on the other hand, offers a scalable and flexible framework to implement loosely-coupled and standards-based distribute computing which the data-intensive applications usually require. In this paper, we apply four kinds of data-flow constructs, namely Map Construct, Reduce Construct, Conditional Construct and Loop Construct, to assist Web services composition to process huge volume of data. Furthermore, we put forward the approach to the composition of Web services based on the I/O operation ratio, in which the CPU intensive Web services and the I/O intensive ones are arranged to execute in parallel as far as possible. A case is presented finally to show that our approaches are feasible and effective. © 2014 SERSC.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Fast Smallest Lowest Common Ancestor Computation Based on Stable Match

引用

Journal of computer Science & Technology 2013年第2期28卷 366-381页

作者：周军锋蓝国翔陈子阳汤显 School of Information Science and Engineering Yanshan University Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University School of Economics and Management Yanshan University

In this paper, we focus on efficient processing of XML keyword queries based on smallest lowest common ancestor （SLCA） semantics. For a given query Q with m keywords, we propose to use stable matches as the basis for SLCA computation, where each stable match M consists of m nodes that belong to the m distinct keyword inverted lists of Q. M satisfies that no other lowest common ancestor （LCA） node of Q can be found to be located after the first node of M and be a descendant of the LCA of M, based on which the operation of locating a stable match can skip more useless nodes. We propose two stable match based algorithms for SLCA computation, i.e., BSLCA and HSLCA. BSLCA processes two keyword inverted lists each time from the shortest to the longest, while HSLCA processes all keyword inverted lists in a holistic way to avoid the problem of redundant computation invoked by BSLCA. Our extensive experimental results verify the performance advantages of our methods according to various evaluation metrics.

关键词： XML keyword search smallest lowest common ancestor

来源：评论

学校读者我要写书评

暂无评论

Content-based social image retrieval with context regularization

Content-based social image retrieval with context regulariza...

引用

IEEE International Conference on Multimedia and Expo Workshops (ICMEW)

作者： Leiquan Wang Zhicheng Zhao Fei Su Weichen Sun School of Information and Communication Engineering School of Computer and Communication Engineering China University of Petroleum (Huadong) QingDao China Beijing Key Laboratory of Network System and Network Culture Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781479947164

The retrieval and recommendation of social media have provided an immense opportunity to exploit the collective behavior of community users through linked multi-modal data, such as images and tags, where tags provide context information, and images represent visual content. The stability of content information is more reliable than user contributed context information, which was ignored by many existing methods. In this paper, through discovering the latent feature space between visual features and context, we propose a novel approach for social image retrieval by imposing context regularization terms to constraint visual features. The method can effectively reflect the interior visual structure for social image representation. Experimental results on the NUS-WIDEOBJECT dataset demonstrate that the proposed approach obtains competitive performance compared with state-of-the-art methods.

关键词： Context Visualization Semantics Image retrieval Noise measurement Vectors Accuracy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：