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

2013 science and Information Conference, SAI 2013

作者： Al-Qaheri, Hameed Banerjee, Soumya Ghosh, Goldina Department of Quantitative Methods and Information Systems Kuwait Universit Safat Kuwait Department of Computer Science Birla Institute of Technology India

ISBN: (纸本)9780989319300

Interaction with different person leads to different kinds of ideas and sharing or some nourishing effects which might influence others to believe or trust or even join some association and subsequently become the member of that community. This will facilitate to enjoy all kinds of social privileges. These concepts of grouping similar objects can be experienced as well as could be implemented on any Social Networks. The concept of homophily could assist to design the affiliation graph (of similar and close similar entities) of every member of any social network thus identifying the most popular community. This paper will propose and discuss a novel data-mining algorithm from the perspective of graph properties (embeddedness, betweenness and graph occupancy) of a social network. A novel contribution has been made in the proposal while incorporating principle of evolutionary dynamics to investigate the graph properties. The prime objective is to authenticate the results of homophily identification for social network instance(s). Finally, the implication of homophily graph for cultivating leading community of social network has also been solicited. © 2013 The science and Information Organization.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

Probabilistic XML functional dependencies based on possible world model

引用

computer Modelling and New Technologies 2014年第10期18卷 232-238页

作者： Yan, Ping Lv, Teng He, Weimin School of Science Anhui Agricultural University Hefei China Teaching and Research Section of Computer Army Officer Academy Hefei China Department of Computing and New Media Technologies University of Wisconsin-Stevens Point 2100 Main Street Stevens PointWI United States

With the increase of uncertain data in many new applications, such as sensor network, data integration, web extraction, etc., uncertainty both in relational databases and XML datasets has attracted more and more research interests in recent years. As functional dependencies (FDs) are critical and necessary to schema design and data rectification in relational databases and XML datasets, it is also significant to study FDs in uncertain XML datasets. This paper first proposed XML functional dependencies (XFDs) of deterministic XML dataset based on tree tuple models. Then two new kinds of functional dependencies based on possible worlds model for probabilistic XML dataset are introduced: probabilistic XML functional dependencies (pXFDs) and probabilistic approximate XML functional dependencies (pAXFDs). pXFDs extend the concept of XFDs of deterministic XML dataset by considering the probability of each possible world of probabilistic XML dataset, and pAXFDs extend the concept of probabilistic XML functional dependencies of probabilistic XML dataset by considering the degree of truth of tree tuples in each possible world of probabilistic XML dataset.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

A big data based data storage systems for rock burst experiment

引用

International Journal of Wireless and Mobile Computing 2013年第5期6卷 463-472页

作者： Zhang, Yu Bai, Yan-Ping Zhu, Dong-Feng Lv, Zhao-Yong Department of Computer Science Beijing University of Civil Engineering and Architecture Beijing China State Key Laboratory for GeoMechanics and Deep Underground Engineering China University of Mining and Technology Beijing China School of Management Capital Normal University Beijing China School of Computer Science and Technology Beijing Institute of Technology Beijing China Department of Computer Teaching and Network Information Beijing University of Civil Engineering and Architecture Beijing China

State Key Laboratory for GeoMechanics and Deep Underground Engineering, Deep-Lab for short, has been committed to the study of rock burst. Deep-Lab accumulated a large number of rock-burst data. With the deepening of the research progress, massive-data dilemma, artificial-management-data dilemma and experimental-data-analysis dilemma have become three big problems of rock burst. These dilemmas restrict the development of rock burst research technologies. This article takes big data in rock burst experiment as research objects and innovatively introduces big data technology into rock burst. Digital features of rock-burst experimental data were extracted. On this basis, a big data based data storage systems for rock burst experiment, BDSS for short, was designed and built. Then an integrated rock burst experimental platform was constructed. Experiments show that, BDSS solves three dilemmas of rock burst, and realises the distributed storage system of data. BDSS also realises dynamic and efficient load of rock-burst big data, and its efficient query under complication conditions. Copyright © 2013 Inderscience Enterprises Ltd.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

A novel stable algorithm of getting user's account based on telnet protocol

A novel stable algorithm of getting user's account based on ...

引用

2012 International Conference on Mechanical Engineering, Industrial Electronics and Informatization, MEIEI 2012

作者： Wei, Li Deng, Da-Zhi Public Infrastructure Department Computer teaching and research section Henan Medical College for Staff and Workers Zhengzhou 450009 China Department of Computer Science Henan Institute of Engineering Zhengzhou 450009 China

ISBN: (纸本)9783037856505

In recent years,china input in the construction of the network management is constantly increasing;information technology has improved continuously,but,making a variety of network security incidents occur frequently,due to the vulnerability of the computer network system inherent,a direct impact on national security and social and political stability. Because of the popularity of computers and large-scale development of the Internet, network security has been increasing as the theme. Reasonable safeguards against violations of resources;regular Internet user behavior and so on has been the public's expectations of future Internet. This paper described a stable method of getting telnet user's account in development of network management based on telnet protocol. © (2013) Trans Tech Publications, Switzerland.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

An energy-based model for spatial social networks 12

An energy-based model for spatial social networks

引用

12th European Conference on the Synthesis and Simulation of Living Systems: Advances in Artificial Life, ECAL 2013

作者： Antonioni, Alberto Egloff, Mattia Tomassini, Marco Information Systems Department Faculty of Business and Economics Section of Computer Science and Mathematical Methods Faculty of Arts and Humanities University of Lausanne Switzerland Switzerland

ISBN: (纸本)9780262317092

In the past decade, thanks to abundant data and adequate software tools, complex networks have been thoroughly investigated in many disciplines. Most of this work has dealt with networks in which distances do not have physical meaning and are just dimensionless quantities measured in terms of edge hops. However, in many cases the physical space in which networks are embedded and the actual distances between nodes are important, such as in geographical and transportation networks. The Random Geometric Graph (RGG) is a standard spatial network model that plays a role for spatial networks similar to the one played by the Erdös Ŕenyi random graph for relational ones. In this work we present an extension of the RGG construction to define a new model to build bi-dimensional spatial networks based on energy as realistic constraint to create the links. The constructed networks have several properties in common with those of actual social networks. © 2013 Proceedings of the 12th European Conference on the Synthesis and Simulation of Living Systems: Advances in Artificial Life, ECAL 2013. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Weak heaps and friends: Recent developments

Weak heaps and friends: Recent developments

引用

24th International Workshop on Combinatorial Algorithms, IWOCA 2013

作者： Edelkamp, Stefan Elmasry, Amr Katajainen, Jyrki Weiß, Armin Faculty 3-Mathematics and Computer Science University of Bremen P.O. Box 330 440 Bremen 28334 Germany Department of Computer Engineering and Systems Alexandria University Alexandria 21544 Egypt Department of Computer Science University of Copenhagen Universitetsparken 5 Copenhagen East 2100 Denmark Institute for Formal Methods in Computer Science University of Stuttgart Universitätstraße 38 70569 Stuttgart Germany

ISBN: (纸本)9783642452772

A weak heap is a variant of a binary heap where, for each node, the heap ordering is enforced only for one of its two children. In 1993, Dutton showed that this data structure yields a simple worst-case-efficient sorting algorithm. In this paper we review the refinements proposed to the basic data structure that improve the efficiency even further. Ultimately, minimum and insert operations are supported in O(1) worst-case time and extract-min operation in worst-case time involving at most element comparisons. In addition, we look at several applications of weak heaps. This encompasses the creation of a sorting index and the use of a weak heap as a tournament tree leading to a sorting algorithm that is close to optimal in terms of the number of element comparisons performed. By supporting insert operation in O(1) amortized time, the weak-heap data structure becomes a valuable tool in adaptive sorting leading to an algorithm that is constant-factor optimal with respect to several measures of disorder. Also, a weak heap can be used as an intermediate step in an efficient construction of binary heaps. For graph search and network optimization, a weak-heap variant, which allows some of the nodes to violate the weak-heap ordering, is known to be provably better than a Fibonacci heap. © 2013 Springer-Verlag.

关键词： Sorting

来源：评论

学校读者我要写书评

暂无评论

Insect extraction based on the improved color channel comparison method

Insect extraction based on the improved color channel compar...

引用

2012 International Conference on Emerging Technologies for Information Systems, Computing, and Management, ICM 2012

作者： Yang, Yan Liu, Sa Zhu, Xiaodong Lian, Shibin Wang, Huaiwei Yan, Tingyu Department of Computer Science and Information Beijing University of Agriculture Beijing China Ministry of Basic Teaching Beijing University of Agriculture Beijing China

ISBN: (纸本)9781461470090

Color Channel Comparison Method is an effective method to transform color images into gray ones. This method can enhance pests' characteristics and remove the background to some extent. However, some interfering background cannot be removed. In order to solve this problem, an improvement on Color Channel Comparison Method is realized in this paper. Comparisons between gray brightness and a threshold value determine whether the pixel is the interfering background. And the threshold value is determined according to the brightness of the image. Empirical results show that the interfering background in black or white pests' photo is effectively cleared, and black or white pests can be more effectively separated from the colored background by using the improved method. The improved color channel comparison method can effectively solve the interfering background problem of Color Channel Comparison Method. © 2013 Springer science+Business Media New York.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Top-down mining of top-k frequent closed patterns from microarray datasets

Top-down mining of top-k frequent closed patterns from micro...

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Huang, Haiping Miao, Yuqing Shi, Jianjun Department of Teaching and Practice Guilin University of Electronic Technology Guilin China School of Computer Science and Engineering Guilin University of Electronic Technology Guilin China

ISBN: (纸本)9781479916603

Mining frequent closed patterns from microarray datasets has attracted more attention. However, most previous studies needed users to specify a minimum support threshold. In practice, it is not easy for users to set an appropriate minimum support threshold and discover the interesting patterns from huge frequent closed patterns. In this paper, we proposed an alternative mining task that mines top-k frequent closed patterns of length no less than min-l from microarray datasets, where k is the desired number of frequent closed patterns to be mined. An efficient algorithm TBtop is developed adopting top-down breadth-first search strategy. Our performance study showed that the strategy was effective in pruning search space. And in most cases, the algorithm TBtop outperformed the algorithm CARPENTER. © 2013 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

An extrapolation method of crank-nicolson finite difference scheme for distributed control equation

An extrapolation method of crank-nicolson finite difference ...

引用

2nd International Conference on Information Engineering and Applications, IEA 2012

作者： Zhou, Jun Xiong, Min School of Mathematics and Computer Science Yangtze Normal University Chongqing China Department of Basic Teaching Chengdu Aeronautic Vocational and Technical College Chengdu China

ISBN: (纸本)9781447148494

This paper studies a finite difference scheme for the distributed control equation, which is based on Crank-Nicolson finite difference scheme and is constructed by applying an extrapolation technique to the nonlinear term. We proved the existence, uniqueness and convergence of the numerical solution. In literature review, there is no report of theoretical studies about the extrapolation. Meanwhile, these theoretical studies are confirmed by numerical experiments in the end. These show that the scheme is a practical numerical method for some computations or numerical simulations which require less accuracy and less computational time. © 2013 Springer-Verlag.

关键词： Extrapolation

来源：评论

学校读者我要写书评

暂无评论

The worst case minimized upper bound in #2-SAT

The worst case minimized upper bound in #2-SAT

引用

2012 International Conference on Information Technology and Software Engineering, ITSE 2012

作者： Gu, Wenxiang Wang, Honglin School of Computer Science Northeast Normal University 130117 Changchun China Department of Basic Subjects Teaching ChangChun Architecture and Civil Engineering College 130607 Changchun China

ISBN: (纸本)9783642345210

#SAT problem is NP-complete, so the small improvement of #SAT problems at the worst case (such as from O(ck) to O((c-Ε)k)) will make the efficiency of the algorithm improved in the level of exponent. In this paper, we present a new #2-SAT algorithm based on DPLL regarding the number of clauses as parameter. In order to improve the upper bound, we propose two new transformation rules and make a more elaborate analysis of the constraint graph for choosing better variables to branch. By analyzing, we obtain the new worst case upper bound O(1.1740m), which is the best result up to now within our knowledge. © 2013 Springer-Verlag.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：