Abstract not found

Abstract This paper compares two specific types of competition schemes (i.e., service-based competition and facility-based competition) by focusing on a firm's incentive to invest in network infrastructure. We show that when monopoly rent is large, facility-based competition makes the initial

-to-order supply chains are formed based on two different job competition schemes from the perspective of a supply chain ecosystem. One can see in the simulation that the supply chain ecosystem grows in different directions. One scheme called Cost-driven principle leads to destructive competition while the other

Abstract — System reliability is an important design measure in many systems engineering fields. In this paper, we propose a new neural network method combining stochastic competitive scheme and hysteresis quantized neuron for the reliability optimization. In the proposed algorithm, the neurons

Abstract. The process of mixing labelled and unlabelled data is being recently studied in semi-supervision techniques. However, this is not the only scenario in which mixture of labelled and unlabelled data can be done. In this paper we propose a new problem we have called particularization and a way to solve it. We also propose a new technique for mixing labelled and unlabelled data. This technique relies in the combination of supervised and unsupervised processes competing for the classification of each data point. Encouraging results on improving the classification outcome are obtained on MNIST database. 1

company ” regulation that aims at making the private distribution monopoly compete with a refer-ence efficient model company, through a “yardstick competition” approach. It compares it with the “price cap ” scheme used in elec-tricity distribution in England and Wales. It contributes with a proposal

schemes for cache coherence are potentially attractive in large multiprocessor systems that are beyond the scaling limits of the snoopy cache schemes. Slight modifications to directory schemes can make them competitive in performance with snoopy cache schemes for small multiprocessors. Trace driven

We examine whether men and women of the same ability differ in their selection into a competitive environment. Participants in a laboratory experiment solve a real task, first under a non-competitive piece rate and then a competitive tournament incentive scheme. Although there are no gender

We introduce a simple evolution scheme for multiobjective optimization problems, called the Pareto Archived Evolution Strategy (PAES). We argue that PAES may represent the simplest possible nontrivial algorithm capable of generating diverse solutions in the Pareto optimal set. The algorithm, in its

new paradigm for achieving CCA-security; this paradigm avoids “proofs of well-formedness ” that have been shown to underlie previous constructions. Second, instantiating our construction using known IBE constructions we obtain CCA-secure encryption schemes whose performance is competitive