• Journal of Intelligence and Information Systems
• /
• v.22 no.1
• /
• pp.107-118
• /
• 2016

The advent of 5G mobile communications, which is expected in 2020, will provide many services such as Internet of Things (IoT) and vehicle-to-infra/vehicle/nomadic (V2X) communication. There are many requirements to realizing these services: reduced latency, high data rate and reliability, and real-time service. In particular, a high level of reliability and delay sensitivity with an increased data rate are very important for M2M, IoT, and Factory 4.0. Around the world, 5G standardization organizations have considered these services and grouped them to finally derive the technical requirements and service scenarios. The first scenario is broadcast services that use a high data rate for multiple cases of sporting events or emergencies. The second scenario is as support for e-Health, car reliability, etc.; the third scenario is related to VR games with delay sensitivity and real-time techniques. Recently, these groups have been forming agreements on the requirements for such scenarios and the target level. Various techniques are being studied to satisfy such requirements and are being discussed in the context of software-defined networking (SDN) as the next-generation network architecture. SDN is being used to standardize ONF and basically refers to a structure that separates signals for the control plane from the packets for the data plane. One of the best examples for low latency and high reliability is an intelligent traffic system (ITS) using V2X. Because a car passes a small cell of the 5G network very rapidly, the messages to be delivered in the event of an emergency have to be transported in a very short time. This is a typical example requiring high delay sensitivity. 5G has to support a high reliability and delay sensitivity requirements for V2X in the field of traffic control. For these reasons, V2X is a major application of critical delay. V2X (vehicle-to-infra/vehicle/nomadic) represents all types of communication methods applicable to road and vehicles. It refers to a connected or networked vehicle. V2X can be divided into three kinds of communications. First is the communication between a vehicle and infrastructure (vehicle-to-infrastructure; V2I). Second is the communication between a vehicle and another vehicle (vehicle-to-vehicle; V2V). Third is the communication between a vehicle and mobile equipment (vehicle-to-nomadic devices; V2N). This will be added in the future in various fields. Because the SDN structure is under consideration as the next-generation network architecture, the SDN architecture is significant. However, the centralized architecture of SDN can be considered as an unfavorable structure for delay-sensitive services because a centralized architecture is needed to communicate with many nodes and provide processing power. Therefore, in the case of emergency V2X communications, delay-related control functions require a tree supporting structure. For such a scenario, the architecture of the network processing the vehicle information is a major variable affecting delay. Because it is difficult to meet the desired level of delay sensitivity with a typical fully centralized SDN structure, research on the optimal size of an SDN for processing information is needed. This study examined the SDN architecture considering the V2X emergency delay requirements of a 5G network in the worst-case scenario and performed a system-level simulation on the speed of the car, radius, and cell tier to derive a range of cells for information transfer in SDN network. In the simulation, because 5G provides a sufficiently high data rate, the information for neighboring vehicle support to the car was assumed to be without errors. Furthermore, the 5G small cell was assumed to have a cell radius of 50-100 m, and the maximum speed of the vehicle was considered to be 30-200 km/h in order to examine the network architecture to minimize the delay.

• The Journal of Society for e-Business Studies
• /
• v.17 no.1
• /
• pp.23-38
• /
• 2012

Massive Multiplayer Online Role Playing Games(MMORPGs) headed by some Korean game companies such as NC Soft, NHN, and Nexon have exploded in recent years. However, it becomes one of the major challenges for the MMORPG developers to design their games to appeal to gamers since only a few MMORPGs succeed whereas they require a huge amount of initial investment. Under this background, our study derives the major elements for designing MMORPG from the literature, and identifies the ones critical to the users' satisfaction and their willingness to pay among the derived elements. Though most previous studies on the design elements of MMORPG have used analytic hierarchy process(AHP), our study adopts artificial neural network(ANN) as the tool for identifying key success factors in designing MMORPG. The results of our study show that the elements of the game contents quality have a bigger effect on the user's satisfaction, whereas the ones of the value-added systems have a bigger effect on the user's willingness to pay. They also show that user interface affects both the user's satisfaction and willingness to pay most. These results imply that the strategies for the development of MMORPG should be aligned with its goal and market penetration strategy. They also imply that the satisfaction and revenue generation from MMORPG cannot be achieved without convenient and easy control environment. It is expected that the new findings of our study would be useful forthe developers or publishers of MMORPGs to build their own business strategies.

• Journal of Intelligence and Information Systems
• /
• v.18 no.4
• /
• pp.43-57
• /
• 2012

To enhance the competitive advantage in a constantly changing business environment, an enterprise management must make the right decision in many business activities based on both internal and external information. Thus, providing accurate information plays a prominent role in management's decision making. Intuitively, historical data can provide a feasible estimate through the forecasting models. Therefore, if the service department can estimate the service quantity for the next period, the service department can then effectively control the inventory of service related resources such as human, parts, and other facilities. In addition, the production department can make load map for improving its product quality. Therefore, obtaining an accurate service forecast most likely appears to be critical to manufacturing companies. Numerous investigations addressing this problem have generally employed statistical methods, such as regression or autoregressive and moving average simulation. However, these methods are only efficient for data with are seasonal or cyclical. If the data are influenced by the special characteristics of product, they are not feasible. In our research, we propose a forecasting framework that predicts service demand of manufacturing organization by combining Case-based reasoning (CBR) and leveraging an unsupervised artificial neural network based clustering analysis (i.e., Self-Organizing Maps; SOM). We believe that this is one of the first attempts at applying unsupervised artificial neural network-based machine-learning techniques in the service forecasting domain. Our proposed approach has several appealing features : (1) We applied CBR and SOM in a new forecasting domain such as service demand forecasting. (2) We proposed our combined approach between CBR and SOM in order to overcome limitations of traditional statistical forecasting methods and We have developed a service forecasting tool based on the proposed approach using an unsupervised artificial neural network and Case-based reasoning. In this research, we conducted an empirical study on a real digital TV manufacturer (i.e., Company A). In addition, we have empirically evaluated the proposed approach and tool using real sales and service related data from digital TV manufacturer. In our empirical experiments, we intend to explore the performance of our proposed service forecasting framework when compared to the performances predicted by other two service forecasting methods; one is traditional CBR based forecasting model and the other is the existing service forecasting model used by Company A. We ran each service forecasting 144 times; each time, input data were randomly sampled for each service forecasting framework. To evaluate accuracy of forecasting results, we used Mean Absolute Percentage Error (MAPE) as primary performance measure in our experiments. We conducted one-way ANOVA test with the 144 measurements of MAPE for three different service forecasting approaches. For example, the F-ratio of MAPE for three different service forecasting approaches is 67.25 and the p-value is 0.000. This means that the difference between the MAPE of the three different service forecasting approaches is significant at the level of 0.000. Since there is a significant difference among the different service forecasting approaches, we conducted Tukey's HSD post hoc test to determine exactly which means of MAPE are significantly different from which other ones. In terms of MAPE, Tukey's HSD post hoc test grouped the three different service forecasting approaches into three different subsets in the following order: our proposed approach > traditional CBR-based service forecasting approach > the existing forecasting approach used by Company A. Consequently, our empirical experiments show that our proposed approach outperformed the traditional CBR based forecasting model and the existing service forecasting model used by Company A. The rest of this paper is organized as follows. Section 2 provides some research background information such as summary of CBR and SOM. Section 3 presents a hybrid service forecasting framework based on Case-based Reasoning and Self-Organizing Maps, while the empirical evaluation results are summarized in Section 4. Conclusion and future research directions are finally discussed in Section 5.

• Journal of Korean Society of Forest Science
• /
• v.39 no.1
• /
• pp.1-34
• /
• 1978

On July 8, 1977, 432mm of precipitation which is the largest daily storm in Korea fell on the city of Anyang where a nearby suburban community of Seoul. Average storm intensities of 90mm per hour were recorded during the period from 1900~2200 hours on this date. Area of landslides triggered by this storm is about 96 hectares resulting from 1,876 places within about 12,600 hectares of the watershed studied. These hazards injured hundreds of human lives and took 122 human lives. Rail and highway systems were disrupted and about 30 hectares of rice paddies were washed away and hundreds of hectares were inundated. About 500 houses were destroyed. The objectives of this study are (a) to describe the problem areas, identifying critical factors causing the landslide hazards including earth and stone-debris avalanches, (b) suggest measures which might enhance the effectiveness of stabilization measures, and (c) also suggest the landslide and flood damage prevention methods from the point view of the upper-watershed conservation techniques in Anyang hollow-basin.

• Maritime Security
• /
• v.7 no.1
• /
• pp.31-60
• /
• 2023

This study proposes a new convergence weapon system that combines the covert placement and detection abilities of a self-propelled mobile mine with the rapid tracking and attack abilities of supercavitating rocket torpedoes. This innovative system has been designed to counter North Korea's new underwater weapon, 'Haeil'. The concept behind this convergence weapon system is to maximize the strengths and minimize the weaknesses of each weapon type. Self-propelled mobile mines, typically placed discreetly on the seabed or in the water, are designed to explode when a vessel or submarine passes near them. They are generally used to defend or control specific areas, like traditional sea mines, and can effectively limit enemy movement and guide them in a desired direction. The advantage that self-propelled mines have over traditional sea mines is their ability to move independently, ensuring the survivability of the platform responsible for placing the sea mines. This allows the mines to be discreetly placed even deeper into enemy lines, significantly reducing the time and cost of mine placement while ensuring the safety of the deployed platforms. However, to cause substantial damage to a target, the mine needs to detonate when the target is very close - typically within a few yards. This makes the timing of the explosion crucial. On the other hand, supercavitating rocket torpedoes are capable of traveling at groundbreaking speeds, many times faster than conventional torpedoes. This rapid movement leaves little room for the target to evade, a significant advantage. However, this comes with notable drawbacks - short range, high noise levels, and guidance issues. The high noise levels and short range is a serious disadvantage that can expose the platform that launched the torpedo. This research proposes the use of a convergence weapon system that leverages the strengths of both weapons while compensating for their weaknesses. This strategy can overcome the limitations of traditional underwater kill-chains, offering swift and precise responses. By adapting the weapon acquisition criteria from the Defense force development Service Order, the effectiveness of the proposed system was independently analyzed and proven in terms of underwater defense sustainability, survivability, and cost-efficiency. Furthermore, the utility of this system was demonstrated through simulated scenarios, revealing its potential to play a critical role in future underwater kill-chain scenarios. However, realizing this system presents significant technical challenges and requires further research.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1041-1043
• /
• 1993

Fuzzy logic based Control Theory has gained much interest in the industrial world, thanks to its ability to formalize and solve in a very natural way many problems that are very difficult to quantify at an analytical level. This paper shows a solution for treating membership function inside hardware circuits. The proposed hardware structure optimizes the memoried size by using particular form of the vectorial representation. The process of memorizing fuzzy sets, i.e. their membership function, has always been one of the more problematic issues for the hardware implementation, due to the quite large memory space that is needed. To simplify such an implementation, it is commonly [1,2,8,9,10,11] used to limit the membership functions either to those having triangular or trapezoidal shape, or pre-definite shape. These kinds of functions are able to cover a large spectrum of applications with a limited usage of memory, since they can be memorized by specifying very few parameters ( ight, base, critical points, etc.). This however results in a loss of computational power due to computation on the medium points. A solution to this problem is obtained by discretizing the universe of discourse U, i.e. by fixing a finite number of points and memorizing the value of the membership functions on such points [3,10,14,15]. Such a solution provides a satisfying computational speed, a very high precision of definitions and gives the users the opportunity to choose membership functions of any shape. However, a significant memory waste can as well be registered. It is indeed possible that for each of the given fuzzy sets many elements of the universe of discourse have a membership value equal to zero. It has also been noticed that almost in all cases common points among fuzzy sets, i.e. points with non null membership values are very few. More specifically, in many applications, for each element u of U, there exists at most three fuzzy sets for which the membership value is ot null [3,5,6,7,12,13]. Our proposal is based on such hypotheses. Moreover, we use a technique that even though it does not restrict the shapes of membership functions, it reduces strongly the computational time for the membership values and optimizes the function memorization. In figure 1 it is represented a term set whose characteristics are common for fuzzy controllers and to which we will refer in the following. The above term set has a universe of discourse with 128 elements (so to have a good resolution), 8 fuzzy sets that describe the term set, 32 levels of discretization for the membership values. Clearly, the number of bits necessary for the given specifications are 5 for 32 truth levels, 3 for 8 membership functions and 7 for 128 levels of resolution. The memory depth is given by the dimension of the universe of the discourse (128 in our case) and it will be represented by the memory rows. The length of a world of memory is defined by: Length = nem (dm(m)＋dm(fm) Where: fm is the maximum number of non null values in every element of the universe of the discourse, dm(m) is the dimension of the values of the membership function m, dm(fm) is the dimension of the word to represent the index of the highest membership function. In our case then Length=24. The memory dimension is therefore 128*24 bits. If we had chosen to memorize all values of the membership functions we would have needed to memorize on each memory row the membership value of each element. Fuzzy sets word dimension is 8*5 bits. Therefore, the dimension of the memory would have been 128*40 bits. Coherently with our hypothesis, in fig. 1 each element of universe of the discourse has a non null membership value on at most three fuzzy sets. Focusing on the elements 32,64,96 of the universe of discourse, they will be memorized as follows: The computation of the rule weights is done by comparing those bits that represent the index of the membership function, with the word of the program memor . The output bus of the Program Memory (μCOD), is given as input a comparator (Combinatory Net). If the index is equal to the bus value then one of the non null weight derives from the rule and it is produced as output, otherwise the output is zero (fig. 2). It is clear, that the memory dimension of the antecedent is in this way reduced since only non null values are memorized. Moreover, the time performance of the system is equivalent to the performance of a system using vectorial memorization of all weights. The dimensioning of the word is influenced by some parameters of the input variable. The most important parameter is the maximum number membership functions (nfm) having a non null value in each element of the universe of discourse. From our study in the field of fuzzy system, we see that typically nfm 3 and there are at most 16 membership function. At any rate, such a value can be increased up to the physical dimensional limit of the antecedent memory. A less important role n the optimization process of the word dimension is played by the number of membership functions defined for each linguistic term. The table below shows the request word dimension as a function of such parameters and compares our proposed method with the method of vectorial memorization[10]. Summing up, the characteristics of our method are: Users are not restricted to membership functions with specific shapes. The number of the fuzzy sets and the resolution of the vertical axis have a very small influence in increasing memory space. Weight computations are done by combinatorial network and therefore the time performance of the system is equivalent to the one of the vectorial method. The number of non null membership values on any element of the universe of discourse is limited. Such a constraint is usually non very restrictive since many controllers obtain a good precision with only three non null weights. The method here briefly described has been adopted by our group in the design of an optimized version of the coprocessor described in [10].

• Journal of the Korean Society of Food Science and Nutrition
• /
• v.41 no.8
• /
• pp.1118-1133
• /
• 2012

This research aimed to suggest an efficient improvement plan for school food services by investigating the operating situation and recognition of menu management in school food services for school food service dietitians (and nutrition teachers) in Chungbuk. A total of 328 questionnaires were distributed to school food service dietitians (and nutrition teachers) in Chungbuk by e-mail in September, 2010. A total of 265 questionnaires (80.8%) were used for the analysis. The highest allocation of nutrients and calories per day in school food services was 1:1.5:1.5 (breakfast : lunch : dinner) (38.5%). The reasoning for applying a flexible allocation of nutrients and calories per day was 'considering the ratio of students who do not eat breakfast' (59.2%). And the way to apply the flexible allocation for nutrients and calories per day was 'by agreement from the school operating committee in arbitrary data without situation surveys' (86 respondents, 49.4%), and 'by agreement from the school operating committee in analysis data through situation surveys' (80 respondents, 46.0%). The operational method of standardized recipes was 'cooking management site of national education information systems' (87.5%) and the items included in standardized recipes were menu name, food material name, portion size, cooking method, nutrition analysis, and critical control point in HACCP. The main reason for not utilizing all items of a cooking management site of the national education information system was 'no big trouble in menu management even though it is used partly (29.1%). In addition, the highest use of standardized recipe was for 'maintaining consistency of food production quantity' (74.0%).