• Title/Summary/Keyword: Graph Optimization

Search Result 199, Processing Time 0.026 seconds

Static Single Assignment Form for Java Bytecodes in CTOC (CTOC에서 자바 바이트코드를 위한 정적 단일 배정 형태)

  • Kim, Ki-Tae;Yoo, Weon-Hee
    • The KIPS Transactions:PartD
    • /
    • v.13D no.7 s.110
    • /
    • pp.939-946
    • /
    • 2006
  • Although the Java bytecode has numerous advantages, there are also shortcomings such as slow execution speed and difficulty in analysis. In order to overcome such disadvantages, bytecode analysis and optimization must be performed. We implements CTOC for optimized codes. An extended CFG must be first created in order to analyze and optimize a bytecode. Due to unique bytecode properties, the existing CFG must be expanded according to the bytecode. Furthermore, the CFG must be converted into SSA Form for a static analysis, for which calculation is required for various information such as the dominate relation, dominator tree, immediate dominator, $\phi$-function, rename, and dominance frontier. This paper describes the algorithm and the process for converting the existing CFG into the SSA From. The graph that incorporates the SSA Form is later used for type inference and optimization.

Quality Characteristic and Optimization of Iced Cookie with Addition of Jinuni bean(Rhynchosia volubilis) (쥐눈이콩(鼠目太) 첨가 냉동쿠키의 품질특성 및 최적화)

  • Ko, Young-Joo;Joo, Na-Mi
    • Korean journal of food and cookery science
    • /
    • v.21 no.4 s.88
    • /
    • pp.514-527
    • /
    • 2005
  • The purposes of this study were firstly to optimize the recipe for iced cookies by cooking with five different ingredient levels of $Jinuni\;bean(X_1),\;butter(X_2)\;&\;sugar(X_3)$ and secondly to analyze the chemical and sensory test results by using RSM(Response Surface Methodology). As a result of this test, water activity decreased with increasing contents of butter or sugar, while hydrophilic browning decreased independently with increasing sugar content. There was a positive correlation(p<.001) between specific gravity and hardness, although the result was not uniform due to the interaction of each factor. There was a negative correlation(p<.001) between the spread ratio and gravity or hardness, and it tended to increase with increasing each content. Color value L and color value a had positive correlation (p<.001) and the value tended to decrease with increasing the quantity of Jinuni bean. Generally, the strength of the cookies showed a saddle point at the peak of the 3d graph. As a result of sensory evaluation, the color was sensitive to the contents of sugar and Jinuni bean, the texture was sensitive to the contents of butter and sugar, and the taste and overall quality were sensitive to all three factors. Color had a positive correlation(p<.05) with the taste, texture and overall quality. There were high positive correlations(p<.001) between the taste, texture and overall quality. The preference data showed an up-swollen, parabolic shape in the center of the 34 graph, which enabled the optimum value to be determined and the optimum mixture ratio which fulfilled all sensory items was Jinuni bean 93g, butter 188.5g and sugar 155g, indicating a substitution of flour by $44\%$.

The Influence of Instrumentalization of Computer Algebra System(CAS) on the Sequence of Mathematics Curriculum in the Optimization Problem Solving Activities of CAS (최적화 문제해결 활동에서 "CAS의 도구화"가 교육과정 내용제시 순서에 미치는 영향)

  • Han, Se-Ho
    • Journal of Educational Research in Mathematics
    • /
    • v.20 no.2
    • /
    • pp.185-202
    • /
    • 2010
  • This study was designed to investigate the possibility that the optimization problem solving activities based on the instrumented CAS can have an influence on the sequence of mathematics curriculum in secondary mathematics education. Some optimization problem solving activities based on CAS were constructed and executed to eleventh grade(the penultimate year of Korean high school) 7 students for nine class hours. They have experienced using CAS in mathematics class for three months, but never learned calculus. The data which consists of classroom observations(audio and video taped) and post-unit interviews with students were analyzed. In the analysis, with CAS, students can highly deal with the applied optimization problems made up of calculus, cubic equation, solution of radical equation, and graph analysis which never learned. This result shows CAS may have an influence on the sequence of mathematics curriculum in secondary mathematics education.

  • PDF

As-Rigid-As-Possible Dynamic Deformation with Oriented Particles (방향성 입자를 이용한 ARAP 동적 변형)

  • Choi, Min Gyu
    • Journal of Korea Game Society
    • /
    • v.17 no.1
    • /
    • pp.89-98
    • /
    • 2017
  • This paper presents a novel ARAP (as-rigid-as-possible) approach to real-time simulation of physics-based deformation. To cope with one, two and three dimensional deformable bodies in an efficient, robust and uniform manner, we introduce a deformation graph of oriented particles and formulate the corresponding ARAP deformation energy. For stable time integration of the oriented particles, we develop an implicit integration scheme formulated in a variational form. Our method seeks the optimal positions and rotations of the oriented particles by iteratively applying an alternating local/global optimization scheme. The proposed method is easy to implement and computationally efficient to simulate complex deformable models in real time.

Optimized Structures with Hop Constraints for Web Information Retrieval (Hop 제약조건이 고려된 최적화 웹정보검색)

  • Lee, Woo-Key;Kim, Ki-Baek;Lee, Hwa-Ki
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.4
    • /
    • pp.63-82
    • /
    • 2008
  • The explosively growing attractiveness of the Web is commencing significant demands for a structuring analysis on various web objects. The larger the substantial number of web objects are available, the more difficult for the clients(i.e. common web users and web robots) and the servers(i.e. Web search engine) to retrieve what they really want. We have in mind focusing on the structure of web objects by introducing optimization models for more convenient and effective information retrieval. For this purpose, we represent web objects and hyperlinks as a directed graph from which the optimal structures are derived in terms of rooted directed spanning trees and Top-k trees. Computational experiments are executed for synthetic data as well as for real web sites' domains so that the Lagrangian Relaxation approaches have exploited the Top-k trees and Hop constraint resolutions. In the experiments, our methods outperformed the conventional approaches so that the complex web graph can successfully be converted into optimal-structured ones within a reasonable amount of computation time.

Adaptive Application Component Mapping for Parallel Computation Offloading in Variable Environments

  • Fan, Wenhao;Liu, Yuan'an;Tang, Bihua
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.11
    • /
    • pp.4347-4366
    • /
    • 2015
  • Distinguished with traditional strategies which offload an application's computation to a single server, parallel computation offloading can promote the performance by simultaneously delivering the computation to multiple computing resources around the mobile terminal. However, due to the variability of communication and computation environments, static application component multi-partitioning algorithms are difficult to maintain the optimality of their solutions in time-varying scenarios, whereas, over-frequent algorithm executions triggered by changes of environments may bring excessive algorithm costs. To this end, an adaptive application component mapping algorithm for parallel computation offloading in variable environments is proposed in this paper, which aims at minimizing computation costs and inter-resource communication costs. It can provide the terminal a suitable solution for the current environment with a low incremental algorithm cost. We represent the application component multi-partitioning problem as a graph mapping model, then convert it into a pathfinding problem. A genetic algorithm enhanced by an elite-based immigrants mechanism is designed to obtain the solution adaptively, which can dynamically adjust the precision of the solution and boost the searching speed as transmission and processing speeds change. Simulation results demonstrate that our algorithm can promote the performance efficiently, and it is superior to the traditional approaches under variable environments to a large extent.

Optimizing Bi-Objective Multi-Echelon Multi-Product Supply Chain Network Design Using New Pareto-Based Approaches

  • Jafari, Hamid Reza;Seifbarghy, Mehdi
    • Industrial Engineering and Management Systems
    • /
    • v.15 no.4
    • /
    • pp.374-384
    • /
    • 2016
  • The efficiency of a supply chain can be extremely affected by its design which includes determining the flow pattern of material from suppliers to costumers, selecting the suppliers, and defining the opened facilities in network. In this paper, a multi-objective multi-echelon multi-product supply chain design model is proposed in which several suppliers, several manufacturers, several distribution centers as different stages of supply chain cooperate with each other to satisfy various costumers' demands. The multi-objectives of this model which considered simultaneously are 1-minimize the total cost of supply chain including production cost, transportation cost, shortage cost, and costs of opening a facility, 2-minimize the transportation time from suppliers to costumers, and 3-maximize the service level of the system by minimizing the maximum level of shortages. To configure this model a graph theoretic approach is used by considering channels among each two facilities as links and each facility as the nodes in this configuration. Based on complexity of the proposed model a multi-objective Pareto-based vibration damping optimization (VDO) algorithm is applied to solve the model and finally non-dominated sorting genetic algorithm (NSGA-II) is also applied to evaluate the performance of MOVDO. The results indicated the effectiveness of the proposed MOVDO to solve the model.

Improving the Performance of Genetic Algorithms using Gene Reordering (유전자 재배열을 이용한 유전자 알고리즘의 성능향상)

  • Hwang, In-Jae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.7 no.4
    • /
    • pp.201-206
    • /
    • 2006
  • Genetic Algorithms have been known to provide near optimal solutions for various optimization problems in engineering. In this paper, we study the effect of gene order in genetic algorithms on the defining length of the schema with high fitness values. Its effect on the performance of genetic algorithms was also analyzed through two well known problems. A few gene reordering methods were proposed for graph partitioning and knapsack problems. Experimental results showed that genetic algorithms with gene reordering could find solutions of better qualities compared to the ones without gene reordering. It is very important to find proper reordering method for a given problem to improve the performance of genetic algorithms.

  • PDF

Rotor dynamic analysis of a tidal turbine considering fluid-structure interaction under shear flow and waves

  • Lass, Andre;Schilling, Matti;Kumar, Jitendra;Wurm, Frank-Hendrik
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.11 no.1
    • /
    • pp.154-164
    • /
    • 2019
  • A rotor dynamic analysis is mandatory for stability and design optimization of submerged propellers and turbines. An accurate simulation requires a proper consideration of fluid-induced reaction forces. This paper presents a bi-directional coupling of a bond graph method solver and an unsteady vortex lattice method solver where the former is used to model the rotor dynamics of the power train and the latter is used to predict transient hydrodynamic forces. Due to solver coupling, determination of hydrodynamic coefficients is obsolete and added mass effects are considered automatically. Additionally, power grid and structural faults like grid fluctuations, eccentricity or failure could be investigated using the same model. In this research work a fast, time resolved dynamic simulation of the complete power train is conducted. As an example, the rotor dynamics of a tidal stream turbine is investigated under two inflow conditions: I - shear flow, II - shear flow + water waves.

A Study on the Real-time Data Interface Technology based on SCM for Shipbuilding and Marine Equipment Production (조선해양기자재 제작을 위한 SCM 기반 실시간 데이터 인터페이스 기술에 관한 연구)

  • Myeong-Ki Han;Young-Hun Kim;Jun-Su Park;Won-Ho Lee
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.27 no.1
    • /
    • pp.143-149
    • /
    • 2024
  • The production and procurement of shipbuilding and offshore equipment is an important competitive factor in the shipbuilding and offshore industry. Recently, ICT-based digital technology has been rapidly applied to the manufacturing industry following the Fourth Industrial Revolution. Under the digital transformation, real-time data interface technology based on SCM (Supply Chain Management) is emerging as an important tool to improve the efficiency of the equipment manufacturing process. In this study, the characteristics and advantages and disadvantages of interface technologies of web-based data interface technologies were compared and analyzed. The performance was compared between theoretical evaluation based on technical features and practical application cases. As a result, it was confirmed that GraphQL is useful for selective data processing, but there is a problem with optimization, and REST API has a problem with receiving data due to a fixed data structure. Therefore, this study aims to suggest ways to utilize and optimize these data interface technologies.