cssi/SciSciGPT-SciSciNet huggingface dataset:
Is coaching experience associated with effective use of timeouts in basketball

Experience is an important asset in almost any professional activity. In basketball, there is believed to be a positive association between coaching experience and effective use of team timeouts. Here, we analyze both the extent to which a team's change in scoring margin per possession after timeouts deviate from the team's average scoring margin per possession—what we called timeout factor, and the extent to which this performance measure is associated with coaching experience across all teams in the National Basketball Association over the 2009–2012 seasons. We find that timeout factor plays a minor role in the scoring dynamics of basketball. Surprisingly, we find that timeout factor is negatively associated with coaching experience. Our findings support empirical studies showing that, under certain conditions, mentors early in their careers can have a stronger positive impact on their teams than later in their careers.
RELATIVISTIC SUPPRESSION OF BLACK HOLE RECOILS

Numerical-relativity simulations indicate that the black hole produced in a binary merger can recoil with a velocity up to v_(max) ≃ 4000 km s^(−1) with respect to the center of mass of the initial binary. This challenges the paradigm that most galaxies form through hierarchical mergers, yet retain supermassive black holes (SBHs) at their centers despite having escape velocities much less than v_(max). Interaction with a circumbinary disk can align the binary black hole spins with their orbital angular momentum, reducing the recoil velocity of the final black hole produced in the subsequent merger. However, the effectiveness of this alignment depends on highly uncertain accretion flows near the binary black holes. In this paper, we show that if the spin S_1 of the more massive binary black hole is even partially aligned with the orbital angular momentum L, relativistic spin precession on sub-parsec scales can align the binary black hole spins with each other. This alignment significantly reduces the recoil velocity even in the absence of gas. For example, if the angle between S_1 and L at large separations is 10° while the second spin S_2 is isotropically distributed, the spin alignment discussed in this paper reduces the median recoil from 864 km s^(−1) to 273 km s^(−1) for maximally spinning black holes with a mass ratio of 9/11. This reduction will greatly increase the fraction of galaxies retaining their SBHs.
Will Southern Agriculture Play a Role in a Carbon Market

While a carbon market offers substantial opportunities for US agriculture, regional differences in such a market are often ignored. This paper focuses on the advantages and challenges for agriculture in the South. The potential of two promising options are analyzed: conversion from cropland to forests and greater use of conservation tillage. It is argued that the right institutional arrangements can overcome three fundamental challenges to an efficient carbon market: transaction costs, risk, and perverse incentives. Some examples are given, such as the use of a farmer-owned organization and the provision of land use and carbon information by the government.
Pruning fronts and the formation of horseshoes

Let f : π → π be a homeomorphism of the plane π. We define open sets P, called pruning fronts after the work of Cvitanovic (C), for which it is possible to construct an isotopy H : π ×(0,1) → π with open support contained in ( n2Z f n (P) such that H(� ,0) = f(� ) and H(� ,1) = fP(� ), where fP is a homeomorphism under which every point of P is wandering. Applying this construction with f being Smale's horseshoe, it is possible to obtain an uncountable family of homeomorphisms, depending on infinitely many parameters, going from trivial to chaotic dynamic behaviour. This family is a 2-dimensional analog of a 1-dimensional universal family.
The Statistics of the In-Phase Component of the Branch Signal in a Pilot-Derived Maximal Ratio Diversity Combiner

An often-discussed scheme for providing maximal ratio combining in mobile radio is to set the complex branch gain according to the amplitude and phase of a pilot sent with the carrier. The in-phase component of the branch signal in such a system has a simple doubleexponential distribution. These and other relevant statistics are derived.
A single pair of neurons links sleep to memory consolidation in Drosophila melanogaster

Sleep promotes memory consolidation in humans and many other species, but the physiological and anatomical relationships between sleep and memory remain unclear. Here, we show the dorsal paired medial (DPM) neurons, which are required for memory consolidation in Drosophila, are sleep-promoting inhibitory neurons. DPMs increase sleep via release of GABA onto wake-promoting mushroom body (MB) α'/β' neurons. Functional imaging demonstrates that DPM activation evokes robust increases in chloride in MB neurons, but is unable to cause detectable increases in calcium or cAMP. Downregulation of α'/β' GABAA and GABABR3 receptors results in sleep loss, suggesting these receptors are the sleep-relevant targets of DPM-mediated inhibition. Regulation of sleep by neurons necessary for consolidation suggests that these brain processes may be functionally interrelated via their shared anatomy. These findings have important implications for the mechanistic relationship between sleep and memory consolidation, arguing for a significant role of inhibitory neurotransmission in regulating these processes.
Bankruptcy in general equilibrium

In this paper, I construct a model of an exchange economy in which bankruptcy arises in a manner similar to what we observe. This model is a more realistic representation of some markets in which intertemporal assets are traded. Using standard and natural assumptions, I show that every economy represented by this model has an equilibrium. Using examples, I highlight some welfare effects of bankruptcy.
A New Probability Density Function Enhancing Packet Detection Analysis for Low-SNR Links

Packet detection is the first task that a receiver has to perform in a random access communication scheme. The implementation and evaluation of different packet detection methods depend on the probability density functions (PDFs) of the decision variables and their construction process. This paper provides a new PDF that enables the analysis of one method, due to Schmidl and Cox (SC), in packet detection. The new PDF enables determination of the detection threshold and performance evaluation. The new PDF also avoids the Gaussian assumption in the low-signal-to-noise-ratio (SNR) regime that is typical in the ultrawideband systems and converges to Gaussian for high SNR. Comparison with other packet detection methods shows that the SC method is both robust to channel multipath and provides a good tradeoff between performance and signal processing complexity
Miniature eye-safe laser system for high-resolution three-dimensional lidar

A microchip-laser-pumped optical parametric amplifier produces 35-microJ, 1.537-microm pulses of 190-ps duration at 8 kHz, in a near-diffraction-limited output beam with a Fourier-transform-limited spectrum. The flight-ready laser head is pumped by 20 W of optical power from two fiber-coupled laser-diode arrays, occupies a volume of 0.14 liters, and has a mass of 0.34 kg.
Dipole Interactions in Doubly Periodic Domains

We consider the interactions of finite dipoles in a doubly periodic domain. A finite dipole is a pair of equal and opposite strength point vortices separated by a finite distance. The dynamics of multiple finite dipoles in an unbounded inviscid fluid was first proposed by Tchieu, Kanso, and Newton in Tchieu et al. (Proc. R. Soc. Lond. Ser. A, Math. Phys. Eng. Sci. 468(2146):3006–3026, 2012) as a model that captures the “far-field” hydrodynamic interactions in fish schools. In this paper, we formulate the equations of motion governing the dynamics of finite dipoles in a doubly periodic domain. We show that a single dipole in a doubly periodic domain exhibits periodic and aperiodic behavior, in contrast to a single dipole in an unbounded domain. In the case of two dipoles in a doubly periodic domain, we identify a number of interesting trajectories including collision, collision avoidance, and passive synchronization of the dipoles. We then examine two types of dipole lattices: rectangular and diamond. We verify that these lattices are in a state of relative equilibrium and show that the rectangular lattice is unstable, while the diamond lattice is linearly stable for a range of perturbations. We conclude by commenting on the insight these models provide in the context of fish schooling.
Interrogating Novel Areas of Chemical Space for Drug Discovery using Chemoinformatics

Preclinical Research Chemoinformatic approaches have an essential role in the systematic description and visualization of the chemical space for drug discovery projects. These methods enable the quantitative comparison of general screening collections and the systematic classification of approved drugs and databases annotated with biological activity to define biologically and medicinally relevant chemical spaces. Profiling of chemical diversity, molecular complexity, and physicochemical properties of compound libraries using chemoinformatic approaches provide a solid basis to generate hypothesis of how to interrogate novel areas of chemical space for enhanced drug discovery. This commentary is focused on the application of chemoinformatic approaches to mine, and to navigate the chemical space of compound collections. The discussion is centered on the concept of chemical space, types of compound libraries used in drug discovery programs, applications of chemical space mining and visualization using chemoinformatic methods, and strategies to expand the pharmaceutical relevant chemical space with emphasis on the notion of molecular complexity.
Selective perception policies for guiding sensing and computation in multimodal systems: A comparative analysis

Intensive computations required for sensing and processing perceptual information can impose significant burdens on personal computer systems. We explore the use of value of information to guide sensing and analysis in automated behavior recognition systems, and highlight the role of such computations as a formal foundation for selective attention. We examine several different policies for selective perception in SEER, a multimodal system for recognizing office activity that relies on a layered Hidden Markov Model (LHMM) representation. We review our efforts to employ expected value of information (EVI) computations to limit sensing and analysis in a context-sensitive manner. We discuss an implementation of a one-step myopic EVI analysis and compare the results of using the myopic EVI with a heuristic sensing policy that makes observations at different frequencies. Both policies are then compared to a random perception policy, where sensors are selected at random. Finally, we discuss the sensitivity of ideal perceptual actions to preferences encoded in utility models about information value and the cost of sensing.
The statistical distribution of the zeros of random paraorthogonal polynomials on the unit circle

The orthogonal polynomials on the unit circle are defined by the recurrence relation @F"k"+"1(z)[email protected]"k(z)[email protected]@?"[email protected]"k^*(z),k>=0,@F"0=1,where @a"[email protected]?D for any k>=0. If we consider n complex numbers @a"0,@a"1,...,@a"n"-"[email protected]?D and @a"n"-"[email protected][email protected]?D, we can use the previous recurrence relation to define the monic polynomials @F"0,@F"1,...,@F"n. The polynomial @F"n(z)[email protected]"n(z;@a"0,...,@a"n"-"2,@a"n"-"1) obtained in this way is called the paraorthogonal polynomial associated to the coefficients @a"0,@a"1,...,@a"n"-"1. We take @a"0,@a"1,...,@a"n"-"2 i.i.d. random variables distributed uniformly in a disk of radius r<1 and @a"n"-"1 another random variable independent of the previous ones and distributed uniformly on the unit circle. For any n we will consider the random paraorthogonal polynomial @F"n(z)[email protected]"n(z;@a"0,...,@a"n"-"2,@a"n"-"1). The zeros of @F"n are n random points on the unit circle. We prove that for any e^i^@[email protected][email protected]?D the distribution of the zeros of @F"n in intervals of size O(1n) near e^i^@q is the same as the distribution of n independent random points uniformly distributed on the unit circle (i.e., Poisson). This means that, for large n, there is no local correlation between the zeros of the considered random paraorthogonal polynomials.
Flow of Liquid Jets through Closely Woven Screens

Previously developed analytical models relate pressure drop across a fine-mesh screen to throughflow velocity for duct systems. These models are shown to be unreliable for an unconfined flow, such as a free jet, impinging on a screen. A new model is developed for these kinds of systems, incorporating the important influence of liquid deflection by the screen. A new parameter, the boundary-layer blockage coefficient, is introduced. This coefficient, which depends on the screen weave geometry and the jet impingement angle, accounts for the increase in fluid path length through the screen resulting from the flow deflection. Comparisons are made with previous experimental studies to determine empirical values of the blockage coefficient. It is concluded that the new model reliably predicts the bulk flow and penetration characteristics of an impinging liquid jet interacting with a screen.
The Costs of Worker Displacement

This study identifies part of the social loss attendant upon displacement as the remaining value of the assets specific to the severed employment relationship. A bargaining model is used to link wage-tenure profiles to the amount of information firms and workers possess about the duration of that relationship. If information is good, the profile will flatten as displacement approaches. Using PSID data for workers separated between 1977 and 1981, wage-tenure profiles are found not to change. This suggests that either workers, or both firms and workers, are surprised by the displacement. The present value of that part of the social loss attributable to the worker's share of firm-specific capital is around $7,000 (1980 dollars).
High-speed, high-temperature finger seal test results

A pressure balanced finger seal was tested in NASA's High-Temperature, High-Speed Turbine Seal Test Rig at conditions up to 922 K, 366 m/s, and 517 kPa to study its leakage, power loss, and wear performance at advanced engine conditions. Static, performance, endurance, and postperformance tests were conducted. The finger seal leakage performance met the flow factor goal of 7.72 kg-∫K/MPa-m-s during the endurance test, which simulated expected advanced-engine rated power conditions. The maximum finger seal power loss of 10.4 kW occurred at 366 m/s and 517 kPa across the seal. Further design improvements are needed to reduce seal power loss. Finger seal power loss is comparable to measured brush seal power loss. Most finger seal wear occurred in the initial performance test and the accumulative seal weight loss leveled out over time. With approximately one-half the finger pad thickness remaining after 11 h of testing, the rate of seal wear is acceptable. Furthermore, the high velocity oxygen fuel thermally sprayed (HVOF) chrome carbide coating on the rotor performed well, with a final wear track depth less than 6.35 μm. The finger seal is very sensitive to clearance, and further testing is required to separate and quantify the effects of changes in radial clearance from apparent hysteresis.
The fat-stack and universal routing in interconnection networks

This paper shows that a novel network called the fat-stack is universally efficient and is suitable for use as an interconnection network in parallel computers. A requirement for the fat-stack to be universal is that link capacities double up the levels of the network. The fat-stack resembles the fat-tree and the fat-pyramid in hardware structure, but it has unique strengths. It is a construct of an atomic subnetwork unit consisting of one ring and one or more upward links to an upper subnetwork. This simple structure entails easy wirability. The network also uses fewer wires. More importantly, it has the capability to scale up to represent a large-scale distributed network. We developed efficient routing algorithms specific to the fat-stack. Our universality proof shows that a fat-stack variant with increased links and of area @Q(A) can simulate any competing network of area A with O(logA) overhead independently of wire delay. The universality result implies that the augmented fat-stack of a given size is nearly the best routing network of that size. The augmented fat-stack is the minimal universal network for an O(logA) overhead in terms of hardware usage. Actual simulations show that the performance of the augmented fat-stack approaches that of the fat-pyramid and is far higher than that of the fat-tree.
Institutional Reform and the Judiciary Which Way Forward

The author presents some general lessons in institution-building that has relevance for judiciary reform. She emphasizes the value of simplicity in design commensurate with country capacity, the importance of innovation and experimentation, and of economic openness in effective institution-building. The author underscores how the incentives of individuals depend on both the details of institutional design within the judiciary and also some critical institutions external to the judiciary. Finally she argues for the need to ground reform initiatives on a solid empirical and comparative approach. The author illustrates some of these issues by drawing on a recent project conducted by the World Bank and other institutions.
Binding Affinities of Host–Guest, Protein–Ligand, and Protein–Transition‐State Complexes

The affinities of hosts-ranging from small synthetic cavitands to large proteins-for organic molecules are well documented. The average association constants for the binding of organic molecules by cyclodextrins, synthetic hosts, and albumins in water, as well as of catalytic antibodies or enzymes for substrates are 10(3.5+/-2.5) M(-1). Binding affinities are elevated to 10(8+/-2) M(-1) for the complexation of transition states and biological antigens by antibodies or inhibitors by enzymes, and to 10(16+/-4) M(-1) for transition states with enzymes. The origins of the distributions of association constants observed for the broad range of host-guest systems are explored in this Review, and typical approaches to compute and analyze host-guest binding in solution are discussed. In many classes of complexes a rough correlation is found between the binding affinity and the surface area that is buried upon complexation. Enzymes transcend this effect and achieve transition-state binding much greater than is expected from the surface areas.
The sample complexity of revenue maximization

In the design and analysis of revenue-maximizing auctions, auction performance is typically measured with respect to a prior distribution over inputs. The most obvious source for such a distribution is past data. The goal of this paper is to understand how much data is necessary and sufficient to guarantee near-optimal expected revenue. Our basic model is a single-item auction in which bidders' valuations are drawn independently from unknown and nonidentical distributions. The seller is given m samples from each of these distributions "for free" and chooses an auction to run on a fresh sample. How large does m need to be, as a function of the number k of bidders and e 0, so that a (1 -- e)-approximation of the optimal revenue is achievable? We prove that, under standard tail conditions on the underlying distributions, m = poly(k, 1/e) samples are necessary and sufficient. Our lower bound stands in contrast to many recent results on simple and prior-independent auctions and fundamentally involves the interplay between bidder competition, non-identical distributions, and a very close (but still constant) approximation of the optimal revenue. It effectively shows that the only way to achieve a sufficiently good constant approximation of the optimal revenue is through a detailed understanding of bidders' valuation distributions. Our upper bound is constructive and applies in particular to a variant of the empirical Myerson auction, the natural auction that runs the revenue-maximizing auction with respect to the empirical distributions of the samples. To capture how our sample complexity upper bound depends on the set of allowable distributions, we introduce α-strongly regular distributions, which interpolate between the well-studied classes of regular (α = 0) and MHR (α = 1) distributions. We give evidence that this definition is of independent interest.
The Noise-Sensitivity Phase Transition in Compressed Sensing

Consider the noisy underdetermined system of linear equations: y = Ax0 + z, with A an n × N measurement matrix, n <; N, and z ~ N(0, σ2I) a Gaussian white noise. Both y and A are known, both x0 and z are unknown, and we seek an approximation to x0. When x0 has few nonzeros, useful approximations are often obtained by l1-penalized l2 minimization, in which the reconstruction x1,λ solves min{||y - Ax||22/2 + λ||x||1}. Consider the reconstruction mean-squared error MSE = E|| x1,λ - x0||22/N, and define the ratio MSE/σ2 as the noise sensitivity. Consider matrices A with i.i.d. Gaussian entries and a large-system limit in which n, N → ∞ with n/N → δ and k/n → ρ. We develop exact expressions for the asymptotic MSE of x1,λ , and evaluate its worst-case noise sensitivity over all types of k-sparse signals. The phase space 0 ≤ 8, ρ ≤ 1 is partitioned by the curve ρ = ρMSE(δ) into two regions. Formal noise sensitivity is bounded throughout the region ρ = ρMSE(δ) and is unbounded throughout the region ρ = ρMSE(δ). The phase boundary ρ = ρMSE(δ) is identical to the previously known phase transition curve for equivalence of l1 - l0 minimization in the k-sparse noiseless case. Hence, a single phase boundary describes the fundamental phase transitions both for the noise less and noisy cases. Extensive computational experiments validate these predictions, including the existence of game-theoretical structures underlying it (saddlepoints in the payoff, least-favorable signals and maximin penalization). Underlying our formalism is an approximate message passing soft thresholding algorithm (AMP) introduced earlier by the authors. Other papers by the authors detail expressions for the formal MSE of AMP and its close connection to l1-penalized reconstruction. The focus of the present paper is on computing the minimax formal MSE within the class of sparse signals x0.
The Pyridyldiisopropylsilyl Group: A Masked Functionality and Directing Group for Monoselective ortho-Acyloxylation and ortho-Halogenation Reactions of Arenes.

A novel, easily removable and modifiable silicon-tethered pyridyldiisopropylsilyl directing group for C—H functionalizations of arenes has been developed. The installation of the pyridyldiisopropylsilyl group can efficiently be achieved via two complementary routes using easily available 2-(diisopropylsilyl)pyridine (5). The first strategy features a nucleophilic hydride substitution at the silicon atom in 5 with aryllithium reagents generated in situ from the corresponding aryl bromides or iodides. The second milder route exploits a highly efficient roomtemperature rhodium(I)-catalyzed cross-coupling reaction between 5 and aryl iodides. The latter approach can be applied to the preparation of a wide range of pyridyldiisopropylsilyl-substituted arenes possessing a variety of functional groups, including those incompatible with organometallic reagents. The pyridyldiisopropylsilyl directing group allows for a highly efficient, regioselective palladium(II)-catalyzed mono-ortho-acyloxylation and ortho-halogenation of various aromatic compounds. Most importantly, the silicon-tethered directing group in both acyloxylated and halogenated products can easily be removed or efficiently converted into an array of other valuable functionalities. These transformations include protio-, deuterio-, halo-, boro-, and alkynyl-desilylations, as well as a conversion of the directing group into the hydroxy functionality. In addition, the construction of aryl-aryl bonds via the Hiyama―Denmark cross-coupling reaction is feasible for the acetoxylated products. Moreover, the ortho-halogenated pyridyldiisopropylsilylarenes, bearing both nucleophilic pyridyldiisopropylsilyl and electrophilic aryl halide moieties, represent synthetically attractive 1,2-ambiphiles. A unique reactivity of these ambiphiles has been demonstrated in efficient syntheses of arylenediyne and benzosilole derivatives, as well as in a facile generation of benzyne. In addition, preliminary mechanistic studies of the acyloxylation and halogenation reactions have been performed. A trinuclear palladacycle intermediate has been isolated from a stoichiometric reaction between diisopropyl-(phenyl)pyrid-2-ylsilane (3a) and palladium acetate. Furthermore, both C―H functionalization reactions exhibited equally high values of the intramolecular primary kinetic isotope effect (k H /k D =6.7). Based on these observations, a general mechanism involving the formation of a palladacycle via a C―H activation process as the rate-determining step has been proposed.
Radiocarbon dates and absolute chronology of the central European Early Bronze Age

It is more than forty years now since the first radiocarbon dates began the reconciliation of conventional and absolute chronologies for later prehistory. This pioneering radiocarbon chronology for the Bronze Age sequence in Central Europe brings that process nearer to a close, by filling the last major gap in the radiocarcbon chronology of the European continent.
An Improved Synthesis of Retinal (Vitamin A Aldehyde)

In recent years, we have been engaged in the synthesis and study of vitamin A analogs (retinoids) as breast cancer chemotherapeutic and chemopreventive agents. 1 , 2 For these syntheses, a substant...
Synthesis and Applications of Hajos–Parrish Ketone Isomers

Numerous natural products possess ring systems and functionality for which Hajos–Parrish ketone isomers with a transposed methyl group (termed “iso-Hajos–Parrish ketones”) would be of value. However, such building blocks have not been exploited to the same degree as the more typical Hajos–Parrish hydrindane. An efficient three-step synthesis of such materials was fueled by a simple method for the rapid preparation of highly functionalized cyclopentenones, several of which are new chemical entities that would be challenging to access through other approaches. Furthermore, one iso-Hajos–Parrish ketone was converted into two distinct natural product analogues and one natural product. As one indication of the value of these new building blocks, that latter target was obtained in 10 steps, having previously been accessed in 18 steps using the Hajos–Parrish ketone.
Multicast routing with end-to-end delay and delay variation constraints

We study the problem or constructing multicast trees to meet the quality of service requirements of real-time interactive applications operating in high-speed packet-switched environments. In particular, we assume that multicast communication depends on: (1) bounded delay along the paths from the source to each destination and (2) bounded variation among the delays along these paths. We first establish that the problem of determining such a constrained tree is NP-complete. We then present a heuristic that demonstrates good average case behavior in terms of the maximum interdestination delay variation. The heuristic achieves its best performance under conditions typical of multicast scenarios in high speed networks. We also show that it is possible to dynamically reorganize the initial tree in response to changes in the destination set, in a way that is minimally disruptive to the multicast session.
Escape of Ionizing Radiation from High-Redshift Galaxies

We use a three-dimensional radiation transfer code to calculate the steady state escape fraction of ionizing photons from disk galaxies as a function of redshift and galaxy mass. The gaseous disks are assumed to be isothermal (with a sound speed cs ~ 10 km s-1) and radially exponential. Their scale radius is related to the characteristic spin parameter and virial radius of their host halos, and their vertical structure is dictated by their self-gravity. The sources of radiation are taken to be either stars embedded in the disk or a central quasar. The predicted increase in the disk density with redshift results in an overall decline of the escape fraction with increasing redshift. For typical parameters of smooth disks, we find that the escape fraction at z ~ 10 is 1% for stars but 30% for miniquasars. Unless the smooth gas content of high-redshift disks was depleted by more than an order of magnitude due to supernovae-driven outflows or fragmentation, the reionization of the universe was most likely dominated by miniquasars rather than by stars.
Avoiding moral hazards in organizational forecasting

We describe a new mechanism that induces accurate forecasts within an organization while reducing moral hazards and the stigma associated with negative opinions. It is based on the notion of identity escrow, whereby the identity, of a forecaster is kept anonymous and only revealed when a number of his subordinates detect an attitude that is contrary to the interests of the organization. An analysis of the relative payoffs between forecasting and production shows that through the use of identity escrows one can adjust the size of the prediction group so as to ensure both production and accurate forecasts.
Reachability analysis of multi-affine systems

We present a computationally attractive technique to study the reachability of rectangular regions by trajectories of continuous multi-affine systems. The method is iterative. At each step, finer partitions and finite quotients that over-approximate the reachability properties of the initial system are produced. We exploit some convexity properties of multi-affine functions on rectangles to show that the construction of the quotient at each step requires only the evaluation of the vector field at the set of all vertices of all rectangles in the partition and finding the roots of a finite set of scalar affine functions. This methodology can be used for formal analysis of biochemical networks, aircraft and underwater vehicles, where multi-affine models are widely used.
Optimal value of information in graphical models

Many real-world decision making tasks require us to choose among several expensive observations. In a sensor network, for example, it is important to select the subset of sensors that is expected to provide the strongest reduction in uncertainty. In medical decision making tasks, one needs to select which tests to administer before deciding on the most effective treatment. It has been general practice to use heuristic-guided procedures for selecting observations. In this paper, we present the first efficient optimal algorithms for selecting observations for a class of probabilistic graphical models. For example, our algorithms allow to optimally label hidden variables in Hidden Markov Models (HMMs). We provide results for both selecting the optimal subset of observations, and for obtaining an optimal conditional observation plan. Furthermore we prove a surprising result: In most graphical models tasks, if one designs an efficient algorithm for chain graphs, such as HMMs, this procedure can be generalized to poly-tree graphical models. We prove that the optimizing value of information is NPPP-hard even for polytrees. It also follows from our results that just computing decision theoretic value of information objective functions, which are commonly used in practice, is a #P-complete problem even on Naive Bayes models (a simple special case of polytrees). In addition, we consider several extensions, such as using our algorithms for scheduling observation selection for multiple sensors. We demonstrate the effectiveness of our approach on several real-world datasets, including a prototype sensor network deployment for energy conservation in buildings.
Constructing Variable-Length PRPs and SPRPs from Fixed-Length PRPs

We create variable-length pseudorandom permutations (PRPs) and strong PRPs (SPRPs) accepting any input length chosen from the range of b to 2b bits from fixed-length, b -bit PRPs. We utilize the elastic network that underlies the recently introduced concrete design of elastic block ciphers, exploiting it as a network of PRPs. We prove that three and four-round elastic networks are variable-length PRPs and five-round elastic networks are variable-length SPRPs, accepting any input length that is fixed in the range of b to 2b bits, when the round functions are independently chosen fixed-length PRPs on b bits. We also prove that these are the minimum number of rounds required.
Numerical Studies of Laminar Flame Propagation in Spherical Bombs

A reaction-diffu sion equation which has an exact traveling wave solution is used to characterize the accuracy of nine finite difference schemes. These schemes are then applied to study the propagation of a laminar flame in a spherical bomb where chemistry is modeled by a one-step Arrhenius-type reaction. The numerical schemes evaluated include an implicit predictor-corrector method, a quasilinear algorithm, a majorant operator splitting technique, two methods of lilies, a linear block tridiagonal procedure, and the standard explicit, implicit, and Crank-Nicolson methods. The numerical results indicate that the most accurate scheme is the fourth-order method of lines whose efficiency is comparable to that of the most efficient explicit algorithm.
HIGH-ENERGY HADRON-INDUCED DILEPTON PRODUCTION FROM NUCLEONS AND NUCLEI

▪ Abstract We review the production of high-mass lepton pairs in fixed-target experiments, including both Drell-Yan (DY) and heavy quarkonium production [J/ψ, ψ′, ϒ(1S), ϒ(2S), and ϒ(3S)]. In recent years, DY data have become standard input to the determination of parton density distributions. DY data have recently yielded the first measurement of the x dependence of the , asymmetry of the proton. Similar to the observations in deeply inelastic scattering, precision measurements of the nuclear dependence of the proton-induced DY process exhibit shadowing at small target momentum fraction, x2. There is, however, no evidence of enhanced DY production from nuclear targets. Mean transverse momenta of DY pairs are observed to increase with target mass. These data, analyzed within a new theoretical framework, provide an estimation of the energy loss of fast quarks in nuclear matter. In contrast to the DY process, there are large nuclear effects in the production of all quarkonia. These effects show strong depen...
Exceptional error minimization in putative primordial genetic codes

Background The standard genetic code is redundant and has a highly non-random structure. Codons for the same amino acids typically differ only by the nucleotide in the third position, whereas similar amino acids are encoded, mostly, by codon series that differ by a single base substitution in the third or the first position. As a result, the code is highly albeit not optimally robust to errors of translation, a property that has been interpreted either as a product of selection directed at the minimization of errors or as a non-adaptive by-product of evolution of the code driven by other forces.
Silanediol-based inhibitor of thermolysin.

Abstract The first silanediol inhibitor of thermolysin is reported, prepared by analogy with the Grobelny/Bartlett phosphinate inhibitor. A Cbz group on nitrogen proved to be unstable to the triflic acid mediated silanediol deprotection and was replaced with a dihydrocinnamoyl group. The silanediol was prepared in high purity by hydrolysis of a difluorosilane intermediate and proved to be an effective inhibitor, differing from the phosphinate by a factor of 4 (Ki=41 nM).
C-5 Modified Nucleosides: Direct Insertion of Alkynyl-Thio Functionality in Pyrimidines

A route is presented to append, in a single step, alkynyl thioesters to the 5-position of a pyrimidine ring of a nucleoside that is unprotected. These products should be useful to support in vitro selection experiments with functionalized DNA.
Algorithms for fair partitioning of convex polygons

In this paper we study the problem of partitioning a convex polygon P of n vertices into m polygons of equal area and perimeter. We give an algorithm for m = 2 that runs in O ( n ) time, and an algorithm for m = 2 k , where k is an integer, that runs in O ( ( 2 n ) k ) time. These are the first algorithms to solve this problem.
Coordination in Disaster Management and Response: A Unified Approach

Natural, technological and man-made disasters are typically followed by chaos that results from an inadequate overall response. Three separate levels of coordination are addressed in the mitigation and preparedness phase of disaster management where environmental conditions are slowly changing: (1) communication and transportation infrastructure, (2) monitoring and assessment tools, (3) collaborative tools and services for information sharing. However, the nature of emergencies is to be unpredictable. Toward that end, a fourth level of coordination --- distributed resource/role allocation algorithms of first responders, mobile workers, aid supplies and victims --- addresses the dynamic environmental conditions of the response phase during an emergency. A tiered peer-to-peer system architecture could combine those different levels of coordination to address the changing needs of disaster management. We describe in this paper the architecture of such a tiered peer-to-peer agent-based coordination decision support system for disaster management and response and the applicable coordination algorithms including ATF, a novel, self-organized algorithm for adaptive team formation.
TURNS IN CONSUMER CONFIDENCE: AN INFORMATION ADVANTAGE LINKED TO MANUFACTURING

This research shows that the manufacturing sector contains private information advantages for consumer confidence. It examines the consumer confidence--manufacturing link by comparing the U.S. national-level Index of Consumer Sentiment with identically constructed confidence indices from a key manufacturing state and a nonmanufacturing state. Granger causality analysis shows that the manufacturing state's confidence index leads the national index, whereas the nonmanufacturing state's confidence index lags it. Factors influencing confidence include percentage manufacturing employment, equity markets indicators, and disposable income. Fitting a consumption function to confidence measures for the three confidence indices shows the strongest relationship to be in the manufacturing state. (JEL D12) Copyright 2006, Oxford University Press.
Attitudes and Performance: An Analysis of Russian Workers

Abstract How do attitudes affect performance? Numerous studies show that individuals who exhibit an internal locus of control perform better than those characterized by an external locus of control. We use survey data collected in two regions in Russia to determine whether these same results hold among the ∼1500 employees who participated in our study. Our performance measures include self-reported assessments of work quantity and quality, earnings, and expected promotions. We find significant differences between internals and externals regarding work-related attitudes. Controlling for a variety of worker characteristics, we find that individuals who exhibit an internal locus of control perform better, but this result is not always statistically significant. The influence of LOC on performance varies by region, gender, and supervisory position. Overall, the effect of LOC on performance is rather small among the participants in our survey.
Zones of Cooperation in Demographic Prisoner's Dilemma

The emergence of cooperation in Prisoner's Dilemma (PD) games is generally assumed to require repeated play (and strategies such as Tit-For-Tat, involving memory of previous interactions) or features ("tags") permitting cooperators and defectors to distinguish one another. In the Demographic Prisoner's Dilemma, neither assumption is made: agents with finite vision move to random sites on a lattice and play a fixed culturally-inherited zero-memory strategy of cooperate (C) or defect (D) against neighbors. Agents are indistinguishable to one another--they are "tagless". Positive payoffs accrue to agents playing C against C, or D against C. Negative payoffs accrue to agents playing C against D, or D against D. Payoffs accumulate. If accumulated payoffs exceed some threshold, agents clone offspring of the same strategy onto neighboring sites and continue play. If accumulated payoffs are negative, agents die and are removed. Spatial zones of cooperation emerge.
Biomedical Imaging and Optical Biopsy Using Optical Coherence Tomography

Optical coherence tomography (OCT) is an emerging imaging modality which can generate high resolution, cross-sectional and three dimensional images of microstructure in biological systems. OCT is analogous to ultrasound B mode imaging, except that it uses light instead of sound. Imaging is performed by measuring the echo time delay of optical backscattering in the tissue as a function of transverse position. The penetration depth of OCT imaging is limited by attenuation from optical scattering to ~2 to 3 mm in most tissues, however image resolutions of 1–15 um may be achieved. OCT functions as a type of "optical biopsy" enabling in situ visualization of tissue microstructure with resolutions approaching that of conventional histopathology. Imaging can be performed in real time without the need to remove and process a specimen as in conventional biopsy. OCT technology utilizes advances in photonics and fiber optics such as femtosecond broadband lasers, high speed wavelength swept lasers and line scan camera technologies. Recent developments using Fourier domain detection achieve dramatic improvements in resolution and imaging speed. Three dimensional, volumetric imaging with extremely high voxel density is now possible, enabling microstructure and pathology to be visualized and rendered in a manner analogous to MR imaging. OCT has become a standard clinical diagnostic in ophthalmology, where it can image retinal pathology with unprecedented resolutions. OCT is also being developed for other applications ranging from cancer detection in endoscopy, to intravascular imaging in cardiology. This presentation will discuss OCT technology and its applications.
Correlation of Irradiation Data Using Activation Fluences and Irradiation Temperature

A new method of correlating radiation damage data is tested using actual measured data taken from the open literature. This method, the activation fluence method, was found to be as accurate as other contemporary models with which it was compared. The new method also has several advantages over the other methods. The method employs a new entity, the activation fluence (time-integrated specific activation rate), as the independent variables in a regression model. Temperature at which the irradiation takes place is also a variable. Although the method was tested for a specific type of damage (change in nil-ductility transition temperature for A302-B steel) it has no inherent restrictions and is limited only by the imagination of the user.
Expenditures and use of wraparound health insurance for employed people with disabilities.

Abstract Background The Affordable Care Act (ACA) provides health insurance to many working-age adults with disabilities, but we do not expect the new coverage or existing insurance options to fully meet their employment-related health care needs. Wraparound services have the potential to foster employment among people with disabilities. Objective We use Massachusetts, which implemented health care reform in 2006, as a case study to estimate the wraparound health care expenditures and use for workers with disabilities. Methods We identified a group of employed, working-age people with disabilities whose primary health insurance is Medicare or private insurance and who use the Medicaid Buy-In Program for wraparound coverage. We analyzed claims to estimate expenditures and use. Results Wraparound expenditures averaged $427 per member per month. Community-based services for both mental and non-mental health, which are generally not covered by Medicare or private insurance, accounted for 63% of all expenditures. The number who used community-based services was low, but the expenditures were high. The majority of the remaining expenditures were for services usually covered by primary insurance including: inpatient and outpatient, pharmacy and professional services. Expenditures were higher for people with Medicare compared to private insurance. Conclusions This case study suggests that, from a total program cost perspective, wraparound demand is greatest for community-based services. From a member utilization perspective, the demand is greatest for coverage that alleviates out-of-pocket costs for services provided by primary insurance. Additional analysis is needed to further assess the design options for wraparound programs and their feasibility.
Almost prime coordinates for anisotropic and thin pythagorean orbits

We make an observation which doubles the exponent of distribution in certain Affine Sieve problems, such as those considered by Liu-Sarnak, Kontorovich, and Kontorovich-Oh. As a consequence, we decrease the known bounds on the saturation numbers in these problems.
BURST FEMORAL FX'S DURING REVISION: BALE & NAIL

In revision surgery of a neglected loose cemented stem, especially if long-standing infection is present, the bone may become extremely thin and fragile. A fracture during implant removal, therefore, occurs readily and the bone may simply disintegrate so that it cannot be reconstructed to produce intrinsic stability. In such cases, rather than try to put together a house of cards, the bail and nail technique may be used. I first described this in 1992. A large bore intramedullary nail is inserted into what is left of the femur and the bone fragments proximally or cerclage wires are around the nail. The patient is left with a Girdlestone. Most patients cannot weight-bear on a Girdlestone for about two months. After that time, they are encouraged to do so as load bearing speeds healing and bone regeneration. Generally, within six to nine months, the femur is reconstituted and a revision can be carried out. This is a simple operation as the medullary canal is already open and the regenerated bone is often of surprising good quality. It may even be possible to use a primary stem as opposed to a long revision stem, but this probably should not be done under nine months. The presence of an IM nail and cerclage wires does not prevent the elimination of infection. As our brothers, the trauma surgeons, will attest the treatment of an infected non-union of the femur is an intramedullary nail. This technique is seldom required. The author has used it in eight cases in the last 30 years. It is, however, extremely valuable in bailing out of an impossible revision, especially if strut allografts or modular long stems are not immediately available.