Dynamic pricing and scheduling in a multi-class single-server queueing system

This paper investigates an optimal sequencing and dynamic pricing problem for a two-class queueing system. Using a Markov Decision Process based model, we obtain structural characterizations of optimal policies. In particular, it is shown that the optimal pricing policy depends on the entire queue length vector but some monotonicity results prevail as the composition of this vector changes. A numerical study finds that static pricing policies may have significant suboptimality but simple dynamic pricing policies perform well in most situations.     

On co-ordinated quasi-convex functions

A function f: I → ?, where I ? ? is an interval, is said to be a convex function on I if $$f(tx + (1 - t)y) \le tf(x) + (1 - t)f(y)$$ holds for all x, y ∈ I and t ∈ [0, 1]. There are several papers in the literature which discuss properties of convexity and contain integral inequalities. Furthermore, new classes of convex functions have been introduced in order to generalize the results and to obtain new estimations. We define some new classes of convex functions that we name quasi-convex, Jensenconvex, Wright-convex, Jensen-quasi-convex and Wright-quasi-convex functions on the coordinates. We also prove some inequalities of Hadamard-type as Dragomir’s results in Theorem 5, but now for Jensen-quasi-convex and Wright-quasi-convex functions. Finally, we give some inclusions which clarify the relationship between these new classes of functions.     

Impact of Multi-Component Surrogates on the Performances,Pollutants, and Exergy of IC Engines

Even though there is a pressing interest in clean energy sources, compression ignition (CI) engines, also called diesel engines, will remain of great importance for transportation sectors as well as for power generation in stationary applications in the foreseeable future. In order to promote applications dealing with complex diesel alternative fuels by facilitating their integration in numerical simulation, this paper targets three objectives. First, generate novel diesel fuel surrogates with more than one component. Here, five surrogates are generated using an advanced chemistry solver and are compared against three mechanisms from the literature. Second, validate the suggested reaction mechanisms (RMs) with experimental data. For this purpose, an engine configuration, which features a reacting spray flow evolving in a direct-injection (DI), single-cylinder, and four-stroke motor, is used. The RNG k-Epsilon coupled to power-law combustion models is applied to describe the complex in-cylinder turbulent reacting flow, while the hybrid Eulerian-Lagrangian Kelvin Helmholtz-Rayleigh Taylor (KH-RT) spray model is employed to capture the spray breakup. Third, highlight the impact of these surrogate fuels on the combustion properties along with the exergy of the engine. The results include distribution of temperature, pressure, heat release rate (HRR), vapor penetration length, and exergy efficiency. The effect of the surrogates on pollutant formation (NOX, CO, CO2) is also highlighted. The fifth surrogate showed 47% exergy efficiency. The fourth surrogate agreed well with the maximum experimental pressure, which equaled 85 Mpa. The first, second, and third surrogates registered 400, 316, and 276 g/kg fuel, respectively, of the total CO mass fraction at the outlet. These quantities were relatively higher compared to the fourth and fifth RMs.     

Parallel Simulated Annealing Algorithms in Global Optimization

Global optimization involves the difficult task of the identification of global extremities of mathematical functions. Such problems are often encountered in practice in various fields, e.g., molecular biology, physics, industrial chemistry. In this work, we develop five different parallel Simulated Annealing (SA) algorithms and compare them on an extensive test bed used previously for the assessment of various solution approaches in global optimization. The parallel SA algorithms consist of various categories: the asynchronous approach where no information is exchanged among parallel runs and the synchronous approaches where solutions are exchanged using genetic operators, or where solutions are transmitted only occasionally, or where highly coupled synchronization is achieved at every iteration. One of these approaches, which occasionally applies partial information exchanges (controlled in terms of solution quality), provides particularly notable results for functions with vast search spaces of up to 400 dimensions. Previous attempts with other approaches, such as sequential SA, adaptive partitioning algorithms and clustering algorithms, to identify the global optima of these functions have failed without exception.     

C4- and D4-Modules via perspective direct summands

In this article, we study the C4- and D4-modules in terms of perspective direct summands, providing new characterizations and results. Endomorphism rings of C4-modules and extensions of right C4-rings are also investigated. Decompositions of C4-modules with restricted ACC on direct summands and D4-modules with restricted DCC on direct summands are obtained.     

The Hamilton-Waterloo Problem with 4-Cycles and a Single Factor of n-Cycles

A 2-factor in a graph G is a 2-regular spanning subgraph of G, and a 2-factorization of G is a decomposition of all the edges of G into edge-disjoint 2-factors. A ${\{C_{m}^{r}, C_{n}^{s}\}}$ -factorization of K _υ asks for a 2-factorization of K _υ , where r of the 2-factors consists of m-cycles, and s of the 2-factors consists of n-cycles. This is a case of the Hamilton-Waterloo problem with uniform cycle sizes m and n. If υ is even, then it is a decomposition of K _υ ? F where a 1-factor F is removed from K _υ . We present necessary and sufficient conditions for the existence of a ${\{C_{4}^{r}, C_{n}^{1}\}}$ -factorization of K _υ ? F.     

Edge searching weighted graphs

In traditional edge searching one tries to clean all of the edges in a graph employing the least number of searchers. It is assumed that each edge of the graph initially has a weight equal to one. In this paper we modify the problem and introduce the Weighted Edge Searching Problem by considering graphs with arbitrary positive integer weights assigned to its edges. We give bounds on the weighted search number in terms of related graph parameters including pathwidth. We characterize the graphs for which two searchers are sufficient to clear all edges. We show that for every weighted graph the minimum number of searchers needed for a not-necessarily-monotonic weighted edge search strategy is enough for a monotonic weighted edge search strategy, where each edge is cleaned only once. This result proves the NP-completeness of the problem.     

You cannot fight the pressure: Structural rearrangements of active pharmaceutical ingredients under magic angle spinning

Although solid-state nuclear magnetic resonance (NMR) is a versatile analytical tool to study polymorphs and phase transitions of pharmaceutical molecules and products, this work summarizes examples of spontaneous and unexpected (and unwanted) structural rearrangements and phase transitions (amorphous-to-crystalline and crystalline-to-crystalline) under magic angle spinning (MAS) conditions, some of them clearly being due to the pressure experienced by the samples. It is widely known that such changes can often be detected by X-ray powder diffraction (XRPD); here, the capability of solid-state NMR experiments with a special focus on ¹H-¹³C frequency-switched Lee–Goldburg heteronuclear correlation (FSLG HETCOR)/MAS NMR experiments to detect even subtle changes on a molecular level not observable by conventional 1D NMR experiments or XRPD is presented. Furthermore, it is shown that a polymorphic impurity combined with MAS can induce a crystalline-to-crystalline phase transition. This showcases that solid-state NMR is not always noninvasive and such changes upon MAS should be considered in particular when compounds are studied over longer time spans.     

The Effect of a Cationic Polyelectrolyte on the Forces between Two Cellulose Surfaces and between One Cellulose and One Mineral Surface

The effect of a cationic polyelectrolyte, PCMA, on the forces between two cellulose surfaces and between one cellulose surface and one mica surface has been studied using the interferometric surface force apparatus (SFA). The cellulose surfaces were prepared by Langmuir-Blodgett deposition of trimethylsilyl cellulose onto hydrophobized mica. Prior to measurements the surfaces were desilylated to obtain pure cellulose. Introduction of a cationic polyelectrolyte into the solution drastically changed the interactions between the cellulose layers. It was found that the cationic polyelectrolyte does adsorb onto the cellulose surface, although the adsorbed amount is low. The adsorbed layer is very thin, as expected at a low electrolyte concentration. Before the adsorption has reached equilibrium, when only some polyelectrolyte had adsorbed, the adhesion between the surfaces was high, and it was noted that the cellulose layer was damaged on separation. After a longer adsorption time an electrostatic repulsion and no adhesion were observed between the polyelectrolyte-coated cellulose surfaces. An electrostatic repulsion was observed between cellulose and mica. When cationic polyelectrolyte was introduced to the system it overcompensated the charges on both surfaces, and the range and magnitude of the double-layer force was higher than without polyelectrolyte. The relevance of the results to flocculation mechanism and efficiency in cellulose systems is discussed. Copyright 2000 Academic Press.