Search results for "Information Systems."
showing 10 items of 1545 documents
Algorithmic Analysis of Programs with Well Quasi-ordered Domains
2000
AbstractOver the past few years increasing research effort has been directed towards the automatic verification of infinite-state systems. This paper is concerned with identifying general mathematical structures which can serve as sufficient conditions for achieving decidability. We present decidability results for a class of systems (called well-structured systems) which consist of a finite control part operating on an infinite data domain. The results assume that the data domain is equipped with a preorder which is a well quasi-ordering, such that the transition relation is “monotonic” (a simulation) with respect to the preorder. We show that the following properties are decidable for wel…
Heuristics for the Constrained Incremental Graph Drawing Problem
2019
Abstract Visualization of information is a relevant topic in Computer Science, where graphs have become a standard representation model, and graph drawing is now a well-established area. Within this context, edge crossing minimization is a widely studied problem given its importance in obtaining readable representations of graphs. In this paper, we focus on the so-called incremental graph drawing problem, in which we try to preserve the user’s mental map when obtaining successive drawings of the same graph. In particular, we minimize the number of edge crossings while satisfying some constraints required to preserve the position of vertices with respect to previous drawings. We propose heur…
Multiple SIP strategies and bottom-up adorning in logic query optimization
1990
Preprocessing methods called “readorning” and “bottom-up adorning” are introduced as means of enlarging the application domain of magic sets and related query optimization strategies for logic databases. Readorning tries to make possible the simultaneous use of multiple sideways information passing (sip) strategies defined for a rule, thus yielding an optimization effect that may not be achieved by any particular choice of sip strategies. Bottom-up adorning is used to make magic sets applicable to cases in which potential optimizations can be derived from bindings coming upwards from rule bodies to rule heads in bottom-up evaluation. These include the cases in which we know that some base r…
Distributed Consensus in Noncooperative Inventory Games
2009
This paper deals with repeated nonsymmetric congestion games in which the players cannot observe their payoffs at each stage. Examples of applications come from sharing facilities by multiple users. We show that these games present a unique Pareto optimal Nash equilibrium that dominates all other Nash equilibria and consequently it is also the social optimum among all equilibria, as it minimizes the sum of all the players’ costs. We assume that the players adopt a best response strategy. At each stage, they construct their belief concerning others probable behavior, and then, simultaneously make a decision by optimizing their payoff based on their beliefs. Within this context, we provide a …
Multiobjective GRASP with Path Relinking
2015
In this paper we review and propose different adaptations of the GRASP metaheuristic to solve multiobjective combinatorial optimization problems. In particular, we describe several alternatives to specialize the construction and improvement components of GRASP when two or more objectives are considered. GRASP has been successfully coupled with Path Relinking for single-objective optimization. Moreover, we propose different hybridizations of GRASP and Path Relinking for multiobjective optimization. We apply the proposed GRASP with Path Relinking variants to two combinatorial optimization problems, the biobjective orienteering problem and the biobjective path dissimilarity problem. We report …
Retail pricing decisions and product category competitive structure
2010
This study addresses the use of demand forecasting techniques by retailers to support their decision making. Specifically, the authors propose a pricing decision support model for retailers to estimate optimal prices, whose output depends on the configuration of a supporting measurement model. The measurement model is a demand function that relates sales and prices within the category; optimal prices are those whose effects on demand and retail margins maximize the category's profitability. This investigation focuses particularly on the role of competitive structure, such that the authors consider two types of price competition asymmetries for demand forecasting: those depending on the bran…
Adjusting Software Revenue and Pricing Strategies in the Era of Cloud Computing
2016
Competitive forces shape software revenue and pricing models in cloud computing.Different revenue and pricing models lead to different competitive strategies.Software firms apply mixed revenue models, or a hybrid pricing mechanism.Software renting provides flexibility for software providers against competition.Software architecture may either limit possibilities for different revenue models. Recent research has recognized cloud computing as a new paradigm of servitization in which software products are offered based on service contracts. Thus, instead of selling software licenses, software vendors can rent software as a service to customers. However, it is still unclear how software provide…
Spatial joins
2019
The spatial join is a popular operation in spatial database systems and its evaluation is a well-studied problem. This paper reviews research and recent trends on spatial join evaluation. The complexity of different data types, the consideration of different join predicates, the use of modern commodity hardware, and support for parallel processing open the road to a number of interesting directions for future research, some of which we outline in the paper.
LinkedSaeima: A Linked Open Dataset of Latvia’s Parliamentary Debates
2019
This paper describes the LinkedSaeima dataset that contains structured data about Latvia’s parliamentary debates from 1993 until 2017. This information is published at http://dati.saeima.korpuss.lv as Linked Open Data. It is a part of the Corpus of Saeima (the Parliament of Latvia) released as open data for multidisciplinary research. The data model of LinkedSaeima follows the data structure of the LinkedEP dataset with a few modifications. The dataset is augmented with links to the Wikidata knowledge base that provide additional information about the speakers and named entities mentioned in the corpus.
Notice of Violation of IEEE Publication Principles: New Delay-Dependent Exponential $H_{\infty}$ Synchronization for Uncertain Neural Networks With M…
2010
This paper establishes an exponential H infin synchronization method for a class of uncertain master and slave neural networks (MSNNs) with mixed time delays, where the mixed delays comprise different neutral, discrete, and distributed time delays. The polytopic and the norm-bounded uncertainties are separately taken into consideration. An appropriate discretized Lyapunov-Krasovskii functional and some free-weighting matrices are utilized to establish some delay-dependent sufficient conditions for designing delayed state-feedback control as a synchronization law in terms of linear matrix inequalities under less restrictive conditions. The controller guarantees the exponential H infin synchr…