• The Korean Journal of Franchise Management
• /
• v.3 no.1
• /
• pp.92-110
• /
• 2012

Due to the social problems including recent economic crisis and unemployment rate increase, the demand of business foundation market has been increased and, in the meantime, on the basis of the business foundation support policy of the government including youth foundation support policy and Small & Medium Business Administration foundation planning, business foundation market has been showing steady growth trend. With this enlargement of foundation market, as the accompanied increase of franchise market is expected, it is considered that the importance of more realistic and concrete research about franchise market be larger than before. This study considered brand image, main office support, foundation cost, information search activity as the advanced variable of effect on brand selection and established the cause of effect on brand selection by improving the existing advanced research, and its result is as follows. First, according to foundation business kind, age, sex, yes or no of marriage, there is some difference III the thought about brand image and foundation possibility. Second, Second, the most important factor of franchise contract intention is economical specificity. It is difficult to consider brand image, franchise support and information search activity as the property having a big effect on preliminary founder, and it was shown that the cost for franchise management(Consistency with initial foundation cost and self-capital, promotion cost, management fund, facility/equipment reinvestment, etc.) is an important property. Specially, it was shown that consistency with initial foundation cost and self-capital is the most important factor for preliminary founder.

• Review of Culture and Economy
• /
• v.20 no.3
• /
• pp.3-33
• /
• 2017

The present study analyzed movie consumption behavior from the perspective of transaction cost, taking into account the possible incurrence of additional costs in the process of consumers obtaining movie information to choose movies. Regression and multinomial logistic regression analyses were performed in the analysis by taking movie information and the individuals' social demographic characteristics as independent variables and the number and frequency of movies watched as dependent variables, using information from the "2015 movie consumer survey." The results showed that consumers considering elements such as "directors" and "online reviews" were found to be more active in movie consumption. The analysis of movie-watching frequency showed that the information considered when choosing a movie was different for high- and low-frequency movie viewers. Putting these factors together suggests that movie consumption can vary according to an individual's cultural capital, preferences, and their degree of movie information awareness. While existing studies have mostly analyzed the determinants of box office performance, the significance of the present study is its empirical analysis of individual movie information in terms of transaction cost. Based on the results above, it can be inferred that the cyclical structure of trading expenses influences movie consumption and, once preferences are formed through a certain level of consumption, the trading cost expenses decrease, which results in increasing consumption. Therefore, film makers need to establish and execute marketing strategies that appropriately use movie information so that consumers can reduce the trading costs necessary for movie watching.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.150-153
• /
• 2001

The selection of the optimal partners in supply chain management is one of the most critical success factors. In the past, partners for outsourcing production were selected repeatedly within a closed group of candidates due to the limited information and location of partners. But, the wide use of internet and the development of electronic commerce make it possible that the partners capable of providing the optimal services are selected regardless of their location or nationality. And the concept of partners was limited to the provider of production resources. In the supply chain management, the concept should be extended to the provider of transportation and warehouse due to the high portion of transportation cost among the total production cost Therefore, In this study, we propose an analytical approach to the selection of Production and transportation partners in supply chain management. For this purpose a mathematical model is developed, and then a heuristic algorithm based on tabu search is presented since the model belongs to the NP hard problem.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.717-720
• /
• 1998

In this paper, we propose a VLSI architecture for implementing a crecently proposed fast block matching algorithm, which is called the HSBMA3S. The proposed architecture consists of a systolic array based basic unit and two shift register arrays. And it covers a search range of -32 ~+31. By using a basic unit repeatedly, we can redcue the number of gates. To implement the basic unit, we can select one among various conventional systolic arrays by trading-off between speed and hardware cost. In this paper, the architecture for the basic unit is selected so that the hardware cost can be minimized. The proposed architecture is fast enough for low bit-rate applications (frame size of 352x288, 30 frames/sec) and can be implemented by less than 20,000 gates. Moreover, by simply modifying the basic unit, the architecture can be used for the higher bit-rate application of the frame size of 720*480 and 30 frames/sec.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.18 no.6
• /
• pp.9-15
• /
• 1981

A new algorithm is presented from minimiEing the gates cost and gate inputs cost for the multiple-output TANT networks. In this algorithm, multiple-output map is organized and multiple-output function is constructed by using combination of minterms in order of the number of head variables. Systematic combination is made by PSA algorithm, and so the total design procedure is simplified.

• Journal of Communications and Networks
• /
• v.14 no.1
• /
• pp.10-14
• /
• 2012

When tag privacy is required in radio frequency identification (ID) system, a reader needs to identify, and optionally authenticate, a multitude of tags without revealing their IDs. One approach for identification with lightweight tags is that each tag performs pseudo-random function with his unique embedded key. In this case, a reader (or a back-end server) needs to perform a brute-force search for each tag-reader interaction, whose cost gets larger when the number of tags increases. In this paper, we suggest a simple and efficient identification technique that reduces readers computation to $O$(${\sqrt{N}}$ log$N$) without increasing communication cost. Our technique is based on the well-known "meet-in-the-middle" strategy used in the past to attack symmetric ciphers.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.2235-2253
• /
• 2011

Digital document file such as Adobe Acrobat or MS-Office is encrypted by its own ciphering algorithm with a user password. When this password is not known to a user or a forensic inspector, it is necessary to recover the password to open the encrypted file. Password cracking by brute-force search is a perfect approach to discover the password but a time consuming process. This paper presents a new method of speeding up password recovery on Graphic Processing Unit (GPU) using a Compute Unified Device Architecture (CUDA). PDF files are chosen as a password cracking target, and the Abode Acrobat password recovery algorithm is examined. Experimental results show that the proposed method gives high performance at low cost, with a cluster of GPU nodes significantly speeding up the password recovery by exploiting a number of computing nodes. Password cracking performance is increased linearly in proportion to the number of computing nodes and GPUs.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.6
• /
• pp.30-37
• /
• 1997

We present an efficient technique, bidirectioanl inertial maximum cost search technique, for th edetection and segmentation of circular shaped objects using the spatial information around the neighborhood of the boundary candidates. This technique searches boundary candidates using local pixdl information such as pixel value and its direction. And then to exclude pseudo-boundary caused by shadows or noises, the local contrast is defined between the clique of the boundary candidates and the cliques of the background. In order to effectively segment circular shaped boundary, the technique also uses the curvature based on trigonometirc function which determines circular shaped boundary segments. Since the proposed technique is applied to the pixel cliques instead of a pixel itself, it is proposed method can easily find out circular boundaries form iamges of the PCB containing circular shaped parts and the trees with round fruits compared to boundary detection by using the pixel information and the laplacian curvature.

• Journal of Information Technology Services
• /
• v.7 no.3
• /
• pp.239-252
• /
• 2008

Since EA includes huge information of a company, it takes long time and high cost for company's employees to search for what they need. We try to make the foundation to solve this problem by using ontology technology based on semantic web. In this paper, we try to verify efficiency of EA ontology by developing ontology for Business Enterprise Architecture(BEA). The purpose of this paper is to develop BEA ontology to provide new information by reasoner and to discover new relations between matadata by using extracted information and data. The EA ontology we developed will provide the new way of access and use for companies. The experience of ontology development will help EA ontology development in various domains. In the future, the development of other EAs which has more information resources will help to solve problems for interoperability between different EAs.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.5
• /
• pp.444-449
• /
• 2006

Path planning is a key element in navigation of a mobile robot. Several algorithms such as a gradient method have been successfully implemented so for. Although the gradient method can provide the global optimal path, it computes the navigation function over the whole environment at all times, which result in high computational cost. This paper proposes a high-speed path planning scheme, called a gradient method with topological information, in which the search space for computation of a navigation function can be remarkably reduced by exploiting the characteristics of the topological information reflecting the topology of the navigation path. The computing time of the gradient method with topological information can therefore be significantly decreased without losing the global optimality. This reduced path update period allows the mobile robot to find a collision-free path even in the dynamic environment.