• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1531
  • 603
  • 211
  • 163
  • 161
  • 70
  • 56
  • 30
  • 27
  • 24
  • 24
  • 20
  • 16
  • 14
  • 13
  • Tagged with
  • 3460
  • 1039
  • 729
  • 466
  • 437
  • 403
  • 386
  • 317
  • 309
  • 308
  • 252
  • 249
  • 222
  • 210
  • 187
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
201

Vector Graphics Stylized Stroke Fonts

Jägenstedt, Philip January 2008 (has links)
<p>Stylized Stroke Fonts (SSF) are stroke fonts which allow variable stroke widths and arbitrary stroke ends. In this thesis project we implement SSF by extending concepts of the traditional vector graphics paradigm, giving what we call Vector Graphics Stylized Stroke Fonts (VGSSF). A stroking algorithm for the new stroke model is developed and implemented in the Opera web browser's internal vector graphics drawing toolkit. Both the HTML 5 Canvas JavaScript interface and SVG fonts are extended to support the new stroke model. An editor and renderer for the SVG font format is implemented inside the browser using the extended Canvas interface. Sample glyphs from Latin and Chinese typefaces are converted to the SVG font format to assess the suitability of the stroke representation. The results are excellent for Chinese Ming typeface glyphs, while there are some minor problems with Latin typeface glyphs. Approximations suggest that VGSSF gives a size reduction of the font definition file by at least 50%, with a potential reduction of around 85% for Chinese typefaces. The processing requirements increase by approximately 20-30% due to extra steps required to render each glyph.</p>
202

Relativistic Gamow vectors : state vectors for unstable particles /

Kaldas, Hany Kamel Halim, January 2000 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 103-107). Available also in a digital version from Dissertation Abstracts.
203

Fabric wrinkle characterization and classification using modified wavelet coefficients and support-vector-machine classifiers

Sun, Jingjing 03 August 2012 (has links)
Wrinkling caused in wearing and laundry procedures is one of the most important performance properties of a fabric. Visual examination performed by trained experts is a routine wrinkle evaluation method in textile industry, however, this subjective evaluation is time-consuming. The need for objective, automatic and efficient methods of wrinkle evaluation has been increasing remarkably in recent years. In the present thesis, a wavelet transform based imaging analysis method was developed to measure the 2D fabric surface data captured by an infrared imaging system. After decomposing the fabric image by the Haar wavelet transform algorithm, five parameters were defined based on modified wavelet coefficients to describe wrinkling features, such as orientation, hardness, density and contrast. The wrinkle parameters provide useful information for textile, appliance, and detergent manufactures who study wrinkling behaviors of fabrics. A Support-Vector-Machine based classification scheme was developed for automatic wrinkle rating. Both linear kernel and radial-basis-function (RBF) kernel functions were used to achieve a higher rating accuracy. The effectiveness of this evaluation method was tested by 300 images of five selected fabric types with different fiber contents, weave structures, colors and laundering cycles. The results show agreement between the proposed wavelet-based automatic assessment and experts’ visual ratings. / text
204

Expression of Ebola and Marburg Virus Nucleoproteins : For Use in Antibody-Based Diagnostics / Uttryck av Ebola och Marburg virus nukleoprotein för antikroppsbaserad diagnostik

Svedberg, Jonnie Juhani January 2015 (has links)
No description available.
205

A precision measurement of the ratio of the effective vector to axial-vector couplings of the weak neutral current at the Z° pole

Vincter, Manuella Greta 26 August 2015 (has links)
Graduate
206

A modern representation of the flow of electromagnetic power and energy using the Poynting's vector and a generalized Poynting's theorem

Hsu, Hsin I 08 July 2011 (has links)
A comprehensive and rigorous description of instantaneous balance of electromagnetic power defined as the derivative of energy with respect to time is offered by the Poynting's theorem. Such theorem is expressed as the sum of a series of volume integrals representing the volume densities of densities of different components of electromagnetic power and the power flow through the general surface surrounding the entire domain in which the Poynting's vector expresses the instantaneous power leaving the domain (the positive normal is the outward normal to the enclosing surface). The original feature of the present approach is the introduction in the electromagnetic power balance and conservation of the electromechanical energy conversion by the use of the flux derivatives of the fields [D with vector arrow] and [B with vector arrow]. For the moving points (rotors) involved in electromechanical energy conversion, the surface of integration is driven together with them and [permittivity] and [permeatility] remain substantially constant--(a point in movement maintains its properties as [formula]). Then the balance of energy (and power) can be written at each infinitesimal time interval for the electromagnetic energy in which case the elementary mechanical work is produced by mechanical forces of electromagnetic origin. The thermal energy accounts for the Joule (and hysteresis) losses in the system. A treatment of the flow of electromagnetic energy is given for a complete of illustrative relationship in time and frequency domain. / text
207

Integration of stream and watershed data for hydrologic modeling

Koka, Srikanth 30 September 2004 (has links)
This thesis presents the development of a hydrologic model in the vector environment. Establishing spatial relationship between flow elements is the key for flow routing techniques. Such a relationship is called hydrologic topology, making each flow element know which other elements are upstream and which are downstream. Based on the hydrologic topology established for the flow elements, tools were developed for flow network navigation, drainage area estimation, flow length calculation and drainage divide determination. To apply the tools, data required might be obtained from different sources, which may lead to certain problems that have to do with wrong flow direction of stream lines and, mismatches in location of stream lines with respect to the corresponding drainage area polygons. Procedures to detect such inconsistencies and to correct them have been developed and are presented here. Data inconsistencies correction and parameter computation methods form the basis for the development of a routing model, which would be referred as hydrologic model. The hydrologic model consists of an overland flow routing module, two options for channel routing and a reservoir routing module. Two case studies have been presented to show the application of the tools developed.
208

Vektorinės grafinės informacijos skaitymo, redagavimo ir įrašymo programa / Vector graphics information reading, editing and writing software

Kurauskas, Rytis 01 June 2004 (has links)
The main project goal is to develop the DXF reading, editing and writing software. Research goal is usage of DXF reading end editing systems, DXF structure and reading method. Existing systems are reviewed, analyzed solution of problem. The object oriented design was used to develop system. Developed DXF reading, editing and writing software is flexible for adding new graphical components, functional requirements, maintenance is simple. All of these are achieved using object oriented design system.
209

Apie vieną nespūdaus skysčio tekėjimo uždavinį / One problem of an incompressible fluid motion

Ašakevič, Inga 27 August 2009 (has links)
Darbe nagrinėtas skysčio tekėjimas laminariniame pasienio sluoksnyje. Skysčio tekėjimo greičio vektoriaus komponentės yra išreiškiamos tokiomis lygtimis v1 ir v2. Atsižvelgiant į hidrodinamikos dėsnius, prie šių lygčių yra pridedamos kraštinės sąlygos: v1=v2=0, kai x1≥0, x2=0, v1=U, kai x2→±∞. Gautas uždavinys buvo nagrinėtas matematiniu paketu MathCAD 13. Skaitiškai gauti rezultatai patvirtina teorines žinias apie skysčio tekėjimą laminariniame pasienio sluoksnyje. Iš darbe gautų grafikų galime daryti konkrečias išvadas apie sprendinio elgesį. / The laminar boundary layer flow of the incompressible liquid over semi – infinite flat plate is discussed. Components of the velocity vector are expressed in the form v1 and v2. In accordance with hydrodynamic laws the following boundary conditions are prescribed v1=v2=0, when x1≥0, x2=0, v1=U as x2→±∞. The problem was analyzed numerically using MathCAD 13. The obtained numerical results confirm the theoretical results about in laminar boundary layer flow of a viscous incompressible liquid. From the diagrams that are shown in the diploma work one can make certain specific conclusions about the behavior of the flow.
210

Rašto ženklų atpažinimas naudojant neuroninius tinklus / Handwriting character recognition using neural networks

Andrejevas, Andrejus 10 August 2011 (has links)
Magistriniame darbe tiriamos rašto ženklų atpažinimo problemos, nagrinėjami neuroniniai tinklai skirti rašto ženklams atpažinti. Apžvelgiamos problemos, kylančios sprendžiant rašto atpažinimo uždavinius, įvairūs problemų sprendimų būdai. Pasiūlytas dirbtinio neuroninio tinklo mokymo strategijos, pagrįstos klaidos skleidimo atgal algoritmu, patobulinimas. Patobulinimo esmė yra ta, kad mokymo aibė į tinklą paduodama ne visa iškarto, o dalimis. Kai neuroninis tinklas išmoksta atpažinti tą dalį, mokymo aibė papildoma naujais duomenimis, bet pradinių svorių vektoriai nesikeičia ir tinklas mokomas toliau. Šis algoritmo patobulinimas leidžia ženkliai sumažinti apmokymo laiką neprarandant tikslumo. Kai kuriais atvejais neuroninis tinklas, mokomas pagal įprastą klaidos skleidimo atgal algoritmą, nerodė jokių mokymo perspektyvų, po ~ 9 val. paklaida nesikeisdavo, neuroninis tinklas negalėdavo teisingai atpažinti nei vienos raidės. Panaudojus patobulintą strategiją, mus tenkinanti paklaida pasiekiama po ~ 3 val. 30 min. Taip pat darbe tiriama atpažinimo tikslumo priklausomybė nuo svorių pradinių reikšmių ir neuronų skaičiaus paslėptuose sluoksniuose. Nustatyti intervalai, kuriuose turi būti generuojamos svorių pradinės reikšmės, siekiant gauti tikslius atpažinimo rezultatus. Neuronų skaičius paslėptuose sluoksniuose turi būti daugiau nei penki. / The master thesis presents investigations of the problems of the optical character recognition. It also deals with the artificial neural networks that are designed for the optical character recognition. The work surveys the problems that emerge during the process of the optical character recognition. Various solutions are investigated. The improvement of a strategy for teaching the neural network that is based on the error back propagation is suggested. The essence of the improvement is that the training data set is divided into some parts and these parts are presented to the network one by one. When the neural network learns to recognize a part, the next part is presented to the network without any changes of the initial weight vectors and the network is trained further. This improvement allows us to reduce the training time significantly without losing the recognition accuracy. In some cases, the neural network that is trained according the ordinary error back propagation algorithm does not show any prospects. After ~ 9 hours, the error remains the same, the neural networks cannot recognize any letters. Using the improved strategy, the error satisfied is reached after ~3 hours 30 minutes. The dependence of the recognition accuracy on the values of the initial weight vectors and on the number of neurons in hidden layers is also investigated. The intervals in which the values of the initial weight vectors must be generated are identified, in order to get the correct results... [to full text]

Page generated in 0.0252 seconds