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

New results for Constraint Markov Chains

PERFORMANCE EVALUATION 2012年第7-8期69卷 379-401页

作者： Delahaye, Benoit Larsen, Kim G. Legay, Axel Pedersen, Mikkel L. Wasowski, Andrzej INRIA IRISA Rennes France Univ Rennes 1 IRISA Rennes France Aalborg Univ Dept Comp Sci Distributed & Embedded Syst Unit Aalborg Denmark IT Univ Copenhagen Programming Languages Log & Semant Grp Copenhagen Denmark

this paper studies compositional reasoning theories for stochastic systems. A specification theory combines notions of specification and implementation with satisfaction and refinement relations, and a set of operators that together support stepwise design. One of the first behavioral specification theories introduced for stochastic systems is the one of Interval Markov Chains (IMCs), which are Markov Chains whose probability distributions are replaced by a conjunction of intervals. In this paper, we show that IMCs are not closed under conjunction, which gives a formal proof of a conjecture made in several recent works. In order to leverage this problem, we suggested to work with Constraint Markov Chains (CMCs) that is another specification theory where intervals are replaced with general constraints. Contrary to IMCs, one can show that CMCs enjoy the closure properties of a specification theory. In addition, we propose aggressive abstraction procedures for CMCs. Such abstractions can be used either to combat the state-space explosion problem, or to simplify complex constraints. In particular, one can show that, under some assumptions, the behavior of any CMC can be abstracted by an IMC. Finally, we propose an algorithm for counter-example generation, in case a refinement of two CMCs does not hold. We present a tool that implements our results. Implementing CMCs is a complex process and relies on recent advances made in decision procedures for theory of reals. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Specification Abstraction Markov Chains Compositional reasoning Reasoning about fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Ordinal Optimization-Based Multi-energy System Scheduling for Building Energy Saving

Ordinal Optimization-Based Multi-energy System Scheduling fo...

引用

7th international conference on Intelligent Computing (ICIC)

作者： Su, Zhong-Hua Jia, Qing-Shan Song, Chen Tsinghua Univ Ctr Intelligent & Networked Syst Dept Automat Beijing 100084 Peoples R China

ISBN: (纸本)9783642259432

Buildings contribute a significant part in the energy consumption and CO2 emission in many countries. Building energy saving has thus become a hot research topic recently. the technology advances in power co-generation, on-site generation, and storage devices bring us the opportunity to reduce the cost and CO2 emission while meeting the demand in buildings. A fundamental difficulty to schedule this multi-energy system. besides other difficulties, is the discrete and large search space. In this paper, the multi-energy scheduling problem is modeled as a nonlinear programming problem with integer variables. A method is developed to solve this problem in two steps, which uses ordinal optimization to address the discrete and large search space and uses linear programming to solve the remaining sub-problems. the performance of this method is theoretically quantified, and compared with enumeration and a priority-and-rule-based scheduling policy. Numerical results show that our method provides a good tradeoff between the solution quality and the computational time comparing with the other two methods. We hope this work brings more insight on multi-energy scheduling problem in general.

关键词： Multi-energy system ordinal optimization linear programming building energy saving renewable energy

来源：评论

学校读者我要写书评

暂无评论

Static single information form for abstract compilation

Static single information form for abstract compilation

引用

7th IFIP TC 1/WG 2.2 international conference on theoretical Computer Science, TCS 2016

作者： Ancona, Davide Lagorio, Giovanni DIBRIS Università di Genova Italy

ISBN: (纸本)9783642334740

In previous work we have shown that more precise type analysis can be achieved by exploiting union types and static single assignment (SSA) intermediate representation (IR) of code. In this paper we exploit static single information (SSI), an extension of SSA proposed in literature and adopted by some compilers, to allow assignments of more precise types to variables in conditional branches. In particular, SSI can be exploited rather easily and effectively to infer more precise types in dynamic object-oriented languages, where explicit runtime typechecking is frequently used. We show how the use of SSI form can be smoothly integrated with abstract compilation, our approach to static type analysis. In particular, we define abstract compilation based on union and nominal types for a simple dynamic object-oriented language in SSI form with a runtime typechecking operator, to show how precise type inference can be. © IFIP international Federation for Information Processing 2012.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Hierarchical Routing Protocols in Wireless Sensor Networks

Performance Analysis of Hierarchical Routing Protocols in Wi...

引用

7th international conference on Broadband, Wireless Computing, Communication and Applications (BWCCA)

作者： Latif, K. Jaffar, M. Javaid, N. Saqib, M. N. Qasim, U. Khan, Z. A. COMSATS Inst Informat Technol Dept Elect Engn Islamabad Pakistan Univ Alberta Edmonton AB T6G 2M7 Canada Dalhousie Univ Fac Engn Halifax NS B3H 3J5 Canada

ISBN: (纸本)9780769548425

this work focusses on analyzing the optimization strategies of routing protocols with respect to energy utilization of sensor nodes in Wireless Sensor Network (WSNs). Different routing mechanisms have been proposed to address energy optimization problem in sensor nodes. Clustering mechanism is one of the popular WSNs routing mechanisms. In this paper, we first address energy limitation constraints with respect to maximizing network life time using linear programming formulation technique. To check the efficiency of different clustering scheme against modeled constraints, we select four cluster based routing protocols;Low Energy Adaptive Clustering Hierarchy (LEACH), threshold Sensitive Energy Efficient sensor Network (TEEN), Stable Election Protocol (SEP), and Distributed Energy Efficient Clustering (DEEC). To validate our mathematical framework, we perform analytical simulations in MATLAB by choosing number of alive nodes, number of dead nodes, number of packets and number of CHs, as performance metrics.

关键词： Wireless sensor network Energy efficient Residual energy Heterogeneity Network Scalability

来源：评论

学校读者我要写书评

暂无评论

Mean-Entropy Model for Portfolio Selection with Type-2 Fuzzy Returns

引用

7th international conference on Intelligent Computing (ICIC)

作者： Liu, Ying Chen, Yanju Hebei Univ Coll Math & Comp Sci Baoding 071002 Hebei Peoples R China

ISBN: (纸本)9783642245527

Entropy is a measurement of the degree of uncertainty. Mean-entropy method can be used for modeling the choice among uncertain outcomes. In this paper, we consider the portfolio selection problem under the assumption that security returns are characterized by type-2 fuzzy variables. Since the expectation and entropy of type-2 fuzzy variables haven't been well defined, type-2 fuzzy variables need to be reduced firstly. then we propose a mean-entropy model with reduced variables. To solve the proposed model, we use the entropy formula of reduced fuzzy variable and transform the mean-entropy model to its equivalent parametric form, which can be solved by standard optimization solver.

关键词： Mean-entropy model Portfolio selection Type-2 Fuzzy variable Mean reduction Parametric programming

来源：评论

学校读者我要写书评

暂无评论

the craft of programming interaction

The craft of programming interaction

引用

2nd international Workshop on the Interplay Between User Experience Evaluation and Software Development, I-UxSED 2012 - In Conjunction with the 7th Nordic conference on Human-Computer Interaction, NordiCHI 2012

作者： Lindell, Rikard Mälardalen University Box 883 72123 Västerås Sweden

the creation of useful artefacts with rich experiential qualities required quality driven interaction designers and programmers with the ability to simultaneous problem setting and problem solving. Interaction design is a design practice that defines the appearance and function of digital artefacts. Bridging interaction design and engineering is problematic because design and engineering have different epistemology. Designers are trained to see a plethora of future designs for a situation and explains the phenomena of a context. Engineering focus on problem solving and depends on agreement about ends. In this paper I suggest that the poor state of designers and programmers who are not standing together can be avoided if we give up the claim that software development should be engineering or science, and instead see it as a quality-driven craftsmanship.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

LARA: An aspect-oriented programming language for embedded systems 12

LARA: An aspect-oriented programming language for embedded s...

引用

11th Annual international conference on Aspect Oriented Software Development, AOSD'12

作者： Cardoso, João M.P. Carvalho, Tiago Coutinho, José G.F. Luk, Wayne Nobre, Ricardo Diniz, Pedro C. Petrov, Zlatko Dep. de Engenharia Informática Rua Dr. Roberto Frias s/n 4200-465 Porto Portugal Department of Computing Imperial College London 180 Queen's Gate London SW7 2BZ United Kingdom INESC-ID Rua Alves Redol 9 1000-029 Lisboa Portugal Honeywell International s.r.o Turanka 100 627 00 Brno Czech Republic

ISBN: (纸本)9781450310925

