Search results for "Programming"
showing 10 items of 3090 documents
The Rail Quality Index as an Indicator of the “Global Comfort” in Optimizing Safety, Quality and Efficiency in Railway Rails
2012
AbstractThe proposed model uses the stochastic dynamic programming and in particular Markov decision processes applied to the Rail Quality Index (RQI - Italian Indice di Qualità del Binario, IQB).By performing the integrated analysis of the classes of variables which characterize the overall service quality (in terms of comfort and safety), the proposed mathematical approach allows to find the solutions to the decision-making process in function of the probability of deterioration of the state variables of the infrastructure over time and of the flow of available resources.
The OptQuest Callable Library
2005
In this chapter we discuss the development and application of a library of functions that is the optimization engine for the OptQuest system. OptQuest is commercial software designed for optimizing complex systems, such as those formulated as simulation models. OptQuest has been integrated with several simulation packages with the goal of adding optimization capabilities. The optimization technology within OptQuest is based on the metaheuristic framework known as scatter search. In addition to describing the functionality of the OptQuest Callable Library (OCL) with an illustrative example, we apply it to a set of unconstrained nonlinear optimization problems.
Reducing Local Alphabet Size in Recognizable Picture Languages
2021
A recognizable picture language is defined as the projection of a local picture language defined by a set of two-by-two tiles, i.e. by a strictly-locally-testable (SLT) language of order 2. The family of recognizable picture languages is also defined, using larger k by k tiles, \(k>2\), by the projection of the corresponding SLT language. A basic measure of the descriptive complexity of a picture language is given by the size of the SLT alphabet using two-by-two tiles, more precisely by the so-called alphabetic ratio of sizes: SLT-alphabet/picture-alphabet. We study how the alphabetic ratio changes moving from two to larger tile sizes, and we obtain the following result: any recognizable pi…
Manager's Toolbox for OSS/BSS Market Analysis
2009
The purpose of this section is to provide a set of quick tools for analysts and managers to analyze the status of the telecom operator software market.
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.
JASP: a program to estimate discovery and exclusion limits in prospective studies of searches
1997
Abstract This program computes the discovery and exclusion limits that can be set in prospective studies of new experiments in the search for new phenomena. It properly takes into account the different outcomes that the experiment can obtain including the possible signal and background fluctuations. The procedure gives in general more conservative limits than those obtained assuming that the experiment will obtain a number of events equal to the expected mean. The difference may be essential in those cases where only one experiment is foreseen to be carried out.
Interactive Gradually Generating Relevance Query Refinement Under the Human-Mediated Scenario in Multilingual Settings
2016
As opposed to query modelling, relevance generating interactive query refinement (QR) is a technique aimed at exploiting syntax variations of gradually extended, being removed or replaced with some other keywords query, which depending on the factors like e.g. the information resource, the database structure, or the keyword alignment, facilitates significantly the searching process. Therefore our motivation is to explore the dynamism of the precision trend depended upon the factors analyzed. For a couple of language pairs which constitute multilingual settings, we develop a user-centred framework that imposes distributed search optimization. Our data set contains variety of query types subm…
Fast and Accurate Bounds on Linear Programs
2009
We present an algorithm that certifies the feasibility of a linear program while using rational arithmetic as little as possible. Our approach relies on computing a feasible solution of the linear program that is as far as possible from satisfying an inequality at equality. To realize such an approach, we have to detect the set of inequalities that can only be satisfied at equality. Compared to previous approaches for this problem our algorithm has a much higher rate of success.
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.
Black-Box Solvers
2017
Linear programming is perhaps the best-known tool for optimization. Linear programming is a general-purpose framework that allows a real system to be abstracted as a model with a linear objective function subject to a set of linear constraints.