• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.31 no.4
• /
• pp.326-339
• /
• 1995

In this paper, the validity of the numerical model of fishes' behavior presented in our earlier paper was examined by the whiteness test on the residual of numerical model and by the comparison between experiment and simulation on several indexes represented by fishes' swimming characteristics. The validity of the numerical model was proved statistically by means of the whiteness test of the residual. The similarity was confirmed by comparison between experiment and simulation for the swimming trajectory of fishes, the mean distance of individual from wall, the mean swimming speed and the mean distance between the nearest individuals. These results suggest that the behavior of fishes according to the flow speed in three-dimensional space can be estimated partially by the numerical model presented in our earlier paper. However, a long-term approach to improve the modeling technique on the behavior of fishes may be needed before applying the numerical model presented in our earlier paper to real fishing ground.

• Journal of Korea Multimedia Society
• /
• v.8 no.3
• /
• pp.297-312
• /
• 2005

Aggregation is an operation that plays a key role in multidimensional OLAP (MOLAP) systems of data warehouse. Existing aggregation operations in MOLAP have been proposed for file structures such as multidimensional arrays. These tile structures do not work well with skewed distributions. This paper presents a physical design methodology for storage structures ni MOLAP that use the multidimensional tile organizations adapting to a skewed distribution. In uniform data distribution, we first show that the performance of multidimensional analytical processing is highly affected by the similarity of the shapes between query regions and page regions in the domain space of the multidimensional file organizations. And than, in skewed distributions, we reflect the effect of data distributions on the design by using the shapes of the normalized query regions that are weighted with data density of those query regions. Finally, we demonstrate that the physical design methodology theoretically derived is indeed correct in real environments. In the two-dimensional file organizations, the results of experiments indicate that the performance of the proposed method is enhanced by more than seven times over the conventional method. We expect that the performance will be more enhanced when the dimensionality is more than two. The result confirms that the proposed physical design methodology is useful in a practical way.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.1087-1094
• /
• 2009

As online community was revitalized, the internet became the second space for people's everyday life. People enter into a connection with other on-line members and they maintain and extend their relationships. Such relationships can be analyzed and visualized with social network analysis. The method oftentimes envisions the structural elements of complex social life. The study aims at visualizing the relationships among the Cyworld users and designs an application "Blow Blow Your Pinwheel", the main purpose of this application is visualizing social relationships between ego and '1chons' which is a concept of friendship in Cyworld. Designing such an application, the study focuses on closeness of relationships which we think is composed of 1)proximity 2)similarity, 3)familiarity, and 4)reciprocity. The study used these concepts in measuring the strength of relationship between ego and other 1chons(friends). Specifically, we devised survey questionnaires which asked users to evaluate the importance of the above factors of closeness, and implemented the result in calculating the strength of the relationship between ego and other by giving weights for each factor. These measurements then were applied in visualizing the relationships in the application, we designed. Through the application, we can compare on-line relationships with off-line relationships and attempt for the new approach of Social Networks.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.5
• /
• pp.981-986
• /
• 2020

The Internet of Things refers to a space-of-things connection network configured to allow things with built-in sensors and communication functions to interact with people and other things, regardless of the restriction of place or time.IoT is a network developed for the purpose of services for human convenience, but the scope of its use is expanding across industries such as power transmission, energy management, and factory automation. However, the communication protocol of IoT, MQTT, is a lightweight message transmission protocol based on the push technology and has a security vulnerability, and this suggests that there are risks such as personal information infringement or industrial information leakage. To solve this problem, we designed a synchronous MQTT security channel that creates a secure channel by using the characteristic that different chaotic dynamical systems are synchronized with arbitrary values in the lightweight message transmission MQTT protocol. The communication channel we designed is a method of transmitting information to the noise channel by using characteristics such as random number similarity of chaotic signals, sensitivity to initial value, and reproducibility of signals. The encryption method synchronized with the proposed key value is a method optimized for the lightweight message transmission protocol, and if applied to the MQTT of IoT, it is believed to be effective in creating a secure channel.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.5
• /
• pp.2315-2321
• /
• 2013

This study attempt to develope and suggest a new, minimize side effects process for calculate a time to peak enhancement of contrast level by using blood flow instead of current mathematical process. We conducted a studies 127 patients who performed the CE MRA by using test-contrast inject way. We used measurements of a contrast inflow time and time to peak enhancement of contrast level of each cerebrovascular branch for similarity of witch cerebrovascular branch calculate a time to peak enhancement of contrast level by using blood flow in image compared with calculation a time to peak enhancement of contrast level by using current mathematical process after contrast enhancement. In this study, confidence interval were used if the variable is continuous variable; there is differences between 4 groups exist but in group 1, there is no difference with time in peak enhancement of contrast level by using mathematical method to inflow time in sinus sigmoideus. it was significant statistically, in addition there was significant low heterogeneity in Bland Altman plot. Thus, apply a new calculate a time to peak enhancement of contrast level by using blood flow method will minimize damage caused by side effect, maintain quality of image, easy and fast access. It should provide a space for the exchange of current calculate a time to peak enhancement of contrast level by using mathematical process.

• Korean Institute of Interior Design Journal
• /
• no.14
• /
• pp.82-89
• /
• 1998

During the boom of museum building in the 1970s-80s two museum wee erected in Germany. They are James Stirling's Neue Stattsgalerie Stuttgart and hans Hollein's Stadtisches Museum Abteiberg Monchengladbach, These two museums share the folowing point of similarity : Stirling's Neue Stattsgalerie Stuttgart and Hollein's Staditisches Museum Abetiberg Monchenbladbach both manifest the conditions of the times in light of their respective cities' local characters and historical contexts without being bound to traditional formality. Stirling and Hollein attempted to grasp the meaning of the 기nuseum as a city in miniature." Taking into account the t two museums’s territorial characteristics of being situated on a slope, both Stirling and Hollein made the walker to pass t through their building complex and introduced the concept of a public square within them. As a result, the museums are not j just two large buildings but are architecture composed of a collage of various structures. S Stirling’s architecture employs the method of attaching additional elements on top of basic constituents, which is suggestive '||'&'||'#61551; of the historical fragment from Shinkel's Altes Museum. On the other hand, Hollein applies a collage-style method as if he w were doing urban planning, maintaining the distinctiveness of each of the various forms and materials of buildings. T The object style buildings of the two museums actively demonstrate the contrast of double meaning to represent the a ambiguous and multifarious characteristics of the modern times. Stirling explores the theme of opposition and coexistence in h his Neue Stattsgalerie Stuttgart by placing a series of opposing concepts, such as the past and present and histor${\gamma}$ and t technology, in one space. Thereby, the contradiction and its appeal are manifested. Hollein made use of the visual illusion and c contradiction in alluding to the irony of the modern reality induced by nature and culture and history and technology. F For the above reasons and methods, James Stirling ’ s Neue Stattsgalerie Stuttgart allowed the penetration of art into daily l life and became the general public’s favored museum for its free and unrestrained environment. Likewise, Hans Hollein’s S Stadtisches Museum Abteiberg Moncbengladbach contribute to the development of museum function as it an expression of art i in the form of a complex piece of scupture on its own.ts own.

• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.304-314
• /
• 2007

Content Based Image Retrieval (CBIR) is to store and retrieve images using the feature description of image contents. In order to support more accurate image retrieval, it has become necessary to develop features that can effectively describe image contents. The commonly used low-level features, such as color, texture, and shape features may not be directly mapped to human visual perception. In addition, such features cannot effectively describe a single image that contains multiple objects of interest. As a result, the research on feature descriptions has shifted to focus on higher-level features, which support representations more similar to human visual perception like spatial relationships between objects. Nevertheless, the prior works on the representation of spatial relations still have shortcomings, particularly with respect to supporting rotational invariance, Rotational invariance is a key requirement for a feature description to provide robust and accurate retrieval of images. This paper proposes a high-level feature named 8AB (8 Angular Bin) that effectively describes the spatial relations of objects in an image while providing rotational invariance. With this representation, a similarity calculation and a retrieval technique are also proposed. In addition, this paper proposes a search-space pruning technique, which supports efficient image retrieval using the 8AB feature. The 8AB feature is incorporated into a CBIR system, and the experiments over both real and synthetic image sets show the effectiveness of 8AB as a high-level feature and the efficiency of the pruning technique.

• Journal of KIISE:Software and Applications
• /
• v.35 no.11
• /
• pp.671-680
• /
• 2008

Motion capture devices have been utilized in producing several contents, such as movies and video games. However, since motion capture devices are expensive and inconvenient to use, motions segmented from captured data was recycled and synthesized to utilize it in another contents, but the motions were generally segmented by contents producers in manual. Therefore, automatic motion segmentation is recently getting a lot of attentions. Previous approaches are divided into on-line and off-line, where ow line approaches segment motions based on similarities between neighboring frames and off-line approaches segment motions by capturing the global characteristics in feature space. In this paper, we propose a graph-based high-level motion segmentation method. Since high-level motions consist of repeated frames within temporal distances, we consider similarities between neighboring frames as well as all similarities among all frames within the temporal distance. This is achieved by constructing a graph, where each vertex represents a frame and the edges between the frames are weighted by their similarity. Then, normalized cuts algorithm is used to partition the constructed graph into several sub-graphs by globally finding minimum cuts. In the experiments, the results using the proposed method showed better performance than PCA-based method in on-line and GMM-based method in off-line, as the proposed method globally segment motions from the graph constructed based similarities between neighboring frames as well as similarities among all frames within temporal distances.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.173-184
• /
• 2002

This paper discuss an index-based subsequence matching that supports time warping in large sequence databases. Time warping enables finding sequences with similar patterns even when they are of different lengths. In earlier work, Kim et al. suggested an efficient method for whole matching under time warping. This method constructs a multidimensional index on a set of feature vectors, which are invariant to time warping, from data sequences. For filtering at feature space, it also applies a lower-bound function, which consistently underestimates the time warping distance as well as satisfies the triangular inequality. In this paper, we incorporate the prefix-querying approach based on sliding windows into the earlier approach. For indexing, we extract a feature vector from every subsequence inside a sliding window and construct a multidimensional index using a feature vector as indexing attributes. For query processing, we perform a series of index searches using the feature vectors of qualifying query prefixes. Our approach provides effective and scalable subsequence matching even with a large volume of a database. We also prove that our approach does not incur false dismissal. To verify the superiority of our approach, we perform extensive experiments. The results reveal that our approach achieves significant speedup with real-world S&P 500 stock data and with very large synthetic data.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.1 s.307
• /
• pp.55-66
• /
• 2006

We propose a progressive image retrieval method based on an efficient combination of multiresolution color and torture features in wavelet transform domain. As a color feature, color autocorrelogram of the hue and saturation components is chosen. As texture features, BDIP and BVLC moments of the value component are chosen. For the selected features, we obtain multiresolution feature vectors which are extracted from all decomposition levels in wavelet domain. The multiresolution feature vectors of the color and texture features are efficiently combined by the normalization depending on their dimensions and standard deviation vector, respectively, vector components of the features are efficiently quantized in consideration of their storage space, and computational complexity in similarity computation is reduced by using progressive retrieval strategy. Experimental results show that the proposed method yields average $15\%$ better performance in precision vs. recall and average 0.2 in ANMRR than the methods using color histogram color autocorrelogram SCD, CSD, wavelet moments, EHD, BDIP and BVLC moments, and combination of color histogram and wavelet moments, respectively. Specially, the proposed method shows an excellent performance over the other methods in image DBs contained images of various resolutions.