Minimum Run Length Research Articles

PSVIII-24 Inbreeding levels of the Line 4 Hereford cattle population

Abstract Inbreeding is an increasing issue in the beef cattle industry due to increased use of artificial insemination (AI) and embryo transfer (ET). Inbreeding, or increased relatedness between animals, results in inbreeding depression and its effects have been well documented; reduced performance, reproduction, and profitability. However, there is a lack of understanding the molecular mechanisms involved in inbreeding depression. Long-term linebred populations offer a unique opportunity to better understand this, more specifically the Line 4 Hereford population. The population was established from the Line 1 Hereford population in 1962 and has been maintained by the Montana State University (MSU) Northern Agricultural Research Center (NARC) near Havre, MT since its establishment. Inbreeding was estimated using a complete pedigree (FPED) and genomic information on a subset of the population. A pedigree containing 3,453 animals was constructed covering years 1962 – 2018 and was used to calculate FCPED. Animals were selected for genotyping based on genetic contributions and availability. 241 semen, tissue, and blood samples were collected and genotyped with the Illumina Bovine GGP 50K BeadChip. Genomic inbreeding (FG) and pedigree inbreeding (FGPED) were evaluated for the 241 genotyped animals. Average rate of change in inbreeding per year was also evaluated. Runs of Homozygosity (ROH) analysis was performed in Golden Helix SVS v8.8.3. ROH were defined as a minimum run length of 500 kb with a minimum of 20 SNP. Inbreeding ranges were 0 – 34%, 0 – 98%, and 0 – 27% and the average inbreeding was 10.0%, 11.4%, and 15.3% for FPED, FG, and FGPED, respectively. The average rate of change in inbreeding per year was 0.3% over 57 years. Initial analysis found 30 regions identified by ROH, indicating that we can use ROH analysis and potentially Genome-Wide Association Studies (GWAS) to identify regions of the genome being impacted by inbreeding depression.

Probabilistic Structure of Extreme Run Lengths in a Stationary Hydrologic Time Series

AbstractCurrent probabilistic methods for maximum and minimum run lengths in a hydrologic time series need further development. Using the first-order Markov chain model and an extreme-value theory ...

Production planning and scheduling optimization model: a case of study for a glass container company

Based on a case study, this paper deals with the production planning and scheduling problem of the glass container industry. This is a facility production system that has a set of furnaces where the glass is produced in order to meet the demand, being afterwards distributed to a set of parallel molding machines. Due to huge setup times involved in a color changeover, manufacturers adopt their own mix of furnaces and machines to meet the needs of their customers as flexibly and efficiently as possible. In this paper we proposed an optimization model that maximizes the fulfillment of the demand considering typical constraints from the planning production formulation as well as real case production constraints such as the limited product changeovers and the minimum run length in a machine. The complexity of the proposed model is assessed by means of an industrial real instance.

Economic statistical design of ARMA control chart through a Modified Fitness-based Self-Adaptive Differential Evolution

In this paper the economic statistical design of an Auto-Regressive Moving Average (ARMA) control chart for autocorrelated data has been investigated. In particular, the total cost of the chart subject to a constraint on the minimum in-control average run length has been taken into account. Due to the autocorrelation of the data, a simulation approach was adopted to assess both in-control and out-of-control average run lengths as the charting parameters change. In order to select the optimal parameters of the ARMA chart a Modified Fitness-based Self-Adaptive Differential Evolution algorithm, named MF-SADE, has been developed. To validate the effectiveness of MF-SADE in solving the proposed control chart design problem, an extensive comparison campaign involving four different metaheuristics from the relevant literature was arranged. Once the obtained numerical results confirmed the outperformance of SADE, it was used to carry out a sensitivity analysis including parameters of the cost model and those concerned with the underlying process, denoted as u and v. Among the numerous findings, the sensitivity analysis put in evidence the relationship between u, v and the variables of the economical statistical issue under investigation.

A Mathematical Programming Model for Tactical Planning with Set-up Continuity in a Two-stage Ceramic Firm

<p>It is known that capacity issues in tactical production plans in a hierarchical context are relevant since its inaccurate determination may lead to unrealistic or simply non-feasible plans at the operational level. Semi-continuous industrial processes, such as ceramic ones, often imply large setups and their consideration is crucial for accurate capacity estimation. However, in most of production planning models developed in a hierarchical context at this tactical (aggregated) level, setup changes are not explicitly considered. Their consideration includes not only decisions about lot sizing of production, but also allocation, known as Capacitated Lot Sizing and Loading Problem (CLSLP). However, CLSLP does not account for set-up continuity, specially important in contexts with lengthy and costly set-ups and where product families minimum run length are similar to planning periods. In this work, a mixed integer linear programming (MILP) model for a two stage ceramic firm which accounts for lot sizing and loading decisions including minimum lot-sizes and set-up continuity between two consecutive periods is proposed. Set-up continuity inclusion is modelled just considering which product families are produced at the beginning and at the end of each period of time, and not the complete sequence. The model is solved over a simplified two-stage real-case within a Spanish ceramic firm. Obtained results confirm its validity.</p>

Low-cost ultrahigh areal density optical disc system towards 400 Gbyte/disc

We introduce a new 400 Gbyte disc system, which has twice as much areal density as BDXL™ does, retaining the use of the conventional optical head and disc technology. Our proposal is based on the application of code modulations with enlarged minimum run length (d) and land/groove (L/G) geometry to increase linear recording density and track density by 1.5 and 1.33 times, respectively. Also, saw tooth wobble (STW) was introduced for a multilayered L/G disc system to suppress readout signal fluctuations. Here, we demonstrated that the linear recording density increased to 45.5 Gbyte/layer by applying d = 3 to a commercially available BDXL™. Also, we checked that crosstalk, which is a major concern in an L/G disc with a track pitch of 240 nm, was suppressed to below −30 dB by choosing the proper groove depth. Moreover, the investigation of the effect of track width modulation on the write/read performance demonstrated that an adverse influence can be suppressed by employing STW.

An RLL code design that maximises channel utilisation

Comprehensive (d,k) sequences study is presented, complemented with the design of a new, efficient, Run-Length Limited (RLL) code. The new code belongs to group of constrained coding schemas with a coding rate of R = 2/5 and with the minimum runlength between two successive transitions equal to 4. Presented RLL (4, ∞) code uses channel capacity highly efficiently, with 98.7% and consequently it achieves a high-density rate of DR = 2.0. It is implying that two bits can be recorded, or transmitted with one transition. Coding techniques based on the presented constraints and the selected coding rate have better efficiency than many other currently used codes for high density optical recording and transmission.

Rectilinear paths with minimum segment lengths

Given a set of n open rectangles that represent obstacles in the Euclidean plane, we consider the problem of finding a shortest rectilinear path between two given points such that each segment of the path has a certain minimum length. A rectilinear path consists of horizontal and vertical segments only and may not intersect with an obstacle.We show how to solve the resulting shortest path problem with minimum segment lengths in polynomial time by constructing an extended Hanan grid of the instance first, and then run an adapted shortest path algorithm to find a respective solution. While the extended Hanan grid as basic underlying structure can be stored in O(n2) space, the approach yields an O(n4logn) time and O(n4) space algorithm.The problem at hand typically arises in the area of VLSI design, where rectilinear paths are utilized to create wiring interconnects. There, the lithographic production process dictates certain minimum run lengths for the wires in order to avoid infeasible patterns. Another application arises in robot motion planning when acceleration and breaking distances need to be obeyed.

Scheduling Gasoline Blending Operations from Recipe Determination to Shipping Using Unit Slots

Gasoline can yield 60%–70% of the total profit of a refinery. Integrated scheduling of gasoline blending and order delivery operations can increase profit by avoiding ship demurrage, improving customer satisfaction, minimizing quality giveaways, avoiding costly transitions and slop generation, and reducing inventory costs. In this paper, we develop a novel continuous-time formulation using unit slots for an integrated scheduling of gasoline blending operations incorporating features such as multipurpose tanks, parallel nonidentical blenders, minimum run lengths, blender setups, tank changeovers, piecewise-constant profiles for blend component qualities and feed rates, simultaneous receipt/delivery by tanks, etc. We employ and revise the schedule adjustment procedure of Li et al. [AIChE J.2010, 56, 441–465] to avoid solving mixed-integer nonlinear programming (MINLP) problems and illustrate the effectiveness of our new formulation on 14 industry-scale examples.

Long-term scheduling of a single-unit multi-product continuous process to manufacture high performance glass

In this paper we address the long-term scheduling of a real world multi-product single stage continuous process for manufacturing glass. This process features long minimum run lengths, and sequence dependent changeovers of the order of days, with high transition costs. The long-term scheduling involves extended time horizons that lead to large scale mixed-integer linear programming (MILP) scheduling models. In order to address the difficulties posed by the size of the models, three different rolling horizon algorithms based on different models and time aggregation techniques are developed. The models are based on the continuous time slot MILP model, and on the traveling salesman model proposed by Erdirik-Dogan and Grossmann (2008). Due to the particular characteristics of the process under study, several new features, including minimum run lengths and changeovers across due dates, are proposed. The performance and characteristics of the proposed rolling horizon algorithms are discussed for one industrial example.

Recipe determination and scheduling of gasoline blending operations

AbstractGasoline is a major contributor to the profit of a refinery. Scheduling gasoline‐blending operations is a critical and complex routine task involving tank allocation, component mixing, blending, product storage, and order delivery. Optimized schedules can maximize profit by avoiding ship demurrage, improving order delivery, minimizing quality give‐aways, avoiding costly transitions and slop generation, and reducing inventory costs. However, the blending recipe and scheduling decisions make this problem a nonconvex mixed‐integer nonlinear program (MINLP). In this article, we develop a slot‐based MILP formulation for an integrated treatment of recipe, specifications, blending, and storage and incorporate many real‐life features such as multipurpose product tanks, parallel nonidentical blenders, minimum run lengths, changeovers, piecewise constant profiles for blend component qualities and feed rates, etc. To ensure constant blending rates during a run, we develop a novel and efficient procedure that solves successive MILPs instead of a nonconvex MINLP. We use 14 examples with varying sizes and features to illustrate the superiority and effectiveness of our formulation and solution approach. The results show that our solution approach is superior to commercial solvers (BARON and DICOPT). © 2009 American Institute of Chemical Engineers AIChE J, 2010

Turbo Equalization of Run Length Limited (1,9) and Low Density Parity Check Code for Super Resolution Nearfield Structure Read Only Memory Discs with 60 nm Minimum Mark Length

Due to severe intersymbol interference and low signal-to-noise ratio of super resolution nearfield structure (SuperRENS) random read-outs, turbo equalization techniques are applied to lower bit error rates. A d1k9r5 run length limited (RLL) modulation code having minimum runlength d = 1, maximum runlength k = 9 and repeated minimum transition run limitation of r = 5 has been developed with emphasis on low joint bit detection and demodulation (super-trellis) complexity for use within turbo equalization schemes. Bit error rate (BER) performance of d1k9r5 code over partial response-channels is similar to 17pp code while the super-trellis detector complexity of d1k9r5 code is reduced. Low-frequency suppression performance of d1k9r5 code is similar to that of 17pp code under the same DC control redundancy. BER results for measured data from a 60 nm SuperRENS read only memory disc employing an InSb mask layer, using d1k9r5 modulation and a high-rate quasi-cyclic low density parity check (LDPC) code, correspond well to simulation results. Continuously decreasing BERs down to 2 ×10-5 after five iterations show that a turbo equalization scheme incorporating d1k9r5 super-trellis detection can be successfully applied in SuperRENS storage systems together with an LDPC code.

Performance Investigation of Soft-Decodable Runlength-Limited Codes With Different Minimum Runlength Constraints in High-Density Optical Recording

This paper investigates the performance of runlength-limited (RLL) codes with different d constraints in high-density optical recording, for both the low-density parity-check (LDPC)-coded Bliss scheme and the standard concatenation scheme. For the d = 5 constraint, we propose a low-complexity compression/decompression scenario that maps each 6-bit channel to a 3-bit compressed codeword by Gray-alike coding of the position of the transition in the 6-bit codeword, to compensate the density loss introduced by the redundancy of LDPC coding in the LDPC-coded Bliss scheme. Using a scalar diffraction channel model, we ran simulations to compare the performance of RLL codes with four different d constraints: d = 0,1,2, and 5, in near-field optical recording systems. The simulation results address the average bit error number in erroneous symbols after soft-input soft-output channel detection. Further, we evaluated the net density with different sets of simulation parameters, for both the LDPC-coded Bliss scheme and the standard concatenation scheme, considering jitter noise and additive white Gaussian noise, respectively.

Enforcing minimum run length in the cutting stock problem

Deckling, cutting stock or trim loss problems arise when small units are to be fitted into large ones. One aims to reduce stock usage and setups, then favors long runs, surplus over waste, similar loss per pattern and prompt delivery. One may also want to enforce exact solutions, with zero tolerance for surplus, or those with a narrow limit on pattern loss. Among secondary objectives, setups affect run length: on the average, fewer setups mean longer runs. Yet this relation is erratic. As setups decrease, some runs become longer, but others may stay as short as they are or become even shorter. We first show that this is so. We then examine the feasibility and the cost of making the shortest run longer in one-dimensional deckling problems. We show that conditional constraints do not formally enforce long runs, yet help to prove that they add at least one stock unit to an otherwise optimal plan. In turn, a relaxed stock constraint may improve runs, setups and surplus.

A new model for complete solutions to one-dimensional cutting stock problems

This new model resolves the non-linearity in the one-dimensional cutting stock problem, between pattern variables and pattern run lengths, by a novel use of 0–1 variables. The model does not require pre-specification of cutting patterns. It explicitly includes practical constraints such as pattern cardinality constraints, minimum run length constraints and sequence related constraints. The resultant MIP is relatively compact and its application to four problem instances using a commercial MIP package is presented.

Asymmetric run length constraints for increased resolution and power margin in MAMMOS readout

In the present invention asymmetric run length constraints with different minimum run lengths for first and second patterns representing binary data are introduced, like dm=0 for the first pattenr, i.e. shortest sequence of first patterns is equal to the bit period, and ds>0 for the second pattern, i.e. shortest sequence of second patterns is equal to d+1 bit periods. Thereby, the small 'cost' of a reduced code rate will be more than compensated by a large increase in power margin.

Scheduling of Single-Stage and Continuous Processes on Parallel Lines with Intermediate Due Dates

This paper addresses scheduling problems in single-stage and continuous multiproduct processes on parallel lines with intermediate due dates and especially restrictions on minimum run lengths. Whereas previous approaches require predetermined time slots or a maximum number of time slots to which only one task should be assigned, the proposed formulation does not use time slots within a time period. Therefore, the size of a model and its computation time are significantly reduced, with restrictions on several realistic situations, such as minimum run lengths, idle times of processes, and tests/maintenance, that are addressed in previous literature. Our approach is illustrated with various examples presented in the literature.

Signal space detection for DVD optical recording

A signal space detector (SSD) based on a single hyperplane is proposed which offers nearly the same performance as the fixed delay tree search with decision feedback (FDTS/DF) for the digital versatile disk (DVD) channel. The FDTS/DF detector with a reasonable decision delay performs almost as well as the optimal maximum likelihood sequence detector (MLSD) due to the FDTS/DF plus modulation code that includes the d=2 minimum runlength constraint. The single-hyperplane approximation of the FDTS/DF detector is made possible by considering only the critical signal points in the three-dimensional signal space. When the jitter noise is significant, the slope of the hyperplane decision boundary can readily be adjusted to improve the performance beyond that of the standard FDTS/DF detector. We also provide analysis and simulation results that verify the performance advantage of the SSD over partial response (PR) based threshold and Viterbi detectors. The distance between the received signal in signal space and the single hyperplane can be interpreted as soft information. The soft SSD can be used along with iterative error correction codes, such as low density parity check codes (LDPC), resulting in large performance gains.

生き残りパスを利用した雑音予測による雑音白色化機能を備えたビタビ復号法の検討

This paper describes a method of eliminating the auto correlation of equalized noises to have the optimum performance of a Viterbi decoder designed for white noise. This elimination is performed by subtracting predicted noises from an arriving equalized noise. This predicted noise is generated by using both coefficients calculated from auto correlation of the equalized noises and noises corresponding to survived paths. A correctly predicted noise reduces an arriving equalized noise on average, so the error rate becomes lower. A Viterbi decoder with a noise whitening function reduced the number of errors to about 1/6 of those of a conventional Viterbi decoder's for an experimental digital video cassette recorder. The conditions of the experiments were : relative tap e-to-head speed of 7.5 m/s, recording rate of 40.5 Mb/s, and 8/12 code whose minimum run length was limited to 2 (in NRZL notation) combined with EPR 4, and four coefficients for noise prediction.

Two dimensional umbrella sampling techniques for the computer simulation study of helical peptides at thermal equilibrium: The 3K(I) peptide in vacuo and solution

New computational techniques are developed to study conformational equilibrium in helical peptides at finite temperature. Two dimensional umbrella sampling methods involving coordinate systems which incorporate the α-helical hydrogen bonding distances along the peptide backbone as collective variables are presented. The umbrella sampling techniques are combined with new extended system multiple time step molecular dynamics simulation methods to allow peptide equilibria to be examined on a realistic potential energy surface. In particular, this combination of methods is employed to study a sixteen residue alanine-based peptide, Ac−(AAAAK)3A−NH2, at T=300 K in vacuo and solution, under the all-atom CHARMM22 force field. The efficiency of the multiple time step integration methodology permitted a minimum total run length of 30 ns to be employed in each umbrella sampling calculation reported.