• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.684-698
• /
• 2004

The Hippocratic database model recently proposed by Agrawal et al. incorporates privacy protection capabilities into relational databases. Since the Hippocratic database is based on the relational database, it needs extensions to be adapted for XML databases. In this paper, we propose the Hippocratic XML database model, an extension of the Hippocratic database model for XML databases and present an efficient access control mechanism under this model. In contrast to relational data, XML data have tree-like hierarchies. Thus, in order to manage these hierarchies of XML data, we extend and formally define such concepts presented in the Hippocratic database model as privacy preferences, privacy policies, privacy authorizations, and usage purposes of data records. Next, we present a new mechanism, which we call the authorization index, that is used in the access control mechanism. This authorization index, which is Implemented using a multi-dimensional index, allows us to efficiently search authorizations implied by the authorization granted on the nearest ancestor using the nearest neighbor search technique. Using synthetic and real data, we have performed extensive experiments comparing query processing time with those of existing access control mechanisms. The results show that the proposed access control mechanism improves the wall clock time by up to 13.6 times over the top-down access control strategy and by up to 20.3 times over the bottom-up access control strategy The major contributions of our paper are 1) extending the Hippocratic database model into the Hippocratic XML database model and 2) proposing an efficient across control mechanism that uses the authorization index and nearest neighbor search technique under this model.

• Korean Journal of Biological Psychiatry
• /
• v.6 no.1
• /
• pp.67-73
• /
• 1999

The cAMP-dependent protein kinase(PKA) is an intracellular enzyme with serine-threonine kinase activity that plays a key role in cell growth, differentiation, and apoptosis in eukaryotes. In order to understand the PKA signal transduction pathway regulating cell life cycle and identify its role, we focused on the characterization of up-/down-regulated genes by PKA using the differential display polymerase chain reaction. Seven differentially expressed sequence tags(DEST) have been obtained. Among these DESTs, 2 DESTs were homologous to the sequence of genes from BLAST search result. KC1-5 DEST that was up-regulated in A123.7 cells was highly corresponded to mouse apoptosis-related gene(MA-3) or mouse mRNA for topoisomerase inhibitor suppressed(TIS). MA-3 was induced in various types of apoptosis, specially in NGF-deprived apoptotic PC12 cells. TIS was down-regulated in the RVC lymphoma cells incubated with topoisomerase inhibitor that induces DNA strand breakages. PG1-1 DEST that was highly expressed in PC12 cells was corresponded to transposon Tn10 3'-end. Tnansposon Tn10 was up-regulated in differentiated myeloblastic ML-1 cells by 12-O-tetradecanoylphorbol-13-acetate. This study illuminates that MA-3/TIS was down-regulated by PKA activity, and transposon Tn10 was up-regulated by it.

• Journal of Korean Institute of Industrial Engineers
• /
• v.42 no.6
• /
• pp.377-385
• /
• 2016

The previous Adaptive Control of Thought-Rational (ACT-R) cognitive architecture model has a limitation in that it cannot accurately predict human visual search strategy, because time effect, one of important human cognitive features, is not considered. Thus, the present study proposes ACT-R cognitive modeling that contains the impact of time using a revised utility system in the ACT-R model. Then, the validation of the model is performed by comparing results of the model with eye-tracking experimental data and SEEV-T (SEEV-Time; SEEV model which considers time effect) model in "Where's Wally" game. The results demonstrate that the model data fit fairly well with the eye-tracking data ($R^2=0.91$) and SEEV-T model ($R^2=0.93$). Therefore, the modeling method which considers time effect using a revised utility system should be used in predicting the human visual search paradigm when the available time is limited.

• Journal of the Ergonomics Society of Korea
• /
• v.31 no.6
• /
• pp.705-713
• /
• 2012

Objective: The aim of this study is to predict human visual target search using ACT-R cognitive architecture in real scene images. Background: Human uses both the method of bottom-up and top-down process at the same time using characteristics of image itself and knowledge about images. Modeling of human visual search also needs to include both processes. Method: In this study, visual target object search performance in real scene images was analyzed comparing experimental data and result of ACT-R model. 10 students participated in this experiment and the model was simulated ten times. This experiment was conducted in two conditions, indoor images and outdoor images. The ACT-R model considering the first saccade region through calculating the saliency map and spatial layout was established. Proposed model in this study used the guide of visual search and adopted visual search strategies according to the guide. Results: In the analysis results, no significant difference on performance time between model prediction and empirical data was found. Conclusion: The proposed ACT-R model is able to predict the human visual search process in real scene images using salience map and spatial layout. Application: This study is useful in conducting model-based evaluation in visual search, particularly in real images. Also, this study is able to adopt in diverse image processing program such as helper of the visually impaired.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.5
• /
• pp.172-179
• /
• 1996

In the paper, QCELP (qualcomm code excited linear predictive), CDMA (code division multiple access)'s vocoder algorithm, was analyzed. And then, a ptich parameter seaarch architecture for 16-bit programmable DSP(digital signal processor) for QCELP was designed. Because we speed up the parameter search through high speed DSP using two MACs, we can satisfy speech codec specifiction for the digital celluar. Also, we implemented in FIFO(first-in first-out) memory using register file to increase the access time of data. This DSP was designed using COMPASS, ASIC design tool, by top-down design methodology. Therefore, it is possible to cope with rapid change at mobile communication market.

• Journal of the Ergonomics Society of Korea
• /
• v.31 no.4
• /
• pp.515-523
• /
• 2012

Objective: The aim of this study is to investigate users' intuitive stereotypes on non-touch gestures and establish the gesture dictionary that can be applied to gesture-based interaction designs. Background: Recently, the interaction based on non-touch gestures is emerging as an alternative for natural interactions between human and systems. However, in order for non-touch gestures to become a universe interaction method, the studies on what kinds of gestures are intuitive and effective should be prerequisite. Method: In this study, as applicable domains of non-touch gestures, four devices(i.e. TV, Audio, Computer, Car Navigation) and sixteen basic operations(i.e. power on/off, previous/next page, volume up/down, list up/down, zoom in/out, play, cancel, delete, search, mute, save) were drawn from both focus group interview and survey. Then, a user participatory design was performed. The participants were requested to design three gestures suitable to each operation in the devices, and they evaluated intuitiveness, memorability, convenience, and satisfaction of their derived gestures. Through the participatory design, agreement scores, frequencies and planning times of each distinguished gesture were measured. Results: The derived gestures were not different in terms of four devices. However, diverse but common gestures were derived in terms of kinds of operations. In special, manipulative gestures were suitable for all kinds of operations. On the contrary, semantic or descriptive gestures were proper to one-shot operations like power on/off, play, cancel or search. Conclusion: The touchless gesture dictionary was established by mapping intuitive and valuable gestures onto each operation. Application: The dictionary can be applied to interaction designs based on non-touch gestures. Moreover, it will be used as a basic reference for standardizing non-touch gestures.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.4
• /
• pp.53-63
• /
• 2013

Together with soaring interest on Big Data, now there are vigorous reports that unearth various social values lying underneath those data from a number of application areas. Among those reports many are using such data as Internet search histories from Google site, social relationships from Facebook, and transactional or locational traces collected from various ubiquitous devices. Many of those researches, however, are conducted based on the data sets that are accumulated over the North American and European areas, which means that direct interpretation and application of social values exhibited by those researches to the other areas like Korea can be a disturbing task. This research has started from a validation study against Korean environment of the former paper which says an investment strategy that exploits up and down of Google search volume on a carefully selected set of terms shows high market performance. A huge difference between North American and Korean environment can be eye witnessed via the distinction in profit rates that are exhibited by the corresponding set of search terms. Two sets of search terms actually presented low correlation in their profit rates over two financial markets. Even in an experiment which compares the profit rates with two different investment periods with the same set of search terms showed no such meaningful result that outperforms the market average. With all these results, we cautiously conclude that establishing an investment strategy that exploits Internet search volume over a specified word set needs more conscious approach.

• Journal of KIISE:Software and Applications
• /
• v.29 no.9
• /
• pp.645-653
• /
• 2002

The unit commitment problem in a power system involves determining the start-up and shut-down schedules of many dynamos for a day or a week while satisfying the power demands and diverse constraints of the individual units in the system. It is very difficult to derive an economically optimal schedule due to its huge search space when the number of dynamos involved is large. Tabu search is a popular solution method used for various optimization problems because it is equipped with effective means of searching beyond local optima and also it can naturally incorporate and exploit domain knowledge specific to the target problem. When given a large-scaled problem with a number of complicated constraints, however, tabu search cannot easily find a good solution within a reasonable time. This paper shows that a large- scaled optimization problem such as the unit commitment problem can be solved efficiently by using a parallel tabu search. The parallel tabu search not only reduces the search time significantly but also finds a solution of better quality.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.606-619
• /
• 2001

This paper presents an efficient algorithm to compute difference between old and new versions of an SGML/XML document. The difference between the two versions can be considered to be an edit script that transforms some document tree into another The proposed algorithm is based on hybridization of bottom-up and top-down methods: matching relationships between nodes in the two versions are producted in a bottom-up manner and top-down breadth -first search computes an edit script. Because the algorithm does not need to investigate possible existence of matchings for all nodes, faster matching can be achieved . Furthermore, it can detect more structurally meaningful changes such as subtree move and copy as well as simple changes to the node itself like insert, delete, and update.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.6
• /
• pp.1057-1064
• /
• 2009

This paper introduces a new approach based on a quantum-inspired evolutionary algorithm (QEA) to solve unit commitment (UC) problems. The UC problem is a complicated nonlinear and mixed-integer combinatorial optimization problem with heavy constraints. This paper proposes a bounded quantum evolutionary algorithm (BQEA) to effectively solve the UC problems. The proposed BQEA adopts both the bounded rotation gate, which is simplified and improved to prevent premature convergence and increase the global search ability, and the increasing rotation angle approach to improve the search performance of the conventional QEA. Furthermore, it includes heuristic-based constraint treatment techniques to deal with the minimum up/down time and spinning reserve constraints in the UC problems. Since the excessive spinning reserve can incur high operation costs, the unit de-commitment strategy is also introduced to improve the solution quality. To demonstrate the performance of the proposed BQEA, it is applied to the large-scale power systems of up to 100-unit with 24-hour demand.