• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2414-2434
• /
• 2015

Among numerous localization schemes proposed specifically for Wireless Sensor Network (WSN), the range-free localization algorithms based on the received signal strength indication (RSSI) have attracted considerable research interest for their simplicity and low cost. As a typical range-free algorithm, Approximate Point In Triangulation test (APIT) suffers from significant estimation errors due to its theoretical defects and RSSI inaccuracy. To address these problems, a novel localization method called FIAPIT, which is a combination of an improved APIT (IAPIT) and a fuzzy logic system, is proposed. The proposed IAPIT addresses the theoretical defects of APIT in near (it's defined as a point adjacent to a sensor is closer to three vertexes of a triangle area where the sensor resides simultaneously) and far (the opposite case of the near case) cases partly. To compensate for negative effects of RSSI inaccuracy, a fuzzy system, whose logic inference is based on IAPIT, is applied. Finally, the sensor's coordinates are estimated as the weighted average of centers of gravity (COGs) of triangles' intersection areas. Each COG has a different weight inferred by FIAPIT. Numerical simulations were performed to compare four algorithms with varying system parameters. The results show that IAPIT corrects the defects of APIT when adjacent nodes are enough, and FIAPIT is better than others when RSSI is inaccuracy.

• Journal of the Korea Computer Graphics Society
• /
• v.16 no.2
• /
• pp.9-17
• /
• 2010

Minkowski sum of two polyedra is an operation to compute the sum of all pairs of points contained in the polyhedra. It has been a very useful tool to solve many geometric problems arising in the areas of robotics, NC machining, solid modeling, and so on. However, very few algorithms have been proposed to compute Minkowski sum of polyhedra, because computing Minkowski sum boundaries is susceptible to roundoff errors. We propose an algorithm to robustly compute the Minkowski sum boundaries by employing the controlled linear perturbation scheme to prevent numerically ambiguous and degenerate cases from occurring. According to our experiments, our algorithm computes the Minkowski sum boundaries with the precision of $10^{-14}$ by perturbing the vertices of the input polyhedra up to $10^{-10}$.

• Journal of Educational Research in Mathematics
• /
• v.19 no.1
• /
• pp.45-61
• /
• 2009

The powerful role of analogical reasoning in discovering mathematics is well substantiated in the history of mathematics. Mathematically gifted students, thus, are encouraged to learn via in-depth exploration on their own based on analogical reasoning. In this study, 57 gifted students (31in the 7th and 26 8th grade) were asked to formulate or clarify analogy. Students produced fruitful constructs led by analogical reasoning. Participants in this study appeared to experience the deep thinking that is necessary to solve problems made with analogies, a process equivalent to the one that mathematicians undertake. The subjects had to reflect on prior knowledge and develop new concepts such as an orthogonal projection and a point of intersection of perpendicular lines based on analogical reasoning. All subjects were found adept at making meaningful analogues of a triangle since they all made use of meta-cognition when searching relations for analogies. In the future, methodologies including the development of tasks and teaching settings, measures to evaluate the depth of mathematic exploration through analogy, and research on how to promote education related to analogy for gifted students will enhance gifted student mathematics education.

• 한국HCI학회:학술대회논문집
• /
• 2007.02c
• /
• pp.306-317
• /
• 2007

We present an interactive and accurate collision detection algorithm for deformable, polygonal objects based on the streaming computational model. Our algorithm can detect all possible pairwise primitive-level intersections between two severely deforming models at highly interactive rates. In our streaming computational model, we consider a set of axis aligned bounding boxes (AABBs) that bound each of the given deformable objects as an input stream and perform massively-parallel pairwise, overlapping tests onto the incoming streams. As a result, we are able to prevent performance stalls in the streaming pipeline that can be caused by expensive indexing mechanism required by bounding volume hierarchy-based streaming algorithms. At run-time, as the underlying models deform over time, we employ a novel, streaming algorithm to update the geometric changes in the AABB streams. Moreover, in order to get only the computed result (i.e., collision results between AABBs) without reading back the entire output streams, we propose a streaming en/decoding strategy that can be performed in a hierarchical fashion. After determining overlapped AABBs, we perform a primitive-level (e.g., triangle) intersection checking on a serial computational model such as CPUs. We implemented the entire pipeline of our algorithm using off-the-shelf graphics processors (GPUs), such as nVIDIA GeForce 7800 GTX, for streaming computations, and Intel Dual Core 3.4G processors for serial computations. We benchmarked our algorithm with different models of varying complexities, ranging from 15K up to 50K triangles, under various deformation motions, and the timings were obtained as 30~100 FPS depending on the complexity of models and their relative configurations. Finally, we made comparisons with a well-known GPU-based collision detection algorithm, CULLIDE [4] and observed about three times performance improvement over the earlier approach. We also made comparisons with a SW-based AABB culling algorithm [2] and observed about two times improvement.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.1
• /
• pp.25-32
• /
• 2018

Due to heavy computational cost, deformable object simulation requires more effective collision detection method than rigid body simulation. However, when the CPU-based collision detection algorithm is purely applied to the GPU environment, the collision detection algorithm and the data structure optimized for the GPU environment are essential because the performance of the GPU can not be used properly. Therefore, we propose a GPU-based parallel collision detection algorithm for mass-spring system which is widely used for deformable object representation in this paper. The proposed method uses a parallel algorithm and data structure to reduce collision detection cost through GPU-based curling algorithm using AABB-Octree structure. In this paper, we prove the effectiveness of the proposed method by comparing the intersection test of all triangle pairs in parallel. The results of experimental tests show that the proposed method improves the performance by about 24% on average. Therefore, it is expected that the proposed method can improve the performance of real-time simulation for deformable objects.

• Journal of Internet Computing and Services
• /
• v.16 no.2
• /
• pp.49-55
• /
• 2015

According to the statistics of traffic accidents over recent 5 years, traffic accidents during the night times happened more than the day times. There are various causes to occur traffic accidents and the one of the major causes is inappropriate or missing street lights that make driver's sight confused and causes the traffic accidents. In this paper, with smartphones, we designed and implemented a lane luminance measurement application which stores the information of driver's location, driving, and lane luminance into database in real time to figure out the inappropriate street light facilities and the area that does not have any street lights. This application is implemented under Native C/C++ environment using android NDK and it improves the operation speed than code written in Java or other languages. To measure the luminance of road, the input image with RGB color space is converted to image with YCbCr color space and Y value returns the luminance of road. The application detects the road lane and calculates the road lane luminance into the database sever. Also this application receives the road video image using smart phone's camera and improves the computational cost by allocating the ROI(Region of interest) of input images. The ROI of image is converted to Grayscale image and then applied the canny edge detector to extract the outline of lanes. After that, we applied hough line transform method to achieve the candidated lane group. The both sides of lane is selected by lane detection algorithm that utilizes the gradient of candidated lanes. When the both lanes of road are detected, we set up a triangle area with a height 20 pixels down from intersection of lanes and the luminance of road is estimated from this triangle area. Y value is calculated from the extracted each R, G, B value of pixels in the triangle. The average Y value of pixels is ranged between from 0 to 100 value to inform a luminance of road and each pixel values are represented with color between black and green. We store car location using smartphone's GPS sensor into the database server after analyzing the road lane video image with luminance of road about 60 meters ahead by wireless communication every 10 minutes. We expect that those collected road luminance information can warn drivers about safe driving or effectively improve the renovation plans of road luminance management.

• The Journal of the Petrological Society of Korea
• /
• v.27 no.1
• /
• pp.1-15
• /
• 2018

The characteristics of the rock cleavage of Jurassic Geochang granite were analysed using the distribution of microcrack lengths and spacings. The length and spacing-cumulative diagrams for the six directions of rock cleavages were arranged in increasing order ($H2{\rightarrow}R1$) on the density (${\rho}$) of microcrack length. The various parameters were extracted through the combination of above two types of diagrams. The evaluation for the six directions of rock cleavages was performed using the four groups (I~IV) of parameters such as (I) intersection angle (${\alpha}-{\beta}$), exponent difference (${\lambda}_S-{\lambda}_L$), length of line (ol and ll'), length ratio (ol/os and ll'/sl'), mean length ((ss'+ll')/2), area of right-angled triangle (${\Delta}oaa_a^{\prime}$ and ${\Delta}obb_a^{\prime}$) and area difference (${\Delta}obb^{\prime}-{\Delta}oaa^{\prime}$ and ${\Delta}obb_a^{\prime}-{\Delta}oaa_a^{\prime}$), (II) length of line (oa and os) and area (${\Delta}oaa^{\prime}$), (III) length of line (sl') and length ratio (ss'/ll') and (IV) length of line (ob, ss' and ls') and area (${\Delta}obb^{\prime}$, ${\Delta}ll^{\prime}s^{\prime}$, ${\Delta}ss^{\prime}l^{\prime}$ and ⏢ll'ss'). The results of correlation analysis between the values of parameters for three rock cleavages and those for three planes are as follows. The values of parameters for three rock cleavages are in orders of (I) H(hardway, (H1 + H2)/2) < G(grain, (G1 + G2)/2) < R(rift, (R1 + R2)/2), (II) R < G < H, (III) G < H < R and (IV) H < G < R. On the contrary, the values of parameters for three planes are in orders of (I) R' < G' < H', (II) H' < G' < R' and (III and IV) R' < H' < G'. Especially the values of parameters belonging to group I and group II show mutual reverse orders. In conclusion, this type of correlation analysis is useful for discriminating three quarrying planes.