In this report we compare three different assignment algorithms in how they can be used to assign a set of drones to get to a set of goal locations in an as resource efficient way as possible. An experiment is set up to compare how these algorithms perform in a somewhat realistic simulated environment. The Robot Operating system (ROS) is used to create the experimental environment. We found that by introducing a threshold for the Hungarian algorithm we could reduce the total time it takes to complete the problem while only sightly increasing total distance traversed by the drones.

Šiame darbe atskleidžiama reikalavimo perleidimo instituto esmė, jo skirtumai nuo panašių institutų, reikalavimo perleidimo sutarties pagrindiniai ypatumai. Darbe tai pat analizuojama Lietuvos ir užsienio šalių teismų praktika, moksliniai straipsniai, daug dėmesio skiriama reikalavimo perleidimo sutarties šalių bei skolininko teisinei padėčiai apibūdinti esant tiek vienašalei, tiek dvišalei pirminei prievolei. Analizuojant reikalavimo perleidimo galimybę vienašalėje prievolėje pagrindinis norminis tyrimo šaltinis – 2001-07-01 d. įsigaliojęs Lietuvos Respublikos civilinis kodeksas. Taip pat analizuojama Lietuvos teismų praktika, tačiau ji nėra gausi. Siekiant atskleisti galimyb����� sudaryti cesijos sutartį ir perleisti iš dvišalės sutarties kylančias ne tik teises, bet ir pareigas, analizuojami Latvijos, Vokietijos, Jungtinių Amerikos Valstijų teisės aktai taip pat UNIDROIT tarptautinių komercinių sutarčių principai. Pažymėtina, jog plačiausiai reikalavimo perleidimą dvišalėje sutartyje analizavo JAV teisės mokslininkai, taip pat šiuo klausimu gausi yra ir Jungtinių Amerikos Valstijų teismų praktika, kuria buvo remtasi ieškant atsakymų į iškeltus klausimus. / This master work contains analysis of a status of all provisions of an original contract, also of a legal position of an assignor, an assignee and a debtor when an assignment contract is signed. An assignment of claim in Lithuanian legal system is defined in Chapter VI Book six of the Civil Code of Lithuania. According to the Civil Code a creditor may without the consent of the debtor assign to another person all or a part of the claim provided that the transfer does not contradict to laws or the contract, or the claim is not related with the person of the creditor. While analysing an assignment of claim in foreign countries, the great attention is paid to the assignability of bilateral contracts.

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2002. / Includes bibliographical references (leaves 92-95). Also available in electronic version. Access restricted to campus users.

Thesis (M.S.)--West Virginia University, 2002. / Title from document title page. Document formatted into pages; contains xi, 87 p. : ill. Includes abstract. Includes bibliographical references (p. 84-87).

This thesis uses an experimental approach to explore optimal gender assignment theory, an approach to gender assignment housed in Optimality Theory (Prince & Smolensky 1993/2004). Optimal gender assignment theory was proposed by Curt Rice (2006) and stipulates that grammatical gender is assigned based on a set of crucially non-ranked gender features constraints and markedness constraints. Thirty-seven participants who were bilingual in English and German received 40 sentences containing English loanwords with the definite article removed and asked to provide the appropriate gender marker and a lexical equivalency. The study found that the constraints employed and developed for optimal gender assignment theory are not applicable to English loanwords in German.

Terahertz (THz) band represents the unused frequency band between the microwave and optical bands and lies in the range of frequencies between 0.1 to 10 THz. As a result, the THz signal generation can be done using electronic or photonic circuits. Moreover, the channel gain has hybrid features from both microwave and optical bands allowing to reap the benefits of each band. Adopting such a technology can mitigate the spectrum scarcity and introduce a substantial solution to other systems such as visible light communications. Despite of the generous bandwidth, the THz communications suffer from high attenuation that increases with adopted frequency similar to the microwave frequency band. Furthermore, THz communications are subject to a different type of attenuation called Molecular Absorption, that depends on the chemical nature of the ambiance air. Thus, THz transmitters need to use extra power and high antenna gains to overcome signal loss and compensate the short distance range limitation. In this thesis, we investigate the pathloss model to compute the overall attenuation faced by the THz wave for different frequencies and weather conditions. Then, we use the THz technology to support the operation of uplink networks using directional narrow beams. We optimize the uplink communication network resource represented in the frequency bands and the assigned power in order to minimize the total power consumption while achieving a specific quality of service. Furthermore, we investigate the impact of weather conditions and the system’s requirements in order to guarantee a better performance.

No description available.

No description available.

No description available.

<p>Conventional multiple description coding (MDC) is a source coding technique which provides resilience against packet loss. On the other hand, the correlation introduced between descriptions can be used to combat bit errors as well. While the latter feature of MDC has been attested and exploited in prior work, only few attempts have been made to design MDC with higher bit error resilience ability.</p> <p>This thesis makes some progress in the latter direction by addressing the problem of robust (i.e., bit error resilient) index assignment (IA) design for two description scalar quantizers. Our approach is to start from an initial IA which is known to be good for the conventional two description problem, and then apply permutations to indices in each description to increase a minimum Hamming distance-like performance measure.</p> <p>The criterion of increasing the minimum Hamming distance between valid index pairs (d_min), has been considered in prior work, however an efficient IA construction was presented only for the case of d_min = 2 and low redundancy.</p> <p>The contribution of this thesis is the following. For the scenario when one description is known to be error free, a new measure for IA robustness is proposed, which is termed minimum side Hamming distance (d_side,min). This quantity is defined as the minimum Hamming distance between valid indices of one description for fixed index of the other description. It is further shown that the problem of robust permutations design under the new criterion is closely connected to the anti-bandwidth problem in a certain graph derived from a hypercube. Leveraging this connection, permutations achieving d_side,min = 2 are proposed for all redundancy levels. Furthermore, for general values of d_side,min, a simple construction of permutations achieving d_side,min is presented, based on channel codes of appropriate block length and rate, and with minimum distance d_side,min + 1, respectively, d_side,min, for two types of initial IA (diagonal, respectively, square-based). The application of this result to achieve IA with d_side,min = 3 is further discussed for a wide range of redundancy levels.</p> <p>Finally, for the scenario when both descriptions may carry bit errors, simple constructions of permutations achieving d_min = 3 are proposed for the high redundancy case.</p> / Master of Applied Science (MASc)