• Korean Journal of Cognitive Science
• /
• v.27 no.4
• /
• pp.599-618
• /
• 2016

The relationship between dependent personality traits and depression has been widely studied in the field of psychology. However, the existing evidence is mixed and often contradictory, obscuring the precise nature of this relationship. Given that the most common method of measuring the construct of dependency has been to administer self-report instruments, it is possible that implicit dependency, another parameter of dependency that is distinct from explicit dependency measured via self-report, is confounding these results. The current study aimed to clarify the relationship between dependency and depression by comparing the effect of implicit and explicit dependency. Implicit dependency was measured via the Single Category-Implicit Association Test (SC-IAT), a test of implicit personality that has shown to have good validity and reliability in previous studies. In addition, we examined the effect of gender on this relationship, given the potential role of gender stereotype that may make male participants show lower levels of dependency when measured through self-report (vs. SC-IAT). Results showed that implicit and explicit dependency indeed had separate and distinct relationships, and the relationships depends on participants' gender. Among female participants, increased explicit dependency predicted depression only when implicit dependency was also elevated. In contrast, explicit dependency predicted depression regardless of the level of implicit dependency in male participants. These findings suggest that implicit and explicit dependency may be separate parameters capturing different aspects of dependent personality traits, further supporting the need to consider the implicit aspect of personality in personality assessment research. Implications and limitations of the current findings and directions for future research are discussed.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.197-208
• /
• 2003

Abstract Workflow is not appropriately applied to coordinated execution of applications(steps) that comprise business process such as a collaborative series of tasks because of the lacks of network infra, standard of information exchange and data consistency management with conflict mode of shared data. Particularly we have not mentioned the problem which can be occurred by shared data with conflict mode. In this paper, to handle data consistency in the process of rollback for failure handling or recovery policy, we have classified rollback dependency into three types such as implicit rollback dependency in a transactional workflow, implicit rollback dependency in collaborative transactional workflows and explicit rollback dependency in collaborative transactional workflows. Also, we have proposed the rollback dependency compiler that determines above three types of rollback dependency. A workflow designer specifies the workflow schema and the resources accessed by the steps from a global database of resources. The rollback dependency compiler generates the enhanced workflow schema with the rollback dependency specification. The run-time system interprets this specification and executes the rollback policy with data consistency if failure of steps is occurred. After all, this paper can offer better correctness and performance than state-of-the-art WFMSs.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.11
• /
• pp.27-40
• /
• 2020

In this paper, we investigate the correlation between the amount of English sentences that Korean English learners (L2ers) are exposed to and their sentence processing patterns by examining what Long Short-Term Memory (LSTM) language models (LMs) can learn about implicit syntactic relationship: that is, the filler-gap dependency. The filler-gap dependency refers to a relationship between a (wh-)filler, which is a wh-phrase like 'what' or 'who' overtly in clause-peripheral position, and its gap in clause-internal position, which is an invisible, empty syntactic position to be filled by the (wh-)filler for proper interpretation. Here to implement L2ers' English learning, we build LSTM LMs that in turn learn a subset of the known restrictions on the filler-gap dependency from English sentences in the L2 corpus that L2ers can potentially encounter in their English learning. Examining LSTM LMs' behaviors on controlled sentences designed with the filler-gap dependency, we show the characteristics of L2ers' sentence processing using the information-theoretic metric of surprisal that quantifies violations of the filler-gap dependency or wh-licensing interaction effects. Furthermore, comparing L2ers' LMs with native speakers' LM in light of processing the filler-gap dependency, we not only note that in their sentence processing both L2ers' LM and native speakers' LM can track abstract syntactic structures involved in the filler-gap dependency, but also show using linear mixed-effects regression models that there exist significant differences between them in processing such a dependency.

• The KIPS Transactions:PartA
• /
• v.9A no.1
• /
• pp.37-44
• /
• 2002

Most researches of transforming sequential programs into parallel programs have been based on the loop structure transformation method. However, most programs have implicit interprocedure parallelism. This paper suggests a way of extracting parallelism from the loops with procedure calls using the data dependency elimination method. Most parallelization of the loop with procedure calls have been conducted for extracting parallelism from the uniform code. In this paper, we propose interprocedural transformation, which can be apply to both uniform and nonuniform code. We show the examples of uniform, nonuniform, and complex code parallelization. We then evaluated the performance of the various transformation methods using the CRAY-T3E system. The comparison results show that the proposed algorithm out-performs other conventional methods.

• The Journal of Information Technology
• /
• v.9 no.3
• /
• pp.27-32
• /
• 2006

If is interested and create rule between it in item that association rules buys, by negative association rules is interested to item that do not buy, it is attempt to do data Maining more effectively. It is difficult that existent methods to find negative association rules find one part of rule, or negative association rules because use more complicated algorithm than algorithm that find association rules. Therefore, this paper presents method to create negative association rules by simpler process using Boolean Analyzer that use dependency between items. And as Boolean Analyzer through an experiment, show that can find negative association rules and more various rule through comparison with other algorithm.

• Journal of computational fluids engineering
• /
• v.7 no.4
• /
• pp.1-7
• /
• 2002

The phase-change transformation processes are relevant in many engineering applications. In particular, this phenomenon plays an important role in the extraction and fabrication operations in the metallurgical industry. The control of the heat transfer and fluid flow patterns is important to achieve casting quality and competitive production times. In the present study, a simple finite-element algorithm is developed for solid-liquid phase change problems. Natural convection in the liquid phase due to the temperature dependency of water density is considered by a numerical model. The predictions are compared with measurements by the particle image velocimetry(PIV). to show that the calculation results are in good agreement with the experiment results.

• Journal of Information Management
• /
• v.36 no.4
• /
• pp.199-215
• /
• 2005

Experts participating in the knowledge expert network externalize their implicit knowledge by providing information or writing reports. Almost all the members of the network share externalized knowledge and the network facilitate the dissemination and diffusion of knowledge. Individuals reproduce another implicit knowledge by internalizing shared knowledge through the network and re-created knowledge is externalized, establishing knowledge circulation. In this paper, we analyze the expert groups of the Global Network of Korean Scientists & Engineers(KOSEN, www.kosen21.org), the Korea's No. 1 science and engineering knowledge expert community, with the application of the theory of policy network proposed by Marsh & Rhodes. According to the principal standards of policy network classification such as the number of participants, interaction among participants, consistency, distribution of resources and dependency, we categorize the KOSEN expert groups as closed policy network and opened issue network, and divide closed policy network into core community and periphery community.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.21 no.3
• /
• pp.414-426
• /
• 1997

Numerical computations were conducted to characterize the three-dimensional laminar flow through an injector orifice having an inclined angle of 30 .deg.. For this study, the incompressible Navier-Stokes equations in generalized curvilinear coordinates, using a pseudocompressibility approach for continuity equation, were solved. The computations were performed using the finite difference implicit, approximately factored scheme of Beam and Warming and multi-block grids of complete continuity at block interfaces. The multi-block computations were validated for the steady state using direct comparison of multi-block solutions with equivalent single-block ones, including 2-D 180.deg. TAD and 3-D 90.deg. pipe bend. The comparisons between the numerical solutions and the flow field measurements for a tube with sudden contraction were presented in this work for solution validation. Computational results showed the nature of complex flow fields within the inclined injector orifice, including strong pressure-driven secondary flows in the cross stream induced by the effect of streamline curvature. In addition, asymmetric secondary flows were induced in the Reynolds number range above assumed laminar flow regime considered. However, turbulence calculations and grid dependency studies are needed for more accurate computations.

• Journal of Korea Multimedia Society
• /
• v.4 no.3
• /
• pp.270-279
• /
• 2001

Since most program execution time is spent in the loop structure, extracting parallelism from sequential loop programs hale been focused. But, most programs hare implicit parallelism of interprocedure. This paper presents a generalized Parallelism extraction in loop\ulcorner with procedure calls. Most parallelization of loops with Procedure calls just focus on the uniform code which data dependency distance is constant. We presents algorithms which can be applied with uniform code, nonuniform code, and complex code. The proposed algorithm, loop extraction, loop embedding and procedure cloning transformation methods evaluate using CRAY-T3E. The result of performance evaluation is that proposed algorithm is an effect.

• Journal of Internet Computing and Services
• /
• v.2 no.4
• /
• pp.91-99
• /
• 2001

Since roost of the program execution time is spent in the loop structure, the problem of extracting parallelism from sequential loop has been one of the most important research issues. However. roost programs have Implicit interprocedure parallelism. This paper presents a generalized method extracting parallelism in loops having the procedure calls. Most parallelization of loops having procedure calls focus on the uniform code where data dependency distance is constant. We present algorithms which can be applied to uniform code, nonuniform code, and complex code. The performance of the proposed algorithm, loop extraction, loop embedding and procedure cloning transformation methods have been evaluated using CRAY-T3E. The result shows the effective of the proposed algorithm.