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

8th International Conference on intelligent computing technology, ICIC 2012

作者： Wang, Xiao-Feng Min, Hai Key Lab. of Network and Intelligent Information Processing Department of Computer Science and Technology Hefei University Hefei Anhui 230022 China Intelligent Computing Lab. Hefei Institute of Intelligent Machines Chinese Academy of Sciences P.O.Box 1130 Hefei Anhui 230031 China Department of Automation University of Science and Technology of China Hefei Anhui 230027 China

ISBN: (纸本)9783642315879

In this paper, an efficient two-stage segmentation framework was proposed to address the plant leaf image with overlapping phenomenon, which is built based on the leaf approximate symmetry and level set evolution theory. In the pre-segmentation stage, a straight line was manually set on the target leaf to approximate the principal leaf vein and the Local Chan-Vese (LCV) model was used on the global image region to help searching the so-called un-overlapping contour in target leaf. In the formal segmentation stage, the symmetry detection was performed based on the pre-defined approximated principal vein to obtain the narrow-band evolution region and the second initial contour. Next, the LCV model was once again used to find the complete target leaf contour in the narrow-band evolution region. Finally, experiments on some real leaf images with overlapping phenomenon have demonstrated the efficiency and robustness of the proposed segmentation framework. © 2012 Springer-Verlag.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Towards collecting commonsense knowledge with hint questions

Towards collecting commonsense knowledge with hint questions

引用

2012 8th International Conference on Semantics, Knowledge and Grids, SKG 2012

作者： Zang, Liangjun Cao, Cong Cao, Cungen Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences No.6 Kexueyuan South Road Hai Dian Distinct Beijing 100190 China Graduate University Chinese Academy of Sciences No.19 Yu Quan Road Shi Jing Shan Distinct Beijing 100049 China

ISBN: (纸本)9780769547947

Accumulating commonsense knowledge (CK) has proven very useful for many natural language processing tasks. So far the most reliable way of acquisition is still relying on knowledge contributors to offer CK. Unfortunately, knowledge contributors often fail to think of much CK because this knowledge is usually taken for granted by people. In this paper, we explore the issue of reminding knowledge contributors by means of hint questions. Specifically, we investigate what kinds of CK are easily ignored, analyze its reason and suggest possible solution. We hope to sketch sources of the research problem and suggest possible ways forward. © 2012 IEEE.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Challenges and Opportunities for Trust Management in Crowdsourcing

Challenges and Opportunities for Trust Management in Crowdso...

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： Han Yu Zhiqi Shen Chunyan Miao Bo An School of Computer Engineering Nanyang Technological University Singapore The Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

Crowd sourcing (CS) systems offer a new way for businesses and individuals to leverage on the power of mass collaboration to accomplish complex tasks in a divide-and-conquer manner. In existing CS systems, no facility has been provided for analyzing the trustworthiness of workers and providing decision support for allocating tasks to workers, which leads to high dependency of the quality of work on the behavior of workers in CS systems as shown in this paper. To address this problem, trust management mechanisms are urgently needed. Traditional trust management techniques are focused on identifying the most trustworthy service providers (SPs) as accurately as possible. Little thoughts were given to the question of how to utilize these SPs due to two common assumptions: 1) an SP can serve an unlimited number of requests in one time unit, and 2) a service consumer (SC) only needs to select one SP for interaction to complete a task. However, in CS systems, these two assumptions are no longer valid. Thus, existing models cannot be directly used for trust management in CS systems. This paper takes the first step towards a systematic investigation of trust management in CS systems by extending existing trust management models for CS trust management and conducting extensive experiments to study and analyze the performance of various trust management models in crowd sourcing. In this paper, the following key contributions are made. We 1) propose extensions to existing trust management approaches to enable them to operate in CS systems, 2) design a simulation test-bed based on the system characteristics of Amazon's Mechanical Turk (AMT) to make evaluation close to practical CS systems, 3) discuss the effect of incorporating trust management into CS system on the overall social welfare, and 4) identify the challenges and opportunities for future trust management research in CS systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Properties and axiomatization of fuzzy rough sets based on fuzzy covering

Properties and axiomatization of fuzzy rough sets based on f...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Ming-Fen Wu Hao-Han Han Yan-Fei Si School of Computer Science Wuyi University Guangdong China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

Some expanded fuzzy rough sets models have been investigated to handle fuzzy databases with uncertain, imprecise and incomplete real-valued information. In this paper, we make further research on fuzzy rough sets models in fuzzy environment, and we generalize rough fuzzy sets model based on a covering to fuzzy rough sets model based on a fuzzy covering. The lower and upper approximations of fuzzy subsets are defined based on a fuzzy covering, and basic properties are investigated. Then, the axiom definition of the lower approximation operator is given. It is shown that the rough fuzzy sets model based on a covering is a special instance of the fuzzy rough sets model based on a fuzzy covering.

关键词： Abstracts

来源：评论

学校读者我要写书评

暂无评论

Formal concept analysis in hybrid relational databases

引用

International Review on Computers and Software 2012年第6期7卷 2904-2910页

作者： Lei, Yuxia Sui, Yuefei Cao, Baoxiang School of Computer Science Qufu Normal University Rizhao 276826 Shandong China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

Relational Database Model (RDM) has been proven to be a very useful data-storage technique. As information is stored as data in relational databases, the induction of concepts from data is a pivotal topic in the data mining field. Formal Concept Analysis (FCA) turns out to be a perfect instrument for a meaningful and conceptual exploration of the stored data. However, many databases in practice are often hybrid ones. This paper proposes an approach towards extracting concepts from hybrid relations, which preserve the RDM and allow complex values such as relations in columns for relations. The method can be described as follows: the sub-tuples/subattributes pairs are regard as new attributes and inserted into a main relation, and we further obtain a new complex relation called a target relation from which concepts can be extracted. The insertion operation is semantics-preserving and extent-preserving. In addition, this paper analyzed the structural connections among concept lattices in detail, which can be used to construct a complex concept lattice from simple ones. The method may reduce time complexity of constructing the concept lattice of a complex relation. © 2012 Praise Worthy Prize S.r.l. - All rights reserved.

关键词： Formal concept analysis

来源：评论

学校读者我要写书评

暂无评论

Image retrieval based on the texture and spatial features using the integrated multiwavelets quantization map

引用

Journal of Computational information Systems 2012年第13期8卷 5553-5560页

作者： An, Zhiyong School of Computer Science and Technology Institute of Business and Technology Yantai 264005 China Key Laboratory of Intelligent Information Processing in Universities of Shandong Shandong Institute of Business and Technology Yantai 264005 China

An image retrieval algorithm based on the GHM multiwavelets texture and spatial features is proposed. The integrated multiwavelets quantization map is designed creatively that can describe the important visual information of image and relation information among the different scale sub-bands of multiwavelets. The spatial histogram and looseness parameter of integrated multiwavelets quantization map can be used as the texture-spatial features. The energy signatures of multiwavelets sub band can be used as the global texture features. The similarity of multiwavelets texture-spatial features is measured by the weighted texture-spatial distance. Experiments indicate that this method gives better performance than the energy and entropy algorithm based on the multiwavelets transform in the natural image retrieval. © 2011 by Binary information Press.

关键词： Image texture

来源：评论

学校读者我要写书评

暂无评论

A Mapping from TVPCCS into BPEL

A Mapping from TVPCCS into BPEL

引用

2012 IEEE 3rd International Conference on Software Engineering and Service Science(第三届IEEE软件工程与服务科学国际会议 ICSESS2010)

作者： Mohammed Lamine Beggar Liao Lejian Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications Beijing Key Laboratory of Intelligent Information TechnologySchool of Computer ScienceBeijing Institute of Technology Beijing 100081China

The Web Services Business Process Execution Language (BPEL) is a language used to specify compositions of web services. In the last few years, a considerable amount of work has been done on modeling (parts of) BPEL and developing verification techniques and tools for BPEL. Petri nets and formal languages have been widely used to model Web services composition, but temporal value passing calculus of communicating systems (TVPCCS) language seems to be more adequate for several reasons. Generally BPEL programs are mapped to other languages and then the verification is performed, A more promising way is to directly build TVPCCS model, to check it and then map it to a BPEL process model. This paper describes a mapping from TVPCCS onto BPEL process model.

关键词： Web services BPEL TVPCCS process algebra

来源：评论

学校读者我要写书评

暂无评论

Convergence analysis of particle swarm optimization algorithm

引用

Advances in information Sciences and Service Sciences 2012年第14期4卷 25-32页

作者： Gao, Shang Cao, Cungen School of Computer Science and Engineering Jiangsu University of Science and Technology Zhenjiang 212003 China Key Laboratory of Intelligent Computing Information Processing of Ministry of Education Xiangtan University Xiantan 411105 China Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

Using Particle Swarm Optimization to handle complex functions with high-dimension it has the problems of low convergence speed and sensitivity to local convergence. The convergence of particle swarm algorithm is studied from the dynamic system theory, and the condition for the convergence of particle swarm algorithm is given. The analysis provided qualitative guidelines for the general algorithm parameter selection. Results of numerical tests show the efficiency of the results.

关键词： Parameter estimation

来源：评论

学校读者我要写书评

暂无评论

A secure message delivery scheme with path tracking for delay tolerant networks

A secure message delivery scheme with path tracking for dela...

引用

2012 1st IEEE International Conference on Communications in China, ICCC 2012

作者： Jia, Zhongtian Raffay, Muhammad Ali Li, Lixiang Lin, Xiaodong Yang, Yixian Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan 250022 China Information Security Center Beijing University of Posts and Telecommunications Beijing 100876 China Faculty of Business and Information Technology University of Ontario Institute of Technology Oshawa ON L1H 7K4 Canada

ISBN: (纸本)9781467328159

In delay tolerant networks (DTNs), message delivery is operated in an opportunistic way through store-carry and forward relaying, and every DTN node is in anticipation of cooperation for data forwarding from others. Unfortunately, there always exist some selfish nodes that are reluctant to contribute to this cooperative data forwarding procedure so as to save their valuable storage buffer, limited computation power and precious energy. In order to stimulate nodes' willingness to participate in data forwarding, a number of incentive schemes have been proposed recently. However, most existing incentive schemes simply ignore efforts of nodes involved in message delivery if messages delivered fail to reach their destinations. Due to the nature of DTN, such as intermittent connectivity, it is not unusual to have unreliable message delivery, which results in unrewarded or wasted efforts for participating nodes and may discourage them from participating in future data forwarding. Therefore, it is crucial to recognize contribution of every node involved in a data forwarding procedure even the message it helps to forward doesn't successfully reach its destination. However, how to track all delivery paths so as to give every intermediate node some incentive for their cooperative efforts of data forwarding is still an open research problem. To address this problem, we propose a secure message forwarding scheme with path tracking. The proposed method is end-to-end secure with data source and identity authentication. In addition, it can thwart some well known attacks including edge inserting attack, sibling inserting attack and free riding attack. © 2012 IEEE.

关键词： Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

A Mapping from TVPCCS into BPEL

A Mapping from TVPCCS into BPEL

引用

2012 IEEE 3rd International Conference on Software Engineering and Service Science（ICSESS 2012）

作者： Mohammed Lamine Beggar Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications Beijing Key Laboratory of Intelligent Information TechnologySchool of Computer ScienceBeijing Institute of Technology Beijing 100081China

The Web Services Business Process Execution Language (BPEL) is a language used to specify compositions of web *** the last few years,a considerable amount of work has been done on modeling (parts of) BPEL and developing verification techniques and tools for *** nets and formal languages have been widely used to model Web services composition,but temporal value passing calculus of communicating systems (TVPCCS) language seems to be more adequate for several *** BPEL programs are mapped to other languages and then the verification is performed,A more promising way is to directly build TVPCCS model,to check it and then map it to a BPEL process *** paper describes a mapping from TVPCCS onto BPEL process model.

关键词： Web services,BPEL,TVPCCS,process algebra.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：