Academic literature on the topic 'Eventus (Computer file)'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Eventus (Computer file).'
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 "Eventus (Computer file)"
Syafar, Faisal, Halimah Husain, Sutarsih Suhaeb, Putri Ida, and Supriadi. "Blowfish Advanced CS Untuk Solusi Keamanan Sistem Komputer Sekolah." Vokatek : Jurnal Pengabdian Masyarakat 1, no. 3 (October 30, 2023): 353–61. http://dx.doi.org/10.61255/vokatekjpm.v1i3.271.
Full textXu, Haochen, Guanhua Fang, Yunxiao Chen, Jingchen Liu, and Zhiliang Ying. "Latent Class Analysis of Recurrent Events in Problem-Solving Items." Applied Psychological Measurement 42, no. 6 (April 9, 2018): 478–98. http://dx.doi.org/10.1177/0146621617748325.
Full textAlkenani, Jawad, and Khulood Ahmed Nassar. "Enhance work for java based network analyzer tool used to analyze network simulator files." Indonesian Journal of Electrical Engineering and Computer Science 29, no. 2 (February 1, 2023): 954. http://dx.doi.org/10.11591/ijeecs.v29.i2.pp954-962.
Full textGroh, Micah, Norman Buchanan, Derek Doyle, James B. Kowalkowski, Marc Paterno, and Saba Sehrish. "PandAna: A Python Analysis Framework for Scalable High Performance Computing in High Energy Physics." EPJ Web of Conferences 251 (2021): 03033. http://dx.doi.org/10.1051/epjconf/202125103033.
Full textMarr, Charles. "210 CUSTOM-PRINTED ELECTRONIC FACT SHEETS AT HORTICULTURAL EVENTS." HortScience 29, no. 5 (May 1994): 459d—459. http://dx.doi.org/10.21273/hortsci.29.5.459d.
Full textBántay, László, Gyula Dörgö, Ferenc Tandari, and János Abonyi. "Simultaneous Process Mining of Process Events and Operator Actions for Alarm Management." Complexity 2022 (September 19, 2022): 1–13. http://dx.doi.org/10.1155/2022/8670154.
Full textMarjai, Péter, Péter Lehotay-Kéry, and Attila Kiss. "The Use of Template Miners and Encryption in Log Message Compression." Computers 10, no. 7 (June 23, 2021): 83. http://dx.doi.org/10.3390/computers10070083.
Full textStarenkyi, Ivan, and Oleksandra Donchenko. "DETECTION OF TRACES OF THE USE OF SOFTWARE SUCH AS «STEALER» IN THE MEMORY OF THE STORAGE DEVICE." Criminalistics and Forensics, no. 68 (July 3, 2023): 469–77. http://dx.doi.org/10.33994/kndise.2023.68.46.
Full textN. Sangeeta and Seung Yeob Nam. "Blockchain and Interplanetary File System (IPFS)-Based Data Storage System for Vehicular Networks with Keyword Search Capability." Electronics 12, no. 7 (March 24, 2023): 1545. http://dx.doi.org/10.3390/electronics12071545.
Full textMohamed, Mohamed, and James C. L. Chow. "Acomprehensive computer database for medical physics on-call program." Journal of Radiotherapy in Practice 19, no. 1 (May 14, 2019): 10–14. http://dx.doi.org/10.1017/s1460396919000244.
Full textDissertations / Theses on the topic "Eventus (Computer file)"
Nguyen, Henrik. "Evaluating fine-grained events foran Event Sourcing proof-of-concept." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-254657.
Full textDatakonvertering för utvecklande händelser i ett Event Sourcing System är en komplex fråga som kräver att systemet är enkelt underhållning. Det finns förslag på sätt att hantera datakonvertering idag, vilket kombinerar olika metoder i ett ramverk. Det finns emellertid en brist på undersökning av olika och alternativa metoder för att hantera den komplexa orsaken.Denna avhandling undersöker datakonvertering med finkorniga händelser. Syftet är att utforska metoder och utvidga kunskap för hantering av datakonvertering genom att använda attributdrivna händelser som kallas finkorniga händelser. Målet var att bygga ett proof-of-concept som bevarar egenskaperpålitlighet och tillgängligt och som dessa specifika händelser.även hanterar datakonvertering förResultaten som hittas genom att använda finkorniga händelser är en minskning av systemkomplexiteten och ett bevis på koncept som upprätthåller de önskade egenskaperna.
Ye, Brian. "An Evaluation on Using Coarse-grained Events in an Event Sourcing Context and its Effects Compared to Fine-grained Events." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-208302.
Full textAtt introducera event sourcing i ett system baserat på en model som använder Create-, Read-, Update- och Delete-operationer (CRUD) kan vara en utmanande uppgift och kräver en omfattande omstrukturering av det nuvarande systemet. Genom att introducera grova händelser är det möjligt att bevara hela strukturen på datan i en CRUD-modell och ändå få fördelarna med event sourcing, för att därigenom undvika en omfattande omarbetning av systemet. Detta arbete undersöker hur stora datamängder kan hanteras genom grova händelser och ändå ge fördelarna med event sourcing, genom att jämföra med det konventionella sättet att använda fina händelser. Datan som undersöks är transaktionsdata på finansiella derivat som matas in i ett datalager. Baserat på forskning implementeras en event sourcing-applikation för både grova och fina händelser, för att mäta skillnaden mellan dessa två händelsetyper. Skillnaden är avgränsad till latens och lagringsutrymme. Applikationen verifieras genom felhantering, exempeldata och profilering för att säkerställa att den inte har några onödiga flaskhalsar. Den resulterande prestandan visar att fina händelser har betydligt större latens än grova händelser i de flesta fallen, medan lagringsutrymmet är strikt mindre för fina händelser.
Chan, Susan Chui-Sheung. "Design and implementation of an event monitor for the unix operating system." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/26187.
Full textScience, Faculty of
Computer Science, Department of
Graduate
Pang, Kenneth K. (Kenneth Kwok Kit) 1976. "Fine-grained event-based access control." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/47532.
Full textIncludes bibliographical references (leaf 46).
by Kenneth K. Pang.
B.S.
M.Eng.
Libardi, Junior José Carlos 1983. "Comparação de simulações por eventos discretos para modelos de fila." [s.n.], 2015. http://repositorio.unicamp.br/jspui/handle/REPOSIP/267737.
Full textDissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Tecnologia
Made available in DSpace on 2018-08-27T17:38:56Z (GMT). No. of bitstreams: 1 LibardiJunior_JoseCarlos_M.pdf: 4110678 bytes, checksum: eee73fe122555a9710247faeceb6f135 (MD5) Previous issue date: 2015
Resumo: A constante evolução do poder computacional aliada ao baixo custo de aquisição, faz com que os computadores sejam indispensáveis para construção de modelos de simulação. Atualmente, a simulação por computador é usada nas mais diversificadas áreas, como previsão meteorológica, dimensionamento de centrais telefônicas, e estudos aerodinâmicos. A presente dissertação valida e comprova a eficácia de modelos de simulação construídos no software Mathematica 10 por meio do software Arena 14.50. Para isso, foi construído um modelo que, sem focar nas condições reais do sistema, simula de forma hipotética (levando em conta apenas o número de canais de comunicação disponíveis e o tempo de médio duração das chamadas) o tráfego oferecido por chamadas de áudio e vídeo em uma ERB (Estação Rádio-Base) CDMA (Code Division Multiple Access) ou GSM (Global System for Mobile) que nesse trabalho, é representada por um sistema de fila. Diversos cenários de tráfego foram analisados utilizando diferentes parâmetros como a quantidade de chamadas ingressantes, tempo de duração da chamada e o número de canais disponíveis. Os resultados finais comprovaram que os modelos de simulação criados no Mathematica 10 são equivalentes aos modelos de simulação construídos no Arena 14.50
Abstract: The constant evolution of power of computers together with their low cost of aquisition, make them indispensable in building of simulation models. Nowadays, computer simulation is used in a variety of areas such weather forecasting, sizing of telephone stations and in aerodynamic studies. This essay validate and proves the effectiveness of these simulation models built on The Mathematica 10 software with the Arena 14.50. In order to do that, a model was built and without focusing on System s real condition, it simulates in a hypothetical way (considering only the number of communication channels available and average length of the calls) The traffic offered by audio and vídeo calls through a RBS (Radio Base Station) CDMA (Code Division Multiple Access) or GSM (Global System for Mobile) which herein is shown through a queue system. Various traffic scenarios were analyzed using different setups, like quantity of incoming calls, length of calls and number of available channels. The final results confirmed that the simulation models built on Mathematica 10 are equivalents to The simulation models built on Arena 14.50
Mestrado
Tecnologia e Inovação
Mestre em Tecnologia
Damchoom, Kriangsak. "An incremental refinement approach to a development of a flash-based file system in Event-B." Thesis, University of Southampton, 2010. https://eprints.soton.ac.uk/165595/.
Full textGideon, John. "The Integration of LlamaOS for Fine-Grained Parallel Simulation." University of Cincinnati / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1377872370.
Full textMaynard, Zachary C. "Designing Compressed Narrative using a Reactive Frame: The Influence of Spatial Relationships and Camera Composition on the Temporal Structure of Story Events." The Ohio State University, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=osu1345491195.
Full textDias, Maria Camila de Avelino Geraldo. "Prediction of uncertainty events using human-computer interaction." Master's thesis, 2018. http://hdl.handle.net/10362/58209.
Full textAckermann, Jacobus Gideon. "Evaluating reasoning heuristics for a hybrid theorem proving platform." Diss., 2018. http://hdl.handle.net/10500/25869.
Full textThe formalisation of first-order logic and axiomatic set theory in the first half of the 20th century—along with the advent of the digital computer—paved the way for the development of automated theorem proving. In the 1950s, the automation of proof developed from proving elementary geometric problems and finding direct proofs for problems in Principia Mathematica by means of simple, human-oriented rules of inference. A major advance in the field of automated theorem proving occurred in 1965, with the formulation of the resolution inference mechanism. Today, powerful Satisfiability Modulo Theories (SMT) provers combine SAT solvers with sophisticated knowledge from various problem domains to prove increasingly complex theorems. The combinatorial explosion of the search space is viewed as one of the major challenges to progress in the field of automated theorem proving. Pioneers from the 1950s and 1960s have already identified the need for heuristics to guide the proof search effort. Despite theoretical advances in automated reasoning and technological advances in computing, the size of the search space remains problematic when increasingly complex proofs are attempted. Today, heuristics are still useful and necessary to discharge complex proof obligations. In 2000, a number of heuristics was developed to aid the resolution-based prover OTTER in finding proofs for set-theoretic problems. The applicability of these heuristics to next-generation theorem provers were evaluated in 2009. The provers Vampire and Gandalf required respectively 90% and 80% of the applicable OTTER heuristics. This dissertation investigates the applicability of the OTTER heuristics to theorem proving in the hybrid theorem proving environment Rodin—a system modelling tool suite for the Event-B formal method. We show that only 2 of the 10 applicable OTTER heuristics were useful when discharging proof obligations in Rodin. Even though we argue that the OTTER heuristics were largely ineffective when applied to Rodin proofs, heuristics were still needed when proof obligations could not be discharged automatically. Therefore, we propose a number of our own heuristics targeted at theorem proving in the Rodin tool suite.
Die formalisering van eerste-orde-logika en aksiomatiese versamelingsteorie in die eerste helfte van die 20ste eeu, tesame met die koms van die digitale rekenaar, het die weg vir die ontwikkeling van geoutomatiseerde bewysvoering gebaan. Die outomatisering van bewysvoering het in die 1950’s ontwikkel vanuit die bewys van elementêre meetkundige probleme en die opspoor van direkte bewyse vir probleme in Principia Mathematica deur middel van eenvoudige, mensgerigte inferensiereëls. Vooruitgang is in 1965 op die gebied van geoutomatiseerde bewysvoering gemaak toe die resolusie-inferensie-meganisme geformuleer is. Deesdae kombineer kragtige Satisfiability Modulo Theories (SMT) bewysvoerders SAT-oplossers met gesofistikeerde kennis vanuit verskeie probleemdomeine om steeds meer komplekse stellings te bewys. Die kombinatoriese ontploffing van die soekruimte kan beskou word as een van die grootste uitdagings vir verdere vooruitgang in die veld van geoutomatiseerde bewysvoering. Baanbrekers uit die 1950’s en 1960’s het reeds bepaal dat daar ’n behoefte is aan heuristieke om die soektog na bewyse te rig. Ten spyte van die teoretiese vooruitgang in outomatiese bewysvoering en die tegnologiese vooruitgang in die rekenaarbedryf, is die grootte van die soekruimte steeds problematies wanneer toenemend komplekse bewyse aangepak word. Teenswoordig is heuristieke steeds nuttig en noodsaaklik om komplekse bewysverpligtinge uit te voer. In 2000 is ’n aantal heuristieke ontwikkel om die resolusie-gebaseerde bewysvoerder OTTER te help om bewyse vir versamelingsteoretiese probleme te vind. Die toepaslikheid van hierdie heuristieke vir die volgende generasie bewysvoerders is in 2009 geëvalueer. Die bewysvoerders Vampire en Gandalf het onderskeidelik 90% en 80% van die toepaslike OTTER-heuristieke nodig gehad. Hierdie verhandeling ondersoek die toepaslikheid van die OTTER-heuristieke op bewysvoering in die hibriede bewysvoeringsomgewing Rodin—’n stelselmodelleringsuite vir die formele Event-B-metode. Ons toon dat slegs 2 van die 10 toepaslike OTTER-heuristieke van nut was vir die uitvoering van bewysverpligtinge in Rodin. Ons voer aan dat die OTTER-heuristieke grotendeels ondoeltreffend was toe dit op Rodin-bewyse toegepas is. Desnieteenstaande is heuristieke steeds nodig as bewysverpligtinge nie outomaties uitgevoer kon word nie. Daarom stel ons ’n aantal van ons eie heuristieke voor wat in die Rodin-suite aangewend kan word.
Ukwenziwa semthethweni kwe-first-order logic kanye ne-axiomatic set theory ngesigamu sokuqala sekhulunyaka lama-20—kanye nokufika kwekhompyutha esebenza ngobuxhakaxhaka bedijithali—kwavula indlela ebheke ekuthuthukisweni kwenqubo-kusebenza yokufakazela amathiyoremu ngekhomyutha. Ngeminyaka yawo-1950, ukuqinisekiswa kobufakazi kwasuselwa ekufakazelweni kwezinkinga zejiyomethri eziyisisekelo kanye nasekutholakaleni kobufakazi-ngqo bezinkinga eziphathelene ne-Principia Mathematica ngokuthi kusetshenziswe imithetho yokuqagula-sakucabangela elula, egxile kubantu. Impumelelo enkulu emkhakheni wokufakazela amathiyoremu ngekhompyutha yenzeka ngowe-1965, ngokwenziwa semthethweni kwe-resolution inference mechanism. Namuhla, abafakazeli abanohlonze bamathiyori abizwa nge-Satisfiability Modulo Theories (SMT) bahlanganisa ama-SAT solvers nolwazi lobungcweti oluvela kwizizinda zezinkinga ezihlukahlukene ukuze bakwazi ukufakazela amathiyoremu okungelula neze ukuwafakazela. Ukukhula ngesivinini kobunzima nobunkimbinkimbi benkinga esizindeni esithile kubonwa njengenye yezinselelo ezinkulu okudingeka ukuthi zixazululwe ukuze kube nenqubekela phambili ekufakazelweni kwamathiyoremu ngekhompyutha. Amavulandlela eminyaka yawo-1950 nawo-1960 asesihlonzile kakade isidingo sokuthi amahuristikhi (heuristics) kube yiwona ahola umzamo wokuthola ubufakazi. Nakuba ikhona impumelelo esiyenziwe kumathiyori ezokucabangela okujulile kusetshenziswa amakhompyutha kanye nempumelelo yobuchwepheshe bamakhompyutha, usayizi wesizinda usalokhu uyinkinga uma kwenziwa imizamo yokuthola ubufakazi obuyinkimbinkimbi futhi obunobunzima obukhudlwana. Namuhla imbala, amahuristikhi asewuziso futhi ayadingeka ekufezekiseni izibopho zobufakazi obuyinkimbinkimbi. Ngowezi-2000, kwathuthukiswa amahuristikhi amaningana impela ukuze kulekelelwe uhlelo-kusebenza olungumfakazeli osekelwe phezu kwesixazululo, olubizwa nge-OTTER, ekutholeni ubufakazi bama-set-theoretic problems. Ukusebenziseka kwalawa mahuristikhi kwizinhlelo-kusebenza ezingabafakazeli bamathiyoremu besimanjemanje kwahlolwa ngowezi-2009. Uhlelo-kusebenza olungumfakazeli, olubizwa nge-Vampire kanye nalolo olubizwa nge-Gandalf zadinga ama-90% kanye nama-80%, ngokulandelana kwazo, maqondana nama-OTTER heuristics afanelekile. Lolu cwaningo luphenya futhi lucubungule ukusebenziseka kwama-OTTER heuristics ekufakazelweni kwamathiyoremu esimweni esiyinhlanganisela sokufakazela amathiyoremu esibizwa nge-Rodin—okuyi-system modelling tool suite eqondene ne-Event-B formal method. Kulolu cwaningo siyabonisa ukuthi mabili kuphela kwayi-10 ama-OTTER heuristics aba wusizo ngenkathi kufezekiswa isibopho sobufakazi ku-Rodin. Nakuba sibeka umbono wokuthi esikhathini esiningi ama-OTTER heuristics awazange abe wusizo uma esetshenziswa kuma-Rodin proofs, amahuristikhi asadingeka ezimweni lapho izibopho zobufakazi zingazenzekelanga ngokwazo ngokulawulwa yizinhlelo-kusebenza zekhompyutha. Ngakho-ke, siphakamisa amahuristikhi ethu amaningana angasetshenziswa ekufakazeleni amathiyoremu ku-Rodin tool suite.
School of Computing
M. Sc. (Computer Science)
Books on the topic "Eventus (Computer file)"
Cowan, Arnold R. Eventus version 7: Software for event studies and CRSP data retrieval : user's guide. Ames, Iowa]: Cowan Research LC, 2002.
Find full textFrancis, Tony. Mac OS 8 revealed. Reading, Mass: Addison-Wesley, 1996.
Find full textWarnke, Martin, and Anne Dippel. Interferences and Events: On Epistemic Shifts in Physics Through Computer Simulations. Saint Philip Street Press, 2020.
Find full textWarnke, Martin, and Anne Dippel. Interferences and Events: On Epistemic Shifts in Physics Through Computer Simulations. Saint Philip Street Press, 2020.
Find full textDippel, Anne. Interferences and Events: On Epistemic Shifts in Physics through Computer Simulations. meson press, 2017.
Find full textThe way of Delphi: Reusing objects, components, properties, and events. Upper Saddle River, N.J: Prentice Hall PTR, 1996.
Find full textSolymar, Laszlo. Getting the Message. 2nd ed. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780198863007.001.0001.
Full textT. Unix System V Release 3.2 Network Programmer's Guide. Prentice Hall, 1991.
Find full textUnix System V/386 Release 3.2 Network Programmer's Guide, Issue 47. Prentice Hall, 1988.
Find full textBook chapters on the topic "Eventus (Computer file)"
Hong, James, Haotian Zhang, Michaël Gharbi, Matthew Fisher, and Kayvon Fatahalian. "Spotting Temporally Precise, Fine-Grained Events in Video." In Lecture Notes in Computer Science, 33–51. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-19833-5_3.
Full textZheng, Lizhou, Peiquan Jin, Jie Zhao, and Lihua Yue. "A Fine-Grained Approach for Extracting Events on Microblogs." In Lecture Notes in Computer Science, 275–83. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10073-9_22.
Full textKhan, Saad, and Simon Parkinson. "Automated Planning of Administrative Tasks Using Historic Events: A File System Case Study." In Computer Communications and Networks, 159–82. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-92624-7_7.
Full textFathalla, Said, and Christoph Lange. "EVENTS: A Dataset on the History of Top-Prestigious Events in Five Computer Science Communities." In Semantics, Analytics, Visualization, 110–20. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-01379-0_8.
Full textDal Lago, Ugo, Giulio Guerrieri, and Willem Heijltjes. "Decomposing Probabilistic Lambda-Calculi." In Lecture Notes in Computer Science, 136–56. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45231-5_8.
Full textDenisov, Vadim, Dirk Fahland, and Wil M. P. van der Aalst. "Unbiased, Fine-Grained Description of Processes Performance from Event Data." In Lecture Notes in Computer Science, 139–57. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-98648-7_9.
Full textHei, Yiming, Qian Li, Caibo Zhou, Rui Sun, Jinglin Yang, Jiawei Sheng, Shu Guo, and Lihong Wang. "A Dual-Classifier Model for General Fine-Grained Event Detection Task." In Communications in Computer and Information Science, 18–27. Singapore: Springer Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-0713-5_3.
Full textRen, Junxiang, Sibo Wang, Ruilin Song, Yuejiao Wu, Yizhou Gao, Borong An, Zhen Cheng, and Guoqiang Xu. "IREE: A Fine-Grained Dataset for Chinese Event Extraction in Investment Research." In Communications in Computer and Information Science, 205–10. Singapore: Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-19-7596-7_16.
Full textBostenaru Dan, Maria, Cerasella Crăciun, and Adrian Ibric. "Decision Systems in Disaster Management with Application to Fire." In Fire Hazards: Socio-economic and Regional Issues, 67–81. Cham: Springer International Publishing, 2024. http://dx.doi.org/10.1007/978-3-031-50446-4_6.
Full textBuhler, Thomas, Matthieu Adam, Hakim Ramdani, and Pauline Jobard. "Press Discourse on Cycling Before, During, and After the First Covid-19 Lockdown in France. The Rise of the User-Group Voice." In The Urban Book Series, 71–87. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-45308-3_4.
Full textConference papers on the topic "Eventus (Computer file)"
Koops Londello, Alberthus, and Benjamin Grando Moreira. "Conversor de formatos de arquivos de ferramentas de modelagem de Sistemas a Eventos Discretos." In Computer on the Beach. Itajaí: Universidade do Vale do Itajaí, 2020. http://dx.doi.org/10.14210/cotb.v11n1.p095-096.
Full textArastu, Asif H., and Eugene Tom. "Water Hammer Analysis/Prevention/Mitigation in Fire Protection Systems at Power Plants." In ASME/JSME 2003 4th Joint Fluids Summer Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/fedsm2003-45679.
Full textVittori, Felipe, Luis Rojas-Solo´rzano, Armando J. Blanco, and Rafael Urbina. "Numerical Study of Smoke Propagation in a Simulated Fire in a Wagon Within a Subway Tunnel." In ASME 2008 Fluids Engineering Division Summer Meeting collocated with the Heat Transfer, Energy Sustainability, and 3rd Energy Nanotechnology Conferences. ASMEDC, 2008. http://dx.doi.org/10.1115/fedsm2008-55281.
Full textDong, Milton, and Eugene Tom. "Structural Dynamic Transient Analysis of Fire Protection System at a Nuclear Power Plant." In 2018 26th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/icone26-82627.
Full textLoureiro, Mauricio. "The First Brazilian Symposium on Computer Music presents Brazilian computer music potentials - Caxambu, MG, 1994." In Simpósio Brasileiro de Computação Musical. Sociedade Brasileira de Computação - SBC, 2019. http://dx.doi.org/10.5753/sbcm.2019.10463.
Full textGarnier, J., N. Neufeld, and S. S. Cherukuwada. "Non-POSIX file system for LHCb online event handling." In 2010 17th Real-Time Conference - IEEE-NPSS Technical Committee on Computer Applications in Nuclear and Plasma Sciences (RT 2010). IEEE, 2010. http://dx.doi.org/10.1109/rtc.2010.5750457.
Full textLux, C. Ray, Kevin R. O’Kula, Michael G. Wentink, Ryan E. Jones, Jean E. Collin, and David J. Gross. "Quantitative Risk Analysis of Hydrogen Events at WTP: Part 1 of 2 — The Operational Frequency Analysis Model." In ASME 2012 Pressure Vessels and Piping Conference. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/pvp2012-78378.
Full textWang, Zhenqi, and Weiping Wang. "Webpage Tamper-resistant Strategy Based on File System Filter Driver and Event-triggered." In 2nd International Symposium on Computer, Communication, Control and Automation. Paris, France: Atlantis Press, 2013. http://dx.doi.org/10.2991/isccca.2013.143.
Full textG., Brenda, Franklin Jino R. E., and Sherin Paul P. "An Efficient Technique for Fire Detection Using Deep Learning Algorithm." In The International Conference on scientific innovations in Science, Technology, and Management. International Journal of Advanced Trends in Engineering and Management, 2023. http://dx.doi.org/10.59544/uaae7050/ngcesi23p88.
Full textMeyer, Stephen P. "Sources of Uncertainty in a Fire Probabilistic Safety Assessment." In 17th International Conference on Nuclear Engineering. ASMEDC, 2009. http://dx.doi.org/10.1115/icone17-75360.
Full textReports on the topic "Eventus (Computer file)"
Rainville, E., James Thomson, Melissa Moulton, and Morteza Derakhti. DUNEX MicroSWIFT Drifters. Engineer Research and Development Center (U.S.), March 2023. http://dx.doi.org/10.21079/11681/46644.
Full textFloyd, Jason, and Daniel Madrzykowski. Analysis of a Near Miss in a Garden Apartment Fire – Georgia 2022. UL's Fire Safety Research Institute, October 2022. http://dx.doi.org/10.54206/102376/rsfd6862.
Full text