2,089 research outputs found
Penalty method for fuzzy linear programming with trapezoidal numbers
In this paper we shall propose an algorithm for solving fuzzy linear programming problems with trapezoidal numbers using a penalty method. We will transform the problem of maximizing a function having trapezoidal fuzzy number values under some constraints into a deterministic multi-objective programming problem by penalizing the objective function for possible constraint violation. Furthermore, the obtained deterministic problem will have only unavoidable inequalities between trapezoidal fuzzy numbers parameters as constraints
On the Hardness of Entropy Minimization and Related Problems
We investigate certain optimization problems for Shannon information
measures, namely, minimization of joint and conditional entropies ,
, , and maximization of mutual information , over
convex regions. When restricted to the so-called transportation polytopes (sets
of distributions with fixed marginals), very simple proofs of NP-hardness are
obtained for these problems because in that case they are all equivalent, and
their connection to the well-known \textsc{Subset sum} and \textsc{Partition}
problems is revealed. The computational intractability of the more general
problems over arbitrary polytopes is then a simple consequence. Further, a
simple class of polytopes is shown over which the above problems are not
equivalent and their complexity differs sharply, namely, minimization of
and is trivial, while minimization of and
maximization of are strongly NP-hard problems. Finally, two new
(pseudo)metrics on the space of discrete probability distributions are
introduced, based on the so-called variation of information quantity, and
NP-hardness of their computation is shown.Comment: IEEE Information Theory Workshop (ITW) 201
Proof of the Hero\u27s formula according to R.Boscovich
With this lecture we would like to draw your attention to a significant
Croatian scientist (mathematician, physicist, astronomer and philosopher) Roger Boscovich (1711-1787). As an illustration of his mathematical work we mention his original proof of the Hero\u27s formula. Also, a short description of his curriculum vitae is given
Bračni ugovor srpske kraljice Konstance
Srpski kralj Vladislav se 1293. god. oženio Konstancom iz čuvene mletačke parodice Morozinija. O ženidbi Vladisavljevoj ne znamo skora ništa, ali nam je u Mlecima sačuvana jedna njena
slika, po kojoj se vidi, da je Konstanca bila žena neobične ljepote, kao i bračni ugovor između Vladislava i Konstance, citiran u ovom članku.
(1 slika
Router-based algorithms for improving internet quality of service.
We begin this thesis by generalizing some results related to a recently proposed positive system model of TCP congestion control algorithms. Then, motivated by a mean ¯eld analysis of the positive system model, a novel, stateless, queue management scheme is designed: Multi-Level Comparisons with index l (MLC(l)). In the limit, MLC(l) enforces max-min fairness in a network of TCP flows.
We go further, showing that counting past drops at a congested link provides su±cient information to enforce max-min fairness among long-lived flows and to reduce the flow completion times of short-lived flows. Analytical models are presented, and the accuracy of predictions are validated by packet level ns2 simulations.
We then move our attention to e±cient measurement and monitoring techniques. A small active counter architecture is presented that addresses the problem of accurate approximation of statistics counter values at very-high speeds that can be both updated and estimated on a per-packet basis. These algorithms are necessary in the design of router-based flow control algorithms since on-chip
Static RAM (SRAM) currently is a scarce resource, and being economical with its usage is an important task. A highly scalable method for heavy-hitter identifcation that uses our small active counters architecture is developed based on heuristic argument. Its performance is compared to several state-of-the-art algorithms and shown to out-perform them.
In the last part of the thesis we discuss the delay-utilization tradeoff in the congested Internet links.
While several groups of authors have recently analyzed this tradeoff, the lack of realistic assumption in their models and the extreme complexity in estimation of model parameters, reduces their applicability at real Internet links. We propose an adaptive scheme that regulates the available queue space to keep utilization at desired, high, level. As a consequence, in large-number-of-users regimes, sacrifcing 1-2% of bandwidth can result in queueing delays that are an order of magnitude smaller than in the standard BDP-bu®ering case. We go further and introduce an optimization framework for describing the problem of interest and propose an online algorithm for solving it
Router-based algorithms for improving internet quality of service.
We begin this thesis by generalizing some results related to a recently proposed positive system model of TCP congestion control algorithms. Then, motivated by a mean ¯eld analysis of the positive system model, a novel, stateless, queue management scheme is designed: Multi-Level Comparisons with index l (MLC(l)). In the limit, MLC(l) enforces max-min fairness in a network of TCP flows.
We go further, showing that counting past drops at a congested link provides su±cient information to enforce max-min fairness among long-lived flows and to reduce the flow completion times of short-lived flows. Analytical models are presented, and the accuracy of predictions are validated by packet level ns2 simulations.
We then move our attention to e±cient measurement and monitoring techniques. A small active counter architecture is presented that addresses the problem of accurate approximation of statistics counter values at very-high speeds that can be both updated and estimated on a per-packet basis. These algorithms are necessary in the design of router-based flow control algorithms since on-chip
Static RAM (SRAM) currently is a scarce resource, and being economical with its usage is an important task. A highly scalable method for heavy-hitter identifcation that uses our small active counters architecture is developed based on heuristic argument. Its performance is compared to several state-of-the-art algorithms and shown to out-perform them.
In the last part of the thesis we discuss the delay-utilization tradeoff in the congested Internet links.
While several groups of authors have recently analyzed this tradeoff, the lack of realistic assumption in their models and the extreme complexity in estimation of model parameters, reduces their applicability at real Internet links. We propose an adaptive scheme that regulates the available queue space to keep utilization at desired, high, level. As a consequence, in large-number-of-users regimes, sacrifcing 1-2% of bandwidth can result in queueing delays that are an order of magnitude smaller than in the standard BDP-bu®ering case. We go further and introduce an optimization framework for describing the problem of interest and propose an online algorithm for solving it
Small active counters
The need for efficient counter architecture has
arisen for the following two reasons. Firstly, a number of data streaming algorithms and network management applications require a large number of counters in order to identify important traffic characteristics. And secondly, at high speeds, current memory devices have significant limitations in terms of speed (DRAM) and size (SRAM). For some applications no information on counters is needed on a per-packet basis and several methods have been proposed to handle this problem with low SRAM memory requirements. However, for a number of applications it is essential to have the counter information on every packet arrival.
In this paper we propose two, computationally and memory
efficient, randomized algorithms for approximating the counter values. We prove that proposed estimators are unbiased and give variance bounds. A case study on Multistage Filters (MSF) over the real Internet traces shows a significant improvement by using the active counters architecture
- …