157,929 Hits in 6.7 sec

The Road to Utopia: A Future for Generative Programming [chapter]

Don Batory
2004 Lecture Notes in Computer Science  
The future of software engineering lies in automation and will exploit the combined strengths of generative programming, domain-specific languages, and automatic programming.  ...  I argue that the road that they have so successfully followed is the same road that the generative programming, domain-specific languages, and automatic programming communities are now traversing.  ...  Extensibility of Domain Algebras The success of relational query optimization hinged on the creation of a science to specify and optimize query evaluation programs.  ... 
doi:10.1007/978-3-540-25935-0_1 fatcat:asjkccd6pbcjji3ocu2it5r2zq

A vision of miking: interactive programmatic modeling, sound language composition, and self-learning compilation

David Broman
2019 Proceedings of the 12th ACM SIGPLAN International Conference on Software Language Engineering - SLE 2019  
Specically, two dierent example domains are discussed: (i) modeling, simulation, and verication of cyber-physical systems, and (ii) domain-specic dierentiable probabilistic programming.  ...  The paper describes the main objectives of the vision, as well as concrete research challenges and research directions. CCS Concepts • Theory of computation → Program semantics.  ...  Special thanks to the anonymous reviewers and to Elias Castegren, Oscar Eriksson, Saranya Natarajan, Daniel Lundén, and Viktor Palmkvist for many useful comments.  ... 
doi:10.1145/3357766.3359531 dblp:conf/sle/Broman19 fatcat:a23mi2qhvzadnlsdrndzgfcah4

Algorithm theories and design tactics

Douglas R. Smith, Michael R. Lowry
1990 Science of Computer Programming  
We illustrate this approach with recent work on the theory of global search algorithms and briefly mention several others.  ...  Algorithm theories represent the structure common to a class of algorithms. such as divide-and-conquer or backtrack.  ...  Problems of finding optimal feasible solutions can be treated as extensions of problem theory by adding a cost domain, cost function, and ordering on the cost domain (see [8,18] for examples).  ... 
doi:10.1016/0167-6423(90)90025-9 fatcat:y3zx3y4lirc4hkcjf6jdtfetru

The case for active block layer extensions

Jorge Guerra, Luis Useche, Medha Bhadkamkar, Ricardo Koller, Raju Rangaswami
2008 ACM SIGOPS Operating Systems Review  
ABLE develops a theory behind block layer extensions that helps address key questions about overall storage stack behavior, data consistency, and reliability.  ...  deployment, and (ii) a theoretical framework for reasoning about behavioral properties of individual and collective self-management extensions.  ...  We envision that this theory will be refined based on our experiences with applying the theory to actual implementations of block layer services and service stacks.  ... 
doi:10.1145/1453775.1453778 fatcat:7tmjj4spkfamdj6btfteuq7ifq

Forthcoming papers

1996 Artificial Intelligence  
These results suggest approaches to solving the utility problem from explanation-based learning, the multiple extension problem from nonmonotonic reasoning and the tractability/completeness tradeoff problem  ...  As the task of finding the globally optimal element is often intractable, many practical learning systems instead hill-climb to a local optimum.  ...  a classical propositional theory such that there is a one-toone correspondence between models for the latter and extensions of the former.  ... 
doi:10.1016/s0004-3702(96)90005-3 fatcat:fvhmrv34jzbhbjdzed63fyrvnm

Page 4681 of Mathematical Reviews Vol. , Issue 87h [page]

