• The Journal of Industrial Distribution & Business
• /
• v.12 no.1
• /
• pp.7-13
• /
• 2021

Purpose: Unemployment in its general form is a result stemming from the decisions of workers to search for a new and better paying job. In this study, the view that unemployed workers were not simply desiring any job, but one that would maximize their expected future outcome, was examined. Research design, data, and methodology: In order for collection of data and analysis, the panel dates of individual applications for job openings on job search websites were utilized to examine search effort and period for individuals. Results: It was found that the number of applications sent by a job seeker declined over their period of job searching, and that job seekers over a long duration of time tend to send relatively more applications per week throughout their entire search period. The latter finding contradicts the implications of the standard labor search effort models. Conclusions: It can be observed that these job search models fail to capture several key elements in search efforts, and that the search time for an offer is not entirely predetermined by the labor market conditions and socio-economic (individual) characteristics of the searcher. It can be shortened as he or she intensifies their job search efforts.

• Journal of the Korean Society for Library and Information Science
• /
• v.30 no.3
• /
• pp.25-36
• /
• 1996

The purpose of the study is to identify what search options are used to decide how to search on the online catalog system, and to suggest a format of the initial screen NOTIS and Dynix systems were used. Data collection was conducted in accordance with a $'2\times2'$ design. The study shows the effect on user choices of the initial men formal especially where the arrangement and breadth of search options are concerned. The availability of search options provides various users' search option selection The results of the study suggest that users can input only search term(s) on the initial screen without choice of search option Then, users may select search fields depending upon the results of searching. This method can reduce the search fail when users select wrong search option on the online catalog.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.11
• /
• pp.57-66
• /
• 2022

In this paper, we propose a legal document search method that uses the Sentence-BERT model. The general public who wants to use the legal search service has difficulty searching for relevant precedents due to a lack of understanding of legal terms and structures. In addition, the existing keyword and text mining-based legal search methods have their limits in yielding quality search results for two reasons: they lack information on the context of the judgment, and they fail to discern homonyms and polysemies. As a result, the accuracy of the legal document search results is often unsatisfactory or skeptical. To this end, This paper aims to improve the efficacy of the general public's legal search in the Supreme Court precedent and Legal Aid Counseling case database. The Sentence-BERT model embeds contextual information on precedents and counseling data, which better preserves the integrity of relevant meaning in phrases or sentences. Our initial research has shown that the Sentence-BERT search method yields higher accuracy than the Doc2Vec or TF-IDF search methods.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.9
• /
• pp.1521-1526
• /
• 2007

This paper presents the application of Adaptive Evolutionary Algorithm (AEA) to search an optimal setting of overcurrent relay coordination to protect ring distribution systems. The AEA takes the merits of both a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner to use the global search capability of GA and the local search capability of ES. The overcurrent relay settings and coordination requirements are formulated into a set of constraint equations and an objective function is developed to manage the overcurrent relay settings by the Time Coordination Method. The domain of overcurrent relays coordination for the ring-fed distribution systems is a non-linear system with a lot of local optimum points and a highly constrained optimization problem. Thus conventional methods fail in searching for the global optimum. AEA is employed to search for the optimum relay settings with maximum satisfaction of coordination constraints. The simulation results show that the proposed method can optimize the overcurrent relay settings, reduce relay mis-coordinated operations, and find better optimal overcurrent relay settings than the present available methods.

• Journal of computational fluids engineering
• /
• v.17 no.4
• /
• pp.32-40
• /
• 2012

Efficient Global Optimization (EGO) method is a global optimization technique which can select the next sample point automatically by infill sampling criteria (ISC) and search for the global minimum with less samples than what the conventional global optimization method needs. ISC function consists of the predictor and mean square error (MSE) provided from the kriging model which is a stochastic metamodel. Also the constrained EGO method can minimize the objective function dealing with the constraints under EGO concept. In this study the constrained EGO method applied to the RAE2822 airfoil shape design formulated with the constraint. But the noisy CFD data caused the kriging model to fail to depict the true function. The distorted kriging model would make the EGO deviate from the correct search. This distortion of kriging model can be handled with the interpolation(p=free) kriging model. With the interpolation(p=free) kriging model, however, the search of EGO solution was stalled in the narrow feasible region without the chance to update the objective and constraint functions. Then the accuracy of EGO solution was not good enough. So the three-step search method was proposed to obtain the accurate global minimum as well as prevent from the distortion of kriging model for the noisy constrained CFD problem.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2470-2476
• /
• 1997

We propose a new real-time search algorithm and provide experimental evaluation and comparison of the new algorithm with mini-min lookahead algorithm. Many other real-time heuristic-search approached often divide the problem space to several sub-problems. In this paper, the proposed algorithm guarantees not only the sub-problem deadline but also total deadline. Several heuristic real-time search algorithms such as $RTA^{\ast}$, SARTS and DYNORA have been proposed. The performance of such algorithms depend on the quality of their heuristic functions, because such algorithms estimate the search time based on the heuristic function. In real-world problem, however, we often fail to get an effective heuristic function beforehand. Therefore, we propose a new real-time algorithm that determines the sub-problem deadline based on the status of search space during sub-problem search process. That uses the cut-off method that is a dynamic stopping-criterion-strategy to search the sub-problem.

• International journal of advanced smart convergence
• /
• v.10 no.3
• /
• pp.72-80
• /
• 2021

Metaverse is an immersive 3D virtual environment, a true virtual artificial community in which avatars act as the user's alter ego and interact with each other. If we do not manage the hype for the metaverse, which has recently been receiving a surge in interest, the metaverse will fail to cross the chasm. In this study, to provide stakeholders with insights for the successful introduction and growth of the 3D immersive next-generation virtual world, metaverse, we analyzed user-side interest, media-side interest, and research-side interest. For this purpose, in this study, search traffic, news frequency and topic, and research article frequency and topic were analyzed. The methodology and results of this study are expected to provide insight for the stable success of metaverse transformation and the coexistence of the real world and the virtual world through hyper-connection and hyper-convergence.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.531-538
• /
• 2008

With the dynamic and mobile nature of ad hoc networks, links may fail due to topology changes. So, a major challenge in ad hoc network is dynamically to search paths from a source to destination with an efficient routing method, which is an important issue for delay-sensitive real-time application. The main concerns of graph theory in communications are finding connectivity and searching paths using given nodes. A topology of the nodes in ad hoc networks can be modeled as an adjacency matrix. In this paper, based on this adjacency matrix, we propose new path search algorithms using a sequence of matrix calculation. The proposed algorithms can search paths from a destination to a source using connectivity matrix. Two matrix-based algorithms for two different purposes are proposed. Matrix-Based Backward Path Search(MBBS) algorithm is designed for shortest path discovery and Matrix-Based Backward Multipath Search(MBBMS) algorithm is for multipath search.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.49-56
• /
• 2006

A special feature of P2P distributed system isn't always the guarantee of online status for peers. In other words we want to download the file from the peer when we use the P2P system but it sometimes caused this system to fail the download. Many studies to resolve this problem depend on re-transmission method. It caused to lower performance so we have to resolve this problem. In this study, we analysis the average usage time of P2P application user and raise the resource transmission guarantee to apply the selection criteria of resource supplier. Moreover the combinations of distributed object replication techniques, the role to enhance the data transmission opportunity of high popularity resource. will cause this search algorithm to advance.

• Journal of the Korean Society for Library and Information Science
• /
• v.32 no.1
• /
• pp.169-187
• /
• 1998

The primary purpose of this study is to compare printed index and abstract user's behaviours with digital index and abstract user's behaviours, and to verify of structured characteristics of a printed index and abstract. The major findings are as follows: (1) When the research topic is not specified enough, users tend to rely on printed indexes and abstracts search, whereas they utilize digital form in order to do retrospective search in the stage of research when the topic is determined. (2) Printed index and abstract users are expecting small number of literatures in search, whereas digital index and abstract users are expecting large number of literatures to be found The former are more satisfied with the result of search than the latter. (3) Digital index and abstract users experience more search failure than printed Index and abstract users. When they fail to find wanted materials, both users turn to the other form of indexes and abstracts. (4) Printed index and abstract users shows significantly less knowledge on online searching than digital index and abstract users.