• Journal of Technology Innovation
• /
• v.1 no.1
• /
• pp.84-99
• /
• 1993

오래도록 생산성향상곡선 (또는 학습곡선), 생산함수, 그리고 대체곡선 등은, 서로 관련이 없는 별개의, 그리고 순전히 경험적인 (empirical) 현상들인 것들로서 이해되어 왔었다. 그러나 1980년대 중반에 발표된 Muth 교수의 탐색이론 (Search Theory)의 생산성향상곡선에서 관찰된 제반현상들을 모두 설명함으로써 이들 현상은 하나의 통합이론체계에 의하여 일관되게 설명되게 되었다. 이 이론의 초기형태는 그 보편성을 구속하는 네 가지 가설 위에 설립되었었으나 점차적으로 이들 가설들이 완화되면서 (relaxed) 이 이론은 또한 해독 력에서 뿐만 아니라 일반성에 있어서도 계속 강화되어 왔다. 본 논문의 목적은, 이들 네 가지 가설들 중 유일하게 아직 완화되지 못하고 있는, 실제 현상과 다분히 유리된, 두 번째 가설, 즉$\ulcorner$생산성향상을 위한 탐색과정에서 새로이 발견된 개량 신기술 (또는 생산방식) 은 즉각적으로 채택될 것$\lrcorner$이라는 가설을 완화함으로써, 보다 현실에 대한 해석력과 일반성 면에서 개선된 모델을 제시하는 데 있다. 이를 위하여 제시된 모델은 Muth 교수의 탐색이론모델에 두가지 변수를 더함으로써 확장하여 만든 모델이다. 이 두 변수는 신기술의 채택 (또는 획득)을 위하여 지불하여야 하는 투자비변수와 탐색과정을 통하여 발견은 되었으나 아직 채택은 되지 않은, 유보상태 신기술의 운영비용 변수(또는 수익성변수)등이다. 이 모델의 내용은, 생산성향상은 신기술이 구현된 (embodied) 장비 (equipment)를 사용함으로써 실현되며, 따라서 창의적 활동의 이득은 이들 장비에 대한 투자행위로서 실현된다는 것이다. 이 모델은 보다 나은 신기술이 또 발견될 것이라는 기대 하에, 현재 발견된 최신기술을 채택하지 않는 투자지연현상을 예측.설명해 주며 따라서 이로 인한 기술적 비효율성의 존재이유를 제시한다. 또한 이 모델은 생산성 향상곡선의 초기굴곡현상, 정체현상, 그리고 도약현상 등을 모두 설명해 준다.

• Journal of Information Management
• /
• v.27 no.2
• /
• pp.1-32
• /
• 1996

By the 1990s, Database Online Searching and CD-ROM Searching have been used universally in libraries. Due to their ease of use and facilitation, it is believed that such new media searching will produce more benefits than the usual printed materials. Furthermore, from the library management's point view, the new media searching's ability to minimize holding space will be another example of the advantage. The new media searching will have ever the printed materials. However, since it Is necessary to have an objective appraisal of the cost effectiveness in the implementation and the design of the new media system, it will be compared the new media searching with the conventional searching by using printed materials at the KIEP Library and Data Bank.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.12
• /
• pp.2221-2229
• /
• 2006

Optimal path search algorithm which is a killer application of mobile device to utilize location information should consider traffic flows of the roads as well as the distance between a departure and destination. The existing path search algorithms, however, are net able to cope efficiently with the change of the traffic flows. In this paper, we propose a new optimal path search algorithm. The algorithm takes the current flows into consideration in order to reduce the cost to get destination. It decomposes the road network into Fixed Grid to get variable heuristics. We also carry out the experiments with Dijkstra and Ar algorithm in terms of the execution time, the number of node accesses and the accuracy of path. The results obtained from the experimental tests show the proposed algorithm outperforms the others. The algorithm is highly expected to be useful in a advanced telematics systems.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.215-221
• /
• 2010

Hopfield networks have been proposed as a new computational tool for finding the shortest path of networks. Zhang and Ali studied the method of finding shortest path by expended neurons of Hopfield networks. Ali Algorithm is well known as the tool with the neurons of branch numbers. Where a network grows bigger, it needs much more time to solve the problem by Ali algorithm. This paper modifies the method to find the synapse matrix and the input bias vector. And it includes the eSPN algorithm after proper iterations of the Hopfield network. The proposed method is a tow-stage method and it is more efficient to find the shortest path.The proposed method is verified by three sample networks. And it could be more applicable then Ali algorithm because it's fast and easy. When the cost of brach is changed, the proposed method works properly. Therefore dynamic cost-varing networks could be used by the proposed method.

• Journal of Advanced Navigation Technology
• /
• v.21 no.5
• /
• pp.443-449
• /
• 2017

Swarm of low-cost UAVs for search mission has benefit in the sense of rapid search compared to use of single high-end UAV. As the number of UAVs forming swarm increases, not only the time for the mission planning increases, but also the system to operate UAVs has excessive burden. This paper addresses a decentralized area search algorithm adequate for multiple UAVs which takes advantages of flexibility, robustness, and simplicity. To down the cost, it is assumed that each UAV has limited ability: close-communication, basic calculation, and limited memory. In close-communication, heath conditions and search information are shared. And collision avoidance and consensus of next search direction are then done. To increase weight on un-searched area and to provide overlapped search, the score function is introduced. Performance and operational characteristics of the proposed search algorithm and mission planning logic are verified via numerical simulations.

• Journal of Korean Society of Transportation
• /
• v.23 no.6 s.84
• /
• pp.91-102
• /
• 2005

When it comes to the process of information storage, people are likely to organize individual information into the forms of groups rather than independent attributes, and put them together in their brains. Likewise, in case of finding the shortest path, this study suggests that a Hierarchical Road Network(HRN) model should be selected to browse the most desirable route, since the HRN model takes the process mentioned above into account. Moreover, most of drivers make a decision to select a route from origin to destination by road hierarchy. It says that the drivers feel difference between the link travel tine which was measured by driving and the theoretical link travel time. There is a different solution which has predicted the link travel time to solve this problem. By using this solution, the link travel time is predicted based on link conditions from time to time. The predicated link travel time is used to search the shortest path. Stochastic Process model uses the historical patterns of travel time conditions on links. The HRN model has compared favorably with the conventional shortest path finding model in tern of calculated speeds. Even more, the result of the shortest path using the HRN model has more similar to the survey results which was conducted to the taxi drivers. Taxi drivers have a strong knowledge of road conditions on the road networks and they are more likely to select a shortest path according to the real common sense.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.127-135
• /
• 2008

Generally, optimum shortest path algorithms adopt single attribute objective among several attributes such as travel time, travel cost, travel fare and travel distance. On the other hand, multi-objective shortest path algorithms find the shortest paths in consideration with multi-objectives. Up to recently, the most of all researches about multi-objective shortest paths are proceeded only in single transportation mode networks. Although, there are some papers about multi-objective shortest paths with multi-modal transportation networks, they did not consider transfer problems in the optimal solution level. In particular, dynamic programming method was not dealt in multi-objective shortest path problems in multi-modal transportation networks. In this study, we propose a multi-objective shortest path algorithm including dynamic programming in order to find optimal solution in multi-modal transportation networks. That algorithm is based on two-objective node-based label correcting algorithm proposed by Skriver and Andersen in 2000 and transfer can be reflected without network expansion in this paper. In addition, we use non-dominated paths and tree sets as labels in order to improve effectiveness of searching non-dominated paths. We also classifies path finding attributes into transfer and link travel attribute in limited transit networks. Lastly, the calculation process of proposed algorithm is checked by computer programming in a small-scaled multi-modal transportation network.

• Journal of Broadcast Engineering
• /
• v.19 no.5
• /
• pp.627-630
• /
• 2014

The latest video coding standard, high efficiency video coding (HEVC) achieves high coding efficiency by employing a quadtree-based coding unit (CU) block partitioning structure which allows recursive splitting into four equally sized blocks. At each depth level, each CU is partitioned into variable sized blocks of prediction units (PUs). However, the determination of the best CU partition for each coding tree unit (CTU) and the best PU mode for each CU causes a dramatic increase in computational complexity. To reduce such computational complexity, we propose a fast PU decision algorithm that early terminates PU search. The proposed method skips the computation of R-D cost for certain PU modes in the current CU based on the best mode and the rate-distortion (RD) cost of the upper depth CU. Experimental results show that the proposed method reduces the computational complexity of HM12.0 to 18.1% with only 0.2% increases in BD-rate.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.13 no.3
• /
• pp.48-55
• /
• 1999

Ths paper presents an optimization method which determines locations and size of capacitors simultaneously while minimizing power losses and improving voltage profile in radial distribution systems. Especially, the cost function associated with capacitor pla.cerrent is considered as step function due to banks of standard discrete capacities. Genetic algorithms(GA) are used to obtain efficiently the solution of the cost function associated with capacitors which is non-continuous and non-differentiable function. The strings in GA consist of the node nwnber index and size of capacitors to be installed. The length mutation operator, which is able to change the length of strings in each generation, is used. The proposed Jrethod which determines locations and size of capacitors simultaneously can reduce power losses and improve voltage proftle with capacitors of minimum size. Its efficiency is proved through the arolication in radial distribution systems.ystems.

• Spatial Information Research
• /
• v.18 no.3
• /
• pp.63-72
• /
• 2010

The vehicle routing problem with simultaneous pick-up and delivery (VRPSPD) is a variant of the vehicle routing problem (VRP) that customers require simultaneously a pick-up and delivery service. The main objective of VRPSPD is to minimize a cost of routes satisfying many constraints. Traditional VRPSPD have been dealt with a static environment. The static environment means that a routing data and plan cannot be changed. For example, it is difficult to change a vehicle's routing plan so that a vehicle serves the pick-up demands of new customers during the delivery service. Therefore, traditional approach is not suitable for dynamic environments. To solve this problem, we propose a novel approach for finding efficient routes using a real-time re-routing heuristics based on the Location Based Service (LBS). Our re-routing heuristics can generate a new route for vehicle that satisfies a new customer's demand considering the current geographic location of a vehicle. Experimental results show that our methodology can reduce the traveling cost of vehicles comparing with other previous methods.