Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: END TO END SECURED.
Rozprawy doktorskie na temat „END TO END SECURED”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „END TO END SECURED”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
1
Petagna, Fabio. "Secure End-to-End Communications in Mobile Networks". Doctoral thesis, Universita degli studi di Salerno, 2011. http://hdl.handle.net/10556/1524.
Pełny tekst źródłaStreszczenie:
2009 - 2010Cellular communication has become an important part of our daily life. Besides using cell phones for voice communication, we are now able to access the Internet, conduct monetary transactions, send voice, video and text messages and new services continue to be added. The frequencies over which voice is transmitted are public, so voice encryption is necessary to avoid interception of the signal over the air. But once the signal reaches the operators Base Station (BS), it will be transmitted to the receiver over a wired or wireless mean. In either case, no protection is de ned. This does not seem a problem, but this is not true. Along the path across operator network, voice is at risk. It will only be encrypted again, with a di erent key, from the BS to the receiver if the receiver is herself a mobile user. Moreover, voice encryption is not mandatory. The choice whether or not to accept an unprotected communication is up to the network. When adopted, the same encryption algorithm is used for sending SMS messages between mobile telephones and base stations and for encrypting of calls. Unfortunately, vulnerabilities in this encryption systems were already revealed more than 10 years ago and more continue to be discovered. Currently the most popular communication technologies are the GSM and the UMTS. The UMTS is in use as a successor to GSM. Along with mobile phone services, It provides rapid data communication. The security algo- rithms in UMTS di ers from GSM in two important ways: encryption and mutual authentication. Although security standards have been improved, the end- to-end security is not provided... [edited by Author]
IX n.s.
2
Tahir, Ruhma. "An ICMetric based framework for secure end-to-end communication". Thesis, University of Essex, 2018. http://repository.essex.ac.uk/22281/.
Pełny tekst źródłaStreszczenie:
Conventional cryptographic algorithms rely on highly sophisticated and well established algorithms to ensure security, while the cryptographic keys are kept secret. However, adversaries can attack the keys of a cryptosystem without targeting the algorithm. This dissertation aims to cover this gap in the domain of cryptography, that is, the problem associated with cryptographic key compromise. The thesis accomplishes this by presenting a novel security framework based on the ICMetric technology. The proposed framework provides schemes for a secure end-to-end communication environment based on the ICMetric technology, which is a novel root of trust and can eliminate issues associated with stored keys. The ICMetric technology processes unique system features to establish an identity which is then used as a basis for cryptographic services. Hence the thesis presents a study on the concept of the ICMetric technology and features suitable for generating the ICMetric of a system. The first contribution of this thesis is the creation of ICMetric keys of sufficient length and entropy that can be used in cryptographic applications. The proposed strong ICMetric key generation scheme follows a two-tier structure, so that the ICMetric keys are resilient to pre-computed attacks. The second contribution of this thesis is a symmetric key scheme that can be used for symmetric key applications based on the ICMetric of the system. The symmetric keys are generated based on zero knowledge protocols and the cryptographic services are provided without transmitting the key over the channel. The fourth major contribution of this thesis is the investigation into the feasibility of employing the ICMetric technology for identifying Docker containers employed by cloud service providers for hosting their cloud services.
3
Vogt, Christian. "Efficient and Secure End-to-End Mobility Support in IPv6". [S.l. : s.n.], 2007. http://digbib.ubka.uni-karlsruhe.de/volltexte/1000007211.
Pełny tekst źródła
4
Nemati, Hamed. "Secure System Virtualization : End-to-End Verification of Memory Isolation". Doctoral thesis, KTH, Teoretisk datalogi, TCS, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-213030.
Pełny tekst źródłaStreszczenie:
Over the last years, security-kernels have played a promising role in reshaping the landscape of platform security on embedded devices. Security-kernels, such as separation kernels, enable constructing high-assurance mixed-criticality execution platforms on a small TCB, which enforces isolation between components. The reduced TCB minimizes the system attack surface and facilitates the use of formal methods to ensure the kernel functional correctness and security. In this thesis, we explore various aspects of building a provably secure separation kernel using virtualization technology. We show how the memory management subsystem can be virtualized to enforce isolation of system components. Virtualization is done using direct-paging that enables a guest software to manage its own memory configuration. We demonstrate the soundness of our approach by verifying that the high-level model of the system fulfills the desired security properties. Through refinement, we then propagate these properties (semi-)automatically to the machine-code of the virtualization mechanism. Further, we show how a runtime monitor can be securely deployed alongside a Linux guest on a hypervisor to prevent code injection attacks targeting Linux. The monitor takes advantage of the provided separation to protect itself and to retain a complete view of the guest. Separating components using a low-level software cannot by itself guarantee the system security. Indeed, current processors architecture involves features that can be utilized to violate the isolation of components. We present a new low-noise attack vector constructed by measuring caches effects which is capable of breaching isolation of components and invalidates the verification of a software that has been verified on a memory coherent model. To restore isolation, we provide several countermeasures and propose a methodology to repair the verification by including data-caches in the statement of the top-level security properties of the system.QC 20170831
PROSPER
HASPOC
5
Schmidt, Dawin. "A Security and Privacy Audit of KakaoTalk’s End-to-End Encryption". Thesis, KTH, Skolan för elektro- och systemteknik (EES), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-196360.
Pełny tekst źródłaStreszczenie:
End-to-end encryption is becoming a standard feature in popular mobile chat appli-cations (apps) with millions of users. In the two years a number of leading chat apps have added end-end encryption features including LINE, KakaoTalk, Viber, Facebook Messenger, and WhatsApp.However, most of these apps are closed-source and there is little to no independent ver-ification of their end-to-end encryption system design. These implementations may be a major concern as proprietary chat apps may make use of non-standard cryptographic algorithms that may not follow cryptography and security best practices. In addition, governments authorities may force chat app providers to add easily decryptable export-grade cryptography to their products. Further, mainstream apps have a large attack surface as they offer a variety of features. As a result, there may be software vulnera-bilities that could be exploited by an attacker in order to compromise user’s end-to-end privacy. Another problem is that, despite being closed-source software, providers often market their apps as being so secure that even the provider is not able to decrypt messages. These marketing claims may be potentially misleading as most users do not have the technical knowledge to verify them.In this Master’s thesis we use KakaoTalk – the most popular chat app in South Korea – as a case study to perform a security and privacy assessment and audit of its “Secure Chat” opt-in end-to-end encryption feature. Also, we examine KakaoTalk’s Terms of Service policies to verify claims such as “[. . . ] Kakao’s server is unable to decrypt the encryption [. . . ]” from a technical perspective.The main goal of this work is to show how various issues in a product can add up to the potential for serious attack vectors against end-to-end privacy despite there being multiple layers of security. In particular, we show how a central public-key directory server makes the end-to-end encryption system vulnerable to well-known operator-site man-in-the-middle attacks. While this naive attack may seem obvious, we argue that (KakaoTalk) users should know about the strength and weaknesses of a particular design in order to make an informed decision whether to trust the security of a chat app or not.End-to-end kryptering är en allt mer vanligt förekommande funktionalitet bland populära mobila chatttjänster (händanefter appar) med miljontals användare. Under de två senaste åren har många ledande chattappar, bland annat LINE, KakaoTalk, Viber, Facebook Messenger, och WhatsApp, börjat använda end-to-end kryptering. Dock så är de flesta av dessa appar closed-source och det finns begränsad, eller ingen, fristående granskning av systemdesignen för deras end-to-end kryptering. Dessa implementationer kan innebära en stor risk då proprietära chattappar kan använda sig av kryptografiska algoritmer som inte följer best practice för säkerhet eller kryptografi. Vidare så kan statliga myndigheter tvinga de som tillhandahåller chattappar att använda lättdekrypterad export-grade kryptografi för sina produkter. Lägg till det att de flesta vanliga appar har många ytor som kan attackeras, till följd av all funktionalitet de erbjuder. Som ett resultat av detta finns en risk för mjukvarubrister som kan utnyttjas av en hackare för att inkräkta på en användares end-to-end integritet. Ytterligare ett problem är att trots att det är closed-source mjukvara så marknadsför ofta appleverantörerna sina appar som att vara är så säkra att inte ens leverantörerna själva kan dekryptera användarnas meddelanden. Det som hävdas i marknadsföringen riskerar vara missledande eftersom de flesta användarna inte har den tekniska kunskap som krävs för att kunna verifiera att det som hävdas är sant. I den här Master-uppsatsen använder vi KakaoTalk – den mest populära chattappen i Sydkorea – som en fallstudie för att granska och bedömma säkerhetens- och integritets-aspekterna hos deras valbara “Secure Chat” med end-to-end krypteringsfunktionalitet. Vi granskar även KakaoTalk’s användarvillkor för att kunna verifiera påståenden som att “[. . . ] Kakao’s server is unable to decrypt the encryption [. . . ]” från ett tekniskt perspektiv. Det huvudsakliga syftet med denna studien är att belysa hur olika brister i en produkt sammantagna kan skapa en risk för allvarliga vektorattacker mot end-to-end integriteten även fast det finns flera skyddslager. Mer specifikt visar vi hur en central katalogserver för public-keys gör end-to-end krypteringssystemet sårbart mot välkända operator-site man-in-the-middle-attacker. Trots att denna naiva typ av attack kan verka uppenbar, argumenterar vi för att (KakaoTalk) användare borde veta om styrkorna och svagheterna med en särskild systemdesign för att kunna göra ett informerat val för om de ska lita på säkerheten hos en chattapplikation eller inte.
6
Vogt, Christian [Verfasser]. "Efficient and Secure End-to-End Mobility Support in IPv6 / Christian Vogt". Aachen : Shaker, 2007. http://d-nb.info/1164340271/34.
Pełny tekst źródła
7
Unurkhaan, Esbold. "Secure end-to-end transport over SCTP a new security extension for SCTP /". [S.l. : s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=975686569.
Pełny tekst źródła
8
Kühner, Holger [Verfasser], i H. [Akademischer Betreuer] Hartenstein. "Performance of End-to-End Secure Data Sharing / Holger Kühner ; Betreuer: H. Hartenstein". Karlsruhe : KIT-Bibliothek, 2017. http://d-nb.info/1132997763/34.
Pełny tekst źródła
9
Chan, Siu Ping. "End-to-end streaming protocols with QoS control for secure IP multimedia communications /". View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202004%20CHAN.
Pełny tekst źródłaStreszczenie:
Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2004.Includes bibliographical references (leaves 167-175). Also available in electronic version. Access restricted to campus users.
10
Seggelmann, Robin [Verfasser], Erwin P. [Akademischer Betreuer] Rathgeb i Bruno [Akademischer Betreuer] Müller-Clostermann. "SCTP : Strategies to Secure End-To-End Communication / Robin Seggelmann. Gutachter: Bruno Müller-Clostermann. Betreuer: Erwin P. Rathgeb". Duisburg, 2013. http://d-nb.info/1030475571/34.
Pełny tekst źródła
11
Ghorbanzadeh, Mohammad. "Resource Allocation and End-to-End Quality of Service for Cellular Communications Systems in Congested and Contested Environments". Diss., Virginia Tech, 2015. http://hdl.handle.net/10919/64390.
Pełny tekst źródłaStreszczenie:
This research addresses the concept of radio resource allocation for cellular communications systems operating in congested and contested environments with an emphasis on end-to-end quality of service (QoS). The radio resource allocation is cast under a proportional fairness formulation which translates to a convex optimization problem. Moreover, the resource allocation scheme considers subscription-based and traffic differentiation in order to meet the QoS requirements of the applications running on the user equipment in the system. The devised resource allocation scheme is realized through a centralized and a distributed architecture and solution algorithms for the aforementioned architectures is derived and implemented in the mobile devices and the base stations. The sensitivity of the resource allocation scheme to the temporal dynamics of the quantity of the users in the system is investigated. Furthermore, the sensitivity of the resource allocation scheme to the temporal dynamics in the application usage percentages is accounted for. In addition, a transmission overhead of the centralized and distributed architectures for the resource allocation schemes is performed. Furthermore, the resource allocation scheme is modified to account for a possible additive bandwidth done through spectrum sharing in congested and contested environments, in particular spectrally coexistent radar systems. The radar-spectrum additive portion is devised in a way to ensure fairness of the allocation, high bandwidth utilization, and interference avoidance. In order to justify the aforesaid modification, the interference from radar systems into the Long Term Evolution (LTE) as the predominant 4G technology is studies to confirm the possibility of the spectrum sharing. The preceding interference analysis contains a detailed simulation of radar systems, propagation path loss models, and a third generation partnership project compliant LTE system. The propagation models are Free Space Path Loss (FSPL) and Irregular Terrain Model (ITM). The LTE systems under consideration are macro cell, outdoor small cells, and indoor small cells. Furthermore, the resource allocation under channel consideration is formalized such that the resources are allocated under a congested environment and based on the quality of channel the users have in the network as well as the quality of service requirements of the applications running on the mobile devices.Ph. D.
12
Cohn-Gordon, Katriel. "On secure messaging". Thesis, University of Oxford, 2018. http://ora.ox.ac.uk/objects/uuid:a6da6196-f216-4d57-9035-72903006197c.
Pełny tekst źródłaStreszczenie:
What formal guarantees should a secure messaging application provide? Do the most widely-used protocols provide them? Can we do better? In this thesis we answer these questions and with them give a formal study of modern secure messaging protocols, which encrypt the personal messages of billions of users. We give definitions and analyses of two protocols: one existing (Signal) and one new (ART). For Signal, we begin by extending and generalising classic computational models, in order to apply them to its complex ratcheting key derivations. With a threat model in mind we also define a security property, capturing strong secrecy and authentication guarantees including a new one which we call "post-compromise security". We instantiate Signal as a protocol in our model, stating its security theorem and sketching a computational reduction. Signal only supports encrypting messages between two devices, and so most implementers have built custom protocols on top of it to support group conversations. These protocols usually provide weaker security guarantees, and in particular usually do not have post-compromise security. We propose a new protocol called ART, whose goal is to bring Signal's strong security properties to conversations with multiple users and devices. We give a design rationale and a precise definition of ART, and again generalise existing computational models in order to formally specify its security properties and sketch a security reduction. ART has enjoyed widespread interest from industry, and we aim to turn it into an open standard for secure messaging. To that end, we have brought it to the IETF and formed a working group called Messaging Layer Security, with representatives from academia as well as Facebook, Google, Twitter, Wire, Cisco and more. Through MLS, we hope to bring ART's strong guarantees to practical implementations across industry. After concluding our analyses we pause for a moment, and start looking towards the future. We argue that for complex protocols like Signal and ART we are reaching the limits of computational methods, and that the future for their analysis lies with symbolic verification tools. To that end we return to the symbolic model and give a number of case studies, in each one showing how a traditional limitation of symbolic models can in fact be seen as a modelling artefact.
13
Burgon, Benjamin W. "Pwm: A Secure Webmail System Designed for Easy Adoption". BYU ScholarsArchive, 2014. https://scholarsarchive.byu.edu/etd/3896.
Pełny tekst źródłaStreszczenie:
None of the three largest webmail service providers (serving over 1 billion users) support end-to-end message encryption. Encrypted email has never seen mass adoption because it is prohibitive for non-experts to use. Private WebMail (Pwm) is our extension to popular webmail systems that lets users easily encrypt sensitive messages without having to first contact the recipient and share information. It is designed to spread quickly in a grassroots fashion so that a user receiving their first encrypted message can quickly and easily start using the system. This thesis describes the design and implementation of Pwm, then measures its usability through analysis and a user study.
14
Song, Yuanzheng. "Browser-Based Manual Encryption". BYU ScholarsArchive, 2014. https://scholarsarchive.byu.edu/etd/4235.
Pełny tekst źródłaStreszczenie:
Billions of web-based email and chat messages are sent over the Internet every day. However, very few service providers support end-to-end privacy protection. While providing security for these messages is technically feasible, usability remains a challenge in this field. Recent research attempts to hide security details like key management and encryption in order to make the system more usable. However usability studies demonstrated that hiding these details may confuse the user and contribute to mistakes (e.g., sending out an email in plaintext when the user thought it would be encrypted). In an effort to increase trust and eliminate mistakes, this thesis presents the design of a browser-based manual encryption mechanism that supports automatic key-management and manual encryption. It also describes the Message Protector (MP) prototype. An evaluations of MP is presented based on a user study conducted on the campus of BYU.
15
Monson, Tyler Jay. "Usable Secure Email Through Short-Lived Keys". BYU ScholarsArchive, 2017. https://scholarsarchive.byu.edu/etd/6568.
Pełny tekst źródłaStreszczenie:
Participants from recent secure email user studies have expressed a need to use secure email tools only a few times a year. At the same time, Internet users are expressing concerns over the permanence of personal information on the Internet. Support for short-lived keys has the potential to address both of these problems. However, the short-lived keys usability and security space is underdeveloped and unexplored. In this thesis, we present an exploration of the short-lived keys usability and security design space. We implement both a short-lived keys and a long-term keys secure email prototype. With these two prototypes, we conduct a within-subjects user study. Results from our study show that participants believe the short-lived keys prototype is more secure and more trusted. Participants also provide feedback on what they want in a system supporting short-lived keys. They also discuss how concerned they are about the permanence of their information on the Internet and on their devices.
16
Vaziripour, Elham. "Usable Security and Privacy for Secure Messaging Applications". BYU ScholarsArchive, 2018. https://scholarsarchive.byu.edu/etd/8830.
Pełny tekst źródłaStreszczenie:
The threat of government and corporate surveillance around the world, as well as the publicity surrounding major cybersecurity attacks, have increased interest in secure and private end-to-end communications. In response to this demand, numerous secure messaging applications have been developed in recent years. These applications have been welcomed and publically used not just by political activists and journalists but by everyday users as well. Most of these popular secure messaging applications are usable because they hide many of the details of how encryption is provided. The strength of the security properties of these applications relies on the authentication ceremony, wherein users validate the keys being used for encryption that is exchanged through the service providers. The validation process typically involves verifying the fingerprints of encryption keys to protect the communication from being intercepted.In this dissertation, we explore how to help users enhance the privacy of their communica- tions, with a particular focus on secure messaging applications. First, we explore whether secure messaging applications are meeting the security and privacy needs of their users, especially in countries that practice censorship and restrict civil liberties, including blocking access to social media and communication applications. Second, we studied existing popular secure messaging applications to explore how users interact with these applications and how well they are using the authentication ceremony during lab studies. Third, we applied design principles to improve the interfaces for the authentication ceremony, and also to help users find and perform the authentication ceremony faster. Forth, we applied the lessons from our interviews with participants in our user studies to help users comprehend the importance of authentication. As part of the effort, we developed an authentication ceremony using social media accounts to map key fingerprints to social features, pushing the ceremony to a more natural domain for users. We modified the Signal secure messaging application to include this social authentication ceremony and used a user study to compare this method to other common methods. We found that social authentication has some promising features, but that social media companies are too distrusted by users. Based on our results, we make several recommendations to improve the use of security and privacy features in secure messaging applications and outline areas for future work.
17
Ruoti, Scott. "Usable, Secure Content-Based Encryption on the Web". BYU ScholarsArchive, 2016. https://scholarsarchive.byu.edu/etd/6083.
Pełny tekst źródłaStreszczenie:
Users share private information on the web through a variety of applications, such as email, instant messaging, social media, and document sharing. Unfortunately, recent revelations have shown that not only is users' data at risk from hackers and malicious insiders, but also from government surveillance. This state of affairs motivates the need for users to be able to encrypt their online data.In this dissertation, we explore how to help users encrypt their online data, with a special focus on securing email. First, we explore the design principles that are necessary to create usable, secure email. As part of this exploration, we conduct eight usability studies of eleven different secure email tools including a total of 347 participants. Second, we develop a novel, paired-participant methodology that allows us to test whether a given secure email system can be adopted in a grassroots fashion. Third, we apply our discovered design principles to PGP-based secure email, and demonstrate that these principles are sufficient to create the first PGP-based system that is usable by novices. We have also begun applying the lessons learned from our secure email research more generally to content-based encryption on the web. As part of this effort, we develop MessageGuard, a platform for accelerating research into usable, content-based encryption. Using MessageGuard, we build and evaluate Private Facebook Chat (PFC), a secure instant messaging system that integrates with Facebook Chat. Results from our usability analysis of PFC provided initial evidence that our design principles are also important components to usable, content-based encryption on the Web.
18
Parrish, William J. Tovar Daniel R. "Tactical wireless networking in coalition environments : implementing an IEEE 802.20 wireless end-user network utilizing FLASH-OFDM to provide a secure mobile extension to existing WAN /". Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Sep%5FParrish.pdf.
Pełny tekst źródłaStreszczenie:
Thesis (M.S. in Information Technology Management)--Naval Postgraduate School, September 2005.Thesis Advisor(s): Alex Bordetsky. Includes bibliographical references (p. 113-115). Also available online.
19
Tovar, Daniel R. "Tactical wireless networking in coalition environments implementing an IEEE 802.20 wireless end-user network utilizing FLASH-OFDM to provide a secure mobile extension to existing WAN". Thesis, Monterey, California. Naval Postgraduate School, 2005. http://hdl.handle.net/10945/2077.
Pełny tekst źródłaStreszczenie:
This thesis will focus on the area of 802.20 wireless networking as a feasible "last mile" solution to wireless access in a tactical coalition environment and will be implemented into a series of experiments. Implementation will primarily utilize Flarion's FLASH OFDM (Fast, Low-Latency Access with Seamless Handoff Orthogonal Frequency Division Multiplexing). Current and future military and homeland security forces, conducting operations in a tactical environment, require instant access to data. Wireless data requires a reliable air-link resource anchored to a viable service platform. Flarion's FLASH-OFDM wireless air-link mimics the performance of a high-speed wireline environment. Through Flarion's Radio Router base station and mobile data terminal, a Radio Access Network is created. It connects directly to a standard IP Packet Data Network forming a wireless data network. Utilizing this network environment, this thesis intends to document the implementation of a limited objective experiment (LOE) in support of homeland security and the War on Terrorism (WOT), specifically, the testing of an IEEE 802.20 network enabling US and key foreign partners to integrate mobile wireless local area network (WLAN) technologies into a surveillance and target acquisition network program.
20
Pearce, Michael Bruce. "Development and evaluation of a secure web gateway with messaging functionality : utilizing existing ICAP and open-source tools to notify and protect end users from Internet security threats". Thesis, University of Canterbury. Computer Science and Software Engineering, 2010. http://hdl.handle.net/10092/5457.
Pełny tekst źródłaStreszczenie:
Secure web gateways aim to protect end user systems against web based threats. Many
proprietary commercial systems exist. However, their mechanisms of operation are not generally
publicly known. This project undertook development and evaluation of an open source and
standards based secure web gateway. The proof of concept system developed uses a combination
of open source software (including the Greasyspoon ICAP Server, Squid HTTP proxy, and Clam
Antivirus) and Java modules installed on the ICAP server to perform various security tasks that
range from simple (such as passive content insertion) to more advanced (such as active content
alteration).
The makeup of the proof of concept system and the evaluation methodology for both effectiveness
and performance are discussed. The effectiveness was tested using comparative analysis
of groups of self-browsing high interaction client honey pots (employing a variety of security
measures) and recording different system alteration rates. Performance was tested across a wide
range of variables to determine the failure conditions and optimal set up for the components
used.
The system developed met the majority of the goals set, and results from testing indicate
that there was an improvement in infection rates over unprotected systems. Performance levels
attained were suitable for small scale deployments, but optimization is necessary for larger scale
deployments.
21
Li, Jizhizi. "End-to-end Animal Matting". Thesis, University of Sydney, 2020. https://hdl.handle.net/2123/22897.
Pełny tekst źródłaStreszczenie:
Image matting is a widely studied low-level vision problem that aims to provide a detailed foreground alpha matte from a single image, benefiting a wide range of downstream applications. However, most of the prevalent matting models are requiring extra manual intervention such as trimap or scribble. Besides, the lack of large-scale real-world annotated data has also caused poor generalizability in learned deep models. In this paper, we propose a novel end-to-end matting method called GFM along with a real-world, high-quality, category-wised animal matting dataset called AM-2k to address the above issues. The proposed end-to-end matting model GFM is short for Glance and Focus Matting Network, aims to conduct simultaneously trimap generation and matting by sharing one encoder and going through different decoders in separate branches. The design of GFM can help extract local and global information within one stage training process. Without the need for any extra input, GFM surpasses the previous state-of-the-art in performance on all evaluation metrics. Our proposed AM-2k consists of 20 categories mammals animals and 200 high-quality image for each category. We manually generate accurate mattes for each of them. Based on this dataset, we also set up three evaluation tracks, MIX-Track, DA-Track and CW-Track which can benefit the research on end-to-end matting, trimap-based matting, domain adaptation for matting and few shot learning. Extensive experiments and comprehensive analysis are performed on the AM-2k dataset to validate the effectiveness of GFM and its superiority over representative state-of-the-art methods. Various visual results can be found in Chapter 4 and Appendix.
22
Rangarajan, Vinod K. (Vinod Kashyap) 1975. "End-to-end connectivity across firewalls". Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47623.
Pełny tekst źródłaStreszczenie:
Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.Includes bibliographical references (leaves 53-54).
by Vinod K. Rangarajan.
S.B.and M.Eng.
23
Chan, William. "End-to-End Speech Recognition Models". Research Showcase @ CMU, 2016. http://repository.cmu.edu/dissertations/723.
Pełny tekst źródłaStreszczenie:
For the past few decades, the bane of Automatic Speech Recognition (ASR) systems have been phonemes and Hidden Markov Models (HMMs). HMMs assume conditional indepen-dence between observations, and the reliance on explicit phonetic representations requires expensive handcrafted pronunciation dictionaries. Learning is often via detached proxy problems, and there especially exists a disconnect between acoustic model performance and actual speech recognition performance. Connectionist Temporal Classification (CTC) character models were recently proposed attempts to solve some of these issues, namely jointly learning the pronunciation model and acoustic model. However, HMM and CTC models still suffer from conditional independence assumptions and must rely heavily on language models during decoding. In this thesis, we question the traditional paradigm of ASR and highlight the limitations of HMM and CTC models. We propose a novel approach to ASR with neural attention models and we directly optimize speech transcriptions. Our proposed method is not only an end-to- end trained system but also an end-to-end model. The end-to-end model jointly learns all the traditional components of a speech recognition system: the pronunciation model, acoustic model and language model. Our model can directly emit English/Chinese characters or even word pieces given the audio signal. There is no need for explicit phonetic representations, intermediate heuristic loss functions or conditional independence assumptions. We demonstrate our end-to-end speech recognition model on various ASR tasks. We show competitive results compared to a state-of-the-art HMM based system on the Google voice search task. We demonstrate an online end-to-end Chinese Mandarin model and show how to jointly optimize the Pinyin transcriptions during training. Finally, we also show state-of-the-art results on the Wall Street Journal ASR task compared to other end-to-end models.
24
Le, BeEm V. "Distributed and end-to-end testing". Thesis, Monterey, California : Naval Postgraduate School, 2009. http://edocs.nps.edu/npspubs/scholarly/theses/2009/Dec/09Dec%5FLe.pdf.
Pełny tekst źródłaStreszczenie:
Thesis (M.S. in Systems Engineering Management)--Naval Postgraduate School, December 2009.Thesis Advisor: Huynh, Thomas V. Second Reader: Barrera, Raymond. "December 2009." Description based on title screen as viewed on January 26, 2010. Author(s) subject terms: distributed, End-to-End, combat systems, C4I Systems, pay-per-test, Goal Programming (GP), Distributed Engineering Plant (DEP), E2E Lab, PMW, PEO C4I, NAVSEA, SPAWAR. Includes bibliographical references (p. 53-54). Also available in print.
25
Chaudry, Kashif, i Elma Karadza. "End-to-End Application Billing in 3G". Thesis, Linköping University, Department of Science and Technology, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1654.
Pełny tekst źródłaStreszczenie:
We have 3G on the doorstep but nothing seems to attract ordinary people to this technology. To attract the mass market the telecom industry must show something beyond high bit rates. They must show how ordinary people can take advantage of this new technology. This is done by showing the possibilities of the new technology and by demonstrating applications that it will handle. The telecom industry must convince the telecom operators to invest in this technology and the only thing that matters to them is how much revenue they can make by adopting the upcoming technology.
To convince the operators industry must show how the operators can charge for the new types of applications that will be introduced soon. This is the main reason why this Master's Thesis has been conducted. The purpose of this thesis is to provide a demonstration to Ericsson's 3G lab in Katrineholm in the form of an IP application with a billing solution. This thesis describes the migration from 1G to 3G and examines existing and future billing strategies as well.
The IP application is an application that uses progressive streaming in order to stream multimedia content to a PDA connected to a 3G phone. This application is platform independent because it is placed on leading Web servers, Apache and IIS.
The billing application consists of a number of steps. The first step is logging, which is performed by the Web server on which the streaming application is placed. The second step, processing and billing, is performed in the BGw, which is Ericsson's mediation tool, and the SQL server.The third step is displaying the bill, which is done by using ASP to create an active HTML page.
26
Holmström, Maria. "End-to-end monitoring of mobile services". Thesis, Linköping University, Department of Electrical Engineering, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1671.
Pełny tekst źródłaStreszczenie:
The growing market of mobile services through SMS, MMS, WAP and soon also for 3G protocols, requires efficient test methods to ensure that the customers get what they are paying for and in a reasonable time. Preferably, these tests should be done automatically and come as close to real conditions as possible. It would be valuable to be able to make tests from end to end, i.e. requesting and receiving the mobile services on a real mobile phone and combine that with a system that controls and evaluates the tests.
This thesis presents a solution to how the part of an end-to-end monitoring system for mobile services that runs on a mobile phone can be designed and implemented. The phone is made to interpret commands from a control process on a remote server and turn them into mobile service requests in a proper format (e.g. SMS or MMS). When it receives the reply from a mobile service provider, it forwards the relevant result information to the control process.
The monitoring system is based on Symbian OS, an operating system developed to suit handheld devices like mobile phones. The current implementation supports tests for SMS and MMS services.
The system is to be used by mobile operators or other providers of mobile services, which want to test and monitor their services.
27
Lazar, Mihai. "Empirical modeling of end-to-end jitter". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape4/PQDD_0019/MQ58472.pdf.
Pełny tekst źródła
28
Brown, Ian. "End-to-end security in active networks". Thesis, University College London (University of London), 2001. http://discovery.ucl.ac.uk/3882/.
Pełny tekst źródłaStreszczenie:
Active network solutions have been proposed to many of the problems caused by the increasing heterogeneity of the Internet. These ystems allow nodes within the network to process data passing through in several ways. Allowing code from various sources to run on routers introduces numerous security concerns that have been addressed by research into safe languages, restricted execution environments, and other related areas. But little attention has been paid to an even more critical question: the effect on end-to-end security of active flow manipulation. This thesis first examines the threat model implicit in active networks. It develops a framework of security protocols in use at various layers of the networking stack, and their utility to multimedia transport and flow processing, and asks if it is reasonable to give active routers access to the plaintext of these flows. After considering the various security problem introduced, such as vulnerability to attacks on intermediaries or coercion, it concludes not. We then ask if active network systems can be built that maintain end-to-end security without seriously degrading the functionality they provide. We describe the design and analysis of three such protocols: a distributed packet filtering system that can be used to adjust multimedia bandwidth requirements and defend against denial-of-service attacks; an efficient composition of link and transport-layer reliability mechanisms that increases the performance of TCP over lossy wireless links; and a distributed watermarking servicethat can efficiently deliver media flows marked with the identity of their recipients. In all three cases, similar functionality is provided to designs that do not maintain end-to-end security. Finally, we reconsider traditional end-to-end arguments in both networking and security, and show that they have continuing importance for Internet design. Our watermarking work adds the concept of splitting trust throughout a network to that model; we suggest further applications of this idea.
29
Maaz, Khan. "EVASIVE INTERNET PROTOCOL: END TO END PERFORMANCE". Case Western Reserve University School of Graduate Studies / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=case1308179859.
Pełny tekst źródła
30
Zhang, Da. "End to end testing using integrated tools". The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1338300180.
Pełny tekst źródła
31
Kayayurt, Barış Tuğlular Tuğkan. "End-to-end security for mobile devices/". [s.l.]: [s.n.], 2004. http://library.iyte.edu.tr/tezler/master/bilgisayaryazilimi/T000492.pdf.
Pełny tekst źródła
32
Lowden, Mia Rochelle Ahmed Shawn. "Genesis of end-to-end chromosome fusions". Chapel Hill, N.C. : University of North Carolina at Chapel Hill, 2008. http://dc.lib.unc.edu/u?/etd,2227.
Pełny tekst źródłaStreszczenie:
Thesis (Ph. D.)--University of North Carolina at Chapel Hill, 2008.Title from electronic title page (viewed Jun. 26, 2009). "... in partial fulfillment of requirements for the degree of Doctor of Philosophy in the Department of Biology." Discipline: Biology; Department/School: Biology.
33
Wigington, Curtis Michael. "End-to-End Full-Page Handwriting Recognition". BYU ScholarsArchive, 2018. https://scholarsarchive.byu.edu/etd/7099.
Pełny tekst źródłaStreszczenie:
Despite decades of research, offline handwriting recognition (HWR) of historical documents remains a challenging problem, which if solved could greatly improve the searchability of online cultural heritage archives. Historical documents are plagued with noise, degradation, ink bleed-through, overlapping strokes, variation in slope and slant of the writing, and inconsistent layouts. Often the documents in a collection have been written by thousands of authors, all of whom have significantly different writing styles. In order to better capture the variations in writing styles we introduce a novel data augmentation technique. This methods achieves state-of-the-art results on modern datasets written in English and French and a historical dataset written in German.HWR models are often limited by the accuracy of the preceding steps of text detection and segmentation.Motivated by this, we present a deep learning model that jointly learns text detection, segmentation, and recognition using mostly images without detection or segmentation annotations.Our Start, Follow, Read (SFR) model is composed of a Region Proposal Network to find the start position of handwriting lines, a novel line follower network that incrementally follows and preprocesses lines of (perhaps curved) handwriting into dewarped images, and a CNN-LSTM network to read the characters. SFR exceeds the performance of the winner of the ICDAR2017 handwriting recognition competition, even when not using the provided competition region annotations.
34
Guerrero, Santander Cesar. "End-to-end available bandwidth estimation and monitoring". [Tampa, Fla.] : University of South Florida, 2009. http://digital.lib.usf.edu/?e14.2863.
Pełny tekst źródła
35
Agarwala, Sandip. "System Support for End-to-End Performance Management". Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/16171.
Pełny tekst źródłaStreszczenie:
This dissertation introduces, implements, and evaluates the novel concept of
"Service Paths", which are system-level abstractions that capture and describe
the dynamic dependencies between the different components of a distributed
enterprise application. Service paths are dynamic because they capture the
natural interactions between application services dynamically composed to offer
some desired end user functionality. Service paths are distributed because such
sets of services run on networked machines in distributed enterprise data
centers. Service paths cross multiple levels of abstraction because they link
end user application components like web browsers with system services like
http providing communications with embedded services like hardware-supported
data encryption. Service paths are system-level abstractions that are created
without end user, application, or middleware input, but despite these facts,
they are able to capture application-relevant performance metrics, including
end-to-end latencies for client requests and the contributions to these
latencies from application-level processes and from software/hardware resources
like protocol stacks or network devices.
Beyond conceiving of service paths and demonstrating their utility, this thesis
makes three concrete technical contributions. First, we propose a set of signal
analysis techniques called ``E2Eprof' that identify the service paths taken
by different request classes across a distributed IT infrastructure and
the time spent in each such path. It uses a novel algorithm called ``pathmap'
that computes the correlation between the message arrival and departure
timestamps at each participating node and detect dependencies among them. A
second contribution is a system-level monitoring toolkit called ``SysProf',
which captures monitoring information at different levels of granularity,
ranging from tracking the system-level activities triggered by a single system
call, to capturing the client-server interactions associated with a service
paths, to characterizing the server resources consumed by sets of clients or
client behaviors.
The third contribution of the thesis is a publish-subscribe based monitoring
data delivery framework called ``QMON'. QMON offers high levels of
predictability for service delivery and supports utility-aware monitoring
while also able to differentiate between different levels of service
for monitoring, corresponding to the different classes of SLAs maintained for
applications.
36
Øztarman, Jo Mehmet Sollihagen. "End-to-End Data Protection of SMS Messages". Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for telematikk, 2011. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-15075.
Pełny tekst źródłaStreszczenie:
Short Message Service (SMS) has become a very commonly used service. It does not only work as a substitute for voice telephony, but is also used for automated services. Some of these service are related to security issues like SMS banking, or one time passwords, even though SMS messages can be spoofed or eavesdropped.We propose a design where we add security to SMS by making an easily configurable module that utilizes a fast cryptographic scheme called Elliptic Curve Signcryption. To prove our concept, we implement an SMS client for Android smart phones that utilizes our security module and serves end-to-end data protection of SMS messages with the same security level as Top Secret content.
37
Jin, Zhiqun, i Shijie Zhu. "END-TO-END TIMING ANALYSIS OF TASK-CHAINS". Thesis, Mälardalens högskola, Inbyggda system, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-36694.
Pełny tekst źródłaStreszczenie:
Many automotive systems are real-time systems, which means that not only correct operationsbut also appropriate timings are their main requirements. Considering the in uence that end-to-end delay might have on the performance of the systems, the calculation of it is of necessity.Abundant techniques have actually been proposed, and some of them have already been applied intopractical systems. In spite of this, some further work still needs to be done. The target of thisthesis is to evaluate and compare two end-to-end timing analysis methods from dierent aspectssuch as data age, consumption time, and then decide which method is a prior choice for end-to-end timing analysis. The experiments can be divided into three blocks, system generation andend-to-end delay calculation by two methods respectively. The experiments focus on two kinds ofperformance parameters, data age and the consumption time that these two methods cost duringtheir execution. By changing the system generating parameters like task number and periods, thechanges of performances of the two methods are analyzed. The performances of the two dierentmethods are also compared when they are applied into the same automotive systems. According tothe results of the experiments, the second method can calculate more accurate data age and consumeless time than the rst method does.
38
Zhiqun, Jin, i Zhu Shijie. "End-to-end Timing Analysis of Task-Chains". Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-36751.
Pełny tekst źródłaStreszczenie:
Many automotive systems are real-time systems, which means that not only correct operationsbut also appropriate timings are their main requirements. Considering the in uence that end-to-end delay might have on the performance of the systems, the calculation of it is of necessity.Abundant techniques have actually been proposed, and some of them have already been applied intopractical systems. In spite of this, some further work still needs to be done. The target of thisthesis is to evaluate and compare two end-to-end timing analysis methods from dierent aspectssuch as data age, consumption time, and then decide which method is a prior choice for end-to-end timing analysis. The experiments can be divided into three blocks, system generation andend-to-end delay calculation by two methods respectively. The experiments focus on two kinds ofperformance parameters, data age and the consumption time that these two methods cost duringtheir execution. By changing the system generating parameters like task number and periods, thechanges of performances of the two methods are analyzed. The performances of the two dierentmethods are also compared when they are applied into the same automotive systems. According tothe results of the experiments, the second method can calculate more accurate data age and consumeless time than the rst method does.
39
Strigér, Amanda. "End-to-End Trainable Chatbot for Restaurant Recommendations". Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-213982.
Pełny tekst źródłaStreszczenie:
Task-oriented chatbots can be used to automate a specific task, such as finding a restaurant and making a reservation. Implementing such a conversational system can be difficult, requiring domain knowledge and handcrafted rules. The focus of this thesis was to evaluate the possibility of using a neural network-based model to create an end-to-end trainable chatbot that can automate a restaurant reservation service. For this purpose, a sequence-to-sequence model was implemented and trained on dialog data. The strengths and limitations of the system were evaluated and the prediction accuracy of the system was compared against several baselines. With our relatively simple model, we were able to achieve results comparable to the most advanced baseline model. The evaluation has shown some promising strengths of the system but also significant flaws that cannot be overlooked. The current model cannot be used as a standalone system to successfully conduct full conversations with the goal of making a restaurant reservation. The review has, however, contributed with a thorough examination of the current system, and shown where future work ought to be focused.Chatbotar kan användas för att automatisera enkla uppgifter, som att hitta en restaurang och boka ett bord. Att skapa ett sådant konversationssystem kan dock vara svårt, tidskrävande, och kräva mycket domänkunskap. I denna uppsats undersöks om det är möjligt att använda ett neuralt nätverk för att skapa en chatbot som kan lära sig att automatisera en tjänst som hjälper användaren hitta en restaurang och boka ett bord. För att undersöka detta implementerades en så kallad ``sequence-to-sequence''-modell som sedan tränades på domänspecifik dialogdata. Systemets styrkor och svagheter utvärderades och dess förmåga att generera korrekta svar jämfördes med flera andra modeller. Vår relativt enkla modell uppnådde liknande resultat som den mest avancerade av de andra modellerna. Resultaten visar modellens styrkor, men påvisar även signifikanta brister. Dessa brister gör att systemet, i sig självt, inte kan användas för att skapa en chatbot som kan hjälpa en användare att hitta en passande restaurang. Utvärderingen har dock bidragit med en grundlig undersökning av vilka fel som görs, vilket kan underlätta framtida arbete inom området.
40
Kanuparthy, Partha V. "End-to-end inference of internet performance problems". Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45938.
Pełny tekst źródłaStreszczenie:
Inference, measurement and estimation of network path properties is a fundamental problem in distributed systems and networking. We consider a specific subclass of problems which do not require special support from the hardware or software, deployment of special devices or data from the network. Network inference is a challenging problem since Internet paths can have complex and heterogeneous configurations.
Inference enables end users to understand and troubleshoot their connectivity and verify their service agreements; it has policy implications from network neutrality to broadband performance; and it empowers applications and services to adapt to network paths to improve user quality of experience. In this dissertation we develop end-to-end user-level methods, tools and services for network inference.
Our contributions are as follows. We show that domain knowledge-based methods can be used to infer performance of different types of networks, containing wired and wireless links, and ranging from local area to inter-domain networks. We develop methods to infer network properties:
1. Traffic discrimination (DiffProbe),
2. Traffic shapers and policers (ShaperProbe), and
3. Shared links among multiple paths (Spectral Probing).
We develop methods to understand network performance:
1. Diagnose wireless performance pathologies (WLAN-probe), and
2. Diagnose wide-area performance pathologies (Pythia).
Among our contributions: We have provided ShaperProbe as a public service and it has received over 1.5 million runs from residential and commercial users, and is used to check service level agreements by thousands of residential broadband users a day. The Federal Communications Commission (FCC) has recognized DiffProbe and ShaperProbe with the best research award in the Open Internet Apps Challenge in 2011. We have written an open source performance diagnosis system, Pythia, and it is being deployed in ISPs such as the US Department of Energy ESnet in wide-area inter-domain settings. The contributions of this dissertation enable Internet transparency, performance troubleshooting and improving distributed systems performance.
41
Costa, M. "End-to-end containment of internet worm epidemics". Thesis, University of Cambridge, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.598013.
Pełny tekst źródłaStreszczenie:
Worms – programs that self-replicate automatically over computer networks – are a serious threat to hosts connected to the Internet. They infect hosts by exploiting software vulnerabilities, and they can use their victims for many malicious activities. Past outbreaks show that worms can spread too fast for humans to respond, hence worm containment must be automatic. We propose Vigilante: a new end-to-end architecture to contain worms automatically. In Vigilante, hosts detect worms by instrumenting vulnerable programs to analyze infection attempts. We introduce dynamic data-flow analysis: a broad-coverage host-based algorithm that can detect unknown worms, by tracking the flow of data from network messages, and disallowing unsafe uses of that data. We also show how to integrate other host-based detection mechanisms into the Vigilante architecture. Upon detection, hosts generate self-certifying alerts (SCAs), a new type of security alert that can be inexpensively verified by any vulnerable host. Using SCAs, hosts can cooperate to contain an outbreak, without having to trust each other. Vigilante broadcasts SCAs over an overlay network that propagates alerts rapidly and resiliently. Hosts receiving an SCA protect themselves by generating filters with vulnerability condition slicing: an algorithm that performs dynamic analysis of the vulnerable program to identify control-flow conditions that lead to successful attacks. These filters block the worm attack, including all mutations that follow the execution path identified by the SCA, while introducing a negligible performance overhead. Our results show that Vigilante can contain fast spreading worms that exploit unknown vulnerabilities without false positives. Vigilante does not require any changes to hardware, compilers, operating systems or the source code of vulnerable programs; therefore, it can be used to protect software as it exists today in binary form.
42
Mauthe, Andreas Ulrich. "End-to-end support for multimedia multipeer communications". Thesis, Lancaster University, 1998. http://eprints.lancs.ac.uk/11590/.
Pełny tekst źródła
43
Amini, Alexander Andre. "Robust end-to-end learning for autonomous vehicles". Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/118031.
Pełny tekst źródłaStreszczenie:
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.Cataloged from PDF version of thesis.
Includes bibliographical references (pages 59-64).
Deep learning has been successfully applied to "end-to-end" learning of the autonomous driving task, where a deep neural network learns to predict steering control commands from camera data input. While these works support reactionary control, the representation learned is not usable for higher-level decision making required for autonomous navigation. This thesis tackles the problem of learning a representation to predict a continuous control probability distribution, and thus steering control options and bounds for those options, which can be used for autonomous navigation. Each mode in the learned distribution encodes a possible macro-action that the system could execute at that instant, and the covariances of the modes place bounds on safe steering control values. Our approach has the added advantage of being trained solely on unlabeled data collected from inexpensive cameras. In addition to uncertainty estimates computed directly by our model, we add robustness by developing a novel stochastic dropout sampling technique for estimating the inherent confidence of the model's output. We install the relevant processing hardware pipeline on-board a full-scale autonomous vehicle and integrate our learning algorithms for real-time control inference. Finally, we evaluate our models on a challenging dataset containing a wide variety of driving conditions, and show that the algorithms developed as part of this thesis are capable of successfully controlling the vehicle on real roads and even under a parallel autonomy paradigm wherein control is shared between human and robot.
by Alexander Andre Amini.
S.M.
44
Andersen, David G. (David Godbe) 1975. "Improving end-to-end availability using overlay networks". Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/30159.
Pełny tekst źródłaStreszczenie:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, February 2005.Includes bibliographical references (p. 139-150).
The end-to-end availability of Internet services is between two and three orders of magnitude worse than other important engineered systems, including the US airline system, the 911 emergency response system, and the US public telephone system. This dissertation explores three systems designed to mask Internet failures, and, through a study of three years of data collected on a 31-site testbed, why these failures happen and how effectively they can be masked. A core aspect of many of the failures that interrupt end-to-end communication is that they fall outside the expected domain of well-behaved network failures. Many traditional techniques cope with link and router failures; as a result, the remaining failures are those caused by software and hardware bugs, misconfiguration, malice, or the inability of current routing systems to cope with persistent congestion.The effects of these failures are exacerbated because Internet services depend upon the proper functioning of many components-wide-area routing, access links, the domain name system, and the servers themselves-and a failure in any of them can prove disastrous to the proper functioning of the service. This dissertation describes three complementary systems to increase Internet availability in the face of such failures. Each system builds upon the idea of an overlay network, a network created dynamically between a group of cooperating Internet hosts. The first two systems, Resilient Overlay Networks (RON) and Multi-homed Overlay Networks (MONET) determine whether the Internet path between two hosts is working on an end-to-end basis. Both systems exploit the considerable redundancy available in the underlying Internet to find failure-disjoint paths between nodes, and forward traffic along a working path. RON is able to avoid 50% of the Internet outages that interrupt communication between a small group of communicating nodes.MONET is more aggressive, combining an overlay network of Web proxies with explicitly engineered redundant links to the Internet to also mask client access link failures. Eighteen months of measurements from a six-site deployment of MONET show that it increases a client's ability to access working Web sites by nearly an order of magnitude. Where RON and MONET combat accidental failures, the Mayday system guards against denial- of-service attacks by surrounding a vulnerable Internet server with a ring of filtering routers. Mayday then uses a set of overlay nodes to act as mediators between the service and its clients, permitting only properly authenticated traffic to reach the server.
by David Godbe Andersen.
Ph.D.
45
Rodittis, Kathy, i Alan Cooke. "Next Generation End to End Avionics Bus Monitoring". International Foundation for Telemetering, 2013. http://hdl.handle.net/10150/579512.
Pełny tekst źródłaStreszczenie:
ITC/USA 2013 Conference Proceedings / The Forty-Ninth Annual International Telemetering Conference and Technical Exhibition / October 21-24, 2013 / Bally's Hotel & Convention Center, Las Vegas, NVWith the advent of networked based data acquisition systems comes the opportunity to acquire, transmit and store potentially very large volumes of data. Despite this, and the increased size of the data acquisition networks, the use of tightly integrated hardware, and setup and analysis software enable the FTI engineer to save time and increase productivity. This paper outlines how the use of innovative bus packetizer technology and the close integration of FTI software can simplify this process. The paper describes how packetizer technology is used to acquire data from avionics buses, and how it packages this data in a format that is optimized for network based systems. The paper further describes how software can simplify the process of configuring avionics bus monitors in addition to automating and optimizing the transport of data from various nodes in the acquisition network for transmission to either network recorders or via a telemetry link.
46
Moodie, Myron L., Maria S. Araujo, Thomas B. Grace, William A. Malatesta i Ben A. Abbott. "iNET Standards Validation: End-to-End Performance Assessment". International Foundation for Telemetering, 2010. http://hdl.handle.net/10150/604282.
Pełny tekst źródłaStreszczenie:
ITC/USA 2010 Conference Proceedings / The Forty-Sixth Annual International Telemetering Conference and Technical Exhibition / October 25-28, 2010 / Town and Country Resort & Convention Center, San Diego, CaliforniaThe integrated Network-Enhanced Telemetry (iNET) project has developed standards for network-based telemetry systems. While these standards are based largely on the existing body of commercial networking protocols, the Telemetry Network System (TmNS) has more stringent performance requirements in the areas of latency, throughput, operation over constrained links, and quality of service (QoS) than typical networked applications. A variety of initial evaluations were undertaken to exercise the interfaces of the current standards and determine real-world performance. The core end-to-end performance initial evaluations focus collectively on the movement of telemetry data through the TmNS. These initial evaluations addressed two areas: end-to-end data delivery and parametric data extraction. This paper presents the approach taken by these ongoing efforts and provides initial results. The latest results will be presented at ITC 2010.
47
del, Castillo Iglesias Daniel. "End-to-end Learning for Singing-Language Identification". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-277837.
Pełny tekst źródłaStreszczenie:
Singing-language identification (SLID) consists in identifying the language of the sung lyrics directly from a given music recording. This task is of spe- cial interest to music-streaming businesses who benefit from music localiza- tion applications. However, language is a complex semantic quality of music recordings, making the finding and exploiting of its characteristic features ex- tremely challenging. In recent years, most Music Information Retrieval (MIR) research efforts have been directed to problems that are not related to language, and most of the progress in speech recognition methods stay far from musical applications. This works investigates the SLID problem, its challenges and limitations, with the aim of finding a novel solution that effectively leverages the power of deep learning architectures and a relatively large-scale private dataset. As part of the dataset pre-processing, a novel method for identifying the high-level structure of songs is proposed. As the classifier model, a Temporal Convolu- tional Network (TCN) is trained and evaluated on music recordings belonging to seven of the most prominent languages in the global music market. Although results show much lower performance with respect to the current state-of-the-art, a thorough discussion is realized with the purpose of explor- ing the limitations of SLID, identifying the causes of the poor performance, and expanding the current knowledge about the SLID problem. Future im- provements and lines of work are delineated, attempting to stimulate further research in this direction.Sång-språkidentifiering (SLID) består av att identifiera språket av de sjung- ade texterna direkt från en viss musikinspelning. Denna uppgift är av sär- skilt intresse för musikströmmande företag som drar nytta av applikationer för musiklokalisering. Däremot, är språk en komplex semantisk kvalitet av musikinspelningar, vilket gör upptäckten och utnyttjandet av dess karakteris- tiska funktioner extremt utmanande. Under de senaste åren har de flesta MIR- forskningsinsatser riktats mot problem som inte är relaterade till språk, och de flesta av framstegen med metoder för språkidentifiering förblir långt ifrån musikaliska applikationer. Detta arbete undersöker SLID-problemet, dess ut- maningar och begränsningar, med syftet att hitta en ny lösning som effektivt ut- nyttjar kraften hos djupa inlärningsarkitekturer och en relativt storskalig privat datasats. Som en del av datasatsförbehandlingen föreslås en ny metod för att identifiera högnivåstrukturen av låtar. Som klassificeringsmodell utbildas och utvärderas ett Temporal Convolutional Network (TCN) på musikinspelningar som hör till sju av de mest framstående språk på den globala musikmarkna- den. Även om resultaten visar mycket lägre prestation med avseende på den nuvarande bästa-möjliga-teknik, realiseras en grundlig diskussion med syftet att utforska begränsningarna för SLID, orsakerna till dålig prestation identi- fieras och den nuvarande kunskapen om SLID problemet utökas. Framtida förbättringar och arbetslinjer a gränsas med avseende att stimulera ytterligare forskning mot denna riktning.
48
Olsson, Anton, i Felix Rosberg. "Domain Transfer for End-to-end Reinforcement Learning". Thesis, Högskolan i Halmstad, Akademin för informationsteknologi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-43042.
Pełny tekst źródłaStreszczenie:
In this master thesis project a LiDAR-based, depth image-based and semantic segmentation image-based reinforcement learning agent is investigated and compared forlearning in simulation and performing in real-time. The project utilize the Deep Deterministic Policy Gradient architecture for learning continuous actions and was designed to control a RC car. One of the first project to deploy an agent in a real scenario after training in a similar simulation. The project demonstrated that with a proper reward function and by tuning driving parameters such as restricting steering, maximum velocity, minimum velocity and performing input data scaling a LiDAR-based agent could drive indefinitely on a simple but completely unseen track in real-time.
49
Ibrahim, Ahmed Sobhy Elnady. "End-To-End Text Detection Using Deep Learning". Diss., Virginia Tech, 2017. http://hdl.handle.net/10919/81277.
Pełny tekst źródłaStreszczenie:
Text detection in the wild is the problem of locating text in images of everyday scenes. It is a challenging problem due to the complexity of everyday scenes. This problem possesses a great importance for many trending applications, such as self-driving cars.
Previous research in text detection has been dominated by multi-stage sequential approaches which suffer from many limitations including error propagation from one stage to the next.
Another line of work is the use of deep learning techniques. Some of the deep methods used for text detection are box detection models and fully convolutional models. Box detection models suffer from the nature of the annotations, which may be too coarse to provide detailed supervision. Fully convolutional models learn to generate pixel-wise maps that represent the location of text instances in the input image. These models suffer from the inability to create accurate word level annotations without heavy post processing.
To overcome these aforementioned problems we propose a novel end-to-end system based on a mix of novel deep learning techniques. The proposed system consists of an attention model, based on a new deep architecture proposed in this dissertation, followed by a deep network based on Faster-RCNN. The attention model produces a high-resolution map that indicates likely locations of text instances. A novel aspect of the system is an early fusion step that merges the attention map directly with the input image prior to word-box prediction. This approach suppresses but does not eliminate contextual information from consideration. Progressively larger models were trained in 3 separate phases. The resulting system has demonstrated an ability to detect text under difficult conditions related to illumination, resolution, and legibility.
The system has exceeded the state of the art on the ICDAR 2013 and COCO-Text benchmarks with F-measure values of 0.875 and 0.533, respectively.Ph. D.
50
Pritchard, Adaleigh Elizabeth. "Modeling End-to-End Annealing of Intermediate Filaments". The Ohio State University, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=osu1397743583.
Pełny tekst źródła