Auswahl der wissenschaftlichen Literatur zum Thema „Trace completeness“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Trace completeness" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Trace completeness"
Roşu, Grigore. „Finite-trace linear temporal logic: coinductive completeness“. Formal Methods in System Design 53, Nr. 1 (26.06.2018): 138–63. http://dx.doi.org/10.1007/s10703-018-0321-3.
Der volle Inhalt der QuelleWetzel, Andreas, und Thomas Aigner. „Stratigraphic completeness: Tiered trace fossils provide a measuring stick“. Geology 14, Nr. 3 (1986): 234. http://dx.doi.org/10.1130/0091-7613(1986)14<234:scttfp>2.0.co;2.
Der volle Inhalt der QuelleMateu, Cecilia, Berry Holl, Joris De Ridder und Lorenzo Rimoldini. „Empirical completeness assessment of the Gaia DR2, Pan-STARRS 1, and ASAS-SN-II RR Lyrae catalogues“. Monthly Notices of the Royal Astronomical Society 496, Nr. 3 (12.06.2020): 3291–307. http://dx.doi.org/10.1093/mnras/staa1676.
Der volle Inhalt der QuelleHuynh, Dung T., und Lu Tian. „On Some Equivalence Relations for Probabilistic Processes1“. Fundamenta Informaticae 17, Nr. 3 (01.09.1992): 211–34. http://dx.doi.org/10.3233/fi-1992-17304.
Der volle Inhalt der QuelleMASTROENI, ISABELLA, und ANINDYA BANERJEE. „Modelling declassification policies using abstract domain completeness“. Mathematical Structures in Computer Science 21, Nr. 6 (27.10.2011): 1253–99. http://dx.doi.org/10.1017/s096012951100020x.
Der volle Inhalt der QuelleGrantz, Kyra H., Elizabeth C. Lee, Lucy D’Agostino McGowan, Kyu Han Lee, C. Jessica E. Metcalf, Emily S. Gurley und Justin Lessler. „Maximizing and evaluating the impact of test-trace-isolate programs: A modeling study“. PLOS Medicine 18, Nr. 4 (30.04.2021): e1003585. http://dx.doi.org/10.1371/journal.pmed.1003585.
Der volle Inhalt der QuelleBogdanova, Galina, Todor Todorov und Stefka Kancheva. „Virtual Museum of Russian Bells in Bulgaria“. Digital Presentation and Preservation of Cultural and Scientific Heritage 7 (10.09.2017): 215–22. http://dx.doi.org/10.55630/dipp.2017.7.19.
Der volle Inhalt der QuelleDattilo, Anne, Natalie M. Batalha und Steve Bryson. „A Unified Treatment of Kepler Occurrence to Trace Planet Evolution. I. Methodology“. Astronomical Journal 166, Nr. 3 (22.08.2023): 122. http://dx.doi.org/10.3847/1538-3881/acebc8.
Der volle Inhalt der QuelleKnorr, W., V. Lehsten und A. Arneth. „Determinants and predictability of global wildfire emissions“. Atmospheric Chemistry and Physics 12, Nr. 15 (01.08.2012): 6845–61. http://dx.doi.org/10.5194/acp-12-6845-2012.
Der volle Inhalt der QuelleHertz, J., und R. Pani. „Investigation of the completeness of digestion procedures prior to voltammetric trace metal analysis of olive leaves“. Fresenius' Zeitschrift für analytische Chemie 328, Nr. 6 (Januar 1987): 487–91. http://dx.doi.org/10.1007/bf00475970.
Der volle Inhalt der QuelleDissertationen zum Thema "Trace completeness"
Syed, Mohammad Imran. „Wireless passive measurements : tool, redundancy, measurements, and analyses“. Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS265.
Der volle Inhalt der QuelleUnderstanding wireless traffic is fundamental for improving networks and designing advanced algorithms and protocols. In this context, passive measurements have the edge over active measurements, as there is no requirement for any modification in existing network devices. Passive measurements are often less expensive and easier to deploy than other methods. This approach involves monitoring the wireless medium and collecting data on various network parameters, such as signal strength, channel occupancy, and packet loss. It consists of deploying multiple sniffers throughout the target area (sniffers are devices operating in monitor mode that collect the wireless packets regardless of their nature). However, one of the main challenges with passive measurements is ensuring trace completeness, or the ability to collect a complete and accurate dataset. We know that a single sniffer cannot capture all the traffic due to the inherent characteristics of the wireless medium where the environment can be highly dynamic and unpredictable. Several factors can impact trace completeness in wireless passive measurements. These include environmental factors, such as interference from other wireless devices, changes in the physical environment (such as moving objects), and variations in wireless signal propagation due to changes in atmospheric conditions. Additionally, issues with the measurement equipment itself, such as calibration errors or data processing issues, can also impact trace completeness. The importance of trace completeness in wireless passive measurements cannot be overstated. Inaccurate or incomplete data can lead to incorrect conclusions about network performance, which can have significant implications for network planning, optimization, and troubleshooting. For example, incomplete data can result in missed opportunities to identify and address network issues, and incorrect or incomplete trajectory reconstruction. In this thesis, we study the quality of traces captured by a sniffer and investigate the resulting improvements by introducing redundancy in the number of sniffers. We explore the impact of the following two aspects on the quality of wireless traces: the number of sniffing devices and the type of hardware used. We study the variation in the Received Signal Strength Indicator (RSSI) and its impact on distance estimation. The analysis is helped by the development of a readily-usable and easily-available tool, called PyPal, for the synchronization and merging of Wi-Fi traces collected simultaneously
Bahouli, Bassem. „Caracterisations de champs de matrices, potentiels matrices et applications aux operateurs traces“. Thesis, Pau, 2021. http://www.theses.fr/2021PAUU3053.
Der volle Inhalt der QuelleMany authors have used stress fields to solve the equilibrium equation of continuum me- chanics. Airy (1863) solved the two-dimensional case, Maxwell (1870) and Morera (1892) solved the three-dimensional case. The above solutions are special cases of those of Beltrami (1892). Gurtin gave an example of solutions that do not have Beltrami’s S = CurlCurlA representation. He showed that if the domain Ω is regular, then this representation is complete in the class of regular stress fields which are self-equilibrated.My thesis title is ”Characterizations of matrix fields, potential matrices and applications to trace operators”. In this work, we are interested by showing many characterizations ofvector fields, of matrix fields and especially by generalizing the result of Gurtin in the case when the open set and the stress fields are not regular.This thesis consists of five chapters. The first chapter presents the research problem ad- dressed in this thesis. It also presents the origin of the subject of research.In the second chapter, we study the operator . In particular, the existence of potential vectors in different functional frameworks.In Chapters 3 and 4, we will show some versions of Beltrami’s completeness and we deduce some Helmholtz decomopsitions for symmetric matrix fields.The last chapter is devoted to the study of the image of different trace operators of functions W 2,p (Ω), W 3,p (Ω) when Ω is a bounded open of R 2 with Lipschitz boundary. The essential ingredient is given by the Airy’s function or by the Beltrami representation
Buchteile zum Thema "Trace completeness"
Roşu, Grigore. „Finite-Trace Linear Temporal Logic: Coinductive Completeness“. In Runtime Verification, 333–50. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-46982-9_21.
Der volle Inhalt der QuelleMeyer, Raphaël, und Antoine Petit. „Expressive completeness of LTrL on finite traces: An algebraic proof“. In STACS 98, 533–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0028588.
Der volle Inhalt der QuelleDas, Anupam, und Marianna Girlando. „Cyclic Proofs, Hypersequents, and Transitive Closure Logic“. In Automated Reasoning, 509–28. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-10769-6_30.
Der volle Inhalt der QuelleMatsuura, Toshiyuki, und Banri Ito. „Intra-Firm Trade and Contract Completeness: Evidence from Japanese Foreign-Affiliated Firms“. In Internationalization of Japanese Firms, 151–69. Tokyo: Springer Japan, 2014. http://dx.doi.org/10.1007/978-4-431-54532-3_8.
Der volle Inhalt der QuelleHsu, Tzu-Han, César Sánchez, Sarai Sheinvald und Borzoo Bonakdarpour. „Efficient Loop Conditions for Bounded Model Checking Hyperproperties“. In Tools and Algorithms for the Construction and Analysis of Systems, 66–84. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30823-9_4.
Der volle Inhalt der QuelleLi, Elaine, Felix Stutz, Thomas Wies und Damien Zufferey. „Complete Multiparty Session Type Projection with Automata“. In Computer Aided Verification, 350–73. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37709-9_17.
Der volle Inhalt der QuelleГончарова, Аліна В’ячеславівна. „Глава 8. Договори між спадкоємцями щодо розподілу спадщини“. In Серія «Процесуальні науки», 321–57. Київ, Україна: Видавництво "Алерта", 2023. http://dx.doi.org/10.59835/978-617-566-765-1-3-8.
Der volle Inhalt der QuelleLolli, Gabriele. „Logical completeness, truth, and proofs“. In Truth in Mathematics, 117–30. Oxford University PressOxford, 1998. http://dx.doi.org/10.1093/oso/9780198514763.003.0006.
Der volle Inhalt der QuelleMelamed, Daniel R. „Rethinking Bach Codes“. In Rethinking Bach, 227–50. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780190943899.003.0010.
Der volle Inhalt der QuelleBronowski, Ada. „The Syntax of Lekta“. In The Stoics on Lekta, 383–432. Oxford University Press, 2019. http://dx.doi.org/10.1093/oso/9780198842880.003.0009.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Trace completeness"
Widom, J., D. Gries und F. B. Schneider. „Completeness and incompleteness of trace-based network proof systems“. In the 14th ACM SIGACT-SIGPLAN symposium. New York, New York, USA: ACM Press, 1987. http://dx.doi.org/10.1145/41625.41628.
Der volle Inhalt der QuelleXu, Xianghua, Chao Tong und Jian Wan. „Improve the Completeness of Passive Monitoring Trace in Wireless Sensor Network“. In 2010 Asia-Pacific Services Computing Conference (APSCC). IEEE, 2010. http://dx.doi.org/10.1109/apscc.2010.112.
Der volle Inhalt der QuelleSudarev, A. V. „Low-Toxic Method of Fuel Firing in Gas Turbine Micro-Flame Combustors“. In ASME 1990 International Gas Turbine and Aeroengine Congress and Exposition. American Society of Mechanical Engineers, 1990. http://dx.doi.org/10.1115/90-gt-101.
Der volle Inhalt der QuelleBasina, Polina, Vyacheslav Goiko, Evgeny Petrov und Vyacheslav Bakulin. „Classification community publications of the «VKontakte» for assessing the quality of life of the population“. In Dialogue. RSUH, 2022. http://dx.doi.org/10.28995/2075-7182-2022-21-1001-1016.
Der volle Inhalt der QuelleLengu, Roald, Paolo Missier, Alvaro A. A. Fernandes, Giovanna Guerrini und Marco Mesiti. „Time-completeness trade-offs in record linkage using adaptive query processing“. In the 12th International Conference. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1516360.1516458.
Der volle Inhalt der QuelleDe Stefano, Claudio, A. Della Cioppa und Angelo Marcelli. „Modeling the trade-off between completeness and consistency in genetic-based handwritten character prototyping“. In Electronic Imaging '99, herausgegeben von Daniel P. Lopresti und Jiangying Zhou. SPIE, 1999. http://dx.doi.org/10.1117/12.335823.
Der volle Inhalt der QuelleEray, Ekin, Carl T. Haas, Derek Rayside und Mani Golparvar-Fard. „A Conceptual Framework for Tracking Design Completeness of the Track Line Discipline in Mass Rapid Transit Projects“. In 34th International Symposium on Automation and Robotics in Construction. International Association for Automation and Robotics in Construction (IAARC), 2018. http://dx.doi.org/10.22260/isarc2018/0036.
Der volle Inhalt der QuelleWalters, Robert, Vinodhini Comandur und Karen Feigh. „3D Conformal Pilot Cueing for Rotorcraft Shipboard Landings: A Time Horizon Parametric Study“. In Vertical Flight Society 77th Annual Forum & Technology Display. The Vertical Flight Society, 2021. http://dx.doi.org/10.4050/f-0077-2021-16750.
Der volle Inhalt der QuelleAkintunde, Michael E., Elena Botoeva, Panagiotis Kouvaros und Alessio Lomuscio. „Verifying Strategic Abilities of Neural-symbolic Multi-agent Systems“. In 17th International Conference on Principles of Knowledge Representation and Reasoning {KR-2020}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/kr.2020/3.
Der volle Inhalt der QuelleCesen, Fabricio, P. Gyanesh Patra und Christian Rothenberg. „BB-Gen: A Packet Crafter for Data Plane Evaluation“. In XXXVI Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos. Sociedade Brasileira de Computação - SBC, 2018. http://dx.doi.org/10.5753/sbrc_estendido.2018.14174.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Trace completeness"
Widom, Jennifer, David Gries und Fred B. Schneider. Trace-Based Network Proof Systems: Expressiveness and Completeness. Fort Belvoir, VA: Defense Technical Information Center, Februar 1989. http://dx.doi.org/10.21236/ada204828.
Der volle Inhalt der Quelle