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

12 results for “Large Integer”
Set a search alert
Research ArticleOpen accessIn the keywordsThe Effect of RSA Exponential Key Growth on the Multi-Core Computational ResourceMohamad A. Mohamed, Ammar Y. Tuama, Mokhairi Makhtar et al.Cryptography has been widely used as a mean to secure message communication. A cryptosystem is made up of a publicly available algorithm and a secretly kept key. The algorithm is responsible for transforming the original message into something unintelligible. The result of losing the key or cracked algorithm can be catastrophic, where all secret communications will be known to adversaries. … …American Journal of Engineering and Applied Sciences, Vol. 9, Issue 4 · 25 Nov 2016 · 7,827 accessesView PDFCite
Research ArticleOpen accessIn the abstractA Successive Admissible Cell Method for Solving Large Scale Linear Assignment Problem with Dense Cost MatrixWarut Boonphakdee, Peerayuth CharnsethikulNormally, the Linear Assignment Problem (LAP) has been solved by successful algorithms such as Lapjv and Munkres programmed as MATLAB codes. This study presented an improved algorithm for solving large scale LAP. A preprocessing (PP) algorithm was proposed to apply for constructing the kth transferred reduced cost matrix then this matrix was solved by Lapjvalgorithm. Performances of PP-Lapjvalgorithm were faster … …Journal of Computer Science, Vol. 12, Issue 8 · 16 Nov 2016 · 6,948 accessesView PDFCite
Research ArticleOpen accessIn the abstractQuantization of Map-Based Neuronal Model for Embedded Simulations of Neurobiological Networks in Real-TimeNikolai F. Rulkov, Ariel Mark Hunt, Peter N. Rulkov, Andrey G. MaksimovThe discreet-time (map-based) approach to modeling nonlinear dynamics of spiking and spiking-bursting activity of neurons has demonstrated its very high efficiency in simulations of neuro-biologically realistic behavior both in large-scale network models for brain activity studies and in real-time operation of Central Pattern Generator network models for biomimetic robotics. This paper studies the next step in improving the model computational … …American Journal of Engineering and Applied Sciences, Vol. 9, Issue 4 · 9 Nov 2016 · 8,775 accessesView PDFCite
Research ArticleOpen accessIn the abstract“OPTIMIZATION OF MULTI-COMMODITIES CONSUMER SUPPLY CHAINS FOR-PART I-MODELING”Zeinab Haji Abolhasani, Romeo M. Marian, Lee LoungThis study and its companions (Part II, Part III) will concentrate on optimizing a class of supply chain problems known as Multi-Commodities Consumer Supply Chain (MCCSC) problem. MCCSC problem belongs to Production-Distribution (P-D) planning category. It aims to determine facilities location, consumers’ allocation and facilities configuration to minimize total Cost (CT) of the entire network. These facilities can be manufacturer … …Journal of Computer Science, Vol. 9, Issue 12 · 26 Nov 2013 · 7,840 accessesView PDFCite
Research ArticleOpen accessIn the abstractAN OPTIMIZATION-BASED HEURISTIC FOR A CAPACITATED LOT-SIZING MODEL IN AN AUTOMATED TELLER MACHINES NETWORKSupatchaya Chotayakul, Peerayuth Charnsetthikul, Juta Pichitlamken, John KobzaThis research studies a cash inventory problem in an ATM Network to satisfy customer’s cash needs over multiple periods with deterministic demand. The objective is to determine the amount of money to place in Automated Teller Machines (ATMs) and cash centers for each period over a given time horizon. The algorithms are designed as a multi-echelon inventory problem with single-item … …Journal of Mathematics and Statistics, Vol. 9, Issue 4 · 1 Oct 2013 · 7,049 accessesView PDFCite
Research ArticleOpen accessIn the abstractAn Improved Genetic Algorithm for the Traveling Salesman Problem with Multi-RelationsSupat PatvichaichodProblem statement: The aim of this research is to investigate the Traveling Salesman Problems with Multi-Relations (TSPMR) in which each of the vertices has several edges and different weights. The study concerns the weights fluctuated by time in which the problem has more complexity than general TSP problem. However, this type of problem closes to the real-world situation in engineering … …Journal of Computer Science, Vol. 7, Issue 1 · 14 Jan 2011 · 6,924 accessesView PDFCite
Research ArticleOpen accessIn the abstractApplication of Intelligence Based Genetic Algorithm for Job Sequencing Problem on Parallel Mixed-Model Assembly LineA. Norozi, M.K.A. Ariffin, N. IsmailProblem statement: In the area of globalization the degree of competition in the market increased and many companies attempted to manufacture the products efficiently to overcome the challenges faced. Approach: Mixed model assembly line was able to provide continuous flow of material and flexibility with regard to model change. The problem under study attempted to describe the mathematical programming limitation … …American Journal of Engineering and Applied Sciences, Vol. 3, Issue 1 · 31 Mar 2010 · 9,341 accessesView PDFCite
Research ArticleOpen accessIn the abstractInteger Factorization: Solution via Algorithm for Constrained Discrete Logarithm ProblemBoris S. VerkhovskyProblem statement: During the last thirty years many public-key cryptographic protocols based on either the complexity of integer factorization of large semiprimes or the Discrete Logarithm Problem (DLP) have been developed. Approach: Although several factorization algorithms with sub-exponential complexity have been discovered, the recent RSA Factoring Challenge demonstrated that it was still necessary to use several thousand computers working in … …Journal of Computer Science, Vol. 5, Issue 9 · 30 Dec 2009 · 7,156 accessesView PDFCite
Research ArticleOpen accessIn the abstractBenders' Decomposition Based Heuristics for Large-Scale Dynamic Quadratic Assignment ProblemsSirirat Muenvanichakul, Peerayuth CharnsethikulProblem statement: Dynamic Quadratic Assignment Problem (DQAP) is NP hard problem. Benders decomposition based heuristics method is applied to the equivalent mixed-integer linear programming problem of the original DQAP. Approach: Approximate Benders Decomposition (ABD) generates the ensemble of a subset of feasible layout for Approximate Dynamic Programming (ADP) to determine the sub-optimal optimal solution. A Trust-Region Constraint (TRC) for the … …Journal of Computer Science, Vol. 5, Issue 1 · 31 Jan 2009 · 7,681 accessesView PDFCite
Research ArticleOpen accessIn the abstractOptimization Based Heuristic Approaches for Solving an Integrated One-dimensional Cutting Stock-Transportation ProblemSirirat Wongprakornkul, Peerayuth CharnsethikulIn this work, the integration of the one-dimensional cutting stock problem with multiple cutting facilities and the transportation problem was formulated mathematically as a large-scale discrete optimization problem. Benders partitioning approach and the column-generation technique with the direct method and the proposed heuristic method for solving corresponding integer programming (IP) were developed into three approaches and were used to solve … …Journal of Mathematics and Statistics, Vol. 3, Issue 3 · 30 Sep 2007 · 6,741 accessesView PDFCite