Search results for "Software"
showing 10 items of 7396 documents
A primal-dual algorithm for the fermat-weber problem involving mixed gauges
1987
We give a new algorithm for solving the Fermat-Weber location problem involving mixed gauges. This algorithm, which is derived from the partial inverse method developed by J.E. Spingarn, simultaneously generates two sequences globally converging to a primal and a dual solution respectively. In addition, the updating formulae are very simple; a stopping rule can be defined though the method is not dual feasible and the entire set of optimal locations can be obtained from the dual solution by making use of optimality conditions. When polyhedral gauges are used, we show that the algorithm terminates in a finite number of steps, provided that the set of optimal locations has nonepty interior an…
On handling exceptions
1995
The current literature of information systems has dealt extensively with all kinds of exceptions. There are several studies defining the concept of exception and even providing classifications. However, no studies provide a method for verifying the rules in order to handle exceptions and to achieve the goals set by an organization's rules. In this paper, a model employing a set of unique input/output (UIO) sequences is presented for verifying such rules. The model originally presented for Finite State Machines (FSM) has been modified to include concepts of exception handling and will be used to form a tool usable for verifying exception handling rules in OISs.
Finding Tours for a Set of Interests
2018
This paper addresses a novel tour discovery problem in the domain of travel search. We create a ranking of tours for a set of travel interests, where a tour is a group of city documents and a travel interest is a query. While generating and ranking tours, it is aimed that each interest (from the interest set) is satisfied by at least one city in a tour and the distance traveled to cover the tour is not too large. Firstly, we generate tours for the interest set, by utilizing the available ranking of cities for the individual interests and the distances between the cities. Then, in absence of existing methods directly related to our problem, we devise our novel techniques to calculate ranking…
Certifying feasibility and objective value of linear programs
2012
Abstract We present an algorithm that certifies the feasibility of a linear program and computes a safe bound on its objective value while using rational arithmetic as little as possible. Our approach relies on computing a feasible solution that is as far as possible from satisfying an inequality at equality. To this end, we have to detect the set of inequalities that can only be satisfied at equality. Compared to previous approaches, our algorithm has a much higher success rate.
Efficient evolutionary approach to approximate the Pareto-optimal set in multiobjective optimization, UPS-EMOA
2010
Solving real-life engineering problems requires often multiobjective, global, and efficient (in terms of objective function evaluations) treatment. In this study, we consider problems of this type by discussing some drawbacks of the current methods and then introduce a new population-based multiobjective optimization algorithm UPS-EMOA which produces a dense (not limited to the population size) approximation of the Pareto-optimal set in a computationally effective manner.
PRIvacy LEakage Methodology (PRILE) for IDS Rules
2010
This paper introduces a methodology for evaluating PRIvacy LEakage in signature-based Network Intrusion Detection System (IDS) rules. IDS rules that expose more data than a given percentage of all data sessions are defined as privacy leaking. Furthermore, it analyses the IDS rule attack specific pattern size required in order to keep the privacy leakage below a given threshold, presuming that occurrence frequencies of the attack pattern in normal text are known. We have applied the methodology on the network intrusion detection system Snort’s rule set. The evaluation confirms that Snort in its default configuration aims at not being excessively privacy invasive. However we have identified s…
<strong>New tool useful for drug discovery validated through benchmark datasets</strong>
2018
Atomic Weighted Vectors (AWVs) are vectors that contain the codified information of molecular structures, which can apply to a set of Aggregation Operators (AOs) to calculate total and local molecular descriptors (MDs). This article presents an exploratory study of a new tool useful for drug discovery using different datasets, such as DRAGON and Sutherland’s datasets, as well as their comparison with other well-known approaches. In order to evaluate the performance of the tool, several statistics and QSAR/QSPR experiments were performed. Variability analyses are used to quantify the information content of the AWVs obtained from the tool, by the way of an information theory-based algorithm. …
Features for Text Comparison
2008
The main purpose of this paper is to deliver appropriate tool to find similarities between texts. The area of interest covers comparing large amount of different texts grouped in various areas of knowledge. Similarity is defined as distance between two texts and as this the measure may be calculated as the set of parameters based on features.
A Tool-Based Approach for Essentializing Software Engineering Practices
2019
Software Engineers work using highly diverse methods and practices, and general theories in software engineering are lacking. A recent attempt at creating a common ground in the area of software engineering methodologies has been the Essence Theory of Software Engineering. Essence is a method-agnostic progress management framework and a meta-method for Software Engineering (SE). However, tooling for Essence is still lacking. Without dedicated tools and other instruments, a meta-method such as Essence is cumbersome to utilize by practitioners and students. Indeed, Essence currently suffers from a lack of widespread practitioner adoption. In this paper, we thus present an Open Source tool for…
Current Software-as-a-Service Business Models: Evidence from Finland
2012
This paper characterizes the business models of Software-as-a-Service (SaaS) firms based on their value proposition, customer segments, revenue streams, and customer relationship, and analyzes interconnections of these business model elements. The target set of 163 Finnish SaaS and ASP firms was first compared to other software firms and then clustered into four clusters based on indicator data of their business model elements. The comparison reveals that the SaaS and ASP firms have smaller customer and transaction sizes than software firms in general. The resulting classification reveals two different configurations, a pure-play SaaS model and an enterprise SaaS model, and the typical fact…