• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.1
• /
• pp.122-131
• /
• 2016

In the smart societies, such as the current unlike in the past, the voice that listeners will feel favor is changing through the development of ICT technologies and infrastructure. In other words, in the past, loud, intensive and fast voice is a favorite but now a new social and cultural situation that is changing them with ICT technologies. Now, this becomes one of the important things that we clarify 'Is it a voice that feels a favor?'. For this, in this paper, we identified what voice that listeners feel favor by applying ICT technologies. Studies were carried out to proceed largely divided into two categories. Firstly, as the quantified data, we extracted the impact on favorable feeling of listeners which related with emotional speech by empirical analysis work. To do this, we performed the experiment for the public. Secondly, we identified what kind of voice which listeners feel a good impression. For this, we identified voice characteristics that there are people who are influential in the real society. Also, we extracted both the voice characteristics of each influential people and common voice characteristics. In addition, we want to overcome the problems of qualitative methods that have originally limitations in objective respects which is significant to the voice analysis. For this, we performed the experiments of the voice analysis by numerical and visual approaches.

• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.317-326
• /
• 2009

Recently, there have been many research efforts proposed on trajectory information. Most of them mainly focus their attention on those objects moving in Euclidean space. Many real-world applications such as telematics, however, deal with objects that move only over road networks, which are highly restricted for movement. Thus, the existing methods targeting Euclidean space cannot be directly applied to the road network space. This paper proposes a new clustering scheme for a large volume of trajectory information of objects moving over road networks. To the end, we first define a trajectory on a road network as a sequence of road segments a moving object has passed by. Next, we propose a similarity measurement scheme that judges the degree of similarity by considering the total length of matched road segments. Based on such similarity measurement, we propose a new clustering algorithm for trajectories by modifying and adjusting the FastMap and hierarchical clustering schemes. To evaluate the performance of the proposed clustering scheme, we also develop a trajectory generator considering the observation that most objects tend to move from the starting point to the destination point along their shortest path, and perform a variety of experiments using the trajectories thus generated. The performance result shows that our scheme has the accuracy of over 95% in comparison with that judged by human beings.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.555-560
• /
• 2002

Subsequence matching, which consists of index searching and post-processing steps, is an operation that finds those subsequences whose changing patterns are similar to that of a given query sequence from a time-series database. This paper discusses optimization of post-processing for subsequence matching. The common problem occurred in post-processing of previous methods is to compare the candidate subsequence with the query sequence for discarding false alarms whenever each candidate subsequence appears during index searching. This makes a sequence containing candidate subsequences to be accessed multiple times from disk, and also have a candidate subsequence to be compared with the query sequence multiple times. These redundancies cause the performance of subsequence matching to degrade seriously. In this paper, we propose a new optimal method for resolving the problem. The proposed method stores ail the candidate subsequences returned by index searching into a binary search tree, and performs post-processing in a batch fashion after finishing the index searching. By this method, we are able to completely eliminate the redundancies mentioned above. For verifying the performance improvement effect of the proposed method, we perform extensive experiments using a real-life stock data set. The results reveal that the proposed method achieves 55 times to 156 times speedup over the previous methods.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.5
• /
• pp.514-520
• /
• 2018

Presence service provides various information about users such as locations, status of on/offline and network access methods, and number of presence resources required by each users increases largely in mobile environment. Therefore an effective method which can reduce load of presence servers is needed. In this paper, a large scale distributed presence service system which can distribute effectively total presence system load of presence servers using message control session has been presented. This large scale distributed presence service system provides various presence information for massive volumes of users. In this study, a new message control session architecture which can dynamically distribute loads of the presence servers to multiple servers has been presented, and a new presence information data architecture for controlling load of the presence servers has been designed. In this architecture, each presence server can exchange current load level in real time to get variance of the total system load change according to user numbers, and can distribute system load to maintain load level of each server evenly. The performance of the proposed large scale distributed presence service system has been analysed by experiments. The results has been showed that average presence resource subscription processing time reduced from 42.6% to 73.6%, and average presence notification processing time reduced from 37.6% to 64.8%.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.5
• /
• pp.67-73
• /
• 2016

Recently, wireless power transmission has attracted much interest and is the subject of much research in industry and academia. As its name implies, it is a technology which involves transferring power without wires. This paper presents the design of an ICT-based wireless power transmission system. The proposed system consists of a wireless transceiver unit and high-efficiency coil unit, which can increase both the transmission efficiency and the effective power distance. In particular, the wireless transceiver unit was designed to work with the ICT technique to enable real-time remote monitoring. Also, studies were done relating to the effect of reducing the standby power. The optimal frequency of IGBT devices used in industrial wireless power systems of 20[KHz] was utilized. The values of $23.9[{\mu}H]$ and $2.64[{\mu}F]$ were selected for L and C, respectively, through many field experiments designed to optimize the system design. In addition, an output current controlling algorithm was developed for the purpose of reducing the standby power. The results presented in this paper represent a 75[%] to 85[%] higher power transmission efficiency with a 10[%] increase in the effective power transmission distance compared with the existing systems. As a result, the proposed system exhibits a lower standby power and maintenance costs. Also, the designed wireless transceiver unit facilitates fault detection by means of user acquired data with the development of the ICT applied program.

• Journal of KIISE:Databases
• /
• v.31 no.6
• /
• pp.684-698
• /
• 2004

The Hippocratic database model recently proposed by Agrawal et al. incorporates privacy protection capabilities into relational databases. Since the Hippocratic database is based on the relational database, it needs extensions to be adapted for XML databases. In this paper, we propose the Hippocratic XML database model, an extension of the Hippocratic database model for XML databases and present an efficient access control mechanism under this model. In contrast to relational data, XML data have tree-like hierarchies. Thus, in order to manage these hierarchies of XML data, we extend and formally define such concepts presented in the Hippocratic database model as privacy preferences, privacy policies, privacy authorizations, and usage purposes of data records. Next, we present a new mechanism, which we call the authorization index, that is used in the access control mechanism. This authorization index, which is Implemented using a multi-dimensional index, allows us to efficiently search authorizations implied by the authorization granted on the nearest ancestor using the nearest neighbor search technique. Using synthetic and real data, we have performed extensive experiments comparing query processing time with those of existing access control mechanisms. The results show that the proposed access control mechanism improves the wall clock time by up to 13.6 times over the top-down access control strategy and by up to 20.3 times over the bottom-up access control strategy The major contributions of our paper are 1) extending the Hippocratic database model into the Hippocratic XML database model and 2) proposing an efficient across control mechanism that uses the authorization index and nearest neighbor search technique under this model.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.2
• /
• pp.47-56
• /
• 2015

In an energy saving server cluster environment, the power modes of servers are controlled according to load situation, that is, by making ON only minimum number of servers needed to handle current load while making the other servers OFF. This algorithm works well under normal circumstances, but does not guarantee QoS under abnormal circumstances such as sharply rising or falling loads. This is because the number of ON servers cannot be increased immediately due to the time delay for servers to turn ON from OFF. In this paper, we propose a new prediction algorithm of the power consumption for improving QoS under not only normal but also abnormal circumstances. The proposed prediction algorithm consists of two parts: prediction based on the conventional time series analysis and prediction adjustment based on trend analysis. We performed experiments using 15 PCs and compared performance for 4 types of conventional time series based prediction methods and their modified methods with our prediction algorithm. Experimental results show that Exponential Smoothing with Trend Adjusted (ESTA) and its modified ESTA (MESTA) proposed in this paper are outperforming among 4 types of prediction methods in terms of normalized QoS and number of good reponses per power consumed, and QoS of MESTA proposed in this paper is 7.5% and 3.3% better than that of conventional ESTA for artificial load pattern and real load pattern, respectively.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.11
• /
• pp.593-606
• /
• 2016

Computer simulation is widely used in a variety of computational science and engineering fields, including computational fluid dynamics, nano physics, computational chemistry, structural dynamics, and computer-aided optimal design, to simulate the behavior of a system. As the demand for the accuracy and complexity of the simulation grows, however, the cost of executing the simulation is rapidly increasing. It, therefore, is very important to lower the total execution time of the simulation especially when that simulation makes a huge number of repetitions with varying values of input parameters. In this paper we develop a simulation service system that provides the ability to predict the result of the requested simulation without actual execution for that simulation: by recording and then returning previously obtained or predicted results of that simulation. To achieve the goal of avoiding repetitive simulation, the system provides two main functionalities: (1) storing simulation-result records into database and (2) predicting from the database the result of a requested simulation using statistical machine learning techniques. In our experiments we evaluate the prediction performance of the system using real airfoil simulation result data. Our system on average showed a very low error rate at a minimum of 0.9% for a certain output variable. Using the system any user can receive the predicted outcome of her simulation promptly without actually running it, which would otherwise impose a heavy burden on computing and storage resources.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.8
• /
• pp.317-326
• /
• 2013

In this paper, we present an effective method for comparing control flow graphs which represent static structures of binary programs. To compare control flow graphs, we measure similarities by comparing instructions and syntactic information contained in basic blocks. In addition, we also consider similarities of edges, which represent control flows between basic blocks, by edge extension. Based on the comparison results of basic blocks and edges, we match most similar basic blocks in two control flow graphs, and then calculate the similarity between control flow graphs. We evaluate the proposed edge extension method in real world Java programs with respect to structural similarities of their control flow graphs. To compare the performance of the proposed method, we also performed experiments with a previous structural comparison for control flow graphs. From the experimental results, the proposed method is evaluated to have enough distinction ability between control flow graphs which have different structural characteristics. Although the method takes more time than previous method, it is evaluated to be more resilient than previous method in comparing control flow graphs which have similar structural characteristics. Control flow graph can be effectively used in program analysis and understanding, and the proposed method is expected to be applied to various areas, such as code optimization, detection of similar code, and detection of code plagiarism.

• Journal of Korea Water Resources Association
• /
• v.39 no.3 s.164
• /
• pp.241-252
• /
• 2006

Numerical models for seepage analysis are useful tools to analyze problems and design protection techniques that are related to seepage through a levee. Though every model may have its own limitations and shortcomings, there were no generalized verifications or calibrations for the commercial models. It means that users can run the model and get the result without understanding nor taking any enough training. This paper Investigates applicability and suitability of some seepage numerical models by comparing analytical solutions with experiments in the user's viewpoint. The results showed that it is more desirable to use analyses with unsaturated-unsteady condition rather than those with saturated-steady conditions, since seepage phenomenon of real levees are changed according to water level and soil property. This study also compared the calculated unsteady solutions with the calculated steady solutions for the levee at Koa of the Nakdong River The comparison revealed that as the result, the safety factor of $2.0{\sim}3.5$ has the same effects for seepage protection techniques when they are designed on the basis of steady-state analysis.