Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “program optimization”

Health Optimization Program for Elders

Michael Krol, Colette Allen, Loretta Matters et al. · Journal of Nursing Care Quality · 2018

An NP-led hospital to SNF transitional care program is a promising means of improving hospital to SNF transitions.

Cited by 8

Stochastic Optimization of Program Obfuscation

Han Liu, C. P. Sun, Zhendong Su et al. · 2017

Program obfuscation is a common practice in software development to obscure source code or binary code, in order to prevent humans from understanding the purpose or logic of software. It protects intellectual property and deters malicious attacks. While tremendous efforts have been devoted to the development of various obfuscation techniques, we have relatively little knowledge on how to most effectively use them together. The biggest challenge lies in identifying the most effective combination of obfuscation techniques. This paper presents a unified framework to optimize program obfuscation. Given an input program P and a set T of obfuscation transformations, our technique can automatically identify a sequence seq = 〈t <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> , t <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> , ..., t <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sub> 〉 (∀i ∈ [1, n]. t <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</sub> ∈ T), such that applying ti in order on P yields the optimal obfuscation performance. We model the process of searching for seq as a mathematical optimization problem. The key technical contributions of this paper are: (1) an obscurity language model to assess obfuscation effectiveness/optimality, and (2) a guided stochastic algorithm based on Markov chain Monte Carlo methods to search for the optimal solution seq. We have realized the framework in a tool Closure* for JavaScript, and evaluated it on 25 most starred JavaScript projects on GitHub (19K lines of code). Our machinery study shows that Closure* outperforms the well-known Google Closure Compiler by defending 26% of the attacks initiated by JSNice. Our human study also reveals that Closure* is practical and can reduce the human attack success rate by 30%.

Cited by 32

Shape Optimization with Program CARAT

Kai‐Uwe Bletzinger, Reiner Reitinger, Stefan Kimmich et al. · Birkhäuser Basel eBooks · 1993

Shape optimal design is the synthesis of structural analysis and mathematical programming combined with computer aided geometric design (CAGD) concepts and behavior sensitivity analysis. This generally accepted idea is realized by CARAT. The underlying models are formulated with special regard to a general overall model of structural optimization which is efficient as well as flexible enough to be applied to shape optimal design of arbitrary shells in three dimensional space. Special emphasis is given to potential optimization algorithms (e.g. an extension of the method of moving asymptotes), practical design capabilities, clearly formulated interactions like variable linking, and modular computer codes. Shape optimizations of an initially axisymmetric shell, a fly-wheel and a bell demonstrate the capabilities of the presented approach.

Cited by 3

Program optimization - theory and practice

David B. Loveman, Ross A. Faneuf · ACM SIGPLAN Notices · 1975

The conventional program optimization techniques employed by the ILLIAC FORTRAN compiler are general purpose, effective, and efficient. The underlying theory is applicable to FORTRAN and to other high level languages. A unique approach to the gathering of global set and use information about variables as well as careful software engineering of the algorithms has led to the construction of an effective source-to-source optimizer which performs constant propagation, constant computation, common subexpression elimination, reduction in strength, and invariant code motion. We will first consider the type of information which must be gathered about a program, and how this information is used to perform optimization. Then we shall state the algorithm for globally computing the set and use information for program variables. Having discussed the science of optimization we shall turn to the engineering aspects and consider such topics as representation of programs, order of optimization transformations, and efficient computation of global use and set information.

Cited by 14Open access

Optimization of flow cytometer program.

Naresh Singh (108014), Samantha J. Barnes (324565), Sandra Kennedy (4039718) et al. · Figshare · 2017

&lt;p&gt;Hepatocytoma cells HC-04 seeded 80,000/well and infected with 40,000 sporozoites/well with fresh &lt;i&gt;P&lt;/i&gt;. &lt;i&gt;berghei&lt;/i&gt; GFP sporozoites or left uninfected. After 3 hrs HC-04 were stained with DRAQ5, harvested and analyzed by flow cytometer. (A) Uninfected and no stain HC-04 cells. (B) Uninfected and DRAQ5 stained cells. (C) Sporozoites infected and DRAQ5 stained cells. Stained cells were gated in FL-1A (GFP, 488 nm) and in FL-4A (DRAQ5, 640 nm).&lt;/p&gt;

Cited by 0Open access

Research in Program Optimization Techniques

Jr Cheatham, E. Louise Thomas · 1975

Abstract : In the context of the ECL programming system, general techniques for program optimization at high levels of language and special purpose techniques to enhance use of ECL for systems programming have been studied. The specific problems discussed are the efficient representation of knowledge about programs, the use of measurements to guide program improvement, compiler optimization under strict resource constraints and user control of machine level code optimizations such as register assignment.

Cited by 0

Beryllium-Titanium Materials Optimization Program.

G.H. Keith · Defense Technical Information Center (DTIC) · 1978

Be/Ti alloy composites were developed having high tensile yield strength/proportional limit ( or = 40 ksi), 28 x 10 to the 6th power psi modulus and 3.32 g/cc density. Composite rods containing 133 and 259 filaments were tested containing filaments made from 4 grades of beryllium: P-1, HIP 50, HIP 70, and HP 40. The best combination of tensile yield strength/proportional limit and ductility was achieved using HIP 70 beryllium. (Author)

Cited by 0

Iterative Compilation in Program Optimization

T. Kisuki, P.M.W. Knijnenburg, M.F.P. O&amp;apos;Boyle et al. · 2000

In this paper we describe a novel approach to program optimization, namely, iterative compilation. This technique enables compilers to deliver efficient code by searching for the best sequence of optimizations using profile-directed feedback. We have implemented this iterative approach in an existing compiler system which is designed for embedded systems and compared its performance to two of the best known static techniques. Initial experimental results show that this approach delivers an average improvement of 35% over existing techniques and delivers efficient code with reasonable compilation times. 1. Introduction Modern compilers make extensive use of optimization to improve program performance. The use of a particular optimization largely depends on static program analysis based on simplified machine models. Optimizations include high-level loop transformations, such as loop unrolling and tiling. These techniques are extensively studied for over 30 years and have produced, in m...

Cited by 0

NEW METHOD OF PROGRAM OPTIMIZATION

Hoyle, Richard Eugene · American University Research Archive · 2023

Source: Masters Abstracts International, Volume: 16-03, page: 1460.

Cited by 0Open access

Program optimization - theory and practice

David B. Loveman, Ross A. Faneuf · 1975

The conventional program optimization techniques employed by the ILLIAC FORTRAN compiler are general purpose, effective, and efficient. The underlying theory is applicable to FORTRAN and to other high level languages. A unique approach to the gathering of global set and use information about variables as well as careful software engineering of the algorithms has led to the construction of an effective source-to-source optimizer which performs constant propagation, constant computation, common subexpression elimination, reduction in strength, and invariant code motion.

Cited by 5

Teaching Aid For Program Optimization

Khushei Meghana Meda, Sriram Subramanian, Adithya Bennur et al. · 2021 International Conference on Smart Generation Computing, Communication and Networking (SMART GENCON) · 2021

Optimization is essential to obtain the “best” design against a set of priority criteria or constraints. However, optimization techniques need not be intuitive for all those who venture into software development, thus impeding the learning of certain programming concepts. A teaching aid for program optimization can be helpful in the field of performance engineering education. In this paper, we present our automated tool for C source code optimization. The input provided to the tool is a C program that is resource-intensive. On the input source, the tool performs optimizations in various directives and generates an equivalent C program. The tool presents the correctness of the processed program by showing the outputs of both the input and optimized programs, after running them in the backend. The tool also compares the difference in performance between the two programs by providing performance metrics. The tool can potentially assist in the learning of general program optimization techniques as well as the concepts of compiler design and performance engineering. The optimizations implemented in the tool go beyond data structure and algorithmic optimizations, focusing on various techniques that can be implemented at high-level structures of the source, most of which aren’t done in popular compilers. Automation of such procedures could conveniently provide an insight into fine programming paradigms and help the learner grasp abstract concepts.

Cited by 0

Constant-attitude thrust program optimization

W. G. Melbourne, C. G. Sauer · AIAA Journal · 1965

Optimum thrust programming studies include a comparison of constant and variable attitude thrust programs for an earth-mars rendezvous

Cited by 6

A Stochastic Global Optimization Program

Richard K. Wofford · TigerPrints (Clemson University) · 1987

The global optimization problem is usually stated as the global minimization problem, which is to find a point x* ϵ S, a compact set in ʀⁿ, such that f(x*) ≤ f (x) ∀ x ϵ S. Much work has been done on functions satisfying various convexity conditions. The global minimization problem drops this requirement, allowing for multiple local minima. We will follow the standard assumption that f is continuous and that is has continuous first and second derivatives. The problem shall either be unconstrained or have simple bounds on the variables. A maximization problem is easily converted to a minimization problem by negating f.

Cited by 0

ACCELERATING PROGRAM DELIVERY THROUGH OPTIMIZATION

Anthony Norton, Turhan Solu, Edward Wettlaufer et al. · SAE technical papers on CD-ROM/SAE technical paper series · 2011

&lt;title&gt;ABSTRACT&lt;/title&gt; &lt;p&gt;It is generally accepted that structural optimization has been responsible for achieving component and system weight reduction for multiple applications, but often these methods are considered only as a tool to reduce vehicle weight later in a vehicle design. This paper proposes earlier and broader application of the technology during a military vehicle program.&lt;/p&gt; &lt;p&gt;An optimization driven design approach will reduce development time, through fewer design iterations, while creating robust design directions not influenced by design history. The proactive use of optimization technologies throughout a development program yield benefits in terms of vehicle weight (and therefore increased payload), improve performance and protection while reducing material costs.&lt;/p&gt;

Cited by 0

Iterative Compilation in Program Optimization

Kisuki Knijnenburg Boyle, T. Kisuki, P. M. W. Knijnenburg et al. · 2000

In this paper we describe a novel approach to program optimization, namely, iterative compilation. This technique enables compilers to deliver efficient code by searching for the best sequence of optimizations. Such an approach does not suffer from undecidability issues and, given sufficient time, will find the best optimized code. We have implemented this iterative approach in an existing compiler system which is designed for embedded systems. Experimental results show that this approach delivers efficient code with reasonable compilation times. 1. Introduction Modern compilers make extensive use of optimization to improve program performance. The use of a particular optimization largely depends on static program analysis based on simplified machine models. Optimizations include high-level loop transformations, such as loop unrolling and tiling. These techniques are extensively studied This research was partially supported by the ESPRIT IV reactive LTR project OCEANS, under contract...

Cited by 0

Optimization Program Improves Plant Performance

Tricia H. Kilgore · Opflow · 2024

South Carolina's Beaufort‐Jasper Water and Sewer Authority optimized its wastewater systems using Partnership for Clean Water goals.

Cited by 0Open access