Results 41 to 50 of about 4,029,048 (318)

Design for environment by target life cycle costing

open access: yes, 2022
S.5Although many methodologies and tools have been developed to design environmentally friendly products, life cycle cost aspects have barely been included and likewise there has been no significant discussion on how to effectively combine different ...
Janz, D.   +2 more
core   +2 more sources

On The Total Irregularity Strength of Regular Graphs

open access: yesJournal of Mathematical and Fundamental Sciences, 2015
Let 𝐺 = (𝑉, 𝐸) be a graph. A total labeling 𝑓: 𝑉 ∪ 𝐸 → {1, 2, ⋯ , 𝑘} is called a totally irregular total 𝑘-labeling of 𝐺 if every two distinct vertices 𝑥 and 𝑦 in 𝑉 satisfy 𝑤𝑓(𝑥) ≠ 𝑤𝑓(𝑦) and every two distinct edges 𝑥1𝑥2 and 𝑦1𝑦2 in 𝐸 satisfy 𝑤𝑓(𝑥1𝑥2 ...
Rismawati Ramdani   +2 more
doaj   +1 more source

Subsynchronous oscillation detection via cycle-based feature extraction and weighted kernel extreme learning machine

open access: yesFrontiers in Energy Research, 2022
The fast and reliable detection of subsynchronous oscillations (SSOs) in wind farms is important for maintaining the stable operation of a power system.
Lei Wang   +5 more
doaj   +1 more source

Very high cycle fatigue of copper: Evolution, morphology and locations of surface slip markings [PDF]

open access: yes, 2014
The surfaces of commercially pure polycrystalline copper specimens subjected to interrupted 20 kHz fatigue tests in the very high cycle fatigue regime were investigated.
VALES, Fréderic   +4 more
core   +1 more source

К вопросу о двойном финале в Квартете № 13 Бетховена

open access: yesВестник музыкальной науки, 2014
Поздние квартеты Бетховена, в частности Большая фуга ор. 133, неоднократно привлекали внимание музыковедов. В статье они исследуются в аспекте исторической преемственности с принципами циклообразования, характерными для эпохи барокко.
Гончаренко, С. С.
doaj   +1 more source

On Local Antimagic Chromatic Number of Cycle-Related Join Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2021
An edge labeling of a connected graph G = (V, E) is said to be local antimagic if it is a bijection f : E → {1, . . ., |E|} such that for any pair of adjacent vertices x and y, f+(x) ≠ f+(y), where the induced vertex label f+(x) = Σf(e), with e ranging ...
Lau Gee-Choon, Shiu Wai-Chee, Ng Ho-Kuen
doaj   +1 more source

Design to life cycle by value-oriented life cycle costing

open access: yes, 2022
S.461-466Industrial products basically have to satisfy the customers' wants and needs as a basic input as well as technical and ecological requirements while providing maximum economic benefit throughout the life cycle.
Westkämper, Engelbert, Janz, Danina
core  

Carcinomas and Carcinoid Tumors of the Lungs and Bronchi in Children and Adolescents: The EXPeRT Recommendations

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Primary lung carcinomas and bronchial carcinoid tumors (BC) are very rare malignancies in childhood. While typical BC and mucoepidermoid carcinomas are mostly low‐grade, localized tumors with a more favorable prognosis than in adults, necessitating avoidance of overtreatment, adenocarcinomas of the lung are often diagnosed at advanced disease ...
Michael Abele   +19 more
wiley   +1 more source

Cycle factorizations of cycle products

open access: yesDiscrete Mathematics, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saad I. El-Zanati, Charles Vanden Eynden
openaire   +1 more source

Extending Cycles Locally to Hamilton Cycles [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2016
A Hamilton circle in an infinite graph is a homeomorphic copy of the  unit circle $S^1$ that contains all vertices and all ends precisely once. We prove that every connected, locally connected, locally finite, claw-free graph has such a Hamilton circle, extending a result of Oberly and Sumner to infinite graphs.
Matthias Hamann   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy