• Journal of Drive and Control
• /
• v.9 no.4
• /
• pp.26-31
• /
• 2012

Friction reduction between sliding hydraulic machine components is required to improve efficiency and reliability of hydraulic machineries. It is recently reported that surface texturing on sliding bearing surfaces can reduce the friction force highly. In this paper, numerical analysis is carried out to investigate the effect of dimple numbers and inlet boundary pressures on the lubrication characteristics of a parallel sliding bearing using a commercial computational fluid dynamics (CFD) code, FLUENT. The results show that the pressure distribution, load capacity, dimensionless friction force and leakage with dimple number and their locations, and inlet pressures. The overall lubrication characteristics are highly affected by dimple numbers and boundary pressure. The numerical method adopted and results can be used in design of efficient hydraulic machine components.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.666-668
• /
• 1998

In this paper we illustrate the design of a node label data flow machine based on self-timed paradigm. Data flow machines differ from most other parallel architectures, they are based on the concept of the data-driven computation model instead of the program store computation model. Since the data-driven computation model provides the excution of instructions asynchronously, it is natural to implement a data flow machine using self timed circuits.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12C
• /
• pp.218-224
• /
• 2001

The objective of Distributed Parallel Computing is to solve the computationally intensive problems, which have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. In this paper, we propose a computational model including the generalized graph representation method of distributed parallel systems for speedup analysis, and analyze how the super-linear speedup is achieved when scheduling of programs with diverse embedded parallelism modes onto a distributed heterogeneous supercomputing network environment. The proposed representation method can also be applied to simple homogeneous or heterogeneous systems whose components are heterogeneous only in terms of the processor speed. In order to obtain the core speedup, the matching of the parallelism characteristics between tasks and parallel machines should be carefully handled while minimizing the communication overhead.

• Journal of KIISE:Software and Applications
• /
• v.26 no.10
• /
• pp.1178-1178
• /
• 1999

A spatial join has the property that its execution time exponentially increases in proportion to the number of spatial objects. Recently, there have been many attempts for improving the performance of the spatial join by using parallel processing schemes, In the case of executing parallel spatial join using the parallel machine with shared disk architecture, the disk bottleneck of parallel processing of spatial join worsens in comparison with sequential spatial join. This paper presents the algorithms of task creation and assignment to reduce the disk bottleneck caused by accessing the shared disk at the same time, and to minimize message passing between processors, This paper proposes object caching which is a higher level of abstraction than page caching, and uses it to do creation and assignment of tasks according to temporal and spatial localities for minimizing disk access time. The object caching shows the performance improvement of 50%. The task creation and assignment using localities gives the gain of 30% and 20%. Overall performance evaluation of the proposed algorithms shows 7.2 times speed up than those of sequential execution of spatial joins.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.25 no.5
• /
• pp.354-361
• /
• 2016

Parallel robots are usually used for performing pick-and-place motion to increase productivity in high-speed environments. The present study proposes a high-speed parallel robot and a control approach to improve the tracking performance for the purpose of handling a solar cell. However, the target processes are not limited to the solar cell-handling field. Therefore, a delta-type parallel manipulator is designed, and a ball joint structure is specifically proposed to increase the allowed angle that would meet the required workspace. A control algorithm considering the synchronization between multiple joints in a closed-chain mechanism is also suggested to improve the tracking performance, where the tracking and synchronization errors are simultaneously considered. In addition, a prototype machine with the proposed ball joint is implemented. A satisfactory tracking performance is achieved by applying the proposed control algorithm, with a cycle time of 0.3 s for a 0.1 kg payload.

• Structural Engineering and Mechanics
• /
• v.49 no.5
• /
• pp.645-660
• /
• 2014

This paper presents the design and project of an innovative concept for a Single Point Incremental Forming (SPIF) Machine. Nowadays, equipment currently available for conducting SPIF result mostly from the adaptation of conventional CNC machine tools that results in a limited range of applications in terms of materials and geometries. There is also a limited market supply of equipment dedicated to Incremental Sheet Forming (ISF), that are costly considering low batches, making it unattractive for industry. Other factors impairing a quicker spread of SPIF are large forming times and poor geometrical accuracy of parts. The following sections will depict the development of a new equipment, designed to overcome some of the limitations of machines currently used, allowing the development of a sounding basis for further studies on the particular features of this process. The equipment here described possesses six-degrees-of freedom for the tool, for the sake of improved flexibility in terms of achievable tool-paths and an extra stiffness provided by a parallel kinematics scheme. A brief state of the art about the existing SPIF machines is provided to support the project's guidelines.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.382-386
• /
• 2004

Recently, with the machine learning trend, most of the machine translation systems on over the world use two syntax tree sets of two relevant languages to learn syntactic tree transfer rules. However, for the English-Vietnamese language pair, this approach is impossible because until now we have not had a Vietnamese syntactic tree set which is correspondent to English one. Building of a very large correspondent Vietnamese syntactic tree set (thousands of trees) requires so much work and take the investment of specialists in linguistics. To take advantage from our available English-Vietnamese Corpus (EVC) which was tagged in word alignment, we choose the SITG (Stochastic Inversion Transduction Grammar) model to construct English- Vietnamese syntactic tree sets automatically. This model is used to parse two languages at the same time and then carry out the syntactic tree transfer. This English-Vietnamese bilingual syntactic tree set is the basic training data to carry out transferring automatically from English syntactic trees to Vietnamese ones by machine learning models. We tested the syntax analysis by comparing over 10,000 sentences in the amount of 500,000 sentences of our English-Vietnamese bilingual corpus and first stage got encouraging result $(analyzed\;about\;80\%)[5].$ We have made use the TBL algorithm (Transformation Based Learning) to carry out automatic transformations from English syntactic trees to Vietnamese ones based on that parallel syntactic tree transfer set[6].

• Transactions of Materials Processing
• /
• v.7 no.5
• /
• pp.474-480
• /
• 1998

In the present study a domain decomposition scheme using the substructuring method is developed for the computational efficiency of the finite element analysis of metal forming processes. in order to avoid calculation of an inverse matrix during the substructuring procedure, the modified Cholesky decomposition method is implemented. As obtaining the data independence by the substructuring method the program is easily paralleized using the Parallel Virtual machine(PVM) library on a work-station cluster connected on networks. A numerical example for a simple upsetting is calculated and the speed-up ratio with respect to various number of subdomains and number of processors. The efficiency of the parallel computation is discussed by comparing the results.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.1
• /
• pp.64-73
• /
• 2004

This paper addresses a problem of machining determination of input quantity in a multi-stage flexible flow system with non-identical parallel machines considers a subcontracting, machining restraint, and machine yield. We develop a nonlinear programing with the objective of minimizing the sum of in-house processing cost and subcontracting cost. To solve this model, we introduce a single-processor parallel genetic algorithm(SPGA) to improve a weak point for the declined robustness of simple algorithm(SGA). The efficiency of the SPGA is examined in comparison with the SGA for the same problem. In of examination the SPGA is to provide the excellent solution than the solution of the SGA.

• Journal of Mechanical Science and Technology
• /
• v.17 no.4
• /
• pp.528-537
• /
• 2003

This paper proposes a 3-PPR planar parallel manipulator, which consists of three active prismatic Joints, three passive prismatic joints, and three passive rotational joints. The analysis of the kinematics and the optimal design of the manipulator are also discussed. The proposed manipulator has the advantages of the closed type of direct kinematics and a void-free workspace with a convex type of borderline. For the kinematic analysis of the proposed manipulator, the direct kinematics, the inverse kinematics, and the inverse Jacobian of the manipulator are derived. After the rotational limits and the workspaces of the manipulator are investigated, the workspace of the manipulator is simulated. In addition, for the optimal design of the manipulator, the performance indices of the manipulator are investigated, and then an optimal design procedure Is carried out using Min-Max theory. Finally. one example using the optimal design is presented.