• Journal of KIISE:Software and Applications
• /
• v.29 no.1_2
• /
• pp.10-19
• /
• 2002

In searching and locating a collection of components on the Web, users require a Web browser. Since the Web libraries tend to grow rapidly, there needs to be an effective way to organize and manage such large libraries. Traditional Web-based library(retrieval) systems provide various classification scheme and retrieval services to store and retrieve components. However, these systems do not include invaluable services, for example, enabling users to grasp the overall contents of the library at the beginning of retrieval. This paper discusses a Web-based library system, which provides the efficient management of object-oriented components and a set of services beyond simple component store and retrieval. These services consist of component comprehension through a reverse engineering process, automated summary extraction, and comprehension-based retrieval. Also, The performance of an automated cluster-based classification scheme adopted on the system is evaluated and compared with the cluster-based classification scheme adopted on the system is evaluated and compared with the performance of two other systems using traditional classification scheme.

• The KIPS Transactions:PartD
• /
• v.9D no.3
• /
• pp.477-486
• /
• 2002

vCard that is the electronic business card automates the exchange of personal information typically found on a traditional business card. vCard information contains not only simple text, but also graphics and multimedia data like pictures, company logos, Web addresses, and so on. This paper describes the design and implementation of Web-based vCard agent system for exchanging vCard, an electronic business card and searching another user's vCard in mobile phone environment. In today's business environment, such as that this information is typically exchanged on business cards. Our web agent system in this paper connect web server which provide vCard service and search, edit vCard information displayed by web browser of mobile phone and exchange vCard with another user through internet. Considering characteristics of wireless devices that have limited storage space, It also saves constructed XML documents that include user's informations in a web server and solves the security problem by exchanging not personal data or XML but encrypted directory name where XML document exits as exchanging vcard.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.2
• /
• pp.133-148
• /
• 2005

Since understanding of similarities and differences among protein structures is very important for the study of the relationship between structure and function, many protein structure comparison systems have been developed. Hut, unfortunately, these systems introduce their own protein data derived from the PDB(Protein Data Bank), which are needed in their algorithms for comparing protein structures. In addition, according to the rapid increase in the size of PDB, these systems require much more computation to search for common substructures in their databases. In this paper, we introduce a protein structure comparison system named WS4E(A Web-Based Searching Substructures of Secondary Structure Elements) based on a PSAML database which stores PSAML documents using the eXist open XML DBMS. PSAML(Protein Structure Abstraction Markup Language) is an XML representation of protein data, describing a protein structure as the secondary structures of the protein and their relationships. Using the PSAML database, the WS4E provides web services searching for common substructures among proteins represented in PSAML. In addition, to reduce the number of candidate protein structures to be compared in the PSAML database, we used topology strings which contain the spatial information of secondary structures in a protein.

• The KIPS Transactions:PartD
• /
• v.16D no.5
• /
• pp.683-690
• /
• 2009

Social Networks which is composed of network with an individual in the center in a web support mutual-understanding of information by searching user profile and forming new link. Therefore, if we apply the Social Network which consists of web users who have similar immanent information to web search, we can improve efficiency of web search and satisfaction of web user about search results. In this paper, first, we make a Social Network using web users linked directly or indirectly. Next, we calculate Similarity among web users using their immanent information according to topics, and then reconstruct Social Network based on varying Similarity according to topics. Last, we compare Similarity with Search Pattern. As a result of this test, we can confirm a result that among users who have high relationship index, that is, who have strong link strength according to personal attributes have similar search pattern. If such fact is applied to search algorithm, it can be possible to improve search efficiency and reliability in personalized and social search.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.669-671
• /
• 2010

IStorage is a technology, which can use resources of server PC by using Android Phone supporting wireless internet access. IStorage utilizes resources of server PC through WebDAV protocol. And with GUI interface, Users upload their resources to the server PC and They can perform various kinds of works like Opening, Searching, Deleting and Downloading files. Since it is possible for them to use resources of server PC as if they are originally stored in their mobile devices, there is no limit on using the functions such as watching movies, listening musics and opening document files in real time. We expect this study can to overcome the limitation of storage space and also be a useful technology in the smart phone market.

• The Journal of the Korea Contents Association
• /
• v.15 no.6
• /
• pp.33-42
• /
• 2015

As smart phones have been increasingly used to access information with bigger screens and higher resolution, smart phones have rapidly grown larger. Even Apple which had stuck to the 4-inch smart phone screen size, released 5.5-inch iPhone 6 plus. In this trend of smart phone enlargement, manufacturers have mostly incorporated one-handed modes to 5-inch or larger phones to keep the convenience of one-handed operation. But most of them provide just smaller screens and are rather complicated to set up after several menus to touch. In this study, this research examined one-handed functions of each smart phone manufacturer to understand problems in the one-handed smart-phone manipulation of web-browsing which is one of the frequent smart phone services. And by investigating smart phone users, this research found out requirements for one-handed web search operation. Based on this examination, the author of this research designed an efficient one-handed interface for mobile web-search without reducing the screen size. Then, to assess the possible usability improvement, the prototype was applied to a large 5.5-inch-screen smart phone to evaluate its performance through observation and surveys and find out manipulation satisfaction and further improvements.

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

• Proceedings of the Korean Society for Quality Management Conference
• /
• 1998.11a
• /
• pp.479-494
• /
• 1998

The use of Internet has became an indispensible job to virtually every work, including quality management. The amount of information on quality management available via the Internet has increased dramatically in the last a few years. In this paper, it is discussed in detail how to search quality-related sites efficiently on the Internet. Many sites of interest on quality management are also introduced.

• Journal of Korean Society for Quality Management
• /
• v.26 no.4
• /
• pp.277-292
• /
• 1998

The use of Internet has became an indispensible job to virtually every work, including quality management. The amount of information on quality management available via the Internet has increased dramatically in the last a few years. In this paper, it is discussed in detail how to search quality-related sites efficiently on the Internet. Many sites of interest on quality management are also introduced.

• Proceedings of the KSR Conference
• /
• 1998.11a
• /
• pp.111-118
• /
• 1998

This paper describes the development of the database system for tunnel management of Korea National Railways. In order to make the system both target independent and accessible by KNR network or modem, authors developed the system as a web-based application using java language and IBM DB2 database. The system includes the searching, reporting, graphical representation and statistical functions for tunnel data, maintenance records and checking records. Later, the system will be extended to include the process for tunnel state rating and maintenace prioritiy decision-making.