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

Web Information Systems and Applications Conference (WISA)

作者： Zhenchao Zhang Wei He Qingzhong Li School of Computer Science and Technology Shandong Provincial Key Laboratory of Software Engineering Jinan China

As one of the most important patterns of cloud service, PaaS provides an entire development, deployment and runtime platform for SaaS applications. In a specific PaaS environment such as e-commerce platform, there are similar functionalities among multiple applications, such as "searching items". In this paper, we focus on enhancing general PaaS platform with the mechanism of shared component-based application construction. We discuss some key issues of constructing such abilities with large number of heterogeneous components in the PaaS platform. A component layer with a semantic-enabled multi-level abstract component model is constructed and added to the general PaaS platform. We also give a description of the prototype of our enhanced e-commerce PaaS platform, which can efficiently simplify SaaS application constructing with reusable components.

关键词： Abstracts Ontologies Semantics Business Concrete Software as a service

来源：评论

学校读者我要写书评

暂无评论

Parallel Construction of Binomial-Like Independent Spanning Trees on Twisted Cubes

Parallel Construction of Binomial-Like Independent Spanning ...

引用

International Conference on computer sciences and Applications (CSA)

作者： Yan Wang Jianxi Fan Wenjun Liu Baolei Cheng Provincial Key Laboratory for Computer Information Processing Technology Soochow University School of Computer Science and Technology Soochow University Suzhou China

Independent spanning trees(ISTs) have increasing applications in fault-tolerance, reliable communication protocols and secure message distribution. In this paper, we propose an O(N) parallel algorithm to construct n BISTs rooted at any vertex on n-dimensional twisted cube, where BISTs denote the ISTs isomorphic to binomial-like tree and N =2 n .

关键词： Hypercubes computers Educational institutions Broadcasting computer science Reliability

来源：评论

学校读者我要写书评

暂无评论

Analyzing mechanism-based attacks in privacy-preserving data publishing

引用

Optik 2013年第24期124卷 6939-6945页

作者： Hongtao Li Jianfeng Ma Shuai Fu School of Computer Science and Technology Xidian University Xi’an 710071 China Key Laboratory of Computer Networks and Information Security Ministry of Education (Xidian University) Xi’an 710071 China

Privacy-preserving data publishing (PPDP) deals with data publishing while preserving individual's privacy in the data. Recent researches show that knowledge of mechanism of anonymization provides a loophole for attacks [1] , [2] , we call this kind of attack a mechanism-based attack. In this paper, we first give a comprehensive study of mechanism-based attack and point out that the range of mechanism-based disclosure is much broader than ever said. Then, we analyze the rationale of mechanism-based attack and give the definition of mechanism-based attack formally. To counteract mechanism-based attack, we introduce a model called e -secrecy and corresponding solution algorithm MAIA. We conduct a comprehensive set of experiments to show mechanism-based attacks are practical concern in the real-world data sets and that our method introduces better data utility and very minor computation than the existing algorithms.

关键词： Privacy-preserving data publishing (PPDP) Anonymization Attack Algorithm

来源：评论

学校读者我要写书评

暂无评论

An approach of real-time vehicle detection based on improved Adaboost algorithm and frame differencing rule

引用

Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of science and technology (Natural science Edition) 2013年第SUPPL.I期41卷 379-382页

作者： Liu, Yang Wang, Haihui Xiang, Yunlu Lu, Peilei School of Computer Science and Engineering Wuhan Institute of Technology Wuhan 430205 China Hubei Provincial Key Laboratory of Intelligent Robot Wuhan Institute of Technology Wuhan 430205 China

The methods of moving vehicles detection were normally difficult to count the correct numbers of the vehicles and they may not be able to reach the real-time requirement. To solve those problems, a vehicle detection algorithm was proposed based on improved Adaboost algorithm and frame differencing rule. A cascaded classifier was trained using Haar-like features of the vehicle image samples, while a binary mask image was created by the three-frame differencing rule, then a foreground mask image was rebuilt by removing interference noise and finding connected domains, finally the cascaded classifier was loaded to make a multi-scale detection in the current frame's foreground region, and then the moving vehicles were marked and counted. The results of experiments show that this algorithm can effectively screen out the useful information, by this way, the detection accuracy and speed of the moving vehicles are highly improved, this algorithm is capable of detecting the moving vehicles in effective area of the traffic intersection. It was also induced a strong response under a complex motion.

关键词： Signal detection

来源：评论

学校读者我要写书评

暂无评论

A regression test case generation method guided with branch probability

引用

Zhongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Central South University (science and technology) 2013年第SUPPL.2期44卷 317-322页

作者： Yu, Lechen Wang, Haijun Zheng, Qinghua Liu, Ting Huang, Xiaolong Yang, Zijiang Wei, Wei MOE Key Laboratory for Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an 710049 China Department of Computer Science and Technology Xi'an Jiaotong University Xi'an 710049 China School of Computer Science and Engineering Xi'an University of Technology Xi'an 710049 China

A novel method was proposed to generate regression test cases guided by the branch possibility (GBP). The symbolic execution was applied to search the paths of the program and generate control dependence graph of the program. The branch possibility was proposed to measure the possibility of that the new test case can cover the target code, which is generated by reserving the branch. The branch possibility of each branch in the test case was calculated to find the highest one which will be reserved to generate a new case, until the target code was run in the test case. 20 versions of two programs were selected to compare our method with two existing algorithms such as eXpress and dynamic symbolic execution. The results show that the GBP can generate the test case effectively, and the search time is 45.6% and 61.1% lower than that of eXpress and dynamic symbolic execution (DSE).

关键词： Regression analysis

来源：评论

学校读者我要写书评

暂无评论

Software survivability evaluation method based on software calling structure

引用

Zhongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Central South University (science and technology) 2013年第SUPPL.1期44卷 443-448页

作者： Hou, Yuqiao Qu, Yu Liu, Linfeng Zheng, Qinghua Liu, Ting Zheng, Chao Yang, Zijiang Key Laboratory for Intelligent Networks and Network Security Ministry of Education Xi'an Jiaotong University Xi'an 710049 China Department of Computer Science and Technology Xi'an Jiaotong University Xi'an 710049 China School of Computer Science and Engineering Xi'an University of Technology Xi'an 710048 China

A new method was proposed to evaluate the survivability of the software system based on the calling structure of the software. Firstly, the interactions among the components of the software were obtained using the static lexical analysis technology and dynamic monitoring of the AOP (Aspect ORIENTED PROGRAmming). The calling network was constructed to model the calling structure of the software. Secondly, a component failure simulation method was proposed by removing the nodes and edges corresponding to the selected components from the calling network. The residual calling network was considered as the software calling structure when the components are disabled. Then, the survivability coefficient was presented to measure the survivability of the software system, the proportion of the biggest connected subgraph of the residual network compared to the original call network diagram. In the experiments, nine open source software projects were selected to compare their survivability, and 20 versions of Struts (J2EE framework) were chosen to investigate the changes of the software survivability during their updating. Our evaluation concurs with the intuition that minor upgrades, aimed at fixing bugs and adding minor functionality quickly, reduce software survivability, whereas major upgrades, which normally clean up messy code and re-construct the software, improve software quality.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

TimSim: A Timestep-based Wireless Ad-hoc Network Simulator

TimSim: A Timestep-based Wireless Ad-hoc Network Simulator

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications

作者： Chong Yan Zhiping Jia Lei Ju Hui Xia Huaqiang Xu School of Computer Science and Technology Shandong University Shandong Provincial Key Laboratory of Software Engineering Jinan Shandong China

ISBN: (纸本)9781479914449

Wireless hosts can communicate with each other without a fixed infrastructure in wireless ad-hoc networks. Deploying and monitoring a large number of hosts in such networks involves high cost and intensive labor. As a result, most experiments are achievable through simulation. However, most simulators currently used are intended to evaluate individual routing protocols or algorithms. Direct simulation of an application's source code is not supported. To simulate an application, we have to extract the protocols or algorithms from the source code and rewrite them in accordance with the simulator's requirements. In this paper, we introduce a new wireless ad-hoc network simulator called TimSim. TimSim focuses on simulating the source code of wireless ad-hoc network application directly. As a unique feature, TimSim provides some similar APIs with real device driver so that users can simulate their source code on TimSim with only a few modifications. Driven by a timestep-based simulation engine, TimSim can simulate the data transmitted over wireless ad-hoc networks in bit-level. Additionally, we import database to store the simulation data that TimSim generates. Performance evaluation by means of a series of benchmark experiments demonstrates the efficiency of TimSim. Also a case study is presented to illustrate the practicability of TimSim.

关键词： simulator ad-hoc networks database timestep-based source code

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Geographic multipath routing in duty-cycled wireless sensor networks with energy harvesting

Geographic multipath routing in duty-cycled wireless sensor ...

引用

2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013

作者： Han, Guangjie Dong, Yuhui Shu, Lei Guo, Hui Niu, Jianwei Nantong Ocean and Coastal Engineering Research Institute Hohai University China Key Laboratory of Sensor Networks and Environmental Sensing Changzhou China Department of Information and Communication Engineering Hohai University Changzhou China Patent Examination Cooperation Center SIPO Jiangsu China College of Electronic Information and Computer Guangdong University of Petrochemical Technology China School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9780769550466

With developments of energy harvesting technolo-gies, rechargeable Wireless Sensor networks (WSNs) are in-creasing. This paper introduces the energy renewable property and further proposes a novel 2-hop geographic node-disjoint multi-path routing algorithm TPGFPlus in energy consumption balanced duty-cycled WSNs. In our TPGFPlus, a forwarding node selects its next-hop node which is closest to the based station among all its 1-hop and 2-hop neighbor nodes. Moreover, to prolong network lifetime, not all the nodes are awake for sensing and communication in our work since a sleep scheduling algorithm (EC-CKN) is applied to make the network be duty-cycled. We further evaluate the performance of TPGFPlus algorithm under three different forwarding policies, to meet different application requirements. Analysis and simulation results show that TPGFPlus out-performs previous algorithm TPGF on finding more average number of paths and shorter average length of paths, yet without causing additional energy consumption. We also validate different forwarding policies that bring distinct performance improvements. © 2013 IEEE.

关键词： Energy harvesting

来源：评论

学校读者我要写书评

暂无评论

Orthogonal particle swarm optimization algorithm and its application in circuit design

引用

Telkomnika - Indonesian Journal of Electrical Engineering 2013年第6期11卷 2926-2932页

作者： Yan, Xuesong Wu, Qinghua Liu, Hammin School of Computer Science China University of Geosciences Wuhan China Hubei Provincial Key Laboratory of Intelligent Robot Wuhan Institute of Technology Wuhan China School of Computer Science and Engineering Wuhan Institute of Technology Wuhan China Wuhan Institute of Shipbuilding Technology Wuhan China

In this paper, aim at the disadvantages of standard Particle Swarm Optimization (PSO) algorithm like being trapped easily into a local optimum, we improves the standard PSO and proposes a new algorithm to solve the overcomes of the standard PSO. The new algorithm keeps not only the fast convergence speed characteristic of PSO, but effectively improves the capability of global searching as well. Experiment results reveal that the proposed algorithm can find better solutions when compared to the standard particle swarm optimization algorithm. We use the proposed algorithm for digital circuit optimization design, and the final circuit is optimized in terms of complexity (with the minimum number of gates). © 2013 Universitas Ahmad Dahlan.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：