• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.6
• /
• pp.1137-1147
• /
• 1997

I propose a RZETA network consisted of switching elements(SEs) that have regular links and alternate links. A modified Zeta nework used for the RZETA network's regular links and a MIN used for its alternate links are generated using the graph theory. The RZETA network is driven from merging the formaer and latter MINs. A necessary and sufficient condition for modified Zeta network to be a nonblocking network is also presented. This condition is a ufficient condition for RZETA network with a faulty link or a faulty SE to be nonblocked. Performance of the RZETA network is analyzed by modification of the model of 2-dilated Banyan network and its performance is compared with existing redundant path networks, when packet arrival rate of each source is 1.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.149-159
• /
• 2000

In this paper, we propose a new class of MIN (Multistage Interconnection Network) called SCMIN(ShortCut MIN) which can form a cheap and efficient packet switching interconnection network. SCMIN satisfies full access capability(FAC) and has multiple redundant paths between processor-memory pairs even though SCMIN is constructed with 2.5N-4 SEs which is far fewer SEs than that of MINs. SCMIN can be constructed suitable for localized communication by providing the shortcut path and multiple paths inside the processor-memory cluster which has frequent data communications. Therefore, SCMIN can be used as an attractive interconnection network for parallel applications with a localized communication pattern in shared-memory multiprocessor systems.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.37-58
• /
• 1997

An AI approach with tabu search is designed to solve multi-level knapsack problems. The approach performs intelligent actions with memories of historic data and learning effect. These action are developed ont only by observing the attributes of the optimal solution, the solution space, and its corresponding path to the optimal, but also by applying human intelligence, experience, and intuition with respect to the search strategies. The approach intensifies, or diversifies the search process appropriately in time and space. In order to create a good neighborhood structure, this approach uses two powerful choice rules that emphasize the impact of candidate variables on the current solution with respect to their profit contribution. "Pseudo moves", similar to "aspirations", support these choice rules during the evaluation process. For the purpose of visiting as many relevant points as possible, strategic oscillation between feasible and infeasible solutions around the boundary is applied. To avoid redundant moves, short-term (tabu-lists), intemediate-term (cycle-detection), and long-term (recording frequency and significant solutions for diversfication) memories are used. Test results show that among the 45 generated problems (these problems pose significant or insurmountable challenges to exact methods) the approach produces the optimal solutions in 39 cases.lutions in 39 cases.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.5
• /
• pp.1002-1012
• /
• 2003

An algorithm is suggested for collision avoidance of two-arm robot manipulator using redundancy. End-effectors of each redundant arm should move along each prescribed straight path to complete the given task, while avoiding collision with each other. Self-motion, considered as motion of each axis not to change the position and orientation of end-effector, is utilized in order to solve this problem. At each sampling time, self-motion is executed with the view to making farther between the links of each arm. Simulation results for two-arm robot manipulator, which has 9-d.o.f. respectively, are illustrated to show the performance of the algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.514-517
• /
• 1996

In solving multi-level knapsack problems, conventional heuristic approaches often assume a short-sighted plan within a static decision enviornment to find a near optimal solution. These conventional approaches are inflexible, and lack the ability to adapt to different problem structures. This research approaches the problem from a totally different viewpoint, and a new method is designed and implemented. This method performs intelligent actions based on memories of historic data and learning. These actions are developed not only by observing the attributes of the optimal solution, the solution space, and its corresponding path to the optimal solution, but also by applying human intelligence, experience, and intuition with respect to the search strategies. The method intensifies, or diversifies the search process appropriately in time and space. In order to create a good neighborhood structure, this method uses two powerful choice rules that emphasize the impact of candidate variables on the current solution with respect to their profit contribution. A side effect of so-called "pseudo moves", similar to "aspirations", supports these choice rules during the evaluation process. For the purpose of visiting as many relevant points as possible, strategic oscillation between feasible and infeasible solutions around the boundary is applied for intensification. To avoid redundant moves, short-term (tabu-lists), intermediate-term (cycle detection), and long-term (recording frequency and significant solutions for diversification) memories are used. Test results show that among the 45 generated problems (these problems pose significant or insurmountable challenges to exact methods) the approach produces the optimal solutions in 39 cases.lutions in 39 cases.

• Structural Engineering and Mechanics
• /
• v.27 no.6
• /
• pp.651-670
• /
• 2007

