Feedback Overhead-Aware, Distributed, Fast, and Reliable Selection

In a communication system in which K nodes communicate with a central sink node, the following problem of selection often occurs. Each node maintains a preference number called a metric, which is not known to other nodes. The sink node must find the `best' node with the largest metric. The local nature of the metrics requires the selection process to be distributed. Further, the selection needs to be fast in order to increase the fraction of time available for data transmission using the selected node and to handle time-varying environments. While several selection schemes have been proposed in the literature, each has its own shortcomings. We propose a novel, distributed selection scheme that generalizes the best features of the timer scheme, which requires minimal feedback but does not guarantee successful selection, and the splitting scheme, which requires more feedback but guarantees successful selection. The proposed scheme introduces several new ideas into the design of the timer and splitting schemes. It explicitly accounts for feedback overheads and guarantees selection of the best node. We analyze and optimize the performance of the scheme and show that it is scalable, reliable, and fast. We also present new insights about the optimal timer scheme.

Smoothed functional and Quasi-Newton algorithms for routing in multi-stage queueing network with constraints

We consider the problem of optimal routing in a multi-stage network of queues with constraints on queue lengths. We develop three algorithms for probabilistic routing for this problem using only the total end-to-end delays. These algorithms use the smoothed functional (SF) approach to optimize the routing probabilities. In our model all the queues are assumed to have constraints on the average queue length. We also propose a novel quasi-Newton based SF algorithm. Policies like Join Shortest Queue or Least Work Left work only for unconstrained routing. Besides assuming knowledge of the queue length at all the queues. If the only information available is the expected end-to-end delay as with our case such policies cannot be used. We also give simulation results showing the performance of the SF algorithms for this problem.

Stochastic optimization for adaptive labor staffing in service systems

Service systems are labor intensive. Further, the workload tends to vary greatly with time. Adapting the staffing levels to the workloads in such systems is nontrivial due to a large number of parameters and operational variations, but crucial for business objectives such as minimal labor inventory. One of the central challenges is to optimize the staffing while maintaining system steady-state and compliance to aggregate SLA constraints. We formulate this problem as a parametrized constrained Markov process and propose a novel stochastic optimization algorithm for solving it. Our algorithm is a multi-timescale stochastic approximation scheme that incorporates a SPSA based algorithm for ‘primal descent' and couples it with a ‘dual ascent' scheme for the Lagrange multipliers. We validate this optimization scheme on five real-life service systems and compare it with a state-of-the-art optimization tool-kit OptQuest. Being two orders of magnitude faster than OptQuest, our scheme is particularly suitable for adaptive labor staffing. Also, we observe that it guarantees convergence and finds better solutions than OptQuest in many cases.

Self-Adapting Peripherally Heterofunctionalized Hyperbranched Polymers: Formation of Janus and Tripodal Structures

A peripherally clickable hyperbranched polyester carrying numerous propargyl terminal groups was prepared by a simple melt transesterification polycondensation of a suitably designed AB(2) monomer; this clickable hyperscaffold was then transformed into a variety of different derivatives by using the Cu-catalyzed azide-yne click reaction. Functionalization of the periphery with equimolar quantities of mutually immiscible segments, such as hydrocarbon, fluorocarbon, and PEG, yielded frustrated molecular systems that readapt and form structures wherein the immiscible segments appear to self-segregate to generate either Janus structures (when two immiscible segments are present) or tripodal structures (when three immiscible segments are present). Evidence for such self-segregation was obtained from a variety of studies, such as differential scanning calorimetry, Langmuir isotherms, AFM imaging, and small-angle X-ray scattering measurements. Crystallization of one or more of the peripheral segments reinforced this self-segregation; the weight-fraction-normalized enthalpies of melting associated with the different domains revealed a competition between the segments to optimize their crystalline organization. When one or more of the segments are amorphous, the remaining segments crystallize more effectively and consequently exhibit a higher melting enthalpy. AFM images of monolayers, transferred from the Langmuir trough, revealed that the thickness matches the expected values; furthermore, contact angle measurements clearly demonstrated that the monolayer films are fairly hydrophobic, and in the case of the tripodal hybramers, the presence of domains of hydrocarbon and fluorocarbon appears to impart nanoscale chemical heterogeneity that is reflected in the strong hysteresis in the advancing and receding contact angles.

Energy-efficient training for antenna selection in time-varying channels

Training for receive antenna selection (AS) differs from that for conventional multiple antenna systems because of the limited hardware usage inherent in AS. We analyze and optimize the performance of a novel energy-efficient training method tailored for receive AS. In it, the transmitter sends not only pilots that enable the selection process, but also an extra pilot that leads to accurate channel estimates for the selected antenna that actually receives data. For time-varying channels, we propose a novel antenna selection rule and prove that it minimizes the symbol error probability (SEP). We also derive closed-form expressions for the SEP of MPSK, and show that the considered training method is significantly more energy-efficient than the conventional AS training method.

MEMS based microactuator for microjet applications

The objective of this work is to confirm the possibility of utilization of PolyVinyliDeneFlouride (PVDF) films in MEMS based microactuator for microjet applications. A membrane type microactuator is designed, developed, packaged and tested. The microactuator consists of PVDF film attached to thin Silicon diaphragm. As the voltage difference is applied across it, due to the piezoelectric behaviour, it deforms primarily in d31 mode, which in turn deflects the diaphragm. Using finite element methods, coupled field analysis is carried out to optimize the dimensions of the actuator with respect to the output force and input voltage. A cavity with a square diaphragm of 1mm×1mm×5μm is realized using standard microfabrication technique. 50μm thick PVDF film, cut with special dicing saw, is glued inside the metalized cavity using low stress, conductive, room temperature cured epoxy. The 3mm×3mm×0.675mm actuator die is packaged using Chip-On-Board technique in conjunction with low temperature soldering for taking the connections. The micro-actuator is tested in both actuation and sensing mode. The developed actuator is proposed to use with micro nozzle to study the utilization in drug delivery system.

Reactive power and voltage control in grid connected wind farms

Wind power, as an alternative to fossil fuels, is plentiful, renewable, widely distributed, clean, produces no greenhouse gas emissions during operation, and uses little land. In operation, the overall cost per unit of energy produced is similar to the cost for new coal and natural gas installations. However, the stochastic behaviour of wind speeds leads to significant disharmony between wind energy production and electricity demand. Wind generation suffers from an intermittent characteristics due to the own diurnal and seasonal patterns of the wind behaviour. Both reactive power and voltage control are important under varying operating conditions of wind farm. To optimize reactive power flow and to keep voltages in limit, an optimization method is proposed in this paper. The objective proposed is minimization of the voltage deviations of the load buses (Vdesired). The approach considers the reactive power limits of wind generators and co-ordinates the transformer taps. This algorithm has been tested under practically varying conditions simulated on a test system. The results are obtained on a system of 50-bus real life equivalent power network. The result shows the efficiency of the proposed method.

Internal defect and process parameter analysis during friction stir welding of Al 6061 sheets

Welding parameters like welding speed, rotation speed, plunge depth, shoulder diameter etc., influence the weld zone properties, microstructure of friction stir welds, and forming behavior of welded sheets in a synergistic fashion. The main aims of the present work are to (1) analyze the effect of welding speed, rotation speed, plunge depth, and shoulder diameter on the formation of internal defects during friction stir welding (FSW), (2) study the effect on axial force and torque during welding, (c) optimize the welding parameters for producing internal defect-free welds, and (d) propose and validate a simple criterion to identify defect-free weld formation. The base material used for FSW throughout the work is Al 6061T6 having a thickness value of 2.1 mm. Only butt welding of sheets is aimed in the present work. It is observed from the present analysis that higher welding speed, higher rotation speed, and higher plunge depth are preferred for producing a weld without internal defects. All the shoulder diameters used for FSW in the present work produced defect-free welds. The axial force and torque are not constant and a large variation is seen with respect to FSW parameters that produced defective welds. In the case of defect-free weld formation, the axial force and torque are relatively constant. A simple criterion, (a,tau/a,p)(defective) > (a,tau/a,p)(defect free) and (a,F/a,p)(defective) > (a,F/a,p)(defect free), is proposed with this observation for identifying the onset of defect-free weld formation. Here F is axial force, tau is torque, and p is welding speed or tool rotation speed or plunge depth. The same criterion is validated with respect to Al 5xxx base material. Even in this case, the axial force and torque remained constant while producing defect-free welds.

Optimization of thermoacoustic refrigerator using response surface methodology

Thermoacoustic refrigerator (TAR) converts acoustic waves into heat without any moving parts. The study presented here aims to optimize the parameters like frequency, stack position, stack length, and plate spacing involving in designing TAR using the Response Surface Methodology (RSM). A mathematical model is developed using the RSM based on the results obtained from DeltaEC software. For desired temperature difference of 40 K, optimized parameters suggested by the RSM are the frequency 254 Hz, stack position 0.108 m, stack length 0.08 m, and plate spacing 0.0005 m. The experiments were conducted with optimized parameters and simulations were performed using the Design Environment for Low-amplitude ThermoAcoustic Energy Conversion (DeltaEC) which showed similar results.

Channel training signal design for reciprocal multiple antenna systems with beamforming

Fast and efficient channel estimation is key to achieving high data rate performance in mobile and vehicular communication systems, where the channel is fast time-varying. To this end, this work proposes and optimizes channel-dependent training schemes for reciprocal Multiple-Input Multiple-Output (MIMO) channels with beamforming (BF) at the transmitter and receiver. First, assuming that Channel State Information (CSI) is available at the receiver, a channel-dependent Reverse Channel Training (RCT) signal is proposed that enables efficient estimation of the BF vector at the transmitter with a minimum training duration of only one symbol. In contrast, conventional orthogonal training requires a minimum training duration equal to the number of receive antennas. A tight approximation to the capacity lower bound on the system is derived, which is used as a performance metric to optimize the parameters of the RCT. Next, assuming that CSI is available at the transmitter, a channel-dependent forward-link training signal is proposed and its power and duration are optimized with respect to an approximate capacity lower bound. Monte Carlo simulations illustrate the significant performance improvement offered by the proposed channel-dependent training schemes over the existing channel-agnostic orthogonal training schemes.

Design and analysis of novel compression fracture specimen with constant form factor: Edge cracked semicircular disk (ECSD)

Inspired by the Brazilian disk geometry we examine the utility of an edge cracked semicircular disk (ECSD) specimen for rapid assessment of fracture toughness of brittle materials using compressive loading. It is desirable to optimize the geometry towards a constant form factor F for evaluating K-I. In this investigation photoelastic and finite element results for K-I evaluation highlight the effect of loading modeled using a Hertzian. A Hertzian loading subtending 4 degrees at the center leads to a surprisingly constant form factor of 1.36. This special case is further analyzed by applying uniform pressure over a chord for facilitating testing.

Joint evaluation of channel feedback schemes, rate adaptation, and scheduling in OFDMA downlinks with feedback delays

Orthogonal frequency-division multiple access (OFDMA) systems divide the available bandwidth into orthogonal subchannels and exploit multiuser diversity and frequency selectivity to achieve high spectral efficiencies. However, they require a significant amount of channel state feedback for scheduling and rate adaptation and are sensitive to feedback delays. We develop a comprehensive analysis for OFDMA system throughput in the presence of feedback delays as a function of the feedback scheme, frequency-domain scheduler, and rate adaptation rule. Also derived are expressions for the outage probability, which captures the inability of a subchannel to successfully carry data due to the feedback scheme or feedback delays. Our model encompasses the popular best-n and threshold-based feedback schemes and the greedy, proportional fair, and round-robin schedulers that cover a wide range of throughput versus fairness tradeoff. It helps quantify the different robustness of the schedulers to feedback overhead and delays. Even at low vehicular speeds, it shows that small feedback delays markedly degrade the throughput and increase the outage probability. Further, given the feedback delay, the throughput degradation depends primarily on the feedback overhead and not on the feedback scheme itself. We also show how to optimize the rate adaptation thresholds as a function of feedback delay.

Feature Search in the Grassmanian in Online Reinforcement Learning

We consider the problem of finding the best features for value function approximation in reinforcement learning and develop an online algorithm to optimize the mean square Bellman error objective. For any given feature value, our algorithm performs gradient search in the parameter space via a residual gradient scheme and, on a slower timescale, also performs gradient search in the Grassman manifold of features. We present a proof of convergence of our algorithm. We show empirical results using our algorithm as well as a similar algorithm that uses temporal difference learning in place of the residual gradient scheme for the faster timescale updates.

Differentially private stochastic gradient descent algorithm for multiparty classification

We consider the problem of developing privacy-preserving machine learning algorithms in a dis-tributed multiparty setting. Here different parties own different parts of a data set, and the goal is to learn a classifier from the entire data set with-out any party revealing any information about the individual data points it owns. Pathak et al [7]recently proposed a solution to this problem in which each party learns a local classifier from its own data, and a third party then aggregates these classifiers in a privacy-preserving manner using a cryptographic scheme. The generaliza-tion performance of their algorithm is sensitive to the number of parties and the relative frac-tions of data owned by the different parties. In this paper, we describe a new differentially pri-vate algorithm for the multiparty setting that uses a stochastic gradient descent based procedure to directly optimize the overall multiparty ob-jective rather than combining classifiers learned from optimizing local objectives. The algorithm achieves a slightly weaker form of differential privacy than that of [7], but provides improved generalization guarantees that do not depend on the number of parties or the relative sizes of the individual data sets. Experimental results corrob-orate our theoretical findings.

Membership models and the design of authentication protocols for MANETs

Authentication protocols are very much essential for secure communication in mobile ad hoc networks (MANETs). A number of authentication protocols for MANETs have been proposed in the literature which provide the basic authentication service while trying to optimize their performance and resource consumption parameters. A problem with most of these protocols is that the underlying networking environment on which they are applicable have been left unspecified. As a result, lack of specifications about the networking environments applicable to an authentication protocol for MANETs can mislead about the performance and the applicability of the protocol. In this paper, we first characterize networking environment for a MANET as its 'Membership Model' which is defined as a set of specifications related to the 'Membership Granting Server' (MGS) and the 'Membership Set Pattern' (MSP) of the MANET. We then identify various types of possible membership models for a MANET. In order to illustrate that while designing an authentication protocol for a MANET, it is very much necessary to consider the underlying membership model of the MANET, we study a set of six representative authentication protocols, and analyze their applicability for the membership models as enumerated in this paper. The analysis shows that the same protocol may not perform equally well in all membership models. In addition, there may be membership models which are important from the point of view of users, but for which no authentication protocol is available.