• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.119-130
• /
• 2022

Crime is a common social problem that affects the quality of life. As the number of crimes increases, it is necessary to build a model to predict the number of crimes that may occur in a given period, identify the characteristics of a person who may commit a particular crime, and identify places where a particular crime may occur. Data privacy is the main challenge that organizations face when building this type of predictive models. Federated learning (FL) is a promising approach that overcomes data security and privacy challenges, as it enables organizations to build a machine learning model based on distributed datasets without sharing raw data or violating data privacy. In this paper, a federated long short- term memory (LSTM) model is proposed and compared with a traditional LSTM model. Proposed model is developed using TensorFlow Federated (TFF) and the Keras API to predict the number of crimes. The proposed model is applied on the Boston crime dataset. The proposed model's parameters are fine tuned to obtain minimum loss and maximum accuracy. The proposed federated LSTM model is compared with the traditional LSTM model and found that the federated LSTM model achieved lower loss, better accuracy, and higher training time than the traditional LSTM model.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.4
• /
• pp.35-41
• /
• 2017

This paper introduces a new method for storing a private key. This method can be achieved by dividing the private key into "n" pieces by a (k, n) secret sharing method, and then storing each piece into photo files utilizing a steganography method. In this way, a user can restore a private key as long as he can remember the locations of "k" photos among the entire photo files. Attackers, meanwhile, will find it extremely difficult to extract the private key if a user has hidden the pieces of the private key into numerous photo files stored in the system. It also provides a high degree of user convenience, as the user can restore the private key from his memory of k positions among n photo files. Coupled with this, a certain level of security can be guaranteed because the attacker cannot restore a private key, even if he knows k-1 photo file locations.

• Journal of Internet Computing and Services
• /
• v.17 no.2
• /
• pp.1-9
• /
• 2016

Users are provided infrastructure such as CPU, memory, network, and storage as IaaS (Infrastructure as a Service) service on cloud computing environments. However storage instances cannot support the maximum storage capacity that SQL servers can use, because the capacity of instances provided by service providers is usually limited. In this paper, we propose a method of securing mass storage capacity for SQL servers by sharing network disks with limited storage capacity. We confirmed through experiments that it is possible to secure mass storage capacity, which exceeds the maximum storage capacity provided by an instance with Amazon EBS on Amazon EC2 Windows environments, and it is possible to improve the overall performance of the SQL servers by increasing the disk capacity and performance.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1005-1018
• /
• 2017

Recently, virtualization has become an essential component of cloud computing due to its various strengths, including maximizing server resource utilization, easy-to-maintain software, and enhanced data protection. However, since virtualization allows sharing physical resources among the VMs, the system performance can be deteriorated due to device contentions. In this paper, we first investigate the I/O overhead based on the number of VMs on the same server platform and analyze the block I/O process of the KVM hypervisor. We also propose an in-memory block cache mechanism, called QBic, to overcome I/O virtualization latency. QBic is capable of monitoring the block I/O process of the hypervisor and stores the data with a high access frequency in the cache. As a result, QBic provides a fast response for VMs and reduces the I/O contention to physical devices. Finally, we present a performance measurement of QBic to verify its effectiveness.

• The Journal of Society for e-Business Studies
• /
• v.15 no.2
• /
• pp.137-166
• /
• 2010

A virtual team is defined a group of people that use electronic communications for some or all of their interactions with other team members. Because team members of a virtual team are physically and temporally distributed, a team's transactive memory system(TMS) is considered to be crucial for the team's effectiveness and performance. TMS refers to a set of individual memory systems which integrate knowledge possessed by particular members through a shared awareness of who knows what. This paper seeks to understand (1) how a virtual team's TMS influences team performance, and (2) what factors contribute to developing the team's TMS. Given these purposes, through the extensive literature review, we first identified components and antecedents to develop a theoretical model that predicts a virtual team's performance. Using the survey data gathered from 172 virtual teams, this study found that expertise location, coordination, and cognition-based trust which were proposed as three components of TMS positively influenced a virtual team's performance. Furthermore, this study uncovered that perceived media richness, network tie strength, and shared norms significantly influenced the components of TMS, while geographical dispersion did not exert any significant influence on TMS.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.947-960
• /
• 1996

The primary goal for developing high performance ATM switching systems is to minimized the probability of cell loss, cell delay and deterioration of throughput. ATM switching element that is the most suitable for this purpose is the shared buffer memory switch executed by common random access memory and control logic. Since it is difficult to manufacture VLIS(Very Large Scale Integrated circuit) as the number of input ports increased, the used of switching module method the realizes 32$\times$32, 150 Mb/s switch utilizing 8$\times$8, 600Mb/s os 16$\times$16, 150Mb/s unit switch is latest ATM switching technology for small and large scale. In this paper, buffer capacity satisfying total-memory-reduction effect by buffer sharing in a shared buffer memory switch are analytically evalu ated and simulated by computer with cell loss level at traffic conditions, and also features of switching network utilizing the switching module methods in small and large-capacity ATM switching system is analized. Based on this results, the structure in outline of 32$\times$32(4.9Gb/s throughput), 150Mb/s switches under research in many countries is proposed, and eventually, switching-network structure for ATM switching system of small and large and capacity satisfying with above primary goals is suggested.

• Journal of KIISE:Information Networking
• /
• v.27 no.4
• /
• pp.489-497
• /
• 2000

주문형 비디오(Video On Demand)서버의 구현은 현재까지도 많은 부분에 한계를 가지고 있으며 이를 해결하기 위한 연구들이 활발히 진행되고 있다. 주문형 비디오 서비스의 한계는 대부분이 자원(디스크, 버퍼)의 제한 때문에 발생하고 있으며 디스크어레이(Disk Array)나, 메모리 뱅크(Memory Bank)와 같은 특수한 하드웨어를 사용하여 해결하고 있다. 또한 이와 아울러 그룹핑이나 버퍼 공유기법과 같은 소프트웨어적인 방법도 제안되었다. 본논문에서는 주분형 비디오 서버의 한계 중 디스크대역폭과 버퍼공간의 한계점에 의한 문제를 해결하기위하여 개선된 그룹핑 방법과 버퍼 공유 및 관리 방법을 제안한다. 제안하는 그룹핑 방법은 비디오의 인기도에 기반을 둔 방법을 사용하며 버퍼 공유방법은 버퍼의 크기 및 디스크의 대역폭 가용량에 따라 적응적으로 병합 분할하는 방법을 사용한다, 제안하는 병합 분할 방법은 피기백킹(piggy-backing)개념을 도입하였으며 시뮬레이션을 통해 제안하 방법의 우수성을 보였다.

• The Journal of Information Technology and Database
• /
• v.6 no.2
• /
• pp.71-86
• /
• 1999

The performance of relational database is measured by the number of disk accesses necessary to transfer data from disk to main memory. The paper proposes to vertically partition relations into fragments and to allow attribute replication to reduce the number of disk accesses. To reduce the computational time, heuristic search method using genetic algorithm is used. Genetic algorithm used employs a rank-based-sharing fitness function and elitism. Desirable parameters of genetic algorithm are obtained through experiments and used to find the solutions. Solutions of attribute replication and attribute non-replication problems are compared. Optimal solutions obtained by branch and bound method and by heuristic solutions(genetic algorithm) are also discussed. The solution method proposed is able to solve large-sized problems within acceptable time limit and shows solutions near the optimal value.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.4
• /
• pp.784-789
• /
• 2007

This paper presents an implementation of a new type of architecture to improve an overflow problem on the network buffer. Each receiver channel of network system stores the message in its own buffer. If some receiver channel receives many messages, buffer overflow problem may occur for the channel. This paper proposes a network controller that implements a receiver channel with shared-memory to save all of the received messages from the every incomming channels. The proposed architecture is applied to ARINC-429, a real-time control network for commercial avionics system. For verifying performance of the architecture, ARINC-429 controller is designed using a SOPC platform, designed by Verilog and targeted to Xilinx Virtex-4 with a built-in PPC405 core.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06b
• /
• pp.576-579
• /
• 2008

본 논문은 NAND 플래시 메모리를 기반으로 한 멀티미디어 휴대 장치에서 동영상 파일을 고속으로 편집하고 동시에 필요한 저장 공간 소모를 최소화 하는 기법을 제안한다. 동영상 파일 편집 후 저장에 있어서 현재의 NAND 플래시 파일 시스템들은 편집 내용을 빈 공간에 새로 저장하기 때문에, 대용량의 파일일수록 많은 시간과 저장 공간이 소모 된다. 본 논문에서 제안하는 기법은 동영상 편집 후 파일 간에 중복되는 데이터를 새로 저장하지 않고 공유하도록 하면서 소모되는 시간과 공간을 최소화 한다. 이를 위해 파일 간 공유 되는 데이터를 관리하는 페이지 공유 맵을 설계하고 이를 이용한 동영상 고속 편집저장 기법을 제시한다.