• Computers and Concrete
• /
• v.16 no.6
• /
• pp.919-932
• /
• 2015

This paper presents a new method for assessing the three-point-bending (3PB) strength of mortar beams in a non-destructive manner, based on neural network (NN) models. The models are based on the radial basis function (RBF) architecture and the fuzzy means algorithm is employed for training, in order to boost the prediction accuracy. Data for training the models were collected based on a series of experiments, where the cement mortar beams were subjected to various bending mechanical loads and the resulting pressure stimulated currents (PSCs) were recorded. The input variables to the NN models were then calculated by describing the PSC relaxation process through a generalization of Boltzmannn-Gibbs statistical physics, known as non-extensive statistical physics (NESP). The NN predictions were evaluated using k-fold cross-validation and new data that were kept independent from training; it can be seen that the proposed method can successfully form the basis of a non-destructive tool for assessing the bending strength. A comparison with a different NN architecture confirms the superiority of the proposed approach.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.1
• /
• pp.35-43
• /
• 2004

It is well known that the five-axis machining has advantages of tool accessibility and machined surface quality when compared with conventional three-axis machining. Traditional researches on the five-axis tool-path generation have addressed interferences such as cutter gouging, collision, machine kinematics and optimization of a CL(cutter location) or a cutter position. In the paper it is presented that optimal CL data for a face-milling cutter moving on a tool-path are obtained by incorporating TSS(tool swept surface) model. The TSS model from current CL position to the next CL position is constructed based on machine kinematics as well as cutter geometry, with which the deviation from the design surface can be computed. Then the next CC(cutter-contact) point should be adjusted such that the deviation conforms to given machining tolerance value. The proposed algorithm was implemented and applied to a marine propeller machining, which proved effective from a quantitative point of view. In addition, the algorithm using the TSS can also be applied to avoid cutter convex interferences in general three-axis NC machining.

• Journal of Digital Contents Society
• /
• v.19 no.1
• /
• pp.199-204
• /
• 2018

In this paper, we propose a fast collision detection method for interacting with objects in virtual space. First, in the mesh grouping step, the entire space is divided into small spaces of a predetermined size, and the positions and sizes of the smallest basic stereoscopic shapes (cube or sphere) including all of the meshes belonging to each small space are determined. In the collision detection step, it is checked whether a haptic interface point (HIP) is included in a three-dimensional figure representing a group. When a collision with a specific three-dimensional figure is confirmed, searching is performed only for the meshes in the group to find a mesh on which a possible real collision with HIP occurred. The effectiveness of the proposed algorithm is verified by measuring and comparing the computation time of the proposed method with and without the proposed method.

• International Journal of Contents
• /
• v.10 no.4
• /
• pp.69-74
• /
• 2014

General location aware systems are only applied to indoor and outdoor environments using more than three transmitters to estimate a fixed object location. Those kinds of systems have environmental restrictions that require an already established infrastructure. To solve this problem, an Object Location Estimation (OLE) algorithm based on PTP (Point To Point) communication has been proposed. However, the problem with this method is that deduction of performance parameters is not enough and location estimation is very difficult because of unknown restriction conditions. From experimental tests in this research, we determined that the performance parameters for restriction conditions are a maximum transmission distance of CSS communication and an optimum moving distance interval between personal locations. In this paper, a system applied OLE algorithm based on PTP communication is implemented using a CSS (Chirp Spread Spectrum) communication module. A maximum transmission distance for CSS communication and an optimum moving distance interval between personal locations are then deducted and studied to estimate a fixed object location for generalization.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.12
• /
• pp.1-12
• /
• 1996

A new local path planning algorithm using DPH (distance profile histogram) is suggested in this paper. The proposed method makes a grid type world map using distance values from multiple ultrasonic sensors and genrates local points through which the mobile robot can avoid obstcles safely. The DPH (distance profile historgram) represents geometrical arrangement of obstacles around the robot in the local polar coordinate system which is assumed to be atached to the robot. To control robot's navigation, a three-layered control structure is adopted. The proposed local path planning algorithm is placed on the top level. And a point-to-point translation controller takes the middle level. The bottom level consists of a velcoity servo and sonar driver modules which take charge of driving physical hardwares. The validity of the propsoed method is demonstated through several experiments.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.4
• /
• pp.189-197
• /
• 2009

This paper suggests the system for searching and application is to be in combination between existing hair art area and Image/Video processing area. This proposed system usually saves various hair types into a database, then, users send images of their face over the internet by using WebCam. Finally, they can find the hair types for users. Hair cutting is technology that form draft to make hair style. Man cut must decide how in image of sinciput, image of side bean curd, after lower image must operate. Silhouette is produced as is different by change of this three places. Customer increases in the beauty salon and beauty salon chain being changed, research about beauty art is necessary point of time. In this treatise, our country of when swim and operate haircut about problem that happen sample survey and analysis.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.2 no.6
• /
• pp.57-65
• /
• 1994

A collision-free path planning algorithm between an articulated robot and polyhedral obstacles using configuration space is presented. In configuration space, a robot is treated as a point and obstacles are treated as grown forbidden regions. Hence path planning problem is transformed into moving a point from start position to goal position without entering forbidden regions. For mapping to 3D joint space, slice projection method is used for first revolute joint and inverse kinematics is used for second and third revolute joint considering kinematic characteristics of industrial robot. Also, three projected 2D joint spaces are used in search of collision-free path. A proper example is provided to illustrate the proposed algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10b
• /
• pp.370-375
• /
• 1992

An algorithm for the notion planning of the robotic hand is proposed to generate finite displacements and changes in orientation of objects by considering sliding effects between the fingertips and the object at contact points. Specifically, an optimization problem is firstly solved to find minimum contact forces and minimum joint velocities to impart a desired motion to the object at each time step. Then the instantaneous relative velocity at the contact point is found by determining velocities of the fingertip and the velocity of the object at the contact point. Finally time derivatives of the surface variables and contact angle of the fingertip and the object at the present time step is computed using the Montana's contact equation to find the contact parameters of the fingertip and the object at the next time step. To show the validity of the proposed algorithm, a numerical example is illustrated by employing the robotic hand manipulating a sphere with three fingers each of which has four joints.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.10 no.1
• /
• pp.21-28
• /
• 2005

As the maximum power operating point(MPOP) of the Photovoltaic(PV) power systems alters with changing atmospheric conditions, the efficiency of maximum power point tracking(MPPT) is important in PV power systems. Many MPPT techniques have been considered in the past, but techniques using microprocessors with appropriate MPPT algorithms are favored because of their flexibility and compatibility with different PV arrays. In this paper, the author analyzes and studies two MPPT algorithms, which is named P&O(Perturbation and Observation) and IncCond(Incremental Conductance). Also, the author proposes Hysterisis-band alteration algorithm. To show the excellency of new Hysterisis-band alteration, the author suggests three references; 1) Comparing three MPPT algorithms in the steady-state condition, 2) Representing irradiation variation rapidly, 3) Showing MPPT efficiency. MPPT simulation and experiment perform in the boost converter.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.8
• /
• pp.251-260
• /
• 2014

3D point data is utilized in various industry domains for its high accuracy to the surface information of an object. It is substantially utilized in geography for terrain scanning and analysis. Generally, 3D point data need to be changed by Gridding which produces a regularly spaced array of z values from irregularly spaced xyz data. But it requires long processing time and high resource cost to interpolate grid coordination. Kriging interpolation in Gridding has attracted because Kriging interpolation has more accuracy than other methods. However it haven't been used frequently since a processing is complex and slow. In this paper, we presented a parallel Gridding algorithm which contains Kriging and an application of grid data structure to fit MapReduce paradigm to this algorithm. Experiment was conducted for 1.6 and 4.3 billions of points from Airborne LiDAR files using our proposed MapReduce structure and the results show that the total execution time is decreased more than three times to the convention sequential program on three heterogenous clusters.