• Journal of Intelligence and Information Systems
• /
• v.24 no.2
• /
• pp.171-193
• /
• 2018

LOD(Linked Open Data) cloud is a practical implementation of semantic web. We suggested a new method that provides identity links conveniently in LOD cloud. It also allows changes in LOD to be reflected to searching results without any omissions. LOD provides detail descriptions of entities to public in RDF triple form. RDF triple is composed of subject, predicates, and objects and presents detail description for an entity. Links in LOD cloud, named identity links, are realized by asserting entities of different RDF triples to be identical. Currently, the identity link is provided with creating a link triple explicitly in which associates its subject and object with source and target entities. Link triples are appended to LOD. With identity links, a knowledge achieves from an LOD can be expanded with different knowledge from different LODs. The goal of LOD cloud is providing opportunity of knowledge expansion to users. Appending link triples to LOD, however, has serious difficulties in discovering identity links between entities one by one notwithstanding the enormous scale of LOD. Newly added entities cannot be reflected to searching results until identity links heading for them are serialized and published to LOD cloud. Instead of creating enormous identity links, we propose LOD to prepare its own link policy. The link policy specifies a set of target LODs to link and constraints necessary to discover identity links to entities on target LODs. On searching, it becomes possible to access newly added entities and reflect them to searching results without any omissions by referencing the link policies. Link policy specifies a set of predicate pairs for discovering identity between associated entities in source and target LODs. For the link policy specification, we have suggested a set of vocabularies that conform to RDFS and OWL. Identity between entities is evaluated in accordance with a similarity of the source and the target entities' objects which have been associated with the predicates' pair in the link policy. We implemented a system "Change Acceptable In-Depth Searching System(CAIDS)". With CAIDS, user's searching request starts from depth_0 LOD, i.e. surface searching. Referencing the link policies of LODs, CAIDS proceeds in-depth searching, next LODs of next depths. To supplement identity links derived from the link policies, CAIDS uses explicit link triples as well. Following the identity links, CAIDS's in-depth searching progresses. Content of an entity obtained from depth_0 LOD expands with the contents of entities of other LODs which have been discovered to be identical to depth_0 LOD entity. Expanding content of depth_0 LOD entity without user's cognition of such other LODs is the implementation of knowledge expansion. It is the goal of LOD cloud. The more identity links in LOD cloud, the wider content expansions in LOD cloud. We have suggested a new way to create identity links abundantly and supply them to LOD cloud. Experiments on CAIDS performed against DBpedia LODs of Korea, France, Italy, Spain, and Portugal. They present that CAIDS provides appropriate expansion ratio and inclusion ratio as long as degree of similarity between source and target objects is 0.8 ~ 0.9. Expansion ratio, for each depth, depicts the ratio of the entities discovered at the depth to the entities of depth_0 LOD. For each depth, inclusion ratio illustrates the ratio of the entities discovered only with explicit links to the entities discovered only with link policies. In cases of similarity degrees with under 0.8, expansion becomes excessive and thus contents become distorted. Similarity degree of 0.8 ~ 0.9 provides appropriate amount of RDF triples searched as well. Experiments have evaluated confidence degree of contents which have been expanded in accordance with in-depth searching. Confidence degree of content is directly coupled with identity ratio of an entity, which means the degree of identity to the entity of depth_0 LOD. Identity ratio of an entity is obtained by multiplying source LOD's confidence and source entity's identity ratio. By tracing the identity links in advance, LOD's confidence is evaluated in accordance with the amount of identity links incoming to the entities in the LOD. While evaluating the identity ratio, concept of identity agreement, which means that multiple identity links head to a common entity, has been considered. With the identity agreement concept, experimental results present that identity ratio decreases as depth deepens, but rebounds as the depth deepens more. For each entity, as the number of identity links increases, identity ratio rebounds early and reaches at 1 finally. We found out that more than 8 identity links for each entity would lead users to give their confidence to the contents expanded. Link policy based in-depth searching method, we proposed, is expected to contribute to abundant identity links provisions to LOD cloud.

• Journal of Advanced Navigation Technology
• /
• v.12 no.5
• /
• pp.516-523
• /
• 2008

Recently, the Web has been constructed based on collective intel1igence and growing up quickly. User created contents have been made the mainstream in this environments. So it's required to make an efficient technique of searching for the contents. The current searching technique mainly is achieved by key words. Semantic Web based on similarity and relationship of a language and using user tags in web2.0 also have been researched with activity. Generally, the web of the participation architecture has a lot of user created contents, various forms and classification. Therefore, it is necessary to classify and to efficiently search for a lot of user created contents. In this paper, we propose a depth searching technique considering the relationship among the tags that descript user contents. It is expected that the proposed depth searching techniques can reduce the time taken to search for the unwanted contents and the increase the efficiency of the contents searching using a service of suggestion words in tags groups.

• Journal of Internet Computing and Services
• /
• v.19 no.3
• /
• pp.67-77
• /
• 2018

This paper suggests that LOD establishes its own link policy and publishes it to LOD cloud to provide identity among entities in different LODs. For specifying the link policy, we proposed vocabulary set founded on RDF model as well. We implemented Policy based In-depth Searching and Cleansing(PISC for short) system that proceeds in-depth searching across LODs by referencing the link policies. PISC has been published on Github. LODs have participated voluntarily to LOD cloud so that degree of the entity identity needs to be evaluated. PISC, therefore, evaluates the identities and cleanses the searched entities to confine them to that exceed user's criterion of entity identity level. As for searching results, PISC provides entity's detailed contents which have been collected from diverse LODs and ontology customized to the content. Simulation of PISC has been performed on DBpedia's 5 LODs. We found that similarity of 0.9 of source and target RDF triples' objects provided appropriate expansion ratio and inclusion ratio of searching result. For sufficient identity of searched entities, 3 or more target LODs are required to be specified in link policy.

• Journal of KIISE
• /
• v.44 no.10
• /
• pp.1045-1061
• /
• 2017

This paper suggests a method to expand linkages in a Linked Open Data(LOD) cloud that is a practical consequence of a semantic web. LOD cloud, contrary to the first expectation, has not been used actively because of the lack of linkages. Current method for establishing links by applying to explicit links and attaching the links to LODs have restrictions on reflecting target LODs' changes in a timely manner and maintaining them periodically. Instead of attaching them, this paper suggests that each LOD should prepare a link policy and publish it together with the LOD. The link policy specifies target LODs, predicate pairs, and similarity degrees to decide on the establishment of links. We have implemented a system that performs in-depth searching through LODs using their link policies. We have published APIs of the system to Github. Results of the experiment on the in-depth searching system with similarity degrees of 1.0 ~ 0.8 and depth level of 4 provides searching results that include 91% ~ 98% of the trustworthy links and about 170% of triples expanded.

• Journal of Korean Library and Information Science Society
• /
• v.28
• /
• pp.263-286
• /
• 1998

To investigate how the online searching was taught in the departments of Library and Information Science, a survey was done to the professors teaching information retrieval course. Questionnaires were mailed to 32 professors and 26 returned. Information retrieval course, one of the central course attended by almost all of the students, covers online searching in depth. Lecture, hard-on practice, and homework were three favored methods of teaching. Among the 22 topics to be covered in online teaching, respondents showed substantially higher consensus except for sections of information technology and service management. However, respondents showed big differences in hours of hand-on practice and the systems used. Free databases through Internet used dominantly. The chronic problem of terminal and communication is solved by using campus-wide facilities. But the problem of teaching assistance is serious. Based on the results, recommendations to improve online searching education are provided.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.3
• /
• pp.1023-1033
• /
• 2014

In this paper, performance improved hole-filling algorithm which includes the boundary noise removing pre-process that can be used for an arbitrary virtual view synthesis has been proposed. Boundary noise occurs due to the boundary mismatch between depth and texture images during the 3D warping process and it usually causes unusual defects in a generated virtual view. Common-hole is impossible to recover by using only a given original view as a reference and most of the conventional algorithms generate unnatural views that include constrained parts of the texture. To remove the boundary noise, we first find occlusion regions and expand these regions to the common-hole region in the synthesized view. Then, we fill the common-hole using the spiral weighted average algorithm and the gradient searching algorithm. The spiral weighted average algorithm keeps the boundary of each object well by using depth information and the gradient searching algorithm preserves the details. We tried to combine strong points of both the spiral weighted average algorithm and the gradient searching algorithm. We also tried to reduce the flickering defect that exists around the filled common-hole region by using a probability mask. The experimental results show that the proposed algorithm performs much better than the conventional algorithms.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.1025-1042
• /
• 2002

The goal of this study is to generate a structured document which improves the performance of an information retrieval system by using thesaurus, information on relations between words (terms), and to study on the technique for searching this structured document. In order to accomplish this goal, we propose a DODI (Depth -Oriented Decomposition Index) technique for the structured document and an algorithm to search for related information efficient]y through this index technique that uses a thesaurus. We establish a storage system by which the structured document generated by this index technique is saved in a database through OpenXML and XML documents are generated through ForXML methods.

• Health Policy and Management
• /
• v.20 no.3
• /
• pp.138-156
• /
• 2010

Objective : The purpose of this study is 1) to understand the information-searching behavior of health care consumers ; 2) to examine the relationship between the information-searching behavior of health-care consumers and regulatory variables such as socioeconomic factors, characteristics of medical utilization, and perceived risks ; and 3) to determine the factors that affect consumer satisfaction, especially with respect to information-searching behavior. Method : The data for this study were collected from 838 respondents in five university hospital located in three areas?Seoul, Gyeonggi province, and Chungchong province. As the first step of the study, we conducted a preliminary survey from September 23?26, 2008. At the second step, we conducted a survey on the effect of information-searching behavior on those individuals who had visited. Furthermore, personal interviews were conducted through a face-to-face survey between September 30 and October 17, 2008. Results : The major research findings that were obtained from the study were as follows : First, the age, educational level, and residential district were associated with information source utilization. Second, the level of information searching effort and quality of service had a significant effect on consumer satisfaction. Conclusion : These results show that it is essential for marketers to have in-depth knowledge about the young and educated people who actively search for information and about those who are in the prime of their life and rely on word-of-mouth communication from personal and experi in-al informers. Therefore, marketers should develop different marketing strategies to meet the needs of such consumers.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.4
• /
• pp.195-204
• /
• 2014

This paper presents the depth evaluation for object detection by automated assembling robots. Pattern distortion analysis from a structured light system identifies an object with the greatest depth from its background. An automated assembling robot should prior select and pick an object with the greatest depth to reduce the physical harm during the picking action of the robot arm. Object detection is then combined with a depth evaluation to provide contour, showing the edges of an object with the greatest depth. The contour provides shape information to an automated assembling robot, which equips the laser based proxy sensor, for picking up and placing an object in the intended place. The depth evaluation process using structured light for an automated electronics assembling robot is accelerated for an image frame to be used for computation using the simplest experimental set, which consists of a single camera and projector. The experiments for the depth evaluation process required 31 ms to 32 ms, which were optimized for the robot vision system that equips a 30-frames-per-second camera.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1C
• /
• pp.37-47
• /
• 2011

In this paper, we propose a novel ML decoding scheme based on the combination of depth- and breadth-first search methods on a partitioned tree for multiple input multiple output systems. The proposed scheme first partitions the searching tree into several stages, each of which is then searched by a depth- or breadth-first search method, possibly exploiting the advantages of both the depth- and breadth-first search methods in an organized way. Numerical results indicate that, when the depth- and breadth-first search algorithms are adopted appropriately, the proposed scheme exhibits substantially lower computational complexity than conventional ML decoders while maintaining the ML bit error performance.