Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 435 papers for “Stack (abstract data type)”
Pascale Champagnoux, Laurence Duchien, Daniel Enselme et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 2000
IEEE 4th Joint Conference on Knowledge-Based Software Engineering, Edited by T. Hruska and M. Hashimoto, Brno, République Tchèque,Septembre 2000, pages 183-190.
Cited by 0
J. Stanley Warford · 2002
Chapter 6 introduces the concept of an abstract data structure (ADS) and an abstract data type (ADT). It illustrates each of these abstractions with stacks and lists. An ADT differs from an ADS because the server module exports a type. The client module is then able to declare its own variable with that type and can have as many data structures as it needs. The data structures exist in the client module. For example, the module of Figure 7.10 declares two stacks, stackA and stackB. Because an ADS does not export a type, there is only one data structure and it is hidden in the server module. For example, the module of Figure 17.4 does not contain any stack variables. It simply manipulates the one stack contained in PboxStackADS.KeywordsServer ModuleAbstract Data TypeCONST CapacityAssert StatementClient ModuleThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Cited by 0
Allen Parrish, David Cordes · International Journal of Software Engineering and Knowledge Engineering · 1994
Abstract data types (ADTs) represent the fundamental building blocks of object-oriented software development. There have been a variety of techniques in the literature for testing ADT modules. Virtually all of the proposed techniques have involved testing sequences of ADT operations (e.g., for a stack ADT, test the sequence PUSH; PUSH; POP) to discover defects in their interactions. However, the operations inside an ADT module are really nothing more than conventional procedures and functions. Consequently, it is conceivable that conventional subprogram unit testing techniques can be adapted to test ADT operations. To support such testing techniques, test cases are best designed and expressed in terms of data values. When test cases are integers, for example, expressing a test case is trivial (e.g., ‘253’). However, when test cases are data abstractions (such as stacks), this problem is much more difficult due to the variety of different formats in which a single data abstraction can be legitimately viewed. In this paper, we provide a conceptual framework for applying classical white-box and black-box unit testing techniques to ADT operations. We then use this framework to develop a collection of guidelines for determining the best format for test case design, given different module characteristics and testing techniques.
Cited by 3
Matthew A. Hammer, Georg Neis, Yan Chen et al. · ACM SIGPLAN Notices · 2011
Self-adjusting computation offers a language-based approach to writing programs that automatically respond to dynamically changing data. Recent work made significant progress in developing sound semantics and associated implementations of self-adjusting computation for high-level, functional languages. These techniques, however, do not address issues that arise for low-level languages, i.e., stack-based imperative languages that lack strong type systems and automatic memory management. In this paper, we describe techniques for self-adjusting computation which are suitable for low-level languages. Necessarily, we take a different approach than previous work: instead of starting with a high-level language with additional primitives to support self-adjusting computation, we start with a low-level intermediate language, whose semantics is given by a stack-based abstract machine. We prove that this semantics is sound: it always updates computations in a way that is consistent with full reevaluation. We give a compiler and runtime system for the intermediate language used by our abstract machine. We present an empirical evaluation that shows that our approach is efficient in practice, and performs favorably compared to prior proposals.
Cited by 1
Moss,John Eliot Blakeslee · DSpace@MIT (Massachusetts Institute of Technology) · 1978
Abstract data types are the basis of an emerging methodology of computer programming. The only existing languages supporting abstract data types directly, CLU and Simula, both require compacting garbage collection, and thus they are not suitable for many applications. This thesis presents the design of a new language incorporating abstract data types; the language requires only a run-time stack, and not garbage collection. This new language, called ASBAL(for 'A Stack Based Abstraction Language'), is based on CLU, and borrows as many features as possible directly from it. Virtually every significant feature of CLU is carried over into ASBAL in some form, and extensions are included when necessary. For example, the maximum size of objects becomes an issue and is resolved by the addition of size parameters to types. Also, a limited facility for dynamic storage allocation is incorporated in ASBAL to compensate for the removal of a garbage collected heap. This facility allows list and graph structures to be built within the framework of the stack while preventing dangling references as a 'side-effect' of compile-time type checking. (Author)
Cited by 1Open access
D. R. Judson, Jianmin Lin, Philip S. Schultz et al. · Geophysics · 1980
Abstract The conventional methods for migrating a seismic section, e.g., the finite-difference method and the Kirchhoff summation method, are inadequate in the presence of significant lateral variations in velocity. For this type of velocity distribution, the basic migration output should be in true depth, although for practical purposes it may be preferable to display it with a nonlinear depth scale.A finite-difference method has been implemented for obtaining migrated depth sections. The concept underlying this involves all the usual assumptions of a dip line and primary reflections only, with the seismic section considered as the surface measurement of an upcoming wa ve field which we process with downward continuation in small increments of depth, rather than the customary increments of traveltime. The specified velocity variation laterally along a thin layer results in transmission time changes which must be corrected by a small static time shift applied to each seismic trace. This additional operation within the migration algorithm can be difficult and expensive to implement and is the main reason for its prior omission.Results are given of depth migration applications to both synthetic and real seismic data.
Cited by 29
Junbeom Lee, T. R. Lalk · Dynamic Systems and Control · 1996
Abstract A technique for modeling a fuel cell stack is presented. The technique was specifically designed so that the models developed using it could be used to determine the fundamental thermal-physical behavior of a fuel cell stack for any operating and design configuration. Such models would be useful tools for investigating fuel cell power system parameters. The modeling technique can to be applied to any type of fuel cell stack for which performance data is available for a laboratory scale single cell. Use of the technique is demonstrated by generating sample results for a model of a Proton Exchange Membrane Fuel Cell (PEMFC) stack consisting of 125 cells each with an active area of 150 cm2. A PEMFC stack was chosen to demonstrate the technique because many researchers believe it is the type of fuel cell best suited for transportation applications.
Cited by 6
qqzgyktt · Zenodo (CERN European Organization for Nuclear Research) · 2024
<pre><code>\n<p><strong>stack questions and answers pdf</strong><br></p>\n<p>Rating: 4.6 / 5 (4109 votes)<br></p>\n<p>Downloads: 33222<br><br></p>\n <p>= = = = = \n<strong><a href="https://tds11111.com/21Nr9y?keyword=stack questions and answers pdf" target="_blank">CLICK HERE TO DOWNLOAD</a></strong>\n = = = = = <br><br></p>\n<p><br><br><br><br></p>\n<p><br><br><br><br></p>\n<p><br><br>Stacks Questions and e download as PDF File.pdf), Text File.txt) or read online for free • (value): Add an element onto the top of the stack (): Remove an element from the top of the stack and return it (): Look at the element from the top of the stack, but don't remove it y(): Returns a boolean value, true if the stack is empty, false if it has at least one element Letters are pushed on a stack in order: R E A S O N. Specify where to insert pop operations (shown by '*') among the pushes of the given letters, in order to produce the output: O S E R A N Therefore, once Missing: pdf pattern, anchored this stack. There are multiple solutions to this problem, but for this lecture we will be content to work with stacks that have a limited maximum capacityStructs and data structure invariants Hard Interview Questions on Stack Data Structure. Stack is a data structure that provides temporary storage of data in such a way that the element stored last will be retrieved first. Check if the given permutation is valid stack permutation or not. TOP(S) – returns , · A stack is a linear Last-In-Last-Out (LIFO) data structure which means that the last element added to the stack will be the first one to be removed. Give some real-life examples. This method is also called LIFO – Last In First Out. In real life we can think of stack as a stack of copies, stack of plates, stack of A stack is an Abstract Data Type (ADT), commonly used in most programming languages. Design a stack that supports getMin () in O (1) time and O (1) extra space. Check if two expressions with brackets STACKS VIVA QUESTIONSWhat is a stack? The class definitions for stack and queue are provided at the end of the CREATE(S) – Creates S as an empty stack. A real-world stack allows operations at one end only. Design a data structure that supports insert (), delete (), getRandom () and getMin () in O (1) time complexity. For example, we can place or remove a card or plate from the top of the stack only Stacks Questions and AnswersSanfoundry PDF PDF Bracket Algorithms And Data Structures. It is named stack as it behaves like a real-world stack, for example – a k of cards or a pile of plates, etc. MongoDB, a very popular NoSQL database, was used for persistent data storage., a server-side JavaScript runtime environment, and MERN stands for MongoDB, Express, React, Node, after the four key technologies that make up the stack. Give some real-life examples. POP(S) – Deletes the top most elements from the stack. It is named stack as it behaves like a real-world stack, for example – a k • (value): Add an element onto the top of the stack (): Remove an element from the top of the stack and return it (): Look at the element from 1 CMSC Data Structures Stack and Queue Review These are some review questions on stacks. PUSH(S,X) – Adds the element X to the top of the stack. Design a stack that supports getMin () in Stacks Questions and e download as PDF File.pdf), Text File.txt) or read online for free Stack A stack is an Abstract Data Type (ADT), commonly used in most programming languages. STACKS VIVA QUESTIONSWhat is a stack? Stack is a data structure that provides temporary storage of data in such a way that the element , · Hard Interview Questions on Stack Data Structure. Check if the given permutation is valid stack permutation or not. MERN is one of several variations of the MEAN stack (MongoDB Missing: pdfstack can't contain more thanelements, like a pile of books on our desk that cannot grow too high lest it reach the ceiling or fall over.</p></code></pre>
Cited by 0Open access
Wibowo, Andrianus Setya · Unika Repositor (Unika) · 2011
In computer science, calculator is electronic device that works as a tool to \nperform mathematical calculations. In making the calculations, this device uses \nan electric current as the basic process. And a stack is a Last In, First Out (LIFO) \nabstract data type and data structure. A stack can have any abstract data type as \nan element, but is characterized by only two fundamental operations: push and \npop. The push operation adds an item to the top of the stack, hiding any items \nalready on the stack, or initializing the stack if it is empty. The pop operation \nremoves an item from the top of the stack, and returns this value to the caller. A \npop either reveals previously concealed items, or results in an empty stack. \nApplication of stack in this program is as place for saved of operator \nwhen program make a change infix notation to postfix notation, besides also \ndepositor of number when program do enumeration. This matter because of in \nthis program use one stack but having two different variable, that is integer and \ncharacter, and by using nature of from stack that is LIFO and two operation of \nstack that is push and pop. With stack as data struct, this program can count \nmathematics operation which use 4 operator: +, -, *, /, and also can change infix \nexpression to postfix expression. In certain case also can count mathematics \noperation using parenthesis.
Cited by 0Open access
Vern Solberg, Ignacio Osorio, Jeffrey Demmin · SMTA International · 2003
ABSTRACT The new generations of dynamic random access memory (DRAM) and synchronous dynamic random access memory (SDRAM) technologies are contributing significantly toward increased system performance. Improvement in processing speed, however, can be hampered by inefficiency in both package performance and module-level interconnect. Furthermore, these high performance memory die have been designed with center bond pads rather than the peripheral bond format more common in earlier applications. The change in die layout, although challenging for traditional lead-frame package technology, has proved ideal for array packaging. The array format package with the die facing down furnishes a much shorter circuit path than lead-frame packaged die, minimizing the signal path between die and the printed circuit board (PCB) structure. For this reason, the developers of Rambus DRAM (RDRAM) and dual data rate (DDR) DRAM have found that array type packages enable optimized memory performance. To enable higher density memory, Tessera has developed a package stacking process the company has defined the “μZ™ Ball-Stack” package. The package technology is targeted for a variety of memory as well as multiple-function applications, however, to be widely adopted the ball-stack methodology must be subjected to extensive qualification and reliability testing.
Cited by 0
Sannella, Don, Campbell, Brian · OpenGrey (Institut de l'Information Scientifique et Technique) · 2008
Controlling resource usage is important for the reliability, efficiency and security of software systems. Automated analyses for bounding resource usage can be invaluable tools for ensuring these properties. Hofmann and Jost have developed an automated static analysis for finding linear heap space bounds in terms of the input size for programs in a simple functional programming language. Memory requirements are amortized by representing them as a requirement for an abstract quantity, potential, which is supplied by assigning potential to data structures in proportion to their size. This assignment is represented by annotations on their types. The type system then ensures that all potential requirements can be met from the original input’s potential if a set of linear constraints can be solved. Linear programming can optimise this amount of potential subject to the constraints, yielding a upper bound on the memory requirements. However, obtaining bounds on the heap space requirements does not detect a faulty or malicious program which uses excessive stack space. In this thesis, we investigate extending Hofmann and Jost’s techniques to infer bounds on stack space usage, first by examining two approaches: using the Hofmann- Jost analysis unchanged by applying a CPS transformation to the program being analysed, then showing that this predicts the stack space requirements of the original program; and directly adapting the analysis itself, which we will show is more practical. We then consider how to deal with the different allocation patterns stack space usage presents. In particular, the temporary nature of stack allocation leads us to a system where we calculate the total potential after evaluating an expression in terms of assignments of potential to the variables appearing in the expression as well as the result. We also show that this analysis subsumes our previous systems, and improves upon them. We further increase the precision of the bounds inferred by noting the importance of expressing stack memory bounds in terms of the depth of data structures and by taking the maximum of the usage bounds of subexpressions. We develop an analysis which uses richer definitions of the potential calculation to allow depth and maxima to be used, albeit with a more subtle inference process.
Cited by 0Open access
G. Reggio, D. Bertello, A. Morgavi · 1995
data types MSET MSET MSET MSET MSET MSET MSET MSET MSET MSET Is In nat set Is In OKnat nat OKnat set nat Succ(n) n ; n; s s n n nat s set ; n n nat OKset ; OKset s s set n; s s n TRUE FALSE TRUE FALSE TRUE FALSE TRUE FALSE TRUE FALSE TRUE FALSE abstract definition isomorphic abstract data type 11 : ( ) = if ( ) = 0, = # and = # , otherwise : ( ) = if = # , otherwise : ( ) = if = # , otherwise The definition of the data type stack given in Sect. 1.1, the algebra STACK, corresponds to the our intuition but it is concrete in the sense that we have chosen a particular model of the stacks. In the algebra STACK the stacks are realized concretely as streams, but we can also imagine another algebra STACK defined analogously to STACK, where the stacks are sets of pairs ( ), position of in the stacks; also the carrier of the sort may be the naturals as either binary, decimal or hexadecimal streams. Now we want to give an of the same data type so that several different models may be all cons...
Cited by 0
2008
Abstract The original WAM specializes abstract machine code and term representation for lists, squeezes theenvironment stack and choice point stack into one memory area and offers support for only one atomic data type. Most Prolog systems follow the list specialization, but the control stacks are often separatedand also more data types are supported at the implementation level than in the WAM. We show within hProlog the performance effect of the list specialization and the control stack choice. We also introducein hProlog four extra basic types and show how it was done without performance loss.
Cited by 0
Khalid Aloufi · International Journal of Communication Networks and Information Security (IJCNIS) · 2022
Abstract: Different protocols have been developed for the Internet of things (IoT), such as the constrained application protocol (CoAP) for the application layer of the IPv6 over low-power wireless personal area networks (6LoWPAN) stack model. Data transmitted over 6LoWPAN are limited by the throughput and the frame size defined by IEEE 805.14.5 standards. Choosing the best configuration for data transmission involves a trade off between the application requirements, the constrained network configuration, the constrained device specifications and IoT application protocols. This paper provides an analysis of message size and structure recommendations for the 6LoWPAN stack model for different network topologies using CoAP. CoAP is a promising application protocol for the 6LoWPAN stack model because it can effectively manage the transmission required functionality in small header UDP packets compared to TCP packets. However, a data model is also required to realize an effective IoT model. While fragmentation and reassembly are supported by CoAP, they should be avoided for this type of model. As for any conceptual model, a high configuration between layers is mandatory. Additionally, the proposed message format is useful for semantic web of things application development and for WSN design and management.
Cited by 4Open access
Daniel Bøgh Drasbæk, Peter Blennow, Thomas Heiredal‐Clausen et al. · Fuel Cells · 2023
Abstract In this work, we present a case where electrochemical impedance spectroscopy (EIS) on stack level enabled the identification of degradation and failure mechanisms in a 75‐cell solid oxide electrolysis cell (SOEC) stack from Topsoe. In a blind test, a defective stack (stack not passing the quality control specifications) prone to degradation was investigated with EIS. The type of stack defects was not known a priori. The purpose of the stack EIS experiment was hence to serve as a proof‐of‐concept of using EIS on the stack level for identifying degradation mechanisms. An appropriate equivalent circuit model was applied and fitted to the experimentally obtained EIS data, which enabled the quantification of the different electrochemical contributions. We hereby identified which electrochemical contribution(s) to the overall stack resistance caused the stack to degrade. Furthermore, the data was plotted in a degradation space format, which further strengthened the identification of the cause of degradation. In this work, we are exploring and utilizing the potential of advanced EIS characterization and analysis; thereby successfully identifying some of the degradation and failure mechanisms taking place in the SOEC stack. This detailed type of degradation analysis has, to the best of my knowledge, not previously reported on the commercial stack level.
Cited by 6Open access
Kalyb Prince · Zenodo (CERN European Organization for Nuclear Research) · 2026
Title: TR-001 Native Operating System: A Full-Stack Architectural Overview of Laminar Governance Date: January 22, 2026 Author: Kalyb Prince Resource Type: Report / Whitepaper Abstract: This report introduces the conceptual framework for the TR-001 Native Operating System, the first computational architecture derived from unitless geometric constants. By shifting from legacy "Decoherence Management" to a model of Laminar Governance, TR-001 achieves unparalleled efficiency and system stability. The architecture utilizes a 1.11 Nucleation Kernel to seat data at the 1.12 Floor, bounded by a 1.13 Physical Safety Ceiling to prevent thermal runaway. The document details the 1.81 Equilibrium Shell for real-time density visualization, the TR-001 Network Protocol (TRP) for non-turbulent data transfer, and a security model where integrity is a mathematical property of the geometric signature. This overview serves as the foundational map for implementing TR-001 logic across the full hardware-software stack. To Access The Framework, or Get Involved, please visit the official repository: Github. Current Status: Version 2.0 - Hardened. Peer-validation of the 12th-link collapse is currently underway.
Cited by 0Open access
Kalyb Prince · Zenodo (CERN European Organization for Nuclear Research) · 2026
Title: TR-001 Native Operating System: A Full-Stack Architectural Overview of Laminar Governance Date: January 22, 2026 Author: Kalyb Prince Resource Type: Report / Whitepaper Abstract: This report introduces the conceptual framework for the TR-001 Native Operating System, the first computational architecture derived from unitless geometric constants. By shifting from legacy "Decoherence Management" to a model of Laminar Governance, TR-001 achieves unparalleled efficiency and system stability. The architecture utilizes a 1.11 Nucleation Kernel to seat data at the 1.12 Floor, bounded by a 1.13 Physical Safety Ceiling to prevent thermal runaway. The document details the 1.81 Equilibrium Shell for real-time density visualization, the TR-001 Network Protocol (TRP) for non-turbulent data transfer, and a security model where integrity is a mathematical property of the geometric signature. This overview serves as the foundational map for implementing TR-001 logic across the full hardware-software stack. To Access The Framework, or Get Involved, please visit the official repository: Github. Current Status: Version 2.0 - Hardened. Peer-validation of the 12th-link collapse is currently underway.
Cited by 0Open access
Kalyb Prince · Zenodo (CERN European Organization for Nuclear Research) · 2026
Title: TR-001 Native Operating System: A Full-Stack Architectural Overview of Laminar Governance Date: January 22, 2026 Author: Kalyb Prince Resource Type: Report / Whitepaper Abstract: This report introduces the conceptual framework for the TR-001 Native Operating System, the first computational architecture derived from unitless geometric constants. By shifting from legacy "Decoherence Management" to a model of Laminar Governance, TR-001 achieves unparalleled efficiency and system stability. The architecture utilizes a 1.11 Nucleation Kernel to seat data at the 1.12 Floor, bounded by a 1.13 Physical Safety Ceiling to prevent thermal runaway. The document details the 1.81 Equilibrium Shell for real-time density visualization, the TR-001 Network Protocol (TRP) for non-turbulent data transfer, and a security model where integrity is a mathematical property of the geometric signature. This overview serves as the foundational map for implementing TR-001 logic across the full hardware-software stack. To Access The Framework, or Get Involved, please visit the official repository: Github. Current Status: Version 2.0 - Hardened. Peer-validation of the 12th-link collapse is currently underway.
Cited by 0Open access
P. Thore, Eric de Bazelaire, Marisha P. Rays · Geophysics · 1994
Abstract We compare the three-term equation to the normal moveout (NMO) equation for several synthetic data sets to analyze whether or not it is worth making the additional computational effort in the stacking process within various exploration contexts. In our evaluation we have selected two criteria:1) The quality of the stacked image.2) The reliability of the stacking parameters and their usefulness for further computation such as interval velocity estimation.We have simulated the stacking process very precisely, despite using only the traveltimes and not the full waveform data. The procedure searches for maximum coherency along the traveltime curve rather than a least-square regression to it. This technique, which we call the Gaussian-weighted least square, avoids most of the shortcomings of the least-square method.The following are our conclusions:1) The three term equation gives a better stack than the regular NMO. The increase in stacking energy can be more than 30 percent.2) The calculation of interval velocities using a DIX formula rewritten for the three-parameter equation is much more stable and accurate than the standard DIX formula.3) The search for the three parameters is feasible in an efficient way since the shifted hyperbola requires only static corrections rather than dynamic ones.4) Noise alters the parameters of the maximum energy stack in a way that depends on the noise type. The estimates obtained remain accurate enough for interval velocity estimation (where only two parameters are needed), but the use of the three parameters in direct inversion may be hazardous because of noise corruption.These conclusions should, however, be verified on real data examples.
Cited by 21
Ziqiang Pan, Baoping Qiao, Weichuan Huang · Journal of Physics Conference Series · 2024
Abstract Seismic exploration technique has been widely used in sandstone-type uranium exploration in recent years. Aiming to the demands of sandstone type uranium prospecting in Erlian Basin, seismic geometry parameters are designed, and excitation parameters of high-precision vibrator are proved by field test. High quality raw seismic data are obtained. According to characteristics of vibrator seismic data, crucial data processing method and techniques are researched. The main processing techniques include tomographic static correction, pre-stack combination de-noising in different domain, surface consistent prediction deconvolution, surface consistent amplitude compensation, velocity analysis and residual static correction. The reasonable stack velocity model is established, and the stack section which has high signal-to-noise ratio is obtained. the stack velocity model is built as initial migration velocity model. After multiple iteration of migration velocity analysis and pre-stack Kirchhoff time migration, the underground target geological structure is reasonable imaged, and the true subsurface stratum distributing feature is obtained. Finally, the reasonable vibrator seismic data acquisition and processing techniques are built. The ultimate seismic section which has high resolution, clear wave group, reasonable stratum distribution feature is obtained, besides, the section provides reliable basis for subsequent seismic inversion, interpretation and favorable ore-forming sandstone prediction.
Cited by 1Open access