• Journal of Yeungnam Medical Science
• /
• v.39 no.2
• /
• pp.98-107
• /
• 2022

Background: Stroke patients usually experience damage to multiple functions and a long rehabilitation period. Hence, there is a large volume of patient clinical information. It thus takes a long time for clinicians to identify the patient's information and essential pieces of information may be overlooked. To solve this, we stored the essential clinical information of stroke patients in a blockchain and implemented the blockchain technology using the Java programming language. Methods: We created a mini blockchain to store the medical information of patients using the Java programming language. Results: After generating a unique pair of public/private keys for identity verification, a patient's identity is verified by applying the Elliptic Curve Digital Signature Algorithm based on the generated keys. When the identity verification is complete, new medical data are stored in the transaction list and the generated transaction is verified. When verification is completed normally, the block hash value is derived using the transaction value and the hash value of the previous block. The hash value of the previous block is then stored in the generated block to interconnect the blocks. Conclusion: We demonstrated that blockchain can be used to store and deliver the patient information of stroke patients. It may be difficult to directly implement the code that we developed in the medical field, but it can serve as a starting point for the creation of a blockchain system to be used in the field.

• Genomics & Informatics
• /
• v.20 no.2
• /
• pp.17.1-17.11
• /
• 2022

Genetic associations have been quantified using a number of statistical measures. Entropy-based mutual information may be one of the more direct ways of estimating the association, in the sense that it does not depend on the parametrization. For this purpose, both the entropy and conditional entropy of the phenotype distribution should be obtained. Quantitative traits, however, do not usually allow an exact evaluation of entropy. The estimation of entropy needs a probability density function, which can be approximated by kernel density estimation. We have investigated the proper sequence of procedures for combining the kernel density estimation and entropy estimation with a probability density function in order to calculate mutual information. Genotypes and their interactions were constructed to set the conditions for conditional entropy. Extensive simulation data created using three types of generating functions were analyzed using two different kernels as well as two types of multifactor dimensionality reduction and another probability density approximation method called m-spacing. The statistical power in terms of correct detection rates was compared. Using kernels was found to be most useful when the trait distributions were more complex than simple normal or gamma distributions. A full-scale genomic dataset was explored to identify associations using the 2-h oral glucose tolerance test results and γ-glutamyl transpeptidase levels as phenotypes. Clearly distinguishable single-nucleotide polymorphisms (SNPs) and interacting SNP pairs associated with these phenotypes were found and listed with empirical p-values.

• The Korean Journal of Applied Statistics
• /
• v.35 no.6
• /
• pp.755-764
• /
• 2022

This paper is concerned with power transformations in estimating GARCH volatility. To handle a semi-parametric case for which the exact likelihood is not known, quasi-likelihood (QL) rather than maximum-likelihood method is investigated to best estimate GARCH via maximizing the information criteria. A power transformation is introduced in the innovation generating QL estimating functions and then optimum power is selected by maximizing the profile information. A combination of two different power transformations is also studied in order to increase the parameter estimation efficiency. Nine domestic stock prices data are analyzed to order to illustrate the main idea of the paper. The data span includes Covid-19 pandemic period in which financial time series are really volatile.

• Structural Engineering and Mechanics
• /
• v.86 no.1
• /
• pp.93-107
• /
• 2023

In this paper, a density based topology optimization is proposed for generating of supports required in additive manufacturing to maintain the overhanging regions of main structures during layer by layer fabrication process. For this purpose, isogeometric analysis method is employed to model geometry and structural analysis of main and support structures. In order to model the problem two cases are investigated. In the first case, design domain of supports can easily be separated from the main structure by using distinct isogeometric patches. The second case happens when the main structure itself is optimized by using topology optimization and the supports should be designed in the voids of optimum layout. In this case, in order to avoid boundary identification and re-meshing process for separating design domain of supports from main structure, a parameterization technique is proposed to identify the design domain of supports. To achieve this, two density functions are defined over the entire domain to describe the main structure and supporting areas. On the other hand, since supports are under gravity loads while main structure and its stiffness is not completed during manufacturing process, in the proposed method, stiffness of the main structure is considered to be trivial and the gravity loads are also naturally applied to design support structures. By doing so, the results show reasonable supports are created to protect, continuously, overhanging surfaces of the main structure. Several examples are presented to demonstrate the efficiency of the proposed method and compare the results with literature.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.18 no.2
• /
• pp.229-251
• /
• 2007

The change in information technology demands drastic change in digital library service. This study defines what a social semantic digital library should consist of and proposes a new architecture that incorporates core functions needed in designing a SSDL. The SSDL supports semantic information processing based on metadata and ontology and is an innovation system that allows SSDL users to participate in generating new knowledge by interacting with existing metadata and ontology structures. This study designed a SSDL model that consists of five horizontal and two vertical structures.

• International Journal of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.86-91
• /
• 2024

In the field of artistic creation, the iterative development of AI-generated video software has pushed the boundaries of multimedia content creation and provided powerful creative tools for non-professionals. This paper extensively examines two leading AI-generated video software, PIKA Labs and RUNWAY, discussing their functions, performance differences, and application scopes in the video generation domain. Through detailed operational examples, a comparative analysis of their functionalities, as well as the advantages and limitations of each in generating video content, is presented. By comparison, it can be found that PIKA Labs and RUNWAY have excellent performance in stability and creativity. Therefore, the purpose of this study is to comprehensively elucidate the operating mechanisms of these two AI software, in order to intuitively demonstrate the advantages of each software. Simultaneously, this study provides valuable references for professionals and creators in the video production field, assisting them in selecting the most suitable tools for different scenarios, thereby advancing the application and development of AI-generated video software in multimedia content creation.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.25 no.6
• /
• pp.497-504
• /
• 2012

Finite element analysis is to approximate a geometry model developed in computer-aided design(CAD) to a finite element model, thus the conventional shape design sensitivity analysis and optimization using the finite element method have some difficulties in the parameterization of geometry. However, isogeometric analysis is to build a geometry model and directly use the functions describing the geometry in analysis. Therefore, the geometric properties can be embedded in the NURBS basis functions and control points so that it has potential capability to overcome the aforementioned difficulties. In this study, the isogeometric structural analysis and shape design sensitivity analysis in the generalized curvilinear coordinate(GCC) systems are discussed for the curved geometry. Representing the higher order geometric information, such as normal, tangent and curvature, yields the isogeometric approach to be the best way for generating exact GCC systems from a given CAD geometry. The developed GCC isogeometric structural analysis and shape design sensitivity analysis are verified to show better accuracy and faster convergency by comparing with the results obtained from the conventional isogeometric method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.1
• /
• pp.39-47
• /
• 2005

The range of hardware implementation increases in communication systems as high-speed processing is required for high data rate. In the broadband wireless access (BWA) system based on IEEE standard 802.16 the functions of higher part in the MAC layer to Provide data needed for generating MAC PDU are implemented in software, and the tasks from formatting MAC PDUs by using those data to transmitting the messages in a modem are implemented in hardware. In this paper, the interface hardware for efficient message exchange between MAC and PHY layers in the BWA system is designed. The hardware performs the following functions including those of the transmission convergence(TC) sublayer; (1) formatting TC PDU(Protocol data unit) from/to MAC PDU, (2) Reed-solomon(RS) encoding/decoding, and (3) resolving DL MAP and UL MAP, so that it controls transmission slot and uplink and downlink traffic according to the modulation scheme of burst profile. Also, it provides various control signal for PHY modem. In addition, the truncated binary exponential backoff (TBEB) algorithm is implemented in a subscriber station to avoid collision on contention-based transmission of messages. The VLSI architecture performing all these functions is implemented and verified in VHDL.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.1
• /
• pp.32-40
• /
• 2008

Fuzzy rules are very useful and efficient to describe classification rules especially when the attribute values are continuous and fuzzy in nature. However, it is generally difficult to determine membership functions for generating efficient fuzzy classification rules. In this paper, we propose a method of automatic generation of efficient fuzzy classification rules using evolutionary algorithm. In our method we generate a set of initial membership functions for evolutionary algorithm by supervised clustering the training data set and we evolve the set of initial membership functions in order to generate fuzzy classification rules taking into consideration both classification accuracy and rule comprehensibility. To reduce time to evaluate an individual we also propose an evolutionary algorithm with data partition evaluation in which the training data set is partitioned into a number of subsets and individuals are evaluated using a randomly selected subset of data at a time instead of the whole training data set. We experimented our algorithm with the UCI learning data sets, the experiment results showed that our method was more efficient at average compared with the existing algorithms. For the evolutionary algorithm with data partition evaluation, we experimented with our method over the intrusion detection data of KDD'99 Cup, and confirmed that evaluation time was reduced by about 70%. Compared with the KDD'99 Cup winner, the accuracy was increased by 1.54% while the cost was reduced by 20.8%.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.549-556
• /
• 2006

In this paper, we propose a system for generating skeleton programs for directly transforming an XML document to another document, whose structure is defined in the target DTD with GUI environment. With the generated code, the users can easily update or insert their own codes into the program so that they can convert the document as the way that they want and can be connected with other classes or library files. Since most of the currently available code generation systems or methods for transforming XML documents use XSLT or XQuery, it is very difficult or impossible for users to manipulate the source code for further updates or refinements. As the generated code in this paper reveals the code along the XPaths of the target DTD, the result code is quite readable. The code generating procedure is simple; once the user maps the related elements represented as trees in the GUI interface, the source document is transformed into the target document and its corresponding Java source program is generated, where DTD is given or extracted from XML documents automatically by parsing it. The mapping is classified 1:1, 1:N, and N:1, according to the structure and semantics of elements of the DTD. The functions for changing the structure of elements designated by the user are amalgamated into the metadata interface. A real world example of transforming articles written in XML file into a bibliographical XML document is shown with the transformed result and its code.