Letteratura scientifica selezionata sul tema "Eventus (Computer file)"
Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili
Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Eventus (Computer file)".
Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.
Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.
Articoli di riviste sul tema "Eventus (Computer file)"
1
Syafar, Faisal, Halimah Husain, Sutarsih Suhaeb, Putri Ida e Supriadi. "Blowfish Advanced CS Untuk Solusi Keamanan Sistem Komputer Sekolah". Vokatek : Jurnal Pengabdian Masyarakat 1, n. 3 (30 ottobre 2023): 353–61. http://dx.doi.org/10.61255/vokatekjpm.v1i3.271.
Testo completoAbstract (sommario):
Data security and privacy are very important issues for businesses, colleges, the government, and even individuals. The TKJ Laboratory is where PKM events take place. Students are free to use the computers there as they please, as long as they don't break the security system on each one. The types of files that can be protected in this case are text-based document files, picture files, audio and video files that are stored digitally, and question files. In the Community Partnership Program, which had 15 participants, there were outcomes and goals. The program produced a guidebook on how to use Blowfish Advanced CS for computer system security cryptography and instructions on how to use Blowfish Advanced CS for computer system security cryptography. This study is a type of research called qualitative research. With a case study that aims to learn how to use the Blowfish Advanced CS tool to secure text messages, files, and documents with cryptographic data. The predicted outcomes of this PKM are 1) This key is combined to make the Blowfish algorithm stronger during the key setup process. 2) The Blowfish algorithm tool needs a key with at least 4 characters to encrypt the data file during the file/folder simulation. 3) The Blowfish method uses symmetric keys, which means that the simulation process always uses the same key to encrypt and decrypt data files and folders. The same key is also used to split and join files.
2
Xu, Haochen, Guanhua Fang, Yunxiao Chen, Jingchen Liu e Zhiliang Ying. "Latent Class Analysis of Recurrent Events in Problem-Solving Items". Applied Psychological Measurement 42, n. 6 (9 aprile 2018): 478–98. http://dx.doi.org/10.1177/0146621617748325.
Testo completoAbstract (sommario):
Computer-based assessment of complex problem-solving abilities is becoming more and more popular. In such an assessment, the entire problem-solving process of an examinee is recorded, providing detailed information about the individual, such as behavioral patterns, speed, and learning trajectory. The problem-solving processes are recorded in a computer log file which is a time-stamped documentation of events related to task completion. As opposed to cross-sectional response data from traditional tests, process data in log files are massive and irregularly structured, calling for effective exploratory data analysis methods. Motivated by a specific complex problem-solving item “Climate Control” in the 2012 Programme for International Student Assessment, the authors propose a latent class analysis approach to analyzing the events occurred in the problem-solving processes. The exploratory latent class analysis yields meaningful latent classes. Simulation studies are conducted to evaluate the proposed approach.
3
Alkenani, Jawad, e 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, n. 2 (1 febbraio 2023): 954. http://dx.doi.org/10.11591/ijeecs.v29.i2.pp954-962.
Testo completoAbstract (sommario):
<span lang="EN-US">The network performance measurement is important in computer networks, and performance measurement may not be effective for installation in peripheral devices resulting in the replacement of those devices and thus increasing cost. In light of this, it is better to have a simulation of the network to see its performance rather than the actual design. NS-2 is one of the most popular and widely used open-source network simulators in many organizations, which generates trace files during the simulation experience. The trace file contains all network events that can be used to calculate performance. Thus, NS-2 does not offer any visualization options for analyzing simulation results (trace files), which is the fundamental problem of trace file parsing difficulty. This paper provides a graphical user interface tool that enables researchers to quickly and efficiently analyze and visualize NS-2 trace files. This tool is a development of the JDNA tool, as it could not analyze more than one trace file at a time. In addition, this work can be a useful guide for network researchers or other programmers to analyze their networks and understand how to calculate network performance metrics.</span>
4
Groh, Micah, Norman Buchanan, Derek Doyle, James B. Kowalkowski, Marc Paterno e 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.
Testo completoAbstract (sommario):
Modern experiments in high energy physics analyze millions of events recorded in particle detectors to select the events of interest and make measurements of physics parameters. These data can often be stored as tabular data in files with detector information and reconstructed quantities. Most current techniques for event selection in these files lack the scalability needed for high performance computing environments. We describe our work to develop a high energy physics analysis framework suitable for high performance computing. This new framework utilizes modern tools for reading files and implicit data parallelism. Framework users analyze tabular data using standard, easy-to-use data analysis techniques in Python while the framework handles the file manipulations and parallelism without the user needing advanced experience in parallel programming. In future versions, we hope to provide a framework that can be utilized on a personal computer or a high performance computing cluster with little change to the user code.
5
Marr, Charles. "210 CUSTOM-PRINTED ELECTRONIC FACT SHEETS AT HORTICULTURAL EVENTS". HortScience 29, n. 5 (maggio 1994): 459d—459. http://dx.doi.org/10.21273/hortsci.29.5.459d.
Testo completoAbstract (sommario):
A series of 62 fact sheets on a variety of topics related to vegetable gardening were constructed in WordPerfect and, using a series of macros and styles, were modified to a standard format and printed to a file for storage. Sheets were organized into a heirarchal menu so they could be copied to the printer upon request using only DOS commands. A portable laptop computer and a Hewlett Packard Portable DeskJet printer was used to print files at such remote locations as nurseries/garden centers, shopping malls, fairs, and public events where Master Gardener volunteers set up and operated the equipment. Single sheets could be printed in about 20 seconds. At garden shows with larger attendance, a HP Laser 4 printer and a standard computer were used to print fact sheets at about 5 seconds each. Fact sheets consisted of text and tables but no graphics were included. Most sheets were single pages although several were 2 pages in length. Additional information was available from a comprehensive for-sale publication sold or available for ordering on-site. Costs of custom printed fact sheets compared to standard printing will be discussed.
6
Bántay, László, Gyula Dörgö, Ferenc Tandari e János Abonyi. "Simultaneous Process Mining of Process Events and Operator Actions for Alarm Management". Complexity 2022 (19 settembre 2022): 1–13. http://dx.doi.org/10.1155/2022/8670154.
Testo completoAbstract (sommario):
Alarm management is an important task to ensure the safety of industrial process technologies. A well-designed alarm system can reduce the workload of operators parallel with the support of the production, which is in line with the approach of Industry 5.0. Using Process Mining tools to explore the operator-related event scenarios requires a goal-oriented log file format that contains the start and the end of the alarms along with the triggered operator actions. The key contribution of the work is that a method is presented that transforms the historical event data of control systems into goal-oriented log files used as inputs of process mining algorithms. The applicability of the proposed process mining-based method is presented concerning the analysis of a hydrofluoric acid alkylation plant. The detailed application examples illustrate how the extracted process models can be interpreted and utilized. The results confirm that applying the tools of process mining in alarm management requires a goal-oriented log-file design.
7
Marjai, Péter, Péter Lehotay-Kéry e Attila Kiss. "The Use of Template Miners and Encryption in Log Message Compression". Computers 10, n. 7 (23 giugno 2021): 83. http://dx.doi.org/10.3390/computers10070083.
Testo completoAbstract (sommario):
Presently, almost every computer software produces many log messages based on events and activities during the usage of the software. These files contain valuable runtime information that can be used in a variety of applications such as anomaly detection, error prediction, template mining, and so on. Usually, the generated log messages are raw, which means they have an unstructured format. This indicates that these messages have to be parsed before data mining models can be applied. After parsing, template miners can be applied on the data to retrieve the events occurring in the log file. These events are made from two parts, the template, which is the fixed part and is the same for all instances of the same event type, and the parameter part, which varies for all the instances. To decrease the size of the log messages, we use the mined templates to build a dictionary for the events, and only store the dictionary, the event ID, and the parameter list. We use six template miners to acquire the templates namely IPLoM, LenMa, LogMine, Spell, Drain, and MoLFI. In this paper, we evaluate the compression capacity of our dictionary method with the use of these algorithms. Since parameters could be sensitive information, we also encrypt the files after compression and measure the changes in file size. We also examine the speed of the log miner algorithms. Based on our experiments, LenMa has the best compression rate with an average of 67.4%; however, because of its high runtime, we would suggest the combination of our dictionary method with IPLoM and FFX, since it is the fastest of all methods, and it has a 57.7% compression rate.
8
Starenkyi, Ivan, e Oleksandra Donchenko. "DETECTION OF TRACES OF THE USE OF SOFTWARE SUCH AS «STEALER» IN THE MEMORY OF THE STORAGE DEVICE". Criminalistics and Forensics, n. 68 (3 luglio 2023): 469–77. http://dx.doi.org/10.33994/kndise.2023.68.46.
Testo completoAbstract (sommario):
The purpose of this work is to use an experimentally way to determine the characteristic features of the use of the software «Mars Stealer», which is positioned as a software product of the «Stealer» type, which is contained in the memory among the available and deleted data of the information storage device. The following conclusions can be drawn on the basis of the conducted experiment: Autopsy» software is a good tool for trying to reproduce and trace the events and processes that took place on the storage device; By studying the events and processes in the memory of the information storage, it was possible to establish the sequence of actions of the expert to detect the executable file(s) of third-party software that may be malicious; In the case when the research of the detected executable build file is not carried out immediately after receiving the research objects, but after a certain time, for example, within 90 calendar days, there is a high probability of «losing» communication with the C2 server, which the build – file calls. But, in order to establish the IP address to which the file-initiator try to connect on the affected computer, it is recommended to repeatedly run the build-file (this may increase the chances of detecting the IP address of the C2 server) while simultaneously monitoring the Internet traffic, which will go through a virtual machine; The executing file-initiator on the affected PC by the «Mars Stealer» software, even if there is an error in its work, will be «forced» to save the information collected on the affected PC in the root directory of the location of the Build file itself; Based on the results of the work carried out, it is possible to establish the characteristic features of the use of the «Mars Stealer» software, which is positioned as a «stealer» type of software, which include logging the number of launches of the executing Build-file, and interaction with the folders of WEB browsers installed in the memory storage of information, as well as interaction with a large number of libraries. The obtained results of the experiment given in this paper can be used when conducting examinations in the expert speciality 10.9 «Research of computer equipment and software products», in the study of information storage devices, among the available and deleted data of which information about samples of executable files of the «Mars Stealer» software, which is confirmed by the evidence collected during the examination.
9
N. Sangeeta e Seung Yeob Nam. "Blockchain and Interplanetary File System (IPFS)-Based Data Storage System for Vehicular Networks with Keyword Search Capability". Electronics 12, n. 7 (24 marzo 2023): 1545. http://dx.doi.org/10.3390/electronics12071545.
Testo completoAbstract (sommario):
Closed-circuit television (CCTV) cameras and black boxes are indispensable for road safety and accident management. Visible highway surveillance cameras can promote safe driving habits while discouraging moving violations. According to CCTV laws, footage captured by roadside cameras must be securely stored, and authorized persons can access it. Footages collected by CCTV and Blackbox are usually saved to the camera’s microSD card, the cloud, or hard drives locally but there are concerns about security and data integrity. These issues may be addressed by blockchain technology. The cost of storing data on the blockchain, on the other hand, is prohibitively expensive. We can have decentralized and cost-effective storage with the interplanetary file system (IPFS) project. It is a file-sharing protocol that stores and distributes data in a distributed file system. We propose a decentralized IPFS and blockchain-based application for distributed file storage. It is possible to upload various types of files into our decentralized application (DApp), and hashes of the uploaded files are permanently saved on the Ethereum blockchain with the help of smart contracts. Because it cannot be removed, it is immutable. By clicking on the file description, we can also view the file. DApp also includes a keyword search feature to assist us in quickly locating sensitive information. We used Ethers.js’ smart contract event listener and contract.queryFilter to filter and read data from the blockchain. The smart contract events are then written to a text file for our DApp’s keyword search functionality. Our experiment demonstrates that our DApp is resilient to system failure while preserving the transparency and integrity of data due to the immutability of blockchain.
10
Mohamed, Mohamed, e James C. L. Chow. "Acomprehensive computer database for medical physics on-call program". Journal of Radiotherapy in Practice 19, n. 1 (14 maggio 2019): 10–14. http://dx.doi.org/10.1017/s1460396919000244.
Testo completoAbstract (sommario):
AbstractPurpose: A comprehensive and robust computer database was built to record and analyse the medical physics on-call data in emergency radiotherapy. The probability distributions of the on-call events varying with day and week were studied.Materials and methods: Variables of medical physics on-call events such as date and time of the event, number of event per day/week/month, treatment site of the event and identity of the on-call physicist were input to a programmed Excel file. The Excel file was linked to the MATLAB platform for data transfer and analysis. The total number of on-call events per day in a week and per month in a year were calculated based on the physics on-call data in 2010–18. In addition, probability distributions of on-call events varying with days in a week (Monday–Sunday) and months (January–December) in a year were determined.Results: For the total number of medical physics on-call events per week in 2010–18, it was found that the number was similar from Sundays to Thursdays but increased significantly on Fridays before the weekend. The total number of events in a year showed that the physics on-call events increased gradually from January up to March, then decreased in April and slowly increased until another peak in September. The number of events decreased in October from September, and increased again to reach another peak in December. It should be noted that March, September and December are months close to Easter, Labour Day and Christmas, when radiation staff usually take long holidays.Conclusions: A database to record and analyse the medical physics on-call data was created. Different variables such as the number of events per week and per year could be plotted. This roster could consider the statistical results to prepare a schedule with better balance of workload compared with scheduling it randomly. Moreover, the emergency radiotherapy team could use the analysed results to enhance their budget/resource allocation and strategic planning.
Tesi sul tema "Eventus (Computer file)"
1
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.
Testo completoAbstract (sommario):
Data conversion for evolving events in an Event Sourcing System is a complex issue and needs to be maintainable. There are suggested ways handling data conversion today which combine different methods into a framework. However, there is a lack of exploration of different and alternative methods to handle the complicated matter.This thesis explores data conversion with fine-grained events. The purpose is to explore methods and broaden knowledge for handling data conversion while using attribute driven events called fine-grained events. The goal was to build a proof-of-concept that preserves the attributes reliability and availability and can handle data conversion of these specific events.The results found by using fine-grained events are a decrease in terms of system complexity and a proof-of-concept that maintains the desired attributes.Datakonvertering 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.
2
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.
Testo completoAbstract (sommario):
Introducing event sourcing to a system that is based on a model following Create, Read, Update and Delete (CRUD) operations can be a challenging task and requires an extensive rework of the current system. By introducing coarse-grained events it is possible to persist the structure of the data in a CRUD model and still gain the benefits of event sourcing, avoiding an extensive rework of the system. This thesis investigates how large amounts of data can be handled with coarse-grained events and still gain the benefits of event sourcing, by comparing with the conventional way of using fine-grained events. The data to be examined is trade data fed into a data warehouse. Based on research, an event sourcing application is implemented for coarse-grained as well as fine-grained events, to measure the difference between the two event types. The difference is limited to the metrics, latency and size of storage. The application is verified with an error handler, using example data and a profiler to make sure that it does not have any unnecessary bottlenecks. The resulting performance of the two cases show that fine-grained events have excessively larger latency than coarse-grained events in most cases whereas the size of storage is strictly smaller for fine-grained events.Att 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.
3
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.
Testo completoAbstract (sommario):
Tuning a computer system effectively requires prior studies on the performance of the system. There are different types of tools available to measure a system: hardware, firmware and software. This thesis presents the design and implementation of an event monitor, which is one type of software tools.
The event monitor was developed on a SUN1 workstation running UNIX 4.2bsd version 1.4. Six types of events were selected to be measured, namely transactions, logins/logouts, pageins, pageouts, disk I/Os and forks/exits. The operating system was modified to include probes to trap these events. For a final testing of the event monitor, it was ported and installed onto a SUN3 workstation running UNIX 4.2bsd version 3.2. Measurements collected were analyzed by a capacity planning package condenser. The results give an indication of the system workload and the system performance. Benchmarks were also set up to measure the overhead incurred by the event monitor.Science, Faculty of
Computer Science, Department of
Graduate
4
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.
Testo completoAbstract (sommario):
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science; and, Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.Includes bibliographical references (leaf 46).
by Kenneth K. Pang.
B.S.
M.Eng.
5
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.
Testo completoAbstract (sommario):
Orientadores: Varese Salvador Timoteo, Edson Luiz UrsiniDissertaçã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
6
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/.
Testo completoAbstract (sommario):
Nowadays, many formal methods are used in the area of software development accompanied by a number of advanced theories and tools. However, more experiments are still required in order to provide significant evidence that will convince and encourage users to use, and gain more benefits from, those theories and tools. Event-B is a formalism used for specifying and reasoning about systems. Rodin is an open and extensible tool for Event-B specification, refinement and proof. The flash file system is a complex system. Such systems are a challenge to specify and verify at this moment in time. This system was chosen as a case study for our experiments, carried out using Event-B and the Rodin tool. The experiments were aimed at developing a rigorous model of flash-based file system; including implementation of the model, providing useful evidence and guidelines to developers and the software industry. We believe that these would convince users and make formal methods more accessible. An incremental refinement was chosen as a strategy in our development. The refinement was used for two different purposes: feature augmentation and structural refinement (covering event and machine decomposition). Several techniques and styles of modelling were investigated and compared; to produce some useful guidelines for modelling, refinement and proof. The model of the flash-based file system we have completed covers three main issues: fault-tolerance, concurrency and wear-levelling process. Our model can deal with concurrent read/write operations and other processes such as block relocation and block erasure. The model tolerates faults that may occur during reading/writing of files. We believe our development acts as an exemplar that other developers can learn from. We also provide systematic rules for translation of Event-B models into Java code. However, more work is required to make these rules more applicable and useful in the future
7
Gideon, John. "The Integration of LlamaOS for Fine-Grained Parallel Simulation". University of Cincinnati / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1377872370.
Testo completo
8
Maynard, 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.
Testo completo
9
Dias, Maria Camila de Avelino Geraldo. "Prediction of uncertainty events using human-computer interaction". Master's thesis, 2018. http://hdl.handle.net/10362/58209.
Testo completoAbstract (sommario):
The practice of medicine is characterized by complex situations that evoke uncertainty.
Uncertainty has implications for the quality and costs of health care, thus emphasizing
the importance of identifying its the main causes.
Uncertainty can be manifested through human behaviour. Accordingly, in this dissertation,
a machine learning model that detects events of uncertainty based on mouse
cursor movements was created. To do so, 79 participants answered an online survey while
the mouse data was being tracked. This data was used to extract meaningful features that
allowed model testing and training after a feature selection stage. With the implementation
of a Logistic Regression, and applying a k-fold cross-validation method, the model
achieved an estimated performance of 81%.
It was found that, during moments of uncertainty, the number of horizontal direction
inversions increases and the mouse cursor travels higher distances. Moreover, items that
evoke uncertainty are associated to longer interaction times and a higher number of visits.
Subsequently, the model was applied to a medical decision making task performed
by 8 physicians, in order to understand whether it might be applied in different contexts
or not. The results were consistent with the task design.
To better understand the nature of uncertainty, its relationship with personality was
explored. Regarding the clinical task, it was found a slight tendency of uncertainty to
increase with Neuroticism.
In the future, the created model may be used to help physicians understand their
main difficulties.
10
Ackermann, Jacobus Gideon. "Evaluating reasoning heuristics for a hybrid theorem proving platform". Diss., 2018. http://hdl.handle.net/10500/25869.
Testo completoAbstract (sommario):
Text in English with abstracts in English, Afrikaans and isiZuluThe 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)
Libri sul tema "Eventus (Computer file)"
1
Cowan, Arnold R. Eventus version 7: Software for event studies and CRSP data retrieval : user's guide. Ames, Iowa]: Cowan Research LC, 2002.
Cerca il testo completo
2
Francis, Tony. Mac OS 8 revealed. Reading, Mass: Addison-Wesley, 1996.
Cerca il testo completo
3
Warnke, Martin, e Anne Dippel. Interferences and Events: On Epistemic Shifts in Physics Through Computer Simulations. Saint Philip Street Press, 2020.
Cerca il testo completo
4
Warnke, Martin, e Anne Dippel. Interferences and Events: On Epistemic Shifts in Physics Through Computer Simulations. Saint Philip Street Press, 2020.
Cerca il testo completo
5
Dippel, Anne. Interferences and Events: On Epistemic Shifts in Physics through Computer Simulations. meson press, 2017.
Cerca il testo completo
6
The way of Delphi: Reusing objects, components, properties, and events. Upper Saddle River, N.J: Prentice Hall PTR, 1996.
Cerca il testo completo
7
Solymar, Laszlo. Getting the Message. 2a ed. Oxford University Press, 2021. http://dx.doi.org/10.1093/oso/9780198863007.001.0001.
Testo completoAbstract (sommario):
Laszlo Solymar’s book is quite unique in the sense that it is the only one that covers all the major developments in the history of telecommunications for the past 4,000 years, like fire signals, the mechanical telegraph, the electrical telegraph, telephony, optical fibres, fax, satellites, mobile phones, the Internet, the digital revolution, the role of computers, and also some long-forgotten technologies like news broadcasting by a devoted telephone network. It tells the technical aspects of the story but also how it affects people and society; e.g.it discusses the effect of the electric telegraph on war and diplomacy, how thanks to the telegraph Kitchener could preserve the Cairo-to-Cape Town red band for the British Empire, or more recent events like the effect of deregulation upon the monopoly of the American Telephone and Telegraph Company (AT&T). A number of anecdotes are told, e.g. how one murderer was caught by telegraphy when he arrived at Paddington Station and how another murderer was caught by wireless telegraphy when tried to escape by boat from Britain to Canada. The last chapter is concerned with the future: how the future was envisaged in the past and how we imagine the future of telecommunications now.
8
T. Unix System V Release 3.2 Network Programmer's Guide. Prentice Hall, 1991.
Cerca il testo completo
9
Unix System V/386 Release 3.2 Network Programmer's Guide, Issue 47. Prentice Hall, 1988.
Cerca il testo completoCapitoli di libri sul tema "Eventus (Computer file)"
1
Hong, James, Haotian Zhang, Michaël Gharbi, Matthew Fisher e 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.
Testo completo
2
Zheng, Lizhou, Peiquan Jin, Jie Zhao e 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.
Testo completo
3
Khan, Saad, e 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.
Testo completo
4
Fathalla, Said, e 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.
Testo completo
5
Dal Lago, Ugo, Giulio Guerrieri e 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.
Testo completoAbstract (sommario):
AbstractA notion of probabilistic lambda-calculus usually comes with a prescribed reduction strategy, typically call-by-name or call-by-value, as the calculus is non-confluent and these strategies yield different results. This is a break with one of the main advantages of lambda-calculus: confluence, which means results are independent from the choice of strategy. We present a probabilistic lambda-calculus where the probabilistic operator is decomposed into two syntactic constructs: a generator, which represents a probabilistic event; and a consumer, which acts on the term depending on a given event. The resulting calculus, the Probabilistic Event Lambda-Calculus, is confluent, and interprets the call-by-name and call-by-value strategies through different interpretations of the probabilistic operator into our generator and consumer constructs. We present two notions of reduction, one via fine-grained local rewrite steps, and one by generation and consumption of probabilistic events. Simple types for the calculus are essentially standard, and they convey strong normalization. We demonstrate how we can encode call-by-name and call-by-value probabilistic evaluation.
6
Denisov, Vadim, Dirk Fahland e 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.
Testo completo
7
Hei, Yiming, Qian Li, Caibo Zhou, Rui Sun, Jinglin Yang, Jiawei Sheng, Shu Guo e 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.
Testo completo
8
Ren, Junxiang, Sibo Wang, Ruilin Song, Yuejiao Wu, Yizhou Gao, Borong An, Zhen Cheng e 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.
Testo completo
9
Bostenaru Dan, Maria, Cerasella Crăciun e 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.
Testo completoAbstract (sommario):
AbstractThis book chapter explores the utilization of an ontology of disaster images in the design of a decision support system for intervening in prevention or reconstruction efforts following events such as earthquakes, floods, and even fires. Grounded in philosophy, ontology in computer science relies on taxonomies, which are classifications of concepts used to facilitate object-oriented programming. To this end, existing collections of disaster images have been analyzed based on relevant literature. The objective here is to map the perception of disasters across different groups, including experts, the passive public, and actively affected individuals. These stakeholders play a crucial role in decision-making within a participatory planning framework, with the most advanced form being strategic planning. This approach offers an alternative to traditional urban regulatory and landscape planning. Urban planning and land use are essential considerations for non-structural disaster prevention interventions, particularly in areas where urban and wildland environments intersect. In such contexts, the coexistence of human settlements and forests in urban settings emphasizes the dual nature of forests as both natural heritage and a domain that calls for nature-based solutions.
10
Buhler, Thomas, Matthieu Adam, Hakim Ramdani e 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.
Testo completoAbstract (sommario):
AbstractIn this chapter we explore what a “crisis” event (here the first lockdown related to Covid-19 in France) means in terms of (i) the balance of power among actors expressing themselves in the daily press and of (ii) the main messages that the more prominent of these actors disseminate. In order to analyze changes in press discourse on city cycling in France, we examine a corpus that spans the period from September 2019 to September 2020, i.e., six months before the first lockdown (March 17, 2020) and five months after the end of the month-long lockdown (May 11, 2020). The discourse analysis has been conducted on 578 press articles from five regional newspapers (Rennes, Montpellier, Besançon, Paris, and Lyon) and one national press title (Libération). This entire corpus was analyzed using textometry, a computer-assisted method for analyzing quantitative textual data. This enables us to identify a discursive change. Two elements characterize that change: (i) the balance between actors who “talk” or who “are talked about” in the articles shifts gradually. During this period, cycling organizations appear to be the actors whose position is strengthened in the media discourse; (ii) these actors are strengthened in their traditional mission of lobbying for cycling, but with a focus on new issues (e.g., wearing a face-covering or not for cyclists, calling for the reopening of green public spaces to allow the transit of bicycles, etc.). The first Covid-19 wave appears to have been the accelerator of a wider process that has led cycling organizations to professionalize since the 2000s, to move away from ecologist, anarchist, and anticapitalist discourses and to promote instead the idea of everyday cycling as a tool for improving public health. The Covid-19 crisis has further established cycling organizations as reference actors for bicycle mobility in French cities.
Atti di convegni sul tema "Eventus (Computer file)"
1
Koops Londello, Alberthus, e 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.
Testo completoAbstract (sommario):
The project of Discrete Event Systems (DES) with the SupervisoryControl Theory uses a group of operations whose algorithms areimplemented in tools to support the development of DES. Severaltools were developed, each one with self-resources, self-file formatand minimal integration between these different tools. This paperpresents a tool proposal to convert different files of some tools forthe development of DES, using a standard intermediated formatdefined to the proposal.
2
Arastu, Asif H., e 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.
Testo completoAbstract (sommario):
Fire Protection water systems are typically piping networks where water is pumped from a low elevation reservoir at atmospheric pressure to higher elevations in the buildings served by the system. Because of this nature of their design, they are prone to water hammers due to water column separation & rejoining. A loss of pressure can lead to void formation at high elevations whose collapse can result in severe water hammer. A damaging water hammer event that occurred at a nuclear power plant (Arastu, et al, 1999) causing a catastrophic valve failure pointed to the need to prevent and mitigate such potential events at other plants. One important aspect of that event is that prior to it, several events of similar magnitude had occurred that did not apparently cause physical damage but degraded the system sufficiently to make it susceptible to damage. This paper discusses the causes of water hammer in Fire Protection Systems at power plants and identifies analysis, prevention, and mitigation strategies. Using a Method Of Characteristics based program, computer simulation results of the application of the mitigative measures are given for three large plant systems to demonstrate the effectiveness of the measures proposed at these plants.
3
Vittori, Felipe, Luis Rojas-Solo´rzano, Armando J. Blanco e 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.
Testo completoAbstract (sommario):
This work deals with the numerical (CFD) analysis of the smoke propagation during fires within closed environments. It is evaluated the capacity of the emergency ventilation system in controlling the smoke propagation and minimizing the deadly impact of an eventual fire in a wagon within the Metro de Caracas subway tunnel on the passengers safety. For the study, it was chosen the tunnel section between Teatros and Nuevo Circo subway stations, which consists of two parallel independent twin tunnels, connected through a transverse passage. The tunnels are provided by a longitudinal ventilation system, integrated by a set of reversible fans located at both ends of the tunnels. Three stages were considered in the study: (a) Model set up; (b) Mesh sensitivity analysis; (c) Validation of the physical-numerical parameters to be used in the numerical model; and (d) Simulation of fire scenarios in Metro de Caracas subway stations. Stages (b)–(c), aimed to testing and calibrating the CFD tool (ANSYS-CFX10™), focused on reproducing experimental data from Vauquelin and Me´gret [1], who studied the smoke propagation in a fire within a 1:20 scale road tunnel. Stage (d) critical scenarios were established via a preliminary discussion with safety experts from Metro de Caracas, in order to reduce the computer memory and the number of simulations to be performed. The analyses assessed the reliability of escape routes and alternative paths for the evacuation of passengers. Additionally, the smoke front movement was particularly computed, as a function of time, in order to determine the possible presence of the “backlayering” phenomenon [5]. Results demonstrate the strengths and weaknesses of the current ventilation system in the event of a fire in the subway tunnel, and suggest new strategies to address this potentially lethal event to minimize the risks for passengers.
4
Dong, Milton, e 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.
Testo completoAbstract (sommario):
NRC Information Notice 98-31[1] describes a water hammer event that occurred at Columbia Generating Station. In this event, actuation of a Fire Protection System (FPS) led to voiding in a tall dead-ended riser with subsequent water hammer in the riser when the main fire pumps were activated. Due to the severity of the event, NRC requires that FPS with similar configurations at other nuclear power plants be analyzed for similar events. This paper describes an evaluation of two selected riser piping systems performed to quantify the susceptibility of the potential water hammer events in the FPS at a nuclear power plant. The FPS was modeled in a proprietary computer program, USLAM (Hydraulic Analysis Code), and selected operational scenarios (analysis cases) were analyzed to quantify the potential waterhammer loads (fluid forces). A tall riser piping system in the Reactor Building was chosen as a sample system for structural dynamic analysis. Based on the results of the sample system, it was concluded that the fire protection piping systems could experience piping stress far exceed the faulted allowable loads as allowed by the ASME/ANSI piping code. A cost-effective mitigation scheme was then proposed plan in paper ICONE65-82622[2] as Part 1 of this study with consideration only hydraulic loading where 11 vacuum breakers are to be installed at various locations of the FPS. The structural analyses discussed only piping stress in this paper and demonstrate for the effectiveness of the proposed mitigation scheme from the revised hydrodynamic loads. As the continuation of Ref. 2, the results from this study validate the acceptance of these two piping systems.
5
Loureiro, 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.
Testo completoAbstract (sommario):
The main objective of this talk is to report on the First Brazilian Symposium on Computer Music, which occurred in August 1994, at the city of Caxambu, Minas Gerais, promoted by the UFMG. The meeting occurred one year after the creation of NUCOM, a group of young academics dedicated to this emerging research field in Brazil gathered as a discussion list. This quite exciting and fancy event at Hotel Gloria in Caxambu was able to imposingly launch the group to the national, as well as to the international academic community. First, due to the excellency of the event’s output and its daring program, that included 34 selected papers by researchers from various institutions from Argentina, Brazil, Canada, Denmark, France, Hong Kong, Mexico, UK, and USA, five lectures an two panels of discussion offered by researchers from the most advanced computer music research centers all over the world. The program also included eight concerts, two of them featuring traditional music, such as Bach, Mozart, and Brazilian music.Six computer music concerts presented 48 selected compositions submitted to the symposium. Second, as the symposium happened as apart of the 14th Congress of Brazilian Computer Science Society (SBC), the excellency of its output was able to attract the interest of SBC’s board of directors. They invited NUCOM to integrate the society as a Special Committee, which are sub-groups of SBC dedicated to specific computer science topics. At the end of the description, this report aims at raising questions, arguments, and debates about today’s format of NUCOM meetings, considering more seriously the interdisciplinary character of the methodologic approaches adopted by the field. Interdisciplinarity should be pursued by striving to contaminate a growing number of different topics of musical sciences, as well as of other research fields.
6
Garnier, J., N. Neufeld e 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.
Testo completo
7
Lux, C. Ray, Kevin R. O’Kula, Michael G. Wentink, Ryan E. Jones, Jean E. Collin e 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.
Testo completoAbstract (sommario):
A Quantitative Risk Analysis (QRA) model has been developed to determine the frequency and severity (potential combustion loads) of postulated hydrogen event types in piping systems and proposed as a design-informing tool for the U.S. Department of Energy’s (DOE) Hanford Tank Waste Treatment and Immobilization Plant (WTP) at the Hanford Site near Richland, Washington. Specifically, the QRA provides a systematic, comprehensive methodology for assessing hydrogen events, including deflagrations, detonations, and deflagration-to-detonation transition (DDT) types in piping systems containing legacy nuclear waste streams being processed for vitrification. The events considered include normal operations as well as postulated upset conditions as a result of internal and external accidents. The QRA approach incorporates three sequential phases, including Operational Frequency Analysis (OFA), Gas Pocket Formation (GPF) and Event Progression Logic (EPL) models in the form of an integrated logic framework. The WTP piping design will be evaluated on a specific piping route basis using a probabilistic sampling approach, with the QRA providing the quantitative dynamic loads for evaluation according to the frequency and type of hydrogen event. The OFA is based on an industry standard fault tree computer model, CAFTA, and analyzes the frequency of combustible gas pocket formation in a piping system from three primary sources: (1) normal operations; (2) piping system-specific upset conditions affecting transfer operations; and (3) plant-wide initiating events such as fire and seismic accidents. A second output from the OFA is duration time for each event, quantifying the length of time that a gas pocket is likely to develop before the initiating event is terminated, with the information provided directly to QRA event tree models for assessing gas pocket growth. A team of safety, operations and engineering, developed the underlying logic of the fault tree model with the overall modeling approach following applicable nuclear/chemical industry guidance and standards for performing QRA applications. Primary inputs to the OFA module are initiating event, equipment reliability, and human/operator error data and their characteristic distributions, and are drawn from Hanford Site safety documentation, government and commercial sector sources, and related nuclear/chemical industry experience. This paper discusses the overall OFA module, its inputs, the outputs to the GPF and EPL modules, the relative importance of different initiating event conditions, key insights obtained to date, upcoming supporting uncertainty/sensitivity analyses, and summarizes technical peer review assessments.
8
Wang, Zhenqi, e 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.
Testo completo
9
G., Brenda, Franklin Jino R. E. e 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.
Testo completoAbstract (sommario):
Fire detection using computer vision techniques and image processing mainly considered for rescuing operation. Indeed, good accuracy of computer vision techniques can outperform traditional models of fire detection. Computer vision techniques are being replaced by deep learning models such as Convolutional Neural Networks (CNN). Existing System has only been assessed on balanced datasets, which can lead to the unsatisfied results and mislead real-world performance as fire is a rare and abnormal real-life event. Also, the result of traditional CNN shows that its performance is very low, when evaluated on imbalanced datasets. Therefore, this proposed system use of transfer learning that is based on deep CNN approach to detect fire. It uses pre-trained deep CNN architecture namely VGG, and Mobile Net for development of fire detection system. These deep CNN models are tested on imbalanced datasets by considering real world scenarios. The results of deep CNNs models show that these models increase accuracy significantly and it is observed that deep CNNs models are completely outperforming traditional Convolutional Neural Networks model. The accuracy of Mobile Net is roughly the same as VGG Net, however, Mobile Net is smaller in size and faster than VGG
10
Meyer, 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.
Testo completoAbstract (sommario):
Probability Safety Assessments (PSA) by their nature are approximations of the actual risk and consequences of an accident at a nuclear power plant. Today the PSA models are becoming more complex as the computers and PSA software are faster and PSA modeling techniques are improved. Many PSAs now integrate into a single model internal initiators, internal floods, and internal fires. Each of these initiator types has some uncertainties in common and some that are primarily associated with a specific initiator type. This paper discusses some of those uncertainties found in Fire PSAs. Uncertainties in Fire PSAs arise from the broad categories of phenomenological modeling and assumptions, PSA model development and assumptions, data, and human failure events (HFEs). Phenomenological development and assumptions would include the heat release rates, fire durations, zones of influence, damage criteria, fire propagation, and the impact of smoke on equipment. Aside from the model development and assumptions in the traditional internal events PSA, the inclusion or exclusion of mitigating systems into a Fire PSA model generally has greater impact on the results than in the internal events PSA model. Most plants do not have readily available cable information for non-safety related cables. The cost to determine cable routing for non-safety related cable can be very high and, therefore, most Fire PSAs do not include non-safety mitigating systems except where needed. This increases the level of uncertainty and can skew the results. Data uncertainty arises from ignition frequency determinations, fuel available to a fire, the probability of success/failure of fire suppression systems, and the probability of hot shorts and consequential spurious operation. In addition to the HFEs included in an internal events PSA, there are other HFEs specific to fires. These include new human error probabilities (HEPs) for those HFEs that are part of the internal events PSA model due to the fact that there is a fire occurring and added stress and instrumentation failure may result. There are also HFEs associated directly with the fire such as fire detection and suppression. New HFEs will be needed to be modeled for Control Room evacuation. PSAs are being used more and more in the decision making processes of operating nuclear power plants. It is often required that initiators other than the traditional “internal events” be included in these processes. Understanding the uncertainties that are part of the Fire PSA is needed to make an informed decision. This paper addresses each of these in greater detail and provides techniques in understanding the impacts of the uncertainties.
Rapporti di organizzazioni sul tema "Eventus (Computer file)"
1
Rainville, E., James Thomson, Melissa Moulton e Morteza Derakhti. DUNEX MicroSWIFT Drifters. Engineer Research and Development Center (U.S.), marzo 2023. http://dx.doi.org/10.21079/11681/46644.
Testo completoAbstract (sommario):
The University of Washington Applied Physics Lab team collected these data using microSWIFT wave buoys at the USACE Field Research Facility as part of the USCRP funded project DUNEX (During Nearshore Events Experiment). The files contain both directly measured and computed quantities from the drifting wave buoys. The collection and processing of these data is explained in the github repository at https://github.com/SASlabgroup/DUNEXMainExp along with examples of how these data can be used. The link to the actual data files is https://chldata.erdc.dren.mil/thredds/catalog/frf/projects/Dunex/UW_drifters/catalog.html
2
Floyd, Jason, e Daniel Madrzykowski. Analysis of a Near Miss in a Garden Apartment Fire – Georgia 2022. UL's Fire Safety Research Institute, ottobre 2022. http://dx.doi.org/10.54206/102376/rsfd6862.
Testo completoAbstract (sommario):
On February 9, 2022, Cobb County Fire and Emergency Services responded to a fire in a ground floor unit in a garden apartment building. At arrival, the fire was a post-flashover fire in a bedroom. Initial fire control was attempted by an interior fire attack team which was unable to quickly locate the fire. Exterior suppression through the bedroom window was started prior to discovery of the fire by the interior team. Shortly after fire discovery by the internal team, a mayday was called. Four firefighters from the interior fire attack team received first and second degree burns. This report analyzes photographic, video, and written documentation from the incident to evaluate the timeline of the incident and to assess the fire conditions present. Computer modeling using the Fire Dynamics Simulator (FDS) was performed to provide further insight into the fire conditions and the impact of decisions and actions on the fire ground. Additionally, data from a full scale fire test of a similar fire in a similar structure was used to provide additional insight. Four FDS simulations were performed in support of the analysis. These included a simulation of the event as it unfolded and three simulations looking at the impact of alternate tactics which included: initial exterior attack prior to entry, the use of a smoke curtain to protect the building exit path, and interior only attack. FDS simulations provided insight on the heat present in the apartment during the fire and the impact of the interior and exterior suppression on conditions inside the apartment. Full scale test data of a similar fire showed similar behavior to the FDS predictions and gives credence to the FDS results. Results of the analysis suggest that injuries resulted from the length of time the interior attack team was present inside the apartment before actions were taken to reduce the severity of the fire. Six contributing factors were identified including size-up, communication and accountability, delayed exterior attack, lack of entry hall protection, the apartment layout and construction, thermal imager use, and mayday procedures and training. The last contributing factor was a positive contribution that helped avoid more serious injuries. Based on the contributing factors, five recommendations were made that include improved size-up, exterior fire control to prevent exterior spread, protection of exit pathways, basing fire ground tactics on known information, and recognizing when a change in tactics is needed.