Complete characterization of the generation of a 2.8 ps pedestal-free optical pulse using a gain-switched laser and a compressing nonlinear amplifying loop mirror

2005 ◽  
Author(s):  
W. Chang
Keyword(s):  
Optical Pulse ◽  
Complete Characterization ◽  
Loop Mirror ◽  
Nonlinear Amplifying Loop Mirror

Simple method for the complete characterization of an optical pulse

1998 ◽  
Vol 23 (22) ◽  
pp. 1784 ◽  
Author(s):  
Jean Debeau ◽  
Benoît Kowalski ◽  
Rémi Boittin
Keyword(s):  
Optical Pulse ◽  
Complete Characterization ◽  
Simple Method

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.

Sign in / Sign up

Export Citation Format

Share Document