• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.12
• /
• pp.31-39
• /
• 1998

This paper presents the design and implementation of a new multimedia fixed-point DSP (MDSP) core for portable multimedia applications. The MDSP instruction set is designed through the analysis of multimedia algorithms and DSP instruction sets. The MDSP architecture employs parallel processing techniques, such as SIMD and vector processing as well as DSP techniques. The instruction set can handle various data formats and MDSP can perform two MAC operations in parallel. The switching network and packing network can increase the performance by overlapping data rearrangement cycles with computation cycles. We have designed Verilog HDL models and the 0.6 $\mu\textrm{m}$ Samsung KG75000 SOG library is used. The total gate count is 68,831 and the clock frequency is 30 MHz.

• Design & Manufacturing
• /
• v.13 no.3
• /
• pp.53-58
• /
• 2019

This paper presents Artificial Neural Network(ANN) method to predict maximum injection pressure of injection molding machine and weights of injection molding products. 5 hidden layers with 10 neurons is used in the ANN. The ANN was conducted with 5 Input parameters and 2 response data. The input parameters, i.e., melt temperature, mold temperature, fill time, packing pressure, and packing time were selected. The combination of the orthogonal array L27 data set and 23 randomly generated data set were applied in order to train and test for ANN. According to the experimental result, error of the ANN for weights was $0.49{\pm}0.23%$. In case of maximum injection pressure, error of the ANN was $1.40{\pm}1.19%$. This value showed that ANN can be successfully predict the injection pressure and the weights of injection molding products.

• Design & Manufacturing
• /
• v.16 no.3
• /
• pp.1-8
• /
• 2022

In this study, an artificial neural network(ANN) was constructed to establish the relationship between process condition prameters and the qualities of the injection-molded product in the injection molding process. Six process parmeters were set as input parameter for ANN: melt temperature, mold temperature, injection speed, packing pressure, packing time, and cooling time. As output parameters, the mass, nominal diameter, and height of the injection-molded product were set. Two learning structures were applied to the ANN. The single-task learning, in which all output parameters are learned in correlation with each other, and the multi-task learning structure in which each output parameters is individually learned according to the characteristics, were constructed. As a result of constructing an artificial neural network with two learning structures and evaluating the prediction performance, it was confirmed that the predicted value of the ANN to which the multi-task learning structure was applied had a low RMSE compared with the single-task learning structure. In addition, when comparing the quality specifications of injection molded products with the prediction values of the ANN, it was confirmed that the ANN of the multi-task learning structure satisfies the quality specifications for all of the mass, diameter, and height.

• Korean Journal of Fisheries and Aquatic Sciences
• /
• v.33 no.5
• /
• pp.399-402
• /
• 2000

Very little information is known on the canning of fishery products by vacuum pack. In this paper, some fundamental process conditions for the canning of fishery products were investigated. Moisture-controlled mackerel pike, shrimp and oyster were packed in lacquered cans with spice and additives. After sealing, pressure of the cans were reduced by do-aeration through specially designed gas-tight silicone rubber plug previously attacked to the lid. On this investigation, vacuum can prior to thermal processing were set up to 15, 30, 45 and 60 cmHg, The higher vacuum in cans showed the more quick heat transfer in thermal processing. tinder 60 cmHg vacuum, the heat transfer was more quick than that of the conventional water packed products, Under 15 cmHg, however, the heat transfer was markedly increased by air which acted as an insulator in conductive heat transfer. These results demonstrated that high vacuum was essential secure for the heat processing in vacuum pack.

• Journal of Advanced Navigation Technology
• /
• v.25 no.3
• /
• pp.211-216
• /
• 2021

Multiple UAV System has been used for various purposes such as reconnaissance, networking and aerial photography. In such systems, it is essential to form and maintain the formation of multiple UAVs. This paper proposes the algorithm that produces an autonomous distributed control for each vehicle for a flexible formation. This command is a repulsive force in the form of the second-order system by the nearest UAV or mission area. The algorithm uses the relative position/speed through sensing and communication for calculating the command without external intervention. The command allows each UAV to follow the reference distance and fill the mission area as densely as possible without overlapping. We determine the reference distance via optimization technique solving the packing problem. The mission area comprises the desired formation outline and can be set flexibly depending on the mission. Numerical simulation is carried out to verify the performance of the proposed algorithm under a complex and flexible environment. The formation is formed in 26.94 seconds and has a packing density of 71.91%.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.12-19
• /
• 1993

In general, the line balancing problem is defined as of finding an assignment of the given jobs to the workstations under the precedence constraints given to the set of jobs. Usually, the objective is either minimizing the cycle time under the given number of workstations or minimizing the number of workstations under the given cycle time. In this paper, we present a new type of an assembly line balancing problem which occurs in an electronics company manufacturing home appliances. The main difference of the problem compared to the general line balancing problem lies in the structure of the precedence given to the set of jobs. In the problem, the set of jobs is partitioned into two disjoint subjects. One is called the set of fixed jobs and the other, the set of floating jobs. The fixed jobs should be processed in the linear order and some pair of the jobs should not be assigned to the same workstations. Whereas, to each floating job, a set of ranges is given. The range is given in terms of two fixed jobs and it means that the floating job can be processed after the first job is processed and before the second job is processed. There can be more than one range associated to a floating job. We present a procedure to find an approximate solution to the problem. The procedure consists of two major parts. One is to find the assignment of the floating jobs under the given (feasible) assignment of the fixed jobs. The problem can be viewed as a constrained bin packing problem. The other is to find the assignment of the whole jobs under the given linear precedence on the set of the floating jobs. First problem is NP-hard and we devise a heuristic procedure to the problem based on the transportation problem and matching problem. The second problem can be solved in polynomial time by the shortest path method. The algorithm works in iterative manner. One step is composed of two phases. In the first phase, we solve the constrained bin packing problem. In the second phase, the shortest path problem is solved using the phase 1 result. The result of the phase 2 is used as an input to the phase 1 problem at the next step. We test the proposed algorithm on the set of real data found in the washing machine assembly line.

• Biotechnology and Bioprocess Engineering:BBE
• /
• v.9 no.5
• /
• pp.414-418
• /
• 2004

A 'minimally complex problem set' for ab initio protein Structure prediction has been proposed. As well as consisting of non-redundant and crystallographically determined high-resolution protein structures, without disulphide bonds, modified residues, unusual connectivities and heteromolecules, it is more importantly a collection of protein structures. with a high probability of being the same in the crystal form as in solution. To our knowledge, this is the first attempt at this kind of dataset. Considering the lattice constraint in crystals, and the possible flexibility in solution of crystallographically determined protein structures, our dataset is thought to be the safest starting points for an ab initio protein structure prediction study.

• Journal of Korea Multimedia Society
• /
• v.14 no.9
• /
• pp.1165-1174
• /
• 2011

In data broadcasting systems, servers continuously disseminate data items through broadcast channels, and mobile client only needs to wait for the data of interest to present on a broadcast channel. However, because broadcast channels are shared by a large set of data items, the expected delay of receiving a desired data item may increase. This paper explores the issue of designing proper data allocation on multiple broadcast channels to minimize the average expected delay time of all data items, and proposes a new data allocation scheme named two level bin-packing(TLBP). This paper first introduces the theoretical lower-bound of the average expected delay, and determines the bin capacity based on this value. TLBP partitions all data items into a number of groups using bin-packing algorithm and allocates each group of data items on an individual channel. By employing bin-packing algorithm in two step, TLBP can reflect a variation of access probabilities among data items allocated on the same channel to the broadcast schedule, and thus enhance the performance. Simulation is performed to compare the performance of TLBP with three existing approaches. The simulation results show that TLBP outperforms others in terms of the average expected delay time at a reasonable execution overhead.

• Journal of the Korean Institute of Navigation
• /
• v.24 no.5
• /
• pp.361-371
• /
• 2000

This paper treats a genetic algorithm for ship scheduling problem in set packing formulation. We newly devised a partition based representation of solution and compose initial population using a domain knowledge of problem which results in saving calculation cost. We established replacement strategy which makes each individual not to degenerate during evolutionary process and applied adaptive mutate operator to improve feasibility of individual. If offspring is feasible then an improve operator is applied to increase objective value without loss of feasibility. A computational experiment was carried out with real data and showed a useful result for a large size real world problem.

• Journal of the Korean Institute of Navigation
• /
• v.14 no.1
• /
• pp.21-38
• /
• 1990

This paper discusses the various modes of operations of cargo ships which are liner operations, tramp shipping and industrial operations, and mathematical programming, simulation , and heuristic method that can be used to solve ships routing and scheduling problems for each of these operations. In particular, this paper put emphasis on a crude oil tanker scheduling problem. The problem is to achieve an optimal sequence of cargoes or an optimal schedule for each ship in a given fleet during a given period. Each cargo is characterized by its type, size, loading and discharging ports, loading and discharging dates, cost, and revenue. Our approach is to enumerate all feasible candidate schedate schedules for each ship, where a candidate schedule specifies a set of cargoes that can be feasibly carried by a ship within the planning horizon , together with loading and discharging dates for each cargo in the set. Provided that candidate schedules have been generated for each ship, the problem of choosing from these an optimal schedule for each ship is formulated as a set partitioning problem, a set packing problem, and a integer generalized network problem respectively. We write the PASCAL programs for schedule generator and apply our approach to the crude oil tanker scheduling problem similar to a realistic system.