• Journal of Technology Innovation
• /
• v.5 no.1
• /
• pp.206-222
• /
• 1997

The conventional analysis with which justifies government intervention of the private sector's innovation activities is the market failure approach. According to such analysis, fund allocation through autonomous market mechanisms is not optimal in technology financing because of the disparity between the desirable level of investment for society as a whole and that for private firms. To optimize the fund allocation, public policies such as subsidy, preferencial loan and venture capital investment programs are designed for technology development projects performed by private firms. They, however, have not been effective in increasing private investment for such projects. In most cases, it was found that little considerations given to the relationship between uncertainty embodied in technology development projects and each types of financing. With respect to optimizing fund allocation, technology development projects should be financed by different means according to their probability of success and the expected value of technology. Employing various theoretical models on financing decision-making we verify here that technology development projects to be supported by commercial banks or venture capital institutions is limited contingent upon levels of uncertainty adn expected value. Under the assumption that financial institutions are risk averse, loan or investment can be available only if the probability of success of the project is higher than the probability premium and the current market rate of interest. Therefore, the projects that have lower probability of success and/or small expected return are excluded from commercial loan or investment programs. However, the remaining projects, whose probability of success is low but with high expected return, may be applied under government subsidy programs. To achieve optimality of fund allocation and to activate technology financing, we conclude that there should be a systematic division of role among financial institutions including government commercial banks, and venture capital institutions.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.42 no.4
• /
• pp.7-14
• /
• 2005

Recently, images/videos have been preferred as the communication media because of their information-implication and easy recognizability. But the amount of their data is so large that it has been the major research area to compress their data. This paper is related to optimization in the image data format which can make a great effect in performance of data compression and is based on the wavelet transform and JPEG2000. This paper established a criterion to decide the data format to he used in wavelet transform which is on the bases of the data errors in frequency transform and quantization. This criterion has been used to extract the optimal data format experimentally. The result were (1, 9) of 10-bit fixed-point format for filter coefficients and (9, 7) of 16-bit fixed-point data format for wavelet coefficients and their optimality was confirmed.

• The Journal of Korea Robotics Society
• /
• v.6 no.2
• /
• pp.130-140
• /
• 2011

This paper proposes an optimal posture for the task-oriented movement of dual arm manipulator. A stability criterion function which consists of three kinds of feature-representative parameters has been utilized to define the optimal posture. The first parameter is the force which is applied to the object. The torque of each joint and position of arm are attained from the current sensor and encoder, respectively. From these two data, the applied force to an object is estimated using sum of vectors of the joint torques estimated from the measured current. In order to investigate the robustness of each posture, the variation of the end-effector from the encoder information has been utilized as the second parameter. And for the last parameter for the optimality, the total energy consumption has been used. The total consuming energy of each posture can be computed from the current information and the battery voltage. The proposed robot structure consists of a mobile inverted pendulum and dual manipulators. In order to define the optimal posture for the each object, external disturbances are applied to the mobile inverted pendulum robot and the first and second parameters are investigated to find the optimal posture among the pre-selected most representative postures. Finally, the proposed optimal posture has been verified by the proposed stability criterion function which consists of total force to the object, the fluctuation of the end-effector position, and total energy consumption. The effectiveness of the proposed algorithms has been verified and demonstrated through the practical simulations and real experiments.

• Journal of Satellite, Information and Communications
• /
• v.11 no.2
• /
• pp.55-59
• /
• 2016

Conventional RF energy harvesting systems can harvest energy and decode information from same source as an Hybirid-AP (H-AP). However, harvesting efficiency is seriously dependent on distance between users and H-AP. Therefore, in this paper, we proposed a transmission model for RF harvesting consisting of information and power source separately called Decoupled RF Energy harvesting networks. Main purpose of this paper is to maximize energy efficiency under various constraints of transmit power from H-AP and power beacon (PB), minimum quality of service and quality of harvested power of each users. To measure proposed model's performance, we proposed optimal time scheduling algorithms for energy efficiency (EE) maximization using Lagrangian dual decomposition theory that locally maximizes the EE by obtaining suboptimal values of three arguments : transmit power of H-AP, transmit power of PB, frame splitting factor. Experiment results show that the proposed energy-efficient algorithms converge within a few iterations with its optimality and greatly improve the EE compared to that of baseline schemes.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.2 s.14
• /
• pp.57-66
• /
• 2005

The Interconnecting Highways problem is an abstract of many practical Layout Design problems in the areas of VLSI design, the optical and wired network design, and the planning for the road constructions. For the road constructions, the shortest-length road layouts that interconnect existing positions will provide many more economic benefits than others. That is, finding new road layouts to interconnect existing roads and cities over a wide area is an important issue. This paper addresses an approximation scheme that finds near optimal road layouts for the Interconnecting Highways problem which is NP-hard. As long as computational resources are provided, the near optimality can be acquired asymptotically. This implies that the result of the scheme can be regarded as the optimal solution for the problem in practice. While other approximation schemes can be made for the problem, this proposed scheme provides a big merit that the algorithm designed by this scheme fits well to given problem instances.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.119-124
• /
• 2023

This paper proposes a new reference model that can represent data access with temporal locality and popularity bias. Among existing reference models, the LRU-stack model can express temporal locality, which is a characteristic that the more recently referenced data has, the higher the probability of being referenced again. However, it cannot take into account differences in popularity of the data. Conversely, the independent reference model can reflect the different popularity of data, but has the limitation of not being able to model changes in data reference trends over time. The reference model presented in this paper overcomes the limitations of these two models and has the feature of reflecting both the popularity bias of data and their changes over time. This paper also examines the relationship between the cache replacement algorithm and the reference model, and shows the optimality of the proposed model.

• Microbiology and Biotechnology Letters
• /
• v.9 no.1
• /
• pp.45-50
• /
• 1981

The effect of growth and the carbon sources including the molar ratio of fructose to glucose was studied for the maximization of inosine-5'-monophosphate (5'-IMP) production from Brebibacterium ammoniagenes D-21530. According to experimental results, fructose was more efficient to 5'-IMP accumulation than glucose, while the latter was better for the cell growth than the former. To synchronously use glucose and fructose as carbon source is to optimally control the cell growth and maximum production of 5'-IMP without change of other conditions. The optimal weight percent of fructose to sum of glucose and fructose was 20～40%, and the productivity improvement over the utilization of fructose was about 40%. And also the optimality of purine base such as adenine and guanine were considered. The optimal concentrations of adenine and guanine were near 50㎎/l.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.292-300
• /
• 2008

In multi-hop wireless networks like Wireless Mesh Networks (WMN) and Wireless Sensor Networks (WSN), nodes often rely on batteries as their power source. In such cases, energy efficient routing is critical. Many schemes have been proposed to find the most energy efficient path, but most of them do not achieve optimality on network lifetime. Once found, the energy efficient path is constantly used such that the energy of the nodes on the path is depleted quickly. As an alternative, the approaches that dynamically change the path at run time have also been proposed. These approaches, however, involve high overhead of establishing multiple paths. In this paper, we first find an optimal multi-path routing using LP. Then we apply an approximation algorithm to derive a near-optimal solution for single-path routing. We compare the performance of the proposed scheme with several other existing algorithms through simulation.

• Journal of KIISE
• /
• v.44 no.1
• /
• pp.63-70
• /
• 2017

This paper considers the problem of combining multiple strategies for solving sleeping bandit problems with stochastic rewards and stochastic availability. It also proposes an algorithm, called sleepComb(${\Phi}$), the idea of which is to select an appropriate strategy for each time step based on ${\epsilon}_t$-probabilistic switching. ${\epsilon}_t$-probabilistic switching is used in a well-known parameter-based heuristic ${\epsilon}_t$-greedy strategy. The algorithm also converges to the "best" strategy properly defined on the sleeping bandit problem. In the experimental results, it is shown that sleepComb(${\Phi}$) has convergence, and it converges to the "best" strategy rapidly compared to other combining algorithms. Also, we can see that it chooses the "best" strategy more frequently.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.4
• /
• pp.414-424
• /
• 2012

Finding or automatically generating problem instance is useful for algorithm analysis/test. The topic has been of interest in the field of hardware/software engineering and theory of computation. We apply objective value-distance correlation analysis to problem spaces, as previous researchers applied it to solution spaces. According to problems, we define the objective function by (1) execution time of tested algorithm or (2) its optimality; this definition is interpreted as difficulty of the problem instance being solved. Our correlation analysis is based on the following aspects: (1) change of correlation when we use different algorithms or different distance functions for the same problem, (2) change of that when we improve the tested algorithm, (3) relation between a problem instance space and the solution space for the same problem. Our research demonstrates the way of problem instance space analysis and will accelerate the problem instance space analysis as an initiative research.