Efficient resource management for linear logic proof search

This article aims to generate all theorems of a given size in the implicational fragment of propositional intuitionistic linear logic. It was presented at the 36th International Conference on Logic Programming (ICLP).

Current software development practices, including those specified in DOD-STD-2167, frequently prescribe the use of program design languages (PDLs) during preliminary and critical design. Lockheed has developed an Ada design language (ADL) that supports management goals such as cost reduction, process control, and evaluation by customers during the entire software development life-cycle.The literature shows the many ways that Ada-based PDLs support software engineering goals1 like modularity, readability, loose coupling, strong cohesion, and data abstraction2. A negative aspect of many previous Ada-based PDLs is that the languages tend to allow developers and designers to provide too much detail early in the life-cycle, as the full Ada language is allowed by these design languages. This detail can cause harmful early focus on “how” the functionality is implemented, at the expense of considering “what” functionality is required. Managers and their customer counterparts may find it impractical to master all the facets of the full Ada programming language, and therefore may not understand the designs represented by a full Ada-based design language. Other deficiencies of full Ada-based design languages include the lack of a clear distinction between ADL as a language, and support for that language via tools, as well as the absence of clear connection to life-cycle milestones. Industry writers recently3 have observed that the connectivity of the PDL and milestones remains unclear.

Constraint Logic Programming (CLP) and Hereditary Harrop formulas (HH) are two well known ways to enhance the expressivity of Horn clauses. In this paper, we present a novel combination of these two approaches. We show how to enrich the syntax and proof theory of HH with the help of a given constraint system, in such a way that the key property of HH as a logic programming language (namely, the existence of uniform proofs) is preserved. We also present a procedure for goal solving, showing its soundness and completeness for computing answer constraints. As a consequence of this result, we obtain a new strong completeness theorem for CLP that avoids the need to build disjunctions of computed answers, as well as a more abstract formulation of a known completeness theorem for HH.

Recent development of logic programming languages based on linear logic suggests a successful direction to extend logic programming to be more expressive and more efficient. The treatment of formulasas-resources gives us not only powerful expressiveness, but also efficient access to a large set of data. However, in linear logic, whole resources are kept in one context, and there is no straight way to represent complex data structures as resources. For example, in order to represent an ordered list and time-dependent data, we need to put additional indices for each resource formula. This paper describes a logic programming language, called TLLP, based on intuitionistic temporal linear logic. This logic, an extension of linear logic with some features from temporal logics, allows the use of the modal operators '?'(next-time) and '?'(always) in addition to the operators used in intuitionistic linear logic. The intuitive meaning of modal operators is as follows: ? B means that B can be used exactly once at the next moment in time; ? B means that B can be used exactly once any time; !B means that B can be used arbitrarily many times (including 0 times) at any time. We first give a proof theoretic formulation of the logic of the TLLP language. We then present a series of resource management systems designed to implement not only interpreters but also compilers based on an extension of the standard WAM model.

Program design languages: How much detail should they include?

A general abstract theory for computation involving shared resources is presented. We develop the models of sharing graphs, also known as term graphs, in terms of both syntax and semantics. According to the complexity of the permitted form of sharing, we consider four situations of sharing graphs. The simplest is first-order acyclic sharing graphs represented by let-syntax, and others are extensions with higher-order constructs (lambda calculi) and/or cyclic sharing (recursive letrec binding). For each of four settings, we provide the equational theory for representing the sharing graphs, and identify the class of categorical models which are shown to be sound and complete for the theory. The emphasis is put on the algebraic nature of sharing graphs, which leads us to the semantic account of them. We describe the models in terms of the notions of symmetric monoidal categories and functors, additionally with symmetric monoidal adjunctions and traced monoidal categories for interpreting higher-order and cyclic features. The models studied here are closely related to structures known as notions of computation, as well as models for intuitionistic linear type theory. As an interesting implication of the latter observation, for the acyclic settings, we show that our calculi conservatively embed into linear type theory. The models for higher-order cyclic sharing are of particular interest as they support a generalized form of recursive computation, and we look at this case in detail, together with the connection with cyclic lambda calculi. We demonstrate that our framework can accommodate Milner’s action calculi, a proposed framework for general interactive computation, by showing that our calculi, enriched with suitable constructs for interpreting parameterized constants called controls, are equivalent to the closed fragments of action calculi and their higher-order/reflexive extensions. The dynamics, the computational counterpart of action calculi, is then understood as rewriting systems on our calculi, and interpreted as local preorders on our models.

The main purpose of the study is to substantiate the need for and identify the main stages and methods of integrated assessment of the efficiency of transboundary water resources management. Studies on the aforementioned topics in world and national science have not been disseminated. The article analyzes the general approaches to the assessment of the efficiency of water resources management, substantiates the necessity and peculiarities of the assessment of the efficiency of management of transboundary water resources. As a result of the generalization of scientific approaches on these issues, along with the economic importance of recognizing the social and environmental components of the evaluation of efficiency.The generalized methodology for evaluating the effectiveness and on the basis of the social, ecological and economic constituent management objectives for assessing the effectiveness of management of transboundary water resources is recognized as the most expedient use of integrated assessment by simultaneously and coherently studying a set of parameters that reflect all or most aspects of the investigated processes.The method of estimation of the efficiency of such control is proposed by determining the degree of proximity of objects being studied, according to the relative indicators to the object acting as a reference (distance method). This indicator determines the coefficient of integrated efficiency evaluation (Ki), which is calculated by the Euclidean formula. It is recommended to evaluate the effectiveness of the criteria for institutional and organizational support for management needs, the implementation of management objectives and information provision of the management of transboundary water resources. The information field of the indicators of evaluation of the efficiency of the management process, as well as the gradation of the coefficient of complex evaluation of efficiency in determining the level of efficiency of water resources management of a specific transboundary water basin, is proposed. The possibility of estimating the degree and directions of connection between the indicators of different groups or groups of criteria was investigated and a variant of its calculation was proposed on the basis of the Spirman rank correlation coefficient.The proposed integrated assessment method allows to determine the level of efficiency of management of transboundary water resources in the pool as a whole, as well as each of its parties separately, identify shortcomings and identify and use the most effective management option.

Approaches for programming language design used commonly in the research community today center around theoretical and performance-oriented evaluation. Recently, researchers have been considering more approaches to language design, including the use of quantitative and qualitative user studies that examine how different designs might affect programmers. In this paper, we argue for an interdisciplinary approach that incorporates many different methods in the creation and evaluation of programming languages. We argue that the addition of user-oriented design techniques can be helpful at many different stages in the programming language design process.

We develop an efficient representation and a pre-unification algorithm in the style of Huet (1975) for the linear /spl lambda/-calculus /spl lambda//sup /spl rarr//spl rArr/0&T/ which includes intuitionistic functions (/spl rarr/), linear functions (/spl rArr/), additive pairing (&), and additive unit (T). Applications lie in proof scorch, logic programming, and logical frameworks based on linear type theories. We also show that, surprisingly, a similar pre-unification algorithm does not exist for certain sublanguages.

Various types of calculi (Hilbert, Gentzen sequent, resolution calculi, tableaux) for propositional linear temporal logic (PLTL) have been invented. In this paper, a sound and complete loop-type sequent calculus $$\mathbf{G} _\text {L}{} \mathbf{T} $$ for PLTL with the temporal operators “next” and “henceforth always” ( $${\mathbf{PLTL}}^{n,a}$$ ) is considered at first. We prove that all rules of $$\mathbf{G} _\text {L}{} \mathbf{T} $$ are invertible and that the structural rules of weakening and contraction, as well as the rule of cut, are admissible in $$\mathbf{G} _\text {L}{} \mathbf{T} $$ . We describe a decision procedure for $${\mathbf{PLTL}}^{n,a}$$ based on the introduced calculus $$\mathbf{G} _\text {L}{} \mathbf{T} $$ . Afterwards, we introduce a sound and complete sequent calculus $$\mathbf{G} _\text {L}{} \mathbf{T} ^\mathcal {U}$$ for PLTL with the temporal operators “next” and “until”.

During COVID-19 emergency the majority of health structures in Europe saturated or nearly saturated their availabilities already in the first weeks of the epidemic period especially in some regions of Italy and Spain. The aim of this study is to analyse the efficiency in the management of hospital beds before the COVID-19 outbreak at regional level in France, Germany, Italy and Spain. This analysis can indicate a reference point for future analysis on resource management in emergency periods and help hospital managers, emergency planners as well as policy makers to put in place a rapid and effective response to an emergency situation. The results of this study clearly underline that France and Germany could rely on the robust structural components of the hospital system, compared to Italy and Spain. Presumably, this might have had an impact on the efficacy in the management of the COVID-19 diffusion. In particular, the high availability of beds in the majority of the France regions paired with the low occupancy rate and high turnover interval led these regions to have a high number of available beds. Consider also that this country generally manages complex cases. A similar structural component is present in the German regions where the number of available beds is significantly higher than in the other countries. The impact of the COVID-19 was completely different in Italy and Spain that had to deal with a relevant large number of patients relying on a reduced number of both hospital beds and professionals. A further critical factor compared to France and Germany concerns the dissimilar distribution of cases across regions. Even if in these countries the hospital beds were efficiently managed, the concentration of hospitalized patients and the scarcity of beds have put pressure on the hospital systems.

We introduce EMARS, an efficient resource management system for serverless cloud computing frameworks with the goal to enhance resource (focus on memory) allocation among containers. We have built our prototype on top of an open-source serverless platform, OpenLambda. It is based upon application workloads and serverless functions' memory needs. As a background motivation we analyzed the latencies and memory requirements of functions running on AWS lambda. The memory limits also lead to variations in number of containers spawned on OpenLambda. We use memory limit settings to propose a model of predictive efficient memory management.

Resource management strategy in adaptive cloud provisions the needed resources dynamically to the end-users. To improve the runtime performance of adaptive cloud for service-based applications, two aspects of technical issues are required to be addressed. The first one is the balancing of a large amount of data on existing resources and the second is resource provisioning which can adjust the number of resources optimally to adapt the time-varying workload. As the growth of data is increasing tremendously, efficient resource management is the need in cloud computing. We build a cloud framework to process data in automation with adaptive resource and workload management strategy. Numbers of approaches are reviewed and applied for workload prediction. We developed the model Auto-Regressive Integrated Moving Average-workload Prediction for Efficient Resource Provisioning (ARIMA-PERP) and evaluated the results that can satisfy the on-demand need of end-users for efficient resource utilization. To serve the maximum number of user requests, performance metrics of the proposed approach are evaluated. It is observed that our evaluated results achieved an accurate prediction by 91.11%, which meets the efficient resource utilization for the demanded workload. As compared with the exiting approach, we achieved better performance by 0.11% for accurate prediction. The proposed architecture is intended to provide the resources dynamically and efficiently satisfying the demands of the user. To achieve this objective of efficient resource provisioning, algorithms are developed for workload prediction which helps in deciding optimum resource provisioning. Our system uses proactive approach resource management and deployment of the adaptive cloud system. In traditional systems, resources are managed based on demand, availability and the strategy of scheduling which results in delayed response time at large. We configured the ARIMA model to predict the future workload for provisioning the resources dynamically and remove the problem of over-provisioning and under-provisioning in a cloud environment.

Encryption as an abstract data-type: An extended abstract

Purpose The purpose of this study is to examine the relationship between the managerial efficiency and the customer satisfaction of Parisian boutique hotels by using the multi-criteria decision analysis (MCDA) methods. Design/methodology/approach In the first stage, hotels’ managerial efficiency is assessed by data envelopment analysis to establish which hotel has the most efficient performance. In the second stage, the customer satisfaction of these hotels is estimated by the ELECTRE (ELimination et Choix Traduisant la RÉalité) method to assess the hotel’s ability to satisfy their customers. Findings Empirical results show that there is an inverse relation between customer satisfaction and ability to maximise the Revenue per Available Room (RevPAR). In other words, trying to improve efficiency implies a reduction in guests’ satisfaction (and vice versa). Research limitations/implications Therefore, through this research the authors can realise that hotel managers should give more attention to customer service because it has a more direct and important impact on customer satisfaction. It also positively impacts on resource management. However, there are some limitations to this study. First, this study only focuses on 12 hotels. Because the data set is very confidential, it is very difficult to have a bigger sample. Then, the evaluation is based on 2014 figures only. It could be interesting to know their performance for previous years to understand their evolution. Finally, it is necessary to know the percentage of direct reservations for each hotel. For instance, if a hotel is relying too much on online travel agents (i.e. Booking.com, Expedia, etc.), it needs to pay a significant amount of commission to these companies. As a result, it could have a good RevPAR but might pay a huge commission (for example, 20 per cent for most of sites) at the end. In terms of perspectives, it is necessary to conduct a more extensive research to test the hypothesis in a different context. Additionally, the data were taken for a single period of time. It will be very interesting to create a panel of hotels and collect data over a period of time (Barros, 2005; Barros and Santos, 2006; Barros and Deike, 2008). This would enable to better understand the relationship between managerial efficiency and customer satisfaction in a long-term prospective. Originality/value This paper presents the relationship between the managerial efficiency and customer satisfaction in Parisian boutique hotels context. Study suggests that in service industry, increase of firm’s efficiency could negatively impact the guest satisfaction. Therefore, through studying the authors can realise that why hotel managers should focus on customer satisfaction, which attributes play the vital role in customer satisfaction and how to optimize their resources. One of the originalities of this paper is that the authors use the customers’ feedback from the UGC websites (Trip Advisor and Booking.com) as the performance evaluation indicators for customer satisfaction. The data are very confidential and hard to get.