In this paper, we formulate a joint dynamic pricing and freshness-keeping effort strategy for perishable products in finite horizon. Based on the nature of products, paper considers product demand influenced by selling price, freshness stock level. Since level decreases with time, assume that deteriorates exponentially. Besides, is introduced to reduce deterioration rate freshness. Our purpose ...

Web crawler design presents many different challenges: architecture, strategies, performance and more. One of the most important research topics concerns improving the selection of “interesting” web pages (for the user), according to importance metrics. Another relevant point is content freshness, i.e. maintaining freshness and consistency of temporary stored copies. For this, the crawler perio...

This paper introduces Crescando: a scalable, distributed relational table implementation designed to perform large numbers of queries and updates with guaranteed access latency and data freshness. To this end, Crescando leverages a number of modern query processing techniques and hardware trends. Specifically, Crescando is based on parallel, collaborative scans in main memory and so-called “que...

We define a type and effect system for a λ-calculus extended with side effects, in the form of primitives for creating and accessing resources. The analysis correctly over-approximates the sequences of resource accesses performed by a program at run-time. To accurately analyse the binding between the creation of a resource and its accesses, our system exploits a new class of types. Our ν-types ...

We present a reduction semantics for the LYSA calculus extended with session information and a static analysis for it. If a protocol passes the analysis then it is free of replay attacks.

Many data management systems are faced with a constant, high-throughput stream of updates. In some cases, these updates are generated externally: a data warehouse system must ingest a stream of external events and update its state. In other cases, they are generated by the application itself: large-scale machine learning frameworks maintain a global shared state, which is used to store the para...

Nominal Isabelle is a framework for reasoning about programming languages with named bound variables (as opposed to de Bruijn indices). It is a definitional extension of the HOL object logic of the Isabelle theorem prover. Nominal Isabelle supports the definition of term languages of calculi with bindings, functions on the terms of these calculi and provides mechanisms that automatically rename...

This paper presents a novel adaptive approach for scheduling updates in a data warehouse that processes “nearreal-time” data streams. Data is pushed to the warehouse from a variety of external sources with a wide range of inter-arrival times (e.g., once a minute to once a day). Due to network conditions, the volume of incoming data can widely vary and data streams can experience intermittent ou...

This paper introduces a new recursion principle for inductively defined data modulo α-equivalence of bound names that makes use of Odersky-style local names when recursing over bound names. It is formulated in simply typed λ-calculus extended with names that can be restricted to a lexical scope, tested for equality, explicitly swapped and abstracted. The new recursion principle is motivated by ...

Wireless sensor networks (WSNs) are widely used in military and civilian fields, such as battlefield monitoring, measurement of the patients’ condition, traffic flow monitoring and environmental pollution tracking. This paper proposes the IPPDA which can protect the integrity and privacy of data. A set of congruent numbers are added to the perception data to enable the aggregation node to condu...