• Journal of Information Science Theory and Practice
• /
• v.8 no.3
• /
• pp.6-14
• /
• 2020

On information markets, we can identify different relations between sellers and their customers, with some users paying with money, some paying with attention, and others paying with their personal data. For the description of these different market relations, this article introduces the notion of arity into the scientific discussion. On unary information markets, customers pay with their money; examples include commercial information suppliers. Binary information markets are characterized by one market side paying with attention (e.g., on the search engine Google) or with personal data (e.g., on most social media services) and the other market side (mainly advertisers) paying with money. Our example of a ternary market is a social media market with the additional market side of influencers. If customers buy on unary markets, they know what to pay (in terms of money). If they pay with attention or with their personal data, they do not know what they have to pay exactly in the end. On n-ary markets (n greater than 1), laws should regulate company's abuse of money and-which is new-abuse of data streams with the aid of competition (or anti-trust) laws, and by modified data protection laws, which are guided by fair use of end users' attention and data.

• Journal of Information Science Theory and Practice
• /
• v.7 no.3
• /
• pp.21-30
• /
• 2019

Information about the formation and filling (in 2014 to 2016) of a terminological dictionary on electronics and radioengineering and collective work (in 2017 to 2018) with a data bank "TERMIN" is presented in this article. In purpose of creating an instrument of navigating the modern scientific-technical space a net of terms with set semantic links is described. This set is based on the analysis of terms' definitions (each term is checked for inclusion in the definitions of all other terms; the definitions were borrowed from reputable reference editions: encyclopedias, dictionaries, reference books). The created model of a system that consists of different information sources, in which it (information) is indexed by the terminology of Russian State Rubricator of Scientific and Technical Information rubrics and/or keywords, is described. There is an access for the search in all these sources in the system. Searching inquiries are referred to in the language of these rubrics or formulated by arbitrary terms. The system is to refer to information sources and give out relevant information. In accordance with this model, semantic links of various types, which allow expanding a search at different modalities of query, should be set among data bank terms. Obtained links will have to increase semantic matching, i.e., they can provide actual understanding of the meaning of the information that is being sought.

• Journal of Information Science Theory and Practice
• /
• v.8 no.4
• /
• pp.67-86
• /
• 2020

Information need has been one of the main motivations for a person using a search engine. Queries can represent very different information needs. Ironically, a query can be a poor representation of the information need because the user can find it difficult to express the information need. Query Expansion (QE) is being popularly used to address this limitation. While QE can be considered as a language-independent technique, recent findings have shown that in certain cases, language plays an important role. Arabic is a language with a particularly large vocabulary rich in words with synonymous shades of meaning and has high morphological complexity. This paper, therefore, provides a review on QE for Arabic information retrieval, the intention being to identify the recent state-of-the-art of this burgeoning area. In this review, we primarily discuss statistical QE approaches that include document analysis, search, browse log analyses, and web knowledge analyses, in addition to the semantic QE approaches, which use semantic knowledge structures to extract meaningful word relationships. Finally, our conclusion is that QE regarding the Arabic language is subjected to additional investigation and research due to the intricate nature of this language.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.6
• /
• pp.337-343
• /
• 2006

The Stack Resource Policy (SRP) is a real-time synchronization protocol with some distinct properties. One of such properties is early blocking; the execution of a job is delayed instead of being blocked when requesting shared resources. If SRP is used with dynamic priority scheduling such as Earliest Deadline First (EDF), the early blocking requires that a scheduler should select the highest-priority job among the jobs that will not be blocked, incurring runtime overhead. In this paper, we analyze the runtime overhead of EDF scheduling when SRP is used. We find out that the overhead of job search using the conventional implementations of ready queue and job search algorithms becomes serious as the number of jobs increases. To solve this problem, we propose an alternative data structure for the ready queue and an efficient job-search algorithm with O([log$_2n$]) time complexity.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.3_4
• /
• pp.168-185
• /
• 2003

This paper presents a progressive algorithm that not only can narrow down the search domain in the course of face identification but also can fast reconstruct various 3D objects from a sketch drawing. The sketch drawing, edge-vertex graph without hidden line removal, which serves as input for reconstruction process, is obtained from an inaccurate freehand sketch of a 3D wireframe object. The algorithm is executed in two stages. In the face identification stage, we generate and classify potential faces into implausible, basis, and minimal faces by using geometrical and topological constraints to reduce search space. The proposed algorithm searches the space of minimal faces only to identify actual faces of an object fast. In the object reconstruction stage, we progressively calculate a 3D structure by optimizing the coordinates of vertices of an object according to the sketch order of faces. The progressive method reconstructs the most plausible 3D object quickly by applying 3D constraints that are derived from the relationship between the object and the sketch drawing in the optimization process. Furthermore, it allows the designer to change viewpoint during sketching. The progressive reconstruction algorithm is discussed, and examples from a working implementation are given.

• Environmental Analysis Health and Toxicology
• /
• v.30 no.sup
• /
• pp.1.1-1.5
• /
• 2015

