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

2012 2nd International Conference on Consumer Electronics, Communications and Networks, CECNet 2012

作者： Jin, Fangyuan Zhu, Yanqin Luo, Xizhao Department of Computer Science and Technology Soochow University Suzhou China Jiangsu Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou China

We construct a general Verifiable Fully Homomorphic Encryption, using the existed Fully Homomorphic Encryption schemes. The main appeal of the scheme is the verifiability of Evaluate function. Its security and other p... 详细信息

ISBN: (纸本)9781457714153

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Dependency tree-based SRL with proper pruning and extensive feature engineering

Dependency tree-based SRL with proper pruning and extensive ...

引用

12th Conference on Computational Natural Language Learning, CoNLL 2008

作者： Wang, Hongling Wang, Honglin Zhou, Guodong Zhu, Qiaoming Jiang Su Provincial Key Lab for Computer Information Processing Technology School of Computer Science and Technology Soochow University Suzhou 215006 China

ISBN: (纸本)1905593481

This paper proposes a dependency tree-based SRL system with proper pruning and extensive feature engineering. Official evaluation on the CoNLL 2008 shared task shows that our system achieves 76.19 in labeled macro F1 for the overall task, 84.56 in labeled attachment score for syntactic dependencies, and 67.12 in labeled F1 for semantic dependencies on combined test set, using the standalone MaltParser. Besides, this paper also presents our unofficial system by 1) applying a new effective pruning algorithm;2) including additional features;and 3) adopting a better dependency parser, MSTParser. Unofficial evaluation on the shared task shows that our system achieves 82.53 in labeled macro F1, 86.39 in labeled attachment score, and 78.64 in labeled F1, using MSTParser on combined test set. This suggests that proper pruning and extensive feature engineering contributes much in dependency tree-based SRL. © 2008.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A content-based classified hierarchical vector quantization algorithm for volume compression

Journal of Software

引用

Journal of Software 2011年第2期6卷 322-330页

作者： Zhao, Li-Ping Yue, Guang-Xue Xiao, De-Gui Zhou, Xu Yu, Xiang Yu, Fei School of Mathematics and Information Engineering Jiaxing University Jiaxing Zhejiang China School of Computer and Communication Engineering Hunan University Changsha Hunan China Department of Computer Science and Technology Huaihua University Huaihua China Jiangsu Provincial Key Laboratory for Computer Information Processing Technology Soochow University Soochow China

An improved volumetric compression algorithm is presented in this paper. Histogram technique is used for analyzing the trait of volume data. The volume data is then partitioned into volume bricks which will be classified into two groups, the blocks with meaningless information as one group (also called empty blocks), and those with meaningful information as the other group (also called object blocks). An efficient hierarchical VQ is applied to compress object blocks while for empty blocks, nothing is saved. Compare with analogous Volume Compression algorithm, experimental results demonstrate the proposed algorithm not only can improve the compression rate significantly on the premise of the good quality of reconstruction image, but also can obtain fast decoding speed. © 2011 ACADEMY PUBLISHER.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithm for pareto optimum-based route selection

引用

Journal of Systems Engineering and Electronics 2007年第2期18卷 360-368页

作者： Cui Xunxue Li Qin Tao Qing New Star Research Inst. of Applied Technology Hefei 230031 P. R. China Jiangsu Key Lab of Computer Information Processing Technology Soochow Univ. Suzhou 215006 P. R. China

A quality of service （QoS） or constraint-based routing selection needs to find a path subject to multiple constraints through a network. The problem of finding such a path is known as the multi-constrained path （MCP） problem, and has been proven to be NP-complete that cannot be exactly solved in a polynomial time. The NPC problem is converted into a multiobjective optimization problem with constraints to be solved with a genetic algorithm. Based on the Pareto optimum, a constrained routing computation method is proposed to generate a set of nondominated optimal routes with the genetic algorithm mechanism. The convergence and time complexity of the novel algorithm is analyzed. Experimental results show that multiobjective evolution is highly responsive and competent for the Pareto optimum-based route selection. When this method is applied to a MPLS and metropolitan-area network, it will be capable of optimizing the transmission performance.

关键词： Route selection Multiobjective optimization Pareto optimum Multi-constrained path Genetic algorithm.

来源：评论

学校读者我要写书评

暂无评论

The scientific literature corpus for Chinese negation and uncertainty identification

The scientific literature corpus for Chinese negation and un...

引用

14th Workshop on Chinese Lexical Semantics, CLSW 2013

作者： Chen, Zhancheng Zou, Bowei Zhu, Qiaoming Li, Peifeng School of Computer Science and Technology Soochow University Jiangsu 215006 China Key Lab. of Computer Information Processing Technology of Jiangsu Province Suzhou Jiangsu 215006 China

ISBN: (纸本)9783642451843

Negative and uncertain expressions widely exist in natural language. Negation and uncertainty identification has become an important task in computational linguistics community. Lacking of corpus hinders the development of Chinese negation and uncertainty identification. This paper reports on a corpus annotation project for Chinese negation and uncertainty identification on scientific literature. We introduce several important aspects during our annotation, such as selection of raw text, framework of annotation, guidelines, data consistency and statistic data summarized from corpus. In this corpus, we annotate negation and uncertainty cues and their corresponding scopes. Statistic for corpus shows that there are a certain proportion of negative and uncertain expressions in Chinese scientific literature. Accordingly, this corpus is able to support the research of Chinese negation and uncertainty identification in the future. © 2013 Springer-Verlag.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Chinese zero anaphor detection: Rule-based approach

Chinese zero anaphor detection: Rule-based approach

引用

作者： Qin, Kaiwei Kong, Fang Li, Peifeng Zhu, Qiaoming School of Computer Science and Technology Soochow University Jiangsu 215006 China Key Lab. of Computer Information Processing Technology of Jiangsu Province Suzhou Jiangsu 215006 China

ISBN: (纸本)9783642256608

A rule-based approach for Chinese zero anaphor detection is proposed. Given a parse tree, the smallest IP sub-tree covering the current predicate is captured. Based on this IP sub-tree, some rules are proposed for detecting whether a Chinese zero anaphor exists. This paper also systematically evaluates the rule-based method on OntoNotes corpus. Using golden parse tree, our method achieves 82.45 in F-measure. And the F-measure is 63.84 using automatic parser. The experiment results show that our method is very effective on Chinese zero anaphor detection. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Rational semantics for prioritized logic programs

Rational semantics for prioritized logic programs

引用

International Conference on computer Science and Service System

作者： Zhang, Zhizheng School of Computer Science and Engineering Southeast University Nanjing 210096 China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Suzhou University China

ISBN: (纸本)9781424497638

Both preference logics and preference representation in logic programming are concerned with reasoning about preferences on combinatorial domains, yet little research has been published using preference axioms in logic programming with preferences. In this paper, we propose a rational semantic for prioritized logic programming by combining rational preference with ideas underlying answer set programming. The rational semantics can implement a pervasive prioritized reasoning idea: The more preferential the precondition is, the more preferential the conclusion is. Rational preference logic is used to modeling the behavior of a rational agent. In this paper, we use rational preference axioms as the preference propagation principles. © 2011 IEEE.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Coverage Enhancement Strategy Based on Novel Perception and Co-evolution for Multimedia Sensor Networks

引用

电子学报(英文版) 2013年第1期22卷 135-140页

作者： XIAO Fu WANG Jing SUN Lijuan WANG Ruchuan GUO Jian College of Computer Nanjing University of Posts and Telecommunications Nanjing 210003 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing 210003 China Key Laboratory of Broadband Wireless Communication and Sensor Network Technology Ministry of Education Nanjing 210003 China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou 215006 China

Coverage enhancement is one of the hot research topics in wireless multimedia sensor net- works. A novel Coverage-enhancing algorithm based on three-dimensional Directional perception and co-evolution (DPCCA) is proposed in multimedia sensor networks on the basis of the model whose pitch angle and deviation angle can be adjusted. Based on the proposed elliptical cone sensing model, we can derive the coverage area of the node and calculate the optimal pitch angle according the information of monitoring area and the nodes, and then the deviation angle is optimized based on co-evolution al- gorithm, which eliminate the overlapped and blind sensing area effectively. A set of simulations demonstrate the ef- fectiveness of our algorithm in coverage ratio.

关键词：无线多媒体传感器网络网络覆盖协同进化感知增强算法网络工程测量模型

来源：评论

学校读者我要写书评

暂无评论

A processing method for inconsistent answer set programs based on minimal principle

A processing method for inconsistent answer set programs bas...

引用

International Conference on Automatic Control and Artificial Intelligence, ACAI 2012

作者： Zhu, Tao Zhang, Zhizheng Zhai, Yuqing Gao, Zhiqiang School of Computer Science and Engineering Southeast University Nanjing China Jiangsu Provincial Key Laboratory of Computer Information Processing Technology Suzhou University Suzhou China

ISBN: (纸本)9781849195379

Answer set programming (ASP) has become an important tool for knowledge representation and reasoning. Inconsistency processing in ASP provides a way for reasoning of inconsistent knowledge. In this paper, we present a minimal principle based method to process inconsistency in ASP. The method is able to ensure maximum retention of certain knowledge by removing the fewest defeasible rules preferentially. Then, we propose corresponding algorithms for simple logic programs and extended logic programs, and analyze the complexity of our method. After that, we compare this method with related work. Finally, we conclude and indicate the prospect of the further research.

关键词： processing

来源：评论

学校读者我要写书评

暂无评论

Towards the scheduling of access requests in cloud storage

Towards the scheduling of access requests in cloud storage

引用

8th International Conference on computer Science and Education, ICCSE 2013

作者： Wu, Xian Qian, Peide School of Computer Science and Technology Computer Information Processing Technology Suzhou University Suzhou 215006 China Jiangsu Provincial Key Laboratory Computer Information Processing Technology Suzhou University Suzhou 215006 China School of Computer Science and Technology Suzhou University Suzhou 215006 China

ISBN: (纸本)9781467344623

In recent years, cloud computing has emerged as an enabling technology, in which virtual machine migration and dynamic resource allocation is one of the hot issues. During the migration of virtual machine, access requests from end users coming constantly. So how to schedule these requests to ensure the performance of cloud storage system is the key issue. In this paper, we focus on scheduling access requests to provide end users desirable data when virtual data nodes are migrating. In this process, we interested in the following performance in the system: the availability of data, energy consumption and cost. The contributions of this paper are: 1) analyze the open issues of scheduling in cloud storage;2) present the environment of scheduling access requests in cloud storage and discuss metrics which affect the scheduler;3) define the formal concepts about this problem and give the main steps of scheduling algorithm. The main innovation of this paper is fully taken into account data node's mobility in cloud storage. So we could establish the connection between resource availability and system availability. The results of this paper can be used in scheduling and resource management in cloud storage system to provide the mass storage of streaming media in cloud and its continuous access. © 2013 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：