• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.695-700
• /
• 2005

In the sensor network, a lot of sensor nodes are scattered sparsely and organizes a united communication network between each node. After that, environmental information around each sensor node are gathered and analyzed. Because each node operates under resource constraint, the efficiency and hardware specification of a node should be maximized. There exist technical constraints until now but recent technical progress in IC fabrication and wireless network enables to construct a tiny embedded system, which has the properties of low cost, low power consumption, multi functions. Wireless sensor network becomes a modern research field with technical improvements, is studied in numerous laboratories, and is called as diverse different project names - Wireless Integrated Network Sensors (WINS), Mobile Ad hoc NETwork (MANET), Ubiquitous Sensor Network (USN). TinyOS is one of leading project and is widely used. In this paper, we suggest a sensor network, which uses TinyOS platforms and aims for context awareness in a home environment.

• 유체기계공업학회:학술대회논문집
• /
• 2006.08a
• /
• pp.349-352
• /
• 2006

The conventional segregated finite element formulation produces a small and simple matrix at each step than in an integrated formulation. And the memory and cost requirements of computations are significantly reduced because the pressure equation for the mass conservation of the Navier-Stokes equations is constructed only once if the mesh is fixed. However, segregated finite element formulation solves Poisson equation of elliptic type so that it always needs a pressure boundary condition along a boundary even when physical information on pressure is not provided. On the other hand, the conventional integrated finite element formulation in which the governing equations are simultaneously treated has an advantage over a segregated formulation in the sense that it can give a more robust convergence behavior because all variables are implicitly combined. Further it needs a very small number of iterations to achieve convergence. However, the saddle-paint-type matrix (SPTM) in the integrated formulation is assembled and preconditioned every time step, so that it needs a large memory and computing time. Therefore, we newly proposed the P2PI semi-segregation formulation. In order to utilize the fact that the pressure equation is assembled and preconditioned only once in the segregated finite element formulation, a fixed symmetric SPTM has been obtained for the continuity constraint of the present semi-segregation finite element formulation. The momentum equation in the semi-segregation finite element formulation will be separated from the continuity equation so that the saddle-point-type matrix is assembled and preconditioned only once during the whole computation as long as the mesh does not change. For a comparison of the CPU time, accuracy and condition number between the two methods, they have been applied to the well-known benchmark problem. It is shown that the newly proposed semi-segregation finite element formulation performs better than the conventional integrated finite element formulation in terms of the computation time.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.9 no.1
• /
• pp.33-40
• /
• 1989

In the design of reinforced concrete framed structures, which consist of various design variables, the objective and the constraint functions are formulated in complicated forms. Usually iterative methods have been used to optimize the design variables. In this paper, multilevel formulation is adopted, and design variables are selected in reduced numbers at each level, to reduce the iterative cycle and to accelerate the convergence rate. At level 1, elastic analysis is performed to get the upper and lower bounds of the redistributed design moments due to inelastic behavior of the frame. Then the design moments are taken as design variables and optimized at level 2, and the sizing variables are optimized at level 3. The optimization of redistributed moments is performed using the design sensitivity obtained at the level 2, and force approximation technique is used to reflect the variation of design variables in the lower level to the upper level. The design variables are selected in reduced numbers at each level, and the optimization formulation is simplified effectively. A cost function is taken as the objective function, and the constraints of the stress of the structures are derived from BSI CP 110 following limit state theory. Numerical examples are included to prove the effectiveness of the developed algorithm.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.12
• /
• pp.1106-1114
• /
• 2012

To achieve synchronized motion between a wearable robot and a human user, the redundancy must be resolved in the same manner by both systems. According to the seven DOF (Degrees of Freedom) human arm model composed of the shoulder, elbow, and wrist joints, positioning and orientating the wrist in space is a task requiring only six DOFs. Due to this redundancy, a given task can be completed by multiple arm configurations, and thus there exists no unique mathematical solution to the inverse kinematics. This paper presents analysis on the kinematic and dynamic aspect of the human arm movement and their effect on the redundancy resolution of the human arm based on a seven DOF manipulator model. The redundancy of the arm is expressed mathematically by defining the swivel angle. The final form of swivel angle can be represented as a linear combination of two different swivel angles achieved by optimizing different cost functions based on kinematic and dynamic criteria. The kinematic criterion is to maximize the projection of the longest principal axis of the manipulability ellipsoid for the human arm on the vector connecting the wrist and the virtual target on the head region. The dynamic criterion is to minimize the mechanical work done in the joint space for each two consecutive points along the task space trajectory. As a first step, the redundancy based on the kinematic criterion will be thoroughly studied based on the motion capture data analysis. Experimental results indicate that by using the proposed redundancy resolution criterion in the kinematic level, error between the predicted and the actual swivel angle acquired from the motor control system is less than five degrees.

• Proceedings of the KSR Conference
• /
• 2007.11a
• /
• pp.1731-1737
• /
• 2007

This paper considers subway routing problem. Given a schedule of train to be routed by a railway stock, the routing problem determines a sequence of trains while satisfying turnaround time and maintenance restrictions. Generally, the solution of routing problem is generated from set partition formulation solved by column generation method, a typical integer programming approach for train-set. However, we find the characteristics of metropolitan subway which has a simple rail network, a few end stations and 13 departure-arrival patterns. We reflect a turn-around constraint due to spatial limitations has no existence in conventional railroad. Our objective is to minimize the number of daily train-sets. In this paper, we develop two basic techniques that solve the subway routing problem in a reasonable time. In first stage, we formulate the routing problem as a Min-cost-flow problem. Then, in the second stage, we attempt to normalize the distance covered to each routes and reduce the travel distance using our heuristic approach. Applied to the current daily timetable, we could find the subway routings, which is an approximately 14% improvement on the number of train-sets reducing 15% of maximum traveling distance and 8% of the standard deviation.

• The Journal of the Acoustical Society of Korea
• /
• v.11 no.3
• /
• pp.53-60
• /
• 1992

Many adaptive beamforming methods have been studied for interference cancellation and speech signal enhancement in telephone conference and auditorium. Main aspect of adaptive beamforming methods for speech signal processing is different from radar, sonar and seismic signal processing because desire output signal should be apt to the human ear. Considering that phase of speech is quite insensible to the human ear, Sondhi proposed a nonlinear constrained optimization technique whose constraint was on the magnitude transfer function from the source to the output. In real environment the phase response of the speech signal affects the human auditorium system. So it is desirable to design linear phase system. In this paper, linear phase beamformer is proposed and sample processing algorithm is also proposed for real time consideration Simulation results show that the proposed algorithm yields more consistent beam patterns and deep nulls to the noise direction than Sondhi's.

• Journal of Navigation and Port Research
• /
• v.32 no.3
• /
• pp.223-228
• /
• 2008

As most of small fishing boats made of FRP have been constructed by experience in Korea, some structural safety problems have been occurred occasionally. To improve the structural strength and reduce the costs for construction and operation, optimum design for small fishing boat was carried out in this study. The weight of fishing boat and the main dimensions of structural members are chosen as objective function and design variables, respectively. By the combination of global and local search methods, a hybrid optimization algorithm was developed to escape the local minima and reduce CPU time in analysis procedure, and finite element analysis was performed to determine the constraint parameters at each iteration step in optimization loop. Optimization results were compared with the real existing fishing boat, and the effects of optimum design were examined from points of view; structural strength, material cost, etc.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.6
• /
• pp.529-534
• /
• 2014

Pyrotechnic devices are widely used for space appendages. However, a cube satellite requirements do not permit the use of explosive pyrotechnic device. A nichrome burn wire release has typically been used for holding and release of deployable appendages of the cube satellite due to its simplicity and low cost. However, relatively low mechanical constraint force and system complexity for application of multi-deployable systems are disadvantages of the conventional mechanism. To overcome these drawbacks, we developed a hinge driving segmented nut type holding and release mechanism based on the nichrome burn wire release. The functional performance of the mechanism has been verified through release function test, static load test and shock level measurement test.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1304-1319
• /
• 2004

We can significantly reduce the cost o# program testing by automating the process of test data generation. Test data generation usually concerns identifying input values on which a selected path is executed. Although lots of research has been done so far, there still remains a lot of issues to be addressed. One of the issues is the shape problem. The shape problem refers to the problem of figuring out a shape of the input data structure required to cause the traversal of a given path. In this paper, we introduce a new method for the shape problem. The method converts the selected path into static single assignment (SSA) form without pointer dereferences. This allows us to consider each statement in the selected path as a constraint involving equality or inequality. We solve the constraints to get a solution which will be represented in terms of the points-to relations for each input variable. Simple, but illustrative examples are given to explain the proposed method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.583-591
• /
• 2000

Caching mechanisms have been studied extensively to buffer the speed gap of hierarchical storages in the context of cache memory, paging system, and buffer management system. As the wide-area distributed environments such as the WWW extend broadly, caching of remote objects becomes more and more important. In the wide-area distributed environments, the cost and the benefit of caching an object is not uniform due to the location of the object; which should be considered in the cache replacement algorithms. For online operation, the time complexity of the replacement algorithm should not be excessive. To date, most replacement algorithms for the wide-area distributed environments do not meet both the non-uniformity of objects and the time complexity constraint. This paper proposes a replacement algorithm which considers the non-uniformity of objects properly; it also allows for an efficient implementation. Trace-driven simulations show that proposed algorithm outperforms existing replacement algorithms.