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

1,221 articles for “Efficiency”
Set a search alert
Research ArticleOpen accessIn the abstractA Novel High-Speed 54⨯54 bit MultiplierPouya Asadi, Keivan NaviA new 54⨯54-bit multiplier using high-speed carry-lookahead adder has been fabricated by CMOS technology. This paper presents a self-timed carry-lookahead adder in which the logic complexity was a linear function of n, the number of inputs, and the average computation time was proportional to the logarithm of the logarithm of n. To the best of our knowledge, our adder has … …American Journal of Applied Sciences, Vol. 4, Issue 9 · 30 Sep 2007 · 7,084 accessesView PDFCite
Research ArticleOpen accessIn the abstractPotential Air and Groundwater Pollution from Continuous High Land Application of Cheese WheyA.E. Ghaly, D.G. Rushton, N.S. MahmoudExperiments were performed, using eighteen 280 cm deep soil columns with 20 cm inside diameter, to determine the relative amounts of nitrogenous compounds leached and volatilized from soils receiving high application rates of cheese whey during two seasons. Three soils (loamy sand, sandy loam and sandy clay loam) and two cheese whey application rates (560 and 840 kg-N ha-1), that … …American Journal of Applied Sciences, Vol. 4, Issue 9 · 30 Sep 2007 · 7,279 accessesView PDFCite
Research ArticleOpen accessIn the abstractEvaluation of the Upland Weed Control Potentiality of Green Tea Waste-Rice Bran Compost and Its Effect on Spinach GrowthM.A.I. Khan, K. Ueno, S. Horimoto et al.This study evaluated the upland weed control potentiality, germination inhibition ability and growth suppression efficiency of the five combinations of green tea waste - rice bran compost (GRC). GRC was prepared by mixing green tea waste and rice bran at five ratios, and allowed to decompose for 5 mo. Application of GRC suppressed weed growth up to 93.4% in number … …American Journal of Agricultural and Biological Sciences, Vol. 2, Issue 3 · 30 Sep 2007 · 8,207 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Efficient Algorithm for Capacitated Multifacility Location ProblemsChansiri Singhtaun, Peerayuth CharnsethikulIn this paper, a squared-Euclidean distance multifacility location problem with inseparable demands under balanced transportation constraints is analyzed. Using calculus to project the problem onto the space of allocation variables, the problem becomes minimizing concave quadratic integer programming problem. The algorithm based on extreme point ranking method combining with logical techniques is developed. The numerical experiments are randomly generated to … …Journal of Computer Science, Vol. 3, Issue 8 · 31 Aug 2007 · 6,443 accessesView PDFCite
Research ArticleOpen accessIn the abstractAnonymous and Non-Repudiation E-Payment ProtocolSattar J Aboud, Mohammed Ahmed AL-FayoumiThere are many proposals offer anonymous and non-repudiation e-payment protocols. But they have the drawbacks that the anonymity can be misused by fraudulent to perform a perfect crimes. Currently, the hot research concentrates on the accepting of e-payment protocols where the anonymity of the coins is cancelable via a trusted authority in the case of criminal entities. In the article … …American Journal of Applied Sciences, Vol. 4, Issue 8 · 31 Aug 2007 · 7,275 accessesView PDFCite
Research ArticleOpen accessIn the abstractApproximate Analytical Solutions For Time-Dependent Emden-Fowler-Type Equations By Variational Iteration MethodKhaled BatihaThe main objective of the current study was to solve the time-dependent Emden-Fowler-type equation with singular behavior. The technique used here was called the variational iteration method (VIM). The advantage of this work is twofold. Firstly, the VIM reduces the computational work. Secondly, in comparison with existing techniques, the VIM is an improvement with regard to its accuracy and rapid … …American Journal of Applied Sciences, Vol. 4, Issue 7 · 31 Jul 2007 · 6,594 accessesView PDFCite
Research ArticleOpen accessIn the abstractParallel Approaches for Intervals Analysis of Variable Statistics in Large and Sparse Linear Equations with RHS RangesPeerayuth CharnsethikulThis study proposes an algorithm capable of working in parallel for solving large and sparse linear equations under given right hand side (RHS) ranges. A comparative study to the direct linear programming method is reported theoretically, computationally and discussed. Moreover, the approach can be adapted for the system under domain decompositions structure leading to a better efficiency experimentally. …American Journal of Applied Sciences, Vol. 4, Issue 5 · 31 May 2007 · 6,826 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Efficient Implementation of Re-Sampling Technique for High Performance Multiple Classifier SystemsS. Sathiyabama, K. Thyagarajah, D. AyyamuthukumarDue to the large size of the database, the entire training dataset could not be used to construct the classifiers. One popular solution is to separate stream data into chunks, learn a base classifier from each chunk and then integrate all base classifiers to form Multiple classifier system (MCS). Sometimes this data streams does not include all the classes in … …Journal of Computer Science, Vol. 3, Issue 4 · 30 Apr 2007 · 7,018 accessesView PDFCite
Research ArticleOpen accessIn the abstractCharacteristics of Nitrogen Removal from Old Landfill Leachate by Sequencing Batch Biofilm ReactorLong Tengrui, Anas F. Al-Harbawi, Lin Ming Bo et al.Municipal landfill leachate is a high strength wastewater characterized by high concentrations of organics and ammonia and potentially containing toxic materials. The paper reports the results of a laboratory scale investigation aimed at evaluating the effectiveness of mature municipal landfill leachate treatment by a biological stage (used SBBR as a biological treatment) to study the nitrogen removal capabilities for treatment … …American Journal of Applied Sciences, Vol. 4, Issue 4 · 30 Apr 2007 · 8,046 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Exact Algorithm for the Unbounded Knapsack Problem with Minimizing Maximum Processing TimeChanin Srisuwannapa, Peerayuth CharnsethikulWe address a variant of the unbounded knapsack problem (UKP) into which the processing time of each item is also put and considered, referred as MMPTUKP. The MMPTUKP is a decision problem of allocating amount of n items, such that the maximum processing time of the selected items is minimized and the total profit is gained as at least as … …Journal of Computer Science, Vol. 3, Issue 3 · 31 Mar 2007 · 7,597 accessesView PDFCite