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

A Novel Quantum-behaved Particle Swarm Optimization Algorithm

A Novel Quantum-behaved Particle Swarm Optimization Algorith...

The 14th International Symposium on distributed Computing and Applications to Business,Engineering and Science(DCABES 2015)(第十四届分布式计算及其应用国际学术研讨会)

作者： Jing Zhao Hong Liu School of Information Qilu University of Technology Shandong Provincial Key Laboratory for Distribut Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology College of Inf

ISBN: (纸本)9781467365949

A novel Quantum-behaved Particle Swarm Optimization algorithm with probability(P-QPSO)is introduced to improve the global convergence property of *** the proposed algorithm,all the particles keep the original evolution with large probability,and do not update the position of particles with small probability,and re-initialize the position of particles with small *** benchmark functions are used to test the performance of *** results of experiment show that the proposed technique can increase diversity of population and converge more rapidly than other evolutionary computation methods.

关键词： particle swarm optimization algorithm quantum-behaved probability benchmark function

来源：评论

学校读者我要写书评

暂无评论

A heuristic method of using the pointers to physical effects in Su-Field analysis

A heuristic method of using the pointers to physical effects...

引用

World Conference: TRIZ FUTURE 2011-2014

作者： Yan, Wei Zanni-Merk, Cecilia Rousselot, François Cavallucci, Denis Collet, Pierre School of Information Science and Engineering Shandong Normal University Jinan250014 China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan250014 China LGECO INSA Strasbourg 24 Boulevard de la Victoire Strasbourg Cedex France Pôle API BP 10413 Illkirch Cedex67412 France

While TRIZ is increasingly developing both in research and education, users always encounter difficulties in their attempts to practice it, especially for one of the most complicated inventive problem solving tools, the Su-Field analysis, which is used to analyze and improve the efficiency of a technical system. Generally, the process of using a Su-Field model to solve a specific inventive problem includes: building a Problem Model, mapping it to a Generic Problem Model, finding a Generic Solution Model based on the corresponding inventive standard and finally establishing and interpreting a Solution Model in real life. As one of the most important phases of the Su-Field analysis, the last step is normally implemented manually with the help of the pointers to physical effects, which link generic technical functions to specific applications and systems. The adequate pointer, compatible with the context of the specific problem, should be chosen to assist the users to instantiate the Solution Model. However, the pointers to physical effects and the specific problems are built at different levels of abstraction, so it is difficult for the users to choose among many eligible pointers to physical effects given a certain function. This paper proposes a heuristic method to use the pointers to physical effects based on ontology reasoning. The use of formal models, called ontologies, allows to formally define the concepts about the models and the effects and to apply logical reasoning on them. An inventive standards ontology and a physical effects ontology are firstly built to describe the process of Su- Field analysis, and then the logical reasoning rules are established according to a lexical dictionary, the analysis of the inventive standards and the physical effects. The lexical dictionary, based on WordNet, is built to improve the selection of the appropriate effect to apply. Finally, ontology reasoning is implemented to provide heuristic physical effects for the users.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

HPOSN: A Novel Online Social Network Model Based on Hybrid P2P

HPOSN: A Novel Online Social Network Model Based on Hybrid P...

引用

International Conference on Cloud Computing and Big Data (CCBD)

作者： Jiwei Wang Fangai Liu Xu Li Haoran Liu Xiaohui Zhao School of Information Science & Engineering Shandong Provincial Key Laboratory for Distributed Computer Software Technology Jinan China

Currently, online social networks are experiencing explosive growth, and play important roles in all aspects of lives, such as daily communication, online study and online dating. People's everyday life can't stand away from online social networks. With the advances of online social networks and popularity of intelligent mobile devices, more and more service providers are marketing their own online social network services, which providing competent services and ample functionalities. Nonetheless, almost all the mainstream social networks are based on the centralized servers or distributed server clusters. The whole system functions on the basis of the servers, so users depend excessively on servers. This kind of system architecture has potential single-point or multi-point failures though it can offer superior services to users. Users can't log into the system to obtain social services when the servers run into faults, such as equipment failures, link failures or network attacks. More seriously, ifcentralized databases meet with troubles, physical damages or mistake operations, massive user data perhaps could not be used or even lost. This paper defines the problem as Local Service Fault Partition (LSFP) and proposes a novel social network model called HPOSN which applies thoughts of P2P to solve LSFP and optimizes the centralized social network services. The prototype of HPOSN optimizes the communication overhead to control the flooding problem of P2P according to social relationship. Several simulation experiments with two parameters have been conducted, including the Recovery Time and the Recovery Success Rate. Results indicate that HPOSN can solve LSFP problem in centralized social networks pragmatically. Users in the LSFP area can recovery the social services locally through selforganizing and self-managing when they lose the services from centralized server or distributed server clusters. So HPOSN can improve the stability of social network services and user e

关键词： Social network services Servers Stability analysis Peer-to-peer computing Prototypes IP networks Big data

来源：评论

学校读者我要写书评

暂无评论

New identity-based key-encapsulation mechanism and its applications in cloud computing

引用

International Journal of High Performance Computing and Networking 2015年第2期8卷 124-134页

作者： Wang, Hao Zheng, Zhihua Yang, Bo School of Information Science and Engineering Shandong Normal University Jinan Shandong250014 China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan Shandong250014 China Shandong Provincial Key Laboratory of Software Engineering Jinan Shandong250101 China Department of Electronic Engineering Yantai Vocational College Yantai Shandong264670 China

Identity-based encryption (IBE) is an important primitive of identity-based cryptography. As such, it is a type of public-key encryption in which the public key of a user is some unique information about the identity of the user (e.g., a user's e-mail address). As a special form of IBE, identity-based key encapsulation mechanism (IB-KEM) can be used to create a random session key for encrypting messages. Any IB-KEM can be updated to a full IBE scheme by adding a symmetric encryption scheme with appropriate security properties. Currently, IB-KEM is a fundamental primitive of cryptography, and can be used to protect information system security, network security, cloud security, etc. In this paper, we construct a new IB-KEM in a generic levelled multilinear map setting and prove its security under multilinear decisional Diffie-Hellman assumption in the selective-ID model. Then, we make our IB-KEM translated to the GGH framework, which is proposed by Garg et al. (2013a). This framework defines an approximate version of a multilinear group family from ideal lattices. Finally, as an application of our new scheme, we introduce how to achieve secure transmission in the hierarchical architecture for cloud computing (HACC). Copyright © 2015 Inderscience Enterprises Ltd.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Mining Approximate Frequent Patterns from Noisy Databases

Mining Approximate Frequent Patterns from Noisy Databases

引用

International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA)

作者： Xiaomei Yu Yongqin Li Hong Wang School of Information Science and Engineering Shandong Normal University Jinan Shandong China Shandong Provincial Key Laboratory for Distributed Computer software Novel Technology School of Teacher's Education Shandong Normal University Jinan Shandong China

ISBN: (纸本)9781467383165

As an important branch in the field of frequent pattern mining, approximate frequent pattern (AFP) mining attracts much attention recently. Various algorithms have been proposed to discover long true AFPs in presence of random noise. This paper considers the key issues of AFP mining in noisy databases, and categorizes the previous approaches according to the ways they cope with missing items in the transactions. And then a study of different data models on AFP is presented, in which the merits and defects are analyzed. Finally, we draw a conclusion and propose some solutions to deal with the problems in the field of AFP mining.

关键词： Itemsets Algorithm design and analysis Approximation algorithms Data mining Noise measurement Data models

来源：评论

学校读者我要写书评

暂无评论

A Virtual Network Reconfiguration Algorithm Oriented to Energy Consumption

A Virtual Network Reconfiguration Algorithm Oriented to Ener...

引用

International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA)

作者： Zhen-hua Chen Xiang-wei Zheng Xi-bin Chen School of Information Science and Engineering Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan China

ISBN: (纸本)9781467383165

In the process of adopting network virtualization method to solve the network ossification problem, reconfiguration can effectively improve the acceptance ratio of virtual network requests and the resource utilization of substrate network. Energy consumption as an important evaluation factors, and combined with a reconfiguration algorithm, this paper propose energy-aware reconfiguration algorithm. The target physical nodes are chosen on the constraint of the minimum energy consumption, after then, the virtual node will be migrated to the target physical node, and then the virtual links that need be migrated will be remapped to the physical links by shortest path algorithm. This method can effectively improve the virtual network request acceptance ratio and reduce the energy consumption of the substrate network after reconfiguration. The results of simulation verify the effectiveness of this algorithm.

关键词： Energy consumption Substrates Power demand Virtualization Servers Resource management Load modeling

来源：评论

学校读者我要写书评

暂无评论

Virtual Network Embedding Based on Multi-objective Group Search Optimizer

Virtual Network Embedding Based on Multi-objective Group Sea...

引用

International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA)

作者： Ya-zhou Li Xiang-wei Zheng Dian-jie Lu School of Information Science and Engineering Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan China

Virtual network embedding problem is a multi-objective NP-hard problem. Various mapping objectives are often mutually restricted with each other. The existing methods are mostly converting them into a single-objective optimization, which make it difficult to balance the mapping objectives. Based on the concept of multi-objective optimization, a new virtual network embedding model is proposed in this paper. In order to balance mutual constraints of the objectives, two objective functions are defined and optimized simultaneously. Multi-objective group search optimizer is used to achieve the Pareto-optimal set, in which, the ranger searching strategy is improved to optimize the performance of the algorithm. Experimental results demonstrate that the proposed method owns good performance in terms of the revenue and acceptance ratio.

关键词： Substrates Search problems Optimization Bandwidth Heuristic algorithms Energy consumption Internet

来源：评论

学校读者我要写书评

暂无评论

Imbalanced web spam classification based on nested rotation forest

引用

ICIC Express Letters 2015年第3期9卷 937-944页

作者： Fang, Xiaonan Zhang, Huaxiang Gao, Shuang Tan, Yanyan Department of Information Science and Engineering Shandong Normal University No. 88 Wenhua East Road Jinan China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Shandong Normal University No. 88 Wenhua East Road Jinan China

Web spam has emerged to be a critical problem in web search. Unfortunately, single classifiers always perform poorly on imbalanced web spam data sets. For better solving these problems, a nested Rotation Forest structure is proposed, i.e., ensemble classifiers instead of single decision trees are used as the base classifiers of Rotation Forest. Meanwhile, SMOTE is adopted to change the imbalanced ratio of the training set. Rotation Forest and SMOTE method are combined to improve the classification effect in the paper. Experimental results on WEBSPAM UK2007 data set show that our proposed methods can markedly boost the performance of web spam classification. © 2015, ICIC International.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Social Recommendation Algorithm Based on the Context of Time and Tags

Social Recommendation Algorithm Based on the Context of Time...

引用

International Conference on Advanced Cloud and Big Data (CBD)

作者： Xinhua Wang Lingyuan Dou Shandong Provincial Key Laboratory for Distributed Software Novel Technology Jinan China School of Information Science & Engineering Shandong Normal University Jinan China

Recommender systems are traditionally based on a 2-dimensional user-item ratings matrix and focus on recommending the most relevant items to users regardless of context. Therefore, the accuracy and reliability of conventional recommendation algorithms are relatively low. Social tags can realize the classification of information and are marked by users freely which can be used to mining users' preference for items. What's more, it's easy to obtain time. In this paper, in order to enrich the individual user or item information, we take the time and tag context into consideration for the recommendation algorithm. The time context is used to mine the influence of relationship between the two users, and the tag context is used to measure the relationship between items at the same time. Finally, user relation vector and item relation vector are fused to the probabilistic matrix factorization model. Experimental results show that the proposed social recommendation algorithm in this paper can improve the accuracy and precision of recommendation.

关键词： Context Probabilistic logic Recommender systems Tensile stress Mobile communication Sparse matrices Collaboration

来源：评论

学校读者我要写书评

暂无评论

The 5th International Conference on Biomedical Engineering and Biotechnology (ICBEB 2016) Abstracts

引用

BMC MEDICAL IMAGING 2016年第SUPPL 1期16卷 65-65页

作者： [Anonymous] Department of MRI Shandong Medical Imaging Research Institute Affiliated to Shandong University Jinan Shandong 250021 People’s Republic of China Department of Interventional Radiology Shandong Provincial Hospital Affiliated to Shandong University Jinan Shandong 250021 People’s Republic of China College of Information Science and Technology Engr. Research Center of Digitized Textile & Fashion Tech. for Ministry of Education Donghua University Shanghai 201620 China Intelligent multimedia information processing Lab College of Software Northeastern University Shenyang Liaoning Province 110004 China Institute of Biomedical and Health Engineering Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen 518055 China School of Computer Science and Technology Nanjing Normal University Nanjing China Department of Electrical Engineering The City College of New York CUNY New York USA Jiangsu Key Laboratory of 3D Printing Equipment and Manufacturing Nanjing China School of Electronic Science and Engineering Nanjing University Nanjing Jiangsu 210046 China College of Engineering Nanyang Technological University Singapore 639798 Singapore School of Electronic Information Shanghai Dianji University Shanghai China School of Natural Sciences and Mathematics Shepherd University Shepherdstown WV 25443 USA Davis College of Agriculture Natural Resources and Design West Virginia University Morgantown WV 26505 USA State Key Laboratory of Millimeter Waves Southeast University Nanjing 210096 China Center of Medical Physics and Technology Hefei Institutes of Physical Science Chinese Academy of Sciences Hefei China College of Agricultural and Life Sciences University of Florida Gainesville FL 32611 USA Courant Institute of Mathematical Sciences New York University New York NY 10012 USA Translational Imaging Division & MRI Unit Columbia University and New York State Psychiatric Institute New York NY 10032 USA Guangxi Key Laboratory of Manufacturing System & Adv

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：