• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.149-157
• /
• 2012

In this thesis, the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join state. One approximation scenario is to provide a maximum subset of the result, with the objective of losing as few result tuples as possible. An alternative scenario is to provide a random sample of the join result, e.g., if the output of the join is being aggregated. It is shown formally that neither approximation can be addressed effectively for a sliding-window join of arbitrary input streams. Previous work has addressed only the maximum-subset problem, and has implicitly used a frequency based model of stream arrival. There exists a sampling problem for this model. More importantly, it is shown that a broad class of applications for which an age-based model of stream arrival is more appropriate, and both approximation scenarios under this new model are addressed. Finally, for the case of multiple joins being executed with an overall memory constraint, an algorithm for memory allocation across the join that optimizes a combined measure of approximation in all scenarios considered is provided.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.2 no.1
• /
• pp.10-18
• /
• 2007

In this paper, we extend the multiple time scale control framework to window-based congestion control, in particular, TCP. This is performed by interfacing TCP with a large time scale control module which adjusts the aggressiveness of bandwidth consumption behavior exhibited by TCP as a function of "large time scale" network state. i.e., conformation that exceeds the horizon of the feedback loop as determined by RTT. Performance evaluation of multiple time scale TCP is facilitated by a simulation bench-mark environment which is based on physical modeling of self-similar traffic. If source traffic is not extended exceeding, when RTT is 450ms, in self similar burst environment, performance gain of TCP-SSC is up to 45% for ${\alpha}$=1.05. However, its is acquired only 20% performance gain for ${\alpha}$=1.95 relatively. Therefore we showed that by TCP-MTS at large time scale into a rate-based feedback congestion control, we are able to improve two times performance significantly.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.983-990
• /
• 2004

Multiple-count problem is occurred when rectangle objects span across several buckets. The CD histogram is a technique which selves this problem by keeping four sub-histograms corresponding to the four points of rectangle. Although It provides exact results with constant response time, there is still a considerable issue. Since it is based on a query window which aligns with a given grid, a number of errors nay be occurred when it is applied to real applications. In this paper, we propose selectivity estimation techniques using the generalized cumulative density histogram based on two probabilistic models : \circled1 probabilistic model which considers the query window area ratio, \circled2 probabilistic model which considers intersection area between a given grid and objects. Our method has the capability of eliminating an impact of the restriction on query window which the existing cumulative density histogram has. We experimented with real datasets to evaluate the proposed methods. Experimental results show that the proposed technique is superior to the existing selectivity estimation techniques. Furthermore, selectivity estimation technique based on probabilistic model considering the intersection area is very accurate(less than 5% errors) at 20% query window. The proposed techniques can be used to accurately quantify the selectivity of the spatial range query on rectangle objects.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.117-126
• /
• 2013

Path planning is an essential problem to make virtual characters navigate in many applications including computer games. In many cases, multiple characters move in a group and qualitative aspects of planned paths are emphasized rather than optimality unlike Robotics. In this paper, we propose a two-level path planning algorithm in which the global path is planned for a single character specified as a leader and then the local path is planned to avoid dynamic obstacles while the group following this path. The space for group movement is achieved in the form of square grid array called a grid window. Member characters are located relatively to the leader within a space and moved. The static environment is reduced to the configuration space of this grid window to generate a roadmap on which a grid window can move. In local path planning, only the leader avoids dynamic obstacles by using an artificial potential field and the rest of members are located relatively to the leader in the grid window, which reduces computational load. Efficient algorithms to implement the proposed planning methods are introduced. The simulation results show that a group can handle with dynamic obstacles effectively while moving along the planned path for a static environment.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.4
• /
• pp.41-51
• /
• 2023

In this paper, we propose a technique of multi-time window feature extraction for anger detection in gait data. In the previous gait-based emotion recognition methods, the pedestrian's stride, time taken for one stride, walking speed, and forward tilt angles of the neck and thorax are calculated. Then, minimum, mean, and maximum values are calculated for the entire interval to use them as features. However, each feature does not always change uniformly over the entire interval but sometimes changes locally. Therefore, we propose a multi-time window feature extraction technique that can extract both global and local features, from long-term to short-term. In addition, we also propose an ensemble model that consists of multiple classifiers. Each classifier is trained with features extracted from different multi-time windows. To verify the effectiveness of the proposed feature extraction technique and ensemble model, a public three-dimensional gait dataset was used. The simulation results demonstrate that the proposed ensemble model achieves the best performance compared to machine learning models trained with existing feature extraction techniques for four performance evaluation metrics.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.9
• /
• pp.73-80
• /
• 2004

In this paper, we present the cell resequencing buffer to solve the cell sequence integrity problem of the Cyclic banyan network that is a high-performance fault-tolerant cell switch. By offering multiple paths between input ports and output ports, using the deflection self-routing, the Cyclic banyan switch offer high reliability, and it also solves congestion problem for the internal links of the switch. By the way, these multiple paths can be different lengths for each other. Therefore, the cells departing from an identical source port and arriving at an identical destination port can reach to the output port as the order that is different from the order arriving at input port. The proposed cell resequencing buffer is a hardware sliding window mechanism. to solve such cell sequence integrity problem. To calculate the size of sliding window that cause the prime cost of the presented device, we analyzed the distribution of the cell delay through the simulation analyses under traffic load that have a nonuniform address distribution that express tile Property of traffic of the Internet. Through these analyses, we found out that we can make a cell resequencing buffer by which the cell sequence integrity is to be secured, by using a, few of ordinary memory and control logic. The cell resequencing buffer presented in this paper can be used for other multiple paths switching networks.

• Journal of the Korean Society of Radiology
• /
• v.17 no.5
• /
• pp.791-800
• /
• 2023

This study was conducted to lay the foundation for creating a society safe from radiation by investigating the establishment of a radiation social safety net and the establishment of safety awareness and safety culture among citizens living in Busan. Data was collected through an online survey, and 200 copies of the survey were analyzed. Data were analyzed using SPSS Window Ver 28.0. To verify differences between groups, t-test and one way ANOVA were performed, and correlation analysis was performed to confirm the relationship between variables. In addition, multiple linear regression analysis was conducted to confirm the influence between variables. As a result, first, in terms of building a social safety net, citizens' safety awareness, and establishing a safety culture, the scores of the group with male gender, age in 20s, and high school graduation were found to be high. Among them, there was a statistical difference in gender at the significance level of .01 for building a social safety network and at the significance level of .05 for establishing a safety culture. In terms of occupation, there was a statistical difference between professionals and service workers at the significance level of .05 regarding the building of a radiation social safety network. Second, as a result of multiple regression analysis, it was found that 'local government radiation safety education', a subordinate factor in building a radiation social safety network, had a positive effect on citizens' safety awareness and establishment of a safety culture. Third, the results of the correlation analysis between the building of a social safety network, citizens' safety awareness, and establishment of a safety culture showed a positive correlation. Therefore, it is believed that a good radiation social safety network will have a positive impact on citizens' safety awareness and the establishment of a safety culture.

• Journal of Korean Academy of Fundamentals of Nursing
• /
• v.16 no.4
• /
• pp.506-514
• /
• 2009

Purpose: This study was conducted to define factors influencing psychosocial adaptation of patients with a permanent colostomy. Independent variables including perceived stress, stoma care self-efficacy, self-care behavior, self-esteem and family support were used to predict psychosocial adaptation. Method: The data was analyzed using the SPSS pc program window version 12.0 for descriptive statistics, Pearson correlation coefficients and stepwise multiple regression. Ninety patients with a permanent colostomy were recruited between September 2007 and May 2008. The reliability of the instruments was tested with Cronbach's alpha which ranged from .78 to .92. Result: The results were as follows: The mean psychosocial adaptation score was 3.05. There were significant correlations between all the predictive variables and psychosocial adaptation (r= .63~ -.43, p<.001). Stepwise multiple regression analysis showed that self-esteem (40%), stoma care self-efficacy (7%), perceived stress (2%), and self-care behavior (2%) accounted for 51% of the variance in psychosocial adaptation. Conclusion: These findings indicate that to improve psychosocial adaptation of patients with permanent colostomy, the major related factors identified in this study should be considered.

• Clinical and Experimental Reproductive Medicine
• /
• v.44 no.2
• /
• pp.105-110
• /
• 2017

Objective: The purpose of this study was to evaluate the efficacy of frozen mixed double-embryo transfer (MDET; the simultaneous transfer of day 3 and day 5 embryos) in comparison with frozen blastocyst double-embryo transfer (BDET; transfer of two day 5 blastocysts) in patients with repeated implantation failure (RIF). Methods: A total of 104 women with RIF who underwent frozen MDET (n = 48) or BDET (n = 56) with excellent-quality embryos were included in this retrospective analysis. All frozen embryo transfers were performed in natural cycles. The main outcome measures were the implantation rate, clinical pregnancy rate, multiple pregnancy rate, and miscarriage rate. These measures were compared between the patients who underwent MDET or BDET using the chi-square test or the Fisher exact test, as appropriate. Results: The implantation and clinical pregnancy rates were significantly higher in patients who underwent MDET than in those who underwent BDET (60.4% vs. 39.3%, p=0.03 and 52.1% vs. 30.4%, p=0.05, respectively). A significantly lower miscarriage rate was observed in the MDET group (6.9% vs. 10.7%, p=0.05). In addition, the multiple pregnancy rate was slightly, but not significantly, higher in the MDET group (27.1% vs. 25.0%). Conclusion: MDET was found to be significantly superior to double blastocyst transfer. It could be regarded as an appropriate approach to improve in vitro fertilization success rates in RIF patients.

• Proceedings of the KSME Conference
• /
• 2001.06e
• /
• pp.536-541
• /
• 2001

A high resolution digital cinematic Particle Image Velocimetry(PIV) has been developed. The system consists of a high speed CCD camera, a continuous Ar-ion laser and a computer with camera controller. To improve the spatial resolution, we adopt a Recursive Technique for velocity interrogation. At first, we obtain a velocity vector for a larger interrogation window size based on the conventional two-frame cross-correlation PIV analysis using the FFT algorithm. Based on the knowing velocity information, more spatially resolved velocity vectors are obtained in the next iteration step with smaller interrogation windows. The correct velocity vector at the first step is found to be critical, so we apply a Multiple Correlation Validation(MCV) technique in order to decrease the spurious vectors. The MCV technique turns out to improve SNR(Signal to Noise Ratio) of the correlation table. The developed cinematic PIV method has been applied to the measurement of the unsteady flow characteristics of a Rushton turbine mixer. A total of 3,245 instantaneous velocity vectors were successfully obtained with 4 ms time resolution. The acquired spatial resolution corresponds the performance of the conventional high resolution digital PIV system using a $1K{\times}1K$ CCD camera.