• The Journal of Korean Academic Society of Nursing Education
• /
• v.9 no.1
• /
• pp.115-125
• /
• 2003

This study was conducted to investigate whether a computer information offered in advance of the test would decrease anxiety degree in coronary angiogram subjects. The study design was a nonequivalent control group, none-synchronized design. The subjects of study were 53 patients who were admitted at C hospital in K city for coronary angiogram. The 53 subjects were assigned to experimental(25) and control(28) groups. The computer information set up by researcher was used as the experimental treatment and 10 minutes long. Spielberger's state anxiety scale translated by Kim and Shin(1978) and sphygmomanometer were used for data collection. The data were collected from July 1, 2000 to March 31, 2001, and analyzed by chi-square, paried t-test, t-test, ANCOVA, and Pearson's Correlation Coefficients using SPSS/PC+. The results of this study were summarized as follows : 1. The first hypothesis that 'post-test state anxiety score will be lower than pre-test state anxiety score in experimental group' was supported(t=2.40, p=.020). 2. The second hypothesis that 'post-test systole will be lower than pre-test systole in experimental group' was not supported(t=-.30, p=.765). 3. The third hypothesis that 'post-test Diastole will be lower than pre-test diastole in experimental group' was not supported'(t=-1.42, p=.161). 4. The fifth hypothesis that 'the experimental group who is given the computer information will be lower in state anxiety score than the control group who is not given the computer information' was supported(F=9.17, p=.004). 5. The sixth hypothesis that 'the experimental group who is given the computer information will be lower in systole than the control group who is not given the computer information' was supported (F=7.16, p=.010). 6. The seventh hypothesis that 'the experimental group who is given the computer information will be lower in diastole than the control group who is not given the computer information' was not supported'(F=.55, p=.462). 7. The eleventh hypothesis that 'the lower the post-test state anxiety, the lower the uneasiness score during the test' was not supported(r=-.013, p=.926). 8. The eighth hypothesis that 'the lower the post-test state anxiety, the lower the nervousness score during the test' was supported(r=.326, p=.017).

• Journal of information and communication convergence engineering
• /
• v.17 no.4
• /
• pp.246-254
• /
• 2019

This paper proposes a solution to the problem of finding a subgraph for a given instance of many terminals on a Euclidean plane. The subgraph is a tree, whose nodes represent the chosen terminals from the problem instance, and whose edges are line segments that connect two corresponding terminals. The tree is required to have the maximum number of nodes while the length is limited and is not sufficient to interconnect all the given terminals. The problem is shown to be NP-hard, and therefore a genetic algorithm is designed as an efficient practical approach. The method is suitable to various probable applications in layout optimization in areas such as communication network construction, industrial construction, and a variety of machine and electronics design problems. The proposed heuristic can be used as a general-purpose practical solver to reduce industrial costs by determining feasible interconnections among many types of components over different types of physical planes.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.3
• /
• pp.861-869
• /
• 2006

Burn-in is a widely used method to improve the quality of products or systems after they have been produced. In this paper, the problem of determining optimal burn-in time for a system which performs given mission is considered. It is assumed that the given mission time is not a fixed constant but a random variable which follows an exponential distribution. Assuming that the underlying lifetime distribution of a system has an eventually increasing failure rate function, an upper bound for the optimal burn-in time which maximizes the probability of performing given mission is derived. The obtained result is also applied to an illustrative example.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.12
• /
• pp.3855-3867
• /
• 2022

Name separation (splitting full names into surnames and given names) is not a tedious task in a multiethnic country because the procedure for splitting surnames and given names is ethnicity-specific. Malaysia has multiple main ethnic groups; therefore, separating Malaysian full names into surnames and given names proves a challenge. In this study, we develop a two-phase framework for Malaysian name separation using deep learning. In the initial phase, we predict the ethnicity of full names. We propose a recurrent neural network with long short-term memory network-based model with character embeddings for prediction. Based on the predicted ethnicity, we use a rule-based algorithm for splitting full names into surnames and given names in the second phase. We evaluate the performance of the proposed model against various machine learning models and demonstrate that it outperforms them by an average of 9%. Moreover, transfer learning and fine-tuning of the proposed model with an additional dataset results in an improvement of up to 7% on average.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.245-253
• /
• 2007

In this paper, the existence of bounded positive solution of the second-order nonlinear neutral differential equations are studied. Some new sufficient conditions are given. Furthermore, examples given show that the results here are almost sharp.

• Journal of Korean Society for Quality Management
• /
• v.36 no.3
• /
• pp.13-21
• /
• 2008

The orthogonality is an important property in the experimental designs. When we use nearly orthogonal arrays(for example, supersaturated designs), we need evaluate the degree of the orthogonality of given nearly orthogonal arrays. We can use the mutual information as a new criterion for evaluating and testing the degree of the orthogonality of given nearly orthogonal arrays.

• Journal of the Korean Society for Library and Information Science
• /
• v.27
• /
• pp.215-228
• /
• 1994

This study is to analyze the background and circumstances of the bibliographical description method appearing in the Hong-ssi Tok-so-rok, or an annotated classified bibliography of Korean and Chinese books edited for the Hongs and their clan. The conclusions are as follows. Each entries of the bibliography are entered under titles, and generally followed by bibliographic elements of volumes, written age, author's name, functional word of authorship, and annotation. The written age is stated by the dynasty name for the first authors within each classes. However some anonymous works and government compiled works are recorded the king's shrine name or the reign title. Entries of the bibliography are arranged by the chronological order in each classes. The writer's name is generally described by 'surname + given name'. However it is sometimes also recorded in the one of the following forms; Appellation (hao, 호) or posthumous title + surname + given name. Sumame + appellation or posthumous title + given name. Appellation ( (hao, 호) or posthumous title + sumame + Sonsaeng (선행) + given name. Sumame + government position title + given name. Appellation (hao, 호) + surname + cha(자, master). surname + ssi(씨). ect. Married women's names are stated by her husband's surname followed by the Chinese character 부 or 절부 which signifies wife or virtuous women, and then her given name. The works written or compiled by King's order (명찬서) are generally described in the form of 명제신+ functional word of authorship. Names of government agencies are occasionally stated as the authors' for the government publications or government compiled works. The functional words of authorship are described in the phrase of 소작야, 소편야 instead of 저, 찬, ect. It is more noticeable that in the case of the collections of individual writers' works the wording of 지문야, 지시야 is written after the name of the author. More complicated descriptive forms are seen in the entries of works for the shared authorship and mixed responsibility. Two or more than two monographic works of the same author classed in the same class are annotated all together.

• International Journal of Internet, Broadcasting and Communication
• /
• v.10 no.3
• /
• pp.11-25
• /
• 2018

While being believed that decrypting any RSA ciphertext is as hard as factorizing the RSA modulus, it was also shown that, if additional information is available, breaking the RSA cryptosystem may be much easier than factoring. For example, Coppersmith showed that, given the 1/2 fraction of the least or the most significant bits of one of two RSA primes, one can factorize the RSA modulus very efficiently, using the lattice-based technique. More recently, introducing the so called cold boot attack, Halderman et al. showed that one can recover cryptographic keys from a decayed DRAM image. And, following up this result, Heninger and Shacham presented a polynomial-time attack which, given 0.27-fraction of the RSA private key of the form (p, q, d, $d_p$, $d_q$), can recover the whole key, provided that the given bits are uniformly distributed. And, based on the work of Heninger and Shacham, this paper presents a different approach for recovering RSA private key bits from decayed key information, under the assumption that some random portion of the private key bits is known. More precisely, we present the algorithm of recovering RSA private key bits from erased key material and elaborate the formula of describing the number of partially-recovered RSA private key candidates in terms of the given erasure rate. Then, the result is justified by some extensive experiments.

• Korean Management Science Review
• /
• v.15 no.1
• /
• pp.13-31
• /
• 1998

In this paper, we examine the relationship between information type and new product development process. Information that was provided for new product development can be divided into two categories. One was relative information that could be used as a basis for comparison such as patent data. The other was absolute information that must be fulfilled in the new product such as key customers requirements. An experiment was conducted with staffs in an R＆D department in order to analyze the impact of the different information types on the development process of new product. It was found that the group with the absolute information recognized the given information repeatedly, which in turn results in a highly technical idea with good teamwork. The group with the relative information created a superior product with better application, appearance and product efficiency through the frequent refinements of given ideas. This paper concludes with the implications of the results to the new product development process and supporting information systems.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1073-1086
• /
• 2009

This paper considers the problems of martingale measures and risk-minimizing hedging strategies in the market with restricted information. By constructing a general restricted information market model, the explicit relation of arbitrage and the minimal martingale measure between two different information markets are discussed. Also a link among all equivalent martingale measures under restricted information market is given. As an example of restricted information markets, this paper constitutes a jump-diffusion process model and presents a risk minimizing problem under different information. Through $It\hat{o}$ formula and projection results in Schweizer[13], the explicit optimal strategy for different market information are given.