• Journal of Korean Foot and Ankle Society
• /
• v.16 no.4
• /
• pp.270-275
• /
• 2012

There may be complications after comminuted or intraarticular calcaneal fracture regardless of the initial treatment. Transcalcaneal talonavicular dislocation is rarely reported severe form of calcaneal fracture. We experienced a neglected transcalcaneal talonavicular subluxation case, who had been treated for intraarticular calcaneal fracture conservatively. Subtalar distraction bone block fusion was done for calcaneal malunion with talonavicular subluxation. Inspite of successful subtalar fusion, pain was persisted because of talonavicular re-subluxation with arthritis and calcaneocuboid arthritis. So, second operation, the talonavicular and calcaneocuboid fusion, was done. After union achieved, the patient's foot pain was improved. Calcaneal malunion combined with talonavicular subluxation and unstable transverse tarsal joint, such as this case, initial triple arthrodesis could be considered.

• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.59-80
• /
• 2003

An incomplete factorization method for preconditioning symmetric positive definite matrices is introduced to solve normal equations. The normal equations are form to solve linear least squares problems. The procedure is based on a block incomplete Cholesky factorization and a multilevel recursive strategy with an approximate Schur complement matrix formed implicitly. A diagonal perturbation strategy is implemented to enhance factorization robustness. The factors obtained are used as a preconditioner for the conjugate gradient method. Numerical experiments are used to show the robustness and efficiency of this preconditioning technique, and to compare it with two other preconditioners.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.297-307
• /
• 2012

A femtocell is a small cellular base station, typically designed for use in a home or small business. The random deployment of a femtocell has a critical effect on the performance of a macrocell network due to co-channel interference. Utilizing the advantage of a multiple-input multiple-output system, each femto base station (FBS) is able to form a cluster and generates a precoding matrix, which is a modified version of conventional single-cell block diagonalization, in a cooperative manner. Since interference from clustered-FBSs located at the nearby macro user equipment (MUE) is the dominant interference contributor to the coexisting networks, each cluster generates a precoding matrix considering the effects of interference on nearby MUEs. Through simulation, we verify that the proposed algorithm shows better performance respective to both MUE and femto user equipment, in terms of capacity.

• Journal of Information Processing Systems
• /
• v.14 no.1
• /
• pp.101-128
• /
• 2018

Thanks to its potential in many applications, Blockchain has recently been nominated as one of the technologies exciting intense attention. Blockchain has solved the problem of changing the original low-trust centralized ledger held by a single third-party, to a high-trust decentralized form held by different entities, or in other words, verifying nodes. The key contribution of the work of Blockchain is the consensus algorithm, which decides how agreement is made to append a new block between all nodes in the verifying network. Blockchain algorithms can be categorized into two main groups. The first group is proof-based consensus, which requires the nodes joining the verifying network to show that they are more qualified than the others to do the appending work. The second group is voting-based consensus, which requires nodes in the network to exchange their results of verifying a new block or transaction, before making the final decision. In this paper, we present a review of the Blockchain consensus algorithms that have been researched and that are being applied in some well-known applications at this time.

• Bulletin of the Korean Mathematical Society
• /
• v.58 no.4
• /
• pp.1003-1019
• /
• 2021

In this paper, we introduce a class of maximal functions along twisted surfaces in ℝⁿ×ℝ^m of the form {(𝜙(|v|)u, 𝜑(|u|)v) : (u, v) ∈ ℝⁿ×ℝ^m}. We prove L^p bounds when the kernels lie in the space L^q (𝕊^n-1×𝕊^m-1). As a consequence, we establish the L^p boundedness for such class of operators provided that the kernels are in L log L(𝕊^n-1×𝕊^m-1) or in the Block spaces B^0,0_q (𝕊^n-1×𝕊^m-1) (q > 1).

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.50-62
• /
• 1994

The majority of database users interact with database systems by manipulating forms. This paper discusses the fundamentals underlying forms and considers low these mechanisms affect the behavior of forms We then review the forms supported by commercial products. None of the packages reviewed provide all of the features that make up an ideal form. We propose a new design that overcomes many of the limitations observed in the packages currently available. The new system is event- driven, object-oriented, supports a hierachy of composite blocks, and is primarily modeless. Forms are defined as top-level blocks and blocks can be either atomic or composite structures with methods directly included in their definition. Messages are passed among form objects. Defining forms with the proposed system is simple because from definitions are similar to type declarations in Pascal.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.4C
• /
• pp.365-373
• /
• 2003

In this paper, we design a versatle RS decoder which can decode RS codes of any block length n as well as any message length k, based on a modified Euclid's algorithm (MEA). This unique feature is favorable for a shortened RS code of any block length it eliminates the need to insert zeros before decoding a shortened RS code. Furthermore, the value of error correcting capability t can be changed in real time at every codeword block. Thus, when a return channel is available, the error correcting capability can be adaptiverly altered according to channel state. The decoder permits 4-step pipelined processing : (1) syndrome calculation (2) MEA block (3) error magnitude calculation (4) decoder failure check. Each step is designed to form a structure suitable for decoding a RS code with varying block length. A new architecture is proposed for a MEA block in step (2) and an architecture of outputting in reversed order is employed for a polynomial evaluation in step (3). To maintain to throughput rate with less circuitry, the MEA block uses not only a multiplexing and recursive technique but also an overclocking technique. The adaptive RS decoder over GF($2^8$) with the maximal error correcting capability of 10 has been designed in VHDL, and successfully synthesized in a FPGA.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.9
• /
• pp.397-406
• /
• 2017

In case of using the existing encrypted algorithm for massive data encryption service under the cloud environment, the problem that requires much time in data encryption come to the fore. To make up for this weakness, a partial encryption method is used generally. However, the existing partial encryption method has a disadvantage that the encrypted data can be inferred due to the remaining area that is not encrypted. This study proposes a partial encryption method of increasing the encryption speed and complying with the security standard in order to solve this demerit. The proposed method consists of 3 processes such as header formation, partial encryption and block shuffle. In step 1 Header formation process, header data necessary for the algorithm are generated. In step 2 Partial encryption process, a part of data is encrypted, using LEA (Lightweight Encryption Algorithm), and all data are transformed with XOR of data in the unencrypted part and the block generated in the encryption process. In step 3 Block shuffle process, the blocks are mixed, using the shuffle data stored with the random arrangement form in the header to carry out encryption by transforming the data into an unrecognizable form. As a result of the implementation of the proposed method, applying it to a mobile device, all the encrypted data were transformed into an unrecognizable form, so the data could not be inferred, and the data could not be restored without the encryption key. It was confirmed that the proposed method could make prompt treatment possible in encrypting mass data since the encryption speed is improved by approximately 273% or so compared to LEA which is Lightweight Encryption Algorithm.

• Korean Institute of Interior Design Journal
• /
• v.13 no.3
• /
• pp.129-136
• /
• 2004

The purpose of this study is to provide basic information and guide line for designing hotels located in metropolis by analyzing the spatial configuration of public area. As the sample of analysis, ten hotels are selected in Tokyo area, which were constructed during 1970 to 1990; the period was characterized by booming hotel constructions. The findings of the above analytical survey might be summarized as follows. First of all, it was found that all hotels constructed during the above mentioned periods could be classified into two categories according to their block type such as interlocking form and form within form types. It also observed the six hotels out of then had adopted form within form, beside, the left four hotels were constructed along the interlocking form type. Secondly, as regard to the functional space configuration of the public area, it was found that, in case of eight hotels, the upper part of the building which allocated as residential quarter are configured as linear type. As regard the lower part, however, it was found that different types are adopted. For instance, five hotels had adopted con-course types for the lower level that is spared for the public/service area. Beside, it was also found that, out of above five hotels, three hotels took form within type and the other two adopted compromising type. Thirdly, as regard to the composition of public area, it was found that, the quarters are allocated as follows, such as 34.11 percent for public, 28.99 percent for sales and 33.07 percent for service quarter.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.1145-1156
• /
• 2002

We propose a web document transcoding technique that translates existing web pages designed for desktop computers into an appropriate form for hand-held devices connected to the wireless internet. By defining a content block based on a visual separation and using it as a minimum unit for analyzing and converting processes, we can get web pages converted more exactly. We also apply the reallocation of the content block and the generation of new index in order to provide convenient interface without left-right scrolling in small screen devices. These methods, compared with existing ways such as text level summary or partial extraction method, can provide efficient navigation and a full recognition of web documents. To gain those transcoding benefits, we propose the Layout-Forming Tag Analysis Algorithm that analyzes structural tags, which motivate visual separation and the Component Grouping Algorithm that extracts the content block. We also classify and rearrange the content block and generate the new index to produce an appropriate form of web pages for small display devices. We have designed and implemented our transcoding system in a proxy server and evaluated the methods and the algorithms through an analysis of transcoded results. Our transcoding system showed a good result on most of popular web pages that have complicated structures.