2,059 Hits in 2.6 sec

Generating exact nonlinear ranking functions by symbolic-numeric hybrid method

Liyong Shen, Min Wu, Zhengfeng Yang, Zhenbing Zeng
2013 Journal of Systems Science and Complexity  
At last, the authors demonstrate on some polynomial loop programs from the literature that our algorithm successfully yields nonlinear ranking functions with rational coefficients.  ...  The authors first transform the problem into a parameterized polynomial optimization problem, and obtain a numerical ranking function using polynomial sum-of-squares relaxation via semidefinite programming  ...  In this paper, we propose a symbolic-numeric hybrid method on synthesizing nonlinear ranking functions for polynomial loops.  ... 
doi:10.1007/s11424-013-1004-1 fatcat:5jwgauo6tvaebcwmk5pcifwrue

Efficient synthesis of out-of-core algorithms using a nonlinear optimization solver

Sandhya Krishnan, Sriram Krishnamoorthy, Gerald Baumgartner, Chi-Chung Lam, J. Ramanujam, P. Sadayappan, Venkatesh Choppella
2006 Journal of Parallel and Distributed Computing  
We address the problem of efficient out-of-core code generation for a special class of imperfectly nested loops encoding tensor contractions.  ...  We formulate the problem as a non-linear optimization problem and use a discrete constraint solver to generate optimized out-of-core code.  ...  We are grateful to the Ohio Supercomputer Center (OSC) for the use of their computing facilities.  ... 
doi:10.1016/j.jpdc.2005.06.017 fatcat:vbkqcart6jeyrals3umw2uqohe

Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis [chapter]

Anastasiia Izycheva, Eva Darulova, Helmut Seidl
2020 Lecture Notes in Computer Science  
Our evaluation shows that our approach can efficiently synthesize loop invariants for existing benchmarks from literature, but that it is also able to find invariants for nonlinear loops that today's tools  ...  AbstractWe present an automated procedure for synthesizing sound inductive invariants for floating-point numerical loops.  ...  Since such an automated method does not exist for nonlinear functions, SMT-AI is limited to linear loops.  ... 
doi:10.1007/978-3-030-65474-0_8 fatcat:g62rmena2ranrmrobp6jmwqhde

Combined loop transformation and hierarchy allocation for data reuse optimization

Jason Cong, Peng Zhang, Yi Zou
2011 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)  
High-level synthesis; loop transformation; memory hierarchy optimization; data reuse I.  ...  Loop transformation for data locality and memory hierarchy allocation are two major steps in data reuse optimization flow. But they were carried out independently.  ...  Figure 1 . 1 (a) Original loop nest. (b) Iterations of original loop nest. (c) Transformation T0 for locality of all data references. (d) Transformation T1 for locality of selected data references.  ... 
doi:10.1109/iccad.2011.6105324 dblp:conf/iccad/CongZZ11 fatcat:4gmi6ouh5vgzdljdkk5nddggee

Input-Output Example-Guided Data Deobfuscation on Binary

Yujie Zhao, Zhanyong Tang, Guixin Ye, Xiaoqing Gong, Dingyi Fang, Zhiyuan Tan
2021 Security and Communication Networks  
Besides, we also combine the program synthesis and a heuristic search algorithm of Nested Monte Carlo Search.  ...  Existing work has two limitations: assuming that obfuscated code snippets in the target program are known and using a stochastic search algorithm resulting in low efficiency.  ...  First, AutoSimpler can only synthesize loop-free programs.  ... 
doi:10.1155/2021/4646048 fatcat:hueuiilbmvdb3ncyzwz6rwg5wu

Ranking Templates for Linear Loops

Jan Leike, Matthias Heizmann, Erika Abraham
2015 Logical Methods in Computer Science  
We present a new method for the constraint-based synthesis of termination arguments for linear loop programs based on linear ranking templates.  ...  Our approach generalizes existing methods and enables us to use templates for many different ranking functions with affine-linear components.  ...  On linear loop programs, both algorithms involve choosing an ordering on the loop disjuncts.  ... 
doi:10.2168/lmcs-11(1:16)2015 fatcat:jw3cdne6pbbrldnkav2mp72d5u

Improving the Performance of Orbitally-Stabilizing Controls for the Furuta Pendulum

