• Title/Summary/Keyword: Programming Processes

Search Result 261, Processing Time 0.028 seconds

Knowledge-Based AOP Framework for Business Rule Aspects in Business Process

  • Park, Chan-Kyu;Choi, Ho-Jin;Lee, Dan-Hyung;Kang, Sung-Won;Cho, Hyun-Kyu;Sohn, Joo-Chan
    • ETRI Journal
    • /
    • v.29 no.4
    • /
    • pp.477-488
    • /
    • 2007
  • In recent years, numerous studies have identified and explored issues related to web-service-oriented business process specifications, such as business process execution language (BPEL). In particular, business rules are an important cross-cutting concern that should be distinguished from business process instances. In this paper, we present a rule-based aspect oriented programming (AOP) framework where business rule aspects contained in business processes can be effectively separated and executed. This is achieved by using a mechanism of the business rule itself at the business rule engine instead of using existing programming language-based AOP technologies. Through some illustrative examples, this work also introduces a method by which business rule aspects, separated through an external rule engine, can be represented and evaluated. We also demonstrate how they can be dynamically woven and executed by providing an implementation example which uses two open-source-based products, the Mandarax rules engine and Bexee BPEL engine.

  • PDF

A Hybrid Parallel Genetic Algorithm for Reliability Optimal Design of a Series System (직렬시스템의 신뢰도 최적 설계를 위한 Hybrid 병렬 유전자 알고리즘 해법)

  • Kim, Ki-Tae;Jeon, Geon-Wook
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.2
    • /
    • pp.48-55
    • /
    • 2010
  • Reliability has been considered as a one of the major design measures in various industrial and military systems. The main objective is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for the problem that determines the optimal component reliability to maximize the system reliability under cost constraint in this study. Reliability optimization problem has been known as a NP-hard problem and normally formulated as a mixed binary integer programming model. Component structure, reliability, and cost were computed by using HPGA and compared with the results of existing meta-heuristic such as Ant Colony Optimization(ACO), Simulated Annealing(SA), Tabu Search(TS) and Reoptimization Procedure. The global optimal solutions of each problem are obtained by using CPLEX 11.1. The results of suggested algorithm give the same or better solutions than existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improving solution through swap and 2-opt processes.

An Optimal Mission Assignment Model for Determining a Minimum Required Level of Nuclear-powered Submarines (원자력 추진 잠수함 최소 소요량 결정을 위한 임무 할당 최적화 모델)

  • Lee, Dong-Gyun;Park, Seung-Joo;Lee, Jinho
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.21 no.2
    • /
    • pp.235-245
    • /
    • 2018
  • This study first analyzes the necessity and the validity of procuring nuclear-powered submarines, and presents an optimization model as an integer program to determine a minimum required level of them. For an optimization model, we characterize a submarine's mission, ability and availability, and apply these to the model by constraints. Then, we assign the submarines available currently and the nuclear-powered submarines, that will be newly introduced, to the predefined missions over the planning time periods in a way that the number of nuclear-powered submarines be minimized. Randomly generated missions are employed to solve a mission assignment problem, and the results show that our integer programming model provides an optimal solution as designed, and this can provide a guideline for other weapon system procurement processes.

A Survey-based Analysis of Agile Adoption on Performances of IT Organizations

  • Ghani, Imran;Bello, Mannir;Bagiwa, Idris Lawal
    • Journal of Internet Computing and Services
    • /
    • v.16 no.5
    • /
    • pp.87-92
    • /
    • 2015
  • Numerous IT organizations and companies around the world aspire to improve the efficiency and general standard of their software development. The IT organizations want to seize the opportunities and take advantages of new development processes and methodologies. These advantages include higher customers' satisfaction and better software quality among many. In order to achieve them, different agile software methodologies such as scrum, Feature driven development, eXtremeProgramming (XP), Dynamic system development method, Kanban and others have been frequently adopted by IT organizations across the world. Several studies have shown that agile software development methods are effective in a lot of settings. This study, in which 40 agile practitioners from Malaysia participated, additionally confirms the effectiveness of agile development methods. Furthermore, this paper presents some of the critical barriers not well-known by IT-organizations. The results of this analysis can be used to guide IT organization from the obstacles they may face while adopting agile in their environments.

FPGA application for wireless monitoring in power plant

  • Kumar, Adesh;Bansal, Kamal;Kumar, Deepak;Devrari, Aakanksha;Kumar, Roushan;Mani, Prashant
    • Nuclear Engineering and Technology
    • /
    • v.53 no.4
    • /
    • pp.1167-1175
    • /
    • 2021
  • The process of automation and monitoring in industrial control system involves the use of many types of sensors. A programmable logic controller plays an important role in the automation of the different processes in the power plant system. The major control units are boiler for temperature and pressure, turbine for speed of motor, generator for voltage, conveyer belt for fuel. The power plant units are controlled using microcontrollers and PLCs, but FPGA can be the feasible solution. The paper focused on the design and simulation of hardware chip to monitor boiler, turbine, generator and conveyer belt. The hardware chip of the plant is designed in Xilinx Vivado Simulator 17.4 software using VHDL programming. The methodology includes VHDL code design, simulation, verification and testing on Virtex-5 FPGA hardware. The system has four independent buzzers used to indicate the status of the boiler, generator, turbine motor and conveyer belt in on/off conditions respectively. The GSM is used to display corresponding message on the mobile to know the status of the device in on/off condition. The system is very much helpful for the industries working on plant automation with FPGA hardware integration.

Development of an Analysis Tool for Production Time for Components Machined by Turning (선삭 가공 부품의 생산 시간 분석 툴 개발)

  • Jin-Woo Choi
    • Design & Manufacturing
    • /
    • v.18 no.2
    • /
    • pp.51-56
    • /
    • 2024
  • In this study, a tool was developed for analyzing production lead time in turning operations. It is expected to help to reduce machining time and to identify, for example, tool change intervals. The tool was developed using Visual Basic.Net and features a user-friendly graphical user interface (GUI) that allows users to easily input cutting conditions and calculate the usage time and feeding distance for each cutting tool based on a G-code program. Object-oriented programming techniques were also used to encapsulate and classify complex logic, thereby efficiently organizing and managing the functions and data structures of this analysis tool. The analysis tool provides various outputs. It calculates the use time of each detailed process of the turning operation, the use time of each tool, the use time of each type of feeding, and also generates the data needed for cutting time analysis, which can be visualized in charts. The analysis tool developed in this study is expected to significantly contribute to improving the efficiency of manufacturing processes and increasing productivity, particularly, in the manufacturing of components requiring massive material removal, such as aircraft parts.

Uncertain Centralized/Decentralized Production-Distribution Planning Problem in Multi-Product Supply Chains: Fuzzy Mathematical Optimization Approaches

  • Khalili-Damghani, Kaveh;Ghasemi, Peiman
    • Industrial Engineering and Management Systems
    • /
    • v.15 no.2
    • /
    • pp.156-172
    • /
    • 2016
  • Complex and uncertain issues in supply chain result in integrated decision making processes in supply chains. So decentralized (distributed) decision making (DDM) approach is considered as a crucial stage in supply chain planning. In this paper, an uncertain DDM through coordination mechanism is addressed for a multi-product supply chain planning problem. The main concern of this study is comparison of DDM approach with centralized decision making (CDM) approach while some parameters of decision making are assumed to be uncertain. The uncertain DDM problem is modeled through fuzzy mathematical programming in which products' demands are assumed to be uncertain and modeled using fuzzy sets. Moreover, a CDM approach is customized and developed in presence of fuzzy parameters. Both approaches are solved using three fuzzy mathematical optimization methods. Hence, the contribution of this paper can be summarized as follows: 1) proposing a DDM approach for a multi-product supply chain planning problem; 2) Introducing a coordination mechanism in the proposed DDM approach in order to utilize the benefits of a CDM approach while using DDM approach; 3) Modeling the aforementioned problem through fuzzy mathematical programming; 4) Comparing the performance of proposed DDM and a customized uncertain CDM approach on multi-product supply chain planning; 5) Applying three fuzzy mathematical optimization methods in order to address and compare the performance of both DDM and CDM approaches. The results of these fuzzy optimization methods are compared. Computational results illustrate that the proposed DDM approach closely approximates the optimal solutions generated by the CDM approach while the manufacturer's and retailers' decisions are optimized through a coordination mechanism making lasting relationship.

A Study on Developing XML Documents and RDB Mapping Using Tag Free XML Development Tools (Tag free XML 개발 툴을 이용한 XML 문서 개발과 RDB 매핑에 관한 연구)

  • Woo, Won-Taek
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.5
    • /
    • pp.37-52
    • /
    • 2006
  • XML architecture is important to wireless or wired presentation. It is also important for data exchange between businesses. XML forces the separation of content from style and gives wired or wireless devices flexibility for interpretation. Separation of content, style, and logic is key to advanced architecture. XML can be exchanged among databases on multiple systems with presentation on wired or wireless devices. An XML schema might need to be defined, or an established DTD might need to be transformed to access a relational database on the server. The purpose of this study is to generate XML documents such as DTD, XML schema, RDB mapping using Tagfree's XML developer tools in order to experience whole processes mentioned above. Overall understanding of data structures of and database processing with XML documents, which is essential to XML programming and database processing, can be accomplished with this study without much endeavor to learn complex XML syntax. The future study can be extended on the subject of web programming with DOM or SAX API.

  • PDF

Control of pH Neutralization Process using Simulation Based Dynamic Programming in Simulation and Experiment (ICCAS 2004)

  • Kim, Dong-Kyu;Lee, Kwang-Soon;Yang, Dae-Ryook
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.620-626
    • /
    • 2004
  • For general nonlinear processes, it is difficult to control with a linear model-based control method and nonlinear controls are considered. Among the numerous approaches suggested, the most rigorous approach is to use dynamic optimization. Many general engineering problems like control, scheduling, planning etc. are expressed by functional optimization problem and most of them can be changed into dynamic programming (DP) problems. However the DP problems are used in just few cases because as the size of the problem grows, the dynamic programming approach is suffered from the burden of calculation which is called as 'curse of dimensionality'. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach is proposed by Bertsekas and Tsitsiklis (1996). To get the solution of seriously nonlinear process control, the interest in NDP approach is enlarged and NDP algorithm is applied to diverse areas such as retailing, finance, inventory management, communication networks, etc. and it has been extended to chemical engineering parts. In the NDP approach, we select the optimal control input policy to minimize the value of cost which is calculated by the sum of current stage cost and future stages cost starting from the next state. The cost value is related with a weight square sum of error and input movement. During the calculation of optimal input policy, if the approximate cost function by using simulation data is utilized with Bellman iteration, the burden of calculation can be relieved and the curse of dimensionality problem of DP can be overcome. It is very important issue how to construct the cost-to-go function which has a good approximate performance. The neural network is one of the eager learning methods and it works as a global approximator to cost-to-go function. In this algorithm, the training of neural network is important and difficult part, and it gives significant effect on the performance of control. To avoid the difficulty in neural network training, the lazy learning method like k-nearest neighbor method can be exploited. The training is unnecessary for this method but requires more computation time and greater data storage. The pH neutralization process has long been taken as a representative benchmark problem of nonlin ar chemical process control due to its nonlinearity and time-varying nature. In this study, the NDP algorithm was applied to pH neutralization process. At first, the pH neutralization process control to use NDP algorithm was performed through simulations with various approximators. The global and local approximators are used for NDP calculation. After that, the verification of NDP in real system was made by pH neutralization experiment. The control results by NDP algorithm was compared with those by the PI controller which is traditionally used, in both simulations and experiments. From the comparison of results, the control by NDP algorithm showed faster and better control performance than PI controller. In addition to that, the control by NDP algorithm showed the good results when it applied to the cases with disturbances and multiple set point changes.

  • PDF

Optimal scheduling for multi-product batch processes under consideration of non-zero transfer times and set-up times

  • Jung, Jae-Hak;Lee, In-Beum;Yang, Dae-Ryook;Chang, Kun-Soo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10b
    • /
    • pp.30-35
    • /
    • 1993
  • Simple recurrence relations for calculating completion times of various storage polices (unlimited, intermediate storages(FIS), finite intermediate storages(FIS), no intermediate storage(NIS), zero wait(ZW) for serial multi-product multi-unit processes are suggested. Not only processing times but also transfer times, set-up (clean-up) times of units and set-up times of storages are considered. Optimal scheduling strategies with zero transfer times and zero set-up times had been developed as a mixed integer linear programniing(MILP) formulation for several intermediate storage policies. In this paper those with non-zero transfer times, non-zero set-up times of units and set-up times of storages are newly proposed as a mixed integer nonlinear programming(MINLP) formulation for various storage polices (UIS, NIS, FIS, and ZW). Several examples are tested to evaluate the robustness of this strategy and reasonable computation times.

  • PDF