• The Korean Journal of Archival Studies
• /
• no.21
• /
• pp.41-84
• /
• 2009

Lots of cultures, memories, histories of the local life have disappeared. Some sectors of universities and religion have keep their records in manuscript archive only. On the other hand records of public sectors were at least able to be managed by the records management law. Citizen's groups and academic bounds were also roles to get public records strong. However can we just describe whole body with only public records? As records management law a record of private sector which has value of preserving can be managed under national protection. Yet establishment of local archive is not obligate. Only stressing on public records is like what dictatorial government acted in past years. It is what we ignore diversity and request of community. We need to move our view that we have focused on public and central sectors to private and local sectors. Local records management based on locality could help to complete the entire puzzle. The way complete the puzzle is various and wide spheres including from cultural space to being extinct village. Locality is defined as the property in certain area or distinctiveness of locals. Establishing production strategies is as important as collecting records produced over the past years for local archiving. Local archiving has to be regionally conducted in phase. Moreover common wealth and recognition of communities are reflected in the acquisition process. In next to archiving local organizations and private records according to collection policy, methodology on local archiving needs for archive management and use in various public and private fields. This methodology could be possible by building a local archive networking tool. It is true that Local archiving is not familiar and clear yet. If we can turn the effort for public records we have made to endeavor for private sectors, we might expect big fruits in private sectors. We easily emphasis on globalization or internationalization, our daily lives start on our villages. Setting aside our small communities, such a puzzle of the whole would never be completed. This is good time to begin finding lost puzzle for future. The key that can find lost puzzles be held in archiving localities.

• Spatial Information Research
• /
• v.21 no.2
• /
• pp.23-33
• /
• 2013

W ith the recent advancement of IoT (Internet of Things) technology, there has been much interest in the spatial query processing which energy-efficiently acquires sensor readings from sensor nodes inside specified geographical area of interests. Therefore, various kinds of spatial query processing algorithms and distributed spatial indexing methods have been proposed. They can minimize energy consumption of sensor nodes by reducing wireless communication among them using in-network spatial filtering technology. However, they cannot optimize multiple spatial queries which w ill be w idely used in IoT, because most of them have focused on a single spatial query optimization. Therefore, we propose a new multiple spatial query optimization algorithm which can energy-efficiently process multiple spatial queries in a sensor network. The algorithm uses a concept of 'query merging' that performs the merged set after merging multiple spatial queries located at adjacent area. Here, our algorithm makes a decision on which is better between the merged and the separate execution of queries. For such the decision making, we additionally propose the cost estimation method on the spatial query execution. Finally, we analyze and clarify our algorithm's distinguished features using the spatial indexing methods of GR-tree, SPIX, CPS.

• The Korean Journal of Coaching Psychology
• /
• v.5 no.1
• /
• pp.33-65
• /
• 2021

This study is an exploratory study to investigate the concept of student success recognized by college students. In order to listen to students' free thoughts, an open questionnaire was conducted using an online questionnaire and 99 responses were analyzed. The response results were analyzed using CQR-M (Consensual Qualitative Research-Modified). As a result of the analysis, 25 categories were derived from three domains. The frist domain, 'meaning of student success' recognized by college students is with 9 categories: 'academic achievement', 'job competency improvement', 'gaining diverse experiences', 'satisfactory employment', 'setting of desired career path', 'relationship-building ability improvement', 'setting and achievement of own goals', 'self-development', and 'satisfactory college life'. The second domain, 'college environmental factors for student success' is with 7 categories: 'career development support', 'job competency improvement system', 'support for participation in college life', 'opportunities to form human networks', 'learning capability enhancement system', 'expansion of economic support', and 'environment for student convenience'. The third domain, 'psychological factors necessary for student success' is with 9 categories: 'learning ability', 'self-efficacy', 'interpersonal competence', 'self-awareness and improvement', 'job competency', 'self-regulation ability', 'rich experience', 'career awareness', and 'self-esteem'. The frequency and results of each domain were analyzed and presented, the significance and limitations of the study were discussed, and suggestions for subsequent studies were made.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.253-264
• /
• 2002

Recently, hierarchical architectures of databases for location management have been proposed in order to accommodate the increase in user population in future personal communication systems. In particular, a 3-level hierarchical database architecture is compatible with current cellular mobile systems. In the architecture, a newly developed additional databases, regional location database(RLR), are positioned between HLR and VLRs. We propose an efficient cache scheme, called the Double T-thresholds Location Cache Scheme. The cache scheme extends the existing T-threshold location cache scheme which is competent only under 2-level architecture of location databases currently adopted by IS-41 and GSM. The idea behind our scheme is to use two pieces of cache information, VLR and RLR serving called portables. The two pieces are required in order to exploit root only locality of registration area(RA) but also locality of regional registration area(RRA) which is the wide area covered by RLR. We also use two threshold values in order to determine whether the two pieces are obsolete. In order to model the RRA residence time, the branching Eralng-$\infty$ distribution is introduced. Our minute cost analysis shows that the double T-threshold location cache scheme yields significant reduction of network and database costs for molt patterns of portables.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.627-634
• /
• 2006

Overlay network eliminates the need to change the application-layer tree when the underlying network changes and enables the overlay network to survive in environments where nonmember nodes do not support multicast functionality. An overlay protocol monitors group dynamics, while underlying unicast protocols track network dynamics, resulting in more stable protocol operation and low control overhead even in a highly dynamic environment. But, if overlay multicast protocols does not know the location information of node, this makes it very difficult to build an efficient multicasting tree. So, we propose a Hierarchical Overlay Multicast Architecture (HOMA) with the location information. Because proposed architecture makes static region-based dynamic group by multicast members, it is 2-tired overlay multicasts of application layer that higher layer forms overlay multicast network between members that represent group, and support multicast between multicast members belonging to region at lower layer. This use GPS, take advantage of geographical region, and realizes a region-sensitive higher layer overlay multicast tree which is impervious to the movements of nodes. The simulation results show that our approach solves the efficiency problem effectively.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.4
• /
• pp.29-39
• /
• 2009

The need for radio spectrum is recently considered as a huge hurdle towards the rapid development of wireless networks. Large parts of the spectrum are allocated to licensed radio services in proprietary way. However, enormous success of the wireless services and technologies in the unlicensed bands has brought new ideas and innovations. In recent years cognitive radio has gained much attention for solving the spectrum scarcity problem. It changes the way spectrum is regulated so that more efficient spectrum utilization is possible. Multi-hop relay technology on the other hand has intensively been studied in the area of ad hoc and peer-to-peer networks. But in cellular network, only recently the integration of multi-hop capability is considered to enhance the performance significantly. Multi-hop relaying can extend the coverage of the cell to provide high data rate service to a greater distance and in the shadowed regions. Very few papers still exist that combine these methods to maximize the spectrum utilization. Thus we propose a network architecture combining these two technologies in a way to maximize the system throughput. We present the throughput capacity equations for the proposed system model considering various system parameters like utilization factor by the primary users and primary users' transmission radius and through extensive numerical simulations we analyze the significance of work.

• Journal of KIISE:Information Networking
• /
• v.31 no.4
• /
• pp.375-383
• /
• 2004

As wireless mobile networks have been widely adopted due to their convenience for deployment, the research for improving their performance has been actively conducted. Since their throughput is restrained by the packet corruption rate not by congestion as in wired networks, however, network simulations for performance evaluation need to select the appropriate wireless channel model representing the behavior of propagation errors for the evaluated channel. The selection of the right model should depend on various factors such as the adopted frequency band, the level of signal power, the existence of obstacles against signal propagation, the sensitivity of protocols to bit errors, and etc. This paper analyzes 10-day bit traces collected from real sensor channels exhibiting the high bit error rate to determine a suitable sensor channel model. For selection, it also evaluates the performance of two error recovery algorithms such as a link layer FEC algorithm and three TCPs (Tahoe, Reno, and Vegas) over several channel models. The comparison analysis shows that CM(Chaotic Map) model predicts 3-time less BER variance and 10-time larger PER(Packet Error Rate) than traces while these differences between the other models and traces are larger than 10-time. The simulation experiments, furthermore, prove that CM model evaluates the performance of these algorithms over sensor channels with the precision at least 10-time more accurate than any other models.

• Journal of KIISE:Information Networking
• /
• v.35 no.3
• /
• pp.215-226
• /
• 2008

As sensor networks are used in various and dynamic applications, the function of sink-to-sensors reliable multicasting such as for task reprogramming is newly required. NAK-based error recovery schemes have been proposed for energy efficient reliable multicasting. However, these schemes have incompleteness problems such as the last packet loss. This paper introduces an ACK-based error recovery scheme, RM2I(Reliable Multicast with Implicit ACK and Indirect Recovery). It utilizes wireless multicast advantage in which a packet may be delivered to all of its omni-directional neighbor nodes. When a sender overhears a packet which its receiver forwards to the next nodes, it may interpret it as an ACK from the receiver. We call it an Implicit ACK. In Indirect Recovery, when a node receives a packet from neighbor nodes which are not its direct upstream node, it saves and utilizes it for error recovery. Using NS-2 simulator, we have analyzed their effects. We have also compared RM2I with the NAK-based error recovery scheme. In results, RM2I shows comparable performances to the ideal NAK-based scheme, except where Implicit ACK and Indirect Recovery do not occur at the edges of the networks.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.16 no.5
• /
• pp.19-25
• /
• 1998

본 고에서는 전자상거래에서의 지불 방법과 전자상거래에서 사용되는 거래정보의 보안기법에 대해 살펴보았다. 전자지불의 유형으로는 전자 대금 이체, 디지털 캐시 및 이의 현실적인 형태인 E-cash등이 있다. 이러한 거래 방법과 더불어 전자상거래 시스템의 보안은 비즈니스 측면에서 매우 중요하다. 이를 보장하기 위해 non-SET 기반으로 대칭적 암호화 기법, 비대칭적 암호화 기법 및 SET을 이용한 암호화 거래 방법을 살펴보았다. 전자상거래 시스템의 구성요소는 구매자, 판매자 및 중개인으로 이루어진다[8]. 전자상거래의 보안에 관한 요소는 다른 학문적인 요소와는 달리 그 실용적인 성격과 파급효과로 인하여 세계 각국의 정부 기관이나 연구소에서 주도권 쟁탈을 위한 노력을 기울이고 있다. 이러한 전자상거래의 요소는 전자상거래의 기술을 연구하고 제시하는 쪽 보다는 현실적인 필요성에 의해 금융기관이나 판매자들에 의해 주도적으로 개발되는 경우가 많다. 컴퓨터와 네트워크의 급속한 발전 속도와 영역의 확장은 앞으로의 전자상거래가 국가나 사회에 어떤 영향을 미칠지를 예측하기 어렵게 한다. 다시 말하면 앞으로 전자상거래가 사회, 경제적 또는 외교적으로 미칠 영향은 매우 크리라 예상된다. 이러한 전자상거래 분야에서 주도권을 유지하기 위해서는 이와 관련된 정부부처, 연구소, 각급 기관 및 업체들이 서로 협력하고 조율하여 국제적인 표준과 보조를 맞추고, 국내 기술과의 접목을 가능하도록 협조와 자원이 필요하다. 전자상거래 관련 보안 및 지불 기술의 확보는 국가 경쟁력 확보 및 차세대 거래 수단으로서의 전자상거래 시장에서 기회를 확보할 수 있는 초석이 될 것이다.

• Journal of Digital Convergence
• /
• v.12 no.1
• /
• pp.229-239
• /
• 2014

Smartwork technology, using teleworking, smartwork centers and mobile terminal, provides a flexible work environments without constraints of time and space. Smartwork system to increase the work efficiency has the information protection threats according to their convenience. Thus, in order to build smartwork, it is proper to provide information protection audit to help ensure the information protection. In this paper, we have proposed an infortaion protection audit model at the practical and technical level for building a smartwork environment. We were classified as a terminal, network and server area for information protection, and derived a professional information protection check items. Further, by establishing a smartwork information protection audit time to map ISMS control items, we have proposed an audit model so that it is possible to improve the security and efficiency. It also verified whether the proposed model is suitable or not by doing a survey if deduced audit domain and check items correspond with the purpose of the smartwork information protection audit to auditors and IT specialists. As the result, this study was 97% satisfaction out of 13 check items.