We report on a dual output all-PM fiber laser system running at 100 MHz repetition rate offering coherent broadband and narrowband pulses centered at 2.05 µm with a spectral FWHM bandwidth of 60 nm and 1.5 nm at up to 360 mW and 500 mW, respectively. The broadband pulses are compressed down to 135 fs. The multi-stage double-clad amplifier based on Tm/Ho codoping is seeded by a supercontinuum li...

We report a two-stage 2-μm Tm3+ fiber amplifier seeded by an acousto-optic modulator (AOM) modulated narrowbandwidth pulsed laser. Maximum output average power is over 50 W (slope efficiency of ∼58%) at 50 kHz repetition rate, providing record performance in nanosecond 2-μm all-fiber-based amplifiers. The maximum pulse energy and peak power are ∼1.0 mJ and 10 kW, respectively. The pulse width c...

the biologic width (bw) includes attached epithelial cells and connective tissue attachment complex being very important in the periodontal health during prosthetic treatments as invading this zone can cause bone resorption and gingival recession. the present study investigated biologic width values in the normal periodontium in anterior and posterior teeth. 30 patients that referred from resto...

Melia azedarach L. was introduced into Kurdistan region and planted as an ornamental tree at the nurseries, parks streets. This study investigated quality of wood 9 year old M. trees grown in Duhok province. Samples from five were taken breast height diameter; their studied terms morphological, physical anatomical properties. Results revealed that values morphological properties were: Heartwood...

We prove that for any fixed r ≥ 2, the tree-width of graphs not containing Kr as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of their rank-width. We also present refinements of our bounds for other graph classes such as Kr-minor free graphs and graphs of bounded genus.

Tree-width and clique-width are two important graph complexity measures that serve as parameters in many fixed-parameter tractable (FPT) algorithms. The same classes of sparse graphs, in particular of planar graphs and of graphs of bounded degree have bounded tree-width and bounded clique-width. We prove that, for sparse graphs, clique-width is polynomially bounded in terms of tree-width. For p...

PETR HLINĚNÝ1,2,*, SANG-IL OUM3,7, DETLEF SEESE4 AND GEORG GOTTLOB5,6 Faculty of Informatics, Masaryk University, Botanická 68a, 602 00 Brno, Czech Republic VŠB, Technical University of Ostrava, Ostrava, Czech Republic School of Mathematics, Georgia Institute of Technology, Atlanta, GA 30332-0160, USA Institute AIFB, University Karlsruhe (TH), D-76128 Karlsruhe, Germany Oxford University Comput...