نتایج جستجو برای: sandwich generation females

تعداد نتایج: 484844  

Journal: :SIAM J. Discrete Math. 2007
Anne Berry Martin Charles Golumbic Marina Lipshteyn

A graph G = (V,E) is a chordal probe graph if its vertices can be partitioned into two sets, P (probes) and N (non-probes), where N is a stable set and such that G can be extended to a chordal graph by adding edges between non-probes. We give several characterizations of chordal probe graphs, first, in the case of a fixed given partition of the vertices into probes and non-probes, and second, i...

Journal: :Discrete Mathematics 2007
Michel Habib David Kelly Emmanuelle Lebhar Christophe Paul

A graph G s = (V , E s) is a sandwich for a pair of graphs G t = (V , E t) and G = (V , E) if E t ⊆ E s ⊆ E. A sandwich problem asks for the existence of a sandwich graph having an expected property. In a seminal paper, Golumbic et al. [Graph sandwich problems, J. Algorithms 19 (1995) 449–473] present many results on sub-families of perfect graphs. We are especially interested in comparability ...

2006
Harald Künemund

The burden placed on individuals aged 40 to 59 – especially on women – by competing demands from work and both older and younger family members is often addressed using the metaphor of the “sandwich generation“. Based on a systematization of the definitions used in the literature, empirical evidence on the frequency of such generational constellations and on their impact on the well-being of sa...

2012
Isao H. Inoue Akihito Sawa

Promising candidates for the next-generation memory devices have emerged one after another for the last decade. Ferroelectric random access memories (FeRAM), magnetoresistive random access memories (MRAM), phase change memories (PCM) are indeed at the dawn of the international development races. Along with those three fascinating memories, we focus here on probably the most seminal candidate of...

2011
Binu P. Thomas

Detection of debonds at sharply curved edges on sandwich structures is found difficult using conventional nondestructive testing (NDT) techniques. The advantages of digital holography and time average holographic interferometry were utilized to evolve a new approach to detect debonds on curved sandwich structures which is reported in this paper. Software developed for the high-speed recording, ...

2014
Balaji Srinivasan Yao Ping Steve Tung

This paper reports a multilayered, automated PDMS based microTAS for rapid, high-sensitivity and point-of-care insulin detection. Two generations of microTAS differing in their design complexity and insulin detection protocol were compared. The first generation microTAS includes one micropump, one micromixer and interdigitated electrodes to perform flow through impedance spectroscopy for insuli...

2016
Anushri Rananaware Mousumi Samanta Rajesh S. Bhosale Mohammad Al Kobaisi Biswajit Roy Varun Bheemireddy Sidhanath V. Bhosale Subhajit Bandyopadhyay Sheshanath V. Bhosale

The discovery of photoswitchable azobenzene-systems that undergo trans-to-cis photoisomerisation was a milestone in supramolecular chemistry. Such photoswitches have possible applications in data storage, stimuli responsive delivery systems, and molecular machines due to fast and selective switching. However, the light induced cis isomer of azobenzene is rather unstable and reverts thermally an...

2004
Jean Amiral Benedicte Adalbert Mariette Adam

Enzyme immunoassaysare very useful for the detectionof low concentrationsof coagulationproteinsand pathological markers in plasma. Analytes in the ng/mL range are measurable with good reproducibility with intraand interassay CVs of less than 5% to 10%. “Sandwich” methods have been developed for von Willebrand factor (plasma concentration about 8 .&.g/mL,Factor IX (5 p.g/mL),proteinC (4 g/mL), a...

Journal: :Annals OR 2011
Simone Dantas Celina M. H. de Figueiredo Martin Charles Golumbic Sulamita Klein Frédéric Maffray

The chain graph sandwich problem asks: Given a vertex set V , a mandatory edge set E1, and a larger edge set E2, is there a graph G= (V ,E) such that E1 ⊆ E ⊆ E2 with G being a chain graph (i.e., a 2K2-free bipartite graph)? We prove that the chain graph sandwich problem is NP-complete. This result stands in contrast to (1) the case where E1 is a connected graph, which has a linear-time solutio...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید