Optimal Control of an <Emphasis Type="Italic">M/E</Emphasis><Subscript><Emphasis Type="Italic">k</Emphasis></Subscript>/1 Queueing System with a Removable Service Station

This paper studies the optimal operation of an M/E _k /1 queueing system with a removable service station under steady-state conditions. Analytic closed-form solutions of the controllable M/E _k /1 queueing system are derived. This is a generalization of the controllable M/M/1, the ordinary M/E _k /1, and the ordinary M/M/1 queueing systems in the literature. We prove that the probability that the service station is busy in the steady-state is equal to the traffic intensity. Following the construction of the expected cost function per unit time, we determine the optimal operating policy at minimum cost.     

An Algorithm for the Economic Design of <Emphasis Type="Italic">np</Emphasis> Charts for a Multiplicity of Assignable Causes

Chiu, in 1976, studied the economic design of np charts for processes subject to a multiplicity of assignable causes. Chiu developed a two-step minimization procedure to obtain the three control variables, namely, the sampling interval, the sample size and the acceptance number. Although Chiu's two-step minimization procedure is simple, applicable and down to earth, it is rather inefficient and has some drawbacks. This paper presents an algorithm to overcome these drawbacks. The results and the execution times of all numerical examples show that the accuracy and the efficiency of the algorithm is reasonably good.     

A Heuristic Decomposition Algorithm for Scheduling Problems on Mixed Graphs

We consider a scheduling problem where a set of n jobs has to be processed on a set of m machines and arbitrary precedence constraints between operations are given. Moreover, for any two operations i and j values a _ij >0 and a _ji >0 may be given where a _ij is the minimal difference between the starting times of operations i and j when operation i is processed first. Often, the objective is to minimize the makespan but we consider also arbitrary regular criteria. Even the special cases of the classical job shop problem J//C_max belong to the set of NP-hard problems. Therefore, approximation or heuristic algorithms are necessary to handle large-dimension problems. Based on the mixed graph model we give a heuristic decomposition algorithm for such a problem, i.e. the initial problem is partitioned into subproblems that can be solved exactly or approximately with a small error bound. These subproblems are obtained by a relaxation of a subset of the set of undirected edges of the mixed graph. The subproblems are successively solved and a proportion of the results obtained for one subproblem is kept for further subproblem definitions. Numerical results of the algorithm presented here are given.     

Availability Analysis of Repairable <Emphasis Type="Italic">N</Emphasis>-Server <Emphasis Type="Italic">n</Emphasis><Subscript><Emphasis Type="Italic">i</Emphasis></Subscript>-Replicated Systems

We develop an exact closed-form expression for the steady-state availability of a repairable, N-server system in which the ith server contains n _i identical, reconfigurable, breakdown-prone units. Our approach, which follows from the Markov chain balance equations and the recursive properties of Hessenberg matrix determinants, is simpler than previously proposed matrix geometric approaches, and can readily be adapted to the availability analysis of more complicated structures. We illustrate this by computing the steady-state availability of a mixed parallel-serial gracefully degrading replicated system.     

Clumping Data in 2-Way Tables: A User-Orientated Perspective

Following a critique of existing algorithms, an algorithm is presented which will re-organize a 2-way data table to bring like rows together, and like columns together. Extensions of the method are described, and justified, to accommodate distances measured in modular arithmetic, and with bipolar columns/rows, as in repertory grid analysis. One value of the algorithms is that the user can see relationships in the tables without the data in the cells themselves ever having been transformed. Thus, users will continue to feel they own their data.     

Refining the Diffusion Approximation for the <Emphasis Type="Italic">GI</Emphasis><Superscript><Emphasis Type="Italic">x</Emphasis></Superscript><Emphasis Type="Italic">/G/c</Emphasis> Queue

This paper deals with the GI ^x /G/c queueing system in a steady state. We refine a diffusion approximation method incorporating the constraint of traffic conservation for general queueing systems. An approximate expression for the distribution of the number of customers is obtained. Numerical results are presented to show that the refined model provides improved performance.     

Long Duration Persistent Photocurrent in 3 nm Thin Doped Indium Oxide for Integrated Light Sensing and In-Sensor Neuromorphic Computation

Miniaturization and energy consumption by computational systems remain major challenges to address. Optoelectronics based synaptic and light sensing provide an exciting platform for neuromorphic processing and vision applications offering several advantages. It is highly desirable to achieve single-element image sensors that allow reception of information and execution of in-memory computing processes while maintaining memory for much longer durations without the need for frequent electrical or optical rehearsals. In this work, ultra-thin (<3 nm) doped indium oxide (In₂O₃) layers are engineered to demonstrate a monolithic two-terminal ultraviolet (UV) sensing and processing system with long optical state retention operating at 50 mV. This endows features of several conductance states within the persistent photocurrent window that are harnessed to show learning capabilities and significantly reduce the number of rehearsals. The atomically thin sheets are implemented as a focal plane array (FPA) for UV spectrum based proof-of-concept vision system capable of pattern recognition and memorization required for imaging and detection applications. This integrated light sensing and memory system is deployed to illustrate capabilities for real-time, in-sensor memorization, and recognition tasks. This study provides an important template to engineer miniaturized and low operating voltage neuromorphic platforms across the light spectrum based on application demand.     

Noble Metal Ion-Directed Assembly of 2D Materials for Heterostructured Catalysts and Metallic Micro-Texturing

Assembling 2D-material (2DM) nanosheets into micro- and macro-architectures with augmented functionalities requires effective strategies to overcome nanosheet restacking. Conventional assembly approaches involve external binders and/or functionalization, which inevitably sacrifice 2DM's nanoscale properties. Noble metal ions (NMI) are promising ionic crosslinkers, which can simultaneously assemble 2DM nanosheets and induce synergistic properties. Herein, a collection of NMI–2DM complexes are screened and categorized into two sub-groups. Based on the zeta potentials, two assembly approaches are developed to obtain 1) NMI-crosslinked 2DM hydrogels/aerogels for heterostructured catalysts and 2) NMI–2DM inks for templated synthesis. First, tetraammineplatinum(II) nitrate (TPtN) serves as an efficient ionic crosslinker to agglomerate various 2DM dispersions. By utilizing micro-textured assembly platforms, various TPtN–2DM hydrogels are fabricated in a scalable fashion. Afterward, these hydrogels are lyophilized and thermally reduced to synthesize Pt-decorated 2DM aerogels (Pt@2DM). The Pt@2DM heterostructures demonstrate high, substrate-dependent catalytic activities and promote different reaction pathways in the hydrogenation of 3-nitrostyrene. Second, PtCl₄ can be incorporated into 2DM dispersions at high NMI molarities to prepare a series of PtCl₄–2DM inks with high colloidal stability. By adopting the PtCl₄–graphene oxide ink, various Pt micro-structures with replicated topographies are synthesized with accurate control of grain sizes and porosities.