A respiratory monitoring system based on a quartz crystal microbalance (QCM) sensor with a functional film was designed and investigated. Porphyrins 5,10,15,20-tetrakis-(4-sulfophenyl)-21H,23H-porphine (TSPP) and 5,10,15,20-tetrakis-(4-sulfophenyl)-21H, 23H-porphine manganese (III) chloride (MnTSPP) used as sensitive elements were assembled with a poly(diallyldimethyl ammonium chloride) (PDDA)....

Given a graph G and degree bound B on its nodes, the bounded-degree minimum spanning tree (BDMST) problem is to find a minimum cost spanning tree among the spanning trees with maximum degree B. This bi-criteria optimization problem generalizes several combinatorial problems, including the Traveling Salesman Path Problem (TSPP). An (α, f(B))-approximation algorithm for the BDMST problem produces...

The conjecture that the orbit-counting generating function for totally symmetric plane partitions can be written as an explicit product-formula, has been stated independently by George Andrews and David Robbins around 1983. We present a proof of this long-standing conjecture.

The principal focus of this paper is to study carrier pricing decisions for a new type of vehicle routing problems defined in a competitive and dynamic environment. This paper introduces the Vehicle Routing Problem in a Competitive Environment (VRPCE), as an extension of the Traveling Salesman Problem with Profits (TSPP) to a dynamic competitive auction environment. In the VRPCE, the carrier mu...

The conjecture that the orbit-counting generating function for totally symmetric plane partitions can be written as an explicit product-formula, has been stated independently by George Andrews and Dave Robbins around 1983. We present a proof of this long-standing conjecture.

In the historic conference Combinatoire Énumérative [6] wonderfully organized by Gilbert Labelle and Pierre Leroux there were many stimulating lectures, including a very interesting one by Pierre Leroux himself, who talked about his joint work with Xavier Viennot [7], on solving differential equations combinatorially! During the problem session of that very same colloque, chaired by Pierre Lero...

In the historic conference Combinatoire Énumérative [LL] wonderfully organized by Gilbert Labelle and Pierre Leroux there were many stimulating lectures, including a very interesting one by Pierre Leroux himself, who talked about his joint work with Xavier Viennot [LV], on solving differential equations combinatorially! During the problem session of that very same colloque, chaired by Pierre Le...