Objectives Despite the great contribution made by chemical substances to the development of modern civilization, their indiscriminate use has caused various kinds of damage to the global environment and human beings. Accordingly, the major developed countries and international society have tried to ensure the safe use of chemicals and a reduction in the use of hazardous chemicals through the establishment of the United Nations Environment Programme and various international agreements. In this reason, we tried to introduce about Green Chemistry progress at the present in worldwide and Korea. Methods We checked and analyzed relative journals, reports using keyword as like Green Chemistry, alternative chemicals, eco-friendly etc. and major country's government homepage search. Results Green Chemistry theory, which argues for the reduction or removal of harmfulness in chemicals throughout their entire life-cycle, has been spreading, and major developed countries, such as the US and Denmark, have developed and operate programs to provide reliable chemical information to help replace hazardous chemicals. Korea has also been conducting studies as like eco-innovation project. Through this project the "Alternative Chemical Search program," has been developed, distributed, and operated since 2011 to provide reliable information to small and medium-sized businesses that have difficulties collecting information to ensure conformity to international regulations. The program provides information that includes the regulations of major countries and Korea, information on 340 alternative chemicals, 70 application cases, and 1:1 consulting. Conclusions The Alternative Chemical Search program is expected to contribute to the establishment of response systems for regulation of Korean small and medium-sized businesses, and it also will be used to provide basic data for Korean hazardous chemical regulation, together with the Act on the Registration and Evaluation, etc. of Chemical Substances and the Chemical Control act, making it possible to establish an infrastructure for Green Chemistry in Korea and to increase national competitiveness.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.608-618
• /
• 2000

We consider the problem of placing resources in a distributed computing system so that certain performance requirements may be met while minimizing the number of required resource copies, irrespective of node or link failures. To meet the requirements for high performance and high availability, minimum number of resource copies should be placed in such a way that each node has at least two copies on the node or its neighbor nodes. This is called the fault-tolerant resource placement problem in this paper. The structure of a parallel or a distributed computing system is represented by a graph. The fault-tolerant placement problem is first transformed into the problem of finding the smallest fault-tolerant dominating set in a graph. The dominating set problem is known to be NP-complete. In this paper, searching for the smallest fault-tolerant dominating set is formulated as a state-space search problem, which is then solved optimally with the well-known A* algorithm. To speed up the search, we derive heuristic information by analyzing the properties of fault-tolerant dominating sets. Some experimental results on various regular and random graphs show that the search time can be reduced dramatically using the heuristic information.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.2972-2991
• /
• 2016

WLAN is the best choice in the place where complex network is hard to set up. Intelligent terminals are more and more assembled in some areas now. However, according to IEEE 802.11n/802.11ac, the access-point (AP) can only serve one user at a single frequency channel. The spectrum efficiency urgently needs to be improved. In theory, AP with multi-antenna can serve multiple users if these users do not interfere with each other. In this paper, we propose a user clustering scheme that could achieve multi-user selection through the mutual cooperation among users. We focus on two points, one is to achieve multi-user communication with multiple antennas technique at a single frequency channel, and the other one is to use a way of distributed users' collaboration to determine the multi-user selection for user clustering. Firstly, we use the CSMA/CA protocol to select the first user, and then we set this user as a source node using users' cooperation to search other proper users. With the help of the users' broadcast cooperation, we can search and select other appropriate user (while the number of access users is limited by the number of antennas in AP) to access AP with the first user simultaneously. In the network node searching, we propose a maximum degree energy routing searching algorithm, which uses the shortest time and traverses as many users as possible. We carried out the necessary analysis and simulation to prove the feasibility of the scheme. We hope this work may provide a new idea for the solution of the multiple access problem.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.30 no.4
• /
• pp.197-216
• /
• 2019

The study aimed to investigate the motivation and user satisfaction of medical school graduate students using specific academic information sites, and examines the effect of usage motivation factors on user satisfaction. This study was conducted from September 10, 2018 to September 21, 2018 by a large medical school graduate student in Seoul, and analyzed 135 valid responses. According to the analysis, the degree of reliability and interactivity of PubMed is higher than that of Google Scholar in medical school graduate students' use of academic information sites. It was found to have a significant effect on user satisfaction of academic information sites. In particular, convenience has the greatest influence on users' choice of academic information sites. The results of the study are of theoretical implications in that the discussion of academic information services through web sites is explained in terms of use and satisfaction in the context of medical information. On the other hand, specific research results provide practical implications for improving the services of medical-related academic search engines.

• Nuclear Engineering and Technology
• /
• v.25 no.2
• /
• pp.193-203
• /
• 1993

A new heuristic method for loading pattern search has been developed to overcome short-comings of the algorithmic approach. To reduce the size of vast solution space, general shuffling rules, a regionwise shuffling method, and a pattern grouping method were introduced. The entropy theory was applied to classify possible loading patterns into groups with similarity between them. The pattern search program was implemented with use of the PROLOG language. A two-group nodal code MEDIUM-2D was used for analysis of power distribution in the core. The above mentioned methodology has been tested to show effectiveness in reducing of solution space down to a few hundred pattern groups. Burnable poison rods were then arranged in each pattern group in accordance with burnable poison distribution rules, which led to further reduction of the solution space to several scores of acceptable pattern groups. The method of maximizing cycle length(MCL) and minimizing power-peaking factor(MPF) were applied to search for specific useful loading patterns from the acceptable pattern groups. Thus, several specific loading patterns that have low power-peaking factor and large cycle length were successfully searched from the selected pattern groups.