1987 Mathematical Reviews  
Our approach is based on interpreting in the transform domain an extension which has been previvusly proposed only for one- dimensional systems and had been based on time domain consid- erations.” 87h:  ...  Based on the deterministic theory and requiring only knowledge of bounds on the system uncertainty, a class C of con- tinuous feedback controls (adapted from an earlier paper [Ryan and Corless, IMA J.  ... 

Forthcoming papers

1996 Artificial Intelligence  
reduced problem based on these relevant features.  ...  Automatically selecting and using primary effects in planning: theory and experiments The use of primary effects of operators is an effective approach to improving the efficiency of planning.  ...  Our paper adopts a different, purely theoretical approach, which is based on characterizations of the sets of search tree nodes visited by the backtracking algorithms.  ... 
doi:10.1016/s0004-3702(96)90016-8 fatcat:heev5wzgnbenfpinwk52u2dfzi

Multi-objective reasoning with constrained goal models

Chi Mai Nguyen, Roberto Sebastiani, Paolo Giorgini, John Mylopoulos
2016 Requirements Engineering  
In this work, we exploit advances in automated reasoning technologies, notably Satisfiability and Optimization Modulo Theories (SMT/OMT), and we propose and formalize: (i) an extended modelling language  ...  set of automated reasoning functionalities over CGMs, allowing for automatically generating suitable refinements of input CGMs, under user-specified assumptions and constraints, that also maximize preferences  ...  Conclusions and Future Work We have proposed a goal-based modeling language for requirements that supports the representation of optional requirements, preferences, constraints and more.  ... 
doi:10.1007/s00766-016-0263-5 fatcat:evp4b5nxsrfzrkiplu7otnxltm

Algorithm theories and design tactics [chapter]

Douglas R. Smith, Michael R. Lowry
1989 Lecture Notes in Computer Science  
Problem theories and extensions We briefly review some concepts based on the abstract data type litenr~~re. .A theory is a structure (S, 2, A) consisting of sorts S, operations over th~ti m:ts Zzz, and  ...  that is based on the notion of an algorMm theory which represents the structure common to a class of algorithms, such as divide-and-conquer or backtrack.  ...  Problems of finding optimal feasible solutions can be treated as extensions of problem theory by adding a cost domain, cost function, and ordering on the cost domain (see [8,18] for examples).  ... 
doi:10.1007/3-540-51305-1_23 fatcat:3gdjemkshve63mdbvosudpn554


Tichun WANG, Yuzhu XIE, Hao YAN, Shisheng ZHONG, Yongjian ZHANG
2015 Review of Computer Engineer Studies  
Through establishing the ideal positive and negative domains, it acquires the weighted extension superiority of decision scheme.  ...  | WSG J J and guide vane optimal extension reuse object 0-F-d01 | DY J J .  ...  the optimal adaptive design scheme based on extension superiority.  ... 
doi:10.18280/rces.020402 fatcat:7pcdbpya7bhbncekaf22qhed6i

Simulation Research of Extension Control Based on Crane-Double Pendulum System

Gang Yang, Weiwei Zhang, Ying Huang, Yongquan Yu
2009 Computer and Information Science  
According to the existed structure and algorithm of extension controller, proposed an improved extension control algorithm based on the Optimal Control, which was named LQR-EC, and applied to a SIMO system-Crane-Double  ...  And, using MATLAB simulation platform to study the effect of the LQR-EC Algorithm. The result shows that, the LQR-EC Algorithm not only has a simple theory, but also has rapid response and stability.  ...  In this paper, for crane-double system proposed LQR-EC Algorithm, which is based on the existing EC Algorithm and Optimal Control Theory.  ... 
doi:10.5539/cis.v2n1p103 fatcat:l3nh4dcb6zfrjh4tzd6crtv45q

Page 1817 of Mathematical Reviews Vol. , Issue 96c [page]

1996 Mathematical Reviews  
Summary: “We discuss the use of fuzzy set theory and seman- tic unification for fuzzy clustering and the use of fuzzy rules in knowledge bases.  ...  The understanding of dif- ferent concepts is carried out by the comparison of the extension and intension properties based on selected salient factors.  ... 

FASiM: A Framework for Automatic Formal Analysis of Simulink Models of Linear Analog Circuits [article]

Adnan Rashid, Ayesha Gauhar, Osman Hasan
2020 arXiv   pre-print
In order to facilitate industrial engineers to formally analyze the linear analog circuits based on the Laplace transform, we propose a framework, FASiM, which allows automatically conducting the formal  ...  Simulink is a graphical environment that is widely adapted for the modeling and the Laplace transform based analysis of linear analog circuits used in signal processing architectures.  ...  HOL Light consists of a rich set of formalized theories of multivariable calculus and the Laplace transform theories, which are extensively used in the proposed work..  ... 
arXiv:2001.06702v1 fatcat:pvhvnadd2bggzg57cs47j3cn34

Page 5206 of Mathematical Reviews Vol. , Issue 911 [page]

1991 Mathematical Reviews  
We find solutions for all forms 93 SYSTEMS THEORY; CONTROL 5206 of coordination based on the use of graph theory.  ...  A sequential method based on the frequency-domain optimality con- dition is proposed for achieving the desired pole assignment and determination of the corresponding quadratic performance index.  ... 

Bi-Level Programming Model of Cloud Manufacturing Services Based on Extension Theory

Jinhui Zhao, Yu Zhou
2018 Mathematical Problems in Engineering  
In order to select the proper cloud manufacturing services to satisfy both sides of supplier and demander, a bi-level programming model is proposed based on extension theory in this paper.  ...  Finally, respectively taking satisfactions of the demanders and providers as optimization goal of upper layer and lower layer, a mathematical model of bi-level programming is constructed which is solved  ...  users based on extension theory.  ... 
doi:10.1155/2018/9702910 fatcat:fairk2bjxzfy7dn2beofpbamti
« Previous Showing results 1 — 15 out of 157,929 results