• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.384-394
• /
• 2001

In this paper, we propose AST-AET(Average valid Start Time-Average valid End Time) data migration strategy based on the storage structure where temporal data is divided into a past segment, a current segment, and a future segment. We define AST and AET which are used in AST-AET data migration strategy and also define entity versions to be stored in each segment. We describe methods to compute AST and AET, and processes to search entity versions for migration and move them. We compare average response times for user queries between AST-AET data migration strategy and the existing LST-GET(Least valid Start Time-Greatest valid End Time) data migration strategy. The experimental results show that, when there are no LLTs(Long Lived Tuples), there is little difference in performance between the two migration strategies because the size of a current segment is nearly equal. However, when there are LLTs, the average response time of AST-AET data migration strategy is smaller than that of LST-GET data migration strategy because the size of a current segment of LST-GET data migration strategy becomes larger. In addition, when we change average interarrival times of temporal queries, generally the average response time of AST-AET data migration strategy is smaller than that of LST-GET data migration strategy.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.134-142
• /
• 2003

We present an ATM switch architectures based on the multistage interconnection network(MIN) for the efficient multicast traffic control. Many of these applications require multicast connections as well as point-to-point connections. Muiticast connection in which the same message is delivered from a source to arbitrary number of destinations is fundamental in the areas such as teleconferencing, VOD(video on demand), distributed data processing, etc. In designing the multicast ATM switches to support those services, we should consider the fairness(impartiality) and priority control, in addition to the overflow problem, cell processing with large number of copies, and the blocking problem. In particular, the fairness problem which is to distribute the incoming cells to input ports smoothly is occurred when a cell with the large copy number enters upper input port. In this case, the upper input port sends before the lower input port because of the calculating method of running sum, and therefore cell arrived into lower input port Is delayed to next cycle to be sent and transmission delay time becomes longer. In this paper, we propose the cell splitting and group splitting algorithm, and also the fairness scheme on the basis of the nonblocking characteristics for issuing appropriate copy number depending on the number of Input cell in demand. We evaluate the performance of the proposed schemes in terms of the throughput, cell loss rate and cell delay.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.407-415
• /
• 2003

As services requesting data transfer from a sender to a multiple number of receivers become popular, efficient group communication mechanisms like multicast get much attention. Since multicast is more efficient than unicast in terms of bandwidth usage and group management for group communication, many multicast protocols providing scalability and reliability have been proposed. Recently, router-supported reliable multicast protocols have been proposed because routers have the knowledge of the physical multicast tree structure and, in this scheme, repliers which retransmit lost packets are selected by routers. Repliers are selected dynamically based on the network situation, therefore, any receiver within a multicast group can become a replier Hence, all receivers within a group maintains a buffer for loss recovery within which received packets are stored. It is an overhead for all group receivers to store unnecessary packets. Therefore, in this paper, we propose a new scheme which reduces resource usage by discarding packets unnecessary for loss recovery from the receiver buffer. Our scheme performs the replier selection and the loss recovery of lost packets based on the LSM [1] model, and discards unnecessary packets determined by ACKs from erasers which represent local groups.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.461-473
• /
• 2003

Multimedia applications are much more sensitive to QoS(Quality of Service) than text based ones due to their data continuity. In order to provide a fast moving MH(Mobil Host) using multimedia application with a consistent QoS,an efficient call admission mechanism is in need. This paper proposes the 2SCA(2-Step Call Admission) scheme based on cal admission scheme using pripority to guarantee the consistent QoS for mobile multimedia applications. A calls of MH are classified new calls, hand-off calls, and QoS upgrading calls. The 2SCA is composed of the basic call admission and advanced call admission; the former determines the call admission based on bandwidth available in each cell and the latter determines the call admission by applying DTT(Delay Tolerance Time), PQeueu(Priority Queue), and UpQueue(Upgrade Queue) algorithm according to the type of each call blocked at the basic call admission stage. In order to evaluate the performance of our mechanism, we measure the metrics such as the dropping probability of new calls, dropping probability of hand-off calls, and bandwidth utilization. The result shows that the performance of our mechanism is superior to that of existing mechanisms such as CSP(Complete Sharing Policy), GCP(Guard Channel Policy) and AGCP(Adaptive Guard Channel Policy).

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.6
• /
• pp.503-513
• /
• 2005

With the recognition of the importance of computational approach for protein-protein interaction prediction, many techniques have been developed to computationally predict protein-protein interactions. However, few techniques are actually implemented and announced in service form for general users to readily access and use the techniques. In this paper, we design and implement a protein interaction prediction service system based on the domain combination based protein-protein interaction prediction technique, which is known to show superior accuracy to other conventional computational protein-protein interaction prediction methods. In the prediction accuracy test of the method, high sensitivity($77\%$) and specificity($95\%$) are achieved for test protein pairs containing common domains with teaming sets of proteins in a Yeast. The stability of the method is also manifested through the testing over DIP CORE, HMS-PCI, and TAP data. Performance, openness and flexibility are the major design goals and they are achieved by adopting parallel execution techniques, web Services standards, and layered architecture respectively. In this paper, several representative user interfaces of the system are also introduced with comprehensive usage guides.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.10
• /
• pp.129-137
• /
• 2019

In this paper, we propose the purpose of this study is to examine whether the library's creation shared value activities in China and Korea affect brand quality, social status, and the influence of each variable according to the Chinese and Korean groups. To achieve the purpose of this study, the survey was conducted using questionnaires to users who have used the Big Data Sharing Service in Korean and Chinese libraries. A total of 500 questionnaires were distributed to participants in the study, and 460 of the recovered questionnaire were used in the final analysis, which eliminated unfaithful responses. The data collected through the survey were analyzed as frequency analysis, reliability analysis, confirmed factor analysis, and structured model using statistical programs SPSS22 and AMOS22. The results of the research identified through the empirical analysis of this study are as follows. First, the CSV activities of the library's big data have a significant influence on the brand quality and social status. Second, brand quality and social resistance has a significant positive effect on continuous use intention. Third, the influence of the CSV activities in Korean and Chinese libraries has been found to be partly different. Through the conclusion and discussion section, the theoretical implications of this study, practical implications and in-depth discussions on the limitations of the study and its future direction were presented.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.13 no.1
• /
• pp.47-57
• /
• 2003

In this paper, we firstly evaluate the resistance of the reduced 5-round version of the block cipher CIKS-1 against linear cryptanalysis(LC) and show that we can attack full-round CIKS-1 with \ulcorner56-bit key through the canonical extension of our attack. A feature of the CIKS-1 is the use of both Data-Dependent permutations(DDP) and internal key scheduling which consist in data dependent transformation of the round subkeys. Taking into accout the structure of CIKS-1 we investigate linear approximation. That is, we consider 16 linear approximations with p=3/4 for 16 parallel modulo $2^2$ additions to construct one-round linear approximation and derive one-round linear approximation with the probability P=1/2+$2^{-17}$ by Piling-up lemma. Then we present 3-round linear approximation with 1/2+$2^{-17}$ using this one-round approximation and attack the reduced 5-round CIKS-1 with 64-bit block by LC. In conclusion we present that our attack requires $2^{38}$chosen plaintexts with a probability of success of 99.9% and about $2^{67-7}$encryption times to recover the last round key.(But, for the full-round CIKS-1, our attack requires about $2^{166}$encryption times)

• Journal of the Korean Chemical Society
• /
• v.40 no.1
• /
• pp.28-36
• /
• 1996

The pentanuclear complexes have been obtained by the reactions of molybdenum(VI) and tungsten(VI) polynuclear complexes with molybdenum(O) and tungsten(O) dinitrosyl mononuclear complexes, and methylthioamidoxime. The prepared complexes (n-Bu4N)2[Mo4O12Mo(NO)2{CH3SCH2C(NH2)NHO}2{CH3SCH2C(NH)NO}2](1), (n-Bu4N)2[W4O12Mo(NO)2{CH3SCH2C(NH2)NHO}2{CH3SCH2C(NH)NO}2](2), (n-Bu4N)2[Mo4O12W (NO)2{CH3SCH2C(NH2)NHO}2{CH3SCH2C(NH)NO}2] (3) have been characterized by elemental analysis, infrared, UV-visible and 1H NMR spectra. The complexes are elucidated the cis-{M(NO)2}2+(M = Mo, W) unit and a slight delocalization by spectroscopy. The structure of (n-Bu4N)2[W4O12Mo(NO) 2{CH3SCH2C(NH2)NHO}2{CH3SCH2C(NH)NO}2] was determined by X-ray single crystal diffraction. Crystal data are follows: Monoclinic, $P21}a$, a = 22.14(2) $\AA$, b = 14.93(1) $\AA$, c = 23.20(1) $\AA$, $\beta$ = 111.08(6) $\AA$, V = 7155(9) $\AA$, Z = 4, final R = 0.072 for 6191(I > $3\sigma(I)).$ The structure of complex forms two dinuclear [W2O5{CH3SCH2C(NH2)NHO}{CH3SCH2C(NH)NO}] and a central {Mo(NO)2} 2+ core. The geometric structure of the {Mo(NO)2} 2+unit is the formally cistype and C2v symmetry.

• Journal of KIISE:Databases
• /
• v.32 no.4
• /
• pp.345-361
• /
• 2005

A transform-space index indexes objects represented as points in the transform space An advantage of a transform-space index is that optimization of join algorithms using these indexes becomes relatively simple. However, the disadvantage is that these algorithms cannot be applied to original-space indexes such as the R-tree. As a way of overcoming this disadvantages, the authors earlier proposed the transform-space view join algorithm that joins two original- space indexes in the transform space through the notion of the transform-space view. A transform-space view is a virtual transform-space index that allows us to perform join in the transform space using original-space indexes. In a transform-space view join algorithm, the order of accessing disk pages -for which various space filling curves could be used -makes a significant impact on the performance of joins. In this paper, we Propose a new space filling curve called the adaptive row major order (ARM order). The ARM order adaptively controls the order of accessing pages and significantly reduces the one-pass buffer size (the minimum buffer size required for guaranteeing one disk access per page) and the number of disk accesses for a given buffer size. Through analysis and experiments, we verify the excellence of the ARM order when used with the transform-space view join. The transform-space view join with the ARM order always outperforms existing ones in terms of both measures used: the one-pass buffer size and the number of disk accesses for a given buffer size. Compared to other conventional space filling curves used with the transform-space view join, it reduces the one-pass buffer size by up to 21.3 times and the number of disk accesses by up to $74.6\%$. In addition, compared to existing spatial join algorithms that use R-trees in the original space, it reduces the one-pass buffer size by up to 15.7 times and the number of disk accesses by up to $65.3\%$.

• Journal of the Korean Academy of Child and Adolescent Psychiatry
• /
• v.11 no.1
• /
• pp.70-78
• /
• 2000

This study was to develop Korean version of Parenting Stress Scale. Primary research was processed thru Abidin's PSI(Parenting Stress Index) scale. For the pilot primary study, distri-buted questionnaire to the mothers who have three to twelve age children and tried factor analysis with 382 data sheets. At the result, 29 items and 5 factors among the 47 items of child domain, 28 items and 5 factors among the items of parent domain were extracted. At the secondary pilot study survey, reanalyzed the 57 items extracted by primary pilot survey with the 392 data collected from three to six age children's parents. For the item discrimination analysis, calculated item-total correlation and deleted the items under r=.20. For the validity test, reviewed content validity and construct validity. For the verification of construct validity, tried factor analysis. At the result, in child domain area, the four factors, 'Reinforces Parent's, 'Accep-tability', 'Attention Distractiveness', 'Demandingness' and 24 items were extracted. Among the common variance of child domain, 'explained common variance' was 82.05%. In parent domain area, the five factors, 'Restriction of Role', 'Depression', 'Social Isolation', 'Parent Health', 'Spouse Relationship' and 24 items were extracted. Among the common variance of parent domain, 'explained common dominator' was 82.40%. For the verification of reliability, Cronbach's ${\alpha}$ coefficient was calculated and in child domain, .69, .70, .67, .66 were produced by each item, respectively and total reliability coefficient was ${\alpha}$=.81. Reliability coefficient of parent domain was .73, .70, .70, .55, .73 by each item, respectively and total reliability coefficient was ${\alpha}$=.83. This study was processed as a primary research to develop the Korean version of parent stress scale which is originally from U.S.A. version of PSI and apply it to proper Korean culture. Therefore, the necessity of continuous study was discussed with more localized items and factors.