A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Inspired by the idea of the terrestrial TIN-DEM multi-scale expression algorithm, most of the existing non-nautical TIN-DDM automatic synthesis algorithms are improved by the terrestrial TIN-DEM multi-scale ... Based on Surfer to generate the terrain surface and the contour map with a depth of 5 meters after the synthesis of each algorithm, as shown in Figure 2 and 3. ... Topographic surface and 5-meter contour of the test sea area ...doi:10.5194/ica-abs-3-126-2021 fatcat:ciuejygyabczdawk3xiwbuaozq
Artificial Life 14: Proceedings of the Fourteenth International Conference on the Synthesis and Simulation of Living Systems
This paper is an extended abstract of Koos et al. (2013a). Figure 1: (A) The hexapod robot is not damaged. (B) The left middle leg is no longer powered. ... The main proposition of this approach is to make the optimization algorithm aware of the limits of the simulation. ... This paper is an extended abstract of Koos et al. (2013a) . ...doi:10.7551/978-0-262-32621-6-ch026 fatcat:egoa54vsljelzpplgcmaj3tjbq
It relaxes some requirements of synthesis observation equivalence from previous work, so that better abstractions can be made. ... The paper describes the algorithm, adapted from known bisimulation equivalence algorithms, for the improved abstraction method. ... (H T )) = L(G T supCN (G T )) . (7) Synthesis abstraction requires that the supervisor synthesised from the abstracted automaton H together with the rest of the system T , yields the same language when ...doi:10.3182/20121003-3-mx-4033.00040 fatcat:cfdn7xijrrgazgekcqm4vguzqq
The synthesis algorithm aggregates detailed rudimentary elements of the system to form Capabilities. ... To formulate these functional abstractions we develop and investigate two algorithms for Capability identification: Synthesis and Decomposition. ... synthesis algorithm. ...doi:10.1109/ecbs.2007.61 dblp:conf/ecbs/RavichandarAB07 fatcat:et3bmwv3t5hytnleq2ksl52iti
Using abstract queries to represent the search space nicely decomposes the synthesis problem into two tasks: (1) searching for abstract queries that can potentially satisfy the given I/O examples, and ... Our key innovation is the development of a language for abstract queries, i.e., queries with uninstantiated operators, that can express a large space of SQL queries efficiently. ... Abstract Query Synthesis The first part of the algorithm is abstract query synthesis, the goal of which is presented by the completeness condition below. Definition 2. ...doi:10.1145/3062341.3062365 dblp:conf/pldi/WangCB17 fatcat:ap2kzhjks5cinofsafl3xxs3oe
Automation and Remote Control
INTRODUCTION In considering the possibility of constructing algorithms for the abstract synthesis of sequential machines (S- machines) in the questionnaire language , it was seen that it is always possible ... THE ABSTRACT SYNTHESIS OF SEQUENTIAL MACHINES FROM THE ANSWERS TO QUESTIONS OF THE FIRST KIND IN THE QUESTIONNAIRE LANGUAGE (UDC 62-507,15) my, Ry FET (Moscow) Translated from Avtomatika i Telemekhanika ...
The algorithm uses abstractions to divide the search space of programs into subspaces by computing an abstract value that represents outputs for all programs in a subspace. ... The abstract value allows our algorithm to compute, for each subspace, a sound approximate lower bound of the loss over all programs in the subspace. ... Universe of predicates: Given a DSL, our algorithm is parameterized by a universe U of predicates, that our algorithm uses to construct abstractions for our synthesis algorithm. ...arXiv:2104.13315v1 fatcat:nk5bfzwx3nhorkiifjqfg7huui
Abstract| The aim of this paper is to present a communi- ... Most of the allocation algorithms used in high level synthesis may be used to solve this problem 24]. Fig. 8 . ... This algorithm is based on a decision tree. The interface synthesis task may be performed automatically. The key issue in this scheme is the use of an abstract and general communication model. ...doi:10.1109/92.555993 fatcat:zzp34acojrf45auwjdmmeicjue
Readings in Hardware/Software Co-Design
Abstract| The aim of this paper is to present a communi- ... Most of the allocation algorithms used in high level synthesis may be used to solve this problem 24]. Fig. 8 . ... This algorithm is based on a decision tree. The interface synthesis task may be performed automatically. The key issue in this scheme is the use of an abstract and general communication model. ...doi:10.1016/b978-155860702-6/50033-8 fatcat:nv677yhb7rbotfjv2ox5n3rvvy
Automation and Remote Control
THE POSSIBILITIES OF CONSTRUCTING ALGORITHMS FOR THE ABSTRACT SYNTHESIS OF SEQUENTIAL MACHINES USING THE QUESTIONNAIRE LANGUAGE (UDC 62-507,15) A. ... ” language of questions concerning trees of finite height renders it suitable for all cases, An algorithm is given for the. abstract synthesis on the basis of replies to questions concerning finite trees ...
The paper describes synthesis equivalent abstractions and shows their use in an algorithm to efficiently compute supervisors. ... The state-space explosion is mitigated by the use of abstraction to simplify individual components, and the property of synthesis equivalence guarantees that the final synthesis result is the same as it ... COMPOSITIONAL SYNTHESIS ALGORITHM Given a set of plant automata G, the compositional synthesis algorithm repeatedly composes automata and applies abstraction rules. ...doi:10.1109/tac.2013.2283109 fatcat:bfu7umdf5bfgldvypuhzqx253q
Lecture Notes in Computer Science
However, this method is limited to synthesising systems that execute for a bounded number of steps and is incomplete for synthesis with unbounded safety and reachability objectives. ... We present an extension of this technique to unbounded synthesis. ... Our bounded synthesis algorithm constructs abstractions of the game that restrict actions available to one of the players. ...doi:10.1007/978-3-319-41540-6_20 fatcat:fgjthfchz5cnjaccx7fn3ghdzi
Lecture Notes in Computer Science
(ii) synthesis with refinement propagation: to synthesize fences for a program P , we combine abstraction refinements used for successful synthesis of programs coarser than P into a new candidate abstraction ... We implemented our technique and successfully applied it to several challenging concurrent algorithms, including state of the art concurrent work-stealing queues. ... Abstraction-Guided Fence Synthesis Algorithm 1 provides a declarative description of our approach. ...doi:10.1007/978-3-319-10936-7_15 fatcat:mu4y3whi2bbzhaltvsam7gthm4
While synthesis using abstraction refinement (SYNGAR) could be implemented in different settings, we propose a refinement-based synthesis algorithm that uses abstract finite tree automata (AFTA). ... Because many programs have the same input-output behavior in terms of their abstract semantics, this synthesis methodology significantly reduces the search space compared to existing techniques that use ... The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of the ...doi:10.1145/3158151 dblp:journals/pacmpl/WangDS18 fatcat:epe5sqludjfo3jgikimm2nxply
Both algorithms are efficient, constraint-satisfaction schemes that operate on abstract motion descriptions. The class of synthesis problems for which the methods apply is identified . ... This paper presents two algorithms for kinematic synthesis of mechanisms . A mechanism is specified by its input and output motions . ... In the first phase of synthesis, we find a composition of abstract mechanisms which satisfies the given constraints on R. ...doi:10.1007/bf01638099 fatcat:fkqzqgfjibcvfmf2hzus2pphsa
« Previous Showing results 1 — 15 out of 107,715 results