An experimental study to evaluate a redundancy capacity in simple span two plate-girder bridges, which are generally classified as a non-redundant load path structure, has been performed under the condition that one of the two girders is seriously damaged. The bottom lateral bracing was selected as an experimental parameter and two 1/5-scale bridge specimens with and without bottom lateral bracing have been prepared. The loading tests were first performed on the intact specimens without cracked girder within elastic range. Thereafter, the ultimate loading tests were conducted on the damaged specimens with an induced crack at the center of a girder. The test results showed that the cross beams and concrete deck redistributed partly the applied load to the uncracked girder, but the lateral bracing system played a significant role of the load redistribution when a girder was damaged. The redundancy was evaluated based on the test results and an appropriate redundancy level was evaluated when the lateral bracing was provided in a seriously damaged simple span two-girder steel bridge.

• 제어로봇시스템학회:학술대회논문집
• /
• 1999.10a
• /
• pp.177-180
• /
• 1999

Nowadays, one of the major technical issues in manufacturing is to create an environment to promote collaboration among diverse engineering activities. Collaborative engineering is an innovative approach integrating widely distributed engineering activities through promoting information sharing and actual collaboration. It requires close interactions among developers, suppliers and customers, and consideration of entire product life cycle from concept to disposal. A carefully-designed operating system is crucial for successful collaboration of many different activities in a Networked Virtual Manufacturing System(NVMS). High extensibility, flexibility and efficiency ale the key characteristics requested of an operating system to handle the complexity of the NVMSs. In this paper, we propose a model of the operating system for collaborative engineering using concurrent quasi-procedural method(QPM). QPM is a goal-driven data management technique for distributed and parallel computing environments. It is to be applied to the evaluation of activities to be executed, validities of input data, execution path of activities for a needed output, and expected to greatly improve the productivity of operations by preventing redundant evaluations. Collaboration among many different engineering activities in NVMSs is to be performed by the network of agents that encapsulate the capabilities of both users and their tools.

• Journal of Information Processing Systems
• /
• v.11 no.1
• /
• pp.148-164
• /
• 2015

The use of mobile agents for collaborative processing in wireless sensor network has gained considerable attention. This is when mobile agents are used for data aggregation to exploit redundant and correlated data. The efficiency of agent-based data aggregation depends on the agent migration scheme. However, in general, most of the proposed schemes are centralized approach-based schemes where the sink node determines the migration paths for the agents before dispatching them in the sensor network. The main limitations with such schemes are that they need global network topology information for deriving the migration paths of the agents, which incurs additional communication overhead, since each node has a very limited communication range. In addition, a centralized approach does not provide fault tolerant and adaptive migration paths. In order to solve such problems, we have proposed a distributed approach-based scheme for determining the migration path of the agents where at each hop, the local information is used to decide the migration of the agents. In addition, we also propose a local repair mechanism for dealing with the faulty nodes. The simulation results show that the proposed scheme performs better than existing schemes in the presence of faulty nodes within the networks, and manages to report the aggregated data to the sink faster.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.691-696
• /
• 2005

In asynchronous transfer mode (ATM) networks, fixed length cells of 53 bytes are transmitted. A cell may be discarded during transmission due to buffer overflow or a detection of errors. Cell discarding seriously degrades transmission quality. The quality degradation can be reduced by employing efficient forward error control (FEC) to recover discarded cells. In this paper, we present the design and implementation of decoding equipment for FEC in ATM networks based on a single parity check (SPC) product code using very-large-scale integration (VLSI) technology. FEC allows the destination to reconstruct missing data cells by using redundant parity cells that the source adds to each block of data cells. The functionality of the design has been tested using the Model Sim 5.7cXE Simulation Package. The design has been implemented for a $5{\times}5$ matrix of data cells in a Virtex-E XCV 3200E FG1156 device. The simulation and synthesis results show that the decoding function can be completed in 81 clock cycles with an optimum clock of 56.8 MHz. A test bench was written to study the performance of the decoder, and the results are presented.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.13 no.4
• /
• pp.660-669
• /
• 1989

The strain distribution in a wide strip drawn through a wedge-shaped die is obtained from the numerical integration of strain increments along the flow path of material points in the slipline field for a non-hardening material under the plane strain condition. It is shown that the strain in the surface layer increases with friction and that the strain at the mid-plane is a function of area reduction only. The redundant deformation factor, obtained from the average strain in a drawn strip, increases with friction. For the workability analysis of a strip drawing process, the strain states along with hydrostatic stresses are needed for the evaluation of a damage function based on the hole-growth mechanism of ductile fracture. The critical maximum of the damage function is assumed to be a material constant. As a result, mid-plane cracking is likely to occur in a process at a small reduction, with a large die angle, and in poor lubrication. Distortions of an initially transverse line are also calculated.