Relevant bibliographies by topics / End-To-End / Dissertations / Theses
To see the other types of publications on this topic, follow the link: End-To-End.

Dissertations / Theses on the topic 'End-To-End'

Author: Grafiati
Published: 4 June 2021
Last updated: 1 April 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'End-To-End.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Li, Jizhizi. "End-to-end Animal Matting." Thesis, University of Sydney, 2020. https://hdl.handle.net/2123/22897.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
2

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
3

Chan, William. "End-to-End Speech Recognition Models." Research Showcase @ CMU, 2016. http://repository.cmu.edu/dissertations/723.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
5

Chaudry, Kashif, and 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.

Full text
Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles
6

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.

Full text
Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles
7

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Brown, Ian. "End-to-end security in active networks." Thesis, University College London (University of London), 2001. http://discovery.ucl.ac.uk/3882/.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
9

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Da. "End to end testing using integrated tools." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1338300180.

Full text
APA, Harvard, Vancouver, ISO, and other styles
11

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
13

Wigington, Curtis Michael. "End-to-End Full-Page Handwriting Recognition." BYU ScholarsArchive, 2018. https://scholarsarchive.byu.edu/etd/7099.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
14

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Agarwala, Sandip. "System Support for End-to-End Performance Management." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/16171.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
16

Ø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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
17

Jin, Zhiqun, and 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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
18

Zhiqun, Jin, and 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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
19

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
20

Kanuparthy, Partha V. "End-to-end inference of internet performance problems." Diss., Georgia Institute of Technology, 2012. http://hdl.handle.net/1853/45938.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
21

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
22

Mauthe, Andreas Ulrich. "End-to-end support for multimedia multipeer communications." Thesis, Lancaster University, 1998. http://eprints.lancs.ac.uk/11590/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Amini, Alexander Andre. "Robust end-to-end learning for autonomous vehicles." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/118031.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
24

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
25

Rodittis, Kathy, and Alan Cooke. "Next Generation End to End Avionics Bus Monitoring." International Foundation for Telemetering, 2013. http://hdl.handle.net/10150/579512.

Full text
Abstract:
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, NV
With 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.
APA, Harvard, Vancouver, ISO, and other styles
26

Moodie, Myron L., Maria S. Araujo, Thomas B. Grace, William A. Malatesta, and Ben A. Abbott. "iNET Standards Validation: End-to-End Performance Assessment." International Foundation for Telemetering, 2010. http://hdl.handle.net/10150/604282.

Full text
Abstract:
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, California
The 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.
APA, Harvard, Vancouver, ISO, and other styles
27

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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
28

Olsson, Anton, and 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.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
29

Ibrahim, Ahmed Sobhy Elnady. "End-To-End Text Detection Using Deep Learning." Diss., Virginia Tech, 2017. http://hdl.handle.net/10919/81277.

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
30

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
31

Ho, Sing Wang. "Improving end-to-end Internet performance by detouring." Thesis, Imperial College London, 2012. http://hdl.handle.net/10044/1/10568.

Full text
Abstract:
The Internet provides a best-effort service, which gives a robust fault-tolerant network. However, the performance of the paths found in regular Internet routing is suboptimal. As a result, applications rarely achieve all the benefits that the Internet can provide. The problem is made more difficult because the Internet is formed of competing ISPs which have little incentives to reveal information about the performance of Internet paths. As a result, the Internet is sometimes referred as a ‘black-box’. Detouring uses routing overlay networks to find alternative paths (or detour paths) that can improve reliability, latency and bandwidth. Previous work has shown detouring can improve the Internet. However, one important issue remains—how can these detour paths be found without conducting large-scale measurements? In this thesis, we describe practical methods for discovering detour paths to improve specific performance metrics that are scalable to the Internet. Particularly we concentrate our efforts on two metrics, latency and bandwidth, which are arguably the two most important performance metrics for end-user’s applications. Taking advantage of the Internet topology, we show how nodes can learn about segments of Internet paths that can be exploited by detouring leading to reduced path latencies. Next, we investigate bandwidth detouring revealing constructive detour properties and effective mechanisms to detour paths in overlay networks. This leads to Ukairo, our bandwidth detouring platform that is scalable to the Internet and tcpChiryo, which predicts bandwidth in an overlay network through measuring a small portion of the network.
APA, Harvard, Vancouver, ISO, and other styles
32

Guerrero, Santander Cesar Dario. "End-to-End Available Bandwidth Estimation and Monitoring." Scholar Commons, 2009. https://scholarcommons.usf.edu/etd/1994.

Full text
Abstract:
Available Bandwidth Estimation Techniques and Tools (ABETTs) have recently been envisioned as a supporting mechanism in areas such as compliance of service level agreements, network management, traffic engineering and real-time resource provisioning, flow and congestion control, construction of overlay networks, fast detection of failures and network attacks, and admission control. However, it is unknown whether current ABETTs can run efficiently in any type of network, under different network conditions, and whether they can provide accurate available bandwidth estimates at the timescales needed by these applications. This dissertation investigates techniques and tools able to provide accurate, low overhead, reliable, and fast available bandwidth estimations. First, it shows how it is that the network can be sampled to get information about the available bandwidth. All current estimation tools use either the probe gap model or the probe rate model sampling techniques. Since the last technique introduces high additional traffic to the network, the probe gap model is the sampling method used in this work. Then, both an analytical and experimental approach are used to perform an extensive performance evaluation of current available bandwidth estimation tools over a flexible and controlled testbed. The results of the evaluation highlight accuracy, overhead, convergence time, and reliability performance issues of current tools that limit their use by some of the envisioned applications. Single estimations are affected by the bursty nature of the cross traffic and by errors generated by the network infrastructure. A hidden Markov model approach to end-to-end available bandwidth estimation and monitoring is investigated to address these issues. This approach builds a model that incorporates the dynamics of the available bandwidth. Every sample that generates an estimation is adjusted by the model. This adjustment makes it possible to obtain acceptable estimation accuracy with a small number of samples and in a short period of time. Finally, the new approach is implemented in a tool called Traceband. The tool, written in ANSI C, is evaluated and compared with Pathload and Spruce, the best estimation tools belonging to the probe rate model and the probe gap model, respectively. The evaluation is performed using Poisson, bursty, and self-similar synthetic cross traffic and real traffic from a network path at University of South Florida. Results show that Traceband provides more estimations per unit time with comparable accuracy to Pathload and Spruce and introduces minimum probing traffic. Traceband also includes an optional moving average technique that smooths out the estimations and improves its accuracy even further.
APA, Harvard, Vancouver, ISO, and other styles
33

Yin, Ruiqing. "Steps towards end-to-end neural speaker diarization." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLS261/document.

Full text
Abstract:
La tâche de segmentation et de regroupement en locuteurs (speaker diarization) consiste à identifier "qui parle quand" dans un flux audio sans connaissance a priori du nombre de locuteurs ou de leur temps de parole respectifs. Les systèmes de segmentation et de regroupement en locuteurs sont généralement construits en combinant quatre étapes principales. Premièrement, les régions ne contenant pas de parole telles que les silences, la musique et le bruit sont supprimées par la détection d'activité vocale (VAD). Ensuite, les régions de parole sont divisées en segments homogènes en locuteur par détection des changements de locuteurs, puis regroupées en fonction de l'identité du locuteur. Enfin, les frontières des tours de parole et leurs étiquettes sont affinées avec une étape de re-segmentation. Dans cette thèse, nous proposons d'aborder ces quatre étapes avec des approches fondées sur les réseaux de neurones. Nous formulons d’abord le problème de la segmentation initiale (détection de l’activité vocale et des changements entre locuteurs) et de la re-segmentation finale sous la forme d’un ensemble de problèmes d’étiquetage de séquence, puis nous les résolvons avec des réseaux neuronaux récurrents de type Bi-LSTM (Bidirectional Long Short-Term Memory). Au stade du regroupement des régions de parole, nous proposons d’utiliser l'algorithme de propagation d'affinité à partir de plongements neuronaux de ces tours de parole dans l'espace vectoriel des locuteurs. Des expériences sur un jeu de données télévisées montrent que le regroupement par propagation d'affinité est plus approprié que le regroupement hiérarchique agglomératif lorsqu'il est appliqué à des plongements neuronaux de locuteurs. La segmentation basée sur les réseaux récurrents et la propagation d'affinité sont également combinées et optimisées conjointement pour former une chaîne de regroupement en locuteurs. Comparé à un système dont les modules sont optimisés indépendamment, la nouvelle chaîne de traitements apporte une amélioration significative. De plus, nous proposons d’améliorer l'estimation de la matrice de similarité par des réseaux neuronaux récurrents, puis d’appliquer un partitionnement spectral à partir de cette matrice de similarité améliorée. Le système proposé atteint des performances à l'état de l'art sur la base de données de conversation téléphonique CALLHOME. Enfin, nous formulons le regroupement des tours de parole en mode séquentiel sous la forme d'une tâche supervisée d’étiquetage de séquence et abordons ce problème avec des réseaux récurrents empilés. Pour mieux comprendre le comportement du système, une analyse basée sur une architecture de codeur-décodeur est proposée. Sur des exemples synthétiques, nos systèmes apportent une amélioration significative par rapport aux méthodes de regroupement traditionnelles
Speaker diarization is the task of determining "who speaks when" in an audio stream that usually contains an unknown amount of speech from an unknown number of speakers. Speaker diarization systems are usually built as the combination of four main stages. First, non-speech regions such as silence, music, and noise are removed by Voice Activity Detection (VAD). Next, speech regions are split into speaker-homogeneous segments by Speaker Change Detection (SCD), later grouped according to the identity of the speaker thanks to unsupervised clustering approaches. Finally, speech turn boundaries and labels are (optionally) refined with a re-segmentation stage. In this thesis, we propose to address these four stages with neural network approaches. We first formulate both the initial segmentation (voice activity detection and speaker change detection) and the final re-segmentation as a set of sequence labeling problems and then address them with Bidirectional Long Short-Term Memory (Bi-LSTM) networks. In the speech turn clustering stage, we propose to use affinity propagation on top of neural speaker embeddings. Experiments on a broadcast TV dataset show that affinity propagation clustering is more suitable than hierarchical agglomerative clustering when applied to neural speaker embeddings. The LSTM-based segmentation and affinity propagation clustering are also combined and jointly optimized to form a speaker diarization pipeline. Compared to the pipeline with independently optimized modules, the new pipeline brings a significant improvement. In addition, we propose to improve the similarity matrix by bidirectional LSTM and then apply spectral clustering on top of the improved similarity matrix. The proposed system achieves state-of-the-art performance in the CALLHOME telephone conversation dataset. Finally, we formulate sequential clustering as a supervised sequence labeling task and address it with stacked RNNs. To better understand its behavior, the analysis is based on a proposed encoder-decoder architecture. Our proposed systems bring a significant improvement compared with traditional clustering methods on toy examples
APA, Harvard, Vancouver, ISO, and other styles
34

Petagna, Fabio. "Secure End-to-End Communications in Mobile Networks." Doctoral thesis, Universita degli studi di Salerno, 2011. http://hdl.handle.net/10556/1524.

Full text
Abstract:
2009 - 2010
Cellular 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.
APA, Harvard, Vancouver, ISO, and other styles
35

Rathinam, Ramalingam Palanivel Beard Cory. "Using forwarding host to improve end to end network performance." Diss., UMK access, 2006.

Find full text
Abstract:
Thesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2006.
"A thesis in computer science." Typescript. Advisor: Cory Beard. Vita. Title from "catalog record" of the print edition Description based on contents viewed Nov. 9, 2007. Includes bibliographical references (leaves 53-55). Online version of the print edition.
APA, Harvard, Vancouver, ISO, and other styles
36

Aurich, Markus. "End-to-end testing per un'applicazione gestionale su web." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8369/.

Full text
Abstract:
Nel primo capitolo si analizzeranno alcune basi del software testing e delle applicazioni web che ci permetteranno di introdurre l'end-to-end testing nel secondo capitolo dove se ne analizzeranno il funzionamento tecnico e le sue prospettive. Successivamente, nel terzo capitolo, verrà presentato l'uso dell'end-to-end testing applicandolo ad un caso concreto, il gestionale Buudis, per poi dimostrarne la sua efficacia ed efficienza nell'ultimo capitolo.
APA, Harvard, Vancouver, ISO, and other styles
37

Paxson, Vern. "Measurements and analysis of end-to-end internet dynamics." Berkeley, CA, 1997. http://www.ethbib.ethz.ch/readme/ethz-etext.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Lunde, Lars, and Audun Wangensteen. "Using SIM for strong end-to-end Application Authentication." Thesis, Norwegian University of Science and Technology, Department of Telematics, 2006. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9294.

Full text
Abstract:

Today the Internet is mostly used for services that require low or none security. The commercial and governmental applications have started to emerge but met problems since they require strong authentication, which is both difficult and costly to realize. The SIM card used in mobile phones is a tamper resistant device that contains strong authentication mechanisms. It would be very convenient and cost-efficient if Internet services could use authentication methods based on the SIM. This master thesis presents an analysis and a design of a generic authentication system based on SIM, together with a detailed description of an implemented prototype. The proposed system, called the Generic SIM Authentication System (GAS), provides a strong authentication mechanism. The GAS builds upon the existing GSM authentication infrastructure, thus allows re-use of GSM expertise from the mobile operators. New services can easily be supported, such that these can benefit from strong authentication. By gradually implementing more authentication mechanisms (e.g. OTP and PKI) on the SIM, it will be able to support several levels of security. This will result in a generic authentication system satisfying the security needs for nowadays and also for the future. In order to design the GAS, the thesis starts by giving an overview of authentication and relevant technologies, before the requirements to the system, both functional and non-functional, are defined. Then different interaction diagrams, collaboration diagrams and sequence diagrams are presented, and the necessary components and interfaces in the system are outlined. This thesis builds on two student projects finished December 2005, where tentative high-level architectures for utilizing SIM-based authentication were proposed. A Prototype has been developed in Java to demonstrate the GAS, and includes both a client (Supplicant) and a server (Authenticator) part. The communication between the Supplicant and the other components in the authentication system is based on EAP, which is a general authentication protocol supporting multiple authentication methods. When performing the GSM authentication the EAP-SIM protocol is used. The Prototype has been tested end-to-end, i.e. from the SIM to the Telenor GSM HLR/AuC, via IP-based network. Three different services have been developed to demonstrate how easily the SIM authentication can be integrated. The first demo service shows how to integrate the authentication with JSP technology and Apache Tomcat. The second service, MyService, is another example of how the authentication service could be integrated into a web portal using PHP to demonstrate that the Prototype is independent of the service implementation language. MyService also illustrates how the service provider can control the registration of new users and link up with their SIM identity. The last service, GasSpot, shows how to integrate the GAS to authenticate users to a Captive Portal. The access is controlled by the gateway, which is implemented using ChilliSpot. Based on the results of the master thesis, the authors have written the paper “A Generic Authentication System based on SIM”, which has been submitted and accepted for publication at the ICISP’06 Conference in Cap Esterel, Côte d’Azur, France, August 26-29, 2006.

APA, Harvard, Vancouver, ISO, and other styles
39

Simpson, Charles Robert Jr. "Analysis of Passive End-to-End Network Performance Measurements." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/14612.

Full text
Abstract:
NETI@home, a distributed network measurement infrastructure to collect passive end-to-end network measurements from Internet end-hosts was developed and discussed. The data collected by this infrastructure, as well as other datasets, were used to conduct studies on the behavior of the network and network users as well as the security issues affecting the Internet. A flow-based comparison of honeynet traffic, representing malicious traffic, and NETI@home traffic, representing typical end-user traffic, was conducted. This comparison showed that a large portion of flows in both datasets were failed and potentially malicious connection attempts. We additionally found that worm activity can linger for more than a year after the initial release date. Malicious traffic was also found to originate from across the allocated IP address space. Other security-related observations made include the suspicious use of ICMP packets and attacks on our own NETI@home server. Utilizing observed TTL values, studies were also conducted into the distance of Internet routes and the frequency with which they vary. The frequency and use of network address translation and the private IP address space were also discussed. Various protocol options and flags were analyzed to determine their adoption and use by the Internet community. Network-independent empirical models of end-user network traffic were derived for use in simulation. Two such models were created. The first modeled traffic for a specific TCP or UDP port and the second modeled all TCP or UDP traffic for an end-user. These models were implemented and used in GTNetS. Further anonymization of the dataset and the public release of the anonymized data and their associated analysis tools were also discussed.
APA, Harvard, Vancouver, ISO, and other styles
40

Hamberg, Christer. "GUI driven End to End Regression testing with Selenium." Thesis, Linnéuniversitetet, Institutionen för datavetenskap (DV), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-68529.

Full text
Abstract:
Digitalization has changed our world and how we interact with different systems. Desktop applications have more and more been integrated with internet, and the web browser has become the Graphical User Interface (GUI) in today’s system solutions. A change that needs to be considered in the automated regression testing process. Using the actual GUI has over time shown to be a complicated task and is therefore often broken out as its own standalone test object. This study looked into time and quality constrains of using the GUI as driver of the regression testing of business requirements in a web based solution. By evaluating the differences in execution times of test cases between Application Programming Interface (API) calls and GUI driven testing, flakiness of test results and required modifications over time for a specific test suite. These constraints were analyzed by looking into how reliability of the test results could be achieved. With a GUI driven full end to end scope the quality in software solutions could be improved with a reduction in the number of interface issues and detected errors in deployed systems. It would also reduce the volume of test cases that needs to be executed and maintained as there are no longer standalone parts to verify separately with partially overlapping test cases. The implementation utilized Selenium WebDriver to drive the GUI and the results showed that by utilizing Selenium the test execution times were increased from approximately 2 seconds (API) to 20-75 seconds (Selenium). The flaky test results could be eliminated by applying the appropriate pattern to detect, locate, and scroll into visibility prior to interacting with the elements. In the end of the study the test execution results were 100% reliable. The navigation required 15 modifications over time to keep them running. By applying the appropriate pattern a reliable test result can be achieved in end to end regression testing where the test case is driven from the GUI, however with an increase in execution time.
APA, Harvard, Vancouver, ISO, and other styles
41

Saleem, Rashid. "Towards an end-to-end multiband OFDM system analysis." Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/towards-an-endtoend-multiband-ofdm-system-analysis(e711f32f-1ac6-4b48-8f4e-58309c0482d3).html.

Full text
Abstract:
Ultra Wideband (UWB) communication has recently drawn considerable attention from academia and industry. This is mainly owing to the ultra high speeds and cognitive features it could offer. The employability of UWB in numerous areas including but not limited to Wireless Personal Area Networks, WPAN's, Body Area Networks, BAN's, radar and medical imaging etc. has opened several avenues of research and development. However, still there is a disagreement on the standardization of UWB. Two contesting radios for UWB are Multiband Orthogonal Frequency Division Multiplexing (MB-OFDM) and DS-UWB (Direct Sequence Ultra Wideband). As nearly all of the reported research on UWB hasbeen about a very narrow/specific area of the communication system, this thesis looks at the end-to-end performance of an MB-OFDM approach. The overall aim of this project has been to first focus on three different aspects i.e. interference, antenna and propagation aspects of an MB-OFDM system individually and then present a holistic or an end-to-end system analysis finally. In the first phase of the project the author investigated the performance of MB-OFDM system under the effect of his proposed generic or technology non-specific interference. Avoiding the conventional Gaussian approximation, the author has employed an advanced stochastic method. A total of two approaches have been presented in this phase of the project. The first approach is an indirect one which involves the Moment Generating Functions (MGF's) of the Signal-to-Interference-plus-Noise-Ratio (SINR) and the Probability Density Function (pdf) of the SINR to calculate the Average Probabilities of Error of an MB-OFDM system under the influence of proposed generic interference. This approach assumed a specific two-dimensional Poisson spatial/geometric placement of interferers around the victim MB-OFDM receiver. The second approach is a direct approach and extends the first approach by employing a wider class of generic interference. In the second phase of the work the author designed, simulated, prototyped and tested novel compact monopole planar antennas for UWB application. In this phase of the research, compact antennas for the UWB application are presented. These designs employ low-loss Rogers duroid substrates and are fed by Copla-nar Waveguides. The antennas have a proposed feed-line to the main radiating element transition region. This transition region is formed by a special step-generating function-set called the "Inverse Parabolic Step Sequence" or IPSS. These IPSS-based antennas are simulated, prototyped and then tested in the ane-choic chamber. An empirical approach, aimed to further miniaturize IPSS-based antennas, was also derived in this phase of the project. The empirical approach has been applied to derive the design of a further miniaturized antenna. More-over, an electrical miniaturization limit has been concluded for the IPSS-based antennas. The third phase of the project has investigated the effect of the indoor furnishing on the distribution of the elevation Angle-of-Arrival (AOA) of the rays at the receiver. Previously, constant distributions for the AOA of the rays in the elevation direction had been reported. This phase of the research has proposed that the AOA distribution is not fixed. It is established by the author that the indoor elevation AOA distributions depend on the discrete levels of furnishing. A joint time-angle-furnishing channel model is presented in this research phase. In addition, this phase of the thesis proposes two vectorial or any direction AOA distributions for the UWB indoor environments. Finally, the last phase of this thesis is presented. As stated earlier, the overall aim of the project has been to look at three individual aspects of an MB-OFDM system, initially, and then look at the holistic system, finally. Therefore, this final phase of the research presents an end-to-end MB-OFDM system analysis. The interference analysis of the first phase of the project is revisited to re-calculate the probability of bit error with realistic/measured path loss exponents which have been reported in the existing literature. In this method, Gaussian Quadrature Rule based approximations are computed for the average probability of bit error. Last but not the least, an end-to-end or comprehensive system equation/impulse response is presented. The proposed system equation covers more aspects of an indoor UWB system than reported in the existing literature.
APA, Harvard, Vancouver, ISO, and other styles
42

Acar, Guray. "End-to-end resource masnagemeht on geostationary satellite networks." Thesis, Imperial College London, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.271710.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Bismark, David. "End-to-end veriable voting with Prêt à Voter." Thesis, University of Surrey, 2010. http://epubs.surrey.ac.uk/775329/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Chou, Chih-Lun. "Analysis of end-to-end performance of LAN systems." Thesis, Monterey, California. Naval Postgraduate School, 1990. http://hdl.handle.net/10945/30684.

Full text
Abstract:
Approved for public release, distribution is unlimited
The analysis of LAN performance is the main objective of this research. LANs can be configured in various ways combining different medium access control mechanisms and different physical layer specifications. Details on these alternatives are specified in IEEE 802.3 through IEEE 802.5. We study th performance of different types of LANs under various configurations of servers and stations. The queueing network model is one of the analytical tools to help investigate the performance characteristics of various LAN configurations. Since the analytical approach based on queueing network models is often too complicated to be practically used, we rely on simulations. Thus our analysis will be based on simulations, and SIMLAN II will be the simulation tool for our work. Our specification of simulation models involves three classes of transactions, and one or two servers. There are 24 simulation results in this thesis. These results, which are arranged in tables and figures, help compare th performance characteristics of various LAN configurations.
APA, Harvard, Vancouver, ISO, and other styles
45

Nordin, Alexander Friedrich. "End to end machine learning workflow using automation tools." Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/119776.

Full text
Abstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 79-80).
We have developed an open source library named Trane and integrated it with two open source libraries to build an end-to-end machine learning workflow that can facilitate rapid development of machine learning models. The three components of this workflow are Trane, Featuretools and ATM. Trane enumerates tens of prediction problems relevant to any dataset using the meta information about the data. Furthermore, Trane generates training examples required for training machine learning models. Featuretools is an open-source software for automatically generating features from a dataset. Auto Tune Models (ATM), an open source library, performs a high throughput search over modeling options to find the best modeling technique for a problem. We show the capability of these three tools and highlight the open-source development of Trane.
by Alexander Friedrich Nordin.
M. Eng.
APA, Harvard, Vancouver, ISO, and other styles
46

Shen, Emily (Emily Huei-Yi). "End-to-end verifiability for optical scan voting systems." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44729.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008.
Includes bibliographical references (p. 57-59).
End-to-end verifiable voting systems allow voters to verify that their votes are cast as intended, collected as cast, and counted as collected. Essentially, end-to-end voting systems provide voters assurance that each step of the election worked correctly. At the same time, voting systems must protect voter privacy and prevent the possibility of improper voter influence and voter coercion. Several end-to-end voting systems have been proposed, varying in usability and practicality. In this thesis we describe and analyze Scantegrity II, a novel end-to-end verification mechanism for optical scan voting which uses confirmation codes printed on the ballot in invisible ink. The confirmation codes allow voters to create privacy-preserving receipts which voters can check against the bulletin board after the close of the election to ensure that their votes have been collected as cast. Anyone can check that votes have been counted as collected and that the tally is correct. We describe the Scantegrity II system and analyze the integrity and privacy properties it provides.
by Emily Shen.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
47

Li, Rui Ph D. Massachusetts Institute of Technology. "End-to-end data reliability in optical flow switching." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/68505.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2011.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 217-220).
Ever since optical fiber was introduced in the 1970s as a communications medium, optical networking has revolutionized the telecommunications landscape. With sustained exponential increase in bandwidth demand, innovation in optical networking needs to continue to ensure cost-effective communications in the future. Optical flow switching (OFS) has been proposed for future optical networks to serve large transactions in a cost-effective manner, by means of an all-optical data plane employing end-to-end lightpaths. Due to noise added in the transmission and detection processes, the channel has non-zero probability of bit errors that may corrupt the useful data or flows transmitted. In this thesis, we focus on the end-to-end reliable data delivery part of the Transport Layer protocol and propose effective and efficient algorithms to ensure error-free end-to-end communications for OFS. We will analyze the performance of each algorithm and suggest optimal algorithm(s) to minimize the total delay. We propose four classes of OFS protocols, then compare them with the Transport Control Protocol (TCP) over Electronic Packet Switching (EPS) and indicate under what values of the parameters: file size, bit error rate (BER), propagation delay and loading factor is OFS better than EPS. This analysis can serve as important guidelines for practical protocol designs for end-to- end data transfer reliability of OFS.
by Rui Li.
S.M.
APA, Harvard, Vancouver, ISO, and other styles
48

Mohib, Hamdullah. "End-to-end 3D video communication over heterogeneous networks." Thesis, Brunel University, 2014. http://bura.brunel.ac.uk/handle/2438/8293.

Full text
Abstract:
Three-dimensional technology, more commonly referred to as 3D technology, has revolutionised many fields including entertainment, medicine, and communications to name a few. In addition to 3D films, games, and sports channels, 3D perception has made tele-medicine a reality. By the year 2015, 30% of the all HD panels at home will be 3D enabled, predicted by consumer electronics manufacturers. Stereoscopic cameras, a comparatively mature technology compared to other 3D systems, are now being used by ordinary citizens to produce 3D content and share at a click of a button just like they do with the 2D counterparts via sites like YouTube. But technical challenges still exist, including with autostereoscopic multiview displays. 3D content requires many complex considerations--including how to represent it, and deciphering what is the best compression format--when considering transmission or storage, because of its increased amount of data. Any decision must be taken in the light of the available bandwidth or storage capacity, quality and user expectations. Free viewpoint navigation also remains partly unsolved. The most pressing issue getting in the way of widespread uptake of consumer 3D systems is the ability to deliver 3D content to heterogeneous consumer displays over the heterogeneous networks. Optimising 3D video communication solutions must consider the entire pipeline, starting with optimisation at the video source to the end display and transmission optimisation. Multi-view offers the most compelling solution for 3D videos with motion parallax and freedom from wearing headgear for 3D video perception. Optimising multi-view video for delivery and display could increase the demand for true 3D in the consumer market. This thesis focuses on an end-to-end quality optimisation in 3D video communication/transmission, offering solutions for optimisation at the compression, transmission, and decoder levels.
APA, Harvard, Vancouver, ISO, and other styles
49

Gajdár, Matúš. "Nízko-dimenzionální faktorizace pro "End-To-End" řečové systémy." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2020. http://www.nusl.cz/ntk/nusl-417297.

Full text
Abstract:
The project covers automatic speech recognition with neural network training using low-dimensional matrix factorization. We are describing time delay neural networks with factorization (TDNN-F) and without it (TDNN) in Pytorch language. We are comparing the implementation between Pytorch and Kaldi toolkit, where we achieve similar results during experiments with various network architectures. The last chapter describes the impact of a low-dimensional matrix factorization on End-to-End speech recognition systems and also a modification of the system with TDNN(-F) networks. Using specific network settings, we were able to achieve better results with systems using factorization. Additionally, we reduced the complexity of training by decreasing network parameters with the use of TDNN(-F) networks.
APA, Harvard, Vancouver, ISO, and other styles
50

Jain, Manish. "End-to-end available bandwidth estimation and its applications." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/22688.

Full text
Abstract:
Thesis (Ph. D.)--Computing, Georgia Institute of Technology, 2007.
Committee Chair: Dovrolis, Constantine; Committee Member: Ammar, Mostafa; Committee Member: Schwan, Karsten; Committee Member: Steenkiste, Peter; Committee Member: Zegura, Ellen.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the bibliographies on the topic 'End-To-End' for other source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography