• Title/Summary/Keyword: graph structure

Search Result 507, Processing Time 0.023 seconds

Hypertext Model Extension and Dynamic Server Allocation for Database Gateway in Web Database Systems (웹 데이타베이스에서 하이퍼텍스트 모델 확장 및 데이타베이스 게이트웨이의 동적 서버 할당)

  • Shin, Pan-Seop;Kim, Sung-Wan;Lim, Hae-Chull
    • Journal of KIISE:Databases
    • /
    • v.27 no.2
    • /
    • pp.227-237
    • /
    • 2000
  • A Web database System is a large-scaled multimedia application system that has multimedia processing facilities and cooperates with relational/Object-Oriented DBMS. Conventional hypertext modeling methods and DB gateway have limitations for Web database because of their restricted versatile presentation abilities and inefficient concurrency control caused by bottleneck in cooperation processing. Thus, we suggest a Dynamic Navigation Model & Virtual Graph Structure. The Dynamic Navigation Model supports implicit query processing and dynamic creation of navigation spaces, and introduce node-link creation rule considering navigation styles. We propose a mapping methodology between the suggested hypertext model and the relational data model, and suggest a dynamic allocation scheduling technique for query processing server based on weighted value. We show that the proposed technique enhances the retrieval performance of Web database systems in processing complex queries concurrently.

  • PDF

Winkler Springs (p-y curves) for pile design from stress-strain of soils: FE assessment of scaling coefficients using the Mobilized Strength Design concept

  • Bouzid, Dj. Amar;Bhattacharya, S.;Dash, S.R.
    • Geomechanics and Engineering
    • /
    • v.5 no.5
    • /
    • pp.379-399
    • /
    • 2013
  • In practice, analysis of laterally loaded piles is carried out using beams on non-linear Winkler springs model (often known as p-y method) due to its simplicity, low computational cost and the ability to model layered soils. In this approach, soil-pile interaction along the depth is characterized by a set of discrete non-linear springs represented by p-y curves where p is the pressure on the soil that causes a relative deformation of y. p-y curves are usually constructed based on semi-empirical correlations. In order to construct API/DNV proposed p-y curve for clay, one needs two values from the monotonic stress-strain test results i.e., undrained strength ($s_u$) and the strain at 50% yield stress (${\varepsilon}_{50}$). This approach may ignore various features for a particular soil which may lead to un-conservative or over-conservative design as not all the data points in the stress-strain relation are used. However, with the increasing ability to simulate soil-structure interaction problems using highly developed computers, the trend has shifted towards a more theoretically sound basis. In this paper, principles of Mobilized Strength Design (MSD) concept is used to construct a continuous p-y curves from experimentally obtained stress-strain relationship of the soil. In the method, the stress-strain graph is scaled by two coefficient $N_C$ (for stress) and $M_C$ (for strain) to obtain the p-y curves. $M_C$ and $N_C$ are derived based on Semi-Analytical Finite Element approach exploiting the axial symmetry where a pile is modelled as a series of embedded discs. An example is considered to show the application of the methodology.

Analysis on Status and Trends of SIAM Journal Papers using Text Mining (텍스트마이닝 기법을 활용한 미국산업응용수학 학회지의 연구 현황 및 동향 분석)

  • Kim, Sung-Yeun
    • The Journal of the Korea Contents Association
    • /
    • v.20 no.7
    • /
    • pp.212-222
    • /
    • 2020
  • The purpose of this study is to understand the current status and trends of the research studies published by the Society for Industrial and Applied Mathematics which is a leader in the field of industrial mathematics around the world. To perform this purpose, titles and abstracts were collected from 6,255 research articles between 2016 and 2019, and the R program was used to analyze the topic modeling model with LDA techniques and a regression model. As the results of analyses, first, a variety of studies have been studied in the fields of industrial mathematics, such as algebra, discrete mathematics, geometry, topological mathematics, probability and statistics. Second, it was found that the ascending research subjects were fluid mechanics, graph theory, and stochastic differential equations, and the descending research subjects were computational theory and classical geometry. The results of the study, based on the understanding of the overall flows and changes of the intellectual structure in the fields of industrial mathematics, are expected to provide researchers in the field with implications of the future direction of research and how to build an industrial mathematics curriculum that reflects the zeitgeist in the field of education.

The estimation of river discharge by using the mean velocity equation in a unsteady condition (평균유속공식을 이용한 부정류 하천유량 산정)

  • Choo, Tai Ho;Chae, Soo Kwon;Yoon, Hyeon Cheol;Yun, Gwan Seon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.12
    • /
    • pp.6558-6564
    • /
    • 2013
  • As the average indicator for amount of water flowing in any cross section of a river, the mean discharge has been reported to be a very important factor for examining water circle constructions in a river basin, the design and construction of a hydraulic structure, and water front area use and management. The stage-discharge curve based on discharge and stage data measured in a normal season were basically derived. Using this derivation, the necessary discharge data was obtained. The values produced in this manner corresponded to the measured data in a uniform flow state well, but showed limited accuracy in a flood season (unsteady flow). In the present paper, the mean velocity in unsteady flow conditions, which exhibited loop form properties, was estimated using the new mean velocity formula derived from Chiu's 2-D velocity. The results of RMSE and Polar graph analyses showed that the proposed equation exhibited approximately nineteen times the accuracy compared to the Manning and Chezy equations.

A Method for Microarray Data Analysis based on Bayesian Networks using an Efficient Structural learning Algorithm and Data Dimensionality Reduction (효율적 구조 학습 알고리즘과 데이타 차원축소를 통한 베이지안망 기반의 마이크로어레이 데이타 분석법)

  • 황규백;장정호;장병탁
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.11
    • /
    • pp.775-784
    • /
    • 2002
  • Microarray data, obtained from DNA chip technologies, is the measurement of the expression level of thousands of genes in cells or tissues. It is used for gene function prediction or cancer diagnosis based on gene expression patterns. Among diverse methods for data analysis, the Bayesian network represents the relationships among data attributes in the form of a graph structure. This property enables us to discover various relations among genes and the characteristics of the tissue (e.g., the cancer type) through microarray data analysis. However, most of the present microarray data sets are so sparse that it is difficult to apply general analysis methods, including Bayesian networks, directly. In this paper, we harness an efficient structural learning algorithm and data dimensionality reduction in order to analyze microarray data using Bayesian networks. The proposed method was applied to the analysis of real microarray data, i.e., the NC160 data set. And its usefulness was evaluated based on the accuracy of the teamed Bayesian networks on representing the known biological facts.

Topological Properties of Recursive Circulants : Disjoint Paths (재귀원형군의 위상 특성 : 서로소인 경로)

  • Park, Jeong-Heum;Jwa, Gyeong-Ryong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.8
    • /
    • pp.1009-1023
    • /
    • 1999
  • 이 논문은 재귀원형군 G(2^m , 2^k ) 그래프 이론적 관점에서 고찰하고 정점이 서로소인 경로에 관한 위상 특성을 제시한다. 재귀원형군은 1 에서 제안된 다중 컴퓨터의 연결망 구조이다. 재귀원형군 {{{{G(2^m , 2^k )의 서로 다른 두 노드 v와 w를 잇는 연결도 kappa(G)개의 서로소인 경로의 길이가 두 노드 사이의 거리d(v,w)나 혹은 G(2^m , 2^k )의 지름 \dia(G)에 비해서 얼마나 늘어나는지를 고려한다. 서로소인 경로를 재귀적으로 설계하는데, 그 길이는 k ge2일 때 d(v,w)+2^k-1과 \dia(G)+2^k-1의 최솟값 이하이고, k=1일 때 d(v,w)+3과 \dia(G)\+2의 최솟값 이하이다. 이 연구는 (2^m , 2^k )의 고장 감내 라우팅, 고장 지름이나 persistence의 분석에 이용할 수 있다.Abstract In this paper, we investigate recursive circulant G(2^m , 2^k ) from the graph theory point of view and present topological properties concerned with node-disjoint paths. Recursive circulant is an interconnection structure for multicomputer networks proposed in 1 . We consider the length increments of {{{{kappa(G)disjoint paths joining arbitrary two nodes v and win G(2^m , 2^k )compared with distance d(v,w)between the two nodes and diameter {{{{\dia(G)of G(2^m , 2^k ), where kappa(G)is the connectivity of G(2^m , 2^k ). We recursively construct disjoint paths of length less than or equal to the minimum of {{{{d(v,w)+2^k-1and \dia(G)+2^k-1for kge2 and the minimum of d(v,w)+3 and \dia(G)+2for k=1. This work can be applied to fault-tolerant routing and analysis of fault diameter and persistence of G(2^m , 2^k )

A Caching Mechanism for Knowledge Maps (지식 맵을 위한 캐슁 기법)

  • 정준원;민경섭;김형주
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.3
    • /
    • pp.282-291
    • /
    • 2004
  • There has been many researches in TopicMap and RDF which are approach to handle data efficiently with metadata. However, No researches has been performed to service and implement except for presentation and description. In this paper, We suggest the caching mechanism to support an efficient access of knowledgemap and practical knowledgemap service with implementation of TopicMap system. First, We propose a method to navigate Knowledgemap efficiently that includes advantage of former methods. Then, To transmit TopicMap efficiently, We suggest caching mechanism for knowledgemap. This method is that user will be able to navigate knowledgemap efficiently in the viewpoint of human, not application. Therefor the mechanism doesn't cash topics by logical or physical locality but clustering by information and characteristic value of TopicMap. Lastly, we suggest replace mechanism by using graph structure of TopicMap for efficiency of transmission.

Evaluation of Perceived Exertion and Satisfaction in Opening and Closing Tailgates of Sport Utility Vehicles (스포츠 유틸리티 차량의 테일게이트 개폐 불편도와 만족도 평가)

  • Son, Byungchang;Ryu, Taebeum
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.1
    • /
    • pp.1-10
    • /
    • 2017
  • The difficulties in opening and closing a sport utility vehicle (SUV) tailgate is important aspect of JD (James David) power's Initial Quality Survey (IQS) assessment, and affective quality has a big impact on the the success of thesedays products. The purpose of this study is to evaluate the perceived difficulty and satisfaction of customers by the opening and closing of the tailgate and to grasp the relationship between them and the opening and closing reaction force. The mechanical force required to open and close 42 domestic and overseas SUV tailgates was measured with the help of an auto company. In the experiment, 100 male drivers in their 20s to 50s evaluated perceived difficulty and satisfaction with opening and closing the tailgate. The results of the analysis showed that perceived difficulty and satisfaction were statistically different depending on the vehicle, but did not depend on the personal characteristics of the participants. The perceived difficulty and satisfaction regression model of tailgate opening and closing was developed by mechanical force variables and had a relatively high adjusted $R^2$ ranging from 0.62 to 0.73. The models showed that the the initial close and open force, the difference between initial and maximum close force and the difference between initial and auto-fall angle should be small for the low perceived exertion and high satisfaction. In addition, the correlation analysis between IQS score of tailages and perceived difficulty and satisfaction showed that the IQS scores were more related to the perceived difficulty and satisfaction of closing than those of opening. The results of the study will be helpful to design and test mechanical open and close structure of SUV tailgates.

An Efficient Implementation of Kruskal's Algorithm for A Minimum Spanning Tree (최소신장트리를 위한 크루스칼 알고리즘의 효율적인 구현)

  • Lee, Ju-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.7
    • /
    • pp.131-140
    • /
    • 2014
  • In this paper, we present an efficient implementation of Kruskal's algorithm to obtain a minimum spanning tree. The proposed method utilizes the union-find data structure, reducing the depth of the tree of the node set by making the nodes in the path to root be the child node of the root of combined tree. This method can reduce the depth of the tree by shortening the path to the root and lowering the level of the node. This is an efficient method because if the tree's depth reduces, it could shorten the time of finding the root of the tree to which the node belongs. The performance of the proposed method is evaluated through the graphs generated randomly. The results showed that the proposed method outperformed the conventional method in terms of the depth of the tree.

A New Embedding of Pyramids into Regular 2-Dimensional Meshes (피라미드의 정방형 2-차원 메쉬로의 새로운 임베딩)

  • 장정환
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.2
    • /
    • pp.257-263
    • /
    • 2002
  • A graph embedding problem has been studied for applications of resource allocation and mapping the underlying data structure of a parallel algorithm into the interconnection architecture of massively parallel processing systems. In this paper, we consider the embedding problem of the pyramid into the regular 2-dimensional mesh interconnection network topology. We propose a new embedding function which can embed the pyramid of height N into 2$^{N}$ x2$^{N}$ 2-dimensional mesh with dilation max{2$^{N1}$-2. [3.2$^{N4}$+1)/2, 2$^{N3}$+2. [3.2$^{N4}$+1)/2]}. This means an improvement in the dilation measure from 2$^{N}$ $^1$in the previous result into about (5/8) . 2$^{N1}$ under the same condition.condition.