Carlos Vivas Venegas, Francisco R. Rubio
2003 IFAC Proceedings Volumes  
This paper presents an approach to compute suboptimal nonlinear Hoc controls for orbital stabilization of a certain class of underactuated systems.  ...  Additionally. to solve the Hamilton-Jacobi-Bellman equation (HJBE) arising in the nonlinear Hoc framework. an approximate solution is provided. based on a Galerkin-like approximation scheme.  ...  :>o ) S ( i+1) _ _ _ C Tu et v - 2 1 --:::~-- (J uX The algorithm consists of two nested iterations corresponding to the min -max problem associated with the nonlinear H x control paradigm.  ... 
doi:10.1016/s1474-6670(17)38871-7 fatcat:vzuhlw24gvgfvjug7b3c6o6dny

Service Arms with Unconventional Robotic Parameters for Intricate Workstations: Optimal Number and Dimensional Synthesis

Satwinder Singh, Ekta Singla
2016 Journal of Robotics  
A7-link service arm, synthesized using the proposed method, is able to fulfill two different tasks effectively.  ...  For each iteration of the upper level, a constrained nonlinear problem is solved for dimensional synthesis of the manipulator.  ...  In the inner loop, a nonlinear optimization problem has been formulated and augmented Lagrangian method is used to solve the highly constrained problem. mid is the value at which design vector x is to  ... 
doi:10.1155/2016/3537068 fatcat:snwb7bceivejfaai7ztec6peom

Semi-Supervised Trajectory-Feedback Controller Synthesis for Signal Temporal Logic Specifications [article]

Karen Leung, Marco Pavone
2022 arXiv   pre-print
Offline, we synthesize a trajectory-feedback neural network controller via an adversarial training scheme that summarizes past spatio-temporal behaviors when computing controls, and then online, we perform  ...  We demonstrate the efficacy of our approach with an illustrative case study and show that our proposed controller outperforms a state-of-the-art shooting method in both performance and computation time  ...  Overview Our method represents a middle ground between recedinghorizon open-loop control and closed-loop control.  ... 
arXiv:2202.01997v1 fatcat:h5y47yhpm5dtnmmtyn5iyv6a5y

Automated Synthesis of Safe Digital Controllers for Sampled-Data Stochastic Nonlinear Systems [article]

Fedor Shmarov and Sadegh Soudjani and Nicola Paoletti and Ezio Bartocci and Shan Lin and Scott A. Smolka and Paolo Zuliani
2019 arXiv   pre-print
To rule out unstable candidate controllers, we prove and utilize Lyapunov's indirect method for instability of sampled-data nonlinear systems.  ...  Our method derives digital controllers such that the corresponding closed-loop system, modeled as a sampled-data stochastic control system, satisfies a safety specification with probability above a given  ...  The synthesis algorithm, summarized in Algorithm 1, consists of two nested loops. The inner loop (lines 4-9) consists of two main stages: optimization and verification.  ... 
arXiv:1901.03315v1 fatcat:ecahc2u6wjfondsyqxblf3pat4

Constrained multiobjective PSO and T-S fuzzy models for predictive control

2018 Turkish Journal of Electrical Engineering and Computer Sciences  
In this context, the current study describes a new multivariable predictive control scheme formulated by using the T-S fuzzy modeling method and a new constrained multiobjective PSO algorithm.  ...  The T-S fuzzy modeling technique is applied to forecast the behaviors of the nonlinear system. It also aims at establishing some conditions so that the proposed control loop is asymptotically stable.  ...  In the current paper, the proposed algorithm is based on the employment of two nested loops, which use two counter variables, pk ∈ { 1, .., M f } and pj ∈ { 1, .., N s }, with M f and N s representing  ... 
doi:10.3906/elk-1803-14 fatcat:6bzncfbdkbah5ixprz4nrs6yr4

Dataflow-driven GPU performance projection for multi-kernel transformations

Jiayuan Meng, Vitali A. Morozov, Venkatram Vishwanath, Kalyan Kumaran
2012 2012 International Conference for High Performance Computing, Networking, Storage and Analysis  
Doing so, however, requires transformations across multiple, potentially nested, parallel loops; at the same time, the original code semantics and data dependency must be preserved.  ...  Users need only provide CPU code skeletons for a sequence of parallel loops. The framework can then automatically identify opportunities for multi-kernel transformations and data management.  ...  The research used resources of the Argonne Leadership Computing Facility at Argonne National Laboratory, which is supported by the Office of Science of the U.S.  ... 
doi:10.1109/sc.2012.42 dblp:conf/sc/MengMVK12 fatcat:omqkq23jijc4ths2shyldju2zm

Sensitivity analysis for automatic parallelization on multi-cores

Silvius Rus, Maikel Pennings, Lawrence Rauchwerger
2007 Proceedings of the 21st annual international conference on Supercomputing - ICS '07  
We have implemented Sensitivity Analysis in the Polaris compiler and evaluated its performance using 22 industry standard benchmark codes running on two multicore systems.  ...  For example, SA can first attempt to validate parallelization by checking simple conditions related to loop bounds.  ...  1 , m 4 loop nest.  ... 
doi:10.1145/1274971.1275008 dblp:conf/ics/RusPR07 fatcat:oh5kewqfubd2zm2ofhaaxpg2zq

Automated Mapping of the MapReduce Pattern onto Parallel Computing Platforms

Qiang Liu, Tim Todman, Wayne Luk, George A. Constantinides
2010 Journal of Signal Processing Systems  
The approach is capable of handling single and multiple nested MapReduce patterns.  ...  Furthermore, we explore important variations of MapReduce, such as using a linear structure rather than a tree structure for merging intermediate results generated in parallel.  ...  Unlike our method, they do not allow user-supplied transforms.  ... 
doi:10.1007/s11265-010-0563-9 fatcat:qq3skkqcyjeiloryxhctjhrrem

Simultaneous Optimal Design of Structural Topology and Control Parameters for a Plate Structure
構造トポロジーと制御パラメータの同時最適設計(スマートストラクチャ,OS.6 折り紙・針金/スマートストラクチャ)

Jinhao QIU, Ye ZHU, Junji TANI
2004 The Proceedings of Conference of Kanto Branch  
Closed-loep system is・adopted in whicli Ricatti-based control syntheses are ¢ onsiderecl as sinb processes and nested into・the main optirnization ・process usin'g the niethod df moving asymptotes to optimize  ...  solving approach is adopted in whichRicatti-based[3] centrol syntheses are considered as sub processes and'nested into the main optirnization process using themethod of rnoving asymptotes (MMA) [4] to  ... 
doi:10.1299/jsmekanto.2004.10.213 fatcat:pjz4r5c5gjb7zfec26kjxruieu
« Previous Showing results 1 — 15 out of 2,059 results