| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Search the digital library catalog Help

Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 9 / 9
First pagePrevious page1Next pageLast page
1.
VIZUALIZACIJA IN DIGITALNI TISK DEKORATIVNIH IZDELKOV ZA DOM
Tina Žnider, 2009, undergraduate thesis

Abstract: Diplomsko delo obravnava primerjavo računalniško izrisanih, virtualno predstavljenih in s tehniko digitalnega tiska realno izdelanih dekorativnih izdelkov za dom. Predstavljeni so računalniško podprti sistemi za konstrukcijo in oblikovanje ter sistemi za simulacijo in vizualizacijo izdelkov. V diplomskem delu sem z računalniško podprtimi sistemi za oblikovanje in simulacijo izdelala dekorativne izdelke za dom — prt, nadprt in dva pogrinjka ter jih tudi sešila. V rezultatih dela sem podala vizualno primerjavo med virtualnim prikazom dekorativnih izdelkov in realnim prikazom izdelkov v realnem prostoru — kuhinji.
Keywords: računalniško podprto oblikovanje, simulacija tekstilnih form, digitalni tisk, tekstilije
Published: 15.10.2009; Views: 1997; Downloads: 215
.pdf Full text (8,00 MB)

2.
The method of recognition of forms when trying to select street direction
Štefan Novak, Darja Topolšek, 2009, original scientific article

Abstract: The methods concerned together with their characteristics of technical advantage exploitation affects the realization times and costs of the transport. The proper selection of a street would greatly affect those costs of transport that can be reduced as well as the speeds of the realization which could be accelerated. This article shows one of the methods of recognition of the forms with a test on a street type selection example. The aim of this article is showing the possibilities of the form recognition usage in the traffic and transport system. This sort of selection and classification is needed when the necessity to quickly decide about the direction of movement, particularly in special circumstances, arise.
Keywords: road, traffic safety, street selection, recognition of form
Published: 05.06.2012; Views: 837; Downloads: 18
URL Link to full text

3.
Non-linear commutativity preserving maps on symetric matrices
Ajda Fošner, 2007, original scientific article

Abstract: We study bijective maps on the set of all symmetric matrices in ▫$M_n(Cc), n ge 3$▫ that preserve commutativity in both directions.
Keywords: mathematics, linear algebra, symmetric matrix, orthogonal matrix, commutativity preserving map, symmetric Jordan canonical form
Published: 07.06.2012; Views: 931; Downloads: 15
URL Link to full text

4.
THE COUNTABILITY OF ENGLISH NOUNS: CATEGORY SHIFTS
Tanja Zelenik, 2013, undergraduate thesis

Abstract: The noun is one of the most important sentence elements in grammar. Accordingly, it plays an important role. It occurs in various forms, but generally, we can say that in English language the nouns may be divided into a limited number of categories, which differ according to their meaning and grammatical use. These categories, and more specifically, the countability of English nouns based on the examples of the noun 'work' and the noun 'time', are the focus of the graduation thesis. Moreover, the aim of the thesis was to research the countability of these two nouns. In particular, the emphasis was on the point when or in which cases are the nouns uncountable and when countable; what impacts on the occurance of the shift from uncountable to countable (and vise versa); the grammatical changes and changes in meaning that follow and, nevertheless, which countability form is their basic form. After the presentation of the noun as a sentence article in the theoretical part, the noun is in empirical part analyzed based on the examples of the noun 'work' and 'time' with the help of Corpus of Contemporary American English - COCA. Based on several examples of the use of nouns 'work' and 'time', which were also obtained from the corpus, it is also possible to conclude in which circumstances are the nouns used most frequently as singular nouns or in which as plural.
Keywords: noun, English noun, types of nouns, countability, singular countable form, singular uncountable form, plural countable form, plural uncountable form
Published: 04.06.2013; Views: 905; Downloads: 54
.pdf Full text (534,07 KB)

5.
SPRICHWÖRTER IM SPRACHGEBRAUCH NEUER MEDIEN
Marko Štandeker, 2013, undergraduate thesis

Abstract: Die meisten Sprichwörter existieren schon seit enormer Zeit. Diese Vermitteln eine Lebensweisheit, die historisch geprägt ist. Es ist bekannt, dass Phraseologismen bzw. Sprichwörter sehr oft in der publizistischen Sprache vorkommen, deswegen ist in meiner Diplomarbeit die Rede über digitale Medien, wo die Zugänglichkeit zu den Artikeln fast unbegrenzt ist. In der vorliegenden Diplomarbeit habe ich mich auf einen kürzen theoretischen Teil konzentriert, welcher die grundlegende Begriffe der Phraseologie, die für Sprichwörter relevant sind, erklärt. Der zentrale Gegenstand meiner Analyse sind Sprichwörter und deren Modifikationen. Unter Modifikation ist der kreative Sprachgebrauch zu verstehen, und zwar mit dem Effekt, die Nennform des Sprichwortes so zu verändern, dass sie sich der beschriebenen Thematik anpasst. Die Absicht bzw. der Zweck der Diplomarbeit war die Analyse der ausgesuchten Sprichwörter, und zwar in wie vielen Beispielen die Nennform und in wie vielen die modifizierte Form des Sprichwortes vorkommt. Das Ziel war es herauszufinden, ob Sprichwörter in der Nennform vorkommen, oder ob diese von Autoren entsprechend modifiziert werden, um sich dem Text besser anzupassen. Die Platzierung der Sprichwörter spielte auch eine Rolle, und zwar interessierte mich, wo sie am häufigsten vorkommen werden. Ist das der Textanfang, Textmitte oder das Textende. Im Verlauf der Diplomarbeit wurden die deskriptive und die komparative Methode, die Methode der Sammlung und Analyse benutzt. Die Vermutungen bzw. Hypothesen, die vor der Analyse aufgestellt wurden, wurden nur zum Teil bestätigt. Dass Sprichwörter eher in der modifizierten Form als in der Nennform vorkommen, wurde nicht bestätigt. Hypothese, dass Sprichwörter oft in Schlagzeilen präsent sind, wurde als solche bestätigt.
Keywords: Phraseologismus, Nennform, Modifikation, modifizierte Form, Form, Sprichwört.
Published: 19.09.2013; Views: 1000; Downloads: 80
.pdf Full text (642,50 KB)

6.
Stern polynomials
Sandi Klavžar, Uroš Milutinović, Ciril Petr, 2005

Abstract: Sternovi polinomi ▫$B_k(t)$▫, ▫$k ge 0$▫, ▫$t in RR$▫, so vpeljani na naslednji način: ▫$B_0(t) = 0$▫, ▫$B_1(t) = 1$▫, ▫$B_{2n}(t) = tB_n(t)$▫ in ▫$B_{2n+1}(t) = B_{n+1}(t) + B_n(t)$▫. Pokazano je, da ima ▫$B_n(t)$▫ enostavno eksplicitno reprezentacijo s hiperebinarnimi reprezentacijami ▫$n-1$▫ in da je odvod ▫$B'_{2n-1}(0)$▫ enak številu enic v standardni Grayjevi kodi za ▫$n-1$▫. Dokazano je tudi, da je stopnja polinoma ▫$B_n(t)$▫ enaka razliki med dolžino in težo nesosednje predstavitve števila ▫$n$▫.
Keywords: matematika, Sternovo (dvoatomsko) zaporedje, Sternovi polinomi, hiperbinarna reprezentacija, standardna Grayjeva koda, nesosednja predstavitev, mathematics, Stern (diatomic) sequence, Stern polynomials, hyperbinary representation, standard Gray code, non-adjacent form
Published: 10.07.2015; Views: 625; Downloads: 15
URL Link to full text

7.
Trace-positive polynomials, sums of hermitian squares and the tracial moment problem
Sabine Burgdorf, 2011, doctoral dissertation

Abstract: A polynomial ▫$f$▫ in non-commuting variables is trace-positive if the trace of ▫$f(underline{A})$▫ is positive for all tuples ▫$underline{A}$▫ of symmetric matrices of the same size. The investigation of trace-positive polynomials and of the question of when they can be written as a sum of hermitian squares and commutators of polynomials are motivated by their connection to two famous conjectures: The BMV conjecture from statistical quantum mechanics and the embedding conjecture of Alain Connes concerning von Neumann algebras. First, results on the question of when a trace-positive polynomial in two non-commuting variables can be written as a sum of hermitian squares and commutators are presented. For instance, any bivariate trace-positive polynomial of degree at most four has such a representation, whereas this is false in general if the degree is at least six. This is in perfect analogy to Hilbert's results from the commutative context. Further, a partial answer to the Lieb-Seiringer formulation of the BMV conjecture is given by presenting some concrete representations of the polynomials ▫$S_{m,4}(X^2; Y^2)$▫ as a sum of hermitian squares and commutators. The second part of this work deals with the tracial moment problem. That is, how can one describe sequences of real numbers that are given by tracial moments of a probability measure on symmetric matrices of a fixed size. The truncated tracial moment problem, where one considers only finite sequences, as well as the tracial analog of the ▫$K$▫-moment problem are also investigated. Several results from the classical moment problem in Functional Analysis can be transferred to this context. For instance, a tracial analog of Haviland's theorem holds: A traciallinear functional ▫$L$▫ is given by the tracial moments of a positive Borel measure on symmetric matrices of a fixed size s if and only if ▫$L$▫ takes only positive values on all polynomials which are trace-positive on all tuples of symmetric ▫$s times s$▫-matrices. This result uses tracial versions of the results of Fialkow and Nie on positive extensions of truncated sequences. Further, tracial analogs of results of Stochel and of Bayer and Teichmann are given. Defining a tracial Hankel matrix in analogy to the Hankel matrix in the classical moment problem, the results of Curto and Fialkow concerning sequences with Hankel matrices of finite rank or Hankel matrices of finite size which admit a flat extension also hold true in the tracial context. Finally, a relaxation for trace-minimization of polynomials using sums of hermitian squares and commutators is proposed. While this relaxation is not always exact, the tracial analogs of the results of Curto and Fialkow give a sufficient condition for the exactness of this relaxation.
Keywords: matematika, algebra, polinomi s pozitivno sledjo, prosta algebra, nekomutativni polinom, centralna enostavna algebra, reducirana sled, polinomska identiteta, kvadratna forma, prosta pozitivnost, vsota hermitskih kvadratov, problem momentov, mathematics, algebra, free algebra, noncommutative polynomial, central simple algebra, (reduced) trace, polynomial identity, central polynomial, quadratic form, free positivity, sum of hermitian squares, (truncated) moment problem
Published: 10.07.2015; Views: 666; Downloads: 59
URL Link to full text
This document has many files! More...

8.
An application of S. Kurepa's extension of Jordan-Neumann charactization of pre-Hilbert space
Joso Vukman, 1986, original scientific article

Abstract: V članku je dokazan rezultat, ki karakterizira kompleksen Hilbertov prostor med vsemi kompleksnimi Hausdorffovimi bornološkimi in sodčastimi lokalnokonveksnimi vektorskimi prostori. Pri dokazu je uporabljen znan rezultat S. Kurepe.
Keywords: matematika, funkcionalna analiza, vektorski prostor, bilinearna forma, skalarni produkt, Hilbertov prostor, bornološki Hausdorffov lokalno konveksen prostor, sodčast Hausdorffov lokalno konveksen prostor, vector space, sesquilinear form, inner product, Hilbert space, bornological Hausdorff locally convex vector space, barrelled Hausdorff locally convex vector space
Published: 10.07.2015; Views: 306; Downloads: 15
URL Link to full text

9.
Stern polynomials
Sandi Klavžar, Uroš Milutinović, Ciril Petr, 2007, original scientific article

Abstract: Sternovi polinomi ▫$B_k(t)$▫, ▫$k ge 0$▫, ▫$t in RR$▫, so vpeljani na naslednji način: ▫$B_0(t) = 0$▫, ▫$B_1(t) = 1$▫, ▫$B_{2n}(t) = tB_n(t)$▫ in ▫$B_{2n+1}(t) = B_{n+1}(t) + B_n(t)$▫. Pokazano je, da ima ▫$B_n(t)$▫ enostavno eksplicitno reprezentacijo s hiperebinarnimi reprezentacijami ▫$n-1$▫ in da je odvod ▫$B'_{2n-1}(0)$▫ enak številu enic v standardni Grayjevi kodi za ▫$n-1$▫. Dokazano je tudi, da je stopnja polinoma ▫$B_n(t)$▫ enaka razliki med dolžino in težo nesosednje predstavitve števila ▫$n$▫.
Keywords: matematika, Sternovo (dvoatomsko) zaporedje, Sternovi polinomi, hiperbinarna reprezentacija, standardna Grayjeva koda, nesosednja predstavitev, mathematics, Stern (diatomic) sequence, Stern polynomials, hyperbinary representation, standard Gray code, non-adjacent form
Published: 10.07.2015; Views: 445; Downloads: 14
URL Link to full text

Search done in 0.17 sec.
Back to top
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica