Lazy structure sharing for query optimization

We study lazy structure sharing as a tool for optimizing equivalence testing on complex data types, We investigate a number of strategies for implementing lazy structure sharing and provide upper and lower bounds on their performance (how quickly they effect ideal configurations of our data structure). In most cases when the strategies are applied to a restricted case of the problem, the bounds provide nontrivial improvements over the naive linear-time equivalence-testing strategy that employs no optimization. Only one strategy, however, which employs path compression, seems promising for the most general case of the problem.

Stability and throughput analysis of unslotted CDMA-ALOHA with finite number of users and code sharing

We consider a system comprising a finite number of nodes, with infinite packet buffers, that use unslotted ALOHA with Code Division Multiple Access (CDMA) to share a channel for transmitting packetised data. We propose a simple model for packet transmission and retransmission at each node, and show that saturation throughput in this model yields a sufficient condition for the stability of the packet buffers; we interpret this as the capacity of the access method. We calculate and compare the capacities of CDMA-ALOHA (with and without code sharing) and TDMA-ALOHA; we also consider carrier sensing and collision detection versions of these protocols. In each case, saturation throughput can be obtained via analysis pf a continuous time Markov chain. Our results show how saturation throughput degrades with code-sharing. Finally, we also present some simulation results for mean packet delay. Our work is motivated by optical CDMA in which "chips" can be optically generated, and hence the achievable chip rate can exceed the achievable TDMA bit rate which is limited by electronics. Code sharing may be useful in the optical CDMA context as it reduces the number of optical correlators at the receivers. Our throughput results help to quantify by how much the CDMA chip rate should exceed the TDMA bit rate so that CDMA-ALOHA yields better capacity than TDMA-ALOHA.

Resource Pricing for Fair and Efficient Link Sharing with a Finite Data Model

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. We obtain simple necessary and sufficient conditions on prices such that efficient and fair link sharing is possible. We illustrate the ideas using a simple example

Mutual inhibition and capacity sharing during parallel preparation of serial eye movements

Many common activities, like reading, scanning scenes, or searching for an inconspicuous item in a cluttered environment, entail serial movements of the eyes that shift the gaze from one object to another. Previous studies have shown that the primate brain is capable of programming sequential saccadic eye movements in parallel. Given that the onset of saccades directed to a target are unpredictable in individual trials, what prevents a saccade during parallel programming from being executed in the direction of the second target before execution of another saccade in the direction of the first target remains unclear. Using a computational model, here we demonstrate that sequential saccades inhibit each other and share the brain's limited processing resources (capacity) so that the planning of a saccade in the direction of the first target always finishes first. In this framework, the latency of a saccade increases linearly with the fraction of capacity allocated to the other saccade in the sequence, and exponentially with the duration of capacity sharing. Our study establishes a link between the dual-task paradigm and the ramp-to-threshold model of response time to identify a physiologically viable mechanism that preserves the serial order of saccades without compromising the speed of performance.

Sensitivity enhancement in slice-selective NMR experiments through polarization sharing

The polarization sharing technique is utilized in gradient based slice selective experiments to transfer polarization from unutilized protons to selectively excited protons. This facilitates rapid data acquisition without any customary inter-scan relaxation delay, resulting in an average of 2-fold sensitivity enhancement per unit time.

Association Rule Sharing Model for Privacy Preservation and Collaborative Data Mining Efficiency

The disclosure of information and its misuse in Privacy Preserving Data Mining (PPDM) systems is a concern to the parties involved. In PPDM systems data is available amongst multiple parties collaborating to achieve cumulative mining accuracy. The vertically partitioned data available with the parties involved cannot provide accurate mining results when compared to the collaborative mining results. To overcome the privacy issue in data disclosure this paper describes a Key Distribution-Less Privacy Preserving Data Mining (KDLPPDM) system in which the publication of local association rules generated by the parties is published. The association rules are securely combined to form the combined rule set using the Commutative RSA algorithm. The combined rule sets established are used to classify or mine the data. The results discussed in this paper compare the accuracy of the rules generated using the C4. 5 based KDLPPDM system and the CS. 0 based KDLPPDM system using receiver operating characteristics curves (ROC).

Energy Sharing for Multiple Sensor Nodes With Finite Buffers

We consider the problem of finding optimal energy sharing policies that maximize the network performance of a system comprising of multiple sensor nodes and a single energy harvesting (EH) source. Sensor nodes periodically sense the random field and generate data, which is stored in the corresponding data queues. The EH source harnesses energy from ambient energy sources and the generated energy is stored in an energy buffer. Sensor nodes receive energy for data transmission from the EH source. The EH source has to efficiently share the stored energy among the nodes to minimize the long-run average delay in data transmission. We formulate the problem of energy sharing between the nodes in the framework of average cost infinite-horizon Markov decision processes (MDPs). We develop efficient energy sharing algorithms, namely Q-learning algorithm with exploration mechanisms based on the epsilon-greedy method as well as upper confidence bound (UCB). We extend these algorithms by incorporating state and action space aggregation to tackle state-action space explosion in the MDP. We also develop a cross entropy based method that incorporates policy parameterization to find near optimal energy sharing policies. Through simulations, we show that our algorithms yield energy sharing policies that outperform the heuristic greedy method.

Relative stabilities of condensed face sharing mono- and di-carboranes: CB20H18 and C2B19H18+

The relative energies of triangular face sharing condensed macro polyhedral carboranes: CB20H18 and C2B19H18+ derived from mono- and di-substitution of carbons in (4) B21H18- is calculated at B3LYP/6-31G* level. The relative energies, H center dot center dot center dot H non-bonding distances, NICS values, topological charge analysis and orbital overlap compatibility connotes the face sharing condensed macro polyhedral mono-carboranes, 8 (4-CB20H18) to be the lowest energy isomer. The di-carba- derivative, (36) 4,4'a-C2B19H18+ with carbons substituted in a different B-12 cage in (4) B21H18- in anti-fashion is the most stable isomer among 28 possibilities. This structure has less non-bonding H center dot center dot center dot H interaction and is in agreement with orbital-overlap compatibility, and these two have the pivotal role in deciding the stability of these clusters. An estimate of the inherent stability of these carboranes is made using near-isodesmic equations which show that CB20H18 (8) is in the realm of the possible. (C) 2015 Elsevier B.V. All rights reserved.

Mas-Colell, Whinston and Green Versus Scitovsky on Profit and Utility Maximization

I contrast the theoretical foundation of profit maximization of Mas-Colell, Whinston and Green’s “Microeconomics” against that provided by Scitovsky in a paper of 1943. Whereas Mas-Colell, Whinston and Green try to show that profit maximization can be derived from utility maximization, Scitovsky categorically states the contrary view. I argue, first, that the foundation provided by Mas-Colell, Whinston and Green is not sound and, secondly, that Scitovsky’s line of reasoning opens a better way to model business behavior.

Profit and Cost in "Modern" Post-Marxian Profit Theory: A Case Study from Varian's "Intermediate Microeconomics"

In this paper, I examine the treatment of competitive profit of professor Varian in his textbook on Microeconomics, as a representative of the “modern” post-Marxian view on competitive profit. I show how, on the one hand, Varian defines profit as the surplus of revenues over cost and, thus, as a part of the value of commodities that is not any cost. On the other hand, however, Varian defines profit as a cost, namely, as the opportunity cost of capital, so that, in competitive conditions, the profit or income of capital is determined by the opportunity cost of capital. I argue that this second definition contradicts the first and that it is based on an incoherent conception of opportunity cost.

Profit as Cost versus Profit as Surplus over Cost: A Case Study on Varian's "Intermediate Microeconomics"

On the analysis of Varian’s textbook on Microeconomics, which I take to be a representative of the standard view, I argue that Varian provides two contrary notions of profit, namely, profit as surplus over cost and profit as cost. Varian starts by defining profit as the surplus of revenues over cost and, thus, as the part of the value of commodities that is not any cost; however, he provides a second definition of profit as a cost, namely, as the opportunity cost of capital. I also argue that the definition of competitive profit as the opportunity cost of capital involves a self-contradictory notion of opportunity cost.

Roaming in the Mobile Internet: when coverage sharing agreements call for regulation

Revised: 2006-06