| | SLO | ENG | Piškotki in zasebnost

Večja pisava | Manjša pisava

Iskanje po katalogu digitalne knjižnice Pomoč

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 10 / 19
Na začetekNa prejšnjo stran12Na naslednjo stranNa konec
1.
2.
3.
4.
5.
6.
7.
RAZVOJ VPENJALNE PRIPRAVE VARILNEGA ROBOTA
Gorazd Pravdič, 2009, diplomsko delo

Opis: V diplomskem delu je predstavljena nova vpenjalna priprava varilnega robota. Diplomsko delo je praktičen projekt. Z izbrano temo želim rešiti problem vpenjanja pri varjenju stebrov v podjetju Arcont. V podjetju varijo še na stari vpenjalni pripravi, pri kateri prihaja do veliko težav. Težave so pri vpenjanju, praktičnosti, ergonomiji, predvsem pa pri doseganju toleranc. Problemi pri tolerancah nastajajo zaradi slabih toleranc polizdelkov. Bistvo diplomske naloge je izvedba takšne vpenjalne priprave, pri kateri se profili ne poravnavajo enostransko, ampak se centrirajo na sredini. Napake se porazdelijo na obe strani, zaradi tega končni izdelek ostane v mejah toleranc. Model vpenjalne priprave je razvit s pomočjo modelirnika Solid Edge V19. Narejena je celotna tehnična dokumentacija.
Ključne besede: varjenje, centriranje, vpenjalna priprava, varilni robot, vpenjalo, mehanizem, Solid Edge
Objavljeno: 03.04.2009; Ogledov: 2548; Prenosov: 416
.pdf Celotno besedilo (11,33 MB)

8.
Combined edge detection using wavelet transform and signal registration
Dušan Heric, Damjan Zazula, 2006, izvirni znanstveni članek

Opis: This paper presents a novel edge detection algorithm, using Haar wavelet transform and signal registration. The proposed algorithm has two stages: (a) adaptive edge detection with the maximum entropy thresholding technique on time-scale plane and (b) edge linkage into a con tour line with signal registration in order to c1ose edge discontinuities and calculate a confidence index for contour linkages. This index measures the level of confidence in the linkage of two adjacent points in the con tour structure. Experimenting with synthetic images, we found out the lower level of confidence can be set to approximately e-2. The method was tested on 200 synthetic images at different signal-to-noise ratios (SNRs) and II clinical images. We assessed its reliability, accuracy and robustness using the mean absolute distance (MAD) metric and our confidence index. The results for MAD on synthetic images yield the mean of 0.7 points and standard deviation (std) of 0.14, while the mean confidence level is 0.48 with std of 0.19 (the values are averaged over SNRs from 3 to 50 dB each in 20 Monte-Carlo runs). Our assessment on clinical images, where the references were expert's annotations, give MAD equal1.36:1:: 0.36 (mean :1:: std) and confidence level equal 0.67 :1:: 0.25 (mean :1:: std).
Ključne besede: edge model, edge detection, wavelet transform, signal registration
Objavljeno: 31.05.2012; Ogledov: 1154; Prenosov: 35
URL Povezava na celotno besedilo

9.
Annihilation of defects in liquid crystals
Milan Svetec, Milan Ambrožič, Samo Kralj, 2007, objavljeni znanstveni prispevek na konferenci

Opis: The annihilation of defect is studied theoretically in liquid crystals (LCs). We consider the annihilation of point disclinations in nematic and line edge dislocations in smectic A LC phase, respectively. We stres s qualitative similarities in these processes. The whole annihilation regime is taken into account, consisting of the pre-collision, collision, and post-collision stage.
Ključne besede: physics, liquid crystals, annihilation, defects, point defects, point disclinations, edge dislocations
Objavljeno: 07.06.2012; Ogledov: 668; Prenosov: 31
URL Povezava na celotno besedilo

10.
Edge, vertex and mixed fault-diameters
Iztok Banič, Rija Erveš, Janez Žerovnik, 2008

Opis: Let ▫${mathcal{D}}^E_q(G)$▫ denote the diameter of a graph ▫$G$▫ after deleting any of its ▫$q$▫ edges, and ▫${mathcal{D}}^V_p(G)$▫ denote the diameter of ▫$G$▫ after deleting any of its ▫$p$▫ vertices. We prove that ▫${mathcal{D}}^E_a(G) le {mathcal{D}}^V_a(G) + 1$▫ a for all meaningful ▫$a$▫. We also define mixed fault diameter ▫${mathcal{D}}^M_{(p,q)}(G)$▫, where ▫$p$▫ vertices and ▫$q$▫ edges are deleted at the same time. We prove that for ▫$0 < l le a$▫, ▫${mathcal{D}}^E_a(G) le {mathcal{D}}^M_{(a-l,l)}(G) le {mathcal{D}}^V_a(G) + 1$▫, and give some examples.
Ključne besede: matematika, teorija grafov, povezanost, mathematics, (vertex)-connectivity, edge-connectivity, (vertex) fault-diameter, edge-fault diameter, interconnection network
Objavljeno: 10.07.2015; Ogledov: 283; Prenosov: 32
URL Povezava na celotno besedilo

Iskanje izvedeno v 0.18 sek.
Na vrh
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici