• Journal of Radiation Protection and Research
• /
• v.17 no.1
• /
• pp.43-56
• /
• 1992

As one of the methods to ameliorate the ray effects which are the nature of anomalous computational effects due to the discretization of the angular variable in discrete ordinates approximations, a computational program, named TWODET (TWO dimensional Discrete Element Transport), has developed in 2 dimensional cartesian coordinates system using the discrete elements method, in which the discrete angle quadratures are steered by the spatially dependent angular fluxes. The results of the TWODET calculation with K-2, L-3 discrete angular quadratures, in the problem of a centrally located, isotropically emitting flat source in an absorbing square, are shown to be more accurate than that of the DOT 4.3 calculation with S-10 full symmetry angular quadratures, in remedy of the ray effect at the edge flux distributions of the square. But the computing time of the TWODET is about 4 times more than that of the DOT 4.3. In the problem of vacuum boundaries just outside of the source region in an absorbing square, the results of the TWODET calculation are shown severely anomalous ray effects, due to the sudden discontinuity between the source and the vacuum, like as the results of the DOT 4.3 calculation. In the probelm of an external source in an absorbing square in which a highly absorbing medium is added, the results of the TWODET calculation with K-3, L-4 show a good ones like as, somewhat more than, that of the DOT 4.3 calculation with S-10.

• Journal of Intelligence and Information Systems
• /
• v.15 no.2
• /
• pp.97-111
• /
• 2009

Context-aware computing, as a core of smart space development, has been widely regarded as useful in realizing individual service provision. However, most of context-aware services so fat are in its early stage to be dispatched for actual usage in the real world, caused mainly by user's privacy concerns. Moreover, since legacy context-aware services have focused on acquiring in an automatic manner the extra-personal context such as location, weather and objects near by, the services are very limited in terms of quality and variety if the service should identify intra-personal context such as attitudes and privacy concern, which are in fact very useful to select the relevant and timely services to a user. Hence, the purpose of this paper is to propose a novel methodology to infer the user's privacy concern as intra-personal context in an intelligent manner. The proposed methodology includes a variety of stimuli from outside the person and then performs model-based reasoning with social theory models from model base to predict the user's level of privacy concern semi-automatically. To show the feasibility of the proposed methodology, a survey has been performed to examine the performance of the proposed methodology.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.4
• /
• pp.457-467
• /
• 2002

In order to simulate cyber attacks and predict network behavior by attacks, we should represent attributes of network components in the simulation model, and should express characteristics of systems that carry out various cyber attacks and defend from these attacks. To simulate how network load may change under the cyber attacks, we extended SSF[9, 10] that is process-based event-oriented simulation system. We added a firewall class and a packet manipulator into the SSFNet that is a component of SSF. The firewall class, which is related to the security, is to simulate cyber attacks, and the packet manipulator is a set of functions to write attack programs for the simulation. The extended SSFNet enables to simulate a network with the security systems and provides advantages that make easy to port already exsiting attack programs and apply them to the simulation evironment. We made a vitual network model to verify operations of the added classes, and simulated a smurf attack that is a representative denial of sevive attack, and observed the network behavior under the smurf attack. The results showed that the firewall class and packet manipulator developed in this paper worked normaly.

• Journal of KIISE:Software and Applications
• /
• v.29 no.9
• /
• pp.669-675
• /
• 2002

In recent years most of personalized recommender systems in electronic commerce utilize collaborative filtering algorithm in order to recommend more appropriate items. User-based collaborative filtering is based on the ratings of other users who have similar preferences to a user in order to predict the rating of an item that the user hasn't seen yet. This nay decrease the accuracy of prediction because the similarity between two users is computed with respect to the two users and only when an item has been rated by the users. In item-based collaborative filtering, the preference of an item is predicted based on the similarity between the item and each of other items that have rated by users. This method, however, uses the ratings of users who are not the neighbors of a user for computing the similarity between a pair of items. Hence item-based collaborative filtering may degrade the accuracy of a recommender system. In this paper, we present a new approach that a user's neighborhood is used when we compute the similarity between the items in traditional item-based collaborative filtering in order to compensate the weak points of the current item-based collaborative filtering and to improve the prediction accuracy. We empirically evaluate the accuracy of our approach to compare with several different collaborative filtering approaches using the EachMovie collaborative filtering data set. The experimental results show that our approach provides better quality in prediction and recommendation list than other collaborative filtering approaches.

• The KIPS Transactions:PartA
• /
• v.19A no.3
• /
• pp.139-146
• /
• 2012

In the server cluster environment, one of the ways saving energy is to control server's power according to traffic conditions. This is to determine the ON/OFF state of servers according to energy usage of data center and each server. To do this, we need a way to estimate each server's energy. In this paper, we use a software-based power consumption estimation model because it is more efficient than the hardware model using power meter in terms of energy and cost. The traditional software-based power consumption estimation model has a drawback in that it doesn't know well the computing status of servers because it uses only the idle status field of CPU. Therefore it doesn't estimate consumption power effectively. In this paper, we present a CPU field based power consumption estimation model to estimate more accurate than the two traditional models (CPU/Disk/Memory utilization based power consumption estimation model and CPU idle utilization based power consumption estimation model) by using the various status fields of CPU to get the CPU status of servers and the overall status of system. We performed experiments using 2 PCs and compared the power consumption estimated by the power consumption model (software) with that measured by the power meter (hardware). The experimental results show that the traditional model has about 8-15% average error rate but our proposed model has about 2% average error rate.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.151-164
• /
• 2009

The importance of sensor networks as a base of ubiquitous computing realization is being highlighted, and espicially the security is recognized as an important research isuue, because of their characteristics.Several efforts are underway to provide security services in sensor networks, but most of them are preventive approaches based on cryptography. However, sensor nodes are extremely vulnerable to capture or key compromise. To ensure the security of the network, it is critical to develop security Intrusion Detection System (IDS) that can survive malicious attacks from "insiders" who have access to keying materials or the full control of some nodes, taking their charateristics into consideration. In this perper, we design a distributed and adaptive IDS architecture on sensor networks, respecting both of energy efficiency and IDS efficiency. Utilizing a modified HEED algorithm, a clustering algorithm, distributed IDS nodes (dIDS) are selected according to node's residual energy and degree. Then the monitoring results of dIDSswith detection codes are transferred to dIDSs in next round, in order to perform consecutive and integrated IDS process and urgent report are sent through high priority messages. With the simulation we show that the superiorities of our architecture in the the efficiency, overhead, and detection capability view, in comparison with a recent existent research, adaptive IDS.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2587-2596
• /
• 1999

Recently, by the extension of skills like LAN, the wireless telecommunication network and the satelite services make it possible for the mobile computer users to access a database. A method to use the replicated database on a server to get new data without missing any information has been being studied. So far we have used the Static Replica Allocation(SRA) for the replication which is the method of the replication on the server. This method is to replicate the data on the replica server after a moving host is transferred to a cell. Since the network of the SRA is very good, and if there are few moving users, no trouble will happen. But if there is no moving users in a cell, the data will not be shared. Therefore, this paper is about the study of the method of relocation after replicating the data to the cells for the users(User Select Replica Allocation : USRA). We also analyze the access rate and the possibility which are closely related to the moving frequency of the mobile hosts and the numbers of the cells. As a result, We show that the 120% lower access cost and the 40%∼50% gains are achieved from the low mobility

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.2
• /
• pp.901-908
• /
• 2011

For the available grid environmental realization, the resource supply PC must have to provide an appropriate security function of their operation environments. SKY@HOME is a kind of the grid computing environments. If this has not supervised by administrator handling smoothly, it is inherently vulnerable state to the security level of the grid environments, because the resource supply PC is not update a security function without delay. It is also have the troublesome problems which have to install of an additional security program for support the appropriate security. This paper proposes an integration security model on the policy-based that provides an update each level according to the situation of the resource supply PC for improving its problems as a security aspect of the SKY@HOME. This model analyzes the security state of the resource supply PC respectively, and then the result is available to provide an appropriate security of the resource supply PC using an integration security model. The proposed model is not need additionally to buy and install the software, because it is provided the security management server oriented service. It is also able to set up the suit security function of a characteristic of the each resource supply PC. As a result, this paper clearly show the participation of resource supply PC improved about 20%.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.301-315
• /
• 2010

Recently, competition between companies has intensified and so has the necessity of creating a new business value inventions has increased. A numbers of Business organizations are beginning to realize the importance of business process management. Processes however can often not go the way they were initially designed or non-efficient performance process model could be designed. This can be due to a lack of cooperation and understanding between business analysts and system developers. To solve this problem, business process mining which can be used as the basis of the business process re-engineering has been recognized to an important concept. Current process mining research has only focused their attention on extracting workflow-based process model from competed process logs. Thus there have a limitations in expressing various forms of business processes. The disadvantage in this method is process discovering time and log scanning time in itself take a considerable amount of time. This is due to the re-scanning of the process logs with each new update. In this paper, we will presents a modified FP-Tree algorithm for FP-Tree based business processes, which are used for association analysis in data mining. Our modified algorithm supports the discovery of the appropriate level of process model according to the user's need without re-scanning the entire process logs during updated.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.10
• /
• pp.1277-1286
• /
• 2018

In this paper, we provide flexible scalability of computing resources in cloud environment and Apache Hadoop based cloud environment for analysis of public medical information big data. In fact, it includes the ability to quickly and flexibly extend storage, memory, and other resources in a situation where log data accumulates or grows over time. In addition, when real-time analysis of accumulated unstructured log data is required, the system adopts Hadoop-based analysis module to overcome the processing limit of existing analysis tools. Therefore, it provides a function to perform parallel distributed processing of a large amount of log data quickly and reliably. Perform frequency analysis and chi-square test for big data analysis. In addition, multivariate logistic regression analysis of significance level 0.05 and multivariate logistic regression analysis of meaningful variables (p<0.05) were performed. Multivariate logistic regression analysis was performed for each model 3.