Higher order block heuristics for 2D pallet loading problems with multiple box inputs

This study presents a two-phase algorithm for solving the Manufacturer's Pallet Loading Problem (MPLP) while considering overhang and stability constraints using a block approach. The MPLP involves determining a loading pattern that can load the most identical rectangular boxes onto a larger rectangular pallet. The proposed model is developed to obtain the maximum number of boxes that could be loaded onto a layer considering and without considering the overhang according to eight predetermined block arrangements (BAs) in the first phase. Then, the obtained overhang solutions are checked against the stability constraint in the second phase. Finally, the maximum number of boxes per layer is determined based on the results from the two phases. The validity and the performance of the proposed algorithm have been tested on available datasets in the literature. The proposed algorithm increased the number of boxes per layer; one to six boxes while considering overhang and stability, improving the pallet area utilization by 2.5% up to 14.3% for the tested datasets.

Enhancing pallet load stability: A MILP model for the Manufacturer’s Pallet Loading Problem with interlocking constraints

Neste artigo apresentamos métodos exatos, baseados em relaxações Lagrangiana e surrogate, com bom desempenho para resolver o problema de carregamento de paletes do produtor. Este problema consiste em arranjar ortogonalmente e sem sobreposição o máximo número de retângulos de dimensões (l,w) ou (l,w) sobre um retângulo maior (L,W). Os métodos propostos são procedimentos de busca em árvore do tipo branch and bound que, em cada nó, utilizam limitantes derivados de relaxações Lagrangiana e/ou surrogate de uma formulação de programação linear 0-1. Algoritmos de otimização do subgradiente são usados para otimizar estes limitantes. São aplicados ainda testes de redução do problema e heurísticas Lagrangiana e surrogate para se obter boas soluções factíveis na otimização do subgradiente. Testes computacionais foram realizados utilizando exemplos da literatura e exemplos reais de uma transportadora. Os resultados mostram que um dos métodos propostos é competitivo com outros métodos da literatura, incluindo o software GAMS/CPLEX.

An exact method for scheduling a yard crane

At present, ground faults are a hot research topic at home and abroad. As many scientific research institutions and manufacturers continue to deepen single-phase ground faults, they have proposed a new type of environmentally friendly primary and secondary fusion pole-mounted circuit breaker ZW68. However, the manufacturer' s products vary from good to bad, so the 10kV distribution network true platform is used to screen the quality of distribution network products. At the same time, single-phase grounding fault tests with different transition resistances and intermittent are grounding are carried out, verifying the new co-box type one and two times Integrated circuit breaker ZW68's ability to handle faults. Finally, through testing multiple new type common box type primary and secondary fusion pole-mounted circuit breakers ZW68, we put forward practical suggestions for the manufacturer's new products.

The bus transit system is promising to enable electric and autonomous vehicles for massive urban mobility, which relies on high-level automation and efficient resource management. Besides the on-road automation, the in-depot automated scheduling for battery recharging has not been adequately studied yet. This paper presents an integrated in-depot routing and recharging scheduling (IDRRS) problem, which is modeled as a constraint programming (CP) problem with Boolean satisfiability conditions (SAT). The model is converted to a flexible job-shop problem (FJSP) and is feasible to be solved by a CP-SAT solver for the optimal solution or feasible solutions with acceptable performance. This paper also presents a case study in Shanghai and compares the results from the FJSP model and the first-come first-serve (FCFS) method. The result demonstrates the allocation of routes and chargers under multiple scenarios with different numbers of chargers. The results show that the FJSP model shortens the delay and increases the time conservation for future rounds of operation than FCFS, while FCFS presents the simplicity of programming and better computational efficiency. The multiple random input test suggests that the proposed approach can decide the minimum number of chargers for stochastic charging requests. The proposed method can conserve the investment by increasing the utilization of automated recharging devices, improving vehicles’ in-depot efficiency.

H2 CONTROL OF PREVIEW SYSTEMS Agoes

Understanding drug resistance in cancer is paramount to improving patient outcomes, quality of life and reducing toxicities in patients receiving chemotherapy. Pharmacogenomic methods seek to understand the interaction of genomic variation and response to chemotherapeutic treatment. This chapter presents a workflow to interrogate multiple genomic inputs and individually assess their relationship with the phenotype of drug resistance using hierarchical clustering to determine the set of features that can best describe what features are associated with drug resistance. Then in a gene-centric manner regulatory features such as miRNAs, SNPs, or DNA methylation can be related back to the differential expression of genes to give understanding to the mechanism underlying resistance. In this chapter, we describe a computational method that can be adapted to a number of different diseases and phenotypes in which there are multiple genomic data types available with concordant phenotypic drug resistance information.

16 - Low-Level Physical Tuning

A Pharmacokinetic/Pharmacodynamic Comparison of SAAM II and PC/WinNonlin Modeling Software

Recent advancement in logging technology and data analytics enables measuring a comprehensive set of formation petrophysical properties and rock composition in cased-hole environments. Using state-of-art pulsed neutron logging technology and processing algorithms enables recording capture and inelastic elemental spectroscopy for rock elemental concentrations, including total organic carbon, detailed mineralogy and matrix properties, simultaneously to sigma and other neutron-based outputs. The integration of the interpreted lithology from cased-hole elemental spectroscopy data with electrofacies from high-resolution imaging tools recorded in the open-hole provides the characterization of heterogeneity challenges by building a synthetic core in old wells with limited data gathering from open-hole logging or absence of conventional coring. An effective way to incorporate those measurements has been developed and adapted to the use of cased-hole spectroscopy logs. The dry weight elemental fractions measured by the advanced pulse neutron technology are corrected for wellbore contribution and converted into dry weight mineralogical outputs. Using an automated processing workflow converts the capture and inelastic gamma-ray yields from the energy spectrum measured behind casing into the dry weight of elements and mineral fractions in the formation. The computed mineralogical outputs are then defined based on a standardized ternary diagram approach to developing dry-weight mineralogy-based lithofacies. This classification is then combined with the calibrated micro-resistivity image data collected during the open-hole logs evaluation to present a high-resolution rock typing (after Kumar & Kear). The resulting log is dry weight mineralogy-based high-resolution lithofacies that contain vital information to support geological and petrophysical reserves modeling adjustments during development and production. The paper demonstrates the applicability of the method to cased-hole environments in fields with mixed lithology and complex geological background. Once a robust lithofacies classification is achieved, this is applied for detailed stratigraphic analysis, well-to-well correlation, or refined static reservoir modeling. A standardized mineral-based facies scheme guides the selection of higher completion-quality intervals, otherwise difficult to define in old wells with limited original evaluation. Besides, thin beds that were previously bypassed can be detected and characterized for high-resolution net pay calculation leveraging the high-resolution lithofacies output from this approach. The lithofacies classification (synthetic core) provides important input to the study of reservoir connectivity in the development phase and production optimization. Moreover, a synthetic core description would be critical when reassessing mature fields and defining completion and production strategies where core data is not available. The approach and workflow can be implemented in various cases as a cost-effective solution in multiple scenarios and different formation types.

A multi-forkcipher (MFC) is a generalization of the forkcipher (FC) primitive introduced by Andreeva et al. at ASIACRYPT’19. An MFC is a tweakable cipher that computes s output blocks for a single input block, with s arbitrary but fixed. We define the MFC security in the ind-prtmfp notion as indistinguishability from s tweaked permutations. Generalizing tweakable block ciphers (TBCs, s = 1), as well as forkciphers (s = 2), MFC lends itself well to building simple-to-analyze modes of operation that support any number of cipher output blocks.Our main contribution is the generic CTR encryption mode GCTR that makes parallel calls to an MFC to encrypt a message M. We analyze the set of all 36 “simple and natural” GCTR variants under the nivE security notion by Peyrin and Seurin rom CRYPTO’16. Our proof method makes use of an intermediate abstraction called tweakable CTR (TCTR) that captures the core security properties of GCTR common to all variants, making their analyses easier. Our results show that many of the schemes achieve from well beyond birthday bound (BBB) to full n-bit security under nonce respecting adversaries and some even BBB and close to full n-bit security in the face of realistic nonce misuse conditions.We finally present an efficiency comparison of GCTR using ForkSkinny (an MFC with s = 2) with the traditional CTR and the more recent CTRT modes, both are instantiated with the SKINNY TBC. Our estimations show that any GCTR variant with ForkSkinny can achieve an efficiency advantage of over 20% for moderately long messages, illustrating that the use of an efficient MFC with s ≥ 2 brings a clear speed-up.

The interplay of the following factors: population design (PDN), the cost function in terms of maximum cost (Max. C) (i.e., maximum number of samples/sample size), sample size, and intersubject variability [restricted (30%) to moderate (60%)] on the estimation of pharmacokinetic parameters from population pharmacokinetic data sets obtained using mixed designs was investigated in a simulation study. A two compartment model with multiple bolus intravenous inputs was assumed, and the residual variability was set at 15%. The sample size (N) investigated ranged from 30 to 200 with the associated cost function varying accordingly with the five individual and sixteen population designs studied. Accurate and precise estimates of structural model parameters were obtained for N > or = 50 (Max. C > or = 150) irrespective of the intersubject variability (ITV) and PDN investigated. When ITV was 30%, all structural model parameters were well estimated irrespective of the PDN. Robust estimates of clearance and its variability were obtained for all N at all levels of ITV with Max. C > or = 90 (PDN > or = 4). Imprecise estimates of ITV in V1, V2, and Q were obtained at 60% ITV irrespective of N, PDN, or Max. C. Positive bias was associated with the estimation of variability in V1, V2, and Q with PDN < or = 4 (Max. C < or = 150). This was due in part to a greater proportion of subjects sampled only once. Correspondingly, residual variability was underestimated. It is of utmost importance to avoid this artifact by ensuring that at least a moderate subset of subjects contributing data to a population pharmacokinetic study contribute data more than once. Given a sample size and ITV, the cost function must be considered in designing a population pharmacokinetic study using mixed designs.

The performance of a non-blocking ATM switch in which each input port maintains a separate queue for each output port to overcome the head-of-line (HOL) blocking of conventional FIFO input queuing switches is presented. Parallel iterative matching (PIM) is used as the scheduling algorithm for selecting the HOL cells to be transmitted in each time slot. After deriving a closed-form solution for the maximum throughput of the switch under saturated conditions, an analytical model for evaluating the switch performance under i.i.d Bernoulli traffic is developed using the tagged input queue approach. Performance measures including throughput, mean cell delay, and cell loss probability are computed from the analytical model. The accuracy of the analytical model is verified using simulation.

Cloud enabled systems have become a crucial component to efficiently process and analyze massive amounts of data. One of the key data processing and analysis operations is the Similarity Join, which retrieves all data pairs whose distances are smaller than a pre-defined threshold ∈. Even though multiple algorithms and implementation techniques have been proposed for Similarity Joins, very little work has addressed the study of Similarity Joins for cloud systems. This paper presents MRSimJoin, a multi-round MapReduce based algorithm to efficiently solve the Similarity Join problem. MRSimJoin efficiently partitions and distributes the data until the subsets are small enough to be processed in a single node. The proposed algorithm is general enough to be used with data that lies in any metric space. We have implemented MRSimJoin in Hadoop, a highly used open-source cloud system. We show how this operation can be used in multiple real-world data analysis scenarios with multiple data types and distance functions. Particularly, we show the use of MRSimJoin to identify similar images represented as feature vectors, and similar publications in a bibliographic database. We also show how MRSimJoin scales in each scenario when important parameters, e.g., ∈, data size and number of cluster nodes, increase. We demonstrate the execution of MRSimJoin queries using an Amazon Elastic Compute Cloud (EC2) cluster.