• Journal of Intelligence and Information Systems
• /
• v.12 no.1
• /
• pp.139-161
• /
• 2006

In this paper, we introduce a new combinatorial auction mechanism - N-Bilateral Optimized Combinatorial Auction (N-BOCA). N-BOCA is a flexible iterative combinatorial auction model that offers optimized trading for multi-suppliers and multi-purchasers in the supply chain. We design the N-BOCA system from the perspectives of architecture, protocol, and trading strategy. Under the given N-BOCA architecture and protocol, auctioneers and bidders have diverse decision strategies f3r winner determination. This needs flexible modeling environments. Hence, we propose an optimization modeling agent for bid and auctioneer selection. The agent has the capability to automatic model formulation for Integer Programming modeling. Finally, we show the viability of N-BOCA through prototype and experiments. The results say both higher allocation efficiency and effectiveness compared with 1-to-N general combinatorial auction mechanisms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.4
• /
• pp.467-478
• /
• 2016

In this paper, we try to find the optimal locations of NeNB(Nomadic evolved NodeB)s for maximizing the overall throughput of the PS-LTE networks. Since finding optimal locations of all NeNBs in a given area is NP-hard(Non-deterministic Polynomial time-hard) problem, we proposed a PSO-based heuristic approach. In order to evaluate the performance, we conducted two experiments. We compared performance with other schemes such as Exhaustive Search, Random Walk Search, and locating neighboring NeNBs with the same NeNB-to-NeNB distance. The proposed method showed the similar results to the exhaustive search method in terms of locating optimal position and user's data throughput. The proposed method, however, has the fast and consistent convergence time.

• Clean Technology
• /
• v.17 no.2
• /
• pp.103-109
• /
• 2011

The process optimization was carried out to improve the throwing power (TP) and the thickness uniformity of the electroless copper (Cu) plating, which plays a seed layer for the subsequent electroplating. The DOE (design of experiment) was employed to screen key factors out of all available operation parameters to influence the TP and thickness uniformity the most. It turned out that higher Cu ion concentration and lower plating temperature are advantageous to accomplish uniform via filling and they are accounted for based on the surface reactivity. To visualize what occurred experimentally and evaluate the phenomena qualitatively, the kinetic Monte Carlo (MC) simulation was introduced. The combination of neatly designed experiments by DOE and supporting theoretical simulation is believed to be inspiring in solving similar kinds of problems in the relevant field.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.4
• /
• pp.433-442
• /
• 2010

In this paper, self-calibration algorithm based on covariance matrix is proposed for compensating amplitude/phase mismatch in multi-baseline interferometer direction finding system. The proposed method is a solution to nonlinear constrained minimization problem which dramatically calibrate mismatch error using space sector concept with cost function as defined in this paper. This method, however, has a drawback that requires an estimated initial angle to determine the proper space sector. It is well known that this type of drawback is common in nonlinear optimization problem. Superior calibration capabilities achieved with this approach are illustrated by simulation experiments in comparison with interferometer algorithm for a varitiety of amplitude/phase mismatch error. Furthermore, this approach has been found to provide an exceptional calibration capabilities even in case amplitude and phase mismatch are more than 30 dB and over $5^{\circ}$, respectively, with sector spacing of less than $50^{\circ}$.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.963-973
• /
• 2005

Increasing attention is being recently devoted to various problems inherent in the topological design of networks systems. The topological structure of these networks can be based on service centers, terminals (users), and connection cable. Lately, these network systems are well designed with tiber optic cable, because the requirements from users become increased. But considering the high cost of the fiber optic cable, it is more desirable that the network architecture is composed of a spanning tree. In this paper, we present a GA (Genetic Algorithm) for solving bicriteria network topology design problems of wide-band communication networks connected with fiber optic cable, considering the connection cost, average message delay, and the network reliability We also employ the $Pr\ddot{u}fer$ number (PN) and cluster string in order to represent chromosomes. Finally, we get some experiments in order to certify that the proposed GA is the more effective and efficient method in terms of the computation time as well as the Pareto optimality.

• The KIPS Transactions:PartA
• /
• v.15A no.1
• /
• pp.17-26
• /
• 2008

This paper proposes an efficient caching mechanism appropriate for the integrated RFID middleware which can integrate wireless sensor networks (WSNs) and RFID (radio frequency identification) systems. The operating environment of the integrated RFID middleware is expected to face the situations of a significant amount of data reading from RFID readers, constant stream data input from large numbers of autonomous sensor nodes, and queries from various applications to history data sensed before and stored in distributed storages. Consequently, an efficient middleware layer equipping with caching mechanism is inevitably necessary for low latency of request-response while processing both data stream from sensor networks and history data from distributed database. For this purpose, the proposed caching mechanism includes two optimization methods to reduce the overhead of data processing in RFID middleware based on the classical cache implementation polices. One is data stream cache (DSC) and the other is history data cache (HDC), according to the structure of data request. We conduct a number of simulation experiments under different parameters and the results show that the proposed caching mechanism contributes considerably to fast request-response times.

• The KIPS Transactions:PartB
• /
• v.18B no.4
• /
• pp.193-200
• /
• 2011

This paper proposes a low-cost visual analyzer algorithm of human body motion for real-time applications such as human-computer interfacing, virtual reality applications in medicine and telemonitoring of patients. To reduce cost of its use, we design the algorithm to use a single camera. To make the proposed system to be used more conveniently, we avoid from using optical markers. To make the proposed algorithm be convenient for real-time applications, we design it to have a closed-form with high accuracy. To design a closed-form algorithm, we propose an idea that formulates motion of a human body joint as a 2D universal joint model instead of a common 3D spherical joint model, without any kins of approximation. To make the closed-form algorithm has high accuracy, we formulates the estimation process to be an optimization problem. Thus-desined algorithm is applied to each joint of the human body one after another. Through experiments we show that human body motion capturing can be performed in an efficient and robust manner by using our algorithm.

• Journal of Navigation and Port Research
• /
• v.31 no.10
• /
• pp.869-877
• /
• 2007

This paper proposes a realtime scheduling method using local search algorithm for non-crossable yard cranes in automated container terminal. To take into consideration the dynamic property of yard crane operation and satisfy the real time constraint, the proposed method repeatedly builds crane schedule for the jobs in a fixed length look-ahead horizon whenever a new job is requested In addition, the proposed method enables the co-operation between yard cranes through prior re-handling and re-positioning in order to resolve the workload imbalance problem between the two cranes, which is one of the primary causes that lower the performance of yard cranes. Simulation-based experiments have shown that the proposed method outperforms the heuristic based methods, and the cooperation scheme contributes a lot to the performance improvement.

• Journal of KIISE:Software and Applications
• /
• v.31 no.5
• /
• pp.570-576
• /
• 2004

It is very difficult to efficiently solve a large-scaled maximal covering problem(MCP) by a genetic algorithm. In this paper, we present new crossover and mutation operators specially designed for genetic algorithms to solve large-scaled MCPs efficiently. We also introduce a novel genetic algorithm employing unexpressed genes. Unexpressed genes are the genes which are not expressed and thus do not affect the evaluation of the individuals. These genes play the role of reserving information susceptible to be lost by the application of genetic operations but is suspected to be potentially useful in later generations. The genetic algorithm employing unexpressed genes enjoys the advantage of being able to maintain diversity of the population and thus can search more efficiently to solve large-scaled MCPs. Experiments with large-scaled real MCP data has shown that our genetic algorithm employing unexpressed genes significantly outperforms tabu search which is one of the popularly used local neighborhood search algorithms for optimization.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.11
• /
• pp.1086-1090
• /
• 2010

In recent, as many applications of sensor networks increase, various techniques have been studied to efficiently operate network systems. The query optimization scheme that is one of such techniques has been studied to reduce the data transmission cost. The data transmission is of great importance to the energy consumption of sensor networks. In this paper, we propose an energy-efficient multiple queries processing scheme by sharing sensor readings for multiple queries, when they are occurred in sensor networks. The proposed scheme reduces unnecessary data transmissions among the sensor nodes by intuitively identifying their locations using the grid structure. It also efficiently shares the data by recognizing the redundant regions of sensor nodes. In order to show the superiority of the proposed scheme, we compare it with the existing scheme in various experiments. As the result, the proposed scheme reduces about 65% energy consumption over the existing scheme.