An economic approach to consumer product ratings

In three essays we examine user-generated product ratings with aggregation. While recommendation systems have been studied extensively, this simple type of recommendation system has been neglected, despite its prevalence in the field. We develop a novel theoretical model of user-generated ratings. This model improves upon previous work in three ways: it considers rational agents and allows them to abstain from rating when rating is costly; it incorporates rating aggregation (such as averaging ratings); and it considers the effect on rating strategies of multiple simultaneous raters. In the first essay we provide a partial characterization of equilibrium behavior. In the second essay we test this theoretical model in laboratory, and in the third we apply established behavioral models to the data generated in the lab. This study provides clues to the prevalence of extreme-valued ratings in field implementations. We show theoretically that in equilibrium, ratings distributions do not represent the value distributions of sincere ratings. Indeed, we show that if rating strategies follow a set of regularity conditions, then in equilibrium the rate at which players participate is increasing in the extremity of agents' valuations of the product. This theoretical prediction is realized in the lab. We also find that human subjects show a disproportionate predilection for sincere rating, and that when they do send insincere ratings, they are almost always in the direction of exaggeration. Both sincere and exaggerated ratings occur with great frequency despite the fact that such rating strategies are not in subjects' best interest. We therefore apply the behavioral concepts of quantal response equilibrium (QRE) and cursed equilibrium (CE) to the experimental data. Together, these theories explain the data significantly better than does a theory of rational, Bayesian behavior -- accurately predicting key comparative statics. However, the theories fail to predict the high rates of sincerity, and it is clear that a better theory is needed.

Transceiver designs and analysis for LTI, LTV and broadcast channels - new matrix decompositions and majorization theory

Signal processing techniques play important roles in the design of digital communication systems. These include information manipulation, transmitter signal processing, channel estimation, channel equalization and receiver signal processing. By interacting with communication theory and system implementing technologies, signal processing specialists develop efficient schemes for various communication problems by wisely exploiting various mathematical tools such as analysis, probability theory, matrix theory, optimization theory, and many others. In recent years, researchers realized that multiple-input multiple-output (MIMO) channel models are applicable to a wide range of different physical communications channels. Using the elegant matrix-vector notations, many MIMO transceiver (including the precoder and equalizer) design problems can be solved by matrix and optimization theory. Furthermore, the researchers showed that the majorization theory and matrix decompositions, such as singular value decomposition (SVD), geometric mean decomposition (GMD) and generalized triangular decomposition (GTD), provide unified frameworks for solving many of the point-to-point MIMO transceiver design problems.

In this thesis, we consider the transceiver design problems for linear time invariant (LTI) flat MIMO channels, linear time-varying narrowband MIMO channels, flat MIMO broadcast channels, and doubly selective scalar channels. Additionally, the channel estimation problem is also considered. The main contributions of this dissertation are the development of new matrix decompositions, and the uses of the matrix decompositions and majorization theory toward the practical transmit-receive scheme designs for transceiver optimization problems. Elegant solutions are obtained, novel transceiver structures are developed, ingenious algorithms are proposed, and performance analyses are derived.

The first part of the thesis focuses on transceiver design with LTI flat MIMO channels. We propose a novel matrix decomposition which decomposes a complex matrix as a product of several sets of semi-unitary matrices and upper triangular matrices in an iterative manner. The complexity of the new decomposition, generalized geometric mean decomposition (GGMD), is always less than or equal to that of geometric mean decomposition (GMD). The optimal GGMD parameters which yield the minimal complexity are derived. Based on the channel state information (CSI) at both the transmitter (CSIT) and receiver (CSIR), GGMD is used to design a butterfly structured decision feedback equalizer (DFE) MIMO transceiver which achieves the minimum average mean square error (MSE) under the total transmit power constraint. A novel iterative receiving detection algorithm for the specific receiver is also proposed. For the application to cyclic prefix (CP) systems in which the SVD of the equivalent channel matrix can be easily computed, the proposed GGMD transceiver has K/log_2(K) times complexity advantage over the GMD transceiver, where K is the number of data symbols per data block and is a power of 2. The performance analysis shows that the GGMD DFE transceiver can convert a MIMO channel into a set of parallel subchannels with the same bias and signal to interference plus noise ratios (SINRs). Hence, the average bit rate error (BER) is automatically minimized without the need for bit allocation. Moreover, the proposed transceiver can achieve the channel capacity simply by applying independent scalar Gaussian codes of the same rate at subchannels.

In the second part of the thesis, we focus on MIMO transceiver design for slowly time-varying MIMO channels with zero-forcing or MMSE criterion. Even though the GGMD/GMD DFE transceivers work for slowly time-varying MIMO channels by exploiting the instantaneous CSI at both ends, their performance is by no means optimal since the temporal diversity of the time-varying channels is not exploited. Based on the GTD, we develop space-time GTD (ST-GTD) for the decomposition of linear time-varying flat MIMO channels. Under the assumption that CSIT, CSIR and channel prediction are available, by using the proposed ST-GTD, we develop space-time geometric mean decomposition (ST-GMD) DFE transceivers under the zero-forcing or MMSE criterion. Under perfect channel prediction, the new system minimizes both the average MSE at the detector in each space-time (ST) block (which consists of several coherence blocks), and the average per ST-block BER in the moderate high SNR region. Moreover, the ST-GMD DFE transceiver designed under an MMSE criterion maximizes Gaussian mutual information over the equivalent channel seen by each ST-block. In general, the newly proposed transceivers perform better than the GGMD-based systems since the super-imposed temporal precoder is able to exploit the temporal diversity of time-varying channels. For practical applications, a novel ST-GTD based system which does not require channel prediction but shares the same asymptotic BER performance with the ST-GMD DFE transceiver is also proposed.

The third part of the thesis considers two quality of service (QoS) transceiver design problems for flat MIMO broadcast channels. The first one is the power minimization problem (min-power) with a total bitrate constraint and per-stream BER constraints. The second problem is the rate maximization problem (max-rate) with a total transmit power constraint and per-stream BER constraints. Exploiting a particular class of joint triangularization (JT), we are able to jointly optimize the bit allocation and the broadcast DFE transceiver for the min-power and max-rate problems. The resulting optimal designs are called the minimum power JT broadcast DFE transceiver (MPJT) and maximum rate JT broadcast DFE transceiver (MRJT), respectively. In addition to the optimal designs, two suboptimal designs based on QR decomposition are proposed. They are realizable for arbitrary number of users.

Finally, we investigate the design of a discrete Fourier transform (DFT) modulated filterbank transceiver (DFT-FBT) with LTV scalar channels. For both cases with known LTV channels and unknown wide sense stationary uncorrelated scattering (WSSUS) statistical channels, we show how to optimize the transmitting and receiving prototypes of a DFT-FBT such that the SINR at the receiver is maximized. Also, a novel pilot-aided subspace channel estimation algorithm is proposed for the orthogonal frequency division multiplexing (OFDM) systems with quasi-stationary multi-path Rayleigh fading channels. Using the concept of a difference co-array, the new technique can construct M^2 co-pilots from M physical pilot tones with alternating pilot placement. Subspace methods, such as MUSIC and ESPRIT, can be used to estimate the multipath delays and the number of identifiable paths is up to O(M^2), theoretically. With the delay information, a MMSE estimator for frequency response is derived. It is shown through simulations that the proposed method outperforms the conventional subspace channel estimator when the number of multipaths is greater than or equal to the number of physical pilots minus one.

Neural network design for switching network control

A neural network is a highly interconnected set of simple processors. The many connections allow information to travel rapidly through the network, and due to their simplicity, many processors in one network are feasible. Together these properties imply that we can build efficient massively parallel machines using neural networks. The primary problem is how do we specify the interconnections in a neural network. The various approaches developed so far such as outer product, learning algorithm, or energy function suffer from the following deficiencies: long training/ specification times; not guaranteed to work on all inputs; requires full connectivity.

Alternatively we discuss methods of using the topology and constraints of the problems themselves to design the topology and connections of the neural solution. We define several useful circuits-generalizations of the Winner-Take-All circuitthat allows us to incorporate constraints using feedback in a controlled manner. These circuits are proven to be stable, and to only converge on valid states. We use the Hopfield electronic model since this is close to an actual implementation. We also discuss methods for incorporating these circuits into larger systems, neural and nonneural. By exploiting regularities in our definition, we can construct efficient networks. To demonstrate the methods, we look to three problems from communications. We first discuss two applications to problems from circuit switching; finding routes in large multistage switches, and the call rearrangement problem. These show both, how we can use many neurons to build massively parallel machines, and how the Winner-Take-All circuits can simplify our designs.

Next we develop a solution to the contention arbitration problem of high-speed packet switches. We define a useful class of switching networks and then design a neural network to solve the contention arbitration problem for this class. Various aspects of the neural network/switch system are analyzed to measure the queueing performance of this method. Using the basic design, a feasible architecture for a large (1024-input) ATM packet switch is presented. Using the massive parallelism of neural networks, we can consider algorithms that were previously computationally unattainable. These now viable algorithms lead us to new perspectives on switch design.

Pulse NMR in solids : chemical shift, lead fluoride and thorium hydride

Part one of this thesis consists of two sections. In the first section the fluorine chemical shift of a single crystal CaF_2 has been measured as a function of external pressure up to 4 kilobar at room temperature using multiple pulse NMR techniques. The pressure dependence of the shift is found to be -1.7 ± 1 ppm/kbar, while a theoretical calculation using an overlap model predicts a shift of -0.46 ppm/kbar. In the second section a separation of the chemical shift tensor into physically meaningful "geometrical" and "chemical" contributions is presented and a comparison of the proposed model calculations with recently reported data on hydroxyl proton chemical shift tensors demonstrates, that for this system, the geometrical portion accounts for the qualitative features of the measured tensors.

Part two of the thesis consists of a study of fluoride ion motion in β-PbF_2 doped with NaF by measurement of the ^(19)F transverse relaxation time (T_2), spin lattice relaxation time (T_1) and the spin lattice relaxation time in the rotating frame (T_(1r)). Measurements over the temperature range of -50°C to 160°C lead to activation energies for T_1, T_(1r) and T_2 of 0.205 ± 0.01, 0.29 + 0.02 and 0.27 ± 0.01 ev/ion, and a T_(1r) minimum at 56°C yields a correlation time of 0.74 μsec. Pressure dependence of T_1 and T_2 yields activation volumes of <0.2 cm^3/g-mole and 1.76 ± 0.05 cm^3/g-mole respectively. These data along with the measured magnetic field independence of T_1 suggest that the measured T_1's are not caused by ^(19)F motion, but by thermally excited carriers.

Part three of the thesis consists of a study of two samples of Th_4H_(15), prepared under different conditions but both having the proper ratio of H/Th (to within 1%). The structure of the Th_4H_(15) as suggested by X-ray measurements is confirmed through a moment analysis of the rigid lattice line shape. T_1 and T_2 measurements above 390 K furnish activation energies of 16.3 ± 1.2 kcal/mole and 18.0 ± 3.0 kcal/mole, respectively. Below 350 K, T_(1r) measurements furnish an activation energy of 10.9 ± 0.7 kcal/mole, indicating most probably more than a single mechanism for proton motion. A time-temperature hysteresis effect of the proton motion was found in one of the two samples and is strongly indicative of a phase change. T_1 at room temperature and below is dominated by relaxation due to conduction electrons with the product T_1T being 180 ± 10 K-sec. Using multiple pulse techniques to greatly reduce homonuclear dipolar broadening, a temperature-dependent line shift was observed, and the chemical shift anisotropy is estimated to be less than 16 ppm.

Applications of a Concise and General Strategy for the Syntheses of Transtaganolide and Basiliolide Natural Products

Herein are described the total syntheses of all members of the transtaganolide and basiliolide natural product family. Utilitzation of an Ireland–Claisen rearrangement/Diels–Alder cycloaddition cascade (ICR/DA) allowed for rapid assembly of the transtaganolide and basiliolide oxabicyclo[2.2.2]octane core. This methodology is general and was applicable to all members of the natural product family.

A brief introduction outlines all the synthetic progress previously disclosed by Lee, Dudley, and Johansson. This also includes the initial syntheses of transtaganolides C and D, as well as basiliolide B and epi-basiliolide B accomplished by Stoltz in 2011. Lastly, we discuss our racemic synthesis of basililide C and epi-basiliolide C, which utilized an ICR/DA cascade to constuct the oxabicyclo[2.2.2]octane core and formal [5+2] annulation to form the ketene-acetal containing 7-membered C-ring.

Next, we describe a strategy for an asymmetric ICR/DA cascade, by incorporation of a chiral silane directing group. This allowed for enantioselective construction of the C8 all-carbon quaternary center formed in the Ireland–Claisen rearrangement. Furthermore, a single hydride reduction and subsequent translactonization of a C4 methylester bearing oxabicyclo[2.2.2]octane core demonstrated a viable strategy for the desired skeletal rearrangement to obtain pentacyclic transtaganolides A and B. Application of the asymmetric strategy culminated in the total syntheses of (–)-transtaganolide A, (+)-transtaganolide B, (+)-transtaganolide C, and (–)-transtaganolide D. Comparison of the optical rotation data of the synthetically derived transtaganolides to that from the isolated counterparts has overarching biosynthetic implications which are discussed.

Lastly, improvement to the formal [5+2] annulation strategy is described. Negishi cross-coupling of methoxyethynyl zinc chloride using a palladium Xantphos catalyst is optimized for iodo-cyclohexene. Application of this technology to an iodo-pyrone geranyl ester allowed for formation and isolation of the eneyne product. Hydration of the enenye product forms natural metabolite basiliopyrone. Furthermore, the eneyne product can undergo an ICR/DA cascade and form transtaganolides C and D in a single step from an achiral monocyclic precursor.

Minimum drag profiles in infinite cavity flows

The problem considered is that of minimizing the drag of a symmetric plate in infinite cavity flow under the constraints of fixed arclength and fixed chord. The flow is assumed to be steady, irrotational, and incompressible. The effects of gravity and viscosity are ignored.

Using complex variables, expressions for the drag, arclength, and chord, are derived in terms of two hodograph variables, Γ (the logarithm of the speed) and β (the flow angle), and two real parameters, a magnification factor and a parameter which determines how much of the plate is a free-streamline.

Two methods are employed for optimization:

(1) The parameter method. Γ and β are expanded in finite orthogonal series of N terms. Optimization is performed with respect to the N coefficients in these series and the magnification and free-streamline parameters. This method is carried out for the case N = 1 and minimum drag profiles and drag coefficients are found for all values of the ratio of arclength to chord.

(2) The variational method. A variational calculus method for minimizing integral functionals of a function and its finite Hilbert transform is introduced, This method is applied to functionals of quadratic form and a necessary condition for the existence of a minimum solution is derived. The variational method is applied to the minimum drag problem and a nonlinear integral equation is derived but not solved.