8 results for “Sequential search”

Set a search alert

Research ArticleOpen accessIn the keywordsA Laboratory Study of Bayesian Updating in Small Feedback-Based Decision ProblemsTakemi Fujikawa, Sobei H. OdaThis study explores small feedback-based decision problems experimentally. Conducted were the experiments in which the decision-maker’s payoff distribution was limited to either favorable distribution or unfavorable distribution. The first remarkable observation revealed complexity/loss aversion in the experiment. The second observation included the law of small numbers. Deviations from maximization were also observed. Finally, we investigated the imperfect Bayesian decision-makers observed … …American Journal of Applied Sciences, Vol. 2, Issue 7 · 31 Jul 2005 · 6,754 accessesView PDF Cite

Research ArticleOpen accessIn the abstractPerformance Improvement of SNP Search Using Multithread ProgrammingGeraldo Francisco Donegá Zafalon, Álvaro Magri Nogueira da Cruz, Anderson Rici Amorim et al.Pattern recognition is an important field in Bioinformatics and a well-known task is the search for Single Nucleotide Polymorphism (SNP). It is possible to search for a known SNP position and analyze it using patterns of DNA bases, called masks. Nonetheless, this process becomes computationally expensive as the amount of available genomic data increases. Thus, in this study, we have … …Journal of Computer Science, Vol. 14, Issue 11 · 7 Nov 2018 · 7,734 accessesView PDF Cite

Research ArticleOpen accessIn the abstractEnglish Sentiment Classification using Only the Sentiment Lexicons with a JOHNSON Coefficient in a Parallel Network EnvironmentVo Ngoc Phu, Vo Thi Ngoc TranSentiment classification is significant in everyday life, such as in political activities, commodity production and commercial activities. In this survey, we have proposed a new model for Big Data sentiment classification. We use many sentiment lexicons of our basis English Sentiment Dictionary (bESD) to classify 5,000,000 documents including 2,500,000 positive and 2,500,000 negative of our testing data set in English. … …American Journal of Engineering and Applied Sciences, Vol. 11, Issue 1 · 22 Dec 2017 · 7,327 accessesView PDF Cite

Research ArticleOpen accessIn the abstractAn Efficient Distributed Bioinformatics Computing System for DNA Sequence Analysis on Encoding SystemMohammad Ibrahim Khan, Chotan SheelThis study provides an effective design of search technique of a distributed bioinformatics computing system for analysis of DNA sequences using OPTSDNA algorithm. This system could be used for disease detection, criminal forensic analysis, gene prediction, genetic system and protein analysis. Different types of distributed algorithms for the search and identification for DNA segments and repeat pattern in a given … …Current Research in Bioinformatics, Vol. 2, Issue 2 · 20 Dec 2013 · 6,931 accessesView PDF Cite

Research ArticleOpen accessIn the abstractFast Real Time Analysis of Web Server Massive Log Files using an Improved Web Mining ArchitectureC. Kavitha, Ramesh RajamanickamThe web has played a vital role to detect the information and finding the reasons to organize a system. As the web sites were increased, the web log files also increased based on the web searching. Our challenge and the task are to reduce the log files and classify the best results to reach the task which we used. Aimed … …Journal of Computer Science, Vol. 9, Issue 6 · 6 Jun 2013 · 6,340 accessesView PDF Cite

Research ArticleOpen accessIn the abstractParallel Memetic Algorithm for VLSI Circuit Partitioning Problem using Graphical Processing UnitsP. Subbaraj, P. SivakumarProblem statement: Memetic Algorithm (MA) is a form of population-based hybrid Genetic Algorithm (GA) coupled with an individual learning procedure capable of performing local refinements. Here we used genetic algorithm to explore the search space and simulated annealing as a local search method to exploit the information in the search region for the optimization of VLSI netlist bi-Partitioning problem. However, … …Journal of Computer Science, Vol. 8, Issue 5 · 27 Feb 2012 · 7,090 accessesView PDF Cite

Research ArticleOpen accessIn the abstractSolving the State Assignment Problem Using Stochastic Search Aided with Simulated AnnealingWalid M. AlyProblem statement: Solving the state assignment problem means finding the optimum assignment for each state within a sequential digital circuit. These optimum assignments will result in decreasing the hardware realization cost and increasing the reliability of the digital circuit. Unfortunately, the state assignment problem belongs to the class of nondeterministic polynomial time problems (NP complete) which requires heavy computations. Different … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 31 Dec 2009 · 6,966 accessesView PDF Cite

Research ArticleOpen accessIn the abstractCalculation of Total Cost, Tolerance Based on Taguchi's, Asymmetric Quality Loss Function ApproachR. Sampath Kumar, N. Alagumurthi, R. RameshProblem statement: Current world market force the manufacturing sectors to develop high quality product and process design with minimum possible cost. About 80% of problems in production units may be attributed to 20% of design tolerance causes. While design typically represents the smallest actual cost elements in products (around 5%), it leverages the largest cost influence (around 70%). So design … …American Journal of Engineering and Applied Sciences, Vol. 2, Issue 4 · 31 Dec 2009 · 8,045 accessesView PDF Cite