• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.6
• /
• pp.470-477
• /
• 2015

This paper presents a new technique for generating an optimum synchronizable test sequence that can be applied in the distributed test architecture where both external synchronization and input/output operation costs are taken into consideration. The method defines a set of phases that constructs a tester-related digraph from a given finite state machine representation of a protocol specification such that a minimum cost tour of the digraph with intrinsically synchronizable transfer sequences can be used to generate an optimum synchronizable test sequence using synchronizable state identification sequences as the state recognition sequence for each state of the given finite state machine. This hybrid approach with a heuristic and optimization technique provides a simple and elegant solution to the synchronization problem that arises during the application of a predetermined test sequence in some protocol test architectures that utilize remote testers.

• Structural Engineering and Mechanics
• /
• v.55 no.3
• /
• pp.555-581
• /
• 2015

Triangular pyramid and Quadrangular pyramid elements for partial double-layer spherical reticulated shells of pyramidal system are investigated in the present study. Macro programs for six typical partial double-layer spherical reticulated shells of pyramidal system are compiled by using the ANSYS Parametric Design Language (APDL). Internal force analysis of six spherical reticulated shells is carried out. Distribution regularity of the stress and displacement are studied. A shape optimization program is proposed by adopting the sequence two-stage algorithm (RDQA) in FORTRAN environment based on the characteristics of partial double-layer spherical reticulated shells of pyramidal system and the ideas of discrete variable optimization design. Shape optimization is achieved by considering the objective function of the minimum total steel consumption, global and locality constraints. The shape optimization of six spherical reticulated shells is calculated with the span of 30m~120m and rise to span ratio of 1/7~1/3. The variations of the total steel consumption along with the span and rise to span ratio are discussed with contrast to the results of shape optimization. The optimal combination of main design parameters for six spherical reticulated shells is investigated, i.e., the number of the optimal grids. The results show that: (1) The Kiewitt and Geodesic partial double-layer spherical reticulated shells of triangular pyramidal system should be preferentially adopted in large and medium-span structures. The range of rise to span ratio is from 1/6 to 1/5. (2) The Ribbed and Schwedler partial double-layer spherical reticulated shells of quadrangular pyramidal system should be preferentially adopted in small-span structures. The rise to span ratio should be 1/4. (3) Grids of the six spherical reticulated shells can be optimized after shape optimization and the total steel consumption is optimized to be the least.

• Journal of Computational Design and Engineering
• /
• v.3 no.3
• /
• pp.266-273
• /
• 2016

Optimization of hole-making operations in manufacturing industry plays a vital role. Tool travel and tool switch planning are the two major issues in hole-making operations. Many industrial applications such as moulds, dies, engine block, automotive parts etc. requires machining of large number of holes. Large number of machining operations like drilling, enlargement or tapping/reaming are required to achieve the final size of individual hole, which gives rise to number of possible sequences to complete hole-making operations on the part depending upon the location of hole and tool sequence to be followed. It is necessary to find the optimal sequence of operations which minimizes the total processing cost of hole-making operations. In this work, therefore an attempt is made to reduce the total processing cost of hole-making operations by applying relatively new optimization algorithms known as shuffled frog leaping algorithm and proposed modified shuffled frog leaping algorithm for the determination of optimal sequence of hole-making operations. An industrial application example of ejector plate of injection mould is considered in this work to demonstrate the proposed approach. The obtained results by the shuffled frog leaping algorithm and proposed modified shuffled frog leaping algorithm are compared with each other. It is seen from the obtained results that the results of proposed modified shuffled frog leaping algorithm are superior to those obtained using shuffled frog leaping algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.3046-3070
• /
• 2017

Nowadays, the utilization of multiprocessor environments has been increased due to the increase in time complexity of application programs and decrease in hardware costs. In such architectures during the compilation step, each program is decomposed into the smaller and maybe dependent segments so-called tasks. Precedence constraints, required execution times of the tasks, and communication costs among them are modeled using a directed acyclic graph (DAG) named task-graph. All the tasks in the task-graph must be assigned to a predefined number of processors in such a way that the precedence constraints are preserved, and the program's completion time is minimized, and this is an NP-hard problem from the time-complexity point of view. The results obtained by different approaches are dominated by two major factors; first, which order of tasks should be selected (sequence subproblem), and second, how the selected sequence should be assigned to the processors (assigning subproblem). In this paper, a hybrid proposed approach has been presented, in which two different artificial ant colonies cooperate to solve the multiprocessor task-scheduling problem; one colony to tackle the sequence subproblem, and another to cope with assigning subproblem. The utilization of background knowledge about the problem (different priority measurements of the tasks) has made the proposed approach very robust and efficient. 125 different task-graphs with various shape parameters such as size, communication-to-computation ratio and parallelism have been utilized for a comprehensive evaluation of the proposed approach, and the results show its superiority versus the other conventional methods from the performance point of view.

• Journal of Microbiology and Biotechnology
• /
• v.22 no.3
• /
• pp.316-325
• /
• 2012

Xylanase has been used extensively in the industrial and agricultural fields. However, the low-yield production of xylanase from native species cannot meet the increasing demand of the market. Therefore, improving the heterologous expression of xylanase through basic gene optimization may help to overcome the shortage. In this study, we synthesized a high-GC-content native sequence of the thermostable xylanase gene xynB from Streptomyces olivaceoviridis A1 and, also designed a slightly AT-biased sequence with codons completely optimized to be favorable to Pichia pastoris. The comparison of the sequences' expression efficiencies in P. pastoris X33 was determined through the detection of single-copy-number integrants, which were quantified using qPCR. Surprisingly, the high GC content did not appear to be detrimental to the heterologous expression of xynB in yeast, whereas the optimized sequence, with its extremely skewed codon usage, exhibited more abundant accumulation of synthesized recombinant proteins in the yeast cell, but an approximately 30% reduction of the secretion level, deduced from the enzymatic activity assay. In this study, we developed a more accurate method for comparing the expression levels of individual yeast transformants. Moreover, our results provide a practical example for further investigation of what constitutes a rational design strategy for a heterologously expressed and secreted protein.

• Korean Chemical Engineering Research
• /
• v.43 no.5
• /
• pp.571-578
• /
• 2005

We propose a new optimization framework for the reactive scheduling. The proposed rescheduling scheme is specially focused on how to generate rescheduling results when equipment failure occurs. The approach is based on a continuous-time problem representation that takes into account the schedule in progress, the updated information on the batches still to be processed, the present plant state, the deviations in plant parameters and the time data. To update the predictive scheduling, we used right shift rescheduling and total regeneration when equipment failure occurs. And, a practical solution to the rescheduling problem requires satisfaction of two often confliction measures: the efficiency measure that evaluates the satisfaction of a desired objective function value and the stability measure that evaluates the amount of change between the schedules before and after the disruption. In this paper, the efficiency is measured by the makespan of all jobs in the system. And, the stability is measured by the percentage change in makespan and the modified sequence deviation in the predictive scheduling and rescheduling.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.11
• /
• pp.4268-4289
• /
• 2020

Advanced traffic signal timing method plays very important role in reducing road congestion and air pollution. Reinforcement learning is considered as superior approach to build traffic light timing scheme by many recent studies. It fulfills real adaptive control by the means of taking real-time traffic information as state, and adjusting traffic light scheme as action. However, existing works behave inefficient in complex intersections and they are lack of feasibility because most of them adopt traffic light scheme whose phase sequence is flexible. To address these issues, a novel adaptive traffic signal timing scheme is proposed. It's based on actor-critic reinforcement learning algorithm, and advanced techniques proximal policy optimization and generalized advantage estimation are integrated. In particular, a new kind of reward function and a simplified form of state representation are carefully defined, and they facilitate to improve the learning efficiency and reduce the computational complexity, respectively. Meanwhile, a fixed phase sequence signal scheme is derived, and constraint on the variations of successive phase durations is introduced, which enhances its feasibility and robustness in field applications. The proposed scheme is verified through field-data-based experiments in both medium and high traffic density scenarios. Simulation results exhibit remarkable improvement in traffic performance as well as the learning efficiency comparing with the existing reinforcement learning-based methods such as 3DQN and DDQN.

• International Journal of Aeronautical and Space Sciences
• /
• v.17 no.3
• /
• pp.332-340
• /
• 2016

A design optimization is performed for the double-bolted joint in cylindrical composite structures by using a simplified analytical method. This method uses failure criteria for the major failure modes of the bolted composite joint. For the double-bolted joint with a zigzag arrangement, it is necessary to consider an interaction effect between the bolt arrays. This paper proposes another failure mode which is determined by angle and distance between two bolts in different arrays and define a failure criterion for the failure mode. The optimal design for the double-bolted joint is carried out by considering the interactive net-tension failure mode. The genetic algorithm (GA) is adopted to determine the optimized parameters; bolt spacing, edge distance, and stacking sequence of the composite laminate. A purpose of the design optimization is to maximize the burst pressure of the cylindrical structures by ensuring structural integrity. Also, a progressive failure analysis (PFA) is performed to verify the results of the optimal design for the double-bolted joint. In PFA, Hashin 3D failure criterion is used to determine the ply that would fail. A stiffness reduction model is then used to reduce the stiffness of the failed ply for the corresponding failure mode.

• Journal of the Society of Naval Architects of Korea
• /
• v.37 no.3
• /
• pp.90-98
• /
• 2000

Nesting and cutting path optimization have a great effect on price competitions and improvement of productivity in various industries such as the shipbuilding, the auto, the clothing, and so on. But the theoretical approach on the development of cutting path optimization algorithm, which can be applied effectively in the shipbuilding, has not been performed enough because parts are so complex and various. In this study, a new solution has been presented to solve the cutting path problem in 2-D cutting by using improved genetic algorithm. The presented optimization algorithm can search not only the cutting sequence of parts but also the position of piercing point by applying the effective neighborhood solution generating method

• The Journal of the Korea Contents Association
• /
• v.6 no.4
• /
• pp.46-54
• /
• 2006

We propose an optimization method for PCB assembly lines including multiple surface mounters. To increase the productivity of PCB assembly line, the component allocation, feeder assignment, and assembly sequence of each surface mounter should be optimized. The optimization Problem is formulated as an integer programming problem. We divide the overall problem into two hierarchical sub-problems: forward-path problem and backward-path problem. The clustering algorithm and branch-and-bound algorithm are applied to solve the forward-path problem. The assignment algorithm and connection algorithm are applied to solve the backward-path problem. Simulation results are presented to verify the usefulness of the proposed method.