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

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

来源：评论

学校读者我要写书评

暂无评论

A Novel Quantum-behaved Particle Swarm Optimization Algorithm

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

引用

第十四届分布式计算及其应用国际学术研讨会

作者： Jing Zhao Hong Liu School of Information Qilu University of Technology Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Shandong Normal University Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology College of Information Science and Engineering Shandong Normal University

A novel Quantum-behaved Particle Swarm Optimization algorithm with probability(P-QPSO) is introduced to improve the global convergence property of QPSO. In 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 probability. Seven benchmark functions are used to test the performance of P-QPSO. The 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 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

来源：评论

学校读者我要写书评

暂无评论

A Study on Cooperative Multi-objective Group Search Optimizer

A Study on Cooperative Multi-objective Group Search Optimize...

引用

第27届中国控制与决策会议

作者： Ya-zhou Li Xiang-wei Zheng Xian-cui Xiao School of Information Science and Engineering Shandong Normal University Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology

ISBN: (纸本)9781479970186

Group Search Optimizer(GSO) is a swarm intelligence algorithm inspired from animal's foraging *** algorithm demonstrated its obvious superiority in solving complex engineering *** on the strategy of divide-and-conquer and cooperative coevolution framework,a Cooperative Coevolutionary Multi-objective Group Search Optimizer(CMOGSO) is proposed in this *** CMOGSO,multi-objective optimization problems are decomposed according to their decision variables and are optimized by corresponding sub-groups *** are selected randomly from archive and employed to construct context vectors in order to evaluate the members in *** results demonstrate that CMOGSO can more effectively and efficiently solve multi-objective optimization problems compared with other evolutionary multi-objective optimizers.

关键词： Group search optimizer Multi-objective optimization cooperative coevolution context vector

来源：评论

学校读者我要写书评

暂无评论

Multi-tenant data integrity verification scheme based on B+ tree

引用

Journal of Computational Information Systems 2015年第16期11卷 6111-6118页

作者： Li, Ying Zhang, Yongsheng School of Information Science and Engineering Shandong Normal University Jinan China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan China

Data integrity is the prime concern for users to consider whether to use cloud storage services or not. And data integrity verification is not only an effective measure for users to detect their stored data whether secure and integral, but also a key technology to prevent their data from being lost or falsified in unknown circumstances. For the highly dynamic and multi-tenant characteristics of data under cloud storage environment, a multi-tenant oriented, supported dynamic operations and high-efficiency scheme of data integrity verification was proposed in this paper. We introduce an improved double-tree verification structure on the basis of dynamic RDPC protocol. The innovation concentrates on the idea of combining B+ tree with H-MHT tree and adjusting H-MHT structure dynamically in the tenant layer. And moreover, we adopt the improved homomorphic hash functions to enhance the security of RDPC protocol. Theoretical analysis and experimental results show that the scheme has obvious advantages in terms of performance. © 2015 by Binary Information Press

关键词： Cloud storage

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Rectification algorithm from single image based on the main vanishing points

引用

Journal of Information and Computational Science 2015年第7期12卷 2871-2880页

作者： Chen, Li Meng, Weiyao Liu, Hong School of Information Science and Engineering Shandong Normal University Jinan China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan China

Considering the relative positions of the camera and object in three-dimensional space, there is always a perspective deformation, which affects the subsequent image processing, between the object in the image collected from camera and the object in the real world. Because the depth information in three-dimensional image is lost in the two-dimensional image, the image rectification will meet some difficulties. This paper puts forward an efficient single image rectification algorithms based on the main vanishing points, which provides a method for fast rectification for a single image and obtains a better effect with few known conditions. Copyright © 2015 Binary Information Press.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

Transforming GIS data into road scenes for crowd simulation

引用

Journal of Information and Computational Science 2015年第13期12卷 5153-5162页

作者： Liu, Wenjie Liu, Hong Zhang, Guijuan School of Information Science and Engineering Shandong Normal University Jinan China Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan China

The simulation of crowd evacuation has a great significance. It contributes to the formulation of corresponding contingency plans, guides the design of the scene, as well as can prevent or reduce the casualties in emergency situation. How to construct crowd simulation scene quickly is one of the main challenges. Traditional construction of simulation environment depends on 3D scene modeling. However this method is inefficient which takes a long period due to the complexity of modeling. In order to reduce the complexity of scene modeling, this paper puts forward an efficient method for enhancing a road map from Geographic Information System (GIS) data. We can construct a road scene to be used in crowd simulation. First, we extract geometrical information (e. g., vector data) of the roads from the 2D map by using GIS. Then we define the topological relationships and construct a topological graph of the roads. Based on the above geometrical and topological information, we transform GIS data into road scenes for crowd simulation. The simulation results show that the method can significantly improve the efficiency of environment construction and crowd simulation in the complex scene. ©, 2015, Journal of Information and Computational Science. All right reserved.

关键词： Geographic information systems

来源：评论

学校读者我要写书评

暂无评论

A photo-realistic crowd simulation system

引用

Journal of Computational Information Systems 2015年第11期11卷 4191-4201页

作者： Sun, Yunchen Liu, Hong Zhang, Guijuan Zhang, Ke School of Information Science and Engineering Shandong Normal University Jinan China Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan China

Crowd simulation system can provide fundamental guide on crowd behaviors in real life. For instance, it can be applied to emergency evacuation of large public places to reduce casualties and property losses. However, in current crowd simulation systems, the crowd models and motions are basically made by artists manually. Since only one or few models are used in animation to cut cost of man power, the characters and the corresponding behaviors are generally lack of variety. Thus, it is necessary to build a crowd simulation system which can create realistic results efficiently. This paper presents a new algorithm to achieve the photo-realistic crowd simulation. First, we adopt Microsoft Kinect to construct lifelike human models. Second, the realistic motions are obtained by assigning the motion capture data to these human models. Third, we employ A* and RVO algorithm to plan the path of crowd movement. Finally, we implement a real-time crowd simulation system on XNA/MonoGame. ©, 2015, Binary Information Press. All right reserved.

关键词： Animation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：