This paper presents two polynomial time algorithms for the constant capacitated lot sizing problem with a batch production. We give several optimality properties for the general problem. Assuming constant production capacity, constant batch size and WagnerWhitin cost structure, we derive O(T ) and O(T ) time algorithms respectively for the case with production capacity multiple of the batch siz...

Algorithm-Assisted Bioprinting In article number 2204316, Kan Wang, Jinwu Wenguo Cui, and co-workers develop a stepwise algorithm-assisted bioprinting technology for the construction of biomimetic tissues with customizable anisotropic microstructure. Anisotropic mesh patterns minimum free energy are generated according to tissue-specific requirements subsequently programmed into optimized print...

Rough set is one of the most useful data mining techniques. How to use rough set to extract rule is the basement of rough set’s application. This paper discuss an algorithm that be used in attribute reduction. To attribute reduction, generally method is based on discernibility matrix or its improvement. But this series methods usually get one reduction, can’t accommodate uncertain information r...

A new form of SAT-based symbolic model checking is described. Instead of unrolling the transition relation, it incrementally generates clauses that are inductive relative to (and augment) stepwise approximate reachability information. In this way, the algorithm gradually refines the property, eventually producing either an inductive strengthening of the property or a counterexample trace. Our e...

This paper describes a hidden Markov model (HMM) based speech synthesis system developed for the Blizzard Challenge 2011. In the Blizzard Challenge 2011, we focused on the training algorithm for HMM-based speech synthesis systems. To alleviate the local maxima problems in the maximum likelihood estimation, we apply the deterministic annealing expectation maximization (DAEM) algorithm for traini...

form a complete lattice, the D e d e k i n d M a c N e i l l e c o m p l e t i o n (or short comp l e t i o n ) of (P, <). It is the smallest complete lattice containing a subset orderisomorphic with (P, <). The size of the completion may be exponential in [PI. The completion can be computed in steps: first complete a small part of (P, <), then add another element, complete again, et cetera. Ea...

This paper presents two polynomial time algorithms for the constant capacitated lot sizing problem with a batch production. We give several optimality properties for the general problem. Assuming constant production capacity, constant batch size and WagnerWhitin cost structure, we derive O(T 4) and O(T 6) time algorithms respectively for the case with production capacity multiple of the batch s...

We consider the problem of selecting grouped variables (factors) for accurate prediction in regression. Such a problem arises naturally in many practical situations with the multi-factor ANOVA problem as the most important and well known example. Instead of selecting factors by stepwise backward elimination, we focus on estimation accuracy and consider extensions of the LASSO, the LARS, and the...

We present a new efficient method for approximate search in electronic lexica. Given an input string (the pattern) and a similarity threshold, the algorithm retrieves all entries of the lexicon that are sufficiently similar to the pattern. Search is organized in subsearches that always start with an exact partial match where a substring of the input pattern is aligned with a substring of a lexi...