the development of applications for high-performance embedded systems is typically a long and error-prone process. In addition to the required functions, developers must consider various and often conflicting non-functional application requirements such as performance and energy efficiency. the complexity of this process is exacerbated by the multitude of target architectures and the associated retargetable mapping tools. this paper introduces an Aspect-Oriented programming (AOP) approach that conveys domain knowledge and non-functional requirements to optimizers and mapping tools. We describe a novel AOP language, LARA, which allows the specification of compilation strategies to enable efficient generation of software code and hardware cores for alternative target architectures. We illustrate the use of LARA for code instrumentation and analysis, and for guiding the application of compiler and hardware synthesis optimizations. An important LARA feature is its capability to deal with different join points, action models, and attributes, and to generate an aspect intermediate representation. We present examples of our aspect-oriented hardware/software design flow for mapping real-life application codes to embedded platforms based on Field Programmable Gate Array (FPGA) technology. © 2012 ACM.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

functional dependencies on extended relations defined by regular languages

Functional dependencies on extended relations defined by reg...

引用

7th international Symposium on Foundations of Information and Knowledge Systems, FoIKS 2012

作者： Szabó, Gyula I. Benczúr, András Eötvös Loránd University Faculty of Informatics Pazmany Peter setany 1/C 1118 Budapest Hungary

ISBN: (纸本)9783642284717

In this paper, we first rephrase the notion of extended tuple as a sentence from a regular language generated by a grammar G where the nonterminal symbols of the grammar are the attribute names of the tuple. Finite sets of extended tuples play the role of extended relation instances. then we introduce the dual language, which generates the accepted tuple-types of the extended relation. We define the syntactical form of functional dependencies for extended relation on the graph of the finite state automaton associated to the dual language. Using this model we can handle extended relations generated by recursive regular expressions too. the implication problem of our class of dependencies is decidable by a version of Chase algorithm specified on the graph of the associated FSA. © 2012 Springer-Verlag.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Synthesis and Fabrication of Aligned Conjugated Polymer thin Films

Synthesis and Fabrication of Aligned Conjugated Polymer Thin...

引用

7th international conference on Processing and Manufacturing of Advanced Materials

作者： Hirahara, Takashi Fujita, Masahiro-Yoshizawa Takeoka, Yuko Rikukawa, Masahiro 7-1 Kioi Cho Chiyoda Ku Tokyo 1028554 Japan

ISBN: (纸本)9783037853030

Fluorene-thiophene copolymers having chiral and azobenzene substituents, PAzB4-T, were synthesized by the Pd-catalyzed Suzuki coupling method. We studied the aligning organization of the main chain of PAzB4-T with the activation of the attached functional groups by thermal annealing and photo-annealing processes. Circular dichroism (CD) measurements revealed that the thermally annealed PAzB4-T spin-coated films exhibited bisignate Cotton effects over the absorption regions of the polymer main chains and the azobenzene side chains due to the formation of chiral assemblies. After the photo-annealing process, which means linearly polarized light irradiation accompanied by thermal annealing, the PAzB4-T spin-coated films showed linear dichroism over the absorption region of the main chains, due to the alignment of azobenzene side chains against the electric field of the linearly polarized light. these results suggested that rigid conjugated polymers were successfully aligned by the alignment of functional groups with the external stimuli.

关键词： Alignment Conjugated Polymers Circular Dichroism

来源：评论

学校读者我要写书评

暂无评论

Differential and linear cryptanalysis using mixed-integer linear programming 7

Differential and linear cryptanalysis using mixed-integer li...

引用

7th China international conference on Information Security and Cryptography, Inscrypt 2011

作者： Mouha, Nicky Wang, Qingju Gu, Dawu Preneel, Bart Department of Electrical Engineering ESAT/SCD-COSIC Katholieke Universiteit Leuven Kasteelpark Arenberg 10 B-3001 Heverlee Belgium Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China Belgium

ISBN: (纸本)9783642347030

Differential and linear cryptanalysis are two of the most powerful techniques to analyze symmetric-key primitives. For modern ciphers, resistance against these attacks is therefore a mandatory design criterion. In this paper, we propose a novel technique to prove security bounds against both differential and linear cryptanalysis. We use mixed-integer linear programming (MILP), a method that is frequently used in business and economics to solve optimization problems. Our technique significantly reduces the workload of designers and cryptanalysts, because it only involves writing out simple equations that are input into an MILP solver. As very little programming is required, both the time spent on cryptanalysis and the possibility of human errors are greatly reduced. Our method is used to analyze Enocoro-128v2, a stream cipher that consists of 96 rounds. We prove that 38 rounds are sufficient for security against differential cryptanalysis, and 61 rounds for security against linear cryptanalysis. We also illustrate our technique by calculating the number of active S-boxes for AES. © 2012 Springer-Verlag Berlin Heidelberg.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：