Table Generation Research Articles

Generation of Look-Up Tables for Dynamic Job Shop Scheduling Decision Support Tool

Majority of existing scheduling techniques are based on static demand and deterministic processing time, while most job shop scheduling problem are concerned with dynamic demand and stochastic processing time. As a consequence, the solutions obtained from the traditional scheduling technique are ineffective wherever changes occur to the system. Therefore, this research intends to develop a decision support tool (DST) based on promising artificial intelligent that is able to accommodate the dynamics that regularly occur in job shop scheduling problem. The DST was designed through three phases, i.e. (i) the look-up table generation, (ii) inverse model development and (iii) integration of DST components. This paper reports the generation of look-up tables for various scenarios as a part in development of the DST. A discrete event simulation model was used to compare the performance among SPT, EDD, FCFS, S/OPN and Slack rules; the best performances measures (mean flow time, mean tardiness and mean lateness) and the job order requirement (inter-arrival time, due dates tightness and setup time ratio) which were compiled into look-up tables. The well-known 6/6/J/Cmax Problem from Muth and Thompson (1963) was used as a case study. In the future, the performance measure of various scheduling scenarios and the job order requirement will be mapped using ANN inverse model.

A Two-Dimensional Tabulated Flamelet Combustion Model for Furnace Applications

A new tabulated chemistry approach for representing turbulent combustion in industrial furnaces is presented. This model is based on the tabulation of two dimensional diffusion flamelets to account for ternary mixtures between fuel, oxidant and burned gases which are integrated over probability density functions. To avoid excessive CPU time for the table generation, the calculation of the two dimensional flamelets is performed using the method proposed in the ADF-PCM (Approximated Diffusion Flame - Presumed Conditional Moment) approach: only the equation for the progress variable is solved, instead of the equations for all species. The progress variable reaction rate is given by a table of homogeneous reactors using the DHR model (Diluted Homogeneous Reactor) proposed by Locci et al. These approximated diffusion flames are first compared to exact diffusion flames computed using the flamelet equations and the chemistry for all species. The resulting model, called A2DF (Approximate 2 Dimensional Flamelet) is then applied to the RANS (Reynolds Averaged Navier-Stokes) simulations of Sandia Flames D and F, showing a good agreement with experimental measurements. Finally, this model is applied to the flameless and conventional combustion cases of the burner of Verissimo et al., showing a correct agreement for temperature and species predictions.

RTableICC: An R Package for Random Generation of 22K and RC Contingency Tables

In this paper, we describe the R package rTableICC that provides an interface for random generation of 2×2×K and R×C contingency tables constructed over either intraclass-correlated or uncorrelated individuals. Intraclass correlations arise in studies where sampling units include more than one individual and these individuals are correlated. The package implements random generation of contingency tables over individuals with or without intraclass correlations under various sampling plans. The package include two functions for the generation of K 2×2 tables over product-multinomial sampling schemes and that of 2×2×K tables under Poisson or multinomial sampling plans. It also contains two functions that generate R×C tables under product-multinomial, multinomial or Poisson sampling plans with or without intraclass correlations. The package also includes a function for random number generation from a given probability distribution. In addition to the contingency table format, the package also provides raw data required for further estimation purposes.

Knowledge-based differential evolution approach to quantisation table generation for the JPEG baseline algorithm

Image quality/compression trade-off mainly depends on quantisation table used in JPEG scheme. Therefore, the generation of quantisation table is an optimisation problem. Even though recent reports reveal that classical differential evolution CDE is a promising algorithm to generate the optimal quantisation table, it is slow in convergence rate due to its weak local exploitation ability. This paper proposes knowledge-based differential evolution KBDE algorithm to search the optimal quantisation table for the target bits/pixel bpp. KBDE incorporates the image characteristics and knowledge about image compressibility in CDE operators to accelerate the search. KBDE and CDE algorithms have been experimented on variety of images and an extensive performance analysis has been made between them, which reveal that KBDE accelerates the convergence rate of CDE without compromising on the quality of solution. Further, a statistical hypothesis test t-test confirms the result.

Knowledge-based genetic algorithm approach to quantization table generation for the JPEG baseline algorithm

JPEG has played an important role in the image compressioneld for the past two decades. Quantization tables in the JPEG scheme is a key factor that is responsible for compression/qual trade-off. Finding the optimal quantization table is an open research problem. Studies recommend the genetic algorithm to generate the optimal solution. Recent reports revealed optimal quantization table generation based on a classical genetic algorithm (CGA). Although the CGA produces better results, it shows inefficiency in terms of convergence speed and productivity of feasible solutions. This paper proposes a knowledge-based genetic algorithm (KBGA), which combines the image characteristics and knowledge about image compressibility with CGA operators such as initialization, selection, crossover, and mutation for searching for the optimal quantization table. The experimental results show that the optimal quantization table generated using the proposed KBGA outperforms the default JPEG quantization table in terms of mean square error (MSE) and peak signal-to-noise ratio (PSNR) for target bits per pixel. The KBGA was also tested on a variety of images in three different bits values per pixel to show its strength. The proposed KBGA produces an average PSNR gain of 3.3% and average MSE gain of 20.6% over the default JPEG quantization table. The performance measures such as average untness value, likelihood of evolution leap, and likelihood of optimality are used to validate the efficacy of the proposed KBGA. The novelty of the KBGA lies in the number of generations used to attain an optimal solution as compared to the CGA. The validation results show that this proposed KBGA guarantees feasible solutions with better quality at faster convergence rates.

Neutron Cross Section Processing Methods for Improved Integral Benchmarking of Unresolved Resonance Region Evaluations

In this work we describe the development and application of computational methods for processing neutron cross section data in the unresolved resonance region (URR). These methods are integrated with a continuous-energy Monte Carlo neutron transport code, thereby enabling their use in high-fidelity analyses. Enhanced understanding of the effects of URR evaluation representations on calculated results is then obtained through utilization of the methods in Monte Carlo integral benchmark simulations of fast spectrum critical assemblies. First, we present a so-called on-the-fly (OTF) method for calculating and Doppler broadening URR cross sections. This method proceeds directly from ENDF-6 average unresolved resonance parameters and, thus, eliminates any need for a probability table generation pre-processing step in which tables are constructed at several energies for all desired temperatures. Significant memory reduction may be realized with the OTF method relative to a probability table treatment if many temperatures are needed. Next, we examine the effects of using a multi-level resonance formalism for resonance reconstruction in the URR. A comparison of results obtained by using the same stochastically-generated realization of resonance parameters in both the single-level Breit-Wigner (SLBW) and multi-level Breit-Wigner (MLBW) formalisms allows for the quantification of level-level interference effects on integrated tallies such as k eff and energy group reaction rates. Though, as is well-known, cross section values at any given incident energy may differ significantly between single-level and multi-level formulations, the observed effects on integral results are minimal in this investigation. Finally, we demonstrate the calculation of true expected values, and the statistical spread of those values, through independent Monte Carlo simulations, each using an independent realization of URR cross section structure throughout. It is observed that both probability table and OTF treatments reproduce the true expected values, calculated by averaging the results of many independent simulations, quite well. However, the spread of independent calculation results is shown to be relatively significant. The k eff eigenvalues for fast spectrum systems can differ by more than 250 pcm from one simulation to the next.

Sterilization Plant simulation of whole milk UHT Type through the Aspen plus

<p>The milk sterilization process aims to diminish or extinguish the microbial load present in the food in order to reduce possible damage arising of the metabolic processes of microorganisms that might be present in food. The system currently used in milk processing plants have direct injection principle oversaturated steam in a certain volume of milk in order to establish microbiological reduction, then the product is directed to a tank where flash evaporation condensed the steam is taken off after the product part to the homogenizer where fat molecules are broken making the standardized product. In this whole process is used a system called VTIS (Vacum Therm Instant Steriliser) developed by Tetra Pak company that consists of a piece of equipment back to the sterilization of liquid foods. The computational model used the Aspen plus programmable plataform that by means of unit operations allows you to predict the behavior of a process, this plataform lets you interactively vary some elements of the process in order to obtain desired results through the flowsheets of feed compositions and operating conditions. The ASPEN plus enables the realization of sensitivity analysis, generation of graphs and tables, estimation, regression of physic-chemical properties, settings of simulation models the operative data, equipment sizing, cost analysis, and data input sheets of calculations. As a result was able to reproduce a process without the need for costs.</p>

Inclusion of Field-Solver-Based Tower Footing Grounding Models in Electromagnetic Transient Programs

This paper presents a new approach to wideband modeling of tower footing grounding impedances. Appropriate representation of transmission tower footing impedances is essential in electromagnetic (EM) transient simulations for proper evaluation of overvoltages and flashovers in the system during fast-front transient conditions such as lightning strikes. In this paper, a field solver is used to precisely model the most popular types of tower footing grounding systems, i.e., rods, counterpoises, and ring electrodes, for a variety of dimensions and soil parameters. Results are stored in a lookup table and used for generating frequency-dependent models that are exported to EM transient simulators. The table and model generation tool can be used by utility companies to model tower footings while taking into account local variations along the right-of-way, such as local variations in soil resistivity. The presented examples show close agreement of results of lightning studies using developed electrode models included in EM tools, e.g., PSCAD, EMTP-RV, and ATP-EMTP. A sensitivity study shows that the maximum voltage at the tower top during a direct lightning strike can be up to 19% higher when using the adopted modeling procedure, as compared to a standard approach of using a fixed resistor equal to the power frequency resistance.

TT-RMS:时间触发网络通信表生成算法

针对时间触发网络依据全局时间进行触发数据通信的特点,提出了一种基于单调速率调度（RMS）调度机制的通信表生成算法时间触发单调速率调度（TT-RMS）,来生成时间触发网络的通信表.TT-RMS算法在安排消息时间槽过程中,首先根据消息周期,计算出各个链路的总负载,再根据链路的消息周期和总负载,通过RMS机制进行消息排序,确定出消息调度的先后顺序,最后根据时间槽的分配状态进行消息调度,优化了消息的调度过程.所提算法的计算时间复杂度为O（n^2）,空间复杂度为O（n）.目前广泛研究和应用的可满足性理论（SMT）通信表生成方法,其计算时间复杂度通常是多项式级,有时计算时间不收敛.实验结果显示,TT-RMS调度的网络单个链路负载最大可接近100%,计算时间在1 ms左右,平均可调度网络负载是SMT方法可调度网络负载的两倍.TT-RMS通信表生成算法具有计算时间短,可调度消息负载多等优点,可以更好地满足航空航天复杂系统中上千条实时消息流的调度需要.

An equation of state for partially ionized plasmas: The Coulomb contribution to the free energy

We have previously developed an equation of state (EOS) model called ChemEOS (Hakel and Kilcrease, Atomic Processes in Plasmas, Eds., J. Cohen et al., AIP, 2004) for a plasma of interacting ions, atoms and electrons. It is based on a chemical picture of the plasma and is derived from an expression for the Helmholtz free energy of the interacting species. All other equilibrium thermodynamic quantities are then obtained by minimizing this free energy subject to constraints, thus leading to a thermodynamically consistent EOS. The contribution to this free energy from the Coulomb interactions among the particles is treated using the method of Chabrier and Potekhin (Phys. Rev. E 58, 4941 (1998)) which we have adapted for partially ionized plasmas. This treatment is further examined and is found to give rise to unphysical behavior for various elements at certain values of the density and temperature where the Coulomb coupling begins to become significant and the atoms are partially ionized. We examine the source of this unphysical behavior and suggest corrections that produce acceptable results. The sensitivity of the thermodynamic properties and frequency-dependent opacity of iron is examined with and without these corrections. The corrected EOS is used to determine the fractional ion populations and level populations for a new generation of OPLIB low-Z opacity tables currently being prepared at Los Alamos National Laboratory with the ATOMIC code.

Agplus: a rapid and flexible tool for aggregation plots.

Aggregation plots are frequently used to evaluate signal distributions at user-interested points in ChIP-Seq data analysis. agplus, a new and simple command-line tool, enables rapid and flexible generation of text tables tailored for aggregation plots from which users can easily design multiple groups based on user-definitions such as regulatory regions or transcription initiation sites. This software is implemented in Ruby, supported on Linux and Mac OSX, and freely available at http://github.com/kazumits/agplus yohkawa@epigenetics.med.kyushu-u.ac.jp.

High utilization dynamic bandwidth allocation algorithm based on sorting report messages with additive-polling thresholds in EPONs

High utilization is one of the design goals for MPCP-based dynamic bandwidth allocation (DBA) algorithms in Ethernet passive optical networks (EPON). However, utilization is sacrificed in order to meet the delay limits of the applications in most DBA design schemes. This paper proposes a dynamic bandwidth allocation algorithm based on sorting report messages with additive-polling thresholds (AP-Sort DBA). This has the characteristics of high utilization and low delay during medium network loading. AP-Sort DBA is an extension of the adaptive dynamic bandwidth allocation algorithm with sorting report messages (Sort-DBA) and promotes utilization by reduction of unused slot remainders (USR) and distribution of excess bandwidth. For performance evaluation in terms of average delay, average queue size, loss rate and utilization, five DBA schemes are simulated, namely AP-Sort DBA, interleaved polling with adaptive cycle time (IPACT), dynamic bandwidth allocation with a modified grant table generation algorithm and fair-excess allocation (DBA2-FE), Sort-DBA and double phase polling algorithm (DPA). Self-similar traffic and OC-3 packet size distribution are used for frame generation. The results show that AP-Sort DBA can achieve up to 99% utilization, which is the highest among the tested alternatives, with up to 60% improved delay compared to the IPACT. Technical analysis is presented for further proof of the effectiveness of the proposed methodology.

Ziria

Software-defined radio (SDR) brings the flexibility of software to wireless protocol design, promising an ideal platform for innovation and rapid protocol deployment. However, implementing modern wireless protocols on existing SDR platforms often requires careful hand-tuning of low-level code, which can undermine the advantages of software. Ziria is a new domain-specific language (DSL) that offers programming abstractions suitable for wireless physical (PHY) layer tasks while emphasizing the pipeline reconfiguration aspects of PHY programming. The Ziria compiler implements a rich set of specialized optimizations, such as lookup table generation and pipeline fusion. We also offer a novel -- due to pipeline reconfiguration -- algorithm to optimize the data widths of computations in Ziria pipelines. We demonstrate the programming flexibility of Ziria and the performance of the generated code through a detailed evaluation of a line-rate Ziria WiFi 802.11a/g implementation that is on par and in many cases outperforms a hand-tuned state-of-the-art C++ implementation on commodity CPUs.

Ziria

Software-defined radio (SDR) brings the flexibility of software to wireless protocol design, promising an ideal platform for innovation and rapid protocol deployment. However, implementing modern wireless protocols on existing SDR platforms often requires careful hand-tuning of low-level code, which can undermine the advantages of software. Ziria is a new domain-specific language (DSL) that offers programming abstractions suitable for wireless physical (PHY) layer tasks while emphasizing the pipeline reconfiguration aspects of PHY programming. The Ziria compiler implements a rich set of specialized optimizations, such as lookup table generation and pipeline fusion. We also offer a novel -- due to pipeline reconfiguration -- algorithm to optimize the data widths of computations in Ziria pipelines. We demonstrate the programming flexibility of Ziria and the performance of the generated code through a detailed evaluation of a line-rate Ziria WiFi 802.11a/g implementation that is on par and in many cases outperforms a hand-tuned state-of-the-art C++ implementation on commodity CPUs.

Explicit Chemical Timescale as a Substitute for Tabulated Chemistry in a H2–O2 Turbulent Flame Simulation

Although impressive advances have been achieved in the area of tabulated chemistry for turbulent combustion modeling, table generation remains a tedious task, sometimes as costly as the computation itself. In this work, we intend to offer an alternative to tabulation, applied to the MIL turbulent combustion model. An explicit expression for chemical times, function of pressure, temperature, and mixture fraction (Boivin et al., 2011), is successfully implemented and used instead of tabulated chemistry in the simulation of a supersonic H2–O2 lifted flame.

Prototype of a Decision Table Generation Tool from the Formal Specification

This research has implemented a prototype of a decision table generation tool from the specification (the formal specification) described in a formal specification language. This paper uses the formal specification description language VDM++ which is the lightweight formal methods VDM (Vienna Development Method) to write the formal specification. We applied some general specifications to the prototype, in order to evaluate its usefulness. As a result, the prototype has improved the efficiency in test design with formal methods.

Design and Analytical Analysis of a Novel DBA Algorithm with Dual-Polling Tables in EPON

Ethernet passive optical network is a point-to-multipoint structure, and an effective media access protocol should be designed for collision avoidance and bandwidth allocation. Most previous researches have aimed to solve the problem using dynamic bandwidth allocation (DBA) algorithms with polling-based schemes. Unfortunately, idle channel time among the polling cycles cannot be overcome efficiently. In this paper, a dual-polling DBA (DP-DBA) algorithm which consists of an interpolling mechanism and an intrapolling mechanism is proposed. The interpolling mechanism helps eliminate the idle time problem while the intrapolling part aggregates the unused bandwidth of the light-loaded users and those due to nondefragmentation of the Ethernet frames of the general users. We also evaluate the performance of the DP-DBA algorithm by a comparison with the interleaved polling with adaptive cycle time (IPACT), the dynamic bandwidth allocation with a modified grant table generation algorithm (DBA2), the Double-Phase Polling (DPP), and the adaptive DBA algorithm with sorting report messages (Sort-DBA) schemes with simulation results. For greater realism with regard to general applications, we also simulate the asymmetric traffic loads at the optical network units (ONUs).The results show that DP-DBA outperforms the other DBA schemes under asymmetric load conditions.

Compiler for Detection of Program Vulnerabilities

Program Vulnerabilities may be unwarranted for any organization and may lead to severe system failure. Due to the advancement of technology there has been increase in the area of vulnerability attacks which are exploited by hackers for getting access to the system or insertion of their malicious code. In this paper we present a proposal for compiler design which prevents some common vulnerability. The output result for our compiler would be compile time warning stating the possible vulnerability in the code. We will also look into the details about the different type of vulnerability and how the attacker can exploit those vulnerabilities in order to corrupt the system. The knowledge of various vulnerability creation areas have been used to design a compiler for vulnerability prevention. Compiler in this publication uses the symbol table generation mechanism for syntactically, semantically segregation of executable code and canary guard mechanism for the protection of cases of buffer overflow. Major work in this area deals with the simple scenarios for vulnerability detection but our aim is to check for various complicated scenarios and non common possibilities for program attack and designing a framework preventing such kinds of attacks. General Terms Lexical Analysis, Syntax Analysis, Parser, Token, Semantic Analyzer, Symbol table, Random XOR.

HIERARCHICAL DOMAIN DECOMPOSITION WITH PARALLEL MESH REFINEMENT FOR BILLIONS-OF-DOF SCALE FINITE ELEMENT ANALYSES

This paper describes a parallel fast generation method of large-scale meshes for a hierarchical domain decomposition method implemented in the open source parallel finite element software ADVENTURE. Since large-scale meshes need to be generated in order to perform various analyses in Japan's Petaflops Supercomputer, nicknamed the "K computer", a mesh refinement function and a communication table generation function without communication are newly developed and implemented for the hierarchical domain decomposition tool named ADVENTURE_Metis. The developed new version is named ADVENTURE_Metis Ver.2. Since a generation cost of a communication table for sending and receiving data among computational nodes becomes so expensive for the refined large-scale mesh, the present authors have newly developed a parallel algorithm such that the communication tables of vertices, edges and faces are updated each other during mesh refinement after the initial communication tables of vertices, edges and faces are generated for an initial mesh. As a result, the generation of a refined mesh model over billions degrees of freedom (DOFs) from an initial medium-size mesh model of about a million DOFs can be performed in a parallel computer in a short time.

The Parallel Solving and Program Implementation Method of Large-Scale Power Flow Correction Equations

This paper present a parallel solving method of large-scale power flow correction equations and the program implementation based on the shared memory programming model OpenMP, which Improve the utilization rate the computer CPU resources and the computing speed. The method uses factor tables for solving the power flow equations. Combined the sparsity of correction equations coefficient matrix, the rows which can be do normalized simultaneously are grouped for doing the normalization and elimination operations in parallel. Meanwhile, use the row grouping information which is obtained during the factor table generation process to do parallel previous generation computing. Finally, the simulation for the actual power grid verified the validity and rationality of the method.