Scholarly

Virtual Gesture Screen System Based on 3D Visual Information and Multi-Layer Perceptron

Year: 2009 Volume: 3 Issue: 11 1923 - 1926 Pages

Abstract: Active research is underway on virtual touch screens that complement the physical limitations of conventional touch screens. This paper discusses a virtual touch screen that uses a multi-layer perceptron to recognize and control three-dimensional (3D) depth information from a time of flight (TOF) camera. This system extracts an object-s area from the image input and compares it with the trajectory of the object, which is learned in advance, to recognize gestures. The system enables the maneuvering of content in virtual space by utilizing human actions.

Numerical Studies of Galerkin-type Time-discretizations Applied to Transient Convection-diffusion-reaction Equations

Year: 2012 Volume: 6 Issue: 6 625 - 632 Pages

Abstract: We deal with the numerical solution of time-dependent convection-diffusion-reaction equations. We combine the local projection stabilization method for the space discretization with two different time discretization schemes: the continuous Galerkin-Petrov (cGP) method and the discontinuous Galerkin (dG) method of polynomial of degree k. We establish the optimal error estimates and present numerical results which shows that the cGP(k) and dG(k)- methods are accurate of order k +1, respectively, in the whole time interval. Moreover, the cGP(k)-method is superconvergent of order 2k and dG(k)-method is of order 2k +1 at the discrete time points. Furthermore, the dependence of the results on the choice of the stabilization parameter are discussed and compared.

Improvement of the Shortest Path Problem with Geodesic-Like Method

Year: 2011 Volume: 5 Issue: 10 1561 - 1564 Pages

Authors:
Wen-Haw Chen

Abstract: This paper proposes a method to improve the shortest path problem on a NURBS (Non-uniform rational basis spline) surfaces. It comes from an application of the theory in classic differential geometry on surfaces and can improve the distance problem not only on surfaces but in the Euclidean 3-space R3 .

Effect of Ply Orientation on Roughness for the Trimming Process of CFRP Laminates

Year: 2012 Volume: 6 Issue: 8 1389 - 1395 Pages

Abstract: The machining of Carbon Fiber Reinforced Plastics has come to constitute a significant challenge for many fields of industry. The resulting surface finish of machined parts is of primary concern for several reasons, including contact quality and impact on the assembly. Therefore, the characterization and prediction of roughness based on machining parameters are crucial for costeffective operations. In this study, a PCD tool comprised of two straight flutes was used to trim 32-ply carbon fiber laminates in a bid to analyze the effects of the feed rate and the cutting speed on the surface roughness. The results show that while the speed has but a slight impact on the surface finish, the feed rate for its part affects it strongly. A detailed study was also conducted on the effect of fiber orientation on surface roughness, for quasi-isotropic laminates used in aerospace. The resulting roughness profiles for the four-ply orientation lay-up were compared, and it was found that fiber angle is a critical parameter relating to surface roughness. One of the four orientations studied led to very poor surface finishes, and characteristic roughness profiles were identified and found to only relate to the ply orientations of multilayer carbon fiber laminates.

Design and Trajectory Planning of Bipedal Walking Robot with Minimum Sufficient Actuation System

Year: 2009 Volume: 3 Issue: 11 1379 - 1385 Pages

Abstract: This paper presents a new type of mechanism and trajectory planning strategy for bipedal walking robot. The newly designed mechanism is able to improve the performance of bipedal walking robot in terms of energy efficiency and weight reduction by utilizing minimum number of actuators. The usage of parallelogram mechanism eliminates the needs of having an extra actuator at the knee joint. This mechanism works together with the joint space trajectory planning in order to realize straight legged walking which cannot be achieved by conventional inverse kinematics trajectory planning due to the singularity. The effectiveness of the proposed strategy is confirmed by computer simulation results.

Routing Algorithm for a Clustered Network

Year: 2010 Volume: 4 Issue: 10 1483 - 1491 Pages

Abstract: The Cluster Dimension of a network is defined as, which is the minimum cardinality of a subset S of the set of nodes having the property that for any two distinct nodes x and y, there exist the node Si, s2 (need not be distinct) in S such that ld(x,s1) — d(y, s1)1 > 1 and d(x,s2) < d(x,$) for all s E S — {s2}. In this paper, strictly non overlap¬ping clusters are constructed. The concept of LandMarks for Unique Addressing and Clustering (LMUAC) routing scheme is developed. With the help of LMUAC routing scheme, It is shown that path length (upper bound)PLN,d < PLD, Maximum memory space requirement for the networkMSLmuAc(Az) < MSEmuAc < MSH3L < MSric and Maximum Link utilization factor MLLMUAC(i=3) < MLLMUAC(z03) < M Lc

A Novel Design for Hybrid Space-Time Block Codes and Spatial Multiplexing Scheme

Year: 2011 Volume: 5 Issue: 12 1642 - 1645 Pages

Abstract: Space-time block codes (STBC) and spatial multiplexing (SM) are promising techniques that effectively exploit multipleinput multiple-output (MIMO) transmission to achieve more reliable communication and a higher multiplexing rate, respectively. In this paper, we study a practical design for hybrid scheme with multi-input multi-output orthogonal frequency division multiplexing (MIMOOFDM) systems to flexibly maximize the tradeoff between diversity and multiplexing gains. Unlike the existing STBC and SM designs which are suitable for the integer multiplexing rate, the proposed design can achieve arbitrary number of multiplexing rate.

Minimization of Non-Productive Time during 2.5D Milling

Year: 2014 Volume: 8 Issue: 6 1058 - 1063 Pages

Abstract: In the modern manufacturing systems, the use of thermal cutting techniques using oxyfuel, plasma and laser have become indispensable for the shape forming of high quality complex components; however, the conventional chip removal production techniques still have its widespread space in the manufacturing industry. Both these types of machining operations require the positioning of end effector tool at the edge where the cutting process commences. This repositioning of the cutting tool in every machining operation is repeated several times and is termed as non-productive time or airtime motion. Minimization of this non-productive machining time plays an important role in mass production with high speed machining. As, the tool moves from one region to the other by rapid movement and visits a meticulous region once in the whole operation, hence the non-productive time can be minimized by synchronizing the tool movements. In this work, this problem is being formulated as a general travelling salesman problem (TSP) and a genetic algorithm approach has been applied to solve the same. For improving the efficiency of the algorithm, the GA has been hybridized with a noble special heuristic and simulating annealing (SA). In the present work a novel heuristic in the combination of GA has been developed for synchronization of toolpath movements during repositioning of the tool. A comparative analysis of new Meta heuristic techniques with simple genetic algorithm has been performed. The proposed metaheuristic approach shows better performance than simple genetic algorithm for minimization of nonproductive toolpath length. Also, the results obtained with the help of hybrid simulated annealing genetic algorithm (HSAGA) are also found better than the results using simple genetic algorithm only.

Capturing an Unknown Moving Target in Unknown Territory using Vision and Coordination

Year: 2008 Volume: 2 Issue: 2 187 - 193 Pages

Abstract: In this paper we present an extension to Vision Based LRTA* (VLRTA*) known as Vision Based Moving Target Search (VMTS) for capturing unknown moving target in unknown territory with randomly generated obstacles. Target position is unknown to the agents and they cannot predict its position using any probability method. Agents have omni directional vision but can see in one direction at some point in time. Agent-s vision will be blocked by the obstacles in the search space so agent can not see through the obstacles. Proposed algorithm is evaluated on large number of scenarios. Scenarios include grids of sizes from 10x10 to 100x100. Grids had obstacles randomly placed, occupying 0% to 50%, in increments of 10%, of the search space. Experiments used 2 to 9 agents for each randomly generated maze with same obstacle ratio. Observed results suggests that VMTS is effective in locate target time, solution quality and virtual target. In addition, VMTS becomes more efficient if the number of agents is increased with proportion to obstacle ratio.

On the Design of Shape Memory Alloy Locking Mechanism: A Novel Solution for Laparoscopic Ligation Process

Year: 2013 Volume: 7 Issue: 6 229 - 232 Pages

Abstract: The blood ducts must be occluded to avoid loss of blood from vessels in laparoscopic surgeries. This paper presents a locking mechanism to be used in a ligation laparoscopic procedure (LigLAP I), as an alternative solution for a stapling procedure. Currently, stapling devices are being used to occlude vessels. Using these devices may result in some problems, including injury of bile duct, taking up a great deal of space behind the vessel, and bile leak. In this new procedure, a two-layer suture occludes a vessel. A locking mechanism is also required to hold the suture. Since there is a limited space at the device tip, a Shape Memory Alloy (SMA) actuator is used in this mechanism. Suitability for cleanroom applications, small size, and silent performance are among the advantages of SMA actuators in biomedical applications. An experimental study is conducted to examine the function of the locking mechanism. To set up the experiment, a prototype of a locking mechanism is built using nitinol, which is a nickel-titanium shape memory alloy. The locking mechanism successfully locks a polymer suture for all runs of the experiment. In addition, the effects of various surface materials on the applied pulling forces are studied. Various materials are mounted at the mechanism tip to compare the maximum pulling forces applied to the suture for each material. The results show that the various surface materials on the device tip provide large differences in the applied pulling forces.

A Development of Home Service Robot using Omni-Wheeled Mobility and Task-Based Manipulation

Year: 2012 Volume: 6 Issue: 2 390 - 393 Pages

Abstract: In this paper, a Smart Home Service Robot, McBot II, which performs mess-cleanup function etc. in house, is designed much more optimally than other service robots. It is newly developed in much more practical system than McBot I which we had developed two years ago. One characteristic attribute of mobile platforms equipped with a set of dependent wheels is their omni- directionality and the ability to realize complex translational and rotational trajectories for agile navigation in door. An accurate coordination of steering angle and spinning rate of each wheel is necessary for a consistent motion. This paper develops trajectory controller of 3-wheels omni-directional mobile robot using fuzzy azimuth estimator. A specialized anthropomorphic robot manipulator which can be attached to the housemaid robot McBot II, is developed in this paper. This built-in type manipulator consists of both arms with 3 DOF (Degree of Freedom) each and both hands with 3 DOF each. The robotic arm is optimally designed to satisfy both the minimum mechanical size and the maximum workspace. Minimum mass and length are required for the built-in cooperated-arms system. But that makes the workspace so small. This paper proposes optimal design method to overcome the problem by using neck joint to move the arms horizontally forward/backward and waist joint to move them vertically up/down. The robotic hand, which has two fingers and a thumb, is also optimally designed in task-based concept. Finally, the good performance of the developed McBot II is confirmed through live tests of the mess-cleanup task.

Using the Polynomial Approximation Algorithm in the Algorithm 2 for Manipulator's Control in an Unknown Environment

Year: 2007 Volume: 1 Issue: 12 3758 - 3763 Pages

Abstract: The Algorithm 2 for a n-link manipulator movement amidst arbitrary unknown static obstacles for a case when a sensor system supplies information about local neighborhoods of different points in the configuration space is presented. The Algorithm 2 guarantees the reaching of a target position in a finite number of steps. The Algorithm 2 is reduced to a finite number of calls of a subroutine for planning a trajectory in the presence of known forbidden states. The polynomial approximation algorithm which is used as the subroutine is presented. The results of the Algorithm2 implementation are given.

Grid Based and Random Based Ant Colony Algorithms for Automatic Hose Routing in 3D Space

Year: 2008 Volume: 2 Issue: 2 264 - 270 Pages

Abstract: Ant Colony Algorithms have been applied to difficult combinatorial optimization problems such as the travelling salesman problem and the quadratic assignment problem. In this paper gridbased and random-based ant colony algorithms are proposed for automatic 3D hose routing and their pros and cons are discussed. The algorithm uses the tessellated format for the obstacles and the generated hoses in order to detect collisions. The representation of obstacles and hoses in the tessellated format greatly helps the algorithm towards handling free-form objects and speeds up computation. The performance of algorithm has been tested on a number of 3D models.

A Novel Genetic Algorithm Designed for Hardware Implementation

Year: 2007 Volume: 1 Issue: 12 1719 - 1726 Pages

Abstract: A new genetic algorithm, termed the 'optimum individual monogenetic genetic algorithm' (OIMGA), is presented whose properties have been deliberately designed to be well suited to hardware implementation. Specific design criteria were to ensure fast access to the individuals in the population, to keep the required silicon area for hardware implementation to a minimum and to incorporate flexibility in the structure for the targeting of a range of applications. The first two criteria are met by retaining only the current optimum individual, thereby guaranteeing a small memory requirement that can easily be stored in fast on-chip memory. Also, OIMGA can be easily reconfigured to allow the investigation of problems that normally warrant either large GA populations or individuals many genes in length. Local convergence is achieved in OIMGA by retaining elite individuals, while population diversity is ensured by continually searching for the best individuals in fresh regions of the search space. The results given in this paper demonstrate that both the performance of OIMGA and its convergence time are superior to those of a range of existing hardware GA implementations.

The Implementation of Spatio-Temporal Graph to Represent Situations in the Virtual World

Year: 2013 Volume: 7 Issue: 1 12 - 15 Pages

Abstract: In this paper, we develop a Spatio-Temporal graph as of a key component of our knowledge representation Scheme. We design an integrated representation Scheme to depict not only present and past but future in parallel with the spaces in an effective and intuitive manner. The resulting multi-dimensional comprehensive knowledge structure accommodates multi-layered virtual world developing in the time to maximize the diversity of situations in the historical context. This knowledge representation Scheme is to be used as the basis for simulation of situations composing the virtual world and for implementation of virtual agents' knowledge used to judge and evaluate the situations in the virtual world. To provide natural contexts for situated learning or simulation games, the virtual stage set by this Spatio-Temporal graph is to be populated by agents and other objects interrelated and changing which are abstracted in the ontology.

Scanning Device for Sampling the Spatial Distribution of the E-field

Year: 2007 Volume: 1 Issue: 6 788 - 792 Pages

Abstract: This paper presents a low cost automatic system for sampling the electric field in a limited area. The scanning area is a flat surface parallel to the ground at a selected height. We discuss in detail the hardware, software and all the arrangements involved in the system operation. In order to show the system performance we include a campaign of narrow band measurements with 6017 sample points in the surroundings of a cellular base station. A commercial isotropic antenna with three orthogonal axes was used as sampling device. The results are analyzed in terms of its space average, standard deviation and statistical distribution.

Optimization Approaches for a Complex Dairy Farm Simulation Model

Year: 2008 Volume: 2 Issue: 2 248 - 254 Pages

Abstract: This paper describes the optimization of a complex dairy farm simulation model using two quite different methods of optimization, the Genetic algorithm (GA) and the Lipschitz Branch-and-Bound (LBB) algorithm. These techniques have been used to improve an agricultural system model developed by Dexcel Limited, New Zealand, which describes a detailed representation of pastoral dairying scenarios and contains an 8-dimensional parameter space. The model incorporates the sub-models of pasture growth and animal metabolism, which are themselves complex in many cases. Each evaluation of the objective function, a composite 'Farm Performance Index (FPI)', requires simulation of at least a one-year period of farm operation with a daily time-step, and is therefore computationally expensive. The problem of visualization of the objective function (response surface) in high-dimensional spaces is also considered in the context of the farm optimization problem. Adaptations of the sammon mapping and parallel coordinates visualization are described which help visualize some important properties of the model-s output topography. From this study, it is found that GA requires fewer function evaluations in optimization than the LBB algorithm.

Clustering Categorical Data Using Hierarchies (CLUCDUH)

Year: 2009 Volume: 3 Issue: 8 1912 - 1917 Pages

Authors:
Gökhan Silahtaroğlu

Abstract: Clustering large populations is an important problem when the data contain noise and different shapes. A good clustering algorithm or approach should be efficient enough to detect clusters sensitively. Besides space complexity, time complexity also gains importance as the size grows. Using hierarchies we developed a new algorithm to split attributes according to the values they have and choosing the dimension for splitting so as to divide the database roughly into equal parts as much as possible. At each node we calculate some certain descriptive statistical features of the data which reside and by pruning we generate the natural clusters with a complexity of O(n).

Modeling of Session Initiation Protocol Invite Transaction using Colored Petri Nets

Year: 2012 Volume: 6 Issue: 1 6 - 13 Pages

Abstract: Wireless mobile communications have experienced the phenomenal growth through last decades. The advances in wireless mobile technologies have brought about a demand for high quality multimedia applications and services. For such applications and services to work, signaling protocol is required for establishing, maintaining and tearing down multimedia sessions. The Session Initiation Protocol (SIP) is an application layer signaling protocols, based on request/response transaction model. This paper considers SIP INVITE transaction over an unreliable medium, since it has been recently modified in Request for Comments (RFC) 6026. In order to help in assuring that the functional correctness of this modification is achieved, the SIP INVITE transaction is modeled and analyzed using Colored Petri Nets (CPNs). Based on the model analysis, it is concluded that the SIP INVITE transaction is free of livelocks and dead codes, and in the same time it has both desirable and undesirable deadlocks. Therefore, SIP INVITE transaction should be subjected for additional updates in order to eliminate undesirable deadlocks. In order to reduce the cost of implementation and maintenance of SIP, additional remodeling of the SIP INVITE transaction is recommended.

Wind-tunnel Measurement of the Drag-reducing Effect of Compliant Coating

Year: 2009 Volume: 3 Issue: 7 746 - 750 Pages

Abstract: A specially designed flat plate was mounted vertically over the axial line in the wind tunnel of the Aerospace Department of the Pusan National University. The plate is 2 m long, 0.8 m high and 8 cm thick. The measurements were performed in velocity range from 15 to 60 m/s. A sand paper turbulizer was placed close to the plate nose to provide fully developed turbulent boundary layer over the most part of the plate. Strain balances were mounted in the trailing part of the plate to measure the skin friction drag over removable insertions of 0.55×0.25m2 size. A set of the insertions was designed and manufactured: 3mm thick polished metal surface and three compliant surfaces. The compliant surfaces were manufactured of a silicone rubber Silastic® S2 (Dow Corning company). To modify the viscoelastic properties of the rubber, its composition was varied: 90% of the rubber + 10% catalyst (standard), 92.5% + 7.5% (weak), 85% + 15% (strong). Modulus of elasticity and the loss tangent were measured accurately for these materials in the frequency range from 40 Hz to 3 KHz using the unique proposed technique.

Top Journal

SUGGEST A JOURNAL