Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

56 results for “Position algorithm”
Set a search alert
Research ArticleOpen accessIn the abstractFragment-based Visual Tracking with Multiple RepresentationsJunqiu Wang, Yasushi YagiWe present a fragment-based tracking algorithm that considers appearance information characterized by a non-parametric distribution and spatial information described by a parametric representation. We segment an input object into several fragments based on the appearance similarity and spatial distribution. Spatial distribution and appearance are important for distinguishing different fragments. We employee such information for separating an object from its background: … …American Journal of Engineering and Applied Sciences, Vol. 9, Issue 2 · 5 Jan 2016 · 7,887 accessesView PDFCite
Research ArticleOpen accessIn the abstractSELECTING PERFECT INTERESTINGNESS MEASURES BY COEFFICIENT OF VARIATION BASED RANKING ALGORITHMK. Selvarangam, K. Ramesh KumarRanking interestingness measure is an active and essential research domain in the process of knowledge discovery from the extracted rules. Since various measures proposed by many researchers in various situations increases the list of measures and these are not able to use as a common measures to evaluate the rules, knowledge finders are not able to identify a perfect measure … …Journal of Computer Science, Vol. 10, Issue 9 · 17 Apr 2014 · 6,404 accessesView PDFCite
Research ArticleOpen accessIn the abstractLOW COMPLEXITY CONSTRAINTS FOR ENERGY AND PERFORMANCE MANAGEMENT OF HETEROGENEOUS MULTICORE PROCESSORS USING DYNAMIC OPTIMIZATIONA. S. Radhamani, E. BaburajOptimization in multicore processor environment is significant in real world dynamic applications, as it is crucial to find and track the change effectively over time, which requires an optimization algorithm. In massively parallel processing multicore processor architectures, like other population based metaheuristics Constraint based Bacterial Foraging Particle Swarm Optimization (CBFPSO) scheduling can be effectively implemented. In this study we discuss … …Journal of Computer Science, Vol. 10, Issue 8 · 3 Apr 2014 · 6,645 accessesView PDFCite
Research ArticleOpen accessIn the abstractIMPROVING FAULT TOLERANT RESOURCE OPTIMIZED AWARE JOB SCHEDULING FOR GRID COMPUTINGK. Nirmala Devi, A. TamilarasiWorkflow brokers of existing Grid Scheduling Systems are lack of cooperation mechanism which causes inefficient schedules of application distributed resources and it also worsens the utilization of various resources including network bandwidth and computational cycles. Furthermore considering the literature, all of these existing brokering systems primarily evolved around models of centralized hierarchical or client/server. In such models, vital responsibility such … …Journal of Computer Science, Vol. 10, Issue 5 · 4 Jan 2014 · 6,896 accessesView PDFCite
Research ArticleOpen accessIn the abstractACCURATE AND FAST PUPIL LOCALIZATION USING CONTRAST STRETCHING, SEED FILLING AND CIRCULAR GEOMETRICAL CONSTRAINTSIman A. Saad, Loay E. George, Ahmad A. TayyarIris segmentation is the most contested issue in the iris recognition system, since noise and poor image quality can significantly affect accuracy of iris localization stage. Therefore, very careful attention has to be paid for the segmentation process if only an accurate result is expected. This study presents a new method for precise pupil detection capable of handling the unconstrained … …Journal of Computer Science, Vol. 10, Issue 2 · 16 Nov 2013 · 7,240 accessesView PDFCite
Research ArticleOpen accessIn the abstractNEW BINARY PARTICLE SWARM OPTIMIZATION WITH IMMUNITY-CLONAL ALGORITHMAmr Badr, Mostafa Abd El Azeim, Dina EL-GammalParticle Swarm Optimization used to solve a continuous problem and has been shown to perform well however, binary version still has some problems. In order to solve these problems a new technique called New Binary Particle Swarm Optimization using Immunity-Clonal Algorithm (NPSOCLA) is proposed This Algorithm proposes a new updating strategy to update the position vector in Binary Particle Swarm … …Journal of Computer Science, Vol. 9, Issue 11 · 30 Sep 2013 · 6,796 accessesView PDFCite
Research ArticleOpen accessIn the abstractEFFECTIVENESS OF SECOND BEST PARTICLE INFORMATION FOR PARTICLE SWARM OPTIMIZATIONEisuke Kita, Young-Bin ShinParticle Swarm Optimization (PSO) represents the potential solutions of the optimization problem as the particles and then, the particles move in order to find the better solution. The particle positions are updated from the personal best and the global best particle positions which have been ever found. This research focuses on the use of the second personal best and the … …Journal of Computer Science, Vol. 9, Issue 11 · 23 Sep 2013 · 6,576 accessesView PDFCite
Research ArticleOpen accessIn the abstractEmbedded Computer Based Active Vibration Control System for Vibration Reduction of Flexible StructuresVenkata Ratnam Tatavolu, Seetha Ramaiah PanchumarthyResearch on Active Vibration Control System (AVCS) is being carried out to reduce structural vibrations caused by unwanted vibrations in many application areas such as in space, aircraft structures, satellites, automobiles and civil structures (bridges), particularly at low frequencies. The unwanted vibration may cause damage to the structure or degradation to the structure’s performance. The AVCS comprises physical plant, a … …Journal of Computer Science, Vol. 9, Issue 7 · 15 Jun 2013 · 6,550 accessesView PDFCite
Research ArticleOpen accessIn the abstractScheduling of Automated Guided Vehicle and Flexible Jobshop using Jumping Genes Genetic AlgorithmP. Paul Pandian, S. Saravana Sankar, S. G. Ponnambalam, M. Victor RajProblem statement: Now a day’s many researchers try Genetic algorithm based optimization to find near optimal solution for flexible job shop. It is a global search. In Our study in the GA, some changes are made to search locally and globally by adding jumping genes operation. A typical flexible job shop model is considered for this research study. For that … …American Journal of Applied Sciences, Vol. 9, Issue 10 · 25 Aug 2012 · 7,306 accessesView PDFCite
Research ArticleOpen accessIn the abstractObject Exploration Using a Three-Axis Tactile Sensing InformationS. C. Abdullah, Jiro Wada, Masahiro Ohka, Hanafiah YussofProblem statement: To advance the robust object recognition of robots, we present an algorithm for object exploration based on three-axis tactile data that is necessary and sufficient for the evaluation of contact phenomena. Approach: The object surface contour is acquired by controlling the finger position so that the normal force, measured by optical three-axis tactile sensors, remains constant as two … …Journal of Computer Science, Vol. 7, Issue 4 · 4 Apr 2011 · 7,313 accessesView PDFCite