Relevant bibliographies by topics / First In First Out Algorithm

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'First In First Out Algorithm'

Author: Grafiati
Published: 3 June 2025
Last updated: 23 June 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'First In First Out Algorithm.'

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 "First In First Out Algorithm"

1

Widianto, Ilham Rizky, Wowon Priatna, and Hendarman Lubis. "Algoritma First in First Out (FIFO) Untuk Perancangan Aplikasi Pemesanan Kaos Sablon." Jurnal Kajian Ilmiah 23, no. 2 (2024): 135–46. http://dx.doi.org/10.31599/tva3pd96.

Full text
Abstract:
The purpose of this study is to solve the problem of screen-printing T-shirt shops. For manual screen printing t-shirt shops, customers often have to visit the store in person or contact them via chat or phone, often encountering the following issues when ordering t-shirts: B. Irregular orders for those who have placed an order in advance or who have been waiting for a long time. One way to solve the queuing problem is the FIFO algorithm. FIFO algorithms are methods for organizing, processing, and manipulating basic data structures in computer systems. The FIFO algorithm phases in this study begin with the data preparation phase, the Gantt cart process, and finally his FIFO wait time. The result of the FIFO stage translates into creating applications using the Java programming language, Android Studio, and the FireBase database. The results of this study can be applied to his FIFO algorithm for customer queues in ordering T-shirts. A t-shirt ordering application was tested using the white box method by running the test case in four passes. All tests passed, so you can use the ordering application based on the FIFO algorithm.
APA, Harvard, Vancouver, ISO, and other styles
2

Nazri, Syania Aldila, M. Fakhriza, and Adnan Buyung Nasution. "Web-Based Inventory Management System Using First In First Out Algorithm." Jurnal Penelitian Medan Agama 15, no. 1 (2024): 104. http://dx.doi.org/10.58836/jpma.v15i1.21276.

Full text
Abstract:
<p>PT. Agung Selaras Group is a property company that operates in the business of selling houses. With a good sales management system, the property company can support its work activities. The aim of this research is to develop a system that can simplify stock management and minimize the risk of loss in the sales process. The data source for this research was obtained from direct observation and interviews with PT. Agung Selaras Group. In this system the author will combine the First In First Out method in managing incoming and outgoing product stock. The results of this research are that the system that has been designed can make it easier for managers to collect data on incoming and outgoing goods so that the risk of managing product stock can be minimized, and with computerized reports it can provide more precise, accurate and fast information. From the results of black box testing, the percentage of this application system can run well.</p>
APA, Harvard, Vancouver, ISO, and other styles
3

Kumalasari, Ira, Dyah Lestari, and Febrianto Alqodri. "Penggunaan Algoritma First In First Out dalam Antrian Pembimbingan Mahasiswa." Belantika Pendidikan 7, no. 2 (2024): 60–72. https://doi.org/10.47213/bp.v7i2.376.

Full text
Abstract:
Abstract: The student advising application that utilizes the First In First Out (FIFO) algorithm has been successfully integrated with the Thesis and Final Project Information System (SISINTA) and the Administrative Information System (SIADMIN). This application manages the advising process by following the laboratory room scheduling workflow, starting with schedule input by the room staff, time plotting by the faculty, and student reservations. The FIFO algorithm ensures a fair and transparent advising order. The waterfall development method includes requirements analysis, design, implementation, and testing. The application supports reservation, verification, monitoring, and scheduling features, and operates 100 percent as expected, enhancing efficiency and transparency. Abstrak: Aplikasi pembimbingan mahasiswa yang menggunakan algoritma First In First Out (FIFO) telah berhasil terintegrasi dengan Sistem Informasi Skripsi dan Tugas Akhir (SISINTA) serta Sistem Informasi Administrasi (SIADMIN). Aplikasi ini mengelola proses bimbingan dengan mengikuti alur penjadwalan ruang laboratorium yang dimulai dari input jadwal oleh petugas ruangan, plotting waktu oleh dosen, hingga reservasi oleh mahasiswa. Algoritma FIFO memastikan urutan bimbingan yang adil dan transparan. Metode pengembangan waterfall yang digunakan meliputi analisis kebutuhan, desain, implementasi, dan pengujian. Aplikasi ini mendukung fitur reservasi, verifikasi, monitoring, dan penjadwalan, serta berfungsi 100 persen sesuai harapan, meningkatkan efisiensi dan transparansi.
APA, Harvard, Vancouver, ISO, and other styles
4

Putra, Muhammad Taufik Dwi, Haryanto Hidayat, Naziva Septian, and Tiara Afriani. "Analisis Perbandingan Algoritma Penjadwalan CPU First Come First Serve (FCFS) Dan Round Robin." Building of Informatics, Technology and Science (BITS) 3, no. 3 (2021): 207–12. http://dx.doi.org/10.47065/bits.v3i3.1047.

Full text
Abstract:
CPU scheduling is important in multitasking and multiprocessing an operating system because of the many processes that need to be run in a computer. This causes the operating system to need to divide resources for running processes. CPU scheduling has several algorithms in it such as First Come First Serve (FCFS), Shortest Job First (SJF), Priority Scheduling, and Round Robin (RR) algorithms. The writing of this study is intended to compare the First Come First Serve and Round Robin algorithms with four specified parameters namely Average Turn Around Time, Waiting Time, Throughput, and CPU Utilization. The experiment was conducted with the First Come First Serve algorithm and the Round Robin of three different Quantum Times. These calculations at different quantum times aim to find out if the differences affect the advantages of the Round Robin algorithm over the First Come First Serve algorithm. The conclusion is that the First Come First Serve (FCFS) algorithm is superior to the Round Robin (RR) algorithm. This is indicated by the average turn around time, waiting time, and throughput values of the First Come First Serve algorithm more effective in running the process
APA, Harvard, Vancouver, ISO, and other styles
5

Liliosa Julpartin, Yuliana, and Hendra Kurniawan. "Implementation of First In First Out Algorithm in Management Information System at Hade Laundry." Antivirus : Jurnal Ilmiah Teknik Informatika 18, no. 1 (2024): 163–76. http://dx.doi.org/10.35457/antivirus.v18i1.3542.

Full text
Abstract:
Utilization of information technology can encourage business activities in a better direction, including the laundry business. This business is growing very rapidly in densely populated areas, especially in big cities. This was triggered by changes in people's lifestyles and busy lives, making laundry services a practical solution. Hade laundry is a business unit that concentrates on laundry services in the city of Makassar. This business unit still uses manual recording, so it is very vulnerable to data loss and irregularities. An inefficient queuing system causes conflicts between customers and the laundry. Therefore, to handle this problem you can use the management information system at Hade Laundry. This system is designed using the waterfall method. Customer queue data collection uses the FIFO (First-In, First-Out) algorithm to maintain queue stability or sequence. The programming language used in designing this system is PHP and the CodeIgniter framework, and uses a MySQL database. The results of the research are a website-based management information system with the application of the FIFO algorithm. The implementation of this algorithm is able to manage customer queues well (organized and structured), so as to minimize the occurrence of conflicts between customers and laundry parties.
APA, Harvard, Vancouver, ISO, and other styles
6

Candra Pamungkas, Angga Riyandi Saputra, Aditya Ramadhan, Alif Kurniawan, Naufal Abi Pratama, and Wishnu Rindra. "Pernerapan Algoritma Multilevel Feedback Queue (MFQ) & First In First Out (FIFO) pada Studi Kasus di Toko Bunga ARTHA PUSPA." JUMINTAL: Jurnal Manajemen Informatika dan Bisnis Digital 2, no. 2 (2023): 192–98. http://dx.doi.org/10.55123/jumintal.v2i2.2402.

Full text
Abstract:
Artha Puspa is a flower shop in Madiun which sells plant needs. This very rapid business development encourages every entrepreneur to create a form that is different from other businesses, one of which is the Arta Puspa Flower Shop, a common problem that is often experienced by Artha Puspa, namely direct purchase queues and orders. With that we use a combination of MFQ and FIFO. The application of a combination of Multilevel Feedback Queue (MFQ) and First In First Out (FIFO) algorithms is a strategy that can be used to manage processes that occur in computer systems. MFQ is a scheduling algorithm that uses several levels of queues, each of which has a different priority. Each process will be placed in a queue level according to its priority. Meanwhile, FIFO is a scheduling algorithm that manages processes by issuing processes that apply a combination of multilevel feedback queue (MFQ) & first in first out (FIFO) algorithms in the case study of the Bunga Artha Puspa store to enter the system for the first time. The combination of the two algorithms can provide a more effective solution in managing processes in computer systems. MFQ is a scheduling algorithm that uses several levels of queues, each of which has a different priority. Each process will be placed in a queue level according to its priority. Meanwhile, FIFO is a scheduling algorithm that manages processes by issuing processes that apply a combination of multilevel feedback queue (MFQ) & first in first out (FIFO) algorithms in the case study of the Bunga Artha Puspa store to enter the system for the first time. The combination of the two algorithms can provide a more effective solution in managing processes in computer systems. MFQ can be used to manage high priority processes, while FIFO can be used to manage low priority processes. Thus, processes that have high priority will always be processed first, thereby increasing system efficiency. In addition, the combination of MFQ and FIFO can also help reduce the waiting time for processes that have low priority, thereby increasing user satisfaction.
APA, Harvard, Vancouver, ISO, and other styles
7

Hertog, Maarten L. A. T. M., Ismail Uysal, Ultan McCarthy, Bert M. Verlinden, and Bart M. Nicolaï. "Shelf life modelling for first-expired-first-out warehouse management." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 372, no. 2017 (2014): 20130306. http://dx.doi.org/10.1098/rsta.2013.0306.

Full text
Abstract:
In the supply chain of perishable food products, large losses are incurred between farm and fork. Given the limited land resources and an ever-growing population, the food supply chain is faced with the challenge of increasing its handling efficiency and minimizing post-harvest food losses. Huge value can be added by optimizing warehouse management systems, taking into account the estimated remaining shelf life of the product, and matching it to the requirements of the subsequent part of the handling chain. This contribution focuses on how model approaches estimating quality changes and remaining shelf life can be combined in optimizing first-expired-first-out cold chain management strategies for perishable products. To this end, shelf-life-related performance indicators are used to introduce remaining shelf life and product quality in the cost function when optimizing the supply chain. A combinatorial exhaustive-search algorithm is shown to be feasible as the complexity of the optimization problem is sufficiently low for the size and properties of a typical commercial cold chain. The estimated shelf life distances for a particular batch can thus be taken as a guide to optimize logistics.
APA, Harvard, Vancouver, ISO, and other styles
8

Nababan, Marlince NK, Windania Purba, and Evta Indra. "The Tuition Payment Queuing System Uses Android-Based First in First Out (FIFO) Algorithm." IOP Conference Series: Earth and Environmental Science 748, no. 1 (2021): 012038. http://dx.doi.org/10.1088/1755-1315/748/1/012038.

Full text
Abstract:
Abstract Queuing is an important component of a process in service. Queues are formed in a company or institution due to customers. Disorderly queues are a big problem for all concerned. Where, disorderly queues occur at University Prima Indonesia at the time of tuition payment so that the campus has to carry out a crowded queue process and students have to stand waiting for the next call resulting in less effective and efficient even waste of energy for students and employees. This research designed a system of tuition payment queues using the First In First Out (FIFO) algorithm which aims to reduce the time students are queuing at the checkout at the time of tuition payment so as not to wait too long so that the time of students and campus employees is not wasted too much and reduce the crowded queue time. The result of this study is an android-based tuition payment system, which is useful for reducing student build up when paying tuition. Thus it can be said that the calculation result of P0 queue has a result of 0.25%, and the number of customers 3 people, the average customer in the queue has a value of 2.25, the total customer time is 20 minutes, and the average customer time in the row is 15 minutes, the server busy time is 0.75, and the server’s empty time is 0.25%.
APA, Harvard, Vancouver, ISO, and other styles
9

Yu, H., S. Ruepp, and M. S. Berger. "Enhanced first-in-first-out-based round-robin multicast scheduling algorithm for input-queued switches." IET Communications 5, no. 8 (2011): 1163–71. http://dx.doi.org/10.1049/iet-com.2010.0378.

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

Sadiah, Halimah Tus, Delta Hadi Purnama, and Muhamad Saad Nurul Ishlah. "Implementation of the First In First Out (FIFO) Algorithm in the Sandal and Shoe Product Inventory (Stock) Application." International Journal of Quantitative Research and Modeling 5, no. 1 (2024): 31–39. http://dx.doi.org/10.46336/ijqrm.v5i1.552.

Full text
Abstract:
This study addresses the optimization of inventory management for sandal and shoe products, at CV Diva Karya Mandiri Warehouse, which covers of five key features: a dashboard, master data management, transaction data, reporting, and user management. The First In First Out (FIFO) algorithm is specifically applied to the transaction feature, ensuring timely disbursement in line with the order of receipt. It is implemented using Rapid Application Development (RAD) methodology, which consists of Planning Requirements, User Design, Construction, and Cutover phases. The developed inventory application offers two access levels: administrators with comprehensive access and warehouse managers with limited access for viewing, searching, and filtering item data. This study successfully implementing the FIFO algorithm, with 95% Blackbox testing result achieved through boundary value analysis approach.Top of Form
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "First In First Out Algorithm"

1

Pankaj, Rajesh Kumar. "A threshold strategy for a first in first out heteregeneous two server queueing system." Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/14756.

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

Shi, Haijian. "Best-first Decision Tree Learning." The University of Waikato, 2007. http://hdl.handle.net/10289/2317.

Full text
Abstract:
In best-first top-down induction of decision trees, the best split is added in each step (e.g. the split that maximally reduces the Gini index). This is in contrast to the standard depth-first traversal of a tree. The resulting tree will be the same, just how it is built is different. The objective of this project is to investigate whether it is possible to determine an appropriate tree size on practical datasets by combining best-first decision tree growth with cross-validation-based selection of the number of expansions that are performed. Pre-pruning, post-pruning, CART-pruning can be performed this way to compare.
APA, Harvard, Vancouver, ISO, and other styles
3

Wright, SCD, and JE Maree. "First year Baccalaureate nursing students: Reasons for drop-out?" University of South Africa Press, 2007. http://encore.tut.ac.za/iii/cpro/DigitalItemViewPage.external?sp=1001041.

Full text
Abstract:
Improving throughput in the B. Tech. Nursing Sciences programme is a complex issue as not only the theoretical but also the practical component and undefined inner strengths of the student influence success. The purpose of this article is to report factors in the prospective students’ social background, their perceptions of nursing and nurses and their motivation that could influence their academic success in the first year of study. The research design was contextual, qualitative and exploratory. Triangulation of data gathering methods was obtained by using two instruments, a targeted selection interview and a written instrument. Data analysis was done through Tesch’s approach. The results indicate that prospective students perceive a nurse to be functioning from the affective domain, and that they judge themselves to be strong in the affective domain. The cognitive domain was rarely mentioned (7%). Due to the myths regarding the nursing profession, the profession continue to attract students who are interested in the myth and not the reality.
APA, Harvard, Vancouver, ISO, and other styles
4

Ang, Li-Minn. "Depth-first search embedded wavelet algorithm for hardware implementation." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 2001. https://ro.ecu.edu.au/theses/1047.

Full text
Abstract:
The emerging technology of image communication over wireless transmission channels requires several new challenges to be simultaneously met at the algorithm and architecture levels. At the algorithm level, desirable features include high coding performance, bit stream scalability, robustness to transmission errors and suitability for content-based coding schemes. At the architecture level, we require efficient architectures for construction of portable devices with small size and low power consumption. An important question is to ask if a single coding algorithm can be designed to meet the diverse requirements. Recently, researchers working on improving different features have converged on a set of coding schemes commonly known as embedded wavelet algorithms. Currently, these algorithms enjoy the highest coding performances reported in the literature. In addition, embedded wavelet algorithms have the natural feature of being able to meet a target bit rate precisely. Furthermore work on improving the algorithm robustness has shown much promise. The potential of embedded wavelet techniques has been acknowledged by its inclusion in the new JPEG2000 and MPEG-4 image and video coding standards.
APA, Harvard, Vancouver, ISO, and other styles
5

Friedman, Susan. "Changing the subject : first-person narration in and out of the classroom." [Tampa, Fla] : University of South Florida, 2007. http://purl.fcla.edu/usf/dc/et/SFE0001943.

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

Winikoff, Steven M. "Incorporating the simplicity first methodology into a machine learning genetic algorithm." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp01/MQ39118.pdf.

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

Schardl, Tao Benjamin. "Design and analysis of a nondeterministic parallel breadth-first search algorithm." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/61575.

Full text
Abstract:
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 75-77).<br>I have developed a multithreaded implementation of breadth-first search (BFS) of a sparse graph using the Cilk++ extensions to C++. My PBFS program on a single processor runs as quickly as a standard C++ breadth-first search implementation. PBFS achieves high workefficiency by using a novel implementation of a multiset data structure, called a "bag," in place of the FIFO queue usually employed in serial breadth-first search algorithms. For a variety of benchmark input graphs whose diameters are significantly smaller than the number of vertices - a condition met by many real-world graphs - PBFS demonstrates good speedup with the number of processing cores. Since PBFS employs a nonconstant-time "reducer" - a "hyperobject" feature of Cilk++ - the work inherent in a PBFS execution depends nondeterministically on how the underlying work-stealing scheduler load-balances the computation. I provide a general method for analyzing nondeteriministic programs that use reducers. PBFS also is nondeterministic in that it contains benign races which affect its performance but not its correctness. Fixing these races with mutual-exclusion locks slows down PBFS empirically, but it makes the algorithm amenable to analysis. In particular, I show that for a graph G = (V, E) with diameter D and bounded out-degree. this data-race-free version of PBFS algorithm runs in time O((V +E)/P+DIg[supercript 3] (V/D)) on P processors, which means that it attains near-perfect linear speedup if P < (V +E)/DIg[supercript 3] (V/D).<br>by Tao Benjamin Schardl.<br>M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
8

Martin, Georgianna LaNelle. "Getting out, missing out, and surviving: the social class experiences of White, low-income, first-generation college students." Diss., University of Iowa, 2012. https://ir.uiowa.edu/etd/2937.

Full text
Abstract:
The purpose of this study was to understand how White students from low socioeconomic status backgrounds (operationalized as students who are both low income and of the first generation in their family to attend college) experience and navigate social class during college. This was a qualitative research study employing a phenomenological research methodology. A critical theoretical lens was used to illuminate systemic issues of power and privilege related to social class present in the experiences of these participants. This study was guided by the following research question: How do White, low SES students experience and navigate social class during college? Participants in this study had many similar experiences to one another related to their social class. However, there also existed a variety of individual differences in how students understood and experienced their social class during college. Overall, participants expressed a limited awareness of their social class growing up, but all became keenly aware of it during college. In particular, during college, students became aware of how their own social class differed from the dominant middle class to upper class social class represented on campus. Participants minimized the salience of social class as an aspect of their identity with many of them expressing that they did not want their social class to define them. While participants largely did not feel as if social class was an important aspect of their identity, it became clear through their stories that this aspect of their identity influenced how they viewed themselves, the world around them, and their higher SES peers in college. For example, participants readily acknowledged the frustration and resentment that set them apart from their college peers. The students who participated in this study exhibited ethics of hard work, self-sufficiency, and financial responsibility. These values and attitudes also were evident in students' practices and behaviors (e.g., their judicious spending habits, their long hours working for pay). It also became clear that the long hours most participants in this study worked in order to afford college meant missing out on opportunities for involvement in activities outside of the classroom. Finally, participants' experiences interacting with their high SES peers played a pivotal role in their awareness of their social class during college. Participants were often frustrated by the attitudes, values, and behaviors of their higher SES peers, and for some, these social class differences led to social isolation. Overall, these findings illuminate a variety of issues and areas for concern, directly related to social class, experienced by low-income, first-generation college students in higher education.
APA, Harvard, Vancouver, ISO, and other styles
9

Cottrill, Virginia M. "Life After Drop-Out: An Examination of Rural, Appalachian, First-Generation Non-Persisters." Ohio University / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1395160206.

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

ALAHMADI, ABDULRAHMAN M. "ENHANCED FIRST-FIT DECREASING ALGORITHM FOR ENERGY-AWARE TASK SCHEDULING IN CLOUD." OpenSIUC, 2014. https://opensiuc.lib.siu.edu/theses/1381.

Full text
Abstract:
With the emergence of many new data centers around the globe, large-scale commercial and scientific applications executed in the cloud call for efficient cloud resource management strategies to save energy without compromising the performance. According to the statistics from the Data Centre Dynamic (DCD) organization, the expected energy consumption by computer servers would increase by 19% in 2013 compared with 2012. Such a trend may continue for many years. Moreover, the estimated energy consumption of computers in the U.S. was about 2% out of the total energy consumption in 2010, which makes the IT industry the second largest pollution contributor after aviation. In this paper, a novel approach for scheduling, sharing and migrating Virtual Machines (VMs) for a bag of cloud tasks is designed and developed to reduce energy consumption within a certain execution time and high system throughput. This approach is derived from an Enhanced First Fit Decreasing (EFFD) algorithm combined with our VM reuse strategy. Furthermore, a virtual machine migration method is introduced to dynamically monitor the cloud situation for necessary migration. Our simulation results using the open source CloudReport show that EFFD with our VM reuse strategy could gain a higher resource utilization rate and lower energy consumption than regular Greedy, Round Robin (RR) and FDD without VM reuse.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "First In First Out Algorithm"

1

Smith, Robert E. Adaptively resizing populations: Algorithm, analysis, and first results. National Aeronautics and Space Administration, 1993.

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

Christopher, Matt. Man out at first. Norwood House Press, 2009.

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

Salka, John. First In, Last Out. Penguin Group USA, Inc., 2008.

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

Christopher, Matt. Man Out at First. Little, Brown Books for Young Readers, 2009.

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

ill, Beier Ellen, ed. Man out at first. Little, Brown, 1993.

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

Truuvert, Kaarel. A self-stabilizing first-come-first-served mutual exclusion algorithm with small shared variables. National Library of Canada, 1990.

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

Fuchs, A. P. Axiom-man: First night out. Coscom Entertainment, 2007.

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

Copyright Paperback Collection (Library of Congress), ed. Pathfinder: First in, last out. Ballantine Books, 2002.

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

Abbring, Jaap H. Last-in first-out oligopoly dynamics. Federal Reserve Bank of Chicago, 2006.

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

Kilgour, O. F. G. Work Out Biology for First Examinations. Macmillan Education UK, 1986. http://dx.doi.org/10.1007/978-1-349-18139-1.

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

Book chapters on the topic "First In First Out Algorithm"

1

Hublet, François, Leonardo Lima, David Basin, Srđan Krstić, and Dmitriy Traytel. "Proactive Real-Time First-Order Enforcement." In Computer Aided Verification. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-65630-9_8.

Full text
Abstract:
AbstractModern software systems must comply with increasingly complex regulations in domains ranging from industrial automation to data protection. Runtime enforcement addresses this challenge by empowering systems to not only observe, but also actively control, the behavior of target systems by modifying their actions to ensure policy compliance. We propose a novel approach to the proactive real-time enforcement of policies expressed in metric first-order temporal logic (MFOTL). We introduce a new system model, define an expressive MFOTL fragment that is enforceable in that model, and develop a sound enforcement algorithm for this fragment. We implement this algorithm in a tool called WhyEnf and carry out a case study on enforcing GDPR-related policies. Our tool can enforce all policies from the study in real-time with modest overhead. Our work thus provides the first tool-supported approach that can proactively enforce expressive first-order policies in real time.
APA, Harvard, Vancouver, ISO, and other styles
2

Bromberger, Martin, Florent Krasnopol, Sibylle Möhle, and Christoph Weidenbach. "First-Order Automatic Literal Model Generation." In Automated Reasoning. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-63498-7_9.

Full text
Abstract:
AbstractGiven a finite consistent set of ground literals, we present an algorithm that generates a complete first-order logic interpretation, i.e., an interpretation for all ground literals over the signature and not just those in the input set, that is also a model for the input set. The interpretation is represented by first-order linear literals. It can be effectively used to evaluate clauses. A particular application are SCL stuck states. The SCL (Simple Clause Learning) calculus always computes with respect to a finite number of ground literals. It then finds either a contradiction or a stuck state being a model with respect to the considered ground literals. Our algorithm builds a complete literal interpretation out of such a stuck state model that can then be used to evaluate the clause set. If all clauses are satisfied an overall model has been found. If it does not satisfy some clause, this information can be effectively explored to extend the scope of ground literals considered by SCL.
APA, Harvard, Vancouver, ISO, and other styles
3

Zingg, Sheila, Srđan Krstić, Martin Raszyk, Joshua Schneider, and Dmitriy Traytel. "Verified First-Order Monitoring with Recursive Rules." In Tools and Algorithms for the Construction and Analysis of Systems. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99527-0_13.

Full text
Abstract:
AbstractFirst-order temporal logics and rule-based formalisms are two popular families of specification languages for monitoring. Each family has its advantages and only few monitoring tools support their combination. We extend metric first-order temporal logic (MFOTL) with a recursive let construct, which enables interleaving rules with temporal logic formulas. We also extend VeriMon, an MFOTL monitor whose correctness has been formally verified using the Isabelle proof assistant, to support the new construct. The extended correctness proof covers the interaction of the new construct with the existing verified algorithm, which is subtle due to the presence of the bounded future temporal operators. We demonstrate the recursive let’s usefulness on several example specifications and evaluate our verified algorithm’s performance against the DejaVu monitoring tool.
APA, Harvard, Vancouver, ISO, and other styles
4

Whitters, Gerald, Vivek Nigam, and Carolyn Talcott. "Incremental Rewriting Modulo SMT." In Automated Deduction – CADE 29. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-38499-8_32.

Full text
Abstract:
AbstractRewriting Modulo SMT combines two powerful automated deduction techniques (1) rewriting and (2) SMT-solving. Rewriting enables the specification of behavior of systems using rewriting rules, while SMT theories specify system properties. Rewriting Modulo SMT is enabled by combining existing tools, such as Maude and SMT solvers. Search algorithms used for carrying out Rewriting Modulo SMT, however, cannot exploit the incremental solving features available in SMT solvers as they are based on breadth-first search. This paper addresses this limitation by proposing Incremental Rewriting Modulo SMT Theories, which is a syntactical restriction to rewriting rules. This restriction turns out to naturally be used in several applications of Rewriting Modulo SMT, including the verification of algorithms, cyber-physical systems, and security protocols. Moreover, we propose a Hybrid-Search algorithm for Incremental Rewriting Modulo SMT Theories that combines breadth-first search and depth-first search, thus enabling incremental SMT-solving. We demonstrate through a collection of existing benchmarks that the Hybrid-Search algorithm can achieve a 10 times performance improvement in verification times.
APA, Harvard, Vancouver, ISO, and other styles
5

Frenkel, Eden, Tej Chajed, Oded Padon, and Sharon Shoham. "Efficient Implementation of an Abstract Domain of Quantified First-Order Formulas." In Computer Aided Verification. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-65630-9_5.

Full text
Abstract:
AbstractThis paper lays a practical foundation for using abstract interpretation with an abstract domain that consists of sets of quantified first-order logic formulas. This abstract domain seems infeasible at first sight due to the complexity of the formulas involved and the enormous size of sets of formulas (abstract elements). We introduce an efficient representation of abstract elements, which eliminates redundancies based on a novel syntactic subsumption relation that under-approximates semantic entailment. We develop algorithms and data structures to efficiently compute the join of an abstract element with the abstraction of a concrete state, operating on the representation of abstract elements. To demonstrate feasibility of the domain, we use our data structures and algorithms to implement a symbolic abstraction algorithm that computes the least fixpoint of the best abstract transformer of a transition system, which corresponds to the strongest inductive invariant. We succeed at finding, for example, the least fixpoint for Paxos (which in our representation has 1,438 formulas with $$\forall ^*\exists ^*\forall ^*$$ ∀ ∗ ∃ ∗ ∀ ∗ quantification) in time comparable to state-of-the-art property-directed approaches.
APA, Harvard, Vancouver, ISO, and other styles
6

Tanaka, Isao, and Atsushi Togo. "Collective Motion of Atoms in Metals by First Principles Calculations." In The Plaston Concept. Springer Nature Singapore, 2022. http://dx.doi.org/10.1007/978-981-16-7715-1_4.

Full text
Abstract:
AbstractFundamental information on the collective motion of atoms can be learned by tracing imaginary phonon modes in deformed crystals. This should be useful to investigate the atomic process of plaston in a logical manner. Here, we summarize our works on the collective motion of atoms in unary metallic crystals examined by first principles phonon calculations. A simple algorithm for automated searching of the structural transition pathway following the imaginary phonon modes has been constructed. We first show the construction of structure evolution diagrams in Cu, Mg, Ti, and Hf by taking a simple cubic (SC) structure as a starting structure. The pathway corresponds to a route connecting initial and final structures without any energy barrier. Effects of the hydrostatic pressure on the diagram have been examined as well. In the second part, the collective motion of atoms in HCP-Ti under homogeneous shear deformation corresponding to the {$$10\overline{1} 2$$ 10 1 ¯ 2 } twinning mode is shown. The structural transition pathway from the parent to twin, which is widely accepted as the “shuffling”, is shown in detail.
APA, Harvard, Vancouver, ISO, and other styles
7

Guilloud, Simon, Mario Bucev, Dragana Milovančević, and Viktor Kunčak. "Formula Normalizations in Verification." In Computer Aided Verification. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37709-9_19.

Full text
Abstract:
AbstractWe apply and evaluate polynomial-time algorithms to compute two different normal forms of propositional formulas arising in verification. One of the normal form algorithms is presented for the first time. The algorithms compute normal forms and solve the word problem for two different subtheories of Boolean algebra: orthocomplemented bisemilattice (OCBSL) and ortholattice (OL). Equality of normal forms decides the word problem and is a sufficient (but not necessary) check for equivalence of propositional formulas. Our first contribution is a quadratic-time OL normal form algorithm, which induces a coarser equivalence than the OCBSL normal form and is thus a more precise approximation of propositional equivalence. The algorithm is efficient even when the input formula is represented as a directed acyclic graph. Our second contribution is the evaluation of OCBSL and OL normal forms as part of a verification condition cache of the Stainless verifier for Scala. The results show that both normalization algorithms substantially increase the cache hit ratio and improve the ability to prove verification conditions by simplification alone. To gain further insights, we also compare the algorithms on hardware circuit benchmarks, showing that normalization reduces circuit size and works well in the presence of sharing.
APA, Harvard, Vancouver, ISO, and other styles
8

Hartmanns, Arnd, Bram Kohlen, and Peter Lammich. "Efficient Formally Verified Maximal End Component Decomposition for MDPs." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-71162-6_11.

Full text
Abstract:
AbstractIdentifying a Markov decision process’s maximal end components is a prerequisite for applying sound probabilistic model checking algorithms. In this paper, we present the first mechanized correctness proof of a maximal end component decomposition algorithm, which is an important algorithm in model checking, using the Isabelle/HOL theorem prover. We iteratively refine the high-level algorithm and proof into an imperative LLVM bytecode implementation that we integrate into the Modest Toolset ’s existing model checker. We bring the benefits of interactive theorem proving into practice by reducing the trusted code base of a popular probabilistic model checker and we experimentally show that our new verified maximal end component decomposition in performs on par with the tool’s previous unverified implementation.
APA, Harvard, Vancouver, ISO, and other styles
9

Weik, Martin H. "first ended, first out." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_7196.

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

Weik, Martin H. "first in, first out." In Computer Science and Communications Dictionary. Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_7199.

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

Conference papers on the topic "First In First Out Algorithm"

1

Dugar, Vishal, Sanjiban Choudhury, and Sebastian Scherer. "Smooth Trajectory Optimization in Wind: First Results on a Full-Scale Helicopter." In Vertical Flight Society 73rd Annual Forum & Technology Display. The Vertical Flight Society, 2017. http://dx.doi.org/10.4050/f-0073-2017-12200.

Full text
Abstract:
A significant challenge for unmanned aerial vehicles is flying long distances in the presence of wind. The presence of wind, which acts like a forcing function on the system dynamics, significantly affects control authority and flight times. While there is a large body of work on the individual topics of planning long missions and path planning in wind fields, these methods do not scale to solve the combined problem under real-time constraints. In this paper, we address the problem of planning long, dynamically feasible, time-optimal trajectories in the presence of wind for a full-scale helicopter. We build on our existing algorithm, kITE, which accounts for wind in a principled and elegant way, and produces dynamically-feasible trajectories that are guaranteed to be safe in near real-time. It uses a novel framework to decouple path optimization in a fixed ground frame from velocity optimization in a moving air frame. We present extensive experimental evaluation of kITE on an autonomous helicopter platform (with a human safety pilot in the loop) with data from over 23 missions in winds up to 20m = s and airspeeds up to 50m = s. Our results not only shows the efficacy of the algorithm and its implementation, but also provide insights into failure cases that we encountered. This paves the way forward for autonomous systems to exhibit pilot-like behavior when flying missions in winds aloft.
APA, Harvard, Vancouver, ISO, and other styles
2

Patil, A., M. Prakash, and A. Nimkar. "First-in not referenced first-out page replacement algorithm." In the International Conference & Workshop. ACM Press, 2011. http://dx.doi.org/10.1145/1980022.1980116.

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

Hapsari, Dian Aryanti, Adhistya Erna Permanasari, Silmi Fauziati, and Ida Fitriana. "Management information systems development for veterinary hospital patient registration using first in first out algorithm." In 2016 1st International Conference on Biomedical Engineering (IBIOMED). IEEE, 2016. http://dx.doi.org/10.1109/ibiomed.2016.7869829.

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

Shi, Yuepeng, Yuqing Wan, and Quanbo Ge. "A Unified Out-of-Sequence Measurements Fusion Algorithm for WSN." In 2009 First International Workshop on Database Technology and Applications, DBTA. IEEE, 2009. http://dx.doi.org/10.1109/dbta.2009.29.

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

Sonata, Fifin, Juniar Hutagalung, and Aeri Rachmad. "Analysis average waiting time search performance in the queue process on CPU scheduling using the Round Robin, shortest job first and first in first out algorithm." In THE FIRST INTERNATIONAL CONFERENCE ON NEUROSCIENCE AND LEARNING TECHNOLOGY (ICONSATIN 2021). AIP Publishing, 2023. http://dx.doi.org/10.1063/5.0111352.

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

Xia, Yifan, and Xiangyi Zhang. "A Neural Column Generation Approach to the Vehicle Routing Problem with Two-Dimensional Loading and Last-In-First-Out Constraints." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/218.

Full text
Abstract:
The vehicle routing problem with two-dimensional loading constraints (2L-CVRP) and the last-in-first-out (LIFO) rule presents significant practical and algorithmic challenges. While numerous heuristic approaches have been proposed to address its complexity, stemming from two NP-hard problems: the vehicle routing problem (VRP) and the two-dimensional bin packing problem (2D-BPP), less attention has been paid to developing exact algorithms. Bridging this gap, this article presents an exact algorithm that integrates advanced machine learning techniques, specifically a novel combination of attention and recurrence mechanisms. This integration accelerates the state-of-the-art exact algorithm by a median of 29.79% across various problem instances. Moreover, the proposed algorithm successfully resolves an open instance in the standard test-bed, demonstrating significant improvements brought about by the incorporation of machine learning models. Code is available at https://github.com/xyfffff/NCG-for-2L-CVRP.
APA, Harvard, Vancouver, ISO, and other styles
7

Zeng, Huimin, Zhenrui Yue, Yang Zhang, Ziyi Kou, Lanyu Shang, and Dong Wang. "On Attacking Out-Domain Uncertainty Estimation in Deep Neural Networks." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/678.

Full text
Abstract:
In many applications with real-world consequences, it is crucial to develop reliable uncertainty estimation for the predictions made by the AI decision systems. Targeting at the goal of estimating uncertainty, various deep neural network (DNN) based uncertainty estimation algorithms have been proposed. However, the robustness of the uncertainty returned by these algorithms has not been systematically explored. In this work, to raise the awareness of the research community on robust uncertainty estimation, we show that state-of-the-art uncertainty estimation algorithms could fail catastrophically under our proposed adversarial attack despite their impressive performance on uncertainty estimation. In particular, we aim at attacking out-domain uncertainty estimation: under our attack, the uncertainty model would be fooled to make high-confident predictions for the out-domain data, which they originally would have rejected. Extensive experimental results on various benchmark image datasets show that the uncertainty estimated by state-of-the-art methods could be easily corrupted by our attack.
APA, Harvard, Vancouver, ISO, and other styles
8

Huang, Tiancheng, Donglin Wang, Yuan Fang, and Zhengyu Chen. "End-to-End Open-Set Semi-Supervised Node Classification with Out-of-Distribution Detection." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/290.

Full text
Abstract:
Out-Of-Distribution (OOD) samples are prevalent in real-world applications. The OOD issue becomes even more severe on graph data, as the effect of OOD nodes can be potentially amplified by propagation through the graph topology. Recent works have considered the OOD detection problem, which is critical for reducing the uncertainty in learning and improving the robustness. However, no prior work considers simultaneously OOD detection and node classification on graphs in an end-to-end manner. In this paper, we study a novel problem of end-to-end open-set semi-supervised node classification (OSSNC) on graphs, which deals with node classification in the presence of OOD nodes. Given the lack of supervision on OOD nodes, we introduce a latent variable to indicate in-distribution or OOD nodes in a variational inference framework, and further propose a novel algorithm named as Learning to Mix Neighbors (LMN) which learns to dampen the influence of OOD nodes through the messaging-passing in typical graph neural networks. Extensive experiments on various datasets show that the proposed method outperforms state-of-the-art baselines in terms of both node classification and OOD detection.
APA, Harvard, Vancouver, ISO, and other styles
9

Zhang, Qingyun, Zhouxing Su, Zhipeng Lü, and Lingxiao Yang. "A Weighting-Based Tabu Search Algorithm for the p-Next Center Problem." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/669.

Full text
Abstract:
The p-next center problem (pNCP) is an extension of the classical p-center problem. It consists of locating p centers from a set of candidate centers and allocating both a reference and a backup center to each client, to minimize the maximum cost, which is the length of the path from a client to its reference center and then to its backup center. Among them, the reference center is the closest center to a client and serves it under normal circumstances, while the backup center is the closest center to the reference center and serves the client when the reference center is out of service. In this paper, we propose a weighting-based tabu search algorithm called WTS for solving pNCP. WTS optimizes the pNCP by solving its decision subproblems with given assignment costs with an efficient swap-based neighborhood structure and a hierarchical penalty strategy for neighborhood evaluation. Extensive experimental studies on 413 benchmark instances demonstrate that WTS outperforms the state-of-the-art methods in the literature. Specifically, WTS improves 12 previous best known results and matches the optimal results for all remaining 401 ones in a much shorter time than other algorithms. More importantly, WTS reaches the lower bounds for 10 instances for the first time.
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Youzhi, Bo An, and V. S. Subrahmanian. "Correlation-Based Algorithm for Team-Maxmin Equilibrium in Multiplayer Extensive-Form Games." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/86.

Full text
Abstract:
Efficient algorithms computing a Nash equilibrium have been successfully applied to large zero- sum two-player extensive-form games (e.g., poker). However, in multiplayer games, computing a Nash equilibrium is generally hard, and the equilibria are not exchangeable, which makes players face the problem of selecting one of many different Nash equilibria. In this paper, we focus on an alternative solution concept in zero-sum multiplayer extensive-form games called Team-Maxmin Equilibrium (TME). It is a Nash equilibrium that maximizes each team member’s utility. As TME is unique in general, it avoids the equilibrium selection problem. However, it is still difficult (FNP- hard) to find a TME. Computing it can be formulated as a non-convex program, but existing algorithms are capable of solving this program for only very small games. In this paper, we first refine the complexity result for computing a TME by using a correlation plan to show that a TME can be found in polynomial time in a specific class of games according to our boundary for complexity. Second, we propose an efficient correlation-based algorithm to solve the non-convex program for TME in games not belonging to this class. The algorithm combines two special correlation plans based on McCormick envelopes for convex relaxation and von Stengel-Forges polytope for correlated equilibria. We show that restricting the feasible solution space to von Stengel-Forges polytope will strictly reduce the feasible solution space after convex re- laxation of nonlinear terms. Finally, experiments show that our algorithm is about four orders of magnitude faster than the prior state of the art and can solve many previously unsolvable games.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "First In First Out Algorithm"

1

Champlin, Craig, and John P. H. Steele. DTPH56-14H-CAP06 Pipeline Assessment through 4-Dimensional Anomaly Detection and Characterization. Pipeline Research Council International, Inc. (PRCI), 2016. http://dx.doi.org/10.55274/r0011766.

Full text
Abstract:
The team intended to develop two algorithms for matching anomalies across coincident internal pipeline inspections to assess corrosion growth rates. The first algorithm would match boxed anomalies. The second algorithm would match raw signals. The goal for each algorithm is slightly different. The boxed algorithm is intended to do a complete mapping of individual called-out anomalies from one inspection to the next. The raw signal algorithm velocity corrects and aligns raw inspections signals.
APA, Harvard, Vancouver, ISO, and other styles
2

Striuk, Andrii, Olena Rybalchenko, and Svitlana Bilashenko. Development and Using of a Virtual Laboratory to Study the Graph Algorithms for Bachelors of Software Engineering. [б. в.], 2020. http://dx.doi.org/10.31812/123456789/4462.

Full text
Abstract:
The paper presents an analysis of the importance of studying graph algorithms, the reasons for the need to implement this project and its subsequent use. The existing analogues analysis is carried out, due to which a list of advantages and disadvantages is formed and taken into account in developing the virtual laboratory. A web application is created that clearly illustrates the work of graph algorithms, such as Depth-First Search, Dijkstra’s Shortest Path, Floyd- Warshall, Kruskal Minimum Cost Spanning Tree Algorithm. A simple and user- friendly interface is developed and it is supported by all popular browsers. The software product is provided with user registration and authorization functions, chat communication, personal cabinet editing and viewing the statistics on web- application use. An additional condition is taken into account at the design stage, namely the flexibility of the architecture, which envisaged the possibility of easy expansion of an existing functionality. Virtual laboratory is used at Kryvyi Rih National University to training students of specialty 121 Software Engineering in the disciplines “Algorithms and Data Structures” and “Discrete Structures”.
APA, Harvard, Vancouver, ISO, and other styles
3

Cordeiro de Amorim, Renato. A survey on feature weighting based K-Means algorithms. Web of Open Science, 2020. http://dx.doi.org/10.37686/ser.v1i2.79.

Full text
Abstract:
In a real-world data set there is always the possibility, rather high in our opinion, that different features may have different degrees of relevance. Most machine learning algorithms deal with this fact by either selecting or deselecting features in the data preprocessing phase. However, we maintain that even among relevant features there may be different degrees of relevance, and this should be taken into account during the clustering process. With over 50 years of history, K-Means is arguably the most popular partitional clustering algorithm there is. The first K-Means based clustering algorithm to compute feature weights was designed just over 30 years ago. Various such algorithms have been designed since but there has not been, to our knowledge, a survey integrating empirical evidence of cluster recovery ability, common flaws, and possible directions for future research. This paper elaborates on the concept of feature weighting and addresses these issues by critically analysing some of the most popular, or innovative, feature weighting mechanisms based in K-Means
APA, Harvard, Vancouver, ISO, and other styles
4

Baader, Franz, and Ralf Küsters. Matching Concept Descriptions with Existential Restrictions Revisited. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.98.

Full text
Abstract:
An abridged version of this technical report has been submitted to KR 2000. Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the CLASSIC system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existential restrictions. Motivated by an application in chemical process engineering, which requires a description language with existential restrictions, this paper investigates the matching problem in Description Logics with existential restrictions. It turns out that existential restrictions make matching more complex in two respects. First, whereas matching in sublanguages of CLASSIC is polynomial, deciding the existence of matchers is an NP-complete problem in the presence of existential restrictions. Second, whereas in sublanguages of Classic solvable matching problems have a unique least matcher, this is not the case for languages with existential restrictions. Thus, it is not a priori clear which of the (possibly infinitely many) matchers should be returned by a matching algorithm. After determining the complexity of the decision problem, the present paper first investigates the question of what are 'interesting' sets of matchers, and then describes algorithms for computing these sets for the languages EL (which allows for conjunction and existential restrictions) and ALE (which additionally allows for value restrictions, primitive negation, and the bottom concept).
APA, Harvard, Vancouver, ISO, and other styles
5

Baader, Franz, and Ralf Küsters. Matching Concept Descriptions with Existential Restrictions Revisited. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.98.

Full text
Abstract:
An abridged version of this technical report has been submitted to KR 2000. Matching of concepts against patterns is a new inference task in Description Logics, which was originally motivated by applications of the CLASSIC system. Consequently, the work on this problem was until now mostly concerned with sublanguages of the Classic language, which does not allow for existential restrictions. Motivated by an application in chemical process engineering, which requires a description language with existential restrictions, this paper investigates the matching problem in Description Logics with existential restrictions. It turns out that existential restrictions make matching more complex in two respects. First, whereas matching in sublanguages of CLASSIC is polynomial, deciding the existence of matchers is an NP-complete problem in the presence of existential restrictions. Second, whereas in sublanguages of Classic solvable matching problems have a unique least matcher, this is not the case for languages with existential restrictions. Thus, it is not a priori clear which of the (possibly infinitely many) matchers should be returned by a matching algorithm. After determining the complexity of the decision problem, the present paper first investigates the question of what are 'interesting' sets of matchers, and then describes algorithms for computing these sets for the languages EL (which allows for conjunction and existential restrictions) and ALE (which additionally allows for value restrictions, primitive negation, and the bottom concept).
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Yan, Yuhao Luo, and Xin Lu. PHEV Energy Management Optimization Based on Multi-Island Genetic Algorithm. SAE International, 2022. http://dx.doi.org/10.4271/2022-01-0739.

Full text
Abstract:
The plug-in hybrid electric vehicle (PHEV) gradually moves into the mainstream market with its excellent power and energy consumption control, and has become the research target of many researchers. The energy management strategy of plug-in hybrid vehicles is more complicated than conventional gasoline vehicles. Therefore, there are still many problems to be solved in terms of power source distribution and energy saving and emission reduction. This research proposes a new solution and realizes it through simulation optimization, which improves the energy consumption and emission problems of PHEV to a certain extent. First, on the basis that MATLAB software has completed the modeling of the key components of the vehicle, the fuzzy controller of the vehicle is established considering the principle of the joint control of the engine and the electric motor. Afterwards, based on the Isight and ADVISOR co-simulation platform, with the goal of ensuring certain dynamic performance and optimal fuel economy of the vehicle, the multi-island genetic algorithm is used to optimize the parameters of the membership function of the fuzzy control strategy to overcome it to a certain extent. The disadvantages of selecting parameters based on experience are compensated for, and the efficiency and feasibility of fuzzy control are improved. Finally, the PHEV vehicle model simulation comparison was carried out under the UDDS working condition through ADVISOR software. The optimization results show that while ensuring the required power performance, the vehicle fuzzy controller after parameter optimization using the multi-island genetic algorithm is more efficient, which can significantly reduce vehicle fuel consumption and improve exhaust emissions.
APA, Harvard, Vancouver, ISO, and other styles
7

Borgwardt, Stefan, Walter Forkel, and Alisa Kovtunova. Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes. Technische Universität Dresden, 2019. http://dx.doi.org/10.25368/2023.223.

Full text
Abstract:
Lightweight temporal ontology languages have become a very active field of research in recent years. Many real-world applications, like processing electronic health records (EHRs), inherently contain a temporal dimension, and require efficient reasoning algorithms. Moreover, since medical data is not recorded on a regular basis, reasoners must deal with sparse data with potentially large temporal gaps. In this paper, we introduce a temporal extension of the tractable language ELH⊥, which features a new class of convex diamond operators that can be used to bridge temporal gaps. We develop a completion algorithm for our logic, which shows that entailment remains tractable. Based on this, we develop a minimal-world semantics for answering metric temporal conjunctive queries with negation. We show that query answering is combined first-order rewritable, and hence in polynomial time in data complexity.
APA, Harvard, Vancouver, ISO, and other styles
8

Küsters, Ralf, and Ralf Molitor. Computing Least Common Subsumers in ALEN. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.110.

Full text
Abstract:
Computing the least common subsumer (lcs) in description logics is an inference task first introduced for sublanguages of CLASSIC. Roughly speaking, the lcs of a set of concept descriptions is the most specific concept description that subsumes all of the input descriptions. As such, the lcs allows to extract the commonalities from given concept descriptions, a task essential for several applications like, e.g., inductive learning, information retrieval, or the bottom-up construction of KR-knowledge bases. Previous work on the lcs has concentrated on description logics that either allow for number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN, which allows for both constructors (as well as concept conjunction, primitive negation, and value restrictions). The proof of correctness of our lcs algorithm is based on an appropriate structural characterization of subsumption in ALEN also introduced in this paper.
APA, Harvard, Vancouver, ISO, and other styles
9

Küsters, Ralf, and Ralf Molitor. Computing Least Common Subsumers in ALEN. Aachen University of Technology, 2000. http://dx.doi.org/10.25368/2022.110.

Full text
Abstract:
Computing the least common subsumer (lcs) in description logics is an inference task first introduced for sublanguages of CLASSIC. Roughly speaking, the lcs of a set of concept descriptions is the most specific concept description that subsumes all of the input descriptions. As such, the lcs allows to extract the commonalities from given concept descriptions, a task essential for several applications like, e.g., inductive learning, information retrieval, or the bottom-up construction of KR-knowledge bases. Previous work on the lcs has concentrated on description logics that either allow for number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN, which allows for both constructors (as well as concept conjunction, primitive negation, and value restrictions). The proof of correctness of our lcs algorithm is based on an appropriate structural characterization of subsumption in ALEN also introduced in this paper.
APA, Harvard, Vancouver, ISO, and other styles
10

Levchuk, Larisa, Elena Tiunova, Anastasia Shestakova, Lidiya Krylova, and Natalya Sokolova. Electronic educational resourse "Ineractive dialogue simulator "Functional disorders of the digestive organs"". SIB-Expertise, 2024. http://dx.doi.org/10.12731/er0782.29012024.

Full text
Abstract:
Functional disorders of digestive organs (FDOD) are frequently diagnosed disorders in childs in the first year of life. An interactive dialogue simulator has been developed for studying FROP in children. The dialogue simulator was created in the iSpring Suite program. The dialogue simulator allows students repeat the algorithm for diagnosing and treating FROP many times. It is expected, that using of interactive dialogue simulator in the discipline of faculty pediatrics will help students master their skills of diagnosing and treating FROP in childs. The using of our interactive simulator will contribute to the development of self-control in students and more solid assimilation of knowledge.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'First In First Out Algorithm' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography