Auswahl der wissenschaftlichen Literatur zum Thema „Parse data“
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 "Parse data" 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 "Parse data"
Marimon, Montserrat, Núria Bel und Lluís Padró. „Automatic Selection of HPSG-Parsed Sentences for Treebank Construction“. Computational Linguistics 40, Nr. 3 (September 2014): 523–31. http://dx.doi.org/10.1162/coli_a_00190.
Der volle Inhalt der QuelleKallmeyer, Laura, und Wolfgang Maier. „Data-Driven Parsing using Probabilistic Linear Context-Free Rewriting Systems“. Computational Linguistics 39, Nr. 1 (März 2013): 87–119. http://dx.doi.org/10.1162/coli_a_00136.
Der volle Inhalt der QuelleDehbi, Y., C. Staat, L. Mandtler und L. Pl¨umer. „INCREMENTAL REFINEMENT OF FAÇADE MODELS WITH ATTRIBUTE GRAMMAR FROM 3D POINT CLOUDS“. ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences III-3 (06.06.2016): 311–16. http://dx.doi.org/10.5194/isprsannals-iii-3-311-2016.
Der volle Inhalt der QuelleDehbi, Y., C. Staat, L. Mandtler und L. Pl¨umer. „INCREMENTAL REFINEMENT OF FAÇADE MODELS WITH ATTRIBUTE GRAMMAR FROM 3D POINT CLOUDS“. ISPRS Annals of Photogrammetry, Remote Sensing and Spatial Information Sciences III-3 (06.06.2016): 311–16. http://dx.doi.org/10.5194/isprs-annals-iii-3-311-2016.
Der volle Inhalt der QuelleToutanova, Kristina, Aria Haghighi und Christopher D. Manning. „A Global Joint Model for Semantic Role Labeling“. Computational Linguistics 34, Nr. 2 (Juni 2008): 161–91. http://dx.doi.org/10.1162/coli.2008.34.2.161.
Der volle Inhalt der QuelleHomayounfar, Hooman, und Fangju Wang. „Sibling‐First Data Organization for Parse‐Free XML Data Processing“. International Journal of Web Information Systems 2, Nr. 3/4 (27.09.2007): 176–86. http://dx.doi.org/10.1108/17440080780000298.
Der volle Inhalt der QuelleClark, Stephen, und James R. Curran. „Wide-Coverage Efficient Statistical Parsing with CCG and Log-Linear Models“. Computational Linguistics 33, Nr. 4 (Dezember 2007): 493–552. http://dx.doi.org/10.1162/coli.2007.33.4.493.
Der volle Inhalt der QuelleAmmar, Waleed, George Mulcaire, Miguel Ballesteros, Chris Dyer und Noah A. Smith. „Many Languages, One Parser“. Transactions of the Association for Computational Linguistics 4 (Dezember 2016): 431–44. http://dx.doi.org/10.1162/tacl_a_00109.
Der volle Inhalt der QuelleRioth, Matthew J., Ramya Thota, David B. Staggs, Douglas B. Johnson und Jeremy L. Warner. „Pragmatic precision oncology: the secondary uses of clinical tumor molecular profiling“. Journal of the American Medical Informatics Association 23, Nr. 4 (28.03.2016): 773–76. http://dx.doi.org/10.1093/jamia/ocw002.
Der volle Inhalt der QuelleZou, Feng, Xingshu Chen, Yonggang Luo, Tiemai Huang, Zhihong Liao und Keer Song. „Spray: Streaming Log Parser for Real-Time Analysis“. Security and Communication Networks 2022 (06.09.2022): 1–11. http://dx.doi.org/10.1155/2022/1559270.
Der volle Inhalt der QuelleDissertationen zum Thema "Parse data"
Mansfield, Martin F. „Design of a generic parse tree for imperative languages“. Virtual Press, 1992. http://liblink.bsu.edu/uhtbin/catkey/834617.
Der volle Inhalt der QuelleDepartment of Computer Science
Andrén, August, und Patrik Hagernäs. „Data-parallel Acceleration of PARSEC Black-Scholes Benchmark“. Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-128607.
Der volle Inhalt der QuelleAlvestad, Gaute Odin, Ole Martin Gausnes und Ole-Jakob Kråkenes. „Development of a Demand Driven Dom Parser“. Thesis, Norwegian University of Science and Technology, Department of Computer and Information Science, 2006. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9311.
Der volle Inhalt der QuelleXML is a tremendous popular markup language in internet applications as well as a storage format. XML document access is often done through an API, and perhaps the most important of these is the W3C DOM. The recommendation from W3C defines a number of interfaces for a developer to access and manipulate XML documents. The recommendation does not define implementation specific approaches used behind the interfaces. A problem with the W3C DOM approach however, is that documents often are loaded in to memory as a node tree of objects, representing the structure of the XML document. This tree is memory consuming and can take up to 4-10 times the document size. Lazy processing have been proposed, building the node tree as it accesses new parts of the document. But when the whole document has been accessed, the overhead compared to traditional parsers, both in terms of memory usage and performance, is high. In this thesis a new approach is introduced. With the use of well known indexing schemes for XML, basic techniques for reducing memory consumption, and principles for memoryhandling in operation systems, a new and alternative approach is introduced. By using a memory cache repository for DOM nodes and simultaneous utilize principles for lazy processing, the proposed implementation has full control over memory consumption. The proposed prototype is called Demand Driven Dom Parser, D3P. The proposed approach removes least recently used nodes from the memory when the cache has exceeded its memory limit. This makes the D3P able to process the document with low memory requirements. An advantage with this approach is that the parser is able to process documents that exceed the size of the main memory, which is impossible with traditional approaches. The implementation is evaluated and compared with other implementations, both lazy and traditional parsers that builds everything in memory on load. The proposed implementation performs well when the bottleneck is memory usage, because the user can set the desired amount of memory to be used by the XML node tree. On the other hand, as the coverage of the document increases, time spend processing the node tree grows beyond what is used by traditional approaches.
Seppecher, Manon. „Mining call detail records to reconstruct global urban mobility patterns for large scale emissions calculation“. Electronic Thesis or Diss., Lyon, 2022. http://www.theses.fr/2022LYSET002.
Der volle Inhalt der QuelleRoad traffic contributes significantly to atmospheric emissions in urban areas, a major issue in the fight against climate change. Therefore, joint monitoring of road traffic and related emissions is essential for urban public decision-making. And beyond this kind of procedure, public authorities need methods for evaluating transport policies according to environmental criteria.Coupling traffic models with traffic-related emission models is a suitable response to this need. However, integrating this solution into decision support tools requires a refined and dynamic char-acterization of urban mobility. Cell phone data, particularly Call Detail Records, are an interesting alternative to traditional data to estimate this mobility. They are rich, massive, and available worldwide. However, their use in literature for systematic traffic characterization has remained limited. It is due to low spatial resolution and temporal sampling rates sensitive to communication behaviors.This Ph.D. thesis investigates the estimation of traffic variables necessary for calculating air emis-sions (total distances traveled and average traffic speeds) from such data, despite their biases. The first significant contribution is to articulate methods of classification of individuals with two distinct approaches of mobility reconstruction. A second contribution is developing a method for estimating traffic speeds based on the fusion of large amounts of travel data. Finally, we present a complete methodological process of modeling and data processing. It relates the methods proposed in this thesis coherently
Shah, Meelap (Meelap Vijay). „PARTE : automatic program partitioning for efficient computation over encrypted data“. Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/79239.
Der volle Inhalt der QuelleCataloged from PDF version of thesis.
Includes bibliographical references (p. 45-47).
Many modern applications outsource their data storage and computation needs to third parties. Although this lifts many infrastructure burdens from the application developer, he must deal with an increased risk of data leakage (i.e. there are more distributed copies of the data, the third party may be insecure and/or untrustworthy). Oftentimes, the most practical option is to tolerate this risk. This is far from ideal and in case of highly sensitive data (e.g. medical records, location history) it is unacceptable. We present PARTE, a tool to aid application developers in lowering the risk of data leakage. PARTE statically analyzes a program's source, annotated to indicate types which will hold sensitive data (i.e. data that should not be leaked), and outputs a partitioned version of the source. One partition will operate only on encrypted copies of sensitive data to lower the risk of data leakage and can safely be run by a third party or otherwise untrusted environment. The second partition must have plaintext access to sensitive data and therefore should be run in a trusted environment. Program execution will flow between the partitions, levaraging third party resources when data leakage risk is low. Further, we identify operations which, if efficiently supported by some encryption scheme, would improve the performance of partitioned execution. To demonstrate the feasiblity of these ideas, we implement PARTE in Haskell and run it on a web application, hpaste, which allows users to upload and share text snippets. The partitioned hpaste services web request 1.2 - 2.5 x slower than the original hpaste. We find this overhead to be moderately high. Moreover, the partitioning does not allow much code to run on encrypted data. We discuss why we feel our techniques did not produce an attractive partitioning and offer insight on new research directions which could yield better results.
by Meelap Shah.
S.M.
Bucciarelli, Stefano. „Un compilatore per un linguaggio per smart contract intrinsecamente tipato“. Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/19573/.
Der volle Inhalt der QuelleDall, Rasmus. „Statistical parametric speech synthesis using conversational data and phenomena“. Thesis, University of Edinburgh, 2017. http://hdl.handle.net/1842/29016.
Der volle Inhalt der QuelleErozel, Guzen. „Natural Language Interface On A Video Data Model“. Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606251/index.pdf.
Der volle Inhalt der QuelleAbel, Donald Randall. „The Parser Converter Loader: An Implementation of the Computational Chemistry Output Language (CCOL)“. PDXScholar, 1995. https://pdxscholar.library.pdx.edu/open_access_etds/4926.
Der volle Inhalt der QuelleSodhi, Bir Apaar Singh. „DATA MINING: TRACKING SUSPICIOUS LOGGING ACTIVITY USING HADOOP“. CSUSB ScholarWorks, 2016. https://scholarworks.lib.csusb.edu/etd/271.
Der volle Inhalt der QuelleBücher zum Thema "Parse data"
Müller-Landmann, Sonja. Corpus-based parse pruning: Applying empirical data to symbolic knowledge. Saarbrücken: DFKI, 2000.
Den vollen Inhalt der Quelle findenBateson, Teresa M. Report on parsing and construction of prototype that will accept freeform text data from publishers' sites and parse this data for automatic entry to book database. [s.l: The Author], 2001.
Den vollen Inhalt der Quelle findenservice), SpringerLink (Online, Hrsg. Crittografia nel Paese delle Meraviglie. Milano: Springer Milan, 2012.
Den vollen Inhalt der Quelle findenMiller, David. Commodore 128 data file programming. Blue Ridge Summit, USA: TAB Books, 1987.
Den vollen Inhalt der Quelle findenReading machines: Toward an algorithmic criticism. Urbana, Ill: University of Illinois Press, 2011.
Den vollen Inhalt der Quelle findenBlum, Caroline, und Reisman David. Driven to abstraction: Caroline Blum, Lori Ellison, Dana James, Melanie Parke, Lizzie Scott. New York, NY: New Bohemia Press, 2017.
Den vollen Inhalt der Quelle findenFred, Karlsson, Hrsg. Constraint grammar: A language-independent system for parsing unrestricted text. Berlin: Mouton de Gruyter, 1995.
Den vollen Inhalt der Quelle findenRachel, Cohen, und Ackermann Edith, Hrsg. Quand l'ordinateur parle--: Utilisation de la synthèse vocale dans l'apprentissage et le perfectionnement de la langue écrite. Paris: Presses universitaires de France, 1992.
Den vollen Inhalt der Quelle findenPreston Opera House (Ont.), Hrsg. Operetta, John Gilpin to date, and farce, Ici on parle français (French spoken here): Under auspices Y.M.R. & R.R., Preston Opera House, May 7th : Miss Dora Amelin, accompanist, Mr. H.L. Read, director .. [Cambridge, Ont.?: s.n., 1987.
Den vollen Inhalt der Quelle findenCaldelli, Maria Letizia, Mireille Cébeillac-Gervasoni, Nicolas Laubry, Ilaria Manzini, Raffaella Marchesini, Filippo Marini Recchia und Fausto Zevi. Epigrafia ostiense dopo il CIL. Venice: Edizioni Ca' Foscari, 2018. http://dx.doi.org/10.30687/978-88-6969-229-1.
Der volle Inhalt der QuelleBuchteile zum Thema "Parse data"
Kulkarni, Adithya, Nasim Sabetpour, Alexey Markin, Oliver Eulenstein und Qi Li. „CPTAM: Constituency Parse Tree Aggregation Method“. In Proceedings of the 2022 SIAM International Conference on Data Mining (SDM), 630–38. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2022. http://dx.doi.org/10.1137/1.9781611977172.71.
Der volle Inhalt der QuelleMardan, Azat. „Getting Data from Backend Using jQuery and Parse“. In Full Stack JavaScript, 67–126. Berkeley, CA: Apress, 2018. http://dx.doi.org/10.1007/978-1-4842-3718-2_3.
Der volle Inhalt der QuellePatchala, Jagadeesh, Raj Bhatnagar und Sridharan Gopalakrishnan. „Author Attribution of Email Messages Using Parse-Tree Features“. In Machine Learning and Data Mining in Pattern Recognition, 313–27. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-21024-7_21.
Der volle Inhalt der QuelleChang, Fei, Li Zhu, Jin Liu, Jin Yuan und Xiaoxia Deng. „A Universal Heterogeneous Data Integration Standard and Parse Algorithm in Real-Time Database“. In Lecture Notes in Electrical Engineering, 709–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-34522-7_76.
Der volle Inhalt der QuelleJin, Zhijing, und Rada Mihalcea. „Natural Language Processing for Policymaking“. In Handbook of Computational Social Science for Policy, 141–62. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-16624-2_7.
Der volle Inhalt der QuelleNambiar, Aparna, B. Premjith, J. P. Sanjanasri und K. P. Soman. „BERT-Based Dependency Parser for Hindi“. In Advances in Data Science and Computing Technologies, 421–27. Singapore: Springer Nature Singapore, 2023. http://dx.doi.org/10.1007/978-981-99-3656-4_43.
Der volle Inhalt der QuelleSkopik, Florian, Markus Wurzenberger und Max Landauer. „A Concept for a Tree-Based Log Parser Generator“. In Smart Log Data Analytics, 131–49. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-74450-2_7.
Der volle Inhalt der QuellePapadopoulos, Constantinos V. „On the parallelism of data“. In PARLE'94 Parallel Architectures and Languages Europe, 414–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58184-7_119.
Der volle Inhalt der QuelleHurson, A. R., B. Lee und B. Shirazi. „Hybrid structure: A scheme for handling data structures in a data flow environment“. In PARLE '89 Parallel Architectures and Languages Europe, 323–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3540512845_48.
Der volle Inhalt der QuelleGlück-Hiltrop, Elvira, Matthias Ramlow und Ute Schürfeld. „The sto//mann data flow machine“. In PARLE '89 Parallel Architectures and Languages Europe, 433–57. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/3540512845_55.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Parse data"
Yoshida, Satoshi, und Takuya Kida. „An Efficient Algorithm for Almost Instantaneous VF Code Using Multiplexed Parse Tree“. In 2010 Data Compression Conference. IEEE, 2010. http://dx.doi.org/10.1109/dcc.2010.27.
Der volle Inhalt der QuelleHenderson, James, und Ivan Titov. „Data-defined kernels for parse reranking derived from probabilistic models“. In the 43rd Annual Meeting. Morristown, NJ, USA: Association for Computational Linguistics, 2005. http://dx.doi.org/10.3115/1219840.1219863.
Der volle Inhalt der QuelleDeva Priyaa, B., und M. Indra Devi. „Fragmented query parse tree based SQL injection detection system for web applications“. In 2016 International Conference on Computing Technologies and Intelligent Data Engineering (ICCTIDE). IEEE, 2016. http://dx.doi.org/10.1109/icctide.2016.7725367.
Der volle Inhalt der QuelleGoraya, Yassar, Ali Al Felasi, Nicolas Daynac, Stuart Walley, Marc-Antoine Dupont, Hiroyuki Inoue, Ahmed Mubarak Al Khamiri und Alia Hasan Hindi. „Delineating Karsts, Small-Scale Faults, and Fractures by Using a Global Stratigraphic Framework to Integrate Conventional Seismic Attributes with Diffraction Imaging in a Giant Offshore Field, Abu Dhabi.“ In ADIPEC. SPE, 2022. http://dx.doi.org/10.2118/211628-ms.
Der volle Inhalt der QuelleYu, Jinhui, Xinyu Luan und Yu Sun. „An Automated Analytics Engine for College Program Selection using Machine Learning and Big Data Analysis“. In 2nd International Conference on Machine Learning Techniques and NLP (MLNLP 2021). Academy and Industry Research Collaboration Center (AIRCC), 2021. http://dx.doi.org/10.5121/csit.2021.111417.
Der volle Inhalt der QuelleAfzalan, Milad, Farrokh Jazizadeh und Mehdi Ahmadian. „Toward Railway Automated Defect Detection From Onboard Data Using Deep Learning“. In 2020 Joint Rail Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/jrc2020-8031.
Der volle Inhalt der QuelleIsmail, Mohamed. „An Excel Add-in for Accreditation Data Collection and Auto Grading Sheets (AGS): A Canadian Experience“. In ASME 2018 International Mechanical Engineering Congress and Exposition. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/imece2018-88096.
Der volle Inhalt der QuelleSponsler, Jeffrey L., und Charles Parker. „Lab Parser: A Parser for Medical Lab data“. In Modelling, Simulation and Identification. Calgary,AB,Canada: ACTAPRESS, 2018. http://dx.doi.org/10.2316/p.2018.858-002.
Der volle Inhalt der QuelleAhmad, Isaar, Sanjog Patil und Smruti R. Sarangi. „HPXA: A highly parallel XML parser“. In 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 2018. http://dx.doi.org/10.23919/date.2018.8342012.
Der volle Inhalt der QuelleYi, Michael, Pradeepkumar Ashok, Dawson Ramos, Spencer Bohlander, Taylor Thetford, Mojtaba Shahri, Mickey Noworyta, Trey Peroyea und Michael Behounek. „Automated Merging of Time Series and Textual Operations Data to Extract Technical Limiter Re-Design Recommendations“. In IADC/SPE International Drilling Conference and Exhibition. SPE, 2022. http://dx.doi.org/10.2118/208745-ms.
Der volle Inhalt der QuelleBerichte der Organisationen zum Thema "Parse data"
Apicella, M. L., J. Slaton und B. Levi. Integrated Information Support System (IISS). Volume 5. Common Data Model Subsystem. Part 13. Neutral Data Manipulation Language (NDML) Precompiler Parse NDML Product Specification. Fort Belvoir, VA: Defense Technical Information Center, September 1990. http://dx.doi.org/10.21236/ada250453.
Der volle Inhalt der QuelleApicella, M. L., J. Slaton und B. Levi. Integrated Information Support System (IISS). Volume 5. Common Data Model Subsystem. Part 12. Neutral Data Manipulation Language (NDML) Precompiler Parse Procedure Division Product Specification. Fort Belvoir, VA: Defense Technical Information Center, September 1990. http://dx.doi.org/10.21236/ada250452.
Der volle Inhalt der QuelleApicella, M. L., J. Slaton und B. Levi. Integrated Information Support System (IISS). Volume 5. Common Data Model Subsystem. Part 11. Neutral Data Manipulation Language (NDML) Precompiler Parse Application Procedure Division Product Specification. Fort Belvoir, VA: Defense Technical Information Center, September 1990. http://dx.doi.org/10.21236/ada252452.
Der volle Inhalt der QuelleTaylor, Shawna, Jake Carlson, Joel Herndon, Alicia Hofelich Mohr, Wendy Kozlowski, Jennifer Moore, Jonathan Petters und Cynthia Hudson Vitale. Public Access Data Management and Sharing Activities for Academic Administration and Researchers. Association of Research Libraries, November 2022. http://dx.doi.org/10.29242/report.rads2022.
Der volle Inhalt der QuelleChen, Yongzhou, Ammar Tahir und Radhika Mittal. Controlling Congestion via In-Network Content Adaptation. Illinois Center for Transportation, September 2022. http://dx.doi.org/10.36501/0197-9191/22-018.
Der volle Inhalt der QuelleBotero Bolívar, Sara, Víctor De La Espriella Palmett, José Carlos Sánchez Vega, Juan Felipe Soto Restrepo und Jairo Gándara. Perlas clínicas: Guías de la Sociedad Europea de Cardiología (ESC) 2020 para el manejo del síndrome coronario agudo sin elevación del segmento ST. Parte 1/2. Facultad de Medicina Universidad de Antioquia, Juni 2023. http://dx.doi.org/10.59473/medudea.pc.2023.10.
Der volle Inhalt der QuelleCalijuri, Mónica, Gustavo A. GArcía, Juan José Bravo und José Elías Feres de Almeida. Documentos tributarios electrónicos y big data económica para el control tributario y aduanero: utilización y codificación de los estados financieros electrónicos para control fiscal y datos económico en América Latina y el Caribe: Tomo 3. Banco Interamericano de Desarrollo, Juli 2023. http://dx.doi.org/10.18235/0005000.
Der volle Inhalt der QuelleFulponi, Juan Ignacio, und Cristian Moleres. Metodología para el estudio de la movilidad con datos de Facebook: generación de matrices origen-destino en ciudades de América Latina y análisis para Buenos Aires. Banco Interamericano de Desarrollo, Dezember 2022. http://dx.doi.org/10.18235/0004591.
Der volle Inhalt der QuelleMeneses-González, María Fernanda, und Diego Fernando Cuesta-Mora. Informe especial de estabilidad financiera: liquidez de mercado - Primer semestre de 2021. Banco de la República de Colombia, Juni 2021. http://dx.doi.org/10.32468/liqu-mer.sem1-2021.
Der volle Inhalt der QuelleMeneses-González, María Fernanda, und Mariana Escobar. Informe especial de estabilidad financiera: liquidez de mercado - Segundo semestre de 2022. Banco de la República Colombia, Dezember 2022. http://dx.doi.org/10.32468/liqu-mer.sem2-2022.
Der volle Inhalt der Quelle