An analytical model for performance evaluation of multimedia applications over EDCA in an IEEE 802.11e WLAN

We extend the modeling heuristic of (Harsha et al. 2006. In IEEE IWQoS 06, pp 178 - 187) to evaluate the performance of an IEEE 802.11e infrastructure network carrying packet telephone calls, streaming video sessions and TCP controlled file downloads, using Enhanced Distributed Channel Access (EDCA). We identify the time boundaries of activities on the channel (called channel slot boundaries) and derive a Markov Renewal Process of the contending nodes on these epochs. This is achieved by the use of attempt probabilities of the contending nodes as those obtained from the saturation fixed point analysis of (Ramaiyan et al. 2005. In Proceedings ACM Sigmetrics, `05. Journal version accepted for publication in IEEE TON). Regenerative analysis on this MRP yields the desired steady state performance measures. We then use the MRP model to develop an effective bandwidth approach for obtaining a bound on the size of the buffer required at the video queue of the AP, such that the streaming video packet loss probability is kept to less than 1%. The results obtained match well with simulations using the network simulator, ns-2. We find that, with the default IEEE 802.11e EDCA parameters for access categories AC 1, AC 2 and AC 3, the voice call capacity decreases if even one streaming video session and one TCP file download are initiated by some wireless station. Subsequently, reducing the voice calls increases the video downlink stream throughput by 0.38 Mbps and file download capacity by 0.14 Mbps, for every voice call (for the 11 Mbps PHY). We find that a buffer size of 75KB is sufficient to ensure that the video packet loss probability at the QAP is within 1%.

Discrete parameter simulation optimization algorithms with applications to admission control with dependent service times

We propose certain discrete parameter variants of well known simulation optimization algorithms. Two of these algorithms are based on the smoothed functional (SF) technique while two others are based on the simultaneous perturbation stochastic approximation (SPSA) method. They differ from each other in the way perturbations are obtained and also the manner in which projections and parameter updates are performed. All our algorithms use two simulations and two-timescale stochastic approximation. As an application setting, we consider the important problem of admission control of packets in communication networks under dependent service times. We consider a discrete time slotted queueing model of the system and consider two different scenarios - one where the service times have a dependence on the system state and the other where they depend on the number of arrivals in a time slot. Under our settings, the simulated objective function appears ill-behaved with multiple local minima and a unique global minimum characterized by a sharp dip in the objective function in a small region of the parameter space. We compare the performance of our algorithms on these settings and observe that the two SF algorithms show the best results overall. In fact, in many cases studied, SF algorithms converge to the global minimum.

Book Review: "The Interface: IBM and the Transformation of Corporate Design, 1945-1975", John Harwood, Minneapolis: University of Minnesota Press, 2011

Within the history of twentieth-century design, there are a number of well-known objects and stories that are invoked time and time again to capture a pivotal moment or summarize a much broader historical transition. For example, Marcel Breuer’s Model B3 chair is frequently used as a stand-in for the radical investigations of form and new industrial materials occurring at the Bauhaus in the mid-1920s. Similarly, Raymond Loewy’s streamlined pencil sharpener has become historical shorthand for the emergence of modern industrial design in the 1930s. And any discussion of the development of American postwar “organic design” seems incomplete without reference to Charles and Ray Eames’s molded plywood leg splint of 1942. Such objects and narratives are dear to historians of modern design. They are tangible, photogenic subjects that slot nicely into exhibitions, historical surveys, and coffee-table best sellers...

Analytical models for capacity estimation of IEEE 802.11 WLANs using DCF for internet applications

We provide analytical models for capacity evaluation of an infrastructure IEEE 802.11 based network carrying TCP controlled file downloads or full-duplex packet telephone calls. In each case the analytical models utilize the attempt probabilities from a well known fixed-point based saturation analysis. For TCP controlled file downloads, following Bruno et al. (In Networking '04, LNCS 2042, pp. 626-637), we model the number of wireless stations (STAs) with ACKs as a Markov renewal process embedded at packet success instants. In our work, analysis of the evolution between the embedded instants is done by using saturation analysis to provide state dependent attempt probabilities. We show that in spite of its simplicity, our model works well, by comparing various simulated quantities, such as collision probability, with values predicted from our model. Next we consider N constant bit rate VoIP calls terminating at N STAs. We model the number of STAs that have an up-link voice packet as a Markov renewal process embedded at so called channel slot boundaries. Analysis of the evolution over a channel slot is done using saturation analysis as before. We find that again the AP is the bottleneck, and the system can support (in the sense of a bound on the probability of delay exceeding a given value) a number of calls less than that at which the arrival rate into the AP exceeds the average service rate applied to the AP. Finally, we extend the analytical model for VoIP calls to determine the call capacity of an 802.11b WLAN in a situation where VoIP calls originate from two different types of coders. We consider N-1 calls originating from Type 1 codecs and N-2 calls originating from Type 2 codecs. For G711 and G729 voice coders, we show that the analytical model again provides accurate results in comparison with simulations.

Optimal sleep-wake scheduling for quickest intrusion detection using sensor networks

We consider the problem of quickest detection of an intrusion using a sensor network, keeping only a minimal number of sensors active. By using a minimal number of sensor devices, we ensure that the energy expenditure for sensing, computation and communication is minimized (and the lifetime of the network is maximized). We model the intrusion detection (or change detection) problem as a Markov decision process (MDP). Based on the theory of MDP, we develop the following closed loop sleep/wake scheduling algorithms: (1) optimal control of Mk+1, the number of sensors in the wake state in time slot k + 1, (2) optimal control of qk+1, the probability of a sensor in the wake state in time slot k + 1, and an open loop sleep/wake scheduling algorithm which (3) computes q, the optimal probability of a sensor in the wake state (which does not vary with time), based on the sensor observations obtained until time slot k. Our results show that an optimum closed loop control on Mk+1 significantly decreases the cost compared to keeping any number of sensors active all the time. Also, among the three algorithms described, we observe that the total cost is minimum for the optimum control on Mk+1 and is maximum for the optimum open loop control on q.

An analytical model for the capacity estimation of combined VoIP and TCP file transfers over EDCA in an IEEE 802.11e WLAN

In this paper we develop and numerically explore the modeling heuristic of using saturation attempt probabilities as state dependent attempt probabilities in an IEEE 802.11e infrastructure network carrying packet telephone calls and TCP controlled file downloads, using Enhanced Distributed Channel Access (EDCA). We build upon the fixed point analysis and performance insights in [1]. When there are a certain number of nodes of each class contending for the channel (i.e., have nonempty queues), then their attempt probabilities are taken to be those obtained from saturation analysis for that number of nodes. Then we model the system queue dynamics at the network nodes. With the proposed heuristic, the system evolution at channel slot boundaries becomes a Markov renewal process, and regenerative analysis yields the desired performance measures.The results obtained from this approach match well with ns2 simulations. We find that, with the default IEEE 802.11e EDCA parameters for AC 1 and AC 3, the voice call capacity decreases if even one file download is initiated by some station. Subsequently, reducing the voice calls increases the file download capacity almost linearly (by 1/3 Mbps per voice call for the 11 Mbps PHY).

Performance analysis of a slotted-ALOHA protocol on a capture channel with fading

We consider the slotted ALOHA protocol on a channel with a capture effect. There are M slot, i packets are transmitted, then the probability of a successful reception of a packet is q(i). This model contains the CDMA protocols as special cases. We obtain sufficient rate conditions, which are close to necessary for stability of the system, when the arrival streams are stationary ergodic. Under the same rate conditions, for general regenerative arrival streams, we obtain the rates of convergence to stationarity, finiteness of stationary moments and various functional limit theorems. Our arrival streams contain all the traffic models suggested in the recent literature, including the ones which display long range dependence. We also obtain bounds on the stationary moments of waiting times which can be tight under realistic conditions. Finally, we obtain several results on the transient performance of the system, e.g., first time to overflow and the limits of the overflow process. We also extend the above results to the case of a capture channel exhibiting Markov modulated fading. Most of our results and proofs will be shown to hold also for the slotted ALOHA protocol without capture.

Accelerating Waves in Polar Coronal Holes as Seen by EIS and SUMER

We present EIS/Hinode and SUMER/SOHO observations of propagating disturbances detected in coronal lines in inter-plume and plume regions of a polar coronal hole. The observation was carried out on 2007 November 13 as part of the JOP196/HOP045 program. The SUMER spectroscopic observation gives information about fluctuations in radiance and on both resolved (Doppler shift) and unresolved (Doppler width) line-of-sight velocities, whereas EIS 40 `'wide slot images detect fluctuations only in radiance but maximize the probability of overlapping field of view between the two instruments. From distance-time radiance maps, we detect the presence of propagating waves in a polar inter-plume region with a period of 15-20 minutes and a propagation speed increasing from 130 +/- 14 km s(-1) just above the limb to 330 +/- 140 km s(-1) around 160 `' above the limb. These waves can be traced to originate from a bright region of the on-disk part of the coronal hole where the propagation speed is in the range of 25 +/- 1.3 to 38 +/- 4.5 km s(-1), with the same periodicity. These on-disk bright regions can be visualized as the base of the coronal funnels. The adjacent plume region also shows the presence of propagating disturbances with the same range of periodicity but with propagation speeds in the range of 135 +/- 18 to 165 +/- 43 km s(-1) only. A comparison between the distance-time radiance map of the two regions indicates that the waves within the plumes are not observable (may be getting dissipated) far off-limb, whereas this is not the case in the inter-plume region. A correlation analysis was also performed to find out the time delay between the oscillations at several heights in the off-limb region, finding results consistent with those from the analysis of the distance-timemaps. To our knowledge, this result provides first spectroscopic evidence of the acceleration of propagating disturbances in the polar region close to the Sun (within 1.2 R/R-circle dot), which provides clues to the understanding of the origin of these waves. We suggest that the waves are likely either Alfvenic or fast magnetoacoustic in the inter-plume region and slow magnetoacoustic in the plume region. This may lead to the conclusion that inter-plumes are a preferred channel for the acceleration of the fast solar wind.

Improved prediction of plane transverse jets in supersonic crossflows

THE flowfield due to transverse injection of a round sonic jet into a supersonic flowis a configuration of interest in the design of supersonic combustors or thrust vector control of supersonic jets. The flow is also of fundamental interest because it presents separation from a smooth surface, embedded subsonic regions, curved shear layers, strong shocks, an unusual development of the injected jet into a kidney-shaped streamwise vortex pair, and a wake behind the jet. Although the geometry is simple, the flow is complex and is a good candidate for assessing the behavior of turbulence models for high-speed flow, beginning with the corresponding two-dimensional flow shown in Fig. 1. At the slot, an underexpanded sonic jet expands rapidly into the supersonic crossflow. Expansion waves reflect at the jet boundary, coalesce, and give rise to a Mach surface (Mach disk for round jets).

Optimal Sleep-Wake Policies for an Energy Harvesting Sensor Node

We study a sensor node with an energy harvesting source. In any slot,the sensor node is in one of two modes: Wake or Sleep. The generated energy is stored in a buffer. The sensor node senses a random field and generates a packet when it is awake. These packets are stored in a queue and transmitted in the wake mode using the energy available in the energy buffer. We obtain energy management policies which minimize a linear combination of the mean queue length and the mean data loss rate. Then, we obtain two easily implementable suboptimal policies and compare their performance to that of the optimal policy. Next, we extend the Throughput Optimal policy developed in our previous work to sensors with two modes. Via this policy, we can increase the through put substantially and stabilize the data queue by allowing the node to sleep in some slots and to drop some generated packets. This policy requires minimal statistical knowledge of the system. We also modify this policy to decrease the switching costs.

Elämänmuutoksen, jännityksen ja asiantuntijuuden representointi Veikkaus Oy:n mainonnassa vuosina 1970— 2006

Aim of this master's thesis paper for consumer economics, is to research gambling advertisements in Finland over a period of 35 years, from 1970 to 2006. Veikkaus Oy (later Veikkaus), was founded in 1940, as one of the three licensed gambling organizations in Finland. Material for the current research comprised 1494 advertisements published by Veikkaus in newspapers and magazines at that time. Veikkaus has the exclusive licence to organize lotto games, sport games, instant games and other draw games in Finland. The other two operators, The Finnish Slot Machine Association RAY and Fintoto (on-track horse betting), were not included in the current analysis. This study has been completed according to research contract and grand by the Finnish Foundation for Gaming Research (Pelitoiminnan tutkimussäätiö). In general, advertisements reflect surrounding culture and time, and their message is built on stratified meanings, symbols and codes. Advertising draws the viewer's attention, introduces the advertised subject, and finally, affects the individual's consumption habits. However, advertisements not only work on individual level, but also influence public perception of the advertised product. Firstly, in order to assess gambling as a phenomenon, this paper discusses gambling as consumer behaviour, and also reviews history of gambling in Finland. Winning is a major feature of gambling, and dreaming about positive change of life is a centre of most gambling ads. However, perceived excitement through risk of losing can also be featured in gambling ads. Secondly, this study utilizes Veikkaus’ large advertising archives, were advertising data is analyzed by content analysis and the semiotic analysis. Two methods have been employed to support analyzing outcome in a synergistic way. Content analysis helps to achieve accuracy and comprehensiveness. Semiotic analysis allows deeper and more sensitive analysis to emerged findings and occurrences. It is important to understand the advertised product, as advertising is bound to the culture and time. Hence, to analyze advertising, it is important to understand the environment where the ads appear. Content analysis of Veikkaus data discovered the main gambling and principal advertisement style for each.period. Interestingly, nearly half of Veikkaus’ advertisements promoted topic other than “just winning the bet”. Games of change, like Lotto, typically advertised indirectly represented dreams about winning. In the category of skill gambling, features were represented as investment, and the excitement of sporting expertise was emphasized. In addition, there were a number of gambling ads that emphasize social responsibility of Veikkaus as a government guided organization. Semiotic methods were employed to further elaborate on findings of content analysis. Dreaming in the advertisements was represented by the product of symbols, (e.g. cars and homes) that were found to have significance connection with each other. Thus, advertising represents change of life obtained by the winning. Interestingly, gambling ads promoting jackpots were often representing religious symbolisms. Ads promoting social responsibility were found to be the most common during economical depression of the 90’s. Deeper analysis showed that at that time, advertisements frequently represented depression-related meanings, such as unemployment and bank loans. Skill gaming ads were often represented by sports expertise – late 90’s, their number started sky rocketing, and continued increasing until 2006 (when this study ended). One may conclude that sport betting draws its meanings from the relevant consumer culture, and from the rules and features of the betted sport.

High selectivity miniaturized broadband filter

Design of a compact broadband filter using tightly coupled line sections in defected (A slot is cut in the ground) microstrip medium operating from 3 1-6 8 GHz has been repotted in this article Filter has been designed and analyzed using an equivalent circuit model based on even and odd mock parameters of coupled line sections The proposed filter has attenuation poles on either side of the pass band resulting in improved selectivity This filter features spurious free response up to third harmonic frequency Experimental results of the filter have been validated against the analytical and full wave simulations (C) 2010 Wiley Periodicals Inc Microwave Opt Technol Lett 53 184-187 2011 View this article online at wileyonlinelibrary com DOI 10.1002/mop.25676

Visuaalisen työmuistin vapaasti jaettavat resurssit : muistiedustusten lukumäärä ja tarkkuus ääriviivakuvioilla

According to the most prevalent view, there are 3-4 fixed "slots" in visual working memory for temporary storage. Recently this view has been challenged with a theory of dynamic resources which are restricted in their totality but can be freely allocated. The aim of this study is to clarify which one of the theories better describes the performance in visual working memory tasks with contour shapes. Thus in this study, the interest is in both the number of recalled stimuli and the precision of the memory representations. Stimuli in the experiments were radial frequency patterns, which were constructed by sinusoidally modulating the radius of a circle. Five observers participated in the experiment and it consisted of two different tasks. In the delayed discrimination task the number of recalled stimuli was measured with 2-interval forced choice task. Observer was shown serially two displays with 1, 5 s ISI (inter stimulus interval). Displays contained 1-6 patterns and they differed from each other with changed amplitude in one pattern. The participant s task was to report whether the changed pattern had higher amplitude in the first or in the second interval. The amount of amplitude change was defined with QUEST-procedure and the 75 % discrimination threshold was measured in the task. In the recall task the precision of the memory representations was measured with subjective adjustment method. First, observer was shown 1-6 patterns and after 1, 5 s ISI one location of the previously shown pattern was cued. Observer s task was to adjust amplitude of a probe pattern to match the amplitude of the pattern in working memory. In the delayed discrimination task the performance of all observes declined smoothly when the number of presented patterns was increased. The result supports the resource theory of working memory as there was no sudden fall in the performance. The amplitude threshold for one item was 0.01 0.05 and as the number of items increased from 1 to 6 there was a 4 15 -fold linear increase in the amplitude threshold (0.14 0.29). In the recall adjustment task the precision of four observers performance declined smoothly as the number of presented patterns was increased. The result also supports the resource theory. The standard deviation for one item was 0.03 0.05 and as the number of items increased from 1 to 6 there was a 2 3 -fold linear increase in the amplitude threshold (0.06 0.11). These findings show that the performance in a visual working memory task is described better according to the theory of freely allocated resources and not to the traditional slot-model. In addition, the allocation of the resources depends on the properties of the individual observer and the visual working memory task.

Past Queue Length Based Low-Overhead Link Scheduling in Multi-beam Wireless Mesh Networks

Wireless mesh networks with multi-beam capability at each node through the use of multi-antenna beamforming are becoming practical and attracting increased research attention. Increased capacity due to spatial reuse and increased transmission range are potential benefits in using multiple directional beams in each node. In this paper, we are interested in low-complexity scheduling algorithms in such multi-beam wireless networks. In particular, we present a scheduling algorithm based on queue length information of the past slots in multi-beam networks, and prove its stability. We present a distributed implementation of this proposed algorithm. Numerical results show that significant improvement in delay performance is achieved using the proposed multi-beam scheduling compared to omni-beam scheduling. In addition, the proposed algorithm is shown to achieve a significant reduction in the signaling overhead compared to a current slot queue length approach.

Power Management and Data Rate Maximization in Wireless Energy Harvesting Sensors

This paper considers the problem of power management and throughput maximization for energy neutral operation when using Energy Harvesting Sensors (EHS) to send data over wireless links. It is assumed that the EHS are designed to transmit data at a constant rate (using a fixed modulation and coding scheme) but are power-controlled. A framework under which the system designer can optimize the performance of EHS when the channel is Rayleigh fading is developed. For example, the highest average data rate that can be supported over a Rayleigh fading channel given the energy harvesting capability, the battery power storage efficiency and the maximum allowed transmit energy per slot is derived. Furthermore, the optimum transmission scheme that guarantees a particular data throughput is derived. The usefulness of the framework developed is illustrated through simulation results for specific examples.