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

Block composition algorithm for constructing orthogonal n-ary operations

DISCRETE MATHEMATICS 2017年第8期340卷 1957-1966页

作者： Fryz, Iryna V. Sokhatsky, Fedir M. Khmelnytskyi Natl Univ Inst Ka Str 11 UA-29016 Khmelnytskyi Ukraine Donetsk Natl Univ 600 Richia Str 21 UA-21000 Vinnytsia Ukraine

We propose an algorithm for constructing orthogonal n-ary operations which is called a block composition algorithm here. Input data of the algorithm are two series of different arity operations being distributed by blocks. The algorithm consists of two parts: composition algorithm for constructing n-ary operations with orthogonal retracts from given blocks of operations and block-wise recursive algorithm for constructing orthogonal n-ary operations from obtained operations. Obtained results are illustrated by examples of orthogonal n-ary operations which are constructible by block-wise recursive algorithm and non-constructible by the well-known trivial recursive algorithm. (C) 2016 Elsevier B.V. All rights reserved.

关键词： Orthogonality of operations Retract orthogonality of operations composition algorithm Block-wise recursive algorithm Block composition algorithm

来源：评论

学校读者我要写书评

暂无评论

A SDN/NFV Security Protection Architecture with a Function composition algorithm Based on Trie 18

A SDN/NFV Security Protection Architecture with a Function C...

引用

2nd International Conference on Computer Science and Application Engineering (CSAE)

作者： Hao, Zheng Lin, Zhaowen Li, Ran Beijing Univ Posts & Telecommun Inst Network Technol Network & Informat Ctr Beijing 100876 Peoples R China Sci & Technol Informat Transmiss & Disseminat Com Shijiazhuang 050081 Hebei Peoples R China Natl Engn Lab Mobile Network Secur Beijing 100876 Peoples R China

ISBN: (纸本)9781450365123

Software(1) Defined Network (SDN) is a new type of network architecture that has advantages over traditional network. For SDN, security is a basic issue. SDN controller has received considerable attention in the researches on SDN security. Researchers assign security tasks to SDN controllers generally, but it puts a heavy burden on the SDN controller and leads to a decrease in system stability. On the basis of previous work, we propose a new security protection architecture based on SDN/NFV. Meanwhile, a security function virtual machine pool is designed in infrastructure layer in architecture. It can create virtual machines and manage the ip addresses of the virtual machines automatically, which improves the flexibility and expandability of the architecture. Moreover, a function composition algorithm based on Trie (FCT) has been introduced. We deploy the security protection architecture on VMware cloud platform to validate the availability of the architecture and use experimental data to prove FCT algorithm has good performance.

关键词： SDN NFV security protection architecture composition algorithm

来源：评论

学校读者我要写书评

暂无评论

A composition algorithm for Reusable Workflow Models 20

A Composition Algorithm for Reusable Workflow Models

引用

23rd ACM/IEEE International Conference on Model Driven Engineering Languages and Systems (MODELS)

作者： Devine, Daniel Alam, Omar Kienzle, Jorg Siow, Cheuk Chuen Trent Univ Peterborough ON Canada McGill Univ Montreal PQ Canada

ISBN: (纸本)9781450381352

The use of model composition algorithms is becoming more widespread. For example, model composition can be applied in the context of Software Product Lines when integrating optional features, or when reusing models in multiple contexts. While composition of structural models is relatively straightforward, behavioural composition is more challenging. In this paper, we propose a composition algorithm for workflow-oriented (modelling) languages, and show how the same algorithm can be reused to compose models expressed with two different requirement modelling languages: Use Case Maps (UCM) and Use Case Specifications (UCS). Despite UCM being a graphical language and UCS being a textual language, both modelling languages model software/system functionality by describing a series of responsibilities or steps. We discuss the effectiveness of our algorithm using an example and a case study.

关键词： Reuse Workflow Languages Use Case Diagram Use Case Map composition algorithm

来源：评论

学校读者我要写书评

暂无评论

Criticality-aware Service composition for Cloud and Network Brokerage 4

Criticality-aware Service Composition for Cloud and Network ...

引用

4th IEEE International Conference on Cloud Networking (CloudNet)

作者： Bouet, Mathieu Lopez-Ramos, Mario Dotaro, Emmanuel Pouyllau, Helia Thales Commun & Secur 4 Ave Louvresses F-92230 Gennevilliers France Thales Res & Technol F-91767 Palaiseau France

ISBN: (纸本)9781467395014

Organizations could leverage many existing self-service provisioning offers (compute, storage, network, security... as a service) for better flexibility and cost control. However, they are discouraged by the diversity and the complexity of composing such services with guarantees. In this paper, we propose a cloud and network broker that serves requests for end-to-end "service packages" by composing, provisioning and stitching together in a coherent way diverse cloud and network services from different providers. Our composition algorithm takes into account multiple criteria such as consumer constraints on QoS, cost and criticality, as well as broker policies in order to determine the optimal placement. The evaluation results sustain the applicability of our approach through the efficiency and speed of the composition strategies with complex requests and large service catalogs.

关键词： cloud computing quality of service safety-critical software QoS cloud brokerage cloud services composition algorithm consumer constraints criticality-aware service composition end-to-end service packages large service catalogs network brokerage network services Cloud computing Complexity theory Conferences Linear programming Quality of service Security Servers Quality of service Cloud Computing safety-critical software Complexity theory Servers linear programming CLOUDS Clouds Security

来源：评论

学校读者我要写书评

暂无评论

Research on Converged Service composition Based on Extending CSTA Services with OWL-S

Research on Converged Service Composition Based on Extending...

引用

5th International Conference on Wireless Communications, Networking and Mobile Computing

作者： Peng Rongqun Mi Zhengkun Wang Lingjiao Nanjing Univ Posts & Telecommun Coll Commun & Informat Engn Nanjing 210003 Peoples R China

ISBN: (纸本)9781424436927

Automatic service composition converging these two services in telecom and web realm can hardly achieved by far inasmuch as the absent semantic services interface defined with WSDL. In this paper, after analyzing the shortcoming of these existing description technologies of web services and telecommunication services, we put forward an extending method via enriching the content of OWL-S Profile document with OWL-S to CSTA services specified in ECMA specifications, and an improved algorithm of forward chaining automatic service composition to facilitate the converged service composition between network services and telecommunication services. The proposed technique is applied to an automatic stock quote scenario and composition results are presented demonstrating the rationality of these proposed ideas.

关键词： extending CSTA service converged service composition OWL-S composition algorithm

来源：评论

学校读者我要写书评

暂无评论

On problems without polynomial kernels

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2009年第8期75卷 423-434页

作者： Bodlaender, Hans L. Downey, Rodney G. Fellows, Michael R. Hermelin, Danny Univ Haifa Dept Comp Sci IL-31905 Haifa Israel Univ Utrecht Dept Informat & Comp Sci NL-3508 TB Utrecht Netherlands Victoria Univ Wellington Sch Math Stat & Comp Sci Wellington 600 New Zealand Univ Newcastle Callaghan NSW 2308 Australia

Kernelization is a strong and widely-applied technique in parameterized complexity. A kernelization algorithm, or simply a kernel, is a polynomial-time transformation that transforms any given parameterized instance to an equivalent instance of the same problem, with size and parameter bounded by a function of the parameter in the input. A kernel is polynomial if the size and parameter of the output are polynomially-bounded by the parameter of the input. In this paper we develop a framework which allows showing that a wide range of FPT problems do not have polynomial kernels. Our evidence relies on hypothesis made in the classical world (i.e. non-parametric complexity), and revolves around a new type of algorithm for classical decision problems, called a distillation algorithm, which is of independent interest. Using the notion of distillation algorithms, we develop a generic lower-bound engine that allows us to show that a variety of FPT problems, fulfilling certain criteria, cannot have polynomial kernels unless the polynomial hierarchy collapses. These problems include k-PATH, k-CYCLE, k-EXACT CYCLE, k-SHORT CHEAP TOUR, k-GRAPH MINOR ORDER TEST, k-CUTWIDTH, k-SEARCH NUMBER, k-PATHWIDTH, k-TREEWIDTH. k-BRANCHWIDTH, and several optimization problems parameterized by treewidth and other structural parameters. (C) 2009 Elsevier Inc. All rights reserved.

关键词： Parameterized complexity Kernelization Polynomial kernels Lower bounds Distillation algorithm composition algorithm Polynomial hierarchy

来源：评论

学校读者我要写书评

暂无评论

A Generic Access Control Model based on Ontology

A Generic Access Control Model based on Ontology

引用

IEEE International Conference on Wireless Communications, Networking and Information Security (WCNIS)

作者： Wang Zhen-wu China Univ Min & Technol Sch Mech Elect & Informat Engn Beijing Peoples R China

ISBN: (纸本)9781424458516

In this paper, we mainly analyze the generic knowledge of access control method, and propose an ontology-based access control model which can describe different access control models. The paper details the formal description of access control ontologies, and proposes the composition algorithm which is based on access ontology. At last we give a prototype system which uses this model, the practice proves that the access control model can enhance the development efficiency and reduce the costs.

关键词： access control ontology composition algorithm

来源：评论

学校读者我要写书评

暂无评论

A composition Model of Enterprise Information System Based on Domain Ontology

A Composition Model of Enterprise Information System Based o...

引用

2010 2nd IEEE International Conference on Information Management and Engineering(2010年IEEE第二届信息管理与工程国际会议 IEEE ICIME 2010)

作者： WANG Zhen-wu CHEN Ming Xie Jun School of Mechanical Electronic & InformationEngineeringChina University of Ming &Technology Beijin Information Engineering CollegeCapital Normal UniversityBeijing China Information Engineering College Capital Normal University Beijing China

Through analyzing the architecture and domain commonness of enterprise information system (EIS), the paper proposes a composition model of EIS based on domain ontology. The paper specially gives the formal description of EIS domain ontology, and proposes the composition algorithm based on semantic similarity of concepts in domain ontology. At last this paper gives an example which uses the composition model. The practice proves that this model can enhance the efficiency of software development, and can reduce the development costs.

关键词： domain commonness EIS domain ontology composition algorithm semantic similarity.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：