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

Towards accountable authority attribute-based encryption

High Technology Letters 2013年第1期19卷 82-87页

作者：王永涛 Chen Kefei Long Yu Department of Computer Science and Engineering Shanghai Jiao Tong University China Information Technology Security Evaluation Center Shanghai Key Laboratory of Scalable Computing and System Shanghai JiaoTong University

An accountable authority attribute-based encryption （A-ABE） scheme is presented in this paper. The notion of accountable authority identity-based encryption （A-IBE） was first introduced by Goyal at Crypto＇07. It is a novel approach to mitigate the （inherent） key escrow problem in identity-based cryptosystems. In this work, the concept of accountable authority to attribute-based encryption （ABE） setting is generalized for the first time, and then a construction is given. The scheme non-trivially integrates an A-IBE scheme proposed by Libert et al. with an ABE scheme. In our construction, a user will be identified by a pair （ id, o~）, where id denotes the user＇ s identity and ω denotes the set of attributes associated to the user. In addition, our construction is shown to be secure under some reasonable assumptions.

关键词： cryptography attribute-based encryption accountable authority key escrow traceability

来源：评论

学校读者我要写书评

暂无评论

Social incentive policies to engage commercial building occupants in demand response

Social incentive policies to engage commercial building occu...

引用

2014 IEEE International Conference on Automation science and Engineering, CASE 2014

作者： Li, Sisi Deng, Kun Zhou, Meng Chu Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07012 United States Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai201804 China Coordinated Science Laboratory University of Illinois at Urbana-Champaign UrbanaIL61801 United States

Occupants' comfort is the primary target in a building operation. However their efforts are often neglected and ruled out from traditional control strategies of energy-efficient building management systems. Occupant-engaged control strategies have recently attracted many research attentions and demonstrated great potentials for energy saving. With them, occupants' behavior is incorporated into the closed-loop control methods in which their initiatives actively contribute to building services and energy utility by explicitly expressing their preferences. This work proposes an occupant-engaged demand response (DR) strategy for building automation in which occupants are actively engaged to adapt their energy consumption in response to incentive opportunities designed by facility managers. A model-based study and a Nash-Equilibrium-based solution are provided to assist facility managers with the design of social incentive policies to promote occupant participation, along with the guarantee of lucrativeness for a DR event. © 2014 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Process Passing Calculus,Revisited

引用

Journal of shanghai Jiaotong university(science) 2013年第1期18卷 29-36页

作者：尹强龙环 Laboratory of Basic Study in Computing Science MOE-MS Key Laboratory for Intelligent Computing and Intelligent SystemsDepartment of Computer Science and EngineeringShanghai Jiaotong University

In the context of process calculi, higher order π calculus （A calculus） is prominent and popular due to its ability to transfer processes. Motivated by the attempt to study the process theory in an integrated way, we give a system study of A calculus with respect to the model independent framework. We show the coincidence of the context bisimulation to the absolute equality. We also build a subbisimilarity relation from A calculus to the π calculus.

关键词： higher order π-calculus encoding expressiveness bisimulation

来源：评论

学校读者我要写书评

暂无评论

A generic tree-like index framework in the cloud

A generic tree-like index framework in the cloud

引用

14th International Conference on Web Information systems Engineering, WISE 2013

作者： Yin, Yue Yao, Bin Shen, Yao Guo, Minyi Xu, Changliang Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science and Engineering Shanghai Jiao Tong University China Alibaba Cloud Computing Company China

ISBN: (纸本)9783642412295

In this study, we present a novel tree based index scheme for efficient indexing and serving large datasets in the cloud. It incorporates and extends the functionality of Hadoop to create a fully parallel index system. Our new scheme can be summarized as follows. First, we leverage the MapReduce framework to create an index, then publish the index meta information and write it into a meta table. Second, we use the meta information to help the system adopting an efficient method to handle a given query. Finally, we optimize the system by using cache mechanism. We conduct extensive experiments on the Hadoop cluster to demonstrate the scalability, availability and efficiency of the proposed index framework. © 2013 Springer-Verlag.

关键词： Data warehouses

来源：评论

学校读者我要写书评

暂无评论

Human Activity Recognition using Smart Phone Embedded Sensors: A Linear Dynamical systems Method

Human Activity Recognition using Smart Phone Embedded Sensor...

引用

International Joint Conference on Neural Networks

作者： Wen Wang Huaping Liu Lianzhi Yu Fuchun Sun School of Optical-Electrical and Computer Engineering University of Shanghai for Science and Technology Shanghai China Department of Computer Science and Technology State Key Laboratory of Intelligent Technology and Systems Beijing China

This paper presents a novel framework of human activity recognition with time series collected from inertial sensors. We model each action sequence with a collection of Linear Dynamic systems (LDSs), each LDS describing a small patch of the sequence. A codebook is formed by using the K-medoids clustering algorithm and a Bag-of-systems (BoS) is developed to represent the time series. A great advantage of this method is that the complicated feature design procedure is avoided and the LDSs can well capture the dynamics of the time series. Our experiment validation on public dataset shows the promising results.

关键词： Time series analysis Feature extraction Smart phones Intelligent sensors Sensor systems Support vector machine classification

来源：评论

学校读者我要写书评

暂无评论

Automated web service composition supporting conditional branch structures

引用

Enterprise Information systems 2014年第1期8卷 121-146页

作者： Wang, Pengwei Ding, Zhijun zhijun_ding@*** Jiang, Changjun Zhou, Mengchu Department of Computer Science and Technology Tongji University Shanghai 201804 China Key Laboratory of “Embedded System and Service Computing” Ministry of Education Shanghai 201804 China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ 07102 USA

The creation of value-added services by automatic composition of existing ones is gaining a significant momentum as the potential silver bullet in service-oriented architecture. However, service composition faces two aspects of difficulties. First, users' needs present such characteristics as diversity, uncertainty and personalisation; second, the existing services run in a real-world environment that is highly complex and dynamically changing. These difficulties may cause the emergence of nondeterministic choices in the process of service composition, which has gone beyond what the existing automated service composition techniques can handle. According to most of the existing methods, the process model of composite service includes sequence constructs only. This article presents a method to introduce conditional branch structures into the process model of composite service when needed, in order to satisfy users' diverse and personalised needs and adapt to the dynamic changes of real-world environment. UML activity diagrams are used to represent dependencies in composite service. Two types of user preferences are considered in this article, which have been ignored by the previous work and a simple programming language style expression is adopted to describe them. Two different algorithms are presented to deal with different situations. A real-life case is provided to illustrate the proposed concepts and methods. [ABSTRACT FROM AUTHOR]

关键词： conditional branch structure control construct service composition user preference web service

来源：评论

学校读者我要写书评

暂无评论

An interpretation of Erlang into value-passing calculus

引用

Journal of Networks 2013年第7期8卷 1504-1513页

作者： Huang, Hao Yang, Fei Department of Computer Science Shanghai Jiaotong University MOE-MS Key Laboratory for Intelligent Computing and Intelligent Systems China

In this paper we present a new process calculus VPCΣ and an interpretation for core Erlang. VPCΣ is at least as expressive as VPC and it is more effective for verification with some built-in functions. The wellestablished symbolic bisimulation in value-passing calculus is now helpful for solving the infinite-state space problem of data values in equivalence checking and verfication. Compared to the previous formalization work of modeling core Erlang in π-calculus, the new interpretation has the following main merits: some essential features for Erlang are implemented faithfully;and above all the soundness of the interpretation is proved with respect to late symbolic bisimulation. © 2013 ACADEMY PUBLISHER.

关键词： Calculations

来源：评论

学校读者我要写书评

暂无评论

Team of Bayesian optimization algorithms to solve task assignment problems in heterogeneous computing systems

Team of Bayesian optimization algorithms to solve task assig...

引用

IEEE International Conference on systems, Man and Cybernetics

作者： Jie Li JunQi Zhang Qi Kang ChangJun Jiang Ministry of Education China Key Laboratory of Embedded System and Service Computing Department of Computer Science and Technology Tongji University Shanghai Department of Control Science and Engineering Tongji University Shanghai China

ISBN: (纸本)9781479938414

A Bayesian optimization algorithm (BOA) belongs to estimation of distribution algorithms (EDAs). It is characterized by combining a Bayesian network and evolutionary algorithms to solve nearly decomposable optimization problems. BOA is less popularly applied to solve high dimensionality complex optimization problems. A key reason is that the cost of training all dimensions by BOA becomes expensive with the increase of problem dimensionality. Since data are relatively sparse in a high dimensional space, even though BOA can train all dimensions simultaneously, the interdependent relations between different dimensions are difficult to learn. Its search ability is thus significantly reduced. In this paper, we propose a team of Bayesian optimization algorithms (TBOA) to search and learn dimensionality. TBOA consists of multiple BOAs, in which each BOA corresponds to a dimension of the solution domain and it is responsible for the search of this dimension's value region. The proposed TBOA is used to solve the real problem of task assignment in heterogeneous computing systems. Extensive experiments demonstrate that the computational cost of the overall training in TBOA is decreased very significantly while keeping high solution accuracy.

关键词： Bayes methods Sociology Statistics Optimization Computational efficiency Joints Probability distribution

来源：评论

学校读者我要写书评

暂无评论

Evolving Commitments for Self-Adaptive Socio-technical systems

Evolving Commitments for Self-Adaptive Socio-technical Syste...

引用

IEEE International Conference on Engineering of Complex computer systems

作者： Xin Peng Yi Xie Yijun Yu John Mylopoulos Wenyun Zhao Shanghai Key Laboratory of Data Science Fudan University China Department of Computing The Open University UK Department of Information Engineering and Computer Science University of Trento Italy

Socio-technical systems (STSs) consist of human, hardware and software agents that work in tandem to fulfill stakeholder requirements. A specification for an STS consists of a set of (social) commitments among participating agents that serve as a contract among them. However, by their very nature, STSs are open, dynamic and continuously evolving along with their environments. To ensure that such systems continue to satisfy their requirements, the agents that comprise an STS must continuously adapt their behaviors to take into account risks and opportunities that arise at runtime. This paper presents a decision-theoretic self-adaptation framework that proposes candidate adaptation strategies for participating agents. These strategies are implementable by reconfiguration of plans or even changes in contractual commitments among agents. The adaptation procedure involves negotiating commitment changes and possible compensations to/from creditor agents. To evaluate the proposal, the paper also presents the results of an experimental study with a simulated STS, which confirms that success rates for achieving stakeholder goals and overall trade off utility can be improved significantly by incorporating evolving commitments to support STS adaptation.

关键词： Adaptation models Switches Motorcycles Estimation Proposals Lifting equipment Protocols

来源：评论

学校读者我要写书评

暂无评论

Automated Coverage-Driven Test Data Generation Using Dynamic Symbolic Execution

Automated Coverage-Driven Test Data Generation Using Dynamic...

引用

International Conference on Secure System Integration and Reliability Improvement, SSIRI

作者： Ting Su Geguang Pu Bin Fang Jifeng He Jun Yan Siyuan Jiang Jianjun Zhao Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China State Key Laboratory of Computer Science Chinese Academy of Sciences Beijing China Department of Computer Science and Engineering University of Notre Dame USA School of Software Shanghai Jiao Tong University Shanghai China

Recently code transformations or tailored fitness functions are adopted to achieve coverage (structural or logical criterion) driven testing to ensure software reliability. However, some internal threats like negative impacts on underlying search strategies or local maximum exist. So we propose a dynamic symbolic execution (DSE) based framework combined with a path filtering algorithm and a new heuristic path search strategy, i.e., predictive path search, to achieve faster coverage-driven testing with lower testing cost. The empirical experiments (three open source projects and two industrial projects) show that our approach is effective and efficient. For the open source projects w.r.t branch coverage, our approach in average reduces 25.5% generated test cases and 36.3% solved constraints than the traditional DSE-based approach without path filtering. And the presented heuristic strategy, on the same testing budget, improves the branch coverage by 26.4% and 35.4% than some novel search strategies adopted in KLEE and CREST.

关键词： Testing Search problems Heuristic algorithms Educational institutions Electronic mail Prediction algorithms Engines

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：