Einloggen

Thematische Bibliographien / Resource bounds analysis

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte

Auswahl der wissenschaftlichen Literatur zum Thema „Resource bounds analysis“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 17. Februar 2022

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Resource bounds analysis" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Resource bounds analysis"

1

Kahn, David M., und Jan Hoffmann. „Automatic amortized resource analysis with the Quantum physicist’s method“. Proceedings of the ACM on Programming Languages 5, ICFP (22.08.2021): 1–29. http://dx.doi.org/10.1145/3473581.

Der volle Inhalt der Quelle

Annotation:

We present a novel method for working with the physicist's method of amortized resource analysis, which we call the quantum physicist's method. These principles allow for more precise analyses of resources that are not monotonically consumed, like stack. This method takes its name from its two major features, worldviews and resource tunneling, which behave analogously to quantum superposition and quantum tunneling. We use the quantum physicist's method to extend the Automatic Amortized Resource Analysis (AARA) type system, enabling the derivation of resource bounds based on tree depth. In doing so, we also introduce remainder contexts, which aid bookkeeping in linear type systems. We then evaluate this new type system's performance by bounding stack use of functions in the Set module of OCaml's standard library. Compared to state-of-the-art implementations of AARA, our new system derives tighter bounds with only moderate overhead.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Navas, Jorge, Mario Méndez-Lojo und Manuel V. Hermenegildo. „User-Definable Resource Usage Bounds Analysis for Java Bytecode“. Electronic Notes in Theoretical Computer Science 253, Nr. 5 (Dezember 2009): 65–82. http://dx.doi.org/10.1016/j.entcs.2009.11.015.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

SERRANO, A., P. LOPEZ-GARCIA und M. V. HERMENEGILDO. „Resource Usage Analysis of Logic Programs via Abstract Interpretation Using Sized Types“. Theory and Practice of Logic Programming 14, Nr. 4-5 (Juli 2014): 739–54. http://dx.doi.org/10.1017/s147106841400057x.

Der volle Inhalt der Quelle

Annotation:

AbstractWe present a novel general resource analysis for logic programs based on sized types. Sized types are representations that incorporate structural (shape) information and allow expressing both lower and upper bounds on the size of a set of terms and their subterms at any position and depth. They also allow relating the sizes of terms and subterms occurring at different argument positions in logic predicates. Using these sized types, the resource analysis can infer both lower and upper bounds on the resources used by all the procedures in a program as functions on input term (and subterm) sizes, overcoming limitations of existing resource analyses and enhancing their precision. Our new resource analysis has been developed within the abstract interpretation framework, as an extension of the sized types abstract domain, and has been integrated into the Ciao preprocessor, CiaoPP. The abstract domain operations are integrated with the setting up and solving of recurrence equations for inferring both size and resource usage functions. We show that the analysis is an improvement over the previous resource analysis present in CiaoPP and compares well in power to state of the art systems.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

ALBERT, ELVIRA, MIQUEL BOFILL, CRISTINA BORRALLERAS, ENRIQUE MARTIN-MARTIN und ALBERT RUBIO. „Resource Analysis driven by (Conditional) Termination Proofs“. Theory and Practice of Logic Programming 19, Nr. 5-6 (September 2019): 722–39. http://dx.doi.org/10.1017/s1471068419000152.

Der volle Inhalt der Quelle

Annotation:

AbstractWhen programs feature a complex control flow, existing techniques for resource analysis produce cost relation systems (CRS) whose cost functions retain the complex flow of the program and, consequently, might not be solvable into closed-form upper bounds. This paper presents a novel approach to resource analysis that is driven by the result of a termination analysis. The fundamental idea is that the termination proof encapsulates the flows of the program which are relevant for the cost computation so that, by driving the generation of the CRS using the termination proof, we produce a linearly-bounded CRS (LB-CRS). A LB-CRS is composed of cost functions that are guaranteed to be locally bounded by linear ranking functions and thus greatly simplify the process of CRS solving. We have built a new resource analysis tool, named MaxCore, that is guided by the VeryMax termination analyzer and uses CoFloCo and PUBS as CRS solvers. Our experimental results on the set of benchmarks from the Complexity and Termination Competition 2019 for C Integer programs show that MaxCore outperforms all other resource analysis tools.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Wu, Zeyang, Kameng Nip und Qie He. „A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints“. INFORMS Journal on Computing 33, Nr. 3 (Juli 2021): 1197–212. http://dx.doi.org/10.1287/ijoc.2020.1006.

Der volle Inhalt der Quelle

Annotation:

The separable convex resource allocation problem with nested bound constraints aims to allocate B units of resources to n activities to minimize a separable convex cost function, with lower and upper bounds on the total amount of resources that can be consumed by nested subsets of activities. We develop a new combinatorial algorithm to solve this model exactly. Our algorithm is capable of solving instances with millions of activities in several minutes. The running time of our algorithm is at most 73% of the running time of the current best algorithm for benchmark instances with three classes of convex objectives. The efficiency of our algorithm derives from a combination of constraint relaxation and divide and conquer based on infeasibility information. In particular, nested bound constraints are relaxed first; if the solution obtained violates some bound constraints, we show that the problem can be divided into two subproblems of the same structure and smaller sizes according to the bound constraint with the largest violation. Summary of Contribution. The resource allocation problem is a collection of optimization models with a wide range of applications in production planning, logistics, portfolio management, telecommunications, statistical surveys, and machine learning. This paper studies the resource allocation model with prescribed lower and upper bounds on the total amount of resources consumed by nested subsets of activities. These nested bound constraints are motivated by storage limits, time-window requirements, and budget constraints in various applications. The model also appears as a subproblem in models for green logistics and machine learning, and it has to be solved repeatedly. The model belongs to the class of computationally challenging convex mixed-integer nonlinear programs. We develop a combinatorial algorithm to solve this model exactly. Our algorithm is faster than the algorithm that currently has the best theoretical complexity in the literature on an extensive set of test instances. The efficiency of our algorithm derives from the combination of an infeasibility-guided divide-and-conquer framework and a scaling-based greedy subroutine for resource allocation with submodular constraints. This paper also showcases the prevalent mismatch between the theoretical worst-case time complexity of an algorithm and its practical efficiency. We have offered some explanations of this mismatch through the perspectives of worst-case analysis, specially designed instances, and statistical metrics of numerical experiments. The implementation of our algorithm is available on an online repository.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Stefanov, Stefan M. „Solution of some convex separable resource allocation and production planning problems with bounds on the variables“. Journal of Interdisciplinary Mathematics 13, Nr. 5 (Oktober 2010): 541–69. http://dx.doi.org/10.1080/09720502.2010.10700719.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Albert, Elvira, Nikolaos Bezirgiannis, Frank de Boer und Enrique Martin-Martin. „A Formal, Resource Consumption-Preserving Translation from Actors with Cooperative Scheduling to Haskell*“. Fundamenta Informaticae 177, Nr. 3-4 (10.12.2020): 203–34. http://dx.doi.org/10.3233/fi-2020-1988.

Der volle Inhalt der Quelle

Annotation:

We present a formal translation of a resource-aware extension of the Abstract Behavioral Specification (ABS) language to the functional language Haskell. ABS is an actor-based language tailored to the modeling of distributed systems. It combines asynchronous method calls with a suspend and resume mode of execution of the method invocations. To cater for the resulting cooperative scheduling of the method invocations of an actor, the translation exploits for the compilation of ABS methods Haskell functions with continuations. The main result of this article is a correctness proof of the translation by means of a simulation relation between a formal semantics of the source language and a high-level operational semantics of the target language, i.e., a subset of Haskell. We further prove that the resource consumption of an ABS program extended with a cost model is preserved over this translation, as we establish an equivalence of the cost of executing the ABS program and its corresponding Haskell-translation. Concretely, the resources consumed by the original ABS program and those consumed by the Haskell program are the same, considering a cost model. Consequently, the resource bounds automatically inferred for ABS programs extended with a cost model, using resource analysis tools, are sound resource bounds also for the translated Haskell programs. Our experimental evaluation confirms the resource preservation over a set of benchmarks featuring different asymptotic costs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Yoon, Man-Ki, Chang-Gun Lee und Junghee Han. „Migrating from Per-Job Analysis to Per-Resource Analysis for Tighter Bounds of End-to-End Response Times“. IEEE Transactions on Computers 59, Nr. 7 (Juli 2010): 933–42. http://dx.doi.org/10.1109/tc.2009.174.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Sajid, Mohammad, und Zahid Raza. „An Analytical Model for Resource Characterization and Parameter Estimation for DAG-Based Jobs for Homogeneous Systems“. International Journal of Distributed Systems and Technologies 6, Nr. 1 (Januar 2015): 34–52. http://dx.doi.org/10.4018/ijdst.2015010103.

Der volle Inhalt der Quelle

Annotation:

High Performance Computing (HPC) systems demand and consume a significant amount of resources (e.g. server, storage, electrical energy) resulting in high operational costs, reduced reliability, and sometimes leading to waste of scarce natural resources. On one hand, the most important issue for these systems is achieving high performance, while on the other hand, the rapidly increasing resource costs appeal to effectively predict the resource requirements to ensure efficient services in the most optimized manner. The resource requirement prediction for a job thus becomes important for both the service providers as well as the consumers for ensuring resource management and to negotiate Service Level Agreements (SLAs), respectively, in order to help make better job allocation decisions. Moreover, the resource requirement prediction can even lead to improved scheduling performance while reducing the resource waste. This work presents an analytical model estimating the required resources for the modular job execution. The analysis identifies the number of processors required and the maximum and minimum bounds on the turnaround time and energy consumed. Simulation study reveals that the scheduling algorithms integrated with the proposed analytical model helps in improving the average throughput and the average energy consumption of the system. As the work predicts the resource requirements, it can even play an important role in Service-Oriented Architectures (SOA) like Cloud computing or Grid computing.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Picano, Benedetta. „End-to-End Delay Bound for VR Services in 6G Terahertz Networks with Heterogeneous Traffic and Different Scheduling Policies“. Mathematics 9, Nr. 14 (12.07.2021): 1638. http://dx.doi.org/10.3390/math9141638.

Der volle Inhalt der Quelle

Annotation:

The emerging sixth-generation networks have to provide effective support to a wide plethora of novel disruptive heterogeneous applications. This paper models the probabilistic end-to-end delay bound for the virtual reality services in the presence of heterogeneous traffic flows by resorting to the stochastic network calculus principles and exploiting the martingale envelopes. The paper presents the network performance analysis under the assumption of different scheduling policies, considering both the earliest deadline first and the first-in-first-out queue discipline. Furthermore, differently from previous literature, the probabilistic per-flow bounds have been formulated taking into account a number of traffic flows greater than two, which results in a theoretical analysis that is remarkably more complex than the case in which only two concurrent flows are considered. Finally, the validity of the theoretical bounds have been confirmed by the evident closeness between the analytical predictions and the actual simulation results considering, for the sake of argument, four concurrent traffic flows with heterogeneous quality-of-service constraints. That closeness exhibits the ability of the proposed analysis in fitting the actual behavior of the system, representing a suitable theoretical tool to support resource allocation strategies, without violating service constraints.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Resource bounds analysis"

1

Hoffmann, Jan. „Types with potential: polynomial resource bounds via automatic amortized analysis“. Diss., lmu, 2011. http://nbn-resolving.de/urn:nbn:de:bvb:19-139552.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Franzen, Daniel. „Quantitative bounds on the security-critical resource consumption of JavaScript apps“. Thesis, University of Edinburgh, 2016. http://hdl.handle.net/1842/22060.

Der volle Inhalt der Quelle

Annotation:

Current resource policies for mobile phone apps are based on permissions that unconditionally grant or deny access to a resource like private data, sensors and services. In reality, the legitimacy of an access may be context-dependent - for example, depending on how often a resource is accessed and in which situation. This thesis presents research into providing bounds on the access of JavaScript apps to security and privacy-relevant resources on mobile devices. The investigated bounds are quantitative and interaction-dependent: for example, permitting one access each time the user presses a specified button. Two novel systems are presented with different approaches to providing these bounds. The system PhoneWrap injects a quantitative policy into an app and enforces the bound dynamically during runtime by monitoring the resource consumption and the user interaction. If the injected bound is exceeded, the resource request is replaced by a deny action. This way, PhoneWrap restricts the unwanted behaviour while the expected functionality can be performed. Policies for this system describe the UI elements which trigger the expected resource consumption and the number of resource units consumed for each interaction. The enforcement of the policies is achieved via wrapping the critical APIs using JavaScript internal features. The injection of a policy can be performed automatically. PhoneWrap is the first system using the lightweight wrapping method to inject policies directly into mobile apps and the first to combine quantitative policies with interaction-dependencies. The second system AmorJiSe statically analyses the resource consumption of a given JavaScript program. This system automatically infers amortised annotations on top of given JavaScript data types. The amortised annotations symbolise reserved resource units stored in the data structures. This way the amount of resource units available to the app is expressed dependent on the size of the data structures. The resulting function types of the UI handlers can be used to extract interaction-dependent bounds. The correctness of these bounds is proven in relation to a resource-aware operational semantics. AmorJiSe extends the known amortised type paradigm to JavaScript with its dynamic object structures and applies this paradigm to the novel domain of mobile resources. Although, the two systems are based on similar resource models and produce similar resource bounds, they use different methods with different properties which are presented in this dissertation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Hoffmann, Jan [Verfasser], und Martin [Akademischer Betreuer] Hofmann. „Types with potential : polynomial resource bounds via automatic amortized analysis / Jan Hoffmann. Betreuer: Martin Hofmann“. München : Universitätsbibliothek der Ludwig-Maximilians-Universität, 2011. http://d-nb.info/1020143665/34.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Pourranjbar, Alireza. „Performance analysis of large-scale resource-bound computer systems“. Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/10567.

Der volle Inhalt der Quelle

Annotation:

We present an analysis framework for performance evaluation of large-scale resource-bound (LSRB) computer systems. LSRB systems are those whose resources are continually in demand to serve resource users, who appear in large populations and cause high contention. In these systems, the delivery of quality service is crucial, even in the event of resource failure. Therefore, various techniques have been developed for evaluating their performance. In this thesis, we focus on the technique of quantitative modelling, where in order to study a system, first its model is constructed and then the system’s behaviour is analysed via the model. A number of high level formalisms have been developed to aid the task of model construction. We focus on PEPA, a stochastic process algebra that supports compositionality and enables us to easily build complex LSRB models. In spite of this advantage, however, the task of analysing LSRB models still poses unresolved challenges. LSRB models give rise to very large state spaces. This issue, known as the state space explosion problem, renders the techniques based on discrete state representation, such as numerical Markovian analysis, computationally expensive. Moreover, simulation techniques, such as Gillespie’s stochastic simulation algorithm, are also computationally demanding, as numerous trajectories need to be collected. Furthermore, as we show in our first contribution, the techniques based on the mean-field theory or fluid flow approximation are not readily applicable to this case. In LSRB models, resources are not assumed to be present in large populations and models exhibit highly noisy and stochastic behaviour. Thus, the mean-field deterministic behaviour might not be faithful in capturing the system’s randomness and is potentially too crude to show important aspects of their behaviours. In this case, the modeller is unable to obtain important performance indicators, such as the reliability measures of the system. Considering these limitations, we contribute the following analytical methods particularly tailored to LSRB models. First, we present an aggregation method. The aggregated model captures the evolution of only the system’s resources and allows us to efficiently derive a probability distribution over the configurations they experience. This distribution provides full faithfulness for studying the stochastic behaviour of resources. The aggregation can be applied to all LSRB models that satisfy a syntactic aggregation condition, which can be quickly checked syntactically. We present an algorithm to generate the aggregated model from the original model when this condition is satisfied. Second, we present a procedure to efficiently detect time-scale near-complete decomposability (TSND). The method of TSND allows us to analyse LSRB models at a reduced cost, by dividing their state spaces into loosely coupled blocks. However, one important input is a partition of the transitions defined in the model, categorising them into slow or fast. Forming the necessary partition by the analysis of the model’s complete state space is costly. Our process derives this partition efficiently, by relying on a theorem stating that our aggregation preserves the original model’s partition and therefore, it can be derived by an efficient reachability analysis on the aggregated state space. We also propose a clustering algorithm to implement this reachability analysis. Third, we present the method of conditional moments (MCM) to be used on LSRB models. Using our aggregation, a probability distribution is formed over the configurations of a model’s resources. The MCM outputs the time evolution of the conditional moments of the marginal distribution over resource users given the configurations of resources. Essentially, for each such configuration, we derive measures such as conditional expectation, conditional variance, etc. related to the dynamics of users. This method has a high degree of faithfulness and allows us to capture the impact of the randomness of the behaviour of resources on the users. Finally, we present the advantage of the methods we proposed in the context of a case study, which concerns the performance evaluation of a two-tier wireless network constructed based on the femto-cell macro-cell architecture.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Dankwah, Charles O. „Investigating an optimal decision point for probability bounds analysis models when used to estimate remedial soil volumes under uncertainty at hazardous waste sites“. ScholarWorks, 2010. https://scholarworks.waldenu.edu/dissertations/776.

Der volle Inhalt der Quelle

Annotation:

Hazardous waste site remediation cost estimation requires a good estimate of the contaminated soil volume. The United States Environmental Protection Agency (U.S. EPA) currently uses deterministic point values to estimate soil volumes but the literature suggests that probability bounds analysis (PBA) is the more accurate method to make estimates under uncertainty. The underlying statistical theory is that they are more accurate than deterministic estimates because probabilistic estimates account for data uncertainties. However, the literature does not address the problem of selecting an optimal decision point from the interval-valued PBA estimates. The purpose of this study was to identify the optimal PBA decision point estimator and use it to demonstrate that because the PBA method also accounts for data uncertainties, PBA estimates of remedial soil volumes are more accurate than the U.S. EPA deterministic estimates. The research questions focused on determining whether the mean or the 95th percentile decision point is the optimal PBA estimator. A convenience sample of seven sites was selected from the U.S. EPA Superfund Database. The PBA method was used to estimate the remedial soil volumes for the sites. Correlation analyses were performed between the mean and 95th percentile PBA estimates and the actual excavated soil volumes. The study results suggest that the lower bound 95th percentile PBA estimate, which had the best R2-value of 89%, is the optimal estimator. The R2-value for a similar correlation analysis using the U.S. EPA deterministic estimates was only 59%. This confirms that PBA is the better estimator. The PBA estimates are less contestable than the current U.S. EPA deterministic point estimates. Thus, the PBA method will reduce litigation and speed up cleanup activities to the benefit of the U.S. EPA, corporations, the health and safety of nearby residents, and society in general.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Landry, Richard S. Jr. „An Application of M-matrices to Preserve Bounded Positive Solutions to the Evolution Equations of Biofilm Models“. ScholarWorks@UNO, 2017. https://scholarworks.uno.edu/td/2418.

Der volle Inhalt der Quelle

Annotation:

In this work, we design a linear, two step implicit finite difference method to approximate the solutions of a biological system that describes the interaction between a microbial colony and a surrounding substrate. Three separate models are analyzed, all of which can be described as systems of partial differential equations (PDE)s with nonlinear diffusion and reaction, where the biological colony grows and decays based on the substrate bioavailability. The systems under investigation are all complex models describing the dynamics of biological films. In view of the difficulties to calculate analytical solutions of the models, we design here a numerical technique to consistently approximate the system evolution dynamics, guaranteeing that nonnegative initial conditions will evolve uniquely into new, nonnegative approximations. This property of our technique is established using the theory of M-matrices, which are nonsingular matrices where all the entries of their inverses are positive numbers. We provide numerical simulations to evince the preservation of the nonnegative character of solutions under homogeneous Dirichlet and Neumann boundary conditions. The computational results suggest that the method proposed in this work is stable, and that it also preserves the bounded character of the discrete solutions.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "Resource bounds analysis"

1

Machery, Edouard. Philosophy Within Its Proper Bounds. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198807520.001.0001.

Der volle Inhalt der Quelle

Annotation:

In Philosophy Within Its Proper Bounds, Edouard Machery argues that resolving many traditional and contemporary philosophical issues is beyond our epistemic reach and that philosophy should reorient itself toward more humble, but ultimately more important intellectual endeavors. Attempts to resolve such issues are modally immodest: Any resolution would require an epistemic access to metaphysical possibilities and necessities, which, Edouard Machery argues, we do not have. In effect, then, Philosophy Within Its Proper Bounds defends a form of modal skepticism. The book assesses the main philosophical method for acquiring the modal knowledge that the resolution of modally immodest philosophical issues turns on: the method of cases, that is, the consideration of actual or hypothetical situations (which cases or thought experiments describe) in order to determine what facts hold in these situations. Canvassing the extensive work done by experimental philosophers over the last fifteen years, Edouard Machery shows that the method of cases is unreliable and should be rejected. Importantly, the dismissal of modally immodest philosophical issues is no cause for despair: Many important philosophical issues remain within our epistemic reach. In particular, reorienting the course of philosophy would free time and resources for bringing back to prominence a once-central intellectual endeavor: conceptual analysis.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Appelt, Martin, Eric Damkjar und Max Friesen. Late Dorset. Herausgegeben von Max Friesen und Owen Mason. Oxford University Press, 2016. http://dx.doi.org/10.1093/oxfordhb/9780199766956.013.36.

Der volle Inhalt der Quelle

Annotation:

Late Dorset culture represents the final manifestation of the long-lived Paleoeskimo tradition in the eastern Arctic. Late Dorset occupied an enormous region from Victoria Island to Northern Labrador, and resettled the High Arctic, bringing them to Ellesmere Island and northwest Greenland. Alongside these expansions, long-distance exchange networks were further developed and intensified, perhaps bound together by the aggregation sites located at places with a particular high concentration of seasonally available subsistence resources. Late Dorset aggregation sites are particular visible due to their rows of stone-built hearths and/or “longhouses.” Late Dorset cosmology is visible in several aspects of architecture, as well as through analysis of the more than 1,200 miniature carvings of animals and humans that are known from the period.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Petersen-Perlman, Jacob D., Julie E. Watson und Aaron T. Wolf. Transboundary Unbound. Herausgegeben von Ken Conca und Erika Weinthal. Oxford University Press, 2017. http://dx.doi.org/10.1093/oxfordhb/9780199335084.013.19.

Der volle Inhalt der Quelle

Annotation:

This chapter calls for a new examination of the water conflict‒cooperation dialogue, beyond the traditional areas of water allocation and utilization. It calls for dialogue to incorporate two critical dimensions: (1) variability linked to climate change and the water-food-energy-environment nexus when framing parameters of water-related conflict; and (2) “unbounding” of analysis beyond political and geographical borders to include internal, regional, and global conflict and cooperation. It discusses three basins as case studies: the Nile, the Mekong, and the Aral Sea. It discusses how water conflicts are not bound to political or natural borders, or to disputes explicitly over water. Rather, it explores how resources intrinsically tied to water decisions may prompt conflict; yet, water may be a leverage point for peace, as well. It concludes by identifying relevant water-conflict transformation strategies that may be applied to use water as a nexus for peace-building.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Resource bounds analysis"

1

Kahn, David M., und Jan Hoffmann. „Exponential Automatic Amortized Resource Analysis“. In Lecture Notes in Computer Science, 359–80. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-45231-5_19.

Der volle Inhalt der Quelle

Annotation:

AbstractAutomatic amortized resource analysis (AARA) is a type-based technique for inferring concrete (non-asymptotic) bounds on a program’s resource usage. Existing work on AARA has focused on bounds that are polynomial in the sizes of the inputs. This paper presents and extension of AARA to exponential bounds that preserves the benefits of the technique, such as compositionality and efficient type inference based on linear constraint solving. A key idea is the use of the Stirling numbers of the second kind as the basis of potential functions, which play the same role as the binomial coefficients in polynomial AARA. To formalize the similarities with the existing analyses, the paper presents a general methodology for AARA that is instantiated to the polynomial version, the exponential version, and a combined system with potential functions that are formed by products of Stirling numbers and binomial coefficients. The soundness of exponential AARA is proved with respect to an operational cost semantics and the analysis of representative example programs demonstrates the effectiveness of the new analysis.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Hu, Qinheping, John Cyphert, Loris D’Antoni und Thomas Reps. „Synthesis with Asymptotic Resource Bounds“. In Computer Aided Verification, 783–807. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81685-8_37.

Der volle Inhalt der Quelle

Annotation:

AbstractWe present a method for synthesizing recursive functions that satisfy both a functional specification and an asymptotic resource bound. Prior methods for synthesis with a resource metric require the user to specify a concrete expression exactly describing resource usage, whereas our method uses big-O notation to specify the asymptotic resource usage. Our method can synthesize programs with complex resource bounds, such as a sort function that has complexity $$O(n\log (n))$$ O ( n log ( n ) ) .Our synthesis procedure uses a type system that is able to assign an asymptotic complexity to terms, and can track recurrence relations of functions. These typing rules are justified by theorems used in analysis of algorithms, such as the Master Theorem and the Akra-Bazzi method. We implemented our method as an extension of prior type-based synthesis work. Our tool, SynPlexity, was able to synthesize complex divide-and-conquer programs that cannot be synthesized by prior solvers.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Ish-Shalom, Oren, Shachar Itzhaky, Noam Rinetzky und Sharon Shoham. „Run-time Complexity Bounds Using Squeezers“. In Programming Languages and Systems, 320–47. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-72019-3_12.

Der volle Inhalt der Quelle

Annotation:

AbstractDetermining upper bounds on the time complexity of a program is a fundamental problem with a variety of applications, such as performance debugging, resource certification, and compile-time optimizations. Automated techniques for cost analysis excel at bounding the resource complexity of programs that use integer values and linear arithmetic. Unfortunately, they fall short when execution traces become more involved, esp. when data dependencies may affect the termination conditions of loops. In such cases, state-of-the-art analyzers have shown to produce loose bounds, or even no bound at all.We propose a novel technique that generalizes the common notion of recurrence relations based on ranking functions. Existing methods usually unfold one loop iteration, and examine the resulting relations between variables. These relations assist in establishing a recurrence that bounds the number of loop iterations. We propose a different approach, where we derive recurrences by comparing whole traces with whole traces of a lower rank, avoiding the need to analyze the complexity of intermediate states. We offer a set of global properties, defined with respect to whole traces, that facilitate such a comparison, and show that these properties can be checked efficiently using a handful of local conditions. To this end, we adapt state squeezers, an induction mechanism previously used for verifying safety properties. We demonstrate that this technique encompasses the reasoning power of bounded unfolding, and more. We present some seemingly innocuous, yet intricate, examples where previous tools based on cost relations and control flow analysis fail to solve, and that our squeezer-powered approach succeeds.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Benzmüller, Christoph, Marvin Schiller und Jörg Siekmann. „Resource-Bounded Modelling and Analysis of Human-Level Interactive Proofs“. In Resource-Adaptive Cognitive Processes, 291–311. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-540-89408-7_13.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Gerber, Richard, und Insup Lee. „Specification and analysis of resource-bound real-time systems“. In Real-Time: Theory in Practice, 371–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/bfb0032001.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Jost, Steffen, Hans-Wolfgang Loidl, Kevin Hammond, Norman Scaife und Martin Hofmann. „“Carbon Credits” for Resource-Bounded Computations Using Amortised Analysis“. In FM 2009: Formal Methods, 354–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-05089-3_23.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Chan, Wun-Tat, Prudence W. H. Wong und Fencol C. C. Yung. „On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis“. In Lecture Notes in Computer Science, 309–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11809678_33.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Saha, Ratul, Madhavan Mukund und R. P. Jagadeesh Chandra Bose. „Time-Bounded Statistical Analysis of Resource-Constrained Business Processes with Distributed Probabilistic Systems“. In Dependable Software Engineering: Theories, Tools, and Applications, 297–314. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-47677-3_19.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Clarke, Duncan, Hanêne Ben-Abdallah, Insup Lee, Hong Liang Xie und Oleg Sokolsky. „XVERSA: An integrated graphical and textual toolset for the specification and analysis of resource-bound real-time systems“. In Computer Aided Verification, 402–5. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61474-5_89.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Segre, Claudia, Serena Spagnolo, Valentina Gabella und Valentina Langella. „The Financial Wellbeing Index: “Donne al quadrato” and the relevant impact measurement“. In Proceedings e report, 77–82. Florence: Firenze University Press, 2021. http://dx.doi.org/10.36253/978-88-5518-304-8.16.

Der volle Inhalt der Quelle

Annotation:

How can we reduce economic violence? Can financial literacy and education enhance economic wellbeing? The present paper reports the results of a research conducted by ALTIS – Università Cattolica and Global Thinking Foundation for the evaluation of changes, improvements and consequences produced by the educational course in financial literacy ‘Donne al quadrato’, provided by the Foundation among the policies against economic violence implementation. In this study, impacts’ measurement refers to conceptual framework of financial wellbeing, a composite notion constructed of objective and subjective dimensions related to people’s financial behaviour. The expression ‘Financial Wellbeing’ highlights how economic issues are inextricably bound to individual and social wellness. Helping people enhancing their own financial wellbeing – in a broad sense – should then be the very first purpose of economic education activity. In the present research, financial wellbeing has been measured by the implementation of a synthetic index, based on studies of World Bank and University of Bristol. The index is intended to measure people’s self-sufficiency and independence about their financial situation, resources and capabilities. The indicator takes into account both micro and macro features, being the first ones specific of the sample analysed and latter territorial context variables employed for the removal of the macroeconomic changes affecting the entire population from the specific changes proceeding from the training. The trial, involving different Italian regions, has been fulfilled by the administration of a tailoredmade survey pre and post the “Donne al Quadrato” course, during academic year 2019/2020, in order to register the change occurred in the respondents’ perception of their knowledge, behaviour, personality and aptitudes. The results of the experimentation demonstrated that financial education could engender the modification not only of knowledge but also of awareness and proficiency in financial behaviours, as well as the increase of course participants’ financial wellbeing.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Resource bounds analysis"

1

CuiYu Kong, Yen-Wen Chen und I-Hsuan Peng. „Referential bounds analysis of uplink radio resource scheduling in LTE network“. In 2014 IEEE 11th Consumer Communications and Networking Conference (CCNC). IEEE, 2014. http://dx.doi.org/10.1109/ccnc.2014.6866620.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

2

Cheney, James, und Morten Dahl. „Resource bound analysis for database queries“. In the third ACM SIGPLAN workshop. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1375696.1375706.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

3

Chin, Wei-Ngan, Huu Hai Nguyen, Corneliu Popeea und Shengchao Qin. „Analysing memory resource bounds for low-level programs“. In the 7th international symposium. New York, New York, USA: ACM Press, 2008. http://dx.doi.org/10.1145/1375634.1375656.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

4

Hoffmann, Jan, Ankush Das und Shu-Chun Weng. „Towards automatic resource bound analysis for OCaml“. In POPL '17: The 44th Annual ACM SIGPLAN Symposium on Principles of Programming Languages. New York, NY, USA: ACM, 2017. http://dx.doi.org/10.1145/3009837.3009842.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

5

Ngo, Van Chan, Quentin Carbonneaux und Jan Hoffmann. „Bounded expectations: resource analysis for probabilistic programs“. In PLDI '18: ACM SIGPLAN Conference on Programming Language Design and Implementation. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3192366.3192394.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

6

Dillin, M. F., und R. M. Neupauer. „Wavelet Analysis of Steady State Groundwater Flow in a Bounded Domain“. In World Environmental and Water Resources Congress 2010. Reston, VA: American Society of Civil Engineers, 2010. http://dx.doi.org/10.1061/41114(371)101.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

7

Ferson, Scott. „Probability Bounds Analysis Solves the Problem of Incomplete Specification in Probabilistic Risk and Safety Assessments“. In Ninth United Engineering Foundation Conference on Risk-Based Decisionmaking in Water Resources. Reston, VA: American Society of Civil Engineers, 2001. http://dx.doi.org/10.1061/40577(306)16.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

8

Xu, Qian, Jianping Wang und Kui Wu. „Resource Capacity Analysis in Network Slicing with Ensured End-to-End Performance Bound“. In 2018 IEEE International Conference on Communications (ICC 2018). IEEE, 2018. http://dx.doi.org/10.1109/icc.2018.8422600.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

9

Aggarwal, Vaneet, Melissa Duarte, Ashutosh Sabharwal und N. K. Shankaranarayanan. „Full- or half-duplex? A capacity analysis with bounded radio resources“. In 2012 IEEE Information Theory Workshop (ITW 2012). IEEE, 2012. http://dx.doi.org/10.1109/itw.2012.6404659.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

10

Cravero, Carlo, und Gabriele Milanese. „Analysis of the Design Bounds in Performance Limits for Industrial Axial Flow Fans“. In ASME Turbo Expo 2020: Turbomachinery Technical Conference and Exposition. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/gt2020-16058.

Der volle Inhalt der Quelle

Annotation:

Abstract The design of an industrial axial flow fan can take great advantage from the knowledge of performance limits and favourable design choices determined from its specific fluid-dynamic characteristics. As for other turbomachinery types, this fact is generally experienced through the entire design flow-path, from the preliminary design phase to the final optimization. Correlations, data and charts available from literature as well as proprietary database, exploited with many techniques (including machine learning) are resources in widespread use for this purpose. Despite the fluid dynamics of axial flow fans can be considered a well-known topic, nevertheless some specific points (e.g. the maximum achievable total-to-static efficiency) can be the subject of discussions, misunderstanding or bad design choices. The present work addresses this problem in two parts. In the first part a simple 1D model is built, for fans with and without stator, from classical theory of axial fans for pressure rise coefficient, head coefficient, flow angles and diffusion efficiency. The most relevant quantities (e.g. total-to-total efficiency, total-to-static efficiency), obtained with the 1D model, are plotted on hill charts as a function of the non-dimensional pressure rise and flow coefficient. This tool provides information that can be used for preliminary design evaluations, to understand and exploit the impact of the main design choices on the basic flow characteristics and the related performance. In the second part of the work a numerical investigation is presented on the main 3D flow characteristics that are observed to limit, both in CFD simulations and experimental tests, the performance of industrial axial fans at high-pressure rise and low-to-medium flow coefficients. Simulations results highlighted that local critical swirl ratios exist for the hub and the tip regions which, when exceeded, lead with different flow topology changes to a strong performance degradation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!