Power control and transmission scheduling for network utility maximization in wireless networks

We consider a joint power control and transmission scheduling problem in wireless networks with average power constraints. While the capacity region of a wireless network is convex, a characterization of this region is a hard problem. We formulate a network utility optimization problem involving time-sharing across different "transmission modes," where each mode corresponds to the set of power levels used in the network. The structure of the optimal solution is a time-sharing across a small set of such modes. We use this structure to develop an efficient heuristic approach to finding a suboptimal solution through column generation iterations. This heuristic approach converges quite fast in simulations, and provides a tool for wireless network planning.

Incentive Compatible Influence Maximization in Social Networks with Application to Viral Marketing

Information diffusion and influence maximization are important and extensively studied problems in social networks. Various models and algorithms have been proposed in the literature in the context of the influence maximization problem. A crucial assumption in all these studies is that the influence probabilities are known to the social planner. This assumption is unrealistic since the influence probabilities are usually private information of the individual agents and strategic agents may not reveal them truthfully. Moreover, the influence probabilities could vary significantly with the type of the information flowing in the network and the time at which the information is propagating in the network. In this paper, we use a mechanism design approach to elicit influence probabilities truthfully from the agents. Our main contribution is to design a scoring rule based mechanism in the context of the influencer-influencee model. In particular, we show the incentive compatibility of the mechanisms and propose a reverse weighted scoring rule based mechanism as an appropriate mechanism to use.

Fuzzy optimization model for water quality management of a river system - Closure

A fuzzy waste-load allocation model, FWLAM, is developed for water quality management of a river system using fuzzy multiple-objective optimization. An important feature of this model is its capability to incorporate the aspirations and conflicting objectives of the pollution control agency and dischargers. The vagueness associated with specifying the water quality criteria and fraction removal levels is modeled in a fuzzy framework. The goals related to the pollution control agency and dischargers are expressed as fuzzy sets. The membership functions of these fuzzy sets are considered to represent the variation of satisfaction levels of the pollution control agency and dischargers in attaining their respective goals. Two formulations—namely, the MAX-MIN and MAX-BIAS formulations—are proposed for FWLAM. The MAX-MIN formulation maximizes the minimum satisfaction level in the system. The MAX-BIAS formulation maximizes a bias measure, giving a solution that favors the dischargers. Maximization of the bias measure attempts to keep the satisfaction levels of the dischargers away from the minimum satisfaction level and that of the pollution control agency close to the minimum satisfaction level. Most of the conventional water quality management models use waste treatment cost curves that are uncertain and nonlinear. Unlike such models, FWLAM avoids the use of cost curves. Further, the model provides the flexibility for the pollution control agency and dischargers to specify their aspirations independently.

Practical Algorithms For Mean Velocity Estimation In Pulse Doppler Weather Radars Using A Small Number Of Samples

Doppler weather radars with fast scanning rates must estimate spectral moments based on a small number of echo samples. This paper concerns the estimation of mean Doppler velocity in a coherent radar using a short complex time series. Specific results are presented based on 16 samples. A wide range of signal-to-noise ratios are considered, and attention is given to ease of implementation. It is shown that FFT estimators fare poorly in low SNR and/or high spectrum-width situations. Several variants of a vector pulse-pair processor are postulated and an algorithm is developed for the resolution of phase angle ambiguity. This processor is found to be better than conventional processors at very low SNR values. A feasible approximation to the maximum entropy estimator is derived as well as a technique utilizing the maximization of the periodogram. It is found that a vector pulse-pair processor operating with four lags for clear air observation and a single lag (pulse-pair mode) for storm observation may be a good way to estimate Doppler velocities over the entire gamut of weather phenomena.

Renormalization of the axial-vector current in QCD

Following the method of Ioffe and Smilga, the propagation of the baryon current in an external constant axial-vector field is considered. The close similarity of the operator-product expansion with and without an external field is shown to arise from the chiral invariance of gauge interactions in perturbation theory. Several sum rules corresponding to various invariants both for the nucleon and the hyperons are derived. The analysis of the sum rules is carried out by two independent methods, one called the ratio method and the other called the continuum method, paying special attention to the nondiagonal transitions induced by the external field between the ground state and excited states. Up to operators of dimension six, two new external-field-induced vacuum expectation values enter the calculations. Previous work determining these expectation values from PCAC (partial conservation of axial-vector current) are utilized. Our determination from the sum rules of the nucleon axial-vector renormalization constant GA, as well as the Cabibbo coupling constants in the SU3-symmetric limit (ms=0), is in reasonable accord with the experimental values. Uncertainties in the analysis are pointed out. The case of broken flavor SU3 symmetry is also considered. While in the ratio method, the results are stable for variation of the fiducial interval of the Borel mass parameter over which the left-hand side and the right-hand side of the sum rules are matched, in the continuum method the results are less stable. Another set of sum rules determines the value of the linear combination 7F-5D to be ≊0, or D/(F+D)≊(7/12). .AE

On states, on a lattice, with half-integral charge

In certain molecular models, and related one-dimensional field theories, localized objects appear with half-integral expectation values of charge. We consider whether these states are eigenstates of charge, with half-integral eigenvalue. We find that it is indeed so for a suitably diffuse definition of the charge operator in question. This diffuse charge operator has a spectrum which approaches a continuum. The analysis is made on a lattice, to avoid divergence ambiguities, and on a finite length, which is only subsequently made large. The half-integral charge phenomenon is not tied to solitons, but can also arise as an end effect.

Distributed Scheduling for Multi-Hop Wireless Networks

We study the performance of greedy scheduling in multihop wireless networks where the objective is aggregate utility maximization. Following standard approaches, we consider the dual of the original optimization problem. Optimal scheduling requires selecting independent sets of maximum aggregate price, but this problem is known to be NP-hard. We propose and evaluate a simple greedy heuristic. We suggest how the greedy heuristic can be implemented in a distributed manner. We evaluate an analytical bound in detail, for the special case of a line graph and also provide a loose bound on the greedy heuristic for the case of an arbitrary graph.

On the axiomatic approach to the maximum entropy principle of inference

Recent axiomatic derivations of the maximum entropy principle from consistency conditions are critically examined. We show that proper application of consistency conditions alone allows a wider class of functionals, essentially of the form ∝ dx p(x)[p(x)/g(x)] s , for some real numbers, to be used for inductive inference and the commonly used form − ∝ dx p(x)ln[p(x)/g(x)] is only a particular case. The role of the prior densityg(x) is clarified. It is possible to regard it as a geometric factor, describing the coordinate system used and it does not represent information of the same kind as obtained by measurements on the system in the form of expectation values.

On solitons with half integral charge

Can certain soliton states, with half integral expectation value of charge, be also eigenstates of charge X with half integral eigenvalue? It can be so only with a somewhat sophisticated definition of charge.

Anisochrony of O-methylene protons of ethyl ester functions and structural factors in the connected chiral entities

(i) Incistrans pairs of cyclic 1,3-dicarboxylic acid ethyl esters thecis-foms exhibit higher O-methylene proton (HA, HB) anisochrony than thetrans-forms; (ii) anisochrony, easily observed in certain decalin-10-carboxylic ethyl esters, ‘disappears’ on one of the rings attaining the possibility of transforming into a ‘twist’ form; (iii) in certain pairs of chiralsecethyl esters and theirtert-methylated analogues anisochrony is higher in the latter, contrary to expectation, while, in certain others, the reverse is observed. Attempted explanations are based on assessments whether H A and H B are or are not in highly different magnetic environments in confomers regarded as preferred. This subsumes the possibility thatXYZC-CO2H A H B Me chiral ethyl acetates differ fromXYZC-CH A H B Me ethanes because intervention by the carboxyl group insulates the prochiral centre and allows anisotropic effects to gain somewhat in importance among mechanisms that discriminate between H A and H B so long as rotamerpopulation inequalities persist. Background information on why rotamer-population inequalities will always persist and on a heuristic that attempts to generalize the effects ofXYZ inXYZC - CU AUB V is provided. Possible effects when connectivity exists between a pair amongX, Y, Z or when specific interactions occur betweenV andX, Y orZ are considered. An interpretation in terms of ‘increasing conformational mobility’ has been suggested for the observed increase in the rate of temperature-dependence of O-methylene anisochrony down a series of chiral ethyl esters.

Constrained linear minimax filter for systems with large plant uncertainties

This paper presents a method of designing a minimax filter in the presence of large plant uncertainties and constraints on the mean squared values of the estimates. The minimax filtering problem is reformulated in the framework of a deterministic optimal control problem and the method of solution employed, invokes the matrix Minimum Principle. The constrained linear filter and its relation to singular control problems has been illustrated. For the class of problems considered here it is shown that the filter can he constrained separately after carrying out the mini maximization. Numorieal examples are presented to illustrate the results.

Synthetic polypeptide with antifreeze activity

MUCH information has been gathered in recent years on the so-called 'antifreeze' proteins which lower the freezing point of the serum of certain marine fishes living in sub-zero water temperatures1−4. The proteins from the Antarctic fish Trematomus borchgrevinki are glycoproteins with a repeating alanyl-alanyl-threonyl tripeptide sequence, the threonyl residue being linked to a disaccharide1,2. In contrast, the antifreeze protein from the winter flounder Pseudopleuronectus americanus in the North American Atlantic coastal region is made up of eight ammo acids with no apparent repeating sequence of the residues and no sugar moiety (ref. 4 and unpublished work of C. L. Hew, C. C. Yip & G. Fletcher). The antifreeze activity of these proteins is not compatible with the known colligative properties of solutes in solution and the mechanism of their action is not yet fully understood. But a common feature of both types of the antifreeze proteins is the preponderance of alanine which accounts for over 60% of the total amino residues. This fact, together with the absence of the carbohydrate in the protein from the winter flounder, prompted us to attempt the synthesis of polypeptide analogues having comparable proportions of alanine in them along with suitable other amino acids. As a first step, we made use of the lack of any obvious periodicity in the distribution of the alanyl residues in the flounder's protein and attempted the synthesis of a random copolypeptide containing about 65 mol % of alanine and 35 mol % of aspartic acid. The choice of aspartic acid was made on the basis of its being the next major amino acid in the flounder's protein3,4 and on the expectation that its polar character will help the water-solubility of the alanine-rich copolypeptide, as in other studies on alanine-containing random copolymers. In addition, Duman and DeVries4 have earlier indicated the involvement of carboxyl groups on the antifreeze activity by chemical modification studies. We report here the synthesis of this polypeptide and show that it possesses antifreeze activity.

Launch Envelope Optimization of Virtual Sliding Target Guidance Scheme

This paper presents an optimization of the performance of a recently proposed virtual sliding target (VST) guidance scheme in terms of maximization of its launch envelope for three- dimensional (3-D) engagements. The objective is to obtain the launch envelope of the missile using the VST guidance scheme for different lateral launch angles with respect to the line of sight (LOS) and demonstrate its superiority over kinematics-based guidance laws like proportional navigation (PN). The VST scheme uses PN as its basic guidance scheme and exploits the relation between the atmospheric properties, missile aerodynamic characteristics, and the optimal trajectory of the missile. The missile trajectory is shaped by controlling the instantaneous position and the speed of a virtual target which the missile pursues during the midcourse phase. In the proposed method it is shown that an appropriate value of initial position for the virtual target in 3-D, combined with optimized virtual target parameters, can significantly improve the launch envelope performance. The paper presents the formulation of the optimization problem, obtains the approximate models used to make the optimization problem more tractable, and finally presents the optimized performance of the missile in terms of launch envelope and shows significant improvement over kinematic-based guidance laws. The paper also proposes modification to the basic VST scheme. Some simulations using the full-fledged six degrees-of-freedom (6-DOF) models are also presented to validate the models and technique used.

Power Minimization for CDMA under Colored Noise

Rate-constrained power minimization (PMIN) over a code division multiple-access (CDMA) channel with correlated noise is studied. PMIN is. shown to be an instance of a separable convex optimization problem subject to linear ascending constraints. PMIN is further reduced to a dual problem of sum-rate maximization (RMAX). The results highlight the underlying unity between PMIN, RMAX, and a problem closely related to PMIN but with linear receiver constraints. Subsequently, conceptually simple sequence design algorithms are proposed to explicitly identify an assignment of sequences and powers that solve PMIN. The algorithms yield an upper bound of 2N - 1 on the number of distinct sequences where N is the processing gain. The sequences generated using the proposed algorithms are in general real-valued. If a rate-splitting and multi-dimensional CDMA approach is allowed, the upper bound reduces to N distinct sequences, in which case the sequences can form an orthogonal set and be binary +/- 1-valued.

Popular Mixed Matchings

We study the problem of matching applicants to jobs under one-sided preferences: that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be rnore popular than T if the applicants that prefer M to T outnumber those that prefer T to M. A matching is said to be popular if there is no matching more popular than it. Equivalently, a matching M is popular if phi(M,T) >= phi(T, M) for all matchings T, where phi(X, Y) is the number of applicants that prefer X to Y. Previously studied solution concepts based oil the popularity criterion are either not guaranteed to exist for every instance (e.g., popular matchings) or are NP-hard to compute (e.g., least unpopular matchings). This paper addresses this issue by considering mixed matchings. A mixed matching is simply a probability distributions over matchings in the input graph. The function phi that compares two matchings generalizes in a natural manner to mixed matchings by taking expectation. A mixed matching P is popular if phi(P,Q) >= phi(Q,P) for all mixed matchings Q. We show that popular mixed matchings always exist. and we design polynomial time algorithms for finding them. Then we study their efficiency and give tight bounds on the price of anarchy and price of stability of the popular matching problem.