• Title/Summary/Keyword: Resource Search

Search Result 415, Processing Time 0.035 seconds

A Ranking Algorithm for Semantic Web Resources: A Class-oriented Approach (시맨틱 웹 자원의 랭킹을 위한 알고리즘: 클래스중심 접근방법)

  • Rho, Sang-Kyu;Park, Hyun-Jung;Park, Jin-Soo
    • 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.

Review of Low Level Laser Therapy on The Growth of Epiphyseal Plate (성장판의 성장에 저단계 레이저가 미치는 영향에 대한 고찰)

  • Choi, Ji Won;Jang, In Soo;Jeong, Min Jeong
    • The Journal of Pediatrics of Korean Medicine
    • /
    • v.29 no.4
    • /
    • pp.29-38
    • /
    • 2015
  • Objectives We aimed to identify the effectiveness of photobiomodulation using low level laser therapy (LLLT), light emitting diode (LED) and others on the growth of the length of the growth plate by reviewing literatures. Methods We searched literatures using PubMed, Science Direct, CINAHL, Korea Traditional Knowledge Portal (KTKP), Oriental Medicine Advanced Searching Integrated System (OASIS), China Knowledge Resource Integrated Database (CNKI), Japan Science and Technology Information Aggregator, Electronic (J STAGE), and Japan National Institute of Informatics Scholarly and Academic Information Navigator (CiNii) using the keywords "Growth plate" "Epiphyseal growth" "Epiphyseal plate" and "Laser", "light emitting diode (LED)", "near-infrared light", and "photobiomodulation". Search range included only original article which provided English abstract were selected. The search strategy contained no language limitation. Results A total 556 studies were found. Then, 551 were excluded by scanning titles and abstracts and finally 5 articles were selected. Five articles were RCTs using rodents. Two of the 5 articles used InGaAlP Laser (630-685 nm), and the other 3 articles used GaAlAs Laser (780, 820, and 870 nm) to investigated the effects of LLLT on the growth of the length of the epiphyseal cartilage and the number of chondrocytes and thickness of each zone of the epiphyseal cartilage. Two articles concluded that LLLT had a beneficial effect on the longitudinal growth of the growth plate. In growth of the epiphyseal plate, there were no significant differences in others. Conclusions It is might that LLLT influenced on the growth of epiphyseal plate by positive affect. However, further rigorous RCTs are warranted.

Network Topology Discovery with Load Balancing for IoT Environment (IoT환경에서의 부하 균형을 이룬 네트워크 토폴로지 탐색)

  • Park, Hyunsu;Kim, Jinsoo;Park, Moosung;Jeon, Youngbae;Yoon, Jiwon
    • Journal of KIISE
    • /
    • v.44 no.10
    • /
    • pp.1071-1080
    • /
    • 2017
  • With today's complex networks, asset identification of network devices is becoming an important issue in management and security. Because these assets are connected to the network, it is also important to identify the network structure and to verify the location and connection status of each asset. This can be used to identify vulnerabilities in the network architecture and find solutions to minimize these vulnerabilities. However, in an IoT(Internet of Things) network with a small amount of resources, the Traceroute packets sent by the monitors may overload the IoT devices to determine the network structure. In this paper, we describe how we improved the existing the well-known double-tree algorithm to effectively reduce the load on the network of IoT devices. To balance the load, this paper proposes a new destination-matching algorithm and attempts to search for the path that does not overlap the current search path statistically. This balances the load on the network and additionally balances the monitor's resource usage.

A Reactive Chord for Efficient Network Resource Utilization in Mobile P2P Environments (모바일 P2P 환경에서 효율적인 네트워크 자원 활용을 위한 반응적인 코드)

  • Yoon, Young-Hyo;Kwak, Hu-Keun;Kim, Cheong-Ghil;Chung, Kyu-Sik
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.2
    • /
    • pp.80-89
    • /
    • 2009
  • A DHT(Distributed Hash Table) based P2P is a method that compensates disadvantages of the existing unstructured P2P method. If a DHT algorithm is used, it can do fast data search and maintain search efficiency independent of the number of peers. The peers in a DHT method send messages periodically to keep the routing table updated. In a mobile environment, the peers in a DHT method should send messages more frequently to keep the routing table updated and reduce the failure of requests. However this results in increasing the overall network traffic. In this paper, we propose a method to reduce the update load of a routing table in the existing DHT by updating it in a reactive way. In the proposed reactive method, a routing table is updated only if a data request is coming whereas it is updated periodically in the existing proactive method. We perform experiments using Chord simulator(I3) made by UC Berkely. The experimental results show the performance improvement of the proposed method compared to the existing method.

Mobile Agent Based Discovery Mechanism for Pure P2P Environments (순수 P2P 환경을 위한 이동 에이전트 기반 자원 검색 기법)

  • Kim, In-Suk;Kim, Moon-Jeong;Kim, Moon-Hyun;Kim, Ung-Mo;Eom, Young-Ik
    • The KIPS Transactions:PartD
    • /
    • v.10D no.2
    • /
    • pp.327-336
    • /
    • 2003
  • Recently the rapid growth of Internet and the construction of high speed networks make many kinds of multimedia services possible. But most of current multimedia services are designed being by client/server model, which incurs high load of central server. In order to solve this problem, we propose a peer-to-peer network-based discovery mechanism for multimedia services. In the proposed scheme, mobile agents that have autonomy and mobility are used to search the location of resources. Use of mobile agents can solve the loss problem of the search result that occurs when the network is unsettled in pure peer-to-peer network. It also supports interoperability in heterogeneous system environments. In the proposed scheme, each host maintains the location information of resources which are locally requested or recently requested by other hosts. So, the proposed scheme has faster response time than the pre-existing mechanisms in pure peer-to-peer network environments.

Full-Search Block-Matching Motion Estimation Circuit with Hybrid Architecture for MPEG-4 Encoder (하이브리드 구조를 갖는 MPEG-4 인코더용 전역 탐색 블록 정합 움직임 추정 회로)

  • Shim, Jae-Oh;Lee, Seon-Young;Cho, Kyeong-Soon
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.2
    • /
    • pp.85-92
    • /
    • 2009
  • This paper proposes a full-search block-matching motion estimation circuit with hybrid architecture combining systolic arrays and adder trees for an MPEG-4 encoder. The proposed circuit uses systolic arrays for motion estimation with a small number of clock cycles and adder trees to reduce required circuit resources. The interpolation circuit for 1/2 pixel motion estimation consists of six adders, four subtracters and ten registers. We improved the circuit performance by resource sharing and efficient scheduling techniques. We described the motion estimation circuit for integer and 1/2 pixels at RTL in Verilog HDL. The logic-level circuit synthesized by using 130nm standard cell library contains 218,257 gates and can process 94 D1($720{\times}480$) image frames per second.

Fabrication of Analysis Tool for Performance Verification of Naval Multi Function Radar (함정용 다기능레이다 성능검증을 위한 분석도구 제작)

  • Choi, Hong-Jae;Park, Myung-Hoon;Riew, oo-Gon;Kwon, Sewoong;Lee, Ki-Won;Kang, Yeon-Duk;Yo, Seung-Ki
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.2
    • /
    • pp.123-131
    • /
    • 2020
  • The system performance of naval multi function radar is affected by radar beam operation. Multi f function radar has to operate complicated beam better than search radar and tracking radar which have single operation. This paper describes fabricating analysis tool for the verification method for system performance of naval multi function radar. We composed the model that naval ship with MFR and radar which are detecting targets to verification the system performance. The targets are composed anti-aircraft and anti-ship. We integrate each model and make naval MFR simulator that applied resource management of track beam and search beam. We verify analysis tool by simulation in operating scenario after adjusting system parameter to analysis tool.

An Efficient Adaptive Bitmap-based Selective Tuning Scheme for Spatial Queries in Broadcast Environments

  • Song, Doo-Hee;Park, Kwang-Jin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.10
    • /
    • pp.1862-1878
    • /
    • 2011
  • With the advances in wireless communication technology and the advent of smartphones, research on location-based services (LBSs) is being actively carried out. In particular, several spatial index methods have been proposed to provide efficient LBSs. However, finding an optimal indexing method that balances query performance and index size remains a challenge in the case of wireless environments that have limited channel bandwidths and device resources (computational power, memory, and battery power). Thus, mechanisms that make existing spatial indexing techniques more efficient and highly applicable in resource-limited environments should be studied. Bitmap-based Spatial Indexing (BSI) has been designed to support LBSs, especially in wireless broadcast environments. However, the access latency in BSI is extremely large because of the large size of the bitmap, and this may lead to increases in the search time. In this paper, we introduce a Selective Bitmap-based Spatial Indexing (SBSI) technique. Then, we propose an Adaptive Bitmap-based Spatial Indexing (ABSI) to improve the tuning time in the proposed SBSI scheme. The ABSI is applied to the distribution of geographical objects in a grid by using the Hilbert curve (HC). With the information in the ABSI, grid cells that have no objects placed, (i.e., 0-bit information in the spatial bitmap index) are not tuned during a search. This leads to an improvement in the tuning time on the client side. We have carried out a performance evaluation and demonstrated that our SBSI and ABSI techniques outperform the existing bitmap-based DSI (B DSI) technique.

Post Clustering Method using Tag Hierarchy for Blog Search (블로그 검색에서의 태그 계층구조를 이용한 포스트 군집화)

  • Lee, Ki-Jun;Kim, Kyung-Min;Lee, Myung-Jin;Kim, Woo-Ju;Hong, June-S.
    • The Journal of Society for e-Business Studies
    • /
    • v.16 no.4
    • /
    • pp.301-319
    • /
    • 2011
  • Blog plays an important role as new type of knowledge base distinguishing from traditional web resource. While information resources in their existing website dealt with a wide range of topics, information resources of the blog are concentrated in specific units of information depending on the user's interests and have the criteria of classification forresources published by tagging. In this research, we build a tag hierarchy utilizing title keywords and tags of the blog, and propose apost clustering methodology applying the tag hierarchy. We then generate the tag hierarchy reflected the relationship between tags and develop the tag clustering methodology according to tag similarity. In this paper, we analyze the possibility of applying the proposed methodology with real-world examples and evaluate its performances through developed prototype system.

Evaluation of the Effect of Clinical Practice Guideline using Systematic Review (체계적 고찰 방법을 이용한 임상진료지침 정책효과 평가)

  • Lee, Sun-Hee;Ha, Gwi-Yeom;Kim, Ju-Hye;Seo, Ju-Hyun;Kim, Hyun-Mi
    • Korea Journal of Hospital Management
    • /
    • v.14 no.1
    • /
    • pp.62-98
    • /
    • 2009
  • A systematic review of the literatures was conducted to evaluate the effect of clinical practice guideline. The 77 studies were identified from a computerized search of published research on MEDLINE, Science-Direct and Blackwell synergy from January, 1997 to October, 2007. The main search terms were "clinical practice guideline" and "effectiveness", "clinical practice guideline" and "impact", "clinical practice guideline" and "evaluation". These studies were assessed the Quality twice by one Qualified expert and converted into weighted scale. The 63 studies were eligible inclusion criteria and subdivided into type of effect. Final indicator using for policy effect of clinical practice guidelines were classified as 4 categories; "improvement of outcomes" in 81 studies, "betterment in practice patterns" in 68 studies, "rationalization in resource utilization" in 84 studies and "cost containment" in 31 studies. The vote-counting method, one of meta-analysis method, was applied to summarized the effect of clinical practice guidelines and test statistically. From results of meta analysis, all indices were statistically significant. In conclusion, this meta-analysis showed that introduction of clinical practice guidelines were resulted positive outcomes in health policy.

  • PDF