Cloud Pricing: The Spot Market Strikes Back

Cloud computing providers must constantly hold many idle compute instances available (e.g., for maintenance or for users with long-term contracts). A natural idea, which should intuitively increase the provider’s profit, is to sell these idle instances on a secondary market, for example, via a preemptible spot market. However, this ignores possible “market cannibalization” effects that may occur in equilibrium as well as the additional costs the provider experiences due to preemptions. To study the viability of offering a spot market, we model the provider’s profit optimization problem by combining queuing theory and game theory to analyze the equilibria of the resulting queuing system. Our main result is an easy-to-check condition under which a provider can simultaneously achieve a profit increase and create a Pareto improvement for the users by offering a spot market (using idle resources) alongside a fixed-price market. Finally, we illustrate our results numerically to demonstrate the effects that the provider’s costs and her strategy have on her profit. This paper was accepted by Gabriel Weintraub, revenue management and market analytics.

Improvement of Fast Simplified Successive-Cancellation Decoder for Polar Codes

This paper presents a new latency reduction method for successive-cancellation (SC) decoding of polar codes that performs a frozen-bit checking on the rate-other (R-other) nodes of the Fast Simplified SC (Fast-SSC) pruning tree. The proposed method integrates the Fast-SSC algorithm and the Improved SSC method (frozen-bit checking of the R-other nodes). We apply a recognition-based method to search for as many constituent codes as possible in the decoding tree offline. During decoding, the current node can be decoded directly, if it is a special constituent code; otherwise, the frozen-bit check is executed. If the frozen-bit check condition is satisfied, the operation of the R-other node is the same as that of the rate-one node. In this paper, we prove that the frame error rate (FER) performance of the proposed algorithm is consistent with that of the original SC algorithm. Simulation results show that the proportion of R-other nodes that satisfy the frozen-bit check condition increases with the signal-to-noise-ratio (SNR). Importantly, our proposed method yields a significant reduction in latency compared to those given by existing latency reduction methods. The proposed method solves the problem of high latency for the Improved-SSC method at a high code rate and low SNR, simultaneously.

APLIKASI PENGECEKAN KONDISI KESIAPAN INSTRUMENT DAN EQUIPMENT

In management motor and electro in PT. Semen Gresik Tbk for check condition of instrument and equipment use manual program. For detect condition it user collect many data, that make checking proses not efficient. Now Application program for check condition equipment and instrument make user require data recur that make very much data entry. For check condition of instrument and equipment user have to complete the instrument code. After this application went execute and search the data in database of application. After the data is finds application will show the data in form in automatic on a scale. Continued, the data is process with application for detect condition of equipment and instrument in ready, no, or the status is warning. Product from this examination is application program for check condition of instrument and equipment to PT. Semen Gresik Tbk this program give information from condition of instrument and equipment every time and this report in graph. Keyword: Application program, Checking condition, Equipment, Instrument, Graph

SPECTRAL SELF-AFFINE MEASURES IN $\mathbb{R}^N$

The aim of this paper is to investigate and study the possible spectral pair $(\mu_{M,D},\varLambda(M,S))$ associated with the iterated function systems $\{\phi_{d}(x)= M^{-1}(x+d)\}_{d\in D}$ and $\{\psi_{s}(x)=M^{\ast}x+s\}_{s\in S}$ in $\mathbb{R}^n$. For a large class of self-affine measures $\mu_{M,D}$, we obtain an easy check condition for $\varLambda(M,S)$ not to be a spectrum, and answer a question of whether we have such a spectral pair $(\mu_{M,D},\varLambda(M,S))$ in the Eiffel Tower or three-dimensional Sierpinski gasket. Further generalization of the given condition as well as some elementary properties of compatible pairs and spectral pairs are discussed. Finally, we give several interesting examples to illustrate the spectral pair conditions considered here.

ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS

We study the problem of constructing infinite words having a prescribed finite set P of palindromes. We first establish that the language of all words with palindromic factors in P is rational. As a consequence we derive that there exists, with some additional mild condition, infinite words having P as palindromic factors. We prove that there exist periodic words having the maximum number of palindromes as in the case of Sturmian words, by providing a simple and easy to check condition. Asymmetric words, those that are not the product of two palindromes, play a fundamental role and an enumeration is provided.

Orientation-Specific Visual Evoked Potential Deficits in Multiple Sclerosis

SUMMARY:Checkerboard pattern reversal visual evoked potentials (VEPs) have proved useful in the confirmation of optic nerve disease in patients with multiple sclerosis (MS). Recently, evidence of orientation-specific loss in contrast sensitivity and the presence of orientation-specific visual evoked potential (VEP) deficits in MS patients has been obtained using sinusoidal gratings as stimuli. This study reports the presence of orientation-specific VEP delay in MS using the conventional checkerboard pattern presented in two orientations: normally oriented (check condition) or diagonally oriented (diamond condition).Peak latency values of the N70 and P100 components of the VEP were statistically analyzed using appropriate ANOVA and nonparametric statistics. As a group MS patients showed significant VEP delays under check and diamond pattern conditions. However, individual subject analysis revealed that about 20% of the MS population show VEP delay to only one pattern orientation. It was shown that by including a diamond pattern condition the diagnostic yield of VEP delay in these clinically definite MS patients was increased 11% over that obtained with check stimulation alone.