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

177 articles for “selection algorithm”
Set a search alert
Also matching:1 special issue
Research ArticleOpen accessIn the abstractDimensionality Reduction using Principal Component Analysis for Cancer Detection based on Microarray Data ClassificationAdiwijaya, Untari N. Wisesty, E. Lisnawati et al.Cancer is one of the most deadly diseases in the world. The International Agency for Research on Cancer (IARC) noted 14.1 million new cancer cases and 8.2 million deaths from cancer in 2012. In the last few years, DNA microarray technology has increasingly been used to analyze and diagnose cancer. Analysis of gene expression data in the form of microarray … …Journal of Computer Science, Vol. 14, Issue 11 · 15 Nov 2018 · 9,938 accessesView PDFCite
Research ArticleOpen accessIn the abstractRRDVCR: Real-Time Reliable Data Delivery Based on Virtual Coordinating Routing for Wireless Sensor NetworksVenkatesh, Chanchal Singh Sengar, Kuppanna Rajuk Venugopal et al.Real-time industrial application requires a routing protocol that guarantees data delivery with reliable, efficient and low end-to-end delay. Existing Two-Hop Velocity based Routing (THVR) protocol relates two-hop velocity to end-to-end delay to select the next forwarding node, that has the overhead of exchanging control packets and depleting the available energy in nodes. We propose a Real-Time Reliable Data delivery based … …Journal of Computer Science, Vol. 14, Issue 1 · 3 Jan 2018 · 8,237 accessesView PDFCite
Research ArticleOpen accessIn the abstractSparse Representation Tracking with Auxiliary Adaptive Appearance ModelsJunqiu Wang, Chao Yang, Zhichao Gan, Yasushi YagiWe propose an effective tracking algorithm based on sparse representation and auxiliary adaptive appearance modeling. Based on a sparse representation, l1 minimization can follow targets in challenging situations. Unfortunately, tracking approaches based on l1 minimization are likely to be inefficient because they measure using dense coefficient distributions. The number of target candidates can be very large when the state space … …American Journal of Engineering and Applied Sciences, Vol. 10, Issue 1 · 14 Jan 2017 · 7,681 accessesView PDFCite
Research ArticleOpen accessIn the abstractComparative Study of Scheduling Al-gorithms in Cloud Computing EnvironmentIsam Azawi MohialdeenAn essential requirement in cloud computing environment is scheduling the current jobs to be executed with the given constraints. The scheduler should order the jobs in a way where balance between improving the quality of services and at the same time maintaining the efficiency and fairness among the jobs. Thus, evaluating the performance of scheduling algorithms is crucial towards realizing … …Journal of Computer Science, Vol. 9, Issue 2 · 11 Apr 2013 · 7,212 accessesView PDFCite
Research ArticleOpen accessIn the abstractMobile Anonymous Trust Based Routing Using Ant Colony OptimizationR. Kalpana, N. RengarajanProblem statement: Ad hoc networks are susceptible to malicious attacks through denial of services, traffic analysis and spoofing. The security of the ad hoc routing protocol depends upon encryption, authentication, anonymity and trust factors. End-to-end security of data is provided by encryption and authentication, topology information of the nodes can be obtained by studying traffic and routing data. This security … …American Journal of Applied Sciences, Vol. 9, Issue 8 · 30 Jun 2012 · 6,948 accessesView PDFCite
Research ArticleOpen accessIn the abstractEffective Processing of Constraints based Spatial Join using R-TreesR. Parvathi, S. PalaniammalProblem statement: This study focuses on the spatial join effects with the constraints-based spatial data without any extra cost and Finding the minimum execution time of the spatial query and spatial selection method. Approach: Spatial joins are used to combine the spatial objects. The efficient processing depends upon the spatial queries. The execution time and I/O time of spatial queries … …American Journal of Applied Sciences, Vol. 8, Issue 12 · 29 Oct 2011 · 6,260 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Novel Methodology for Designing Radix-2n Serial-Serial MultipliersAbdurazzag Sulaiman AlmiladiProblem statement: The fast growth and increase in complexity of digital and image processing systems necessitate the migration from ad hoc design methods to methodological ones. Methodologies will certainly ease the trade off selection for those systems and shortens the design time. To increase those gained values and expand the searching space more appropriate methodologies need to be developed. Approach: … …Journal of Computer Science, Vol. 6, Issue 4 · 30 Apr 2010 · 6,926 accessesView PDFCite
Research ArticleOpen accessIn the abstractPiecewise Sliding Mode Decoupling Fault Tolerant Control SystemRafi Youssef, Hui PengProblem statement: Proposed method in the present study could deal with fault tolerant control system by using the so called decentralized control theory with decoupling fashion sliding mode control, dealing with subsystems instead of whole system and to the knowledge of the author there is no known computational algorithm for decentralized case, Approach: In this study we present a decoupling … …American Journal of Applied Sciences, Vol. 7, Issue 1 · 31 Jan 2010 · 7,391 accessesView PDFCite
Research ArticleOpen accessIn the abstractBoosting Kernel Discriminative Common Vectors for Face RecognitionC. Lakshmi, M. PonnavaikkoProblem statement: Kernel discriminative common vector (KDCV) was one of the most effective non-linear techniques for feature extraction from high dimensional data including images and text data. Approach: This study presented a new algorithm called Boosting Kernel Discriminative Common Vector (BKDCV) to further improve the overall performance of KDCV by integrating the boosting and KDCV techniques. Results: In BKDCV, the … …Journal of Computer Science, Vol. 5, Issue 11 · 30 Nov 2009 · 6,579 accessesView PDFCite
Research ArticleOpen accessIn the abstractDNA Code Word Design for DNA Computing with Real-Time Polymerase Chain ReactionMuhammad Faiz Mohamed Saaid, Zuwairie Ibrahim, Mohamad Shukri Zainal Abidin et al.Problem statement: A number of DNA computing models to solve mathematical graph problem such as the Hamiltonian Path Problem (HPP), Traveling Salesman Problem (TSP), and the Shortest Path Problem (SPP), have been proposed and demonstrated. Normally, the DNA sequences used for the computation should be critically designed in order to reduce error that could occur during a computation. We have … …Journal of Computer Science, Vol. 5, Issue 1 · 31 Jan 2009 · 7,506 accessesView PDFCite