Optimal pricing strategies for capacity leasing based on time and volume usage in telecommunication networks

In this study, we use a monopoly pricing model to examine the optimal pricing strategies for “pay-per-time”, “pay-per-volume” and “pay-per both time and volume” based leasing of data networks. Traditionally, network capacity distribution includes short/long term bandwidth and/or usage time leasing. Each consumer has a choice to select volume based, connection-time based or both volume and connection-time based pricing. When customers choose connection-time based pricing, their optimal behavior would be utilizing the bandwidth capacity fully, which can cause network to burst. Also, offering the pay-per-volume scheme to the consumer provides the advantage of leasing the excess capacity to other potential customers serving as network providers. However, volume-based strategies are decreasing the consumers’ interest and usage, because the optimal behaviors of the customers who choose the pay-per-volume pricing scheme generally encourages them to send only enough bytes for time-fixed tasks (for real time applications), causing quality of the task to decrease, which in turn creating an opportunity cost. Choosing pay-per time and volume hybridized pricing scheme allows customers to take advantages of both pricing strategies while decreasing (minimizing) the disadvantages of each, because consumers generally have both time-fixed and size-fixed task such as batch data transactions. However, such a complex pricing policy may confuse and frighten consumers. Therefore, in this study we examined the following two issues: (i) what (if any) are the benefits to the network provider of providing the time and volume hybridized pricing scheme? and (ii) would this offering schema make an impact on the market size? The main contribution of this study is to show that pay-per both time and volume pricing is a viable and often preferable alternative to the only time and/or only volume-based offerings for a large number of customers, and that judicious use of such pricing policy is profitable to the network provider

High-Energy Calculation of K-Shell Ejection Cross-Sections as a Function of Projectile Charge

Journals published by the American Physical Society can be found at http://publish.aps.org

Hydrogen-Atom Excitation and Ionization by Proton Impact in 50-Kev to 200-Kev Energy Region

Journals published by the American Physical Society can be found at http://publish.aps.org

Deflection Effects in Inner-Shell Ionization

Journals published by the American Physical Society can be found at http://publish.aps.org

Inner-Shell Charge-Transfer in Asymmetric Ion-Atom Collisions

Journals published by the American Physical Society can be found at http://publish.aps.org

Automatic Optimization of Alignment Parameters for Tomography Datasets

As tomographic imaging is being performed at increasingly smaller scales, the stability of the scanning hardware is of great importance to the quality of the reconstructed image. Instabilities lead to perturbations in the geometrical parameters used in the acquisition of the projections. In particular for electron tomography and high-resolution X-ray tomography, small instabilities in the imaging setup can lead to severe artifacts. We present a novel alignment algorithm for recovering the true geometrical parameters \emph{after} the object has been scanned, based on measured data. Our algorithm employs an optimization algorithm that combines alignment with reconstruction. We demonstrate that problem-specific design choices made in the implementation are vital to the success of the method. The algorithm is tested in a set of simulation experiments. Our experimental results indicate that the method is capable of aligning tomography datasets with considerably higher accuracy compared to standard cross-correlation methods