• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 1993.04a
• /
• pp.93-100
• /
• 1993

With increasing technology, requirement to car noise and related dynamics are getting competitive keypoint. Unfortunately, vibro - acoustic behavior of a car is nowadays only possible after development of prototypes. But, obviously, in the Area of Research, many of Industrials, Universities and research centers try to codevelop the design tools to predict the vibro-acoustic behaviors. At this stage, it is more realistic to represent the existing technologies in order for the engineer to get their own know-how to design and to Integrate existing techniques, to setup their test facility, and to develope some tools with which they can successfully predict noise levels of car in the design phase. Moreover, most of the theories which will be represented in this paper can be used in the design phase. At any way, finding the cause of trouble shooting is more urgent than the design of a car to the test engineer. In this paper, transfer path analysis, noise source identification, and the key test method of modal analysis is introduced. Later, if I get the opportunity to present in KSNVE, the approach method of modal analysis is introduced. Later, if I get the opportunity to present in KSNVE, the approach method of finding characteristics of joint and welding part will be introduced. Most parts of this paper was quoted from the papers of LMS.

• Management Science and Financial Engineering
• /
• v.12 no.2
• /
• pp.87-110
• /
• 2006

In a hierarchical road network, all roads can be classified according to their attributes such as speed limit, number of lanes, etc. By splitting the whole road network into the subnetworks of the highlevel and low-level roads, we can reduce the size of the network to be calculated at once, and find a path in the way that drivers usually adopt when searching out a travel route. To exploit the hierarchical property of road networks, we define a convenient path and propose an algorithm for finding convenient paths. We introduce a parameter indicating the driver's tolerance to the difference between the length of a convenient path and that of a shortest convenient path. From this parameter, we can determine how far we have to search for the entering and exiting gateway. We also propose some techniques for reducing the number of pairs of entries and exits to be searched in a road network. A result of the computational experiment on a real road network is given to show the efficiency of the proposed algorithm.

• The Korean Nurse
• /
• v.31 no.5
• /
• pp.29-38
• /
• 1992

The purpose of this is to find the anxiety score of OHS pt's family and general surgery pt's family and to offer basic data. The subjects of this study were 80 : 40 were OHS pt's family in Seoul Hospital and remaining 40 were OS pt's family in Capital Hospital. The data was collected between March 1, through May 30, 1992. The instruments used for this study were Zung's The Self-Rating Anxiety Scale. The collected daLa were analyzed using percentage, descriptive statistics, $X^2-test$, t-test and Two-way Anova. The finding's were as followed: 1. Test of hypothesis "The anxiety score of the Ol-lS pt's family were similar to as pt's family" was rejected (L=0.772 P>.05) 2. The mean score of anxiety of the OHS pt's family was 1.772, The mean score of anxiety of the OS pt's family was 1,790. 3. The relationship between anxiety of the OHS pt's family and GS pt's family and family's age was significant (P<.Ol) and the relationship between anxiety and age interaction effect. (F=242.0 P<.01) In conclusion, the anxiety score of the OI-IS pt's finding and GS pt's family was all high.

• BMB Reports
• /
• v.37 no.6
• /
• pp.648-656
• /
• 2004

This paper deals with the development of a predictive probabilistic model, a composite dependency-reflecting model (CDRM), which was designed to detect core promoter regions and transcription start sites (TSS) in vertebrate genomic DNA sequences, an issue of some importance for genome annotation. The model actually represents a combination of first-, second-, third- and much higher order or long-range dependencies obtained using the expanded maximal dependency decomposition (EMDD) procedure, which iteratively decomposes data sets into subsets on the basis of dependency degree and patterns inherent in the target promoter region to be modeled. In addition, decomposed subsets are modeled by using a first-order Markov model, allowing the predictive model to reflect dependency between adjacent positions explicitly. In this way, the CDRM allows for potentially complex dependencies between positions in the core promoter region. Such complex dependencies may be closely related to the biological and structural contexts since promoter elements are present in various combinations separated by various distances in the sequence. Thus, CDRM may be appropriate for recognizing core promoter regions and TSSs in vertebrate genomic contig. To demonstrate the effectiveness of our algorithm, we tested it using standardized data and real core promoters, and compared it with some current representative promoter-finding algorithms. The developed algorithm showed better accuracy in terms of specificity and sensitivity than the promoter-finding ones used in performance comparison.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.457-465
• /
• 2007

Native information provider(IP) anycast suffers from routing scalability issues and the lack of stateful communication support. For this reason, we propose architecture for scalable and transparent anycast services(ASTAS), a proxy-based architecture that provides support for stateful anycast communications, while retaining the transparency offered by native anycast. Dynamic resource assignment for each initiated session guarantees that a connection is established with the most suitable target server, based on network and server conditions. Traffic engineering in the overlay can be realized in an effective way due to the dissemination of aggregated state information in the anycast overlay. To minimize the total deployment cost for ASTAS architectures, we propose optimized proxy placement and path finding heuristics based on look-ahead information gathered in network nodes. Contrary to a regular integer linear program(ILP) formulation, these heuristics allow to optimize proxy placement in large networks. A use case on a European reference network illustrates that lower proxy costs enable proxy deployment closer to the end-users, resulting in a reduced network load.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1998.04a
• /
• pp.93-100
• /
• 1998

The basic systems of spatial structures such as shells, membrane, cable-nets and tensegrity structure have been developed to create the large spaces without column. These structures may have large freedom in scale and form, and especially tensegrity structures are received much attention from the view points of their light weight and aesthetics. But There re some difficulties concerning structural stability, surface formation and construction method. One of the way to solve these problems reasonably is a combination of tensile members and rigid members. A structural system based on this concept is referred to as the "HTS ( Hybrid Tension Structure )". This is a type of flexible structural system which is unstable initially, because the cable material has little initial rigidity. As cable - dome hybrid structures is a type of HTS, the initial stress for the self- equilibrated system having stable state have to be introduced. To determine initial stress having stable state, the shape finding analysis is required before the stress - deformation analysis. In this paper, the primary objective is to derive the nonlinear finite element formula of cable and truss members considering geometric nonlinearity for shape finding of cable-dome, and to propose the method to decide the initial stress by the shape analysis of cable-dome hybrid structure with the self-equilibrated state.

• Journal of the Korea Society for Simulation
• /
• v.22 no.3
• /
• pp.81-87
• /
• 2013

This paper is about study how to decrese surge pressure that is occurred in excavator driving motor. We used computer simulation program SimulationX. It is also about the way finding design problem and approaching a solution through interpreting shape design sensitivity analysis. Programmes are below. First of all, finding shape fault by analyzing dynamic behavior of valves installed in hydraulic driving motor which is designed now. And drawing variable which is considered sensitive to improve dynamic efficiency among a lot of shape variables. Then, targeting that variable and examining dynamic efficiency stabilization tendency with controlling it. Finally, suggesting the most effective tuning method through variable combination as there are a lot of sensitive variables.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.9
• /
• pp.29-37
• /
• 1998

In weighted random pattern testing it is an important issue to find the optimal weight sets for achieving a high fault coverage using a small number of weighted random patterns. In this paper, a new weight set optimization algorithm is developed, which can generate the optimal weight sets in an efficient way using the sampling probabilities of deterministic tests patterns. In addition, the simulation based method of finding the proper maximum Hamming distance is presented. Experimental results for ISCAS 85 benchmark circuits prove the effectiveness of the new weight set optimization algorithm and the method of finding the proper maximum Hamming distance.

• ETRI Journal
• /
• v.40 no.1
• /
• pp.111-121
• /
• 2018

To find the emerging patterns (EPs) in streaming transaction data, the streaming is first divided into some time windows containing a number of transactions. Itemsets are generated from transactions in each window, and then the emergence of itemsets is evaluated between two windows. In the tilted-time windows model (TTWM), it is assumed that people need support data with finer accuracy from the most recent windows, while accepting coarser accuracy from older windows. Therefore, a limited array's elements are used to maintain all support data in a way that condenses old windows by merging them inside one element. The capacity of elements that accommodates the windows inside is modeled using a particular number sequence. However, in a stream, as new data arrives, the current array updating mechanisms lead to many null elements in the array and cause data incompleteness and inaccuracy problems. Two models derived from TTWM, logarithmic TTWM and Fibonacci windows model, also inherit the same problems. This article proposes a novel push-front Fibonacci windows model as a solution, and experiments are conducted to demonstrate its superiority in finding more EPs compared to other models.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.8
• /
• pp.606-610
• /
• 2009

In Location-Based Service (LBS), a scheme to hide the exact locations of users is required for privacy protection, In this paper, we propose a grid-based cloaking method considering K-anonymity and L-diversity. For this, our method creates a minimum cloaking region by finding L number of buildings (L-diversity) and then finding number of users (K-anonymity). Especially, we use a effective filtering method for generating the minimum cloaking region in a fast way. Finally, we show from a performance analysis that our cloaking method outperforms the existing method, in terms of query processing time based on the size of cloaking regions.