A Stochastic Model for Service Contract

1998 ◽  
Vol 05 (01) ◽  
pp. 29-45 ◽  
Author(s):  
D. N. P. Murthy ◽  
E. Asgharizadeh
Keyword(s):  
Sensitivity Analysis ◽  
Simple Model ◽  
Single Agent ◽  
Optimal Strategies ◽  
Complete Characterization ◽  
Viable Option ◽  
Service Contract ◽  
External Agent ◽  
Maintenance Service

When it is not economical to carry out maintenance in-house, out-sourcing to an external agent is an alternate viable option. In this paper, we study a simple maintenance service contract involving a single agent (providing the maintenance service) and a single customer (owner of the equipment and recipient of the maintenance service). We develop a simple model to obtain the optimal strategies for both the customer and the agent. We give a complete characterization of the strategies along with some sensitivity analysis and discuss some extensions.

scholarly journals Firing Patterns in the Parallel Chip-Firing Game

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Ziv Scully ◽  
Tian-Yi Jiang ◽  
Yan Zhang
Keyword(s):  
Simple Model ◽  
Complete Characterization ◽  
Local Behavior ◽  
Emergent Complexity ◽  
Self Organized ◽  
Chip Firing ◽  
Self Organized Criticality ◽  
International Audience ◽  
Sandpile Group

International audience The $\textit{parallel chip-firing game}$ is an automaton on graphs in which vertices "fire'' chips to their neighbors. This simple model, analogous to sandpiles forming and collapsing, contains much emergent complexity and has connections to different areas of mathematics including self-organized criticality and the study of the sandpile group. In this work, we study $\textit{firing sequences}$, which describe each vertex's interaction with its neighbors in this game. Our main contribution is a complete characterization of the periodic firing sequences that can occur in a game, which have a surprisingly simple combinatorial description. We also obtain other results about local behavior of the game after introducing the concept of $\textit{motors}$. Le $\textit{parallel chip-firing game}$, c’est une automate sur les graphiques, dans lequel les sommets “tirent” des jetons à leurs voisins. Ce modèle simple, semblable aux tas de sable qui forment et s’affaissent, contient beaucoup de complexité émergente et a des connections avec différents domaines de mathématiques, incluant le $\textit{self-organized criticality}$ et l’étude du $\textit{sandpile group}$. Dans ce projet, on étudie les $\textit{firing sequences}$, qui décrivent les interactions de chaque sommet avec ses voisins dans le jeu. Notre contribution principale est une caractérisation complète des séquences de tir qui peuvent arriver dans une jeu, qui ont une description combinatoire assez simple. Nous obtenonsaussi d'autres résultats sur le conduite locale du jeu après l’introduction du concept des $\textit{motors}$.

scholarly journals Multiagent Evaluation Mechanisms

2020 ◽  
Vol 34 (02) ◽  
pp. 1774-1781 ◽  
Author(s):  
Tal Alon ◽  
Magdalen Dobson ◽  
Ariel Procaccia ◽  
Inbal Talgam-Cohen ◽  
Jamie Tucker-Foltz
Keyword(s):  
Computational Complexity ◽  
Single Agent ◽  
Complete Characterization ◽  
Agent Model ◽  
Multi Agent ◽  
Feature Values

We consider settings where agents are evaluated based on observed features, and assume they seek to achieve feature values that bring about good evaluations. Our goal is to craft evaluation mechanisms that incentivize the agents to invest effort in desirable actions; a notable application is the design of course grading schemes. Previous work has studied this problem in the case of a single agent. By contrast, we investigate the general, multi-agent model, and provide a complete characterization of its computational complexity.

Experimental Characterization of Mechanical Behavior of Cord-Rubber Composites

1982 ◽  
Vol 10 (1) ◽  
pp. 37-54 ◽  
Author(s):  
M. Kumar ◽  
C. W. Bert
Keyword(s):  
Response Characteristic ◽  
Cord Compression ◽  
Complete Characterization ◽  
Strain Response ◽  
Strain Gages ◽  
Experimental Characterization ◽  
Rubber Composites ◽  
Stress Strain ◽  
Strain Data

Abstract Unidirectional cord-rubber specimens in the form of tensile coupons and sandwich beams were used. Using specimens with the cords oriented at 0°, 45°, and 90° to the loading direction and appropriate data reduction, we were able to obtain complete characterization for the in-plane stress-strain response of single-ply, unidirectional cord-rubber composites. All strains were measured by means of liquid mercury strain gages, for which the nonlinear strain response characteristic was obtained by calibration. Stress-strain data were obtained for the cases of both cord tension and cord compression. Materials investigated were aramid-rubber, polyester-rubber, and steel-rubber.

Characterization of CMOS Structures (0.6 µm process) Submitted to HBM and COM ESD Stress Tests

1997 ◽  
Author(s):  
G. Meneghesso ◽  
E. Zanoni ◽  
P. Colombo ◽  
M. Brambilla ◽  
R. Annunziata ◽  
...  
Keyword(s):  
Electron Microscopy ◽  
Electrostatic Discharge ◽  
Stress Test ◽  
Complete Characterization ◽  
Stress Tests ◽  
Test Procedures ◽  
Emission Microscopy ◽  
Fast Rise ◽  
Scanning Electron

Abstract In this work, we present new results concerning electrostatic discharge (ESD) robustness of 0.6 μm CMOS structures. Devices have been tested according to both HBM and socketed CDM (sCDM) ESD test procedures. Test structures have been submitted to a complete characterization consisting in: 1) measurement of the tum-on time of the protection structures submitted to pulses with very fast rise times; 2) ESD stress test with the HBM and sCDM models; 3) failure analysis based on emission microscopy (EMMI) and Scanning Electron Microscopy (SEM).

scholarly journals Complete characterization of spin chains with two Ising symmetries

2019 ◽  
Vol 125 (1) ◽  
pp. 10008 ◽  
Author(s):  
Bat-el Friedman ◽  
Atanu Rajak ◽  
Emanuele G. Dalla Torre
Keyword(s):  
Complete Characterization ◽  
Spin Chains

scholarly journals On the star forest polytope for trees and cycles

2019 ◽  
Vol 53 (5) ◽  
pp. 1763-1773
Author(s):  
Meziane Aider ◽  
Lamia Aoudia ◽  
Mourad Baïou ◽  
A. Ridha Mahjoub ◽  
Viet Hung Nguyen
Keyword(s):  
Undirected Graph ◽  
Dominating Set ◽  
Discrete Math ◽  
Complete Characterization ◽  
Facial Structure ◽  
Maximum Weight ◽  
Single Node ◽  
End Node ◽  
Vertex Disjoint

Let G = (V, E) be an undirected graph where the edges in E have non-negative weights. A star in G is either a single node of G or a subgraph of G where all the edges share one common end-node. A star forest is a collection of vertex-disjoint stars in G. The weight of a star forest is the sum of the weights of its edges. This paper deals with the problem of finding a Maximum Weight Spanning Star Forest (MWSFP) in G. This problem is NP-hard but can be solved in polynomial time when G is a cactus [Nguyen, Discrete Math. Algorithms App. 7 (2015) 1550018]. In this paper, we present a polyhedral investigation of the MWSFP. More precisely, we study the facial structure of the star forest polytope, denoted by SFP(G), which is the convex hull of the incidence vectors of the star forests of G. First, we prove several basic properties of SFP(G) and propose an integer programming formulation for MWSFP. Then, we give a class of facet-defining inequalities, called M-tree inequalities, for SFP(G). We show that for the case when G is a tree, the M-tree and the nonnegativity inequalities give a complete characterization of SFP(G). Finally, based on the description of the dominating set polytope on cycles given by Bouchakour et al. [Eur. J. Combin. 29 (2008) 652–661], we give a complete linear description of SFP(G) when G is a cycle.

scholarly journals Protein complex formation in methionine chain-elongation and leucine biosynthesis

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Li-Qun Chen ◽  
Shweta Chhajed ◽  
Tong Zhang ◽  
Joseph M. Collins ◽  
Qiuying Pang ◽  
...  
Keyword(s):  
Protein Complexes ◽  
Complete Characterization ◽  
Bimolecular Fluorescence Complementation ◽  
Chain Elongation ◽  
Substrate Channeling ◽  
Leucine Biosynthesis ◽  
Protein Complex Formation ◽  
Genes Encoding ◽  
Isopropylmalate Dehydrogenase

AbstractDuring the past two decades, glucosinolate (GLS) metabolic pathways have been under extensive studies because of the importance of the specialized metabolites in plant defense against herbivores and pathogens. The studies have led to a nearly complete characterization of biosynthetic genes in the reference plant Arabidopsis thaliana. Before methionine incorporation into the core structure of aliphatic GLS, it undergoes chain-elongation through an iterative three-step process recruited from leucine biosynthesis. Although enzymes catalyzing each step of the reaction have been characterized, the regulatory mode is largely unknown. In this study, using three independent approaches, yeast two-hybrid (Y2H), coimmunoprecipitation (Co-IP) and bimolecular fluorescence complementation (BiFC), we uncovered the presence of protein complexes consisting of isopropylmalate isomerase (IPMI) and isopropylmalate dehydrogenase (IPMDH). In addition, simultaneous decreases in both IPMI and IPMDH activities in a leuc:ipmdh1 double mutants resulted in aggregated changes of GLS profiles compared to either leuc or ipmdh1 single mutants. Although the biological importance of the formation of IPMI and IPMDH protein complexes has not been documented in any organisms, these complexes may represent a new regulatory mechanism of substrate channeling in GLS and/or leucine biosynthesis. Since genes encoding the two enzymes are widely distributed in eukaryotic and prokaryotic genomes, such complexes may have universal significance in the regulation of leucine biosynthesis.

scholarly journals Topological Approach to Mathematical Programs with Switching Constraints

2021 ◽  
Author(s):  
Vladimir Shikhman
Keyword(s):  
Stationary Point ◽  
Mountain Pass Theorem ◽  
Strong Stability ◽  
Complete Characterization ◽  
Stationary Points ◽  
Mathematical Programs ◽  
Linear Independence Constraint Qualification ◽  
Point Set ◽  
Stationary Level

AbstractWe study mathematical programs with switching constraints (for short, MPSC) from the topological perspective. Two basic theorems from Morse theory are proved. Outside the W-stationary point set, continuous deformation of lower level sets can be performed. However, when passing a W-stationary level, the topology of the lower level set changes via the attachment of a w-dimensional cell. The dimension w equals the W-index of the nondegenerate W-stationary point. The W-index depends on both the number of negative eigenvalues of the restricted Lagrangian’s Hessian and the number of bi-active switching constraints. As a consequence, we show the mountain pass theorem for MPSC. Additionally, we address the question if the assumption on the nondegeneracy of W-stationary points is too restrictive in the context of MPSC. It turns out that all W-stationary points are generically nondegenerate. Besides, we examine the gap between nondegeneracy and strong stability of W-stationary points. A complete characterization of strong stability for W-stationary points by means of first and second order information of the MPSC defining functions under linear independence constraint qualification is provided. In particular, no bi-active Lagrange multipliers of a strongly stable W-stationary point can vanish.

Sign in / Sign up

Export Citation Format

Share Document