• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2008.04a
• /
• pp.2-7
• /
• 2008

A highly efficient moving least squares finite difference method (MLS FDM) for heat transfer analysis of composite material with interface. In the MLS FDM, governing differential equations are directly discretized at each node. No grid structure is required in the solution procedure. The discretization of governing equations are done by Taylor expansion based on moving least squares method. A wedge function is designed for the modeling of the derivative jump across the interface. Numerical examples showed that the numerical scheme shows very good computational efficiency together with high aocuracy so that the scheme for heat transfer problem with different heat conductivities was successfully verified.

• Journal of Plant Biology
• /
• v.26 no.1
• /
• pp.41-51
• /
• 1983

This study was carried out to investigate ontogeny of stomata and aerenchyma tissue in Trapa natans L. var. bispinosa Makino, an aquatic plant. Ontogeny of stomata in this plant was an aperigenous type surrounding with 5 to 8 epidermal cells without subsidiary cells. Stomata were distributed abundantly on the upper surface of leaf, however, no stoma was found on the lower surface of leaf, and on the epidermis of reproductive organ, petiole and stem. Ontogency of aerenchyma tissue was progressed with five steps; 1) formation of angular cells by division of cortex cells, 2) development of small and large globular cells in accompany with schizogenous intercellular space, 3) enlargement of globular cells and more expansion of intercellular space, 4) cell induction of long elliptic and triarmed shape, 5) completion of the largest intercellular space from endodermis toepidermis. During the growth period two types of leaf were appeared at each node of stems; one type was a submerged and early-fallen leaf, the other was a floating leaf on water surface.

• Journal of Korea Multimedia Society
• /
• v.17 no.6
• /
• pp.725-732
• /
• 2014

The Pancake graph is node symmetric and useful interconnection network in the field of data sorting algorithm. The Half Pancake graph is a new interconnection network that reduces the degree of the Pancake graph by approximately half and improves the network cost of the Pancake graph. In this paper, we analyze topological properties of the Half Pancake graph $HP_n$. Fist, we prove that $HP_n$ has maximally fault tolerance and recursive scalability. In addition, we show that in $HP_n$, there are isomorphic graphs of low-dimensional $HP_n$. Also, we propose that the Bubblesort $B_n$ can be embedded into Half Pancake $HP_n$ with dilation 5, expansion 1. These results mean that various algorithms designed for the Pancake graph and the Bubble sort graph can be executed on $HP_n$ efficiently.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2615-2626
• /
• 1998

In this paper, we propose a new interconnection network called RFM graph, whichis the merger of the directed rotator and Faber-Moore graph, and analyze fault tolerance, routing algorithm node disjoint cycles and broadcasting algorithm. We also describe methods to embed star graph, 2 dimesional torus and bubblesort graph into RFM graph with unit expasion and dilation 2.

• 유체기계공업학회:학술대회논문집
• /
• 2006.08a
• /
• pp.459-462
• /
• 2006

In this study, the characteristic of a vane pump of an automative power steering system is numerically analyzed. The vane pump changes the energy level of operation fluid by converting mechanical input power to hydraulic output. To simulate this mechanism, moving mesh technique is adopted. As a result, the flow rate and pressure are obtained by numerical analysis. The flow rate agrees well with the experimental data. Moreover, the variation and oscillation of the pressure around the rotating vane are confirmed. The difference of pressure appears in the vane tip as a result of the flow characteristics. Furthermore, the back flow into the rotor was observed.

• Structural Engineering and Mechanics
• /
• v.29 no.2
• /
• pp.117-134
• /
• 2008

A new adaptive dual reciprocity boundary element method for dynamic analysis of 3-D structures is presented in this paper. It is based on finding the best approximation function of a radial basis function (RBF) group $f=r^n+c$ which minimize the error of displacement field expansion. Also, the effects of some parameters such as the existence of internal points, number of RBF functions and position of collocation nodes in discontinuous elements are investigated in this adaptive procedure. Three numerical examples show improvement in dynamic response of structures with adaptive RBF in dual reciprocity with respect to ordinary BEM.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.5
• /
• pp.1332-1341
• /
• 1999

Rapid expansion of network and increment of computer system access cause computer security to be an important issue. Hence, the researches in intrusion detection system(IDS)are active to reduce the risk from hackers. Considering IDS, we propose a new IDS model(DABIDS : Distributed Agent Based Intelligent intrusion Detection System) based on distributed intrusion detecting agents. The DABIDS dynamically collects intrusion behavior knowledge from each agents when some doubtable behaviors of users are detected and make new agents codes using intrusion scenario data base, and broadcast the detector codes to the distributed intrusion detecting agent of all node. This DABIDS can efficiently solve the problem to reduce the overhead for training detecting agent for intrusion behavior patterns.

• Annual Conference of KIPS
• /
• 2009.11a
• /
• pp.179-180
• /
• 2009

본 논문은 웨어러블 플랫폼 구성 기술로써 e-Textile Fabric Area Network (e-FAN) 시스템을 소개하고, e-FAN 시스템에서의 브릿지 노드를 이용한 네트워크 확장 방법을 제안한다. E-FAN 은 직물 소재의 제품에 센서, 엑츄에이터, 프로세서 등의 다양한 정보 처리 유닛이 전도성사로 연결되는 구성되는 네트워크이다. 본 논문은 이러한 e-FAN 시스템에서의 e-FAN 브릿지 노드 (e-FAN Bridge Node; eFANBN)을 활용한 네트워크 확장 방법을 제시한다. E-FAN 브릿지 노드를 활용한 네트워크 확장 방법을 통하여 다양한 종류의 전도성사를 통신 매질로 하는 네트워크 세그먼트를 통합하여 내고장성을 지원하는 네트워크로 확장한다.

• Journal of Korean Society of Transportation
• /
• v.22 no.4 s.75
• /
• pp.135-146
• /
• 2004

For improving the effectiveness of travel information, some rational paths are needed to provide them to users driving in real road network. To meet it, k-shortest path algorithms have been used in general. Although the k-shortest path algorithm can provide several alternative paths, it has inherent limit of heavy overlapping among derived paths, which nay lead to incorrect travel information to the users. In case of considering the network consisting of several turn prohibitions popularly adopted in real world network, it makes difficult for the traditional network optimization technique to deal with. Banned and penalized turns are not described appropriately for in the standard node/link method of network definition with intersections represented by nodes only. Such problem could be solved by expansion technique adding extra links and nodes to the network for describing turn penalties, but this method could not apply to large networks as well as dynamic case due to its overwhelming additional works. This paper proposes a link-based shortest path algorithm for the travel information in real road network where exists turn prohibitions. It enables to provide efficient alternative paths under consideration of overlaps among paths. The algorithm builds each path based on the degree of overlapping between each path and stops building new path when the degree of overlapping ratio exceeds its criterion. Because proposed algorithm builds the shortest path based on the link-end cost instead or node cost and constructs path between origin and destination by link connection, the network expansion does not require. Thus it is possible to save the time or network modification and of computer running. Some numerical examples are used for test of the model proposed in the paper.

• The KIPS Transactions:PartB
• /
• v.19B no.3
• /
• pp.189-194
• /
• 2012

In this paper, we propose a query expansion method based on word graphs using pseudo-relevant and pseudo non-relevant documents to achieve performance improvement in information retrieval. The initially retrieved documents are classified into a core cluster when a document includes core query terms extracted by query term combinations and the degree of query term proximity. Otherwise, documents are classified into a non-core cluster. The documents that belong to a core query cluster can be seen as pseudo-relevant documents, and the documents that belong to a non-core cluster can be seen as pseudo non-relevant documents. Each cluster is represented as a graph which has nodes and edges. Each node represents a term and each edge represents proximity between the term and a query term. The term weight is calculated by subtracting the term weight in the non-core cluster graph from the term weight in the core cluster graph. It means that a term with a high weight in a non-core cluster graph should not be considered as an expanded term. Expansion terms are selected according to the term weights. Experimental results on TREC WT10g test collection show that the proposed method achieves 9.4% improvement over the language model in mean average precision.