نتایج جستجو برای: metallurgical characterization

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

2005
C W Corti

When a metallic powder is subjected to a suffkiently high pressure a certain amount of adhesion takes place between individual particles. If this compact i s then sintered the bond is improved by diflusion and intergranular grain growth. The earliest known platinum objects were fabricated by such a powder metallurgical process, and when European scientists first addressed the problem of manufac...

Journal: :Brazilian journal of otorhinolaryngology 2012
Aurea Oliveira Canha Ottoni Anadergh Barbosa-Branco Marlene Escher Boger Sérgio Luiz Garavelli

UNLABELLED Noise level can be quantified and qualified based on sound characteristics such as intensity, type of spectrum, duration and distribution of the noise exposure during one's working hours. OBJECTIVE To assess noise spectrum and the audiometric configuration of workers. MATERIALS AND METHODS Contemporary cross-sectional cohort carried out in the Federal District - Brazil. We did an...

Journal: :Dental materials journal 2003
Sonosuke Fujioka Kazutoshi Kakimoto Taro Inoue Joji Okazaki Yutaka Komasa

It is not known for certain that dental stone components influence titanium welding. In this study, we investigated metallurgical problems caused by laser welding on dental stones using wrought commercial pure (CP) titanium. A pulsed Nd:YAG laser irradiated a number of specimens' surfaces which were fixed on either a dental hard stone or a titanium plate. The metallurgical properties of the wel...

2004
Yuh-Sheng Jean Ching-Yuan Wu

AbstructA new extraction algorithm for the metallurgical channel length of conventional and LDD MOSFET’s is presented, which is based on the well-known resistance method with performing a special technique to eliminate the uncertainty of the channel length as well as to reduce the influence of the parasitic source/drain resistance on threshold-voltage determination. l n particular, the metallur...

2015
Jing Wang Yongqi Fu Zongwei Xu Fengzhou Fang

Many factors influence the near-field visualization of plasmonic structures that are based on perforated elliptical slits. Here, characterization errors are experimentally analyzed in detail from both fabrication and measurement points of view. Some issues such as geometrical parameter, probe-sample surface interaction, misalignment, stigmation, and internal stress, have influence on the final ...

Journal: :Discrete Mathematics 1989
Douglas R. Woodall

For various graph-theoretic properties P that impose upper bounds on the minimum degree or the size of a neighbourhood set, we characterize the class %(P’) (%((P’)) of graphs G such that G and all its subgraphs (subcontractions) have property P. For example, if P is “6 <xn” (6 = minimum degree, n = number of vertices, 0 <X < 1) then S(P’) = F(K,+,), the class of graphs that do not have K,,, as ...

Journal: :Order 2003
Reinhard Diestel Oleg Pikhurko

We study which infinite posets have simple cofinal subsets such as chains, or decompose canonically into such subsets. The posets of countable cofinality admitting such a decomposition are characterized by a forbidden substructure; the corresponding problem for uncountable cofinality remains open.

Journal: :CoRR 2009
Craig Weidert

In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered graph as a subgraph. In particular, we take a step toward confirming a conjecture of Pach and Tardos [12] regarding the number of edges allowed when the forbid...

Journal: :Discrete Applied Mathematics 2016
Flavia Bonomo Luciano N. Grippo Martin Milanic Martín Darío Safe

Clique-width is a graph parameter with many algorithmic applications. For a positive integer k, the k-th power of a graph G is the graph with the same vertex set as G, in which two distinct vertices are adjacent if and only if they are at distance at most k in G. Many graph algorithmic problems can be expressed in terms of graph powers. We initiate the study of graph classes of power-bounded cl...

Journal: :Discrete Mathematics 2009
Andrei V. Gagarin Wendy J. Myrvold John Chambers

We prove a precise characterization of toroidal graphs with no K3,3-subdivisions in terms of forbidden minors and subdivisions. The corresponding lists of four forbidden minors and eleven forbidden subdivisions are shown.

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

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