• Journal of Information Processing Systems
• /
• v.20 no.3
• /
• pp.375-390
• /
• 2024

Edge computing architecture has effectively alleviated the computing pressure on cloud platforms, reduced network bandwidth consumption, and improved the quality of service for user experience; however, it has also introduced new security issues. Existing anomaly detection methods in big data scenarios with cloud-edge computing collaboration face several challenges, such as sample imbalance, difficulty in dealing with complex network traffic attacks, and difficulty in effectively training large-scale data or overly complex deep-learning network models. A lightweight deep-learning model was proposed to address these challenges. First, normalization on the user side was used to preprocess the traffic data. On the edge side, a trained Wasserstein generative adversarial network (WGAN) was used to supplement the data samples, which effectively alleviates the imbalance issue of a few types of samples while occupying a small amount of edge-computing resources. Finally, a trained lightweight deep learning network model is deployed on the edge side, and the preprocessed and expanded local data are used to fine-tune the trained model. This ensures that the data of each edge node are more consistent with the local characteristics, effectively improving the system's detection ability. In the designed lightweight deep learning network model, two sets of convolutional pooling layers of convolutional neural networks (CNN) were used to extract spatial features. The bidirectional long short-term memory network (BiLSTM) was used to collect time sequence features, and the weight of traffic features was adjusted through the attention mechanism, improving the model's ability to identify abnormal traffic features. The proposed model was experimentally demonstrated using the NSL-KDD, UNSW-NB15, and CIC-ISD2018 datasets. The accuracies of the proposed model on the three datasets were as high as 0.974, 0.925, and 0.953, respectively, showing superior accuracy to other comparative models. The proposed lightweight deep learning network model has good application prospects for anomaly traffic detection in cloud-edge collaborative computing architectures.

• Journal of The Korean Association of Information Education
• /
• v.11 no.1
• /
• pp.21-28
• /
• 2007

Along with the development of telecommunication technology, educational role has been considerably changed and NEIS is introduced and operated for the digital educational administration. However, the function of NEIS is so limited when operated in each school. As a result, Korean government prepares the plan to install and operate a new School Affairs System by separating 3 areas from 27 areas of NEIS. School Affairs System has been used in schools since March, 2006. In this regard, this study attempts to analyze the current status and tasks of using the system in elementary schools. The result of the study shows that about 67% teachers use the system once or twice a day. Most of teachers answer that they get help from other teachers if they have any problem in operating the system. Many teachers affirmatively answer to the design and function of the system, and they are satisfied with the convenience and efficiency of the system. However, they feel difficulty to be familiar with the system sue to the frequent change. The importance of electronic certificate and personal information is well recognized and managed in terms of the security of the system. Facilities need to be well equipped, and information exchange system need to be developed to accept each school's request to improve the function of the system. In addition, applicable laws need to be arranged, clear guideline of educational administration agency and principal's strong intention are required to relieve teachers' work load.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.1
• /
• pp.57-67
• /
• 2005

Fast scalar multiplication of points on elliptic curve is important for elliptic curve cryptography applications. In order to vary field sizes depending on security situations, the cryptography coprocessors should support variable length finite field arithmetic units. To determine the effective variable length finite field arithmetic architecture, two well-known curve scalar multiplication algorithms were implemented on FPGA. The affine coordinates algorithm must use a hardware division unit, but the projective coordinates algorithm only uses a fast multiplication unit. The former algorithm needs the division hardware. The latter only requires a multiplication hardware, but it need more space to store intermediate results. To make the division unit versatile, we need to add a feedback signal line at every bit position. We proposed a method to mitigate this problem. For multiplication in projective coordinates implementation, we use a widely used digit serial multiplication hardware, which is simpler to be made versatile. We experimented with our implemented ECC coprocessors using variable length finite field arithmetic unit which has the maximum field size 256. On the clock speed 40 MHz, the scalar multiplication time is 6.0 msec for affine implementation while it is 1.15 msec for projective implementation. As a result of the study, we found that the projective coordinates algorithm which does not use the division hardware was faster than the affine coordinate algorithm. In addition, the memory implementation effectiveness relative to logic implementation will have a large influence on the implementation space requirements of the two algorithms.

• The Journal of Korean Association of Computer Education
• /
• v.11 no.1
• /
• pp.57-64
• /
• 2008

This paper presents a web-based virtual educational system for Java language, which consists of a management system named Java Web Player (JWP) and creative multimedia contents for the lectures of Java language. The JWP is a Java application program free from security problems by the Java Web Start technologies that supports an integrated learning environment including three important learning procedures: Java concept learning process, programming practice process and assessment process. On-line voice presentation and its related texts together with moving images are synchronized for efficiently conveying creative contents to learners. Furthermore, a simple and useful compiler is included in the JWP for providing user-friendly language practice environment enabling such as coding, editing, executing, and debugging Java source files on the Web. Finally, simple multiple choices are given suddenly to the learners while they are studying through the JWP and the test results are displayed on the message box. In order to show the validity of the proposed virtual educational system we analysed and assessed the learners' academic performance on the five quizzes for one semester.

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

In this paper, we propose practical results for cache replacement policy by measuring cache hit and search time for each replacement algorithm through cache simulation. Thus, the structure of each cache memory and the four types of alternative policies of FIFO, LFU, LRU and Random were implemented in software to analyze the characteristics of each technique. The paper experiment showed that the LRU algorithm showed hit rate and search time of 36.044% and 577.936ns in uniform distribution, 45.636% and 504.692ns in deflection distribution, while the FIFO algorithm showed similar performance to the LRU algorithm at 36.078% and 554.772ns in even distribution and 45.662% and 489.574ns in bias distribution. Then LFU followed, Random algorithm was measured at 30.042% and 622.866ns at even distribution, 36.36% at deflection distribution and 553.878ns at lowest performance. The LRU replacement method commonly used in cache memory has the complexity of implementation, but it is the most efficient alternative to conventional alternative algorithms, indicating that it is a reasonable alternative method considering the reference information of data.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.18 no.2
• /
• pp.75-91
• /
• 2015

This study aims to analyse the U-City characteristics through the U-City historical mapping. The U-City characteristics were analysed by building the U-City historical map in terms of STIM model which consists of service, technology, infrastructure and management. The data for analysis is the National Informatization White Paper published by the NIA (National Information Society Agency) from 2002 to 2013. As a result, first, the U-City service were evolved from administration informatization, enterprise informatization, administration/living informatization and administration/space/private informatization through the intelligence facilities and space. Second, the U-City technology were changed through wire network, sensor/network, processing/super-highway network, convergence of network/security. Third, the U-City infrastructure have had evolutionary process such as wire computer network, wire/wireless network, intellectualization facility and intelligent facility space. Forth, the U-City management were carried out with making the unit network/infrastructure management, information connection/operating management and information integration/participation management. Therefore, the history of U-City has been making rapid development in government computerization, computer oriented society, information city and ubiquitous city.

• Journal of Digital Convergence
• /
• v.13 no.12
• /
• pp.151-160
• /
• 2015

As a lexical meaning, casino is defined as "a certified gambling house, equipped with recreational facilities such as dance and music, etc., where people play roulette or cards." Casinos started from 17th to 18th century for European nobility and their social meetings and established a casino industry framework in the United States in the 1930s. The success of the casino business leads to the increase of sales; it became very helpful for the local and national government revenues and also for the related incidental tasks. Casino operations include a variety of fields, such as general customer management, dealer game management, security, account management, currency exchange, re-exchange management, marketing management, comp management and placement management, etc. These operations should be organically connected to each other by information systems such as a groupware, ERP and Customer Relationship Management (CRM), etc. In addition, in order to effectively manage comprehensive entertainment service, including accommodation and tourism, it is necessary to develop an information system which supports casino business and collateral entertainment service, collects the data generated throughout the business and provides information about the situations of management. Thus, this study will propose a casino information system designed and implemented, considering these details.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.533-546
• /
• 2003

for the low information goods which will be traded through Internet is impossible to manage with previously existed payment system. The reason is that it's not economic because the management cost is bigger than the benefit of the information goods trade. Therefore, recently, there have been micropaymentresearches such as "Milicent", "PayWord", "MicroMint", and "iKP", etc. Though these methods don't have any problem with the low cost of the mechanism and the satisfaction of adequate security, they have big problem with the use of the unnecessary account and the aggregation of payment bill. The PayHash system which has been developed in this study simplifies the system's mechanism with "one-way hash function" which is used in generation, payment, and verification of the bill. And the system removed the generation and use of unnecessary account by making one customer have one account. The system solve the problem of the payment aggregation by using the last payment hash value and its index. And the system improves its performance by reducing the use of "digital signature" drastically, as well. As the result of this study, the PayHash system made it possible for the participants of the Internet Commerce to trade the lowest cost goods through efficient maintenance.o trade the lowest cost goods through efficient maintenance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.10
• /
• pp.2873-2878
• /
• 2009

Since Germany was unified in 1990, Korea became the only country that has the division in the world. This division has various bad effects on Korea's status with not reliable security, forfeited national impression, loss of tourism income and so on. Kim Jung-Il national defense committee chairman is the current dictator of North Korea which is a socialist state. Even if he is getting old, his successor is not proclaimed. In this situation, his sudden aggravation of health can cause seriously bad effects on diplomatic relations especially with South Korea. Therefore, the health information about Kim Jung-Il national defense committee chairman will be very important information. In order to deal this problem, we propose the method of extracting the Kim Jung-Il national defense committee chairman's health from his pictures which are recently open to the public by employing the diagnosis Ocular Inspection used in Oriental medicine. n order to get an accurate result, revising the Kim Jung-Il national defense committee chairman's pictures, which are not taken in a controled equal situation, is necessary. Therefore we employed the color analysis process with color revising and color differential comparing process without color revising. With these processes, we can make diagnosis of his diabetes and complications.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.3
• /
• pp.135-139
• /
• 2009

The problems to compute the distances or similarities of multiple strings have been vigorously studied in such diverse fields as pattern matching, web searching, bioinformatics, computer security, etc. One well-known method to compare multiple strings in the given set is finding a consensus string which is a representative of the given set. There are two objective functions that are frequently used to find a consensus string, one is the radius and the other is the consensus error. The radius of a string x with respect to a set S of strings is the smallest number r such that the distance between the string x and each string in S is at most r. A consensus string based on radius is a string that minimizes the radius with respect to a given set. The consensus error of a string with respect to a given set S is the sum of the distances between x and all the strings in S. A consensus string of S based on consensus error is a string that minimizes the consensus error with respect to S. In this paper, we show that the problem of finding a consensus string based on radius is NP-complete when the distance function is a metric.