• 가정과삶의질연구
• /
• 제14권3호
• /
• pp.91-108
• /
• 1996

The major purpose of this study was to find the influencing factors in explaining search patterns of product attributes in formation and to find if significant differences exist in search outcomes by search patterns. The data for this study were collected in a survey and the final sample consisted of 327 respondents purchased refrigerator 340 purchased bed. The important findings of this study are as follows: First the variables related to search cost-benefit play an important role in identifying search patterns for each of product attributers. The findings of this study provide some implications regarding consumer education programs and consumer information providing policies.

• 융합정보논문지
• /
• 제11권4호
• /
• pp.230-241
• /
• 2021

본 논문은 부정적 정보의 공개가 어떻게 단기간에 판매자의 수요를 증대시킬 수 있는지에 대한 경험적 분석을 통해 시장의 정보 불균형에 대한 중요한 이해를 제공하고자 한다. 이를 위해 본 연구는 기존의 관련 연구 결과에 더하여 정보 검색 비용이 부정적 정보 공개에 미치는 영향을 예측하고, 이러한 해석에 대하여 가상의 시장 거래를 통한 실험적 분석을 실시한다. 본 연구의 결과는 구매 위험도가 부정적 정보 검색에 중요한 역할을 하고 있는 반면 정보 검색 비용의 효과는 크지 않음을 나타내며, 특히 실험의 결과는 저품질의 제품을 판매하는 판매자가 어떻게 정보 공개를 통해 자신의 수익성 뿐 아니라 시장과 경쟁 제품의 수요를 증대시켜서 소비자 효용을 증대시킬 수 있는지를 보여준다.

• 전기학회논문지P
• /
• 제66권3호
• /
• pp.123-128
• /
• 2017

Electric utilities has been considered the necessity to introduce AM(asset management) of electric power facilities in order to reduce maintenance cost of existing facilities and to maximize profit. In order to make decisions in terms of repairs and replacements for power transformers, not only measuring by counting parts and labor costs, but comprehensive comparison including reliability and cost is needed. Therefore, this study is modeling input cost for power transformer during its entire life and also the life cycle cost (LCC) technique is applied. In particular, this paper presents an application of heuristic harmony search(HS) optimization algorithm to the convergence and the validity of economic life assessment of power transformer from LCC technique. This recently developed HS algorithm is conceptualized using the musical process of searching for a perfect state of harmony. It uses a stochastic random search instead of a gradient search so that derivative information is unnecessary. The effectiveness of the proposed identification method has been demonstrated through an economic life assessment simulation of power transformer using HS optimization algorithm.

• 한국ITS학회 논문지
• /
• 제4권3호
• /
• pp.9-22
• /
• 2005

교통망에서 경로의 총 통행비용은 통행비용과 인지비용으로 구분된다. 출발지와 도착지간에 상이하게 인지되는 비용을 고려하여 경로를 탐색하는 것은 전체경로를 열거해야 하는 문제 때문에 현실 적용에 한계가 있다. 따라서 현재 활용되고 있는 첨단교통정보체계(ATIS)에서 경로정보를 제공할 때 통행비용 만을 고려하여 경로를 탐색하는 기법을 적용하는 것이 일반적이다. 본 연구는 경로열거문제 없이 상이한 링크인지비용을 반영하는 최적 및 K 경로탐색기법을 제안한다. 이를 위해 링크를 경로의 최소단위로 정의하고, 따라서 두 링크의 비교가 경로의 비교로 확대되는 링크표지기반경로탐색기법을 활용하며, 도착지를 기반으로 후방향 최적링크인지경로트리를 구축한 후 출발지기반으로 전방향 최적의 링크총비용 경로트리를 구축하는 수식과 알고리즘을 제안한다.

• 가정과삶의질연구
• /
• 제7권1호
• /
• pp.15-25
• /
• 1989

The purpose of this study is to examine the factors affecting the consumer's search for information and the relationship between the amount of search and the final price paid. The model indicates the demand for search is affected by the market price of each durable good purchased, the tim available for search, family income, direct cost of search, the initial stock of information, effectiveness of search, and shopping attitudes. The final price savings are a function of search, price of dispersion in the market, the initial stock of information, and effectiveness of search. Data from the Pane Study on Consumer Decisions and Asset Management were used for the empirical testing of the theoretical model. The amount of information search as dependent variable is represented by two different measures, the level of discussion with others and the number of stores visited. The amount of discussion with others depends mainly on the respondent's shopping attitude. The higher the wife's desire to search, the higher the degree of husband's comparison shopping, the less the husband's perception of price-quality relationship, the higher the level of discussions with others. The number of stores visited depends on the average market price of product purchased and the level of family income. The higher the average market price and he higher the level of family income, the greater the number of stores visited. The final savings depend upon the level of information search. The greater the number of store visited, but the less the purchase is discussed with stores, the higher the final savings are.

• 한국통신학회논문지
• /
• 제25권9B호
• /
• pp.1604-1608
• /
• 2000

The three-step search (TSS) algorithm for block motion estimation has been widely used in real-time video coding due to the simplicity of the algorithm significant reduction of computationl cost and good performance. In this paper an improved three-step search (ITS) algorithm is proposed to improve the performance of the TSS algorithm. Simulation results show that in terms of motion compensation errors the proposed ITSS outperforms some popular fast search algorithms while it has the lower computational complexity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권5호
• /
• pp.1328-1342
• /
• 2013

Searchable encryption is a cryptographic protocol for searching a document in encrypted databases. A simple searchable encryption protocol, which is capable of using only one keyword at one time, is very limited and cannot satisfy demands of various applications. Thus, designing a searchable encryption with useful additional functions, for example, conjunctive keyword search, is one of the most important goals. There have been many attempts to construct a searchable encryption with conjunctive keyword search. However, most of the previously proposed protocols are based on public-key cryptosystems which require a large amount of computational cost. Moreover, the amount of computation in search procedure depends on the number of documents stored in the database. These previously proposed protocols are not suitable for extremely large data sets. In this paper, we propose a new searchable encryption protocol with a conjunctive keyword search based on a linked tree structure instead of public-key based techniques. The protocol requires a remarkably small computational cost, particularly when applied to extremely large databases. Actually, the amount of computation in search procedure depends on the number of documents matched to the query, instead of the size of the entire database.

• 전자공학회논문지B
• /
• 제33B권8호
• /
• pp.81-95
• /
• 1996

In this paper, we propose a motio estiamtion algorithm using low-resolution quantization to reduce the computation of the full search algorithm. The proposed algorithm consists of the low-resolution search which determins the candidate motion vectors by comparing the low-resolution image and the full-resolution search which determines the motion vector by comparing the full-resolution image on the positions of the candidate motion vectors. The low-resolution image is generated by subtracting each pixel value in the reference block or the search window by the mean of the reference block, and by quantizing it is 2-bit resolution. The candidate motion vectors are determined by counting the number of pixels in the reference block whose quantized codes are unmatched to those in the search window. Simulation results show that the required computational cost of the proposed algorithm is reduced to 1/12 of the full search algorithm while its performance degradation is 0.03~0.12 dB.

• 한국조경학회지
• /
• 제29권2호
• /
• pp.68-76
• /
• 2001

The purpose of this study is to computerize street tree management using a CAD program in order to manage the drawing record of street trees systematically and concurrently. The configuration of this program is composed of Reference Data, Data Inquiry, and Cost Assessment. The Reference Data includes characteristics of trees, monthly managements records, damage by blight and insects and usage of pesticides. The Data Inquiry includes an individual search of the tree index, simple searches and multiple searches. The Cost Assessment includes two main components, the data input with labor cost, manure ocst and pesticide cost and the assesment of management cost for prevention of blight and insects, pruning and fertilization. The results of this study are as follows: 1) When there are practices such as transplanting and removing of street trees it is immediately updated with the various situation. By creating an in progress a tree management system, up to the date information can be given to the manager for decision making. 2) To identify individual tree at the site or in drawing, the street name and numbers were used instead of coordinates. Tree tags are attached to the street trees individually. It can make DB management simple and easy. 3) By doing simple or multiple search with constructed DB, data can be provided quickly. 4) The result of this type of search are useful in the assessment of management cost very useful in regards to items such as the pruning, pesticides scattering and fertilization. 5) By using the AutoCAD software and existing PC without purchasing new equipment, the cost of system implementation can be minimized.

• 한국문헌정보학회지
• /
• 제19권
• /
• pp.189-241
• /
• 1990

This study identified cognitive styles of online searchers in terms of Field Dependence (FD) and Field Independence (FI) dimension and determined whether searching performance was affected by FD / FI cognitive differences between online searchers and the extent to which searching performance was affected by the FD / FI dimension of cognitive style. This study used a quasi experimental design with 41 student subjects using the Lockheed DIALOG system and ERIC ONT AP database. Cognitive styles of student subjects were measured by using GEFT (Group Embedded Figure Test) and the subjects were divided into two cognitive groups- FD and FI based on the GEFT scores. Each subject was assigned two predetermined searches which had different search goals-a 'high precision search' and a 'high recall search.' Search performance of the two cognitive groups on the two problems was compared in order to see how these two groups responded to achieving different search goals in terms of search strategy, search inputs, and resulting search outputs. The major findings of this study were: 1. The pattern of approaching a search problem regardless of whether it was a high precision search or a high recall search was not significantly different between the two cognitive groups. 2. The FI group tended to use significantly more terms for the high recall search than the FD group but slightly less time than the FD group. However, significant differences in connect time between the two groups were not revealed. 3. For both search problems the FI group achieved a significantly higher success rate than the FD group. The FI group were significantly more successful searchers than the FD group. As for unit / cost, although the FI group were more cost effective than those of the FD group for both searches, these differences were too small to be statistically significant. 4. Mean differences of the search performance variables between the FD / FI groups were consistent across the two types of search questions. The FI group seemed to be equally effective for both types of search questions. In conclusion, the differences found in number of terms used and success rate between the two cognitive groups apparently resulted from different cognitive styles.