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

Penetration of authority under cloud environment based on RBAC

Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and technology (Natural Science Edition) 2013年第SUPPL.2期41卷 68-71页

作者： Zou, Jiashun Zhang, Yongsheng Gao, Yan School of Information Science and Engineering Shandong Normal University Jinan 250014 China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Shandong Normal University Jinan 250014 China

A research was made on the weak security of access control model based on the role, which was showed in the cross-domain access of cloud computing. An access control strategy based on the hops was put forward by introducing the role mapping technology and the definition of hop. It was presented to solve the problem of penetration of authority, which emerged in the process of role mapping. The strategy was studied from two aspects of both access process and formal definition, and according simulation experiment was done. Compared with other strategies, this strategy achieved fine-grained control on distance of cross-domain access by adding the corresponding field in the role set and user set. This strategy produced no new collection, and it did not need to establish any mirror role in the process of cross-domain access. The experimental results show that this strategy has higher efficiency and lower consumption of storage compared with the traditional strategy about cross-domain access.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Determination of time course of microbial specific growth rate using mathematical model and genetic algorithm

引用

Biotechnology: An Indian Journal 2013年第2期8卷 238-243页

作者： Gao, Ling Lin, Yutian Lin, Huibin Ren, Yilin Jia, Xiaoyi Lin, Jianqun Lin, Jianqiang Shandong Provincial Key Lab for Distributed Computer Software Novel Technology School of Information Science and Engineering Shandong Normal University Jinan 250014 China Faculty of Information Technology Zhejiang University Hangzhou 310007 China Shandong Institute of Traditional Chinese Medicine Jinan 250014 China School of Life Sciences Tsinghua University Beijing 100084 China School of Life Sciences Shandong Normal University Jinan 250014 China School of Administration Shandong University Jinan 250100 China State key Lab of Microbial Technology Shandong University Jinan 250100 China

The time course of specific growth rate (μ(t)) is essential in analyzing microbial growth characteristics and the relationships between growth and metabolites production. The conventional method for calculation of μ(t) is done by hand and has relatively large errors, which deters its applications. In this paper, a newmethod for calculation ofμ(t) is developed using growth mathematical model and genetic algorithm for model parameter optimization. This method is practical and efficient. © 2013 Trade Science Inc. - INDIA.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Subtopic partitioning strategy based on improved ant colony clustering algorithm

引用

ICIC Express Letters 2013年第10期7卷 2881-2886页

作者： Fei, Shaodong Liu, Peiyu Yang, Yuzhen Zhang, Zhen School of Information Science and Engineering Shandong Normal University No. 88 East Wenhua Road Jinan 250014 China Shandong Provincial Key Lab. for Distributed Computer Software Novel Technology Shandong Province No. 88 East Wenhua Road Jinan 250014 China Shandong University of Finance and Economics No. 7366 East Second Ring Road Jinan China

Aiming at the problem of topic correlated detection caused by the fact that one topic contains many subtopics, this paper proposes a subtopic partitioning method based on the improved ant colony clustering algorithm. First of all, this method establishes a loss function which is used to evaluate the loss degree of clustering and overcome the problem of semantic irrelevancy caused by the cosine similarity of ant colony clustering algorithm. Then this method carries out semantic clustering to the report by using the improved algorithm for the purpose of subtopic partitioning. At last, this method realizes the correlated detection of the topic by using the relative entropy. The experimental result indicates that the method described in this paper is an effective subtopic partitioning method. © 2013 ICIC International.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A method of phrase sentiment analysis based on potential sentiment expectation of context aspects

引用

ICIC Express Letters 2013年第10期7卷 2855-2860页

作者： Yang, Yuzhen Liu, Peiyu Fei, Shaodong Du, Wentao School of Information Science and Engineering Shandong Normal University No. 88 East Wenhua Road Jinan 250014 China Shandong Provincial Key Lab. for Distributed Computer Software Novel Technology Shandong Province No. 88 East Wenhua Road Jinan 250014 China Shandong University of Finance and Economics No. 7366 East Second Ring Road Jinan China

The sentiment analysis of phrases occupies important positions among the multiple application domains of sentiment analysis. The previous work of the sentiment analysis of phrases is still dependent on sentiment words. However, context-dependent problem of sentiment words, which refers that the same sentiment word indicates different sentiment orientations with respect to different contexts, is a challenging task on sentiment analysis. In order to resolve this problem, this paper proposes a method for sentiment analysis based on potential sentiment expectation of aspects. In this method, we define sentiment expectation of aspects, and construct the relationship among aspects, sentiment words and phrases. On the basis of this relationship, we construct a model to analyze the orientation of phrases. Experiment results show that our method can effectively address the dependence of sentiment words on context, and enhance the degree of precision for sentiment analysis of evaluation phrases. © 2013 ICIC International.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

A Greedy Search Algorithm for Resolving the Lowermost C Threshold in SVM Classification

A Greedy Search Algorithm for Resolving the Lowermost C Thre...

引用

International Conference on Computational Intelligence and Security

作者： Huichuan Duan Naiwen Liu Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan China

In this paper, the authors present a greedy search algorithm that solves the SVM classification (SVC) problem at the lowermost C end. By combining the SVC asymptotic behavior with empirical results, it can be sure that at sufficiently small cost, a threshold C0, all the minority samples becomes support vectors each with Lagrange multiplier C0, and equal number of majority samples will become support vectors whose Lagrange multipliers are also C0. With this evidence, SVC is transformed into a C-independent combinatorial optimization problem. Taking all the minority inputs as initial support vectors, a greedy algorithm is devised to choose majority class support vectors one by one each with minimal increase to the objective function in its turn. The greedy nature of the algorithm enables finding out the majority support vectors that near or at the majority margin. By taking the found majority support vectors initially and applying the algorithm to the minority class conversely, the support vectors that near the decision boundary are also resolved. Applying linear least squares fitting to both the majority margin and decision boundary, C0 is obtained as a function of kernel parameters. Experimental results show that the proposed algorithm can find C0 almost perfectly.

关键词： Support vector machines Static VAr compensators Kernel Optimization Greedy algorithms Fitting Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Kinetics and Modeling of Chemical Leaching of Sphalerite Concentrate Using Ferric Iron in a Redox-controlled Reactor

引用

Chinese Journal of Chemical Engineering 2013年第8期21卷 933-936页

作者：宋健高玲林建群吴洪斌林建强 State Key Lab of Microbial Technology Shandong University Department of Pharmacy and Biotechnology Zibo Vocational Institute Shandong Provincial Key Lab for Distributed Computer Software Novel Technology School of Information Science and EngineeringShandong Normal University Institute of Agro-products Processing Science and Technology Xinjiang Academy of Agricultural and Reclamation Science

This work presents a study for chemical leaching of sphalerite concentrate under various constant Fe3+ concentrations and redox potential conditions. The effects of Fe3+ concentration and redox potential on chemical leaching of sphalerite were investigated. The shrinking core model was applied to analyze the experimental results. It was found that both the Fe3+ concentration and the redox potential controlled the chemical leaching rate of sphalerite. A new kinetic model was developed, in which the chemical leaching rate of sphalerite was proportional to Fe3+ concentration and Fe3+ /Fe2+ ratio. All the model parameters were evaluated from the experimental data. The model predictions fit well with the experimental observed values.

关键词： sphalerite leaching kinetic model Fe3＋ concentration redox potential LabVIEW

来源：评论

学校读者我要写书评

暂无评论

D2ER: distributed Energy Efficient Routing in Wireless Sensor Networks with Unreliable Links

D2ER: Distributed Energy Efficient Routing in Wireless Senso...

引用

2013 International Conference on computer,Networks and Communication Engineering(ICCNCE 2013)

作者： Dianjie Lu Xiangwei Zheng Guijuan Zhang Jue Hong School of Information Science and Engineering Shandong Normal University Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences

ISBN: (纸本)9781629932170

Wireless Sensor Networks (WSNs) are subject to node failures because of limited energy and link unreliability which makes the design of routing protocols in such networks a challenging task. The multipath routing scheme is an optimal alternative to address this problem which splits the traffic across multiple paths instead of routing all the traffic along a single path. However, using more paths introduces more contentions which degrade energy efficiency. The problem becomes even more difficult in the scenario of multiple source-destination pairs since the flow distribution of each link is uncertain. Our goal is to minimize the energy cost and provide the robust transmission by choosing the optimal paths. We propose a distributed Energy Efficient Routing protocol (D2ER) to achieve this goal. In D2ER, we first study the problem from a theoretical standpoint by mapping it to the multi-commodity network design problem. Then, we employ the transportation method to solve this problem since it is hard to build a global addressing scheme due to the great number of sensor nodes. Simulation results demonstrate that our optimal algorithm can save energy drastically.

关键词： Energy efficient wireless sensor networks routing

来源：评论

学校读者我要写书评

暂无评论

Modeling and Path Generation Approaches for Crowd Simulation Based on Computational Intelligence

引用

电子学报(英文版) 2012年第4期21卷 636-641页

作者： LIU Hong SUN Yuling LI Yuanyuan School of Information Science and Engineering Shandong Normal University Jinan 250014 China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan 250014 China

Modeling and simulating group behaviours have been an active research topic in the field of com- puter animation and game. This paper presents some novel approaches for supporting entity modeling and path generation in crowd simulation. It analyses related work about crowd simulation first. Then, an entity modeling approach based on CGA (Cellular genetic algorithm) and NURBS (Non uniform relational B splines) technologies is presented. Next, following the analysis to PSO (Particle swarm optimization) and ABC (Artificial bee colony) algo- rithms, a crowd path generative approach based on ABC- PSO is put forward. After that, a simulating example of crowd cohesion and performance comparison are exhibited for showing the efficiency of the algorithms. Finally, the current work is summarized and an outlook for the future work is given.

关键词：仿真建模生成方法人群计算智能路径遗传算法实体建模计算机动画 Crowd simulation, Entity modeling, Cellular genetic algorithm, PSO （Particle swarm optimization） algorithm, ABC algorithm Path generation.

来源：评论

学校读者我要写书评

暂无评论

Heuristic algorithm for multi-vehicle ride matching problem

Heuristic algorithm for multi-vehicle ride matching problem

引用

2012 International Symposium on Information Technologies in Medicine and Education, ITME 2012

作者： Song, Chaochao Wang, Hongguo Ding, Yanhui Yang, Fuping Institute of Management Science and Engineering Shandong Normal University Shandong Province Key Laboratory for Distributed Computer Software Novel Technology Jinan China Institute of Information Science and Engineering Shandong Normal University Shandong Province Key Laboratory for Distributed Computer Software Novel Technology Jinan China

ISBN: (纸本)9781467321068

Multi-vehicle ride matching problem studies how to take passengers as much as possible through optimizing vehicles' route and matching between vehicles and passengers. But at present, problems exist in the researches like that models divorced from reality and low efficiency of algorithms. For this problem, this paper presents a solution based on clustering of vehicles' route order. Transferring the MRMP to RMP through clustering of vehicles' route order, it forms the first matching result between vehicles and passengers. And looking for the best sort order through sorting the first matching result making use of priori clustering. At last, we optimize the solution one times more through optimized rules. Experimental result shows that, the method based on clustering of vehicles' route order can solve the problem with high matching efficiency and low cost. © 2012 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

An Algorithm for Cost-Effectively Storing Scientific Datasets with Multiple Service Providers in the Cloud

An Algorithm for Cost-Effectively Storing Scientific Dataset...

引用

IEEE International Conference on e-Science and Grid Computing

作者： Dong Yuan Xiao Liu Lizhen Cui Tiantian Zhang Wenhao Li Dahai Cao Yun Yang Centre for Computing Engineering and Software Systems Swinburne University of Technology Melbourne Australia Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute of East China Normal University Shanghai China School of Computer Science and Technology Shandong University Jinan China School of Computer Science and Technology Anhui University Hefei China

The proliferation of cloud computing allows scientists to deploy computation and data intensive applications without infrastructure investment, where large generated datasets can be flexibly stored with multiple cloud service providers. Due to the pay-as-you-go model, the total application cost largely depends on the usage of computation, storage and bandwidth resources, and cutting the cost of cloud-based data storage becomes a big concern for deploying scientific applications in the cloud. In this paper, we propose a novel algorithm that can automatically decide whether a generated dataset should be 1) stored in the current cloud, 2) deleted and re-generated whenever reused or 3) transferred to cheaper cloud service for storage. The algorithm finds the trade-off among computation, storage and bandwidth costs in the cloud, which are three key factors for the cost of storing generated application datasets with multiple cloud service providers. Simulations conducted with popular cloud service providers' pricing models show that the proposed algorithm is highly cost-effective to be utilised in the cloud.

关键词： Bandwidth Cloud computing Computational modeling Algorithm design and analysis Finite element analysis Data models Educational institutions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：