• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 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.
1

Contour

Nordberg, Johan January 2013 (has links)
Traditional sketching with pen on paper can be seen as to visualize the memory. Limited to a framework of influences, experiences and ideas the outcome will result in something already known.In searching for knowledge an experimental sketch method counteracts this framework. The aim of this work is to explore morph animation of archetypical garments. Shape interpolation in Adobe Flash software makes it possible to calculate the way between two silhouettes. The result is a third silhouette, a morph of selected garments and depends on where the animation is paused. The work also deals with the gap between visualize(sketching) and making(construction/realization). In the investigation a new way of using animation as an sketch method have been found. Also how to use computer based 3D sketching in fashion design and an alternative construction method based on paper craft techniques have been developed. The collection consists of garments based on a morph between a classic skirt and a blazer to discuss new visions and possibility’s in fashion. Can the way we sketch, construct and produce affect garment definitions? And how could the findings in this work being used in a commercial industry. / Program: Modedesignutbildningen
2

Novel Online Data Cleaning Protocols for Data Streams in Trajectory, Wireless Sensor Networks

Pumpichet, Sitthapon 12 November 2013 (has links)
The promise of Wireless Sensor Networks (WSNs) is the autonomous collaboration of a collection of sensors to accomplish some specific goals which a single sensor cannot offer. Basically, sensor networking serves a range of applications by providing the raw data as fundamentals for further analyses and actions. The imprecision of the collected data could tremendously mislead the decision-making process of sensor-based applications, resulting in an ineffectiveness or failure of the application objectives. Due to inherent WSN characteristics normally spoiling the raw sensor readings, many research efforts attempt to improve the accuracy of the corrupted or “dirty” sensor data. The dirty data need to be cleaned or corrected. However, the developed data cleaning solutions restrict themselves to the scope of static WSNs where deployed sensors would rarely move during the operation. Nowadays, many emerging applications relying on WSNs need the sensor mobility to enhance the application efficiency and usage flexibility. The location of deployed sensors needs to be dynamic. Also, each sensor would independently function and contribute its resources. Sensors equipped with vehicles for monitoring the traffic condition could be depicted as one of the prospective examples. The sensor mobility causes a transient in network topology and correlation among sensor streams. Based on static relationships among sensors, the existing methods for cleaning sensor data in static WSNs are invalid in such mobile scenarios. Therefore, a solution of data cleaning that considers the sensor movements is actively needed. This dissertation aims to improve the quality of sensor data by considering the consequences of various trajectory relationships of autonomous mobile sensors in the system. First of all, we address the dynamic network topology due to sensor mobility. The concept of virtual sensor is presented and used for spatio-temporal selection of neighboring sensors to help in cleaning sensor data streams. This method is one of the first methods to clean data in mobile sensor environments. We also study the mobility pattern of moving sensors relative to boundaries of sub-areas of interest. We developed a belief-based analysis to determine the reliable sets of neighboring sensors to improve the cleaning performance, especially when node density is relatively low. Finally, we design a novel sketch-based technique to clean data from internal sensors where spatio-temporal relationships among sensors cannot lead to the data correlations among sensor streams.

Page generated in 0.0874 seconds