• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.11
• /
• pp.2187-2192
• /
• 2016

A data-centric routing protocol considering a data aggregation technique at relay nodes is required to increase the lifetime of wireless sensor networks. An energy-efficient data-centric routing algorithm is proposed by considering a tradeoff between acquisition time and energy consumption in the wireless sensor network. First, the proposed routing scheme decides the sink node among all sensor nodes in order to minimize the maximum distance between them. Then, the proposed routing extends its tree structure in a way to minimize the link cost between the connected nodes for reducing energy consumption while minimizing the maximum distance between sensor nodes and a sink node for rapid information gathering. Simulation results show that the proposed data-centric routing algorithm has short information acquisition time and low energy consumption; thus, it achieves high energy efficiency in the wireless sensor network compared to conventional routing algorithms.

• Asia pacific journal of information systems
• /
• v.17 no.4
• /
• pp.31-59
• /
• 2007

We frequently use search engines to find relevant information in the Web but still end up with too much information. In order to solve this problem of information overload, ranking algorithms have been applied to various domains. As more information will be available in the future, effectively and efficiently ranking search results will become more critical. In this paper, we propose a ranking algorithm for the Semantic Web resources, specifically RDF resources. Traditionally, the importance of a particular Web page is estimated based on the number of key words found in the page, which is subject to manipulation. In contrast, link analysis methods such as Google's PageRank capitalize on the information which is inherent in the link structure of the Web graph. PageRank considers a certain page highly important if it is referred to by many other pages. The degree of the importance also increases if the importance of the referring pages is high. Kleinberg's algorithm is another link-structure based ranking algorithm for Web pages. Unlike PageRank, Kleinberg's algorithm utilizes two kinds of scores: the authority score and the hub score. If a page has a high authority score, it is an authority on a given topic and many pages refer to it. A page with a high hub score links to many authoritative pages. As mentioned above, the link-structure based ranking method has been playing an essential role in World Wide Web(WWW), and nowadays, many people recognize the effectiveness and efficiency of it. On the other hand, as Resource Description Framework(RDF) data model forms the foundation of the Semantic Web, any information in the Semantic Web can be expressed with RDF graph, making the ranking algorithm for RDF knowledge bases greatly important. The RDF graph consists of nodes and directional links similar to the Web graph. As a result, the link-structure based ranking method seems to be highly applicable to ranking the Semantic Web resources. However, the information space of the Semantic Web is more complex than that of WWW. For instance, WWW can be considered as one huge class, i.e., a collection of Web pages, which has only a recursive property, i.e., a 'refers to' property corresponding to the hyperlinks. However, the Semantic Web encompasses various kinds of classes and properties, and consequently, ranking methods used in WWW should be modified to reflect the complexity of the information space in the Semantic Web. Previous research addressed the ranking problem of query results retrieved from RDF knowledge bases. Mukherjea and Bamba modified Kleinberg's algorithm in order to apply their algorithm to rank the Semantic Web resources. They defined the objectivity score and the subjectivity score of a resource, which correspond to the authority score and the hub score of Kleinberg's, respectively. They concentrated on the diversity of properties and introduced property weights to control the influence of a resource on another resource depending on the characteristic of the property linking the two resources. A node with a high objectivity score becomes the object of many RDF triples, and a node with a high subjectivity score becomes the subject of many RDF triples. They developed several kinds of Semantic Web systems in order to validate their technique and showed some experimental results verifying the applicability of their method to the Semantic Web. Despite their efforts, however, there remained some limitations which they reported in their paper. First, their algorithm is useful only when a Semantic Web system represents most of the knowledge pertaining to a certain domain. In other words, the ratio of links to nodes should be high, or overall resources should be described in detail, to a certain degree for their algorithm to properly work. Second, a Tightly-Knit Community(TKC) effect, the phenomenon that pages which are less important but yet densely connected have higher scores than the ones that are more important but sparsely connected, remains as problematic. Third, a resource may have a high score, not because it is actually important, but simply because it is very common and as a consequence it has many links pointing to it. In this paper, we examine such ranking problems from a novel perspective and propose a new algorithm which can solve the problems under the previous studies. Our proposed method is based on a class-oriented approach. In contrast to the predicate-oriented approach entertained by the previous research, a user, under our approach, determines the weights of a property by comparing its relative significance to the other properties when evaluating the importance of resources in a specific class. This approach stems from the idea that most queries are supposed to find resources belonging to the same class in the Semantic Web, which consists of many heterogeneous classes in RDF Schema. This approach closely reflects the way that people, in the real world, evaluate something, and will turn out to be superior to the predicate-oriented approach for the Semantic Web. Our proposed algorithm can resolve the TKC(Tightly Knit Community) effect, and further can shed lights on other limitations posed by the previous research. In addition, we propose two ways to incorporate data-type properties which have not been employed even in the case when they have some significance on the resource importance. We designed an experiment to show the effectiveness of our proposed algorithm and the validity of ranking results, which was not tried ever in previous research. We also conducted a comprehensive mathematical analysis, which was overlooked in previous research. The mathematical analysis enabled us to simplify the calculation procedure. Finally, we summarize our experimental results and discuss further research issues.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.15 no.6
• /
• pp.770-778
• /
• 2012

In this paper, we propose a multi-path construction scheme to improve the survivability of a multicast session in military hybrid networks. A military hybrid network consists of a static backbone network and multiple mobile stub networks where some nodes are frequently susceptible to be disconnected due to link failure and node mobility. To improve the survivability of multicast sessions, we propose a construction scheme of ${\kappa}$ redundant multi-paths to each receiver. In order to take account of different characteristics of static and mobile networks, we propose quite different multi-path setup approaches for the backbone and stub networks, respectively, and combine them at the boundary point called gateway. We prove that our proposed scheme ensures that each receiver of a multicast session has ${\kappa}$ redundant paths to the common source. Through simulations, we evaluate the performance of the proposed schemes from three aspects : network survivability, recovery cost, and end-to-end delay.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.15 no.3 s.96
• /
• pp.251-258
• /
• 2005

The free vibration of a spinning flexible disk-spindle system supported by hydro dynamic bearings (HDB) in an HDD is analyzed by FEM. The spinning flexible disk is described using Kirchhoff plate theory and von Karman non-linear strain, and its rigid body motion is also considered. It is discretized by annular sector element. The rotating spindle which includes the clamp, hub, permanent magnet and yoke, is modeled by Timoshenko beam including the gyroscopic effect. The flexible supporting structure with a complex shape which includes stator core, housing, base plate, sleeve and thrust pad is modeled by using a 4-node tetrahedron element with rotational degrees of freedom to satisfy the geometric compatibility. The dynamic coefficients of HDB are calculated from the HDB analysis program, which solves the perturbed Reynolds equation using FEM. Introducing the virtual nodes and the rigid link constraints defined in the center of HDB, beam elements of the shaft are connected to the solid elements of the sleeve and thrust pad through the spring and damper element. The global matrix equation obtained by assembling the finite element equations of each substructure is transformed to the state-space matrix-vector equation, and the associated eigen value problem is solved by using the restarted Arnoldi iteration method. The validity of this research is verified by comparing the numerical results of the natural frequencies with the experimental ones. Also the effect of supporting structures to the natural modes of the total HDD system is rigorously analyzed.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2003.11a
• /
• pp.572-578
• /
• 2003

The free vibration of a spinning flexible disk-spindle system supported by hydro dynamic bearings in a HDD is analyzed by FEM. The spinning flexible disk is described using Kirchhoff plate theory and von Karman non-linear strain, and its rigid body motion is also considered. It is discretized by annular sector element. The rotating spindle which includes the clamp, hub, permanent magnet and yoke, is modeled by Timoshenko beam including the gyroscopic effect. The flexible supporting structure with a complex shape which includes stator core, housing, base plate, sleeve and thrust pad is modeled by using a 4-node tetrahedron element with rotational degrees of freedom to satisfy the geometric compatibility. The dynamic coefficients of HDB are calculated from the HDB analysis program, which solves the perturbed Raynolds equation using FEM. Introducing the virtual nodes and the rigid link constraints defined in the center of HDB, beam elements of the shaft are connected to the solid elements of the sleeve and thrust pad through the spring and damper element. The global matrix equation obtained by assembling the finite element equations of each substructure is transformed to the state-space matrix-vector equation, and the associated eigenvalue problem is solved by using the restarted Arnoldi iteration method. The validity of this research is verified by comparing the numerical results of the natural frequencies with the experimental ones. Also the effect of supporting structures to the natural modes of the total HDD system is rigorously analyzed.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.282-292
• /
• 2003

This paper proposes an efficient data structure for forwarding IPv4 and IPv6 packets at the gigabit speed in backbone routers. The LPM(Longest Prefix Matching) search becomes a bottleneck of routers' performance since the LPM complexity grows in proportion to the forwarding table size and the address length. To speed up the forwarding process, this paper introduces a data structure named BMT(Bit-Map Tie) to minimize the frequent main memory accesses. All the necessary search computations in BMT are done over a small index table stored at cache. To build the small index table from the tie representation of the forwarding table, BMT represents a link pointer to the child node and a node pointer to the corresponding entry in the forwarding table with one bit respectively. To improve the poor performance of the conventional tries when their height becomes higher due to the increase of the address length, BMT adopts a binary search algorithm for determining the appropriate level of tries to start. The simulation experiments show that BMT compacts the IPv4 backbone routers' forwarding table into a small one less than 512-kbyte and achieves the average speed of 250ns/packet on Pentium II processors, which is almost the same performance as the fastest conventional lookup algorithms.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.481-488
• /
• 2005

The Mobile W provides an efficient and scalable mechanism for host mobility within the Internet. However, the mobility implies higher security risks than static operations in fixed networks. In this paper, the Mobile IP has been adapted to allow AAA protocol that supports authentication, authorization, and accounting(AAA) for security and collection for accounting information of network usage by mobile nodes(MNs). For this goal, we Propose the boundary tone overlapped network structure while solidifying the security for the authentication of an MN. That is, the Proposed scheme delivers the session keys at the wired link for MN's security instead of the wireless one, so that it provides a fast and seamless handoff mechanism. According to the analysis of modeling result, the proposed mechanism compared to the existing session key reuse method is up to about $40\%$ better in terms of normalized surcharge for the handoff failure rate that considers handoff total time.

• 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.

• Computers and Concrete
• /
• v.20 no.3
• /
• pp.319-327
• /
• 2017

Studying the structural behavior of prestressed segmented girders is quite important due to the large use this type of solution in viaducts and bridges. Thus, this work presents a nonlinear three-dimensional structural analysis of an externally prestressed segmented concrete girder through the Finite Element Method (FEM), using a customized ANSYS platform, version 14.5. Aiming the minimization of the computational effort by using the lowest number of finite elements, a new viscoelastoplastic material model has been implemented for the structural concrete with the UPF customization tool of ANSYS, adding new subroutines, written in FORTRAN programming language, to the main program. This model takes into consideration the cracking of concrete in its formulation, being based on fib Model Code 2010, which uses Ottosen rupture surface as the rupture criterion. By implementing this new material model, it was possible to use the three-dimensional 20-node quadratic element SOLID186 to model the concrete. Upon validation of the model, an externally prestressed segmented box concrete girder that was originally lab tested by Aparicio et al. (2002) has been computationally simulated. In the discretization of the structure, in addition to element SOLID186 for the concrete, unidimensional element LINK180 has been used to model the prestressing tendons, as well as contact elements CONTA174 and TARGE170 to simulate the dry joints along the segmented girder. Stresses in the concrete and in the prestressing tendons are assessed, as well as joint openings and load versus deflection diagrams. A comparison between numerical and experimental data is also presented, showing a good agreement.

• Journal of KSNVE
• /
• v.6 no.2
• /
• pp.163-177
• /
• 1996

An investigation on thermohydraulic stability of flow oscillations in the CANada Deuterium Uranium-600(CANDU-6) heat transport system has been conducted. Flow oscillations in reactor coolant loops, comprising two heat sources and two heat sinks in series, are possibly caused by the response of the pressure to extraction of fluid in two-phase region. This response consists of two contributions, one arising from mass and another from enthalpy change in the two-phase region. The system computer code used in the investigation os SOPHT, which is capable of simulating steady states as well as transients with varying boundary conditions. The model was derived by linearizing and solving one-dimensional, homogeneous single- and two-phase flow conservation equations. The mass, energy and momentum equations with boundary conditions are set up throughout the system in matrix form based on a node-link structure. Loop stability was studied under full power conditions with interconnecting the two compressible two phase regions in the figure-of-eight circuit. The dominant function of the interconnecting pipe is the transfer of mass between the two-phase regions. Parametric survey of loop stability characteristics, i. e., damping ratio and period, has been made as a function of geometrical parameters of the interconnection line such as diameter, length, height and orifice flow coefficient. The stability characteristics with interconnection line has been clarified to provide a simple criterion to be used as a guide in scaling of the pipe.