978 resultados para Testing Power
Resumo:
This work describes a test tool that allows to make performance tests of different end-to-end available bandwidth estimation algorithms along with their different implementations. The goal of such tests is to find the best-performing algorithm and its implementation and use it in congestion control mechanism for high-performance reliable transport protocols. The main idea of this paper is to describe the options which provide available bandwidth estimation mechanism for highspeed data transport protocols and to develop basic functionality of such test tool with which it will be possible to manage entities of test application on all involved testing hosts, aided by some middleware.
Resumo:
Today, usability testing in the development of software and systems is essential. A stationary usability lab offers many different possibilities in the evaluation of usability, but it reaches its limits in terms of flexibility and the experimental conditions. Mobile usability studies consider consciously outside influences, and these studies require a specially adapted approach to preparation, implementation and evaluation. Using the example of a mobile eye tracking study the difficulties and the opportunities of mobile testing are considered.
Resumo:
Magdeburg, Univ., Fak. für Verfahrens- und Systemtechnik, Diss., 2014
Resumo:
In this paper the construction of Reed-Solomon RS(255,239) codeword is described and the process of coding and decoding a message is simulated and verified. RS(255,239), or its shortened version RS(224,208) is used as a coding technique in Low-Power Single Carrier (LPSC) physical layer, as described in IEEE 802.11ad standard. The encoder takes 239 8-bit information symbols, adds 16 parity symbols and constructs 255-byte codeword to be transmitted through wireless communication channel. RS(255,239) codeword is defined over Galois Field GF and is used for correcting upto 8 symbol errors. RS(255,239) code construction is fully implemented and Simulink test project is constructed for testing and analyzing purposes.
Resumo:
This article is devoted to the research of VoIP transmission quality over Digital Power Line Carrier channels. Assessment of quality transmission is performed using E-model. Paper considers the possibility of joint using of Digital Power Line carrier equipment with different architecture in one network. As a result of the research, the rule for constructing of multi-segment Digital Power Line Carrier channels was formulated. This rule allows minimizing the transmission delay and saving frequency resources of high voltage Power Line Carrier range.
Resumo:
This article is devoted to the research of channel efficiency for IP-traffic transmission over Digital Power Line Carrier channels. The application of serial WAN connections and header compression as methods to increase channel efficiency is considered. According to the results of the research an effective solution for network traffic transmission in DPLC networks was proposed.
Resumo:
Magdeburg, Univ., Fak. für Wirtschaftswiss., Diss., 2014
Resumo:
[s.c.]
Resumo:
Magdeburg, Univ., Fak. für Wirtschaftswiss., Diss., 2014
Resumo:
The impact of a power plant cooling system in the Bahía Blanca estuary (Argentina) on the survival of target zooplanktonic organisms (copepods and crustacean larvae) and on overall mesozooplankton abundance was evaluated over time. Mortality rates were calculated for juveniles and adults of four key species in the estuary: Acartia tonsa Dana, 1849 and Eurytemora americana Williams, 1906 (native and invading copepods), and larvae of the crab Chasmagnathus granulata Dana, 1851 and the invading cirriped Balanus glandula Darwin, 1854. Mean total mortality values were up to four times higher at the water discharge site than at intake, though for all four species, significant differences were only registered in post-capture mortality. The findings show no evidence of greater larval sensitivity. As expected, the sharpest decrease in overall mesozooplankton abundance was found in areas close to heated water discharge.
Resumo:
We present a computer-assisted analysis of combinatorial properties of the Cayley graphs of certain finitely generated groups: Given a group with a finite set of generators, we study the density of the corresponding Cayley graph, that is, the least upper bound for the average vertex degree (= number of adjacent edges) of any finite subgraph. It is known that an m-generated group is amenable if and only if the density of the corresponding Cayley graph equals to 2m. We test amenable and non-amenable groups, and also groups for which amenability is unknown. In the latter class we focus on Richard Thompson’s group F.
Resumo:
We consider the collective incentives of buyers and sellers to form cartels in markets where trade is realized through decentralized pairwise bargaining. Cartels are coalitions of buyers or sellers that limit market participation and compensate inactive members for abstaining from trade. In a stable market outcome, cartels set Nash equilibrium quantities and cartel memberships are immune to defections. We prove that the set of stable market outcomes is non-empty and we provide its full characterization. Stable market outcomes are of two types: (i) at least one cartel actively restrains trade and the levels of market participation are balanced, or (ii) only one cartel, eventually the cartel that forms on the long side of the market, is active and it reduces trade slightly below the opponent's.
Resumo:
We study whether selection affects motivation. In our experiment subjects first answer a personality questionnaire. They then play a 3-person game. One of the three players decides between an outside option assigning him a positive amount, but leaving the two others empty-handed and allowing one of the other two players to distribute a pie. Treatments differ in the procedure by which distributive power is assigned: to a randomly determined or to a knowingly selected partner. Before making her decision the selecting player could consult the personality questionnaire of the other two players. Results show that knowingly selected players keep less for themselves than randomly selected ones and reward the selecting player more generously.