On the pivot structure for the weighing matrix W(12,11)

In the present article we concentrate our study on the growth problem for the weighing matrix W(12,11) and show that the unique W(12,11) has three pivot structures. An improved algorithm for extending a k × k (0,+,-) matrix to a W(n,n-1), if possible, has been developed to simplify the proof. For the implementation of the algorithm special emphasis is given to the notions of data structures and parallel processing.     

On path lengths modulo three

We show that between any two nodes of a cubic, planar, three-connected graph there are three paths whose lengths are 0, 1, and 2 modulo 3, respectively. The proof is by a rather extensive case analysis. Counterexamples show that all three hypotheses (i.e., planarity, degree-three, and three-connectivity) are necessary.     

Development of an epi-fluorescence assay for monitoring yeast viability and pretreatment hydrolysate toxicity in the presence of lignocellulosic solids

Applied Biochemistry and Biotechnology -     

A sublogarithmic convex hull algorithm

We present a parallel algorithm for finding the convex hull of a sorted set of points in the plane. Our algorithm runs inO(logn/log logn) time usingO(n log logn/logn) processors in theCommon crcw pram computational model, which is shown to be time and cost optimal. The algorithm is based onn ^1/3 divide-and-conquer and uses a simple pointer-based data structure.Part of this work was done when the last three authors were at the Department of Computer and Information Science, Linköping University. The research of the second author was supported by the Academy of Finland.     

Optimal Lot-sizing and Machining Economics

This paper presents a queueing model with the service station subject to breakdown while it is busy, in order to determine analytically the optimal batch size in a machining economics problem. It is shown that departures from the optimal batch size result in moderate waiting-time increases when the batch size is scaled up and in significant waiting-time increases when the batch size is scaled down. It is also shown, through the use of a simulation model with normally distributed tool lives, that the analytical results obtained with exponentially distributed tool lives are quite robust. In the multiple-item case, simulation results show that the time in the system for each item and the average time in the system across all items behave exactly like the time in the system in the single-item case.     

Efficient parallel algorithms for shortest paths in planar digraphs

Efficient parallel algorithms are presented, on the CREW PRAM model, for generating a succinct encoding of all pairs shortest path information in a directed planar graphG with real-valued edge costs but no negative cycles. We assume that a planar embedding ofG is given, together with a set ofq faces that cover all the vertices. Then our algorithm runs inO(log² n) time and employsO(nq+M(q)) processors (whereM(t) is the number of processors required to multiply twot×t matrices inO(logt) time). Let us note here that wheneverq<n then our processor bound is better than the best previous one (M(n)).O(log² n) time,n-processor algorithms are presented for various subproblems, including that of generating all pairs shortest path information in a directedouterplanar graph. Our work is based on the fundamental hammock-decomposition technique of G. Frederickson. We achieve this decomposition inO(logn log*n) parallel time by usingO(n) processors. The hammock-decomposition seems to be a fundamental operation that may help in improving efficiency of many parallel (and sequential) graph algorithms.This work was partially supported by the EEC ESPRIT Basic Research Action No. 3075 (ALCOM) and by the Ministry of Industry, Energy and Technology of Greece.     

Development of an optimised, standard-compliant procedure to calculate sound transmission loss: design of transmission rooms

A numerical procedure to estimate the transmission loss of sound insulating structures is proposed based upon the technology of acoustic measurements and standards. A virtual laboratory (VL), namely, a numerical representation of a real laboratory consisting of two reverberation rooms meeting certain sound field quality criteria is designed. VL is to be used for the numerical simulation of standardised measurements under predefined, controlled, acoustic conditions. In this paper, the design and optimisation of VL is investigated. The geometry of the transmission rooms is designed following first principles, in order for diffuse field conditions and sufficiently smooth primary mode distribution in the low frequency to be achieved. A finite element-based optimisation procedure, introduced by the author in previous work, is extended to arbitrarily shaped rooms. It is used to predict the appropriate local geometric modifications so as for improved mode distribution and smoother sound pressure fluctuations of the transmission rooms in the low-frequency range to be achieved and low-frequency measurement reproducibility and accuracy to be increased. Steady-state acoustic response analysis is performed in order to quantify the acoustic field quality of the virtual transmission rooms in the frequency range of measurements. A method to calculate the total absorption, A, of the receiving room is introduced by simulation of the reverberation time measurement procedure using Transient acoustic response analysis. The acoustic performance of VL is overall considered and is shown to meet in a sufficient degree, relative laboratory measurement standards in the frequency range of 100÷704 Hz.     

Cosmology with Gravitational Waves: A Review

Standard sirens have been the central paradigm in gravitational-wave cosmology so far. From the gravitational wave signature of compact star binaries, it is possible to measure the luminosity distance of the source directly, and if additional information on the source redshift is provided, a measurement of the cosmological expansion can be performed. This review article discusses several methodologies that have been proposed to use gravitational waves for cosmological studies. Methods that use only gravitational-wave signals and methods that use gravitational waves in conjunction with additional observations such as electromagnetic counterparts and galaxy catalogs will be discussed. The review also discusses the most recent results on gravitational-wave cosmology, starting from the binary neutron star merger GW170817 and its electromagnetic counterpart and finishing with the population of binary black holes, observed with the third Gravitational-wave Transient Catalog GWTC–3.