• 한국소성가공학회:학술대회논문집
• /
• 한국소성가공학회 1995년도 추계학술대회논문집
• /
• pp.30-36
• /
• 1995

Conventionally design for multi-stage cold forging depends on the designer's experience and decision-making. Due to such non-deterministic nature of the process sequence design, a flexible inference engine is needed for process design expert system. In this study, A* searching algorithm was introduced to arrive at the vetter process sequence design considering the number of forming stages and levels of effective strain, effective stress, and forming load during the porcess. In order to optimize the process sequence in producing the final part, cost function was defined and minimized using the proposed A* searching algorithm. For verification of the designed forming sequences, forming experiments and finite element analyses were carried out in the present investigation. The developed expert system using A* searching algorithm can produce a flexible design system based on changes in the number of forming stages and weights.

• 한국안전학회지
• /
• 제13권1호
• /
• pp.70-76
• /
• 1998

The smoke filling process for the atrium space containing a fire source is simulated using two types of deterministic fire models : Zone model and Field model. The zone model used is the CFAST(version 1.6) model developed at the Building and Fire Research Laboratories, NIST in the USA. The field model is a self-developed fire field model based on Computational Fluid Dynamics(CFD) theories. This article is focused on finding out the smoke movement and temperature distribution in atrium space which is cubic in shape. A computational procedure for predicting velocity and temperature distribution in fire-induced flow is based on the solution, in finite volume method and non-staggered grid system, of 3-dimensional equations for the conservation of mass, momentum, energy, species and so forth. The fire model i. e. Zone model and Field model predicted similar results for the clear height and the smoke layer temperature.

• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.981-1000
• /
• 2009

This paper considers asset liability management problems when their deterministic equivalent formulations are general nonlinear optimization problems. The presented approach uses a nonmonotone trust region strategy for solving a sequence of unconstrained subproblems parameterized by a scalar parameter. The objective function of each unconstrained subproblem is an augmented penalty-barrier function that involves both primal and dual variables. Each subproblem is solved approximately. The algorithm does not restrict a monotonic decrease of the objective function value at each iteration. If a trial step is not accepted, the algorithm performs a non monotone line search to find a new acceptable point instead of resolving the subproblem. We prove that the algorithm globally converges to a point satisfying the second-order necessary optimality conditions.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2008년도 추계학술대회A
• /
• pp.757-761
• /
• 2008

The aerostat dynamic equation of motion has been built including the tether cable dynamic effects. A numerical program to solve the derived equation of motion has been developed. The dynamic motion of the 32m aerostat has been analyzed under discrete gust and continuous turbulence. The aerostat behaviors under discrete gust which represents a deterministic approach for determining design loads for manned aircraft are solved to verify the effect of aerostat mechanical properties on the aerostat dynamic behavior. Continuous turbulences are simulated for each given altitude, translational mean wind velocity and gust intensity. Dynamic behaviors of the 32m aerostat are simulated for each continuous turbulence conditions. Translational and vertical velocity and pitching behavior and tether reaction force are monitored for each simulation.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2011년도 한국컴퓨터종합학술대회논문집 Vol.38 No.1(C)
• /
• pp.248-251
• /
• 2011

본 연구에서는, 웹 문서로부터 특정 상품에 대한 의견 문장을 분석하는 오피니언 마이닝(Opinion Mining) 연구의 일환으로, 특히 함께 공기하는 자질 명사에 따라 그 극성 값이 달라지는 '비결정 오피니언어휘'의 처리를 위해서 도메인을 '맛집'으로 한정하여 공기하는 도메인 키워드의 목록을 결정하고, 이를 부분문법그래프(Local Grammar Graphs) 방법론을 통해서 이들 간의 어휘 통사적 관계를 결정해 주었다.

• 대한기계학회논문집
• /
• 제17권12호
• /
• pp.3063-3072
• /
• 1993

The layout is an important and difficult problem in industrial applications like sheet metal manufacturing, garment making, circuit layout, plant layout, and land development. The module layout problem is known to be non-deterministic polynomial time complete(NP-complete). To efficiently find an optimal layout from a large number of candidate layout configuration a heuristic algorithm could be used. In recent years, a number of researchers have investigated the combinatorial optimization problems by using neural network principles such as traveling salesman problem, placement and routing in circuit design. This paper describes the application of Self-organizing Feature Maps(SOM) of the Kohonen network and Simulated Annealing Algorithm(SAA) to the layout problem of the two-dimensional rectangular shapes.

• Management Science and Financial Engineering
• /
• 제13권1호
• /
• pp.25-34
• /
• 2007

This paper is concerned with proving a conjecture that the two stage assembly system is reversible in deterministic makespan scheduling context. The reversibility means that a job sequence in the assembly system has the same makespan as that of its reverse sequence in the disassembly system which is the reversal of the assembly system. The proposed conjecture shows that the reversibility of serial flowshops can be extended to non-serial and synchronized shops.

• Journal of applied mathematics & informatics
• /
• 제9권1호
• /
• pp.135-150
• /
• 2002

The present paper discusses non-deterministic finite Rabin-scott's automate. The majority of works recently dealing with this subject were, in fact, concerned only with properties of a canonical term automata or of some objects equivalent to it. This article continues the series of works in which the authors state a different point of view, describing the finite automata as just another invariant of the given regular language called basis finite automaton. In this article the authors argue on some new properties for the basis finite automaton. One of them is included into basis automaton's table of binary relations. It is stated that this table can not contain either identical strings or identical columns. Another property depicts a possibility to obtain any finite automaton for a given regular language by the process of duplicating or combining some of its states.

• Journal of the Optical Society of Korea
• /
• 제19권2호
• /
• pp.144-148
• /
• 2015

An alternative description for the Gaussian image plane (GIP) of an optical system for a given object is presented, which applies to both aberration-free and non-aberration-free systems. We extend the definition of transverse magnification (TM) to the image plane (IP) displaced from the GIP and find that the TM depends linearly on the locations of both an aperture stop placed in front of the system and the IP. Hence, we redefine the GIP as the location at which the slope of the TM variance changes sign. The definition is deterministic and self-consistent and, therefore, no other parameters or measurements are needed. The derivation of this definition using a set of paraxial ray tracings and supporting experimental data for a thick bi-convex lens system is presented.

• 정보기술과데이타베이스저널
• /
• 제7권1호
• /
• pp.17-26
• /
• 2000

To provide highly available services in the distributed object system, it is required to support the object group. The state machine approach and primary-backup approach are proposed as two representative approaches for support of object group. The primary-backup approach does not only give merits such as transparency of object group and non-deterministic execution but also require less resource than state machine approach. This paper describes an extension of CORBA that is required to support of the primary-backup object group. In this paper, the state of backup is synchronized with primary through the atomic multicast protocol whenever the request of client is executed at primary. As a result, it does not require message logging and check pointing. The object group of this paper also provides fast response time in case of failure of the primary since it makes primary election unnecessary. And through an extension of IDL, it makes possible to avoid consistency control depending on characteristic of application. A prototype has been implemented and the performance of object group has been compared with a single object invocation.