• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.3
• /
• pp.161-168
• /
• 2002

A secret sharing scheme is a cryptographic protocol to share a secret among a set of participants P in the way that only qualified subsets of P can reconstruct the secret whereas any other subset of P, non-qualified to know the secret, cannot determine anything about the secret. In this paper, we propose a new secret sharing scheme in hierarchical groups, whose hierarchy can be represented as a tree structure. In the tree structure, participants of higher levels have priorities to reconstruct the secret over participants of lower levels. In the absence of the participant of a higher level, it is possible for this participant to delegate the ability to reconstruct the secret to the child nodes of the next lower level through the transfer of his delegation ticket. This scheme has a dynamic access structure through the recursive delegation process from the root to lower levels where participants aren't absent.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.7 s.98
• /
• pp.709-719
• /
• 2005

The forward link of the 3 G CDMA system may become limited under the increasing of the number of users. The conventional channelization code, Walsh code, has not enough sizes for much possible non, therefore, the quasi orthogonal function(QOF), which process optimal cross-correlation with Walsh code, is considered. In this paper, we investigate quasi orthogonal function on Jacket matrices, which can lead lower correlations values and better performance in 3 G CDMA system. Moreover, to simple the detector and improve the BER performance, a novel detection for QOF CDMA system is proposed. Finally, the simple recursive generation of the bent sequences for QOF mask function is discussed.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.8
• /
• pp.1195-1208
• /
• 1997

Bellows is a component in piping systems which absorbs mechanical deformation with flexibility. Its geometry is an axial symmetric shell which consists of two toroidal shells and one annular plate or conical shell. In order to analyze bellows, this study presents the finite element analysis using a conical frustum shell element. A finite element analysis is developed to analyze various bellows. The validity of the developed program is verified by the experimental results for axial and lateral stiffness. The formula for calculating the natural frequency of bellows is made by the simple beam theory. The formula for fatigue life is also derived by experiments. The shape optimal design problem is formulated using multiple objective optimization. The multiple objective functions are transformed to a scalar function by weighting factors. The stiffness, strength and specified stiffness are considered as the multiple objective function. The formulation has inequality constraints imposed on the fatigue limit, the natural frequencies, and the manufacturing conditions. Geometric parameters of bellows are the design variables. The recursive quadratic programming algorithm is selected to solve the problem. The results are compared to existing bellows, and the characteristics of bellows is investigated through optimal design process. The optimized shape of bellows is expected to give quite a good guideline to practical design.

• IE interfaces
• /
• v.13 no.3
• /
• pp.378-387
• /
• 2000

As the globalization of manufacturing companies continues, the scope of dependence between these companies and distributors, and other suppliers are growing very rapidly since no one company manufactures or distributes the whole product by themselves. And, the need to increase the efficiency of the whole supply chain is increasing. This paper deals with a multi-plant lot-sizing problem(MPLSP) which happens in a decentralized manufacturing system of a supply chain. In this study, we assume that the whole supply chain is driven by a single source of independent demand and many levels of dependent demands among manufacturing systems in the supply chain. We consider setup cost, transportation cost and time, and inventory holding cost as a decision factor in the MPLSP. The MPLSP is decomposed into two sub-problems: a planning problem of the whole supply chain and a lot-sizing problem of each manufacturing system. The supply chain planning problem becomes a pure linear programming problem and a Generalized Goal Decomposition method is used to solve the problem. Its result is used as a goal of the lot-sizing problem. The lot-sizing problem is solved using the CPLEX package, and then the coefficients of the planning problem are updated reflecting the lot-sizing solution. This procedure is repeated until termination criteria are met. The whole solution process is similar to Lagrangian relaxation method in the sense that the solutions are approaching the optimum in a recursive manner. Through experiments, the proposed closed-loop hierarchical planning and traditional hierarchical planning are compared to optimal solution, and it is shown that the proposed method is a very viable alternative for solving production planning problems of decentralized manufacturing systems and in other areas.

• Journal of Advanced Navigation Technology
• /
• v.19 no.6
• /
• pp.614-622
• /
• 2015

Binary MQ arithmetic coding is widely used recently as a basic entropy coder in multimedia coding system. MQ coder esteems high in compression efficiency to be used in JBIG2 and JPEG2000. The importance of arithmetic coding is increasing after it is adopted as an unique entropy coder in HEVC standard. In the binary MQ coder, arithmetic approximation without multiplication is used in the process of recursive subdivision of range interval. Because of the MPS/LPS exchange activity happened in MQ coder, output byte tends to increase. This paper proposes an enhanced binary MQ arithmetic coder to make use of a lookup table for AQe using quantization skill in order to reduce the deficiency. Experimental results show that about 4% improvement of compression in case of JBIG2 for bi-level image compression standard. And also, about 1% improvement of compression ratio is obtained in case of lossless JPEG2000 coding. For the lossy JPEG2000 coding, about 1% improvement of PSNR at the same compression ratio. Additionally, computational complexity is not increasing.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.155-160
• /
• 2003

This paper presents a multiple face detector based on a robust pupil detection technique. The pupil detector uses active illumination that exploits the retro-reflectivity property of eyes to facilitate detection. The detection range of this method is appropriate for interactive desktop and kiosk applications. Once the location of the pupil candidates are computed, the candidates are filtered and grouped into pairs that correspond to faces using heuristic rules. To demonstrate the robustness of the face detection technique, a dual mode face tracker was developed, which is initialized with the most salient detected face. Recursive estimators are used to guarantee the stability of the process and combine the measurements from the multi-face detector and a feature correlation tracker. The estimated position of the face is used to control a pan-tilt servo mechanism in real-time, that moves the camera to keep the tracked face always centered in the image.

• Computers and Concrete
• /
• v.15 no.5
• /
• pp.771-794
• /
• 2015

This paper proposes an innovative method for selection of measurement sets in static parameter identification of concrete or steel bridges. This method is proved as a systematic tool to address the first steps of Structural System Identification procedures by observability techniques: the selection of adequate measurement sets. The observability trees show graphically how the unknown estimates are successively calculated throughout the recursive process of the observability analysis. The observability trees can be proved as an intuitive and powerful tool for measurement selection in beam bridges that can also be applied in complex structures, such as cable-stayed bridges. Nevertheless, in these structures, the strong link among structural parameters advises to assume a set of simplifications to increase the tree intuitiveness. In addition, a set of guidelines are provided to facilitate the representation of the observability trees in this kind of structures. These guidelines are applied in bridges of growing complexity to explain how the characteristics of the geometry of the structure (e.g. deck inclination, type of pylon-deck connection, or the existence of stay cables) affect the observability trees. The importance of the observability trees is justified by a statistical analysis of measurement sets randomly selected. This study shows that, in the analyzed structure, the probability of selecting an adequate measurement set with a minimum number of measurements at random is practically negligible. Furthermore, even bigger measurement sets might not provide adequate SSI of the unknown parameters. Finally, to show the potential of the observability trees, a large-scale concrete cable-stayed bridge is also analyzed. The comparison with the number of measurements required in the literature shows again the advantages of using the proposed method.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.605-614
• /
• 2007

As a standard query language to search XML data, XQuery and XPath were proposed by W3C. By widely using XQuery and XPath languages, recent researches focus on the development of query processing algorithm and data structure for efficiently processing XML query with the enormous XML database system. Recently, when processing XML path expressions, the concept of the structural join which may determine the structural relationship between XML elements, e.g., ancestor-descendant or parent-child, has been one of the dominant XPath processing mechanisms. However, structural joins which frequently occur in XPath query processing require high cost. In this paper, we propose a new structural join algorithm, called SISJ, based on our structured index, called SI, in order to process XPath queries efficiently. Experimental results show that our algorithm performs marginally better than previous ones. However, in the case of high recursive documents, it performed more than 30% by the pruning feature of the proposed method.

• Journal of the Korean Society for Precision Engineering
• /
• v.24 no.10
• /
• pp.64-74
• /
• 2007

Because of the size and environment in the shipbuilding process, the portable type robot is required for the automatic seam tracking. For this reason, the structure of laser sensor should be considered in the initial design step and the coordinate transformation between welding robot and laser sensor, which is joint finder, must be identified exactly and the real time tracking algorithm based on these consideration could be developed. In this research, laser displacement sensor in which its structure is laser beam's vertical projection, is developed to recognize the location of weld joint. In practical applications, however, images of weld joints are often degraded because of the surface specularity or spatter. To overcome the problem, the constrained joint finding algorithm is proposed. In the approach of coordinate conversion rule for the visual feedback control among welding torch, robot body and laser sensor is applied by the same reference point method. In the real time seam tracking algorithms we propose constrained sampling method which uses look ahead distance. The RLS(Recursive Least Square) filter is applied to obtain the smooth tracking path from the sensitive edge data. From the experimental results, we could see the possibility that the developed laser sensor with proposed processing algorithm and real time seam tracking method can be used as a welding under the shipbuilding condition.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9C
• /
• pp.721-728
• /
• 2010

CAMC (constant amplitude multi-code) has a better performance of error correction in iterative decoding than SPCPC (single parity check product code). CAMC benefits from a processing gain since it belongs to a spread spectrum signal. We show that the processing gain enhances the performance of CAMC. Additional correction of bit errors is achieved in the de-spreading of iteratively decoded signal. If the number of errors which survived the iterative decoding is less than or equal to ($\sqrt{N}/2-1$), all of the bit errors are removed after the de-spreading. We also propose a stopping criterion in the iterative decoding, which is based on the histogram of EI (extrinsic information). The initial values of EI are randomly distributed, and then they converge to ($-E_{max}$) or ($+E_{max}$) over the iterations. The strength of the convergence reflects how successfully error correction process is performed. Experimental results show that the proposed method achieves a gain of 0.2 dB in Eb/No.