• Journal of Multimedia Information System
• /
• v.4 no.4
• /
• pp.219-224
• /
• 2017

This paper is to introduce an application of face recognition algorithm in parallel. We have experiments of 25 images with different motions and simulated the image recognitions; grouping of the image vectors, image normalization, calculating average image vectors, etc. We also discuss an analysis of the related eigen-image vectors and a parallel algorithm. To develop the parallel algorithm, we propose a new type of initial matrices for eigenvalue problem. If A is a symmetric matrix, initial matrices for eigen value problem are investigated: the "optimal" one, which minimize ${\parallel}C-A{\parallel}_F$ and the "super optimal", which minimize ${\parallel}I-C^{-1}A{\parallel}_F$. In this paper, we present a general new approach to the design of an initial matrices to solving eigenvalue problem based on the new optimal investigating C with preserving the characteristic of the given matrix A. Fast all resulting can be inverted via fast transform algorithms with O(N log N) operations.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.4
• /
• pp.365-370
• /
• 2007

This paper studies an automation problem of a heating, a ventilating, and an air conditioning (HVAC) for the development of smart space. The HVAC system is described by the fuzzy system for the stability analysis and the controller design. The linear matrix inequalities (LMIs) conditions are derived for the stabilization problem of the closed-loop system under the analog control. Also, it is required to digitally redesign the pre-designed the analog HVAC control system in order to accomplish the remote control via web. It is shown the this digital redesign problem can be converted to the convex optimization problem with the LMI constraints. An example is provided to show the effectiveness of the proposed method.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.1
• /
• pp.20-28
• /
• 2012

We define a language $\mathcal{RS}$, a subclass of the scheduling language $\mathcal{RS}V$ (resource constrained project scheduling with variant processes). $\mathcal{RS}$ involves the determination of the starting times for ground activities of a project satisfying precedence and resource constraints, in order to minimize the total project duration. In $\mathcal{RS}$ ground activities and two structural symbols (operators) 'seq' and 'pll' are used to construct activity-terms representing scheduling problems. We consider three different variants for formalizing the $\mathcal{RS}$-scheduling problem, the optimizing variant, the number variant and the decision variant. Using the decision variant we show that the problem $\mathcal{RS}$ is $\mathcal{NP}$-complete. Further we show that the optimizing variant (or number variant) of the $\mathcal{RS}$-problem is computable in polynomial time iff the decision variant is computable in polynomial time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.7
• /
• pp.587-594
• /
• 2005

In this paper, a robust correlation-based video tracking is proposed to track a moving object in correlated image sequences. A correlation-based video tracking algorithm seeks to align the incoming target image with the reference target block image, but has critical problems, so called a false-peak problem and a drift phenomenon (correlator walk-off. The false-peak problem is generally caused by highly correlated background pixels with similar intensity of a moving target and the drift phenomenon occurs when tracking errors accumulate from frame to frame because of the nature of the correlation process. At first, the false-peaks problem for the ordinary correlation-based video tracking is investigated using a simple mathematical analysis. And, we will suggest a robust selective-attention correlation measure with a gradient preprocessor combined by a drift removal compensator to overcome the walk-off problem. The drift compensator adaptively controls the template block size according to the target size of interest. The robustness of the proposed method for practical application is demonstrated by simulating two real-image sequences.

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.971-974
• /
• 2002

Petri net is an effective modeling tool for concurrent systems. Liveness problem is one of analysis problems in Petri net theory verifying whether the system is free from any local deadlocks. It is well known that computational complexity of liveness problem of general Petri net is deterministic exponential space. Some subclasses, such as marked graph and free choice net, are suggested where liveness problem is verified in less complexity. This paper studies liveness of siphon containing circuit (SCC) net. Liveness condition based on algebraic inequalities is shown. Then polynomial time decidability of liveness of SCC net is derived, if the given net is known to be an SCC net a priori.

• Korean Journal of Computational Design and Engineering
• /
• v.5 no.1
• /
• pp.79-87
• /
• 2000

This paper presents an integrated but open product development environment for distributed and collaborative design. The web-based framework, called DOME, allows designers to build integrated models using both local and distributed resources, and to collaborate by exchanging services in a network-centric product development environment. Thus, an integrated model can be created while each participant focuses on his or her own area of expertise. A design problem model is created by connecting modules, which represent specific system components, analysis capabilities/software, disciplines, or organizations relevant to the problem. The modules interact with each other using service exchanges based upon the CORBA standard communication protocol. The goal of this framework is tall provide the ability to rapidly construct integrated design problem models to facilitate collaborative design work, improve product quality and reduce development time. Ultimately, it should allow specialized engineering applications and design problem models to operate under a common design environment.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.530-533
• /
• 1995

This paper deals with the problem of motion planning for a unicycle-like robot. We present a simple local planner for unicycle model, based on an approximation of the desired configuration generated by local holonomic planner that ignores motion constraints. To guarantee a collision avoidance, we propose an inequality constraint, based on the motion analysis with the constant control input and time interval. Consequently, we formulate our problem as the constrained optimization problem and a feedback scheme based on local sensor information is established by simply solving this problem. Through simulations, we confirm the validity and effectiveness of our algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.6
• /
• pp.596-601
• /
• 2011

Autonomous navigating algorithms for mobile robots have been proved to be a difficult task. Based on the excellent homing performance shown by many insects, bio-inspired navigation algorithms for robotic experiments have been widely researched and applied to the design of navigational strategies for mobile robots. In this paper, among them, we analyze two simple landmark navigation methods their strengths and limits. We investigate the effect of the occlusion problem mainly, which is an important yet tough problem in many landmark navigation algorithms. In the point of view of the error of homing vector and the performance of the homing paths in the environment with artificial occlusions, we investigate the effect of occlusion problem in both methods in order to further study on solutions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.1
• /
• pp.69-83
• /
• 1994

This paper deals with a capacitated ring-star network design problem (CRSNDP) with node capacity constraints. The CRSNDP is formulated as a mixed 0-1 integer problem, and a 2-phase heuristic solution procedure, ADD & VAM and RING, is developed, in which the CRSNDP is decomposed into two subproblems : the capacitated facility location problem (CFLP) and the traveling sales man problem (TSP). To solve the CFLP in phase I the ADD & VAM procedure selects hub nodes and their appropriate capacity from a candidate set and then assigns them user nodes under node capacity constraints. In phase II the RING procedure solves the TSP to interconnect the selected hubs to form a ring. Finally a solution of the CRSNDP can be achieved through combining two solution of phase I & II, thus a final design of the capacitated ring-star network is determined. The analysis of computational results on various random problems has shown that the 2-phase heuristic procedure produces a solution very fast even with large-scale problems.

• Journal for History of Mathematics
• /
• v.25 no.2
• /
• pp.71-95
• /
• 2012

Nowadays, the big issues on mathematics education are mathematical modeling, mathematization, and problem solving. So, this paper looks about these issues. First, after 1990's, the researchers interested in mathematical model and mathematical modeling. So, this paper looks about mathematical model and mathematical modeling. Second, it looks about Freudenthal' mathematization after 1970's. And then, it compared with mathematical modeling. Also, it looks about that problem solving focused on mathematics education since 1980's. And it compared with mathematical modeling.