An Analytical Model for Closed Networks with a General Single Queue and an Infinite Server Station

In this paper we propose a new analytical model to solve a class of closed queuing networks with general servers and with a small number of customers. This model can be applied to analyze problems such as the machine-repairman problem and simultaneous resource possession. Our algorithm is based on exact mean value analysis and on two-moment approximations of GI/G/l queues. The model gives good results for a large range of the network parameters

Capabilities measurement: an empirical investigation

Sen’s seminal contribution highlights the importance of positive freedom in the measurement of human welfare. The present paper attempts to measure this freedom aspect in an integrated approach. The main contribution of the paper is the simultaneous estimation of capability, functioning, and conversion efficiency with explicit modeling of freedom by latent variable modeling approach. The knowledge dimension of capabilities is modeled and estimated by integrating exploratory and confirmatory statistical methods in a two-stage procedure. In the first stage, Partial Least Squares method is employed to construct latent variable scores. These scores are transformed to relative scores for the sake of comparison and then used to estimate the proposed simultaneous-equation capability model by 3SLS in the second stage. The results show that capability is inversely related to resources and positively related to freedom and functioning. The computed relative capability and freedom inequality ratios are very high whereas relative functioning and efficiency inequality ratios are at a moderate level. The conventional income inequality ratio is lower as compared to the capability dimensions’ ratios and close to the Gini-coefficient. The paper extended the measurement of conversion inefficiency into voluntary and involuntary inefficiency. The paper also suggests criteria for evaluating empirical research within the capability approach framework. The paper recommends development of specific survey instruments in order to create better indicators for capability dimensions and use of latent variable modeling for constructing latent variable scores, and their subsequent use in estimation. These findings suggest a capabilities-oriented public and education policies for the enhancement of knowledge dimension of capabilities in particular and human welfare in general. The focus of education policy should be extended from investment oriented (human capital approach) to value-oriented (human capability approach).Capabilities; Freedom; Functioning; Conversion Efficiency; Latent variables; Structural equations model; PLS; LISREL; 3SLS

Multi-objective model for optimizing railway infrastructure asset renewal

Trabalho inspirado num problema real da empresa Infraestruturas de Portugal, EP.A multi-objective model for managing railway infrastructure asset renewal is presented. The model aims to optimize three objectives, while respecting operational constraints: levelling investment throughout multiple years, minimizing total cost and minimizing work start postponements. Its output is an optimized intervention schedule. The model is based on a case study from a Portuguese infrastructure management company, which specified the objectives and constraints, and reflects management practice on railway infrastructure. The results show that investment levelling greatly influences the other objectives and that total cost fluctuations may range from insignificant to important, depending on the condition of the infrastructure. The results structure is argued to be general and suggests a practical methodology for analysing trade-offs and selecting a solution for implementation.info:eu-repo/semantics/publishedVersio

Queueing networks: solutions and applications

During the pasttwo decades queueing network models have proven to be a versatile tool for computer system and computer communication system performance evaluation. This chapter provides a survey of th field with a particular emphasis on applications. We start with a brief historical retrospective which also servesto introduce the majr issues and application areas. Formal results for product form queuenig networks are reviewed with particular emphasis on the implications for computer systems modeling. Computation algorithms, sensitivity analysis and optimization techniques are among the topics covered. Many of the important applicationsof queueing networks are not amenableto exact analysis and an (often confusing) array of approximation methods have been developed over the years. A taxonomy of approximation methods is given and used as the basis for for surveing the major approximation methods that have been studied. The application of queueing network to a number of areas is surveyed, including computer system cpacity planning, packet switching networks, parallel processing, database systems and availability modeling.Durante as últimas duas décadas modelos de redes de filas provaram ser uma ferramenta versátil para avaliação de desempenho de sistemas de computação e sistemas de comunicação. Este capítulo faz um apanhado geral da área, com ênfase em aplicações. Começamos com uma breve retrospectiva histórica que serve também para introduzir os pontos mais importantes e as áreas de aplicação. Resultados formais para redes de filas em forma de produto são revisados com ênfase na modelagem de sistemas de computação. Algoritmos de computação, análise de sensibilidade e técnicas de otimização estão entre os tópicos revistos. Muitas dentre importantes aplicações de redes de filas não são tratáveis por análise exata e uma série (frequentemente confusa) de métodos de aproximação tem sido desenvolvida. Uma taxonomia de métodos de aproximação é dada e usada como base para revisão dos mais importantes métodos de aproximação propostos. Uma revisão das aplicações de redes de filas em um número de áreas é feita, incluindo planejamento de capacidade de sistemas de computação, redes de comunicação por chaveamento de pacotes, processamento paralelo, sistemas de bancos de dados e modelagem de confiabilidade

Bidirectional coherent classical communication

A unitary interaction coupling two parties enables quantum communication in both the forward and backward directions. Each communication capacity can be thought of as a tradeoff between the achievable rates of specific types of forward and backward communication. Our first result shows that for any bipartite unitary gate, coherent classical communication is no more difficult than classical communication -- they have the same achievable rate regions. Previously this result was known only for the unidirectional capacities (i.e., the boundaries of the tradeoff). We then relate the tradeoff curve for two-way coherent communication to the tradeoff for two-way quantum communication and the tradeoff for coherent communiation in one direction and quantum communication in the other.Comment: 11 pages, v2 extensive modification and rewriting of the main proof, v3 published version with only a few more change

Anonymity for practical quantum networks

Quantum communication networks have the potential to revolutionise information and communication technologies. Here we are interested in a fundamental property and formidable challenge for any communication network, that of guaranteeing the anonymity of a sender and a receiver when a message is transmitted through the network, even in the presence of malicious parties. We provide the first practical protocol for anonymous communication in realistic quantum networks.Comment: 5 pages, published versio

Non-locality and Communication Complexity

Quantum information processing is the emerging field that defines and realizes computing devices that make use of quantum mechanical principles, like the superposition principle, entanglement, and interference. In this review we study the information counterpart of computing. The abstract form of the distributed computing setting is called communication complexity. It studies the amount of information, in terms of bits or in our case qubits, that two spatially separated computing devices need to exchange in order to perform some computational task. Surprisingly, quantum mechanics can be used to obtain dramatic advantages for such tasks. We review the area of quantum communication complexity, and show how it connects the foundational physics questions regarding non-locality with those of communication complexity studied in theoretical computer science. The first examples exhibiting the advantage of the use of qubits in distributed information-processing tasks were based on non-locality tests. However, by now the field has produced strong and interesting quantum protocols and algorithms of its own that demonstrate that entanglement, although it cannot be used to replace communication, can be used to reduce the communication exponentially. In turn, these new advances yield a new outlook on the foundations of physics, and could even yield new proposals for experiments that test the foundations of physics.Comment: Survey paper, 63 pages LaTeX. A reformatted version will appear in Reviews of Modern Physic