• Korean Journal of Food Science and Technology
• /
• v.38 no.4
• /
• pp.589-593
• /
• 2006

The objective of this study was to evaluate the use of fuzzy math strategy to calculate variability and uncertainty in quantitative risk assessment. We compared the propagation of uncertainty using fuzzy math simulation with Monte Carlo simulation. The risk far Listeria monocytogenes contamination was estimated for carcass and processed pork by fuzzy math and Monte Carlo simulations, respectively. The data used in these simulations were taken from a recent report on pork production. In carcass, the mean values for the risk from fuzzy math and Monte Carlo simulations were -4.393 log $CFU/cm^2$ and -4.589 log $CFU/cm^2$, respectively; in processed pork, they were -4.185 log $CFU/cm^2$ and -4.466 log $CFU/cm^2$ respectively. The distribution of values obtained using the fuzzy math simulation included all of the results obtained using the Monte Carlo simulation. Consequently, fuzzy math simulation was found to be a good alternative to Monte Carlo simulation in quantitative risk assessment of pork production.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.135-139
• /
• 2012

The wide diffusion of internet and the overall increased reliance on technology for information communication, dissemination and gathering have created an unparalleled mass of data. Sifting through this data is defining and will define in the foreseeable future a big part of contemporary computer science. Within this data, a growing proportion is given by personal information, which represents a unique opportunity to study human activities extensively and live. One important recurring challenge in many disciplines is the problem of people re-identification. In its broadest definition, re-identification is the problem of newly recognizing previously identified people, such as following an unknown person while he walks through many different surveillance cameras in different locations. Our goals is to review how several diverse disciplines define and meet this challenge, from person re-identification in video-surveillance to authorship attribution in text samples to distinguishing users based on their preferences of pictures. We further envision a situation where multidisciplinary solutions might be beneficial.

• Science of Emotion and Sensibility
• /
• v.16 no.1
• /
• pp.117-124
• /
• 2013

This study examined that how precisely MFCC, LPC, energy, and pitch related parameters of the speech data, which have been used mainly for voice recognition system could predict the vocal emotion categories as well as dimensions of vocal emotion. 110 college students participated in this experiment. For more realistic emotional response, we used well defined emotion-inducing stimuli. This study analyzed the relationship between the parameters of MFCC, LPC, energy, and pitch of the speech data and four emotional dimensions (valence, arousal, intensity, and potency). Because dimensional approach is more useful for realistic emotion classification. It results in the best vocal cue parameters for predicting each of dimensions by stepwise multiple regression analysis. Emotion categorizing accuracy analyzed by LDA is 62.7%, and four dimension regression models are statistically significant, p<.001. Consequently, this result showed the possibility that the parameters could also be applied to spontaneous vocal emotion recognition.

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

In recent years, social networks come into the spotlight as the important ways to find people or share information. Especially, existing social network services based on the Internet, such as Facebook.com and Cyworld.com, are now extended into the mobile environment. A mobile phone easily collects the personal information since it is carried by the user at all times, and various types of data can be gathered together with the advance of sensor technologies. These features differentiate the mobile social network services from the previous Internet-based services. In this paper, we estimate the user's mobile social contexts like closeness and relationship between the user and surrounding people using Bayesian networks. The mobile social contexts can be employed as important information for providing mobile social network services, and experimental results on real world data have verified their possibilities.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.351-359
• /
• 2009

Recently with increase of data in the Internet, platform technologies that can process huge data effectively such as Google platform and Hadoop are regarded as worthy of notice. In this kind of platform, there exist network I/O overheads to send task outputs due to the MapReduce operation which is a programming model to support parallel computation in the large cluster system. In this paper, we suggest applying of TIPC (Transparent Inter-Process Communication) protocol for reducing network I/O overheads and increasing network performance in the distributed computing environments. TIPC has a lightweight protocol stack and it spends relatively less CPU time than TCP because of its simple connection establishment and logical addressing. In this paper, we analyze main features of the Hadoop-based distributed computing system, and we build an experimental model which can be used for experiments to compare the performance of various protocols. In the experimental result, TIPC has a higher bandwidth and lower CPU overheads than other protocols.

• Journal of KIISE
• /
• v.43 no.8
• /
• pp.841-847
• /
• 2016

As network technology advances, a larger number of devices are connected through the Internet. Recently, cloud storage services are gaining popularity, as they are convenient to access anytime and anywhere. Among cloud storage services, object storage is the representative one due to their characteristics of low cost, high availability, and high durability. One limitation of object storage services is that they can access data on the cloud only through the HTTP-based RESTful APIs. In our work, we resolve this limitation with the in-memory file system which provides a POSIX interface to the file system users and communicates with cloud object storages with RESTful APIs. In particular, our flush mechanism is compatible with existing file systems, as it is based on the swap mechanism of the Linux kernel. Our in-memory file system backed by cloud storage reduces the performance overheads and shows a better performance than S3QL by 57% in write operations. It also shows a comparable performance to tmpfs in read operations.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.163-176
• /
• 2016

The contention overhead on the same channel in an NoC architecture can significantly increase a communication delay due to the simultaneous communication requests that occur. To reduce the overall overhead, we propose task-to-tile binding techniques for an NoC-based manycore platform, whereby it is assumed that the task mapping decision has already made. Since the NoC architecture may have multiple memory tiles as its size grows, memory clustering is used to balance the load of memory by making applications access different memory tiles. We assume that the information on the communication overhead of each application is known since it is specified in a dataflow task graph. Using this information, this paper proposes two heurisitics that perform binding of multiple tasks at once based on a proper memory clustering method. Experiments with an NoC simulator prove that the proposed heurisitic shows performance gains that are 25% greater than that of the previous binding heuristic.

• Journal of Korean Society for Geospatial Information Science
• /
• v.17 no.3
• /
• pp.109-114
• /
• 2009

Although island is great worth in ecology, environmental conservation and important territory as a national land for developing the marine, the bottom of the sea and also ecological studying field for the ages to come, it has not been managed because of lack of a scientific surveying. In the case of a cadastral record, inaccessible islands have not been registered in current cadastral record because of the limit of surveying technology in 1910. Therefore, a scientific investigation and systematic management about unregistered islands are necessary. But, a airborne laser scanning system is possible to acquire an accurate positions with digital images about inaccessible islands. Therefore, scientific detection of unregistered islands became possible. This paper presented the results of the shoreline extraction around the Heuksan island using Lidar data and the detection of unregistered islands comparing the cadastral map to the ortho-image. Also, we presented the extraction technique of unregistered islands by calculating their positions and areas. As a result, we extracted effectively 16 unregistered islands around the Heuksan island.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.480-488
• /
• 2016

Search-Based Software Testing (SBST) is an effective technique for test data generation on large domain size. Although the performance of SBST seems to be affected by the structural characteristics of Software Under Test (SUT), studies for the comparison of SBST techniques considering structural characteristics are rare. In addition to the comparison study for SBST, we analyzed the best algorithm with different structural characteristics of SUT. For the generalization of experimental results, we automatically generated 19,800 SUTs by combining four metrics, which are expected to affect the performance of SBST. According to the experiment results, Genetic algorithm showed the best performance for SUTs with high complexity and test data evaluation with count ${\leq}20,000$. On the other hand, the genetic simulated annealing and the simulated annealing showed relatively better performance for SUTs with high complexity and test data evaluation with count ${\geq}50,000$. Genetic simulated annealing, simulated annealing and hill climbing showed better performance for SUTs with low complexity.

• KIISE Transactions on Computing Practices
• /
• v.21 no.3
• /
• pp.183-191
• /
• 2015

Recent developments in IT have made real-time ECG monitoring possible, and this represents a promising application for the emerging HL7 standard for the exchange of clinical information. However, applying the HL7 standard directly to real-time ECG monitoring causes problems, because the partial duplication of data within an HL7 message increases the amount of data to be transmitted, and the time taken to process it. We reduce these overheads by Feature Scaling, by standardizing the range of independent variables or features of data, while nevertheless generating HL7-compliant messages. We also use a De-Duplication algorithm to eliminate the partial repetition of the OBX field in an HL7 ORU message. Our strategy shortens the time required to create messages by 51%, and reduces the size of messages by 1/8, compared to naive HL7 coding.