• Journal of the Korea Convergence Society
• /
• v.6 no.4
• /
• pp.197-203
• /
• 2015

The purposes of this study were to analyze how effects of parental monitoring, parental affection, inconsistency in parenting attitudes on adolescents' school adjustment and intervention to help adolescents school adjustment. Korea Youth Policy Institute to achieve the research objectives, 'Korea Child Youth Panel Survey'(KCYPS 2010) using data from the First year 1 data were analyzed by Descriptive Statistic, t-Testing, ANOVA and Multiple Regression Analysis. The results of the study are as follows. parenting attitudes were an independent variable having a partially significant effect on middle school students' school adjustment. As a results, The level of parental monitoring and affection are high, the level of middle school students' school adjustment gets higher. On the contrary, the level of parents' inconsistency are high, the level of middle school students' school adjustment gets lower. Therefore, it is necessary to research various options to develop promoting positive parenting attitude in order to increase the level of the middle school student's school adjustment

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.91-99
• /
• 2014

The main game architectures for multiplayer online games are the traditional client-server architectures, multi-server architectures and P2P(peer-to-peer) architectures. P2P architectures, due to their distributed and collaborative nature, have low infrastructure costs and can achieve high scalability as well as fast response time by creating direct connections between players. However, P2P architectures face many challenges. Distributing a game among peers makes maintaining control over the game more complex. These architectures also tend to be vulnerable to churn and cheating. Providing consistency control in P2P systems is also more difficult since conflicting updates might be executed at different sites resulting in inconsistency. In order to avoid or correct inconsistencies, most multiplayer games use a primary-copy replication approach where any update to the object has to be first performed on the primary copy. This paper presents the primary-copy model with the update dissemination mechanism that provides consistency control over an object in P2P architectures for multiplayer online games. The performance for this model is evaluated through simulation experiments and analysis.

• Journal of KIISE:Databases
• /
• v.29 no.6
• /
• pp.492-501
• /
• 2002

An asynchronous trigger processor (ATP) is a oftware system that processes triggers after update transactions to databases are complete. In an ATP, discrimination networks are used to check the trigger conditions efficiently. Discrimination networks store their internal states in memory nodes. TriggerMan is an ATP and uses Gator network as the .discrimination network. The changes in databases are delivered to TriggerMan in the form of tokens. Processing tokens against a Gator network updates the memory nodes of the network and checks the condition of a trigger for which the network is built. Parallel token processing is one of the methods that can improve the system performance. However, uncontrolled parallel processing breaks trigger processing semantic consistency. In this paper, we propose four trigger processing consistency levels that allow parallel token processing with minimal anomalies. For each consistency level, a parallel token processing technique is developed. The techniques are proven to be valid and are also applicable to materialized view maintenance.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2763-2775
• /
• 1998

In mobile computing environments, to efficiently use the narrow bandwidth of wireless networks a mobile host caches the data that are frequently accessed. But, because the cached data can be inconsistent with the data n a server due to the host mobility and the disconnection from a server, the usefullness of cached data may be losted. The traditional methods emphasize on the cache consistency and assume that broadcasting times are synchronized at all mobile supprot stations. In this paper, we propose a strategy to maintain cache consistency, which resolves the problems that be caused by the migration of mobile host. The proposed strategy has asynchronous broadcasting time and reduces the communication overhead caused by the synchronization. Also, by preventing the unnecessary messages transmitting from the mobile support station to a mobile host, this strategy can reduce the communication cost and use the narrow bandwidth of wireless networks efficiently.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.9
• /
• pp.699-708
• /
• 2006

Bus splitting technique reduces bus energy by placing modules with frequent communications closely and using necessary bus segments in communications. But, previous bus splitting techniques can not be used in MPSoC platform, because it uses cache coherency protocol and all processors should be able to see the bus transactions. In this paper, we propose a bus splitting technique for MPSoC platform to reduce bus energy. The proposed technique divides a bus into several bus segments, some for private memory and others for shared memory. So, it minimizes the bus energy consumed in private memory accesses without producing cache coherency problem. We also propose a task allocation technique considering cache coherency protocol. It allocates tasks into processors according to the numbers of bus transactions and cache coherence protocol, and reduces the bus energy consumption during shared memory references. The experimental results from simulations say the bus splitting technique reduces maximal 83% of the bus energy consumption by private memory accesses. Also they show the task allocation technique reduces maximal 30% of bus energy consumed in shared memory references. We can expect the bus splitting technique and the task allocation technique can be used in multiprocessor platforms to reduce bus energy without interference with cache coherency protocol.

• The KIPS Transactions:PartA
• /
• v.13A no.6 s.103
• /
• pp.525-532
• /
• 2006

Compared with the previous recovery algorithms for causal message logging, Elnozahy's recovery algerian considerably reduces the number of stable storage accesses and enables live processes to execute their computations continuously while performing its recovery procedure. However, if causal message logging is used with asynchronous checkpointing, the state of the system may be inconsistent after having executed this algorithm in case of concurrent failures. In this paper, we show these inconsistent cases and propose a low-cost recovery algorithm for causal message logging to solve the problem. To ensure the system consistency, this algorithm allows the recovery leader to obtain recovery information from not only the live processes, but also the other recovering processes. Also, the proposed algorithm requires no extra message compared with Elnozahy's one and its additional overhead incurred by message piggybacking is significantly low. To demonstrate this, simulation results show that the first only increases about 1.0%$\sim$2.1% of the recovery information collection time compared with the latter.

• The KIPS Transactions:PartC
• /
• v.11C no.4
• /
• pp.545-554
• /
• 2004

WebDAV is a protocol to support collaboration among the workers in geographically distant locations through the Internet. WebDAV extends the web communication protocol HTTP/1.1 to provide a standard infrastructure for supporting asynchronous collaboration for various contents across the Internet. To provide the WebDAV functionality in legacy applications such as web-based collaborative systems or document management systems, those systems need to be implemented additionally to handle the WebDAV methods and headers information. In this paper, we developed an Apache-based WebDAV server, named DAVinci(WebDAV Is New Collaborative web-authoring Innovation)which supports the WebDAV specification. DAVinci was implemented as a form of service provider on a mod_dav Apache module. Mod_day, which is an Apache module, is an open source module to provide WebDAV capabilities in an Apache web server. We used a file system for storing resources and the PostgreSQL database for their properties. In addition, the system provides a consistency manager to guarantee that both resources and properties are maintained without inconsistency between resources and their properties.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10c
• /
• pp.6-8
• /
• 1999

세그먼트 디렉토리는 CC-NUMA (Cache Coherent Non-Uniform Memory Access)시스템의 전체 벡터와 포인터의 장점만을 가지는 새로운 형태의 디렉토리 요소이다. 포인터가 하나의 프로세서 위치만을 가리키는데 비해, 세그먼트 디렉토리는 복수 개이 프로세서들을 한 번에 가리킬 수 있으면서, 포인터처럼 작은 단위로 사용가능하다. 본 논문에서는 세그먼트 디렉토리를 제한 디렉토리 방법들에 적용하여 디렉토리 넘침의 횟수를 줄인다. 기존의 방법들이 디렉토리 넘침 후의 효율적인 캐쉬 일관성 유지 기법을 제시했던 것에 비해, 세그먼트 디렉토리는 디렉토리 넘침 자체를 제거하는 최초의 시도이다. 디렉토리 넘침의 제거로 CC-NUMA 시스템 대역폭 요구량이 줄어들고, 프로그램 수행이 가속되며, 디렉토리 제어기 점유가 대폭 감소된다. Tango-Lite를 사용한 실행 구동 시뮬레이션을 통하여 세그먼트 디렉토리가 약 80%까지의 디렉토리 넘침을 제거한 것을 확인하였고, 이에 따르는 시스템 성능 향상을 분석하였다.

• Proceedings of the KAIS Fall Conference
• /
• 2008.05a
• /
• pp.220-223
• /
• 2008

본 논문은 소프트웨어 설계 시 향상된 오류 검출방법을 통해서 소프트웨어 설계의 질을 향상시켜 그에 따른 소프트웨어 제품의 질을 향상시키데 목적을 두고 있다. 또한 소프트웨어 설계 방법론인 MOA(Methodology for Object to Agents)를 기초로 하고 있으며, MOA는 보편적인 정보 모델로써 온톨로지 기반 모델인 OSSD( Ontology for Sortware Specification and Desigh)모델을 이용한다. 본 논문은 OSSD 모델, 뷰-간 비일관성 검사기법, 일관성 프레임워크의 온톨로지적 특성과 연관된 규칙의 조합을 이용하여 UML모델에서 OSSD 모델로의 변환과정에서 수행되는 새로운 형식의 오류 검출방법을 정의한다. OSSD 모델로의 변환과정은 OSSD 모델의 인스턴스를 생성하기 위한 알고리즘에서 복수의 사상테이블을 이용하는 소프트웨어 설계의 어휘분석과 의미분석을 포함한다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 1992.07a
• /
• pp.375-382
• /
• 1992

국내외 비유사량 추정방법에 대하여 심도있게 조사하였다. 지금까지 우리나라 댐 계획시 이용됨 비유사량 추정방법을 검토한 결과, 유사량 자료의 부족과 적절한 비유사량 추정방법의 결여로 각 댐의 비유사량 추정은 일관성이 없이 대부분 댐 설계자의 경험과 주관에 의하여 결정된 것으로 나타났다. 따러서, 본 연구에서는 새로운 비유사량 추정에 관한 1단계 연구로서 국외의 비유사량 추정방법을 조사,분석하고 국내 가용자료의 한계를 고려하여 새로운 비유사량 추정방법의 개발방향과 방법을 제시한다.