• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 137
  • 37
  • 24
  • 14
  • 13
  • 8
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 276
  • 34
  • 33
  • 30
  • 30
  • 30
  • 29
  • 28
  • 28
  • 27
  • 26
  • 26
  • 24
  • 24
  • 24
  • 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.
251

Coding Schemes For Distributed Subspace Computation, Distributed Storage And Local Correctability

Vadlamani, Lalitha 02 1900 (has links) (PDF)
In this thesis, three problems have been considered and new coding schemes have been devised for each of them. The first is related to distributed function computation, the second to coding for distributed storage and the final problem is based on locally correctable codes. A common theme of the first two problems considered is distributed computation. The first problem is motivated by the problem of distributed function computation considered by Korner and Marton, where the goal is to compute XOR of two binary sources at the receiver. It has been shown that linear encoders give better sum rates for some source distributions as compared to the usual Slepian-Wolf scheme. We generalize this distributed function computation setting to the case of more than two sources and the receiver is interested in computing multiple linear combinations of the sources. Consider `m' random variables each of which takes values from a finite field and are associated with a certain joint probability distribution. The receiver is interested in the lossless computation of `s' linear combinations of the m random variables. By considering the set of all linear combinations of m random variables as a vector space V , this problem can be interpreted as a subspace-computation problem. For this problem, we develop three increasingly refined approaches, all based on linear encoders. The first two approaches which are termed as common code approach and selected subspace approach, use a common matrix to encode all the sources. In the common code approach, the desired subspace W is computed at the receiver, whereas in the selected subspace approach, possibly a larger subspace U which contains the desired subspace is computed. The larger subspace U which gives the minimum sum rate itself is based on a decomposition of vector space V into a chain of subspaces. The chain of subspaces is determined by the joint probability distribution of m random variables and a notion of normalized measure of entropy. The third approach is a nested code approach, where all the encoding matrices are nested and the same subspace U which is identified in the selected subspace approach is computed. We characterize the sum rates under all the three approaches. The sum rate under nested code approach is no larger than both selected subspace approach and Slepian-Wolf approach. For a large class of joint distributions and subspaces W , the nested code scheme is shown to improve upon Slepian-Wolf scheme. Additionally, a class of source distributions and subspaces are identified, for which the nested code approach is sum-rate optimal. In the second problem, we consider a distributed storage network, where data is stored across nodes in a network which are failure-prone. The goal is to store data reliably and efficiently. For a required level of reliability, it is of interest to minimise storage overhead and also of interest to perform node repair efficiently. Conventionally replication and maximum distance separable (MDS) codes are employed in such systems. Though replication is very efficient in terms of node repair, the storage overhead is high. MDS codes have low storage overhead but even the repair of a single failed node requires contacting a large number of nodes and downloading all their data. We consider two coding solutions that have recently been proposed, which enable efficient node repair in case of single node failure. The first solution called regenerating codes seeks to minimize the amount of data downloaded for node repair, while codes with locality attempt to minimize the number of helper nodes accessed. We extend these results in two directions. In the first one, we introduce the notion of codes with locality where the local codes have minimum distance more than 2 and hence can recover a code symbol locally even in the presence of multiple erasures. These codes are termed as codes with local erasure correction. We say that a code has information locality if there exists a set of message symbols, each of which is covered by local codes. A code is said to have all-symbol locality if all the code symbols are covered by local codes. An upper bound on the minimum distance of codes with information locality is presented and codes that are optimal with respect to this bound are constructed. We make a connection between codes with local erasure correction and concatenated codes. The second direction seeks to build codes that combine the advantages of both codes with locality as well as regenerating codes. These codes, termed here as codes with local regeneration, are codes with locality over a vector alphabet, in which the local codes themselves are regenerating codes. There are two well known classes of regenerating codes known as minimum storage regenerating (MSR) codes and minimum bandwidth regenerating (MBR) codes. We derive two upper bounds on the minimum distance of vector-alphabet codes with locality, one for the case when the local codes are MSR codes and the second for the case when the local codes are MBR codes. We also provide several optimal constructions of both classes of codes which achieve their respective minimum distance bounds with equality. The third problem deals with locally correctable codes. A block code of length `n' is said to be locally correctable, if there exists a randomized algorithm such that any one of the coordinates of the codeword can be recovered by querying at most `r' coordinates, even in presence of some fraction of errors. We study the local correctability of linear codes whose duals contain 4-designs. We also derive a bound relating `r' and fraction of errors that can be tolerated, when each instance of the randomized algorithm is `t'-error correcting instead of simple parity computation.
252

Predictive Utility and Achievement Outcomes of Two Simultaneous District-Developed Interim Assessment Programs

Chen, Tavymae W 01 January 2014 (has links)
The purpose of the present correlational, ex post facto study was to evaluate the predictive ability and academic achievement criterion outcomes of two district-developed interim mathematics assessment programs for a sample of 5,801 grade 6 students in a large urban school district. Average scores for both interim assessment types were statistically significantly more related to 2013 FCAT 2.0 scores (r = .75 and .72; p < .001) than all other predictors (i.e., student demographics, Florida school grade, and student course GPA) except for 2012 FCAT 2.0 scores (r = .78; p < .001). Further, the newer interim assessment program with an instructional purpose and curriculum-based sequencing had slightly stronger overall predictive power (rs = .88) and a higher criterion mean score (M = 218.08) than the older, state-test mirror interim assessment program (rs = .85; M = 215.47). Regression models by prior year FCAT 2.0 Achievement Level yielded some predictor ranking discrepancies by prior achievement level. Although not statistically significant at the .01 level, groups of students with a more moderate total number of interim assessments outperformed groups with all or nothing. Overall, the two types of interim assessment programs evaluated in the present study were good predictors of the state high-stakes test, 2012 Grade 6 Mathematics FCAT 2.0. However, more research must be done to identify with certainty whether or not the act of taking the interim tests and receiving feedback contributes to improved student learning.
253

PRONTOX – proton therapy to reduce acute normal tissue toxicity in locally advanced non-small-cell lung carcinomas (NSCLC): study protocol for a randomised controlled trial

Zschaeck, Sebastian, Simon, Monique, Löck, Steffen, Troost, Esther G. C., Stützer, Kristin, Wohlfahrt, Patrick, Appold, Steffen, Makocki, Sebastian, Bütof, Rebecca, Richter, Christian, Baumann, Michael, Krause, Mechthild 17 March 2017 (has links)
Background Primary radiochemotherapy with photons is the standard treatment for locally advanced-stage non-small cell lung cancer (NSCLC) patients. Acute radiation-induced side effects such as oesophagitis and radiation pneumonitis limit patients’ quality of life, and the latter can be potentially life-threatening. Due to its distinct physical characteristics, proton therapy enables better sparing of normal tissues, which is supposed to translate into a reduction of radiation-induced side effects. Methods/design This is a single-centre, prospective, randomised controlled, phase II clinical trial to compare photon to proton radiotherapy up to 66 Gy (RBE) with concomitant standard chemotherapy in patients with locally advanced-stage NSCLC. Patients will be allocated in a 1:1 ratio to photon or proton therapy, and treatment will be delivered slightly accelerated with six fractions of 2 Gy (RBE) per week. Discussion The overall aim of the study is to show a decrease of early and intermediate radiation-induced toxicity using proton therapy. For the primary endpoint of the study we postulate a decrease of radiation-induced side effects (oesophagitis and pneumonitis grade II or higher) from 39 to 12%. Secondary endpoints are locoregional and distant failure, overall survival and late side effects. Trial registration Registered at ClinicalTrials.gov with Identifier NCT02731001 on 1 April 2016.
254

Vícepatrová skeletová konstrukce administrativní budovy / Reinforced concrete frame structure of multi-storey administrative building

Zdražilová, Pavlína January 2018 (has links)
This diploma thesis deals with design and assessment of selected parts of the reinforced concrete frame of multi-storey administrative building according to the ultimate and serviceability limit state. The aim of this thesis was to design and assess the reinforced concrete structure of a slab above the first floor, one column, a foundation pad and a staircase. In addition to the static calculation, drawing documentation is included. Internal forces were obtained from the 3D model created in computational software Scia Engineer 16.1.
255

Polyfunkční dům / Multifunctional Building

Erlebach, Jakub January 2019 (has links)
The diploma thesis concerns static project of chosen parts of load-bearing structure four-storey multifunctional building. It´s frame structural systém locally supported colomns. The thesis suggests floor slab above ground floor including punching, colomn, foundation pad, basement wall, loaded soil and strip foundation. Every element was judged by load-bearing capacity, designed reinforcement and made drawings of reinforcement. Calculation of internal forces is made by finite element method of the program dlubal RFEM.
256

Hotel s wellness / Hotel with wellness

Jagoš, Ondřej January 2019 (has links)
The topic of this thesis is a new-building of a hotel with a wellness centre. The building site is located in the cadastral area of Malenovice near Zlín, the city of Zlín, Zlín Region. It is the building consisting of three rectangles inserted into each other. The building is designed as a six-floor skeletal construction with a cellar made of reinforced concrete, roofed with flat roofs. In the first floor there is a reception, a restaurant with outside seating, wellness centre, and utility rooms. The second and the third floor are intended for accommodation of guests in the form of double rooms and apartments. In the fourth and fifth floors there are double rooms as well. Rooms for guests and apartments are situated to the southern and northern part. This residential space is mostly equipped with balconies stretching along the corners. In the last, sixth floor there can be found the management of the hotel, a conference room and a bar with terrace. The main entrance is situated to the northern part of the object. Outdoor parking places are also a part of the hotel. Exterior and interior of the hotel are designed in the conformity with current modern trends. The layout of the space is functional and basic. The dynamics of the building is supported by external holes in black colour and by the two-coloured facade in blue and grey colours. The hotel is meant for both active and passive relaxation, there is a possibility of accommodation of young couples, families with children, elderly people, individuals, and people with limited ability of movement. The hotel of designed with the focus on the comfort of guests. Therefore the leisure time space is a part of hotel. The comfortable space for relaxation within the object is provided by the wellness centre mentioned above, the bar with terrace, and an outdoor swimming pool. The disposition of the object is fastened by the reinforced concrete monolithic panels and by the feet placed under both inside and outside reinforc
257

Železobetonová monolitická vícepatrová skeletová konstrukce / Monolithic multi-storey concrete frame structure

Luža, Radim January 2020 (has links)
The subject of this diploma thesis is a static solution of selected load-bearing structures of a polyfunctional building. The structures are designed according with ČSN EN 1992-1-1: Design of concrete structures - Part 1-1: General rules and rules for building construction
258

Návrh betonové konstrukce hudebního pavilonu v Poděbradech / Design of concrete structure of Music Pavilion in Podebrady

Juda, Jan January 2019 (has links)
This diploma thesis is focused on the roofing of the stage in spa park in Poděbrady. This construction is designed in two variants. In each variant is determined load on the structure and internal forces acting on the structure. Of these two variants, only one variant was selected. This selected variant was design in detail. In this variant was dimension their parts. Under the roof construction is located stage, which was not solved in the diploma thesis. All elements are dimensioned to the ultimate load condition by ČSN EN 1992-1-1. Drawings of the foundations, shapes construction, reinforcement and visualization are processed in the drawing part.
259

Návrh a posouzení prvků vícepodlažního objektu / The design of multi-storey building

Hardubej, Martin January 2014 (has links)
The aim of the thesis is the design and assessment of selected elements of a new build multi-storey office building. The supporting structure of monolithic reinforced concrete skeleton is modeled SCIA Engineer and burdened set load cases and combinations. The outputs of the internal forces of the calculation program are dimensioned selected elements. Selected elements include locally supported slab, columns, column shoes, basement wall and footing still. The thesis is selected reinforced concrete elements assessed on the ultimate limit state. The output of this work is static calculation of individual elements. Another part of the output consists of drawings solved elements.
260

Městský hotel / City hotel

Šoulová, Eva January 2016 (has links)
The thesis deals with a new hotel construction in Brno. The paper aims to elaborate a project documentation for the construction of the building. It is a detached building in a slightly sloping terrain. The building has three floors and one underground floor. On the underground floor there are jointly-shared garages and technical background of the hotel. On the first floor there is a reception, a restaurant, a café and an open-air terrace. The second and the third floor is designed to accommodate guests in double rooms and suites. There is also a manager´s office and a conference room. The bearing construction consists of a ferroconcrete skeleton with a bricked outside envelope of aerated concrete blocks Ytong. The skeletal construction is built on a monolithic foundation footings. The building is covered in a flat single-coat roof which is partly designed as a vegetation roof. The facade of the building is glazed in the northern part of the 1st floor and some parts of the facade are coloured green, the others are of various colours. The building is insulated with a contact insulation system.

Page generated in 0.036 seconds