Relevant bibliographies by topics / End-to-end verification

Academic literature on the topic 'End-to-end verification'

Author: Grafiati
Published: 10 December 2022
Last updated: 28 January 2023

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

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'End-to-end verification.'

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.

Journal articles on the topic "End-to-end verification"

1

Roy, Pushpita, Ansuman Banerjee, and Bhargab B. Bhattacharya. "A framework for end-to-end verification for digital microfluidics." Innovations in Systems and Software Engineering 17, no. 3 (May 5, 2021): 231–45. http://dx.doi.org/10.1007/s11334-021-00398-3.

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

JUNG, Eun-Sung, Si LIU, Rajkumar KETTIMUTHU, and Sungwook CHUNG. "High-Performance End-to-End Integrity Verification on Big Data Transfer." IEICE Transactions on Information and Systems E102.D, no. 8 (August 1, 2019): 1478–88. http://dx.doi.org/10.1587/transinf.2018edp7297.

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

Malik, Jameel, Ahmed Elhayek, Suparna Guha, Sheraz Ahmed, Amna Gillani, and Didier Stricker. "DeepAirSig: End-to-End Deep Learning Based in-Air Signature Verification." IEEE Access 8 (2020): 195832–43. http://dx.doi.org/10.1109/access.2020.3033848.

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

Chen, Juan, Ravi Chugh, and Nikhil Swamy. "Type-preserving compilation of end-to-end verification of security enforcement." ACM SIGPLAN Notices 45, no. 6 (June 12, 2010): 412–23. http://dx.doi.org/10.1145/1809028.1806643.

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

Chen, Di, Chunyan Xu, Jian Yang, Jianjun Qian, Yuhui Zheng, and Linlin Shen. "Joint Bayesian guided metric learning for end-to-end face verification." Neurocomputing 275 (January 2018): 560–67. http://dx.doi.org/10.1016/j.neucom.2017.09.009.

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

Carbonneaux, Quentin, Jan Hoffmann, Tahina Ramananandro, and Zhong Shao. "End-to-end verification of stack-space bounds for C programs." ACM SIGPLAN Notices 49, no. 6 (June 5, 2014): 270–81. http://dx.doi.org/10.1145/2666356.2594301.

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

Leung, C. M., and J. A. Schormans. "Measurement-based end to end latency performance prediction for SLA verification." Journal of Systems and Software 74, no. 3 (February 2005): 243–54. http://dx.doi.org/10.1016/j.jss.2003.12.031.

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

Guo, Jiang Hong, Jian Qiang Wu, and Xi Hong Wu. "Data Aggregation with End-to-End Security for Wireless Sensor Networks." Advanced Materials Research 490-495 (March 2012): 383–86. http://dx.doi.org/10.4028/www.scientific.net/amr.490-495.383.

Full text
Abstract:
Secure end-to-end data transmission is an important method to protect the data privacy in wireless sensor networks. Authors proposed a data aggregation scheme with end-to-end security for wireless sensor networks. The plaintext of sensor readings only appeared in source node and remote server, the aggregators completed the data integrity verification, sender identity authentication and data aggregation without the plaintext. Analysis and simulation show that our scheme has higher security in terms of resilient against malicious attacks and reduces the communication overhead effectively
APA, Harvard, Vancouver, ISO, and other styles
9

Bai, Zhongxin, Jianyu Wang, Xiao-Lei Zhang, and Jingdong Chen. "End-to-End Speaker Verification via Curriculum Bipartite Ranking Weighted Binary Cross-Entropy." IEEE/ACM Transactions on Audio, Speech, and Language Processing 30 (2022): 1330–44. http://dx.doi.org/10.1109/taslp.2022.3161155.

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

Costanzo, David, Zhong Shao, and Ronghui Gu. "End-to-end verification of information-flow security for C and assembly programs." ACM SIGPLAN Notices 51, no. 6 (August 2016): 648–64. http://dx.doi.org/10.1145/2980983.2908100.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "End-to-end verification"

1

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.

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

Costanzo, David. "Formal End-to-End Verification of Information-Flow Security for Complex Systems." Thesis, Yale University, 2017. http://pqdtopen.proquest.com/#viewpdf?dispub=10584941.

Full text
Abstract:

Protecting the confidentiality of information manipulated by a computing system is one of the most important challenges facing today's cybersecurity community. Many complex systems, such as operating systems, hypervisors, web browsers, and distributed systems, require a user to trust that private information is properly isolated from other users. Real-world systems are full of bugs, however, so this assumption of trust is not reasonable.

The goal of this dissertation is to apply formal methods to complex security-sensitive systems, in such a way that we can guarantee to users that these systems really are trustworthy. Unfortunately, there are numerous prohibitive challenges standing in the way of achieving this goal.

One challenge is how to specify the desired security policy of a complex system. In the real world, pure noninterference 'is too strong to be useful. It is crucial to support more lenient security policies that allow for certain well-specified information flows between users, such as explicit declassifications. Furthermore, the specified policy must be comprehensible to users at a high level of abstraction, but also must apply to the low-level system implementation.

A second challenge is that real-world systems are usually written in low-level languages like C and assembly, but these languages are traditionally difficult to reason about. Additionally, even if we successfully verify individual C and assembly functions, how do we go about linking them together? The obvious answer is to do the linking after the C code gets compiled into assembly, but this requires trusting that the compiler did not accidentally or maliciously introduce security bugs. This is a very difficult problem, especially considering that a compiler may fail to preserve security even when it correctly preserves functional behavior.

A third challenge is how to actually go about conducting a security proof over low-level code. Traditional security type systems do not work well since they require a strongly-typed language, so how can a security violation be detected in untyped C or assembly code? In fact, it is actually common for code to temporarily violate a security policy, perhaps for performance reasons, but then to not actually perform any observable behavior influenced by the violation; how can we reason that this kind of code is acceptably secure? Finally, how do we conduct the proof in a unified way that allows us to link everything together into a system-wide guarantee?

In this dissertation, we make two major contributions that achieve our goal by overcoming all of these challenges. The first contribution is the development of a novel methodology allowing us to formally specify, prove, and propagate information-flow security policies using a single unifying mechanism, called the "observation function" . A policy is specified in terms of an expressive generalization of classical noninterference, proved using a general method that subsumes both security-label proofs and information-hiding proofs, and propagated across layers of abstraction using a special kind of simulation that is guaranteed to preserve security.

To demonstrate the effectiveness of our new methodology, our second major contribution is an actual end-to-end security proof, fully formalized and machine-checked in the Coq proof assistant, of a nontrivial operating system kernel. Our artifact is the first ever guaranteed-secure kernel involving both C and assembly code, including compilation from the C code into assembly. Our final result guarantees the following notion of isolation: as long as direct inter-process communication is not used, user processes executing over the kernel cannot influence each others' executions in any way. During the verification effort, we successfully discovered and fixed some interesting security holes in the kernel, such as one that exploits child process IDs as a side channel for communication.

We also demonstrate the generality and extensibility of our methodology by extending the kernel with a virtualized time feature allowing user processes to time their own executions. With a relatively minor amount of effort, we successfully prove that this new feature obeys our isolation policy, guaranteeing that user processes cannot exploit virtualized time as an information channel.

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

D'Esposito, Rosario. "Electro-thermal characterization, TCAD simulations and compact modeling of advanced SiGe HBTs at device and circuit level." Thesis, Bordeaux, 2016. http://www.theses.fr/2016BORD0147/document.

Full text
Abstract:
Ce travail de thèse présente une étude concernant la caractérisation des effets électrothermiques dans les transistors bipolaires à hétérojonction (HBT) en SiGe. Lors de ces travaux, deux procédés technologiques BiCMOS à l’état de l’art ont été analysés: le B11HFC de Infineon Technologies (130nm) et le B55 de STMicroelectronics (55nm).Des structures de test dédiées ont étés conçues, pour évaluer l’impact électrothermique du back end of line (BEOL) de composants ayant une architecture à un ou plusieurs doigts d’émetteur. Une caractérisation complète a été effectuée en régime continu et en mode alternatif en petit et en grand signal. De plus, une extraction des paramètres thermiques statiques et dynamiques a été réalisée et présentée pour les structures de test proposées. Il est démontré que les figures de mérite DC et RF s’améliorent sensiblement en positionnant des couches de métal sur le transistor, dessinées de manière innovante et ayant pour fonction de guider le flux thermique vers l’extérieur. L’impact thermique du BEOL a été modélisé et vérifié expérimentalement dans le domaine temporel et fréquentiel et aussi grâce à des simulations 3D par éléments finis. Il est à noter que l’effet du profil de dopage sur la conductivité thermique est analysé et pris en compte.Des topologies de transistor innovantes ont étés conçues, permettant une amélioration des spécifications de l’aire de sécurité de fonctionnement, grâce à un dessin innovant de la surface d’émetteur et du deep trench (DTI).Un modèle compact est proposé pour simuler les effets de couplage thermique en dynamique entre les émetteurs des HBT multi-doigts; ensuite le modèle est validé avec de mesures dédiées et des simulations TCAD.Des circuits de test ont étés conçus et mesurés, pour vérifier la précision des modèles compacts utilisés dans les simulateurs de circuits; de plus, l’impact du couplage thermique entre les transistors sur les performances des circuits a été évalué et modélisé. Finalement, l’impact du dissipateur thermique positionné sur le transistor a été étudié au niveau circuit, montrant un réel intérêt de cette approche
This work is focused on the characterization of electro-thermal effects in advanced SiGe hetero-junction bipolar transistors (HBTs); two state of the art BiCMOS processes have been analyzed: the B11HFC from Infineon Technologies (130nm) and the B55 from STMicroelectronics (55nm).Special test structures have been designed, in order to evaluate the overall electro-thermal impact of the back end of line (BEOL) in single finger and multi-finger components. A complete DC and RF electrical characterization at small and large signal, as well as the extraction of the device static and dynamic thermal parameters are performed on the proposed test structures, showing a sensible improvement of the DC and RF figures of merit when metal dummies are added upon the transistor. The thermal impact of the BEOL has been modeled and experimentally verified in the time and frequency domain and by means of 3D TCAD simulations, in which the effect of the doping profile on the thermal conductivity is analyzed and taken into account.Innovative multi-finger transistor topologies are designed, which allow an improvement of the SOA specifications, thanks to a careful design of the drawn emitter area and of the deep trench isolation (DTI) enclosed area.A compact thermal model is proposed for taking into account the mutual thermal coupling between the emitter stripes of multi-finger HBTs in dynamic operation and is validated upon dedicated pulsed measurements and TCAD simulations.Specially designed circuit blocks have been realized and measured, in order to verify the accuracy of device compact models in electrical circuit simulators; moreover the impact on the circuit performances of mutual thermal coupling among neighboring transistors and the presence of BEOL metal dummies is evaluated and modeled
APA, Harvard, Vancouver, ISO, and other styles
4

Essex, Aleksander. "Cryptographic End-to-end Verification for Real-world Elections." Thesis, 2012. http://hdl.handle.net/10012/6817.

Full text
Abstract:
In this dissertation we study the problem of making electronic voting trustworthy through the use of cryptographic end-to-end (E2E) audits. In particular, we present a series of novel proposals for cryptographic election verification with a focus on real-world practicality. We begin by outlining fundamental requirements of E2E election verification, important properties for a real-world settings, and provide a review of previous and concurrent related work. Our research results are then presented across three parts. In the first part we examine how E2E election verification can be made more procedurally familiar to real-world voters and election administrators. We propose and implement an E2E add-on for conventional optical-scan based voting systems, and highlight our experiences running an election using this system in a United States municipality. In the second part we examine how E2E election verification can be made more conceptually and procedurally simple for election verifiers/auditors. We present a non-cryptographic E2E system based on physical document security assumptions as an educational tool. We extend this system to a cryptographic setting to show how the procedures of cryptographic election verification can be completed with relatively tiny software code bases, or by using common-place programs such as a desktop spreadsheet. We then present an approach that allows verifiers to conduct cryptographic audits without having to plan for it prior to an election. In the third part we examine how the methods in the first part can be extended to provide a level of privacy/distribution of trust similar to that of classical cryptographic voting protocols, while maintaining the (comparatively) intuitive optical-scan interface. To that end, we propose a novel paradigm for secure distributed document printing that allows optical-scan ballots to be printed in a way that still lets voters check their ballots have been counted, while keeping their voting preferences secret from election officials and everyone else. Finally we outline how the results obtained in each of the three parts can be combined to create a cryptographically end-to-end verifiable voting system that simultaneously offers a conventional optical-scan ballot, ballot secrecy assured by a distribution of trust, and a simple, cryptographically austere set of audit procedures.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "End-to-end verification"

1

Chan, Wendy, Donald Hung, Melvin Lim, John Vien, and Ming Fung Yee. Hands-On Introduction to Soc: Front-End Hardware Design and Functional Verification. Pearson Education, Limited, 2025.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Schlieter, Jens. Experiences of Dying and Death. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190888848.003.0002.

Full text
Abstract:
This chapter looks more closely to the truth claims and verification strategies of near-death reports, discussing, among others, views by Carol Zaleski and Michael N. Marsh. The example of a reported near-death experience by John G. Bennett is taken as an example of how experiencers claim that they had been dead while having the respective experiences. In contrast, for the aim of the study, death is defined as the irreversible end of dying. As can be seen in Bennett’s portrayal, a positive answer on “what it is like to be dead” rests heavily on how “death” gets defined, usually blurring the distinction of death versus deprived states close to death.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "End-to-end verification"

1

Reid, Alastair, Rick Chen, Anastasios Deligiannis, David Gilday, David Hoyes, Will Keen, Ashan Pathirane, Owen Shepherd, Peter Vrabel, and Ali Zaidi. "End-to-End Verification of "Equation missing" Processors with ISA-Formal." In Computer Aided Verification, 42–58. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-41540-6_3.

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

Park, Daejun, Yi Zhang, and Grigore Rosu. "End-to-End Formal Verification of Ethereum 2.0 Deposit Smart Contract." In Computer Aided Verification, 151–64. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-53288-8_8.

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

Sánchez, Rafael, Manuel Martínez, Salvador Hierrezuelo, Juan Guerrero, and Juan Torreblanca. "Service Performance Verification and Benchmarking." In End-to-End Quality of Service over Cellular Networks, 186–242. Chichester, UK: John Wiley & Sons, Ltd, 2006. http://dx.doi.org/10.1002/047001587x.ch6.

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

Ranjana, S., J. Priya, P. S. Reenu Rita, and B. Bharathi. "End-to-End Speaker Verification for Short Utterances." In Advances in Intelligent Systems and Computing, 305–13. Singapore: Springer Singapore, 2022. http://dx.doi.org/10.1007/978-981-16-7088-6_27.

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

Yuan, Shenghao, Frédéric Besson, Jean-Pierre Talpin, Samuel Hym, Koen Zandberg, and Emmanuel Baccelli. "End-to-End Mechanized Proof of an eBPF Virtual Machine for Micro-controllers." In Computer Aided Verification, 293–316. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-13188-2_15.

Full text
Abstract:
AbstractRIOT is a micro-kernel dedicated to IoT applications that adopts eBPF (extended Berkeley Packet Filters) to implement so-called femto-containers. As micro-controllers rarely feature hardware memory protection, the isolation of eBPF virtual machines (VM) is critical to ensure system integrity against potentially malicious programs. This paper shows how to directly derive, within the Coq proof assistant, the verified C implementation of an eBPF virtual machine from a Gallina specification. Leveraging the formal semantics of the CompCert C compiler, we obtain an end-to-end theorem stating that the C code of our VM inherits the safety and security properties of the Gallina specification. Our refinement methodology ensures that the isolation property of the specification holds in the verified C implementation. Preliminary experiments demonstrate satisfying performance.
APA, Harvard, Vancouver, ISO, and other styles
6

Giorgi, Giacomo, Andrea Saracino, and Fabio Martinelli. "End to End Autorship Email Verification Framework for a Secure Communication." In Communications in Computer and Information Science, 73–96. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-94900-6_4.

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

Nandivada, V. Krishna, Fernando Magno Quintão Pereira, and Jens Palsberg. "A Framework for End-to-End Verification and Evaluation of Register Allocators." In Static Analysis, 153–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. http://dx.doi.org/10.1007/978-3-540-74061-2_10.

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

Coria, Juan M., Hervé Bredin, Sahar Ghannay, and Sophie Rosset. "A Comparison of Metric Learning Loss Functions for End-To-End Speaker Verification." In Statistical Language and Speech Processing, 137–48. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-59430-5_11.

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

Humphrey, Laura R., James Hamil, and Joffrey Huguet. "End-to-End Verification of Initial and Transition Properties of GR(1) Designs in SPARK." In Software Engineering and Formal Methods, 60–76. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-58768-0_4.

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

Strömberg, Jan-Erik, Simin Nadjm-Tehrani, and Jan L. Top. "Switched bond graphs as front-end to formal verification of hybrid systems." In Hybrid Systems III, 282–93. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/bfb0020953.

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

Conference papers on the topic "End-to-end verification"

1

Heigold, Georg, Ignacio Moreno, Samy Bengio, and Noam Shazeer. "End-to-end text-dependent speaker verification." In 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2016. http://dx.doi.org/10.1109/icassp.2016.7472652.

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

El-Atawy, A., and T. Samak. "End-to-end verification of QoS policies." In 2012 IEEE/IFIP Network Operations and Management Symposium (NOMS 2012). IEEE, 2012. http://dx.doi.org/10.1109/noms.2012.6211927.

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

Yin, Yalin, and Xiangdong Zhou. "End-to-end online handwriting signature verification." In Tenth International Conference on Graphics and Image Processing (ICGIP 2018), edited by Hui Yu, Yifei Pu, Chunming Li, and Zhigeng Pan. SPIE, 2019. http://dx.doi.org/10.1117/12.2524447.

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

Zhu, Yingke, and Brian Mak. "Orthogonality Regularizations for End-to-End Speaker Verification." In Odyssey 2020 The Speaker and Language Recognition Workshop. ISCA: ISCA, 2020. http://dx.doi.org/10.21437/odyssey.2020-3.

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

Han, Yan, Gautam Krishna, Co Tran, Mason Carnahan, and Ahmed H. Tewfik. "Robust End-to-End Speaker Verification Using EEG." In 2020 28th European Signal Processing Conference (EUSIPCO). IEEE, 2021. http://dx.doi.org/10.23919/eusipco47968.2020.9287323.

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

Wan, Li, Quan Wang, Alan Papir, and Ignacio Lopez Moreno. "Generalized End-to-End Loss for Speaker Verification." In ICASSP 2018 - 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2018. http://dx.doi.org/10.1109/icassp.2018.8462665.

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

Ding, Jizheng, Xiaoran Zhu, Jian Guo, Xin Li, and Rongkun Yan. "End-to-End Automated Verification for OS Kernels." In 2018 25th Asia-Pacific Software Engineering Conference (APSEC). IEEE, 2018. http://dx.doi.org/10.1109/apsec.2018.00028.

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

Wang, Qing, Pengcheng Guo, Sining Sun, Lei Xie, and John H. L. Hansen. "Adversarial Regularization for End-to-End Robust Speaker Verification." In Interspeech 2019. ISCA: ISCA, 2019. http://dx.doi.org/10.21437/interspeech.2019-2983.

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

Lin, Weiwei, Man-Wai Mak, and Jen-Tzung Chien. "Strategies for End-to-End Text-Independent Speaker Verification." In Interspeech 2020. ISCA: ISCA, 2020. http://dx.doi.org/10.21437/interspeech.2020-2092.

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

Ramoji, Shreyas, Prashant Krishnan, and Sriram Ganapathy. "Neural PLDA Modeling for End-to-End Speaker Verification." In Interspeech 2020. ISCA: ISCA, 2020. http://dx.doi.org/10.21437/interspeech.2020-2699.

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

Reports on the topic "End-to-end verification"

1

Marchand, Gary. End-to End Test Verification and Validation Plan. Fort Belvoir, VA: Defense Technical Information Center, November 1996. http://dx.doi.org/10.21236/ada381123.

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

Han, Fei, Monica Prezzi, Rodrigo Salgado, Mehdi Marashi, Timothy Wells, and Mir Zaheer. Verification of Bridge Foundation Design Assumptions and Calculations. Purdue University, 2020. http://dx.doi.org/10.5703/1288284317084.

Full text
Abstract:
The Sagamore Parkway Bridge consists of twin parallel bridges over the Wabash River in Lafayette, IN. The old steel-truss eastbound bridge was demolished in November 2016 and replaced by a new seven-span concrete bridge. The new bridge consists of two end-bents (bent 1 and bent 8) and six interior piers (pier 2 to pier 7) that are founded on closed-ended and open-ended driven pipe piles, respectively. During bridge construction, one of the bridge piers (pier 7) and its foundation elements were selected for instrumentation for monitoring the long-term response of the bridge to dead and live loads. The main goals of the project were (1) to compare the design bridge loads (dead and live loads) with the actual measured loads and (2) to study the transfer of the superstructure loads to the foundation and the load distribution among the piles in the group. This report presents in detail the site investigation data, the instrumentation schemes used for load and settlement measurements, and the response of the bridge pier and its foundation to dead and live loads at different stages during and after bridge construction. The measurement results include the load-settlement curves of the bridge pier and the piles supporting it, the load transferred from the bridge pier to its foundation, the bearing capacity of the pile cap, the load eccentricity, and the distribution of loads within the pier’s cross section and among the individual piles in the group. The measured dead and live loads are compared with those estimated in bridge design.
APA, Harvard, Vancouver, ISO, and other styles
3

Tarasenko, Andrii O., Yuriy V. Yakimov, and Vladimir N. Soloviev. Convolutional neural networks for image classification. [б. в.], February 2020. http://dx.doi.org/10.31812/123456789/3682.

Full text
Abstract:
This paper shows the theoretical basis for the creation of convolutional neural networks for image classification and their application in practice. To achieve the goal, the main types of neural networks were considered, starting from the structure of a simple neuron to the convolutional multilayer network necessary for the solution of this problem. It shows the stages of the structure of training data, the training cycle of the network, as well as calculations of errors in recognition at the stage of training and verification. At the end of the work the results of network training, calculation of recognition error and training accuracy are presented.
APA, Harvard, Vancouver, ISO, and other styles
4

Adhikari, Kamal, Bharat Adhikari, Sue Cavill, Santosh Mehrotra, Vijeta Rao Bejjanki, and Matteus Van Der Velden. Monitoring Sanitation Campaigns: Targets, Reporting and Realism. Institute of Development Studies (IDS), June 2021. http://dx.doi.org/10.19088/slh.2021.009.

Full text
Abstract:
Many governments in Asia and Africa have set ambitious target dates for their countries becoming open defecation free (ODF). Some have recently concluded national sanitation campaigns; a number of countries have campaigns underway; while others are in the conceptualising and planning process. Monitoring and reporting results is one of the key challenges associated with these campaigns. This Frontiers of Sanitation presents lessons learnt to date to inform ongoing and future government campaigns intended to end open defecation and improve access to safely managed sanitation. Firstly, we discuss campaigns, targets, monitoring, reporting, and verification arrangements, showing how these processes can be used to increase the credibility of national declarations and strengthen campaigns to respond to challenges. Secondly, we present case studies from India and Nepal, providing campaign-specific details from two recently declared ODF countries.
APA, Harvard, Vancouver, ISO, and other styles
5

Adhikari, Kamal, Bharat Adhikari, Sue Cavill, Santosh Mehrotra, Vijeta Rao Bejjanki, and Matteus Van Der Velden. Monitoring Sanitation Campaigns: Targets, Reporting and Realism. Institute of Development Studies (IDS), June 2021. http://dx.doi.org/10.19088/slh.2021.023.

Full text
Abstract:
Many governments in Asia and Africa have set ambitious target dates for their countries becoming open defecation free (ODF). Some have recently concluded national sanitation campaigns; a number of countries have campaigns underway; while others are in the conceptualising and planning process. Monitoring and reporting results is one of the key challenges associated with these campaigns. This Frontiers of Sanitation presents lessons learnt to date to inform ongoing and future government campaigns intended to end open defecation and improve access to safely managed sanitation. Firstly, we discuss campaigns, targets, monitoring, reporting, and verification arrangements, showing how these processes can be used to increase the credibility of national declarations and strengthen campaigns to respond to challenges. Secondly, we present case studies from India and Nepal, providing campaign-specific details from two recently declared ODF countries.
APA, Harvard, Vancouver, ISO, and other styles
6

Gates, Allison, Michelle Gates, Shannon Sim, Sarah A. Elliott, Jennifer Pillay, and Lisa Hartling. Creating Efficiencies in the Extraction of Data From Randomized Trials: A Prospective Evaluation of a Machine Learning and Text Mining Tool. Agency for Healthcare Research and Quality (AHRQ), August 2021. http://dx.doi.org/10.23970/ahrqepcmethodscreatingefficiencies.

Full text
Abstract:
Background. Machine learning tools that semi-automate data extraction may create efficiencies in systematic review production. We prospectively evaluated an online machine learning and text mining tool’s ability to (a) automatically extract data elements from randomized trials, and (b) save time compared with manual extraction and verification. Methods. For 75 randomized trials published in 2017, we manually extracted and verified data for 21 unique data elements. We uploaded the randomized trials to ExaCT, an online machine learning and text mining tool, and quantified performance by evaluating the tool’s ability to identify the reporting of data elements (reported or not reported), and the relevance of the extracted sentences, fragments, and overall solutions. For each randomized trial, we measured the time to complete manual extraction and verification, and to review and amend the data extracted by ExaCT (simulating semi-automated data extraction). We summarized the relevance of the extractions for each data element using counts and proportions, and calculated the median and interquartile range (IQR) across data elements. We calculated the median (IQR) time for manual and semiautomated data extraction, and overall time savings. Results. The tool identified the reporting (reported or not reported) of data elements with median (IQR) 91 percent (75% to 99%) accuracy. Performance was perfect for four data elements: eligibility criteria, enrolment end date, control arm, and primary outcome(s). Among the top five sentences for each data element at least one sentence was relevant in a median (IQR) 88 percent (83% to 99%) of cases. Performance was perfect for four data elements: funding number, registration number, enrolment start date, and route of administration. Among a median (IQR) 90 percent (86% to 96%) of relevant sentences, pertinent fragments had been highlighted by the system; exact matches were unreliable (median (IQR) 52 percent [32% to 73%]). A median 48 percent of solutions were fully correct, but performance varied greatly across data elements (IQR 21% to 71%). Using ExaCT to assist the first reviewer resulted in a modest time savings compared with manual extraction by a single reviewer (17.9 vs. 21.6 hours total extraction time across 75 randomized trials). Conclusions. Using ExaCT to assist with data extraction resulted in modest gains in efficiency compared with manual extraction. The tool was reliable for identifying the reporting of most data elements. The tool’s ability to identify at least one relevant sentence and highlight pertinent fragments was generally good, but changes to sentence selection and/or highlighting were often required.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'End-to-end verification' for particular source types:
Journal articles
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