• Journal of Biosystems Engineering
• /
• v.27 no.5
• /
• pp.399-408
• /
• 2002

The sweet persimmons are producted 227,394 tons per year in Korea. They are preserved at cold storage after wrapping them in packing vinyl to maintain quality. Using conventional handwork, a skillful worker could probably produce only 1,000 packings a day. Hiring many skilled-labors to wrap sweet persimmons in packing vinyl seems to be difficult because of the recent rural crisis. Therefore, it was necessary to be developed for the automated ordering and packing unit that is convenient and laborsaving. This study were summarized as follows : Success rates of 99%, 100%, and 88% were observed for ordering parts, sealing and cutting films, and sealing films in the inlet part, respectively. The time required per 1 cycle was 16 seconds and the developed unit performed 225 cycles an hour. The unit showed an ability of 1,125 pieces per hour. Therefore, the productivity was 10 times greater than that of skillful handwork.

• Korean Journal of Materials Research
• /
• v.10 no.7
• /
• pp.478-481
• /
• 2000

Single phase $Pb(Mg_{1/3}Nb_{2/3})O_3$ ceramics doped by 10 mol% of electron donors such as $La^3,\; Pr^{3+,4+},\; Nd^{3+},\; Sm^{3+}$, were synthesized and their B-site cationic ordering structures were investigated by XRD and TEM. In the XRD patterns, only fundamental reflections were observed for the undoped $Pb(Mg_{1/3}Nb_{2/3})O_3$, while the (h/2 $\textsc{k}$/2ι/2)(h,$\textsc{k}$,ι all odd) superlattice reflections resulting from the 1:1 ordering induced unit cell doubling were also observed for the donor-doped $Pb(Mg_{1/3}Nb_{2/3})O_3$. In the TEM selected area diffraction patterns, the (h/2 k/2 l/2)(h,k,l all odd) superlattice reflection spots as well as the fundamental reflection spots were observed for all the samples, but the relative intensities of the superlattice reflection spots to the fundamental reflection spots were significantly enhanced by the donor-doping. In the TEM dark-field images, antiphase boundaries were observed only for the donor-doped $Pb(Mg_{1/3}Nb_{2/3})O_3$. It was therefore experimentally verified that doping by electron donors such as $La^3,\; Pr^{3+,4+},\; Nd^{3+},\; Sm^{3+}$, enhances the B-site cationic 1:1 ordering in $Pb(Mg_{1/3}Nb_{2/3})O_3$. These experimental results were interpreted in terms of the charge compensation mechanism.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 1996.11a
• /
• pp.49-53
• /
• 1996

Crystal structures of N $a_{x}$W $O_3$(0.5$\leq$x$\leq$1.0) were investigated. Transmission electron microscopy (TEM) studies indicate that there is an ordering of sodium ions when x=0.75. The direction of ordering is [110] and the wavelength of ordering is twice of the interplanar distance of (110) plane. It has been confirmed that a superlattice containing eight N $a_{0.75}$W $O_3$is the unit cell of ordered structure. In this unit cell, Na sites at (100) and ($\frac{1}{2}$$\frac{1}{2}$$\frac{1}{2}$) are vacant. The ordered phase was preserved after the annealing at $600^{\circ}C$ in the air. In reduced N $a_{x}$W $O_3$with x=0.5 and 1.0, extra phases were found to coexist with the partially ordered perovskite phase. After annealing at $600^{\circ}C$, theses phases were transformed into the phases found in calcined specimens.ens.s.

• Survey Research
• /
• v.9 no.2
• /
• pp.29-49
• /
• 2008

Many survey data are collected today to measure personal values and to order them according to their importance. There are two popular procedures to achieve the goal: ranking procedures and rating procedures. The ranking procedures can be divided into two categories; full ranking procedures and reduced ranking procedures. The reduced ranking procedure is more often used because of its easiness to respondents. However, the ordered responses are not generally incorporated into ordering their values. This research has studied ways to incorporate the ordered responses into ordering the values. We have considered the ranking scales as the conditional rating scales. Our findings are that the ordering values based on the weighted proportions is better than one based on the unweighted proportions.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.93-96
• /
• 2005

We propose a computationally efficient sphere decoding (SD) algorithm with smart radius control (SRC). As a baseline algorithm for SD, we consider the modified Schnorr-Euchner (SE) algorithm [1] (hereafter, called as the MSE algorithm). In principle, the radius after zero-forcing decision feedback equalization (ZF-DFE) estimation can be reduced further if we select a new lattice vector closer to the received signal vector than the lattice vector corresponding to the ZF-DFE estimate does. In our case, we obtain such a better lattice vector by performing a sequence of alternating one-dimensional searches, starting from the ZF-DFE estimate. We then develop a novel SRC algorithm that adopts adaptively the additional radius reduction process according to the estimated signal-to-noise-power ratio (SNR) after ZF-DFE estimation. In addition, we analyze the effect of detection ordering on the complexity for SD. Column-norm ordering of the channel matrix and optimal ordering [1] are considered here. From our analyses, we see that SRC can reduce greatly the complexity for SD and the degree of complexity reduction gets significant as the SNR decreases, irrespective of detection ordering schemes used.

• International Journal of Advanced Culture Technology
• /
• v.8 no.1
• /
• pp.62-70
• /
• 2020

As an effective means of price discrimination, some suppliers offer trade credit to the distributors in order to stimulate the demand for the product they produce. The availability of the delay in payments from the supplier enables discount of the distributor's selling price from a wider range of the price option in anticipation of increased customer's demand. Since the distributor's lot-size is affected by the demand for the customer, the distributor's lot-size and the selling price determination problem is interdependent and must be solved at the same time. Also, in many common business transactions, the distributor pays the shipping cost for the order and hence, the distributor's ordering cost consists of a fixed ordering cost and the shipping cost that depend on the order quantity. In this regard, we deal with the joint lot-size and price determination problem when the supplier allows delay in payments for an order of a product. The positive effects of credit transactions can be integrated into the EOQ (economic order quantity) model through the consideration of retailing situations, where the customer's demand is a function of the distributor's selling price. It is also assumed that the distributor's order cost consists of a fixed ordering cost and the variable shipping cost. We formulate the distributor's mathematical model from which the solution algorithm is derived based on properties of an optimal solution. A numerical example is presented to illustrate the algorithm developed.

• Journal of Korean Library and Information Science Society
• /
• v.14
• /
• pp.149-179
• /
• 1987

The concept of a "switching language " between different indexing languages and information retrieval systems has been discussed since the mid-1960s. Some preliminary investigates into the feasibility of switching between mediating tool yielded positive results. The Broad system of ordering(BSO) , a general classification scheme for information exchange and switching, has been under development as a joint FID/UNESCO project since 1973. The purpose of this study is to find out the origin, development, definition, and principle of BSO. The results of the study can be summarized as follows: (1) BSO is a switching language for the purpose of interconnection of information system which is located different regions, or using different indexing languages. (2) BSO is in effect, fully faceted and broad classification system. (3) BSO is not only a subject code but also an ordering system. (4) BSO can be used information retrieval system because the notation of composite subjects is formed by combining notation. (5) BSO has to some extent sacrificed brevity by leaving large unused notational gap for future use. (6) The structure of the scheme is in no way dependent upon the notation. notation.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.1
• /
• pp.78-89
• /
• 2003

Ordering is performed to reduce the amount of fill-ins of the Cholesky factor of a symmetric positive definite matrix. This paper proposes a new ordering algorithm that reduces the fill-ins of the Cholesky factor iteratively by elimination tree rotations and clique separators. Elimination tree rotations have been used mainly to reorder the rows of the permuted matrix for the efficiency of storage space management or parallel processing, etc. In the proposed algorithm, however, they are repeatedly performed to reduce the fill-ins of the Cholesky factor. In addition, we presents a simple method for finding a minimal node separator between arbitrary two nodes of a chordal graph. The proposed reordering procedure using clique separators enables us to obtain another order of rows of which the number of till-ins decreases strictly.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.1
• /
• pp.19-27
• /
• 1991

A new bandwidth reduction algorithm is developed by combining the two-step approach and the frontal ordering scheme. In the two-step approach, finite elements are numbered first, followed by nodal numbering based on the graph theory. The concept of wave front is incorporated into it to control the cardinality of the set of adjacent nodes and the bandwidth to be achieved. They are controlled systematically by rational selection of next candidates with the purpose of getting the smaller bandwidth efficiently. Eighteen meshes are renumbered and the results are compared with those of well-known algorithms. The results demonstrate the efficiency and the reliability of the proposed algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.327-331
• /
• 2006

This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands and the product is provided to the warehouse via procurement ordering from any manufacturing plant or market The Problem is formulated as an Mixed Integer Programming with the objective function of minimizing the sum of inventory holding cost (at the warehouse and retailers), and transportation cost and procurement ordering cost at the warehouse, subject to inventory-balancing constraints, ordering constraints, vehicle capacity constraints and transportation time constraints. The problem is Proven to be NP-hard. Accordingly, a Lagrangean heuristic procedure is derived and tested for its effectiveness through computational experiments with some numerical instances.