cssi/SciSciGPT-SciSciNet huggingface dataset:
A Machine-Checked Proof of the Optimality of a Real-Time Scheduling Policy

We describe a mechanically-checked proof of the optimality of earliest-deadline-first (EDF) schedulers on periodic tasks accomplished using the Nqthm theorem prover. We present a formalization of the theorem and discuss why the machine-checked proof is both more complex and more reliable than a corresponding informal proof.
An adaptive approach to named entity extraction for meeting applications

Named entity extraction has been intensively investigated in the past several years. Both statistical approaches and rule-based approaches have achieved satisfactory performance for regular written/spoken language. However when applied to highly informal or ungrammatical languages, e.g., meeting languages, because of the many mismatches in language genre, the performance of existing methods decreases significantly. In this paper we propose an adaptive method of named entity extraction for meeting understanding. This method combines a statistical model trained from broadcast news data with a cache model built online for ambiguous words, computes their global context name class probability from local context name class probabilities, and integrates name lists information from meeting profiles. Such a fusion of supervised and unsupervised learning has shown improved performance of named entity extraction for meeting applications. When evaluated using manual meeting transcripts, the proposed method demonstrates a 26.07% improvement over the baseline model. Its performance is also comparable to that of the statistical model trained from a small annotated meeting corpus. We are currently applying the proposed method to automatic meeting transcripts.
The Social Role of Technical Personnel in the Deployment of Intelligent Tutoring Systems

We present a model – developed using Contextual Inquiry – of how prototype intelligent tutors are deployed into classrooms, focusing on how field technical personnel can serve as vital conduits for information and negotiation between ITS researchers and school personnel such as teachers and principals.
THE BETA FUNCTION OF A KNOT

We introduce the beta function of a knot in Euclidean three-space. This is a meromorphic function of a complex variable which we prove admits a Bernstein type functional equation. We determine the first residues.
Cluster-based industrial parks : a practical framework for action

They are being hailed as the new Holy Grail of economic development. The success of special economic zones (SEZ) in general and specialized ones in particular (industrial and technology parks) in countries as diverse as Australia, Denmark, Sweden, Germany, Switzerland, Ireland, Japan, the United Kingdom, the United States, and more recently, China; Korea; Taiwan, China; or Mauritius, has led several African leaders to launch new similar initiatives. This paper establishes a common point of reference for those who believe in the virtues of SEZs, explains why the many existing ones have not delivered the expected outcomes, and summarizes the key issues on the agenda. It then suggests cluster-based industrial parks as the most effective tool for developing competitive industries and generating employment, and provides some practical guidance to development practitioners and policymakers on the road ahead.
Orthodox quantization of Einstein's gravity: might its unrenormalizability be technically fathomable and physically innocuous?

Many physical constants related to quantized gravity, e.g., the Planck length, mass, curvature, stressenergy, etc., are nonanalytic in G at G = 0, and thus have expansions in powers of G whose terms are progressively more divergent with increasing order. Since the gravity field’s classical action is inversely proportional to G , the path integral for gravity-field quantum transition amplitudes shows that these depend on G only through the product ħG , and are nonanalytic in G at G = 0 for the same reason that all quantum transition amplitudes are nonanalytic in ħ at ħ = 0, namely their standard oscillatory essential singularity at the classical ‘limit’. Thus perturbation expansions in powers of G of gravity-field transition amplitudes are also progressively more divergent with increasing order, and hence unrenormalizable. While their perturbative treatment is impossible, the exceedingly small value of ħ G makes the semiclassical treatment of these amplitudes extraordinarily accurate, indeed to such an extent that purely classical treatment of the gravity field ought to always be entirely adequate. It should therefore be fruitful to couple classical gravity to other fields which actually need to be quantized: those fields’ ubiquitous, annoying ultraviolet divergences would thereupon undergo drastic self-gravitational red shift, and thus be cut off.
Optimal Controllers for Finite Wordlength Implementation

When a controller is implemented in a digital computer, with A/D and D/A conversion, the numerical errors of the computation can drastically affect the performance of the control system. There exists realizations of a given controller transfer function yielding arbitrarily large effects from computational errors. Since, in general, there is no upper bound, it is important to have a systematic way of reducing these effects. Optimum controller designs are developed which take account of the digital round-off errors in the controller implementation and in the A/D and D/A converters. These results provide a natural extension to the LQG theory since they reduce to the standard LQG controller when infinite precision computation is used. But for finite precision the separation principle does not hold.
Extended sympathy and the possibility of social choice

Le probleme de la compatibilite entre les choix sociaux collectifs et une theorie de la justice qui tienne compte des differences individuelles. L'A. confronte, d'une maniere partiellement formelle, les principes discutes par J. Rawls, R. Nozick, etc. avec ceux qu'utilisent les theories du choix social. Il discute en particulier la notion des "comparaisons interpersonnelles ordinales", qui semblent necessaires a tout choix social, mais qui tendent par ailleurs a negliger certaines particularites purement individuelles.
Perfect non-interactive zero knowledge for NP

Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, and various cryptographic protocols. What makes them especially attractive, is that they work equally well in a concurrent setting, which is notoriously hard for interactive zero-knowledge protocols. However, while for interactive zero-knowledge we know how to construct statistical zero-knowledge argument systems for all NP languages, for non-interactive zero-knowledge, this problem remained open since the inception of NIZK in the late 1980's. Here we resolve two problems regarding NIZK: We construct the first perfect NIZK argument system for any NP language. We construct the first UC-secure NIZK argument for any NP language in the presence of a dynamic/adaptive adversary. While it is already known how to construct efficient prover computational NIZK proofs for any NP language, the known techniques yield large common reference strings and large proofs. Another contribution of this paper is NIZK proofs with much shorter common reference string and proofs than previous constructions.
Trading State-Led Prosperity for Market-Led Stagnation: From the Golden Age to Global Neoliberalism

This chapter presents a brief review of the origin and development of neoliberal globalization and examines economic performance in the neoliberal era, first in the world economy, then, in more detail, in the US economy. In North America and Europe, there was widespread acceptance of the concept of a new "social contract" between state, capital, labor, and citizens as the foundation for a new political economy. The Golden Age (GA) was an era of exceptionally fast and widely shared growth, built on the foundation of a qualitative increase in the economic power of society over markets, exercised primarily, though not exclusively, through the state. Socially embedded markets and government guidance of the economic development were not the only reason for the economic achievements of the era, but they were, without doubt, a necessary condition for the success of the GA.
Modeling the Effect of Risk on Food Demand and the Implications for Regulation

Modern demand theory is based on the premise that consumption goods are pure and do not involve risks. However, that is clearly not the case in today’s world where reports from the scientific community link exposure from pesticide residues to increased cancer risk, intake of toxins or pathogens to incidence of specific illnesses, and high levels of naturally occurring food components such as saturated fat to increased risk of heart disease. The awareness of such linkages suggests that a new framework is needed to investigate demand for food and food safety, and to guide the appropriate government response to achieve a socially optimal level of food safety.
An approximate morphing between polylines

We address the problem of continuously transforming or morphing one simple polyline into another so that every point p of the initial polyline moves to a point q of the final polyline using the geodesic shortest path from p to q. We optimize the width of the morphing, that is, the longest geodesic path between p and q. We present a linear-time algorithm for finding a morphing with width guaranteed to be at most 1.618 times the minimum width of a morphing. This improves the previous algorithm [9] by a factor of log n. We also develop a linear-time algorithm for computing a medial axis separator.
Sulfenium ion promoted polyene cyclizations in natural product synthesis : An efficient biomimetic-like synthesis of (±) nimbidiol

Abstract A four step synthesis of the modified diterpene (±) nimbidiol ( 3 ) from (3,4-dimethoxyphenyl)acetonitrile is described which relies on a sulfenium ion promoted polyene cyclization. A key feature of this synthesis is the one flask reductive desulfurization-oxidative decyanation sequence used to convert the post cyclization intermediates 9a,b into prenimbidiol 10 .
Synchronization in arrays of coupled nonlinear systems: passivity circle criterion and observer design

It has been shown that synchronization between two nonlinear systems can be studied as a control theory problem. We show that this relationship can be extended to synchronization in coupled arrays of nonlinear systems. In particular, we extend several stability conditions to synchronization criteria in arbitrarily coupled arrays: the passivity criterion, the circle criterion and a result on observer design of Lipschitz nonlinear systems.
Triple and simultaneous collisions of competing Brownian particles

Consider a finite system of competing Brownian particles on the real line. Each particle moves as a Brownian motion, with drift and diffusion coefficients depending only on its current rank relative to the other particles. A triple collision occurs if three particles are at the same position at the same moment. A simultaneous collision occurs if at a certain moment, there are two distinct pairs of particles such that in each pair, both particles occupy the same position. These two pairs of particles can overlap, so a triple collision is a particular case of a simultaneous collision. We find a necessary and sufficient condition for a.s. absense of triple and simultaneous collisions, continuing the work of Ichiba, Karatzas, Shkolnikov (2013). Our results are also valid for the case of asymmetric collisions, when the local time of collision between the particles is split unevenly between them; these systems were introduced in Karatzas, Pal, Shkolnikov
In Pursuit of the Dynamic Optimality Conjecture

In 1985, Sleator and Tarjan introduced the splay tree, a self-adjusting binary search tree algorithm. Splay trees were conjectured to perform within a constant factor as any offline rotation-based search tree algorithm on every sufficiently long sequence—any binary search tree algorithm that has this property is said to be dynamically optimal. However, currently neither splay trees nor any other tree algorithm is known to be dynamically optimal. Here we survey the progress that has been made in the almost thirty years since the conjecture was first formulated, and present a binary search tree algorithm that is dynamically optimal if any binary search tree algorithm is dynamically optimal.
Collective behavior in recent laser-plasma experiments

The absorption of 1.06 μ light focused on small C8H8 discs has been measured in the intensity range of 1015 – 1017 W/cm The data confirms the importance of collective plasma effects in determining the absorption of intense light. The measured absorption efficiencies are in the range of 30–40%, and the scattered light has a polarization dependence. The measured absorptions are shown to be inconsistent with classical inverse bremsstrahlung. Both the magnitude of the absorption and the observed polarization dependence of the scattered light are shown to be consistent with recent calculations of light absorption via collective processes. Comparisons are made, and improved models of the light absorption are discussed with reference to the data. In addition, the heated electron energies deduced from the X-ray data are consistent with those expected via collective processes.
Lower bounds for adaptive sparse recovery

@with probability at least 1−δ > 2/3, for some p e {1, 2}. For p = 2, it was recently shown that this is possible with m = O(1/ek log log(n/k)), while nonadaptively it requires Θ(1/ek log(n/k)). It is also known that even adaptively, it takes m = Ω(k/e) for p = 2. For p = 1, there is a non-adaptive upper bound of O(1/√ek log n). We show:• For p = 2, m = Ω(log log n). This is tight for k = O(1) and constant e, and shows that the log log n dependence is correct.• If the measurement vectors are chosen in R "rounds", then m = Ω(R log1/Rn). For constant e, this matches the previously known upper bound up to an O(1) factor in R.• For p = 1, m = Ω(k/(√e·log k/e)). This shows that adaptivity cannot improve more than logarithmic factors, providing the analogue of the m = Ω(k/e) bound for p = 2.
MAGNA: Maximizing Accuracy in Global Network Alignment

Motivation Biological network alignment aims to identify similar regions between networks of different species. Existing methods compute node similarities to rapidly identify from possible alignments the high-scoring alignments with respect to the overall node similarity. But, the accuracy of the alignments is then evaluated with some other measure that is different than the node similarity used to construct the alignments. Typically, one measures the amount of conserved edges. Thus, the existing methods align similar nodes between networks hoping to conserve many edges (after the alignment is constructed!). Results Instead, we introduce MAGNA to directly 'optimize' edge conservation while the alignment is constructed, without decreasing the quality of node mapping. MAGNA uses a genetic algorithm and our novel function for 'crossover' of two 'parent' alignments into a superior 'child' alignment to simulate a 'population' of alignments that 'evolves' over time; the 'fittest' alignments survive and proceed to the next 'generation', until the alignment accuracy cannot be optimized further. While we optimize our new and superior measure of the amount of conserved edges, MAGNA can optimize any alignment accuracy measure, including a combined measure of both node and edge conservation. In systematic evaluations against state-of-the-art methods (IsoRank, MI-GRAAL and GHOST), on both synthetic networks and real-world biological data, MAGNA outperforms all of the existing methods, in terms of both node and edge conservation as well as both topological and biological alignment accuracy. Availability Software: http://nd.edu/∼cone/MAGNA CONTACT: : tmilenko@nd.edu Supplementary information Supplementary data are available at Bioinformatics online.
Approximation algorithms for wavelength assignment

Winkler and Zhang introduced the FIBER MINIMIZATION problem in [10]. They showed that the problem is NP-complete but left the question of approximation algorithms open. We give a simple 2-approximation algorithm for this problem. We also show how ideas from the Dynamic Storage Allocation algorithm of Buchsbaum et al. [4] can be used to give an approximation ratio arbitrarily close to 1 provided the problem instance satisfies certain criteria. We also show that these criteria are necessary to obtain an approximation scheme. Our 2-approximation algorithm achieves its guarantee unconditionally. We also consider the extension of the problem to a ring network and give a 2+o(1)-approximation algorithm for this topology. Our techniques also yield a factor-2 approximation for the related problem of PACKING INTERVALS IN INTERVALS, also introduced by Winkler and Zhang in [10].
Bridging the gap between education and practice in the design and development of engineering systems

In this essay, the author focuses on the challenge of educating engineering students to be successful and ready to face the challenges posed in product design and development problems they will face in industry. He is concerned with design beyond just component design and design process courses. He focuses on the design of systems; systems that are designed, developed, manufactured and produced. He first proposes the challenge and then discusses his response to this challenge by detailing his educational philosophy and specific initiatives he is undertaking.
The Equilibrium States for a Model with Two Kinds of Bose Condensation

We study the equilibrium Gibbs states for a Boson gas model, defined by Bru and Zagrebnov, which has two phase transitions of the Bose condensation type. The two phase transitions correspond to two distinct mechanisms by which these condensations can occur. The first (non-conventional) Bose condensation is mediated by a zero-mode interaction term in the Hamiltonian. The second is a transition due to saturation quite similar to the conventional Bose–Einstein (BE) condensation in the ideal Bose gas. Due to repulsive interaction in non-zero modes the model manifests a generalized type III; i.e., non-extensive BE condensation. Our main result is that, as in the ideal Bose gas, the conventional condensation is accompanied by a loss of strong equivalence of the canonical and grand canonical ensembles whereas the non-conventional one, due to the interaction, does not break the equivalence of ensembles, at least not on the level of the gauge invariant states. It is also interesting to note that the type of (generalized) condensate, I, II, or III (in the terminology of van den Berg, Lewis, and Pule), has no effect on the equivalence of ensembles. These results are proved by computing the generating functional of the cyclic representation of the Canonical Commutation Relation (CCR) for the corresponding equilibrium Gibbs states.
Accumulation Tests for FDR Control in Ordered Hypothesis Testing

ABSTRACTMultiple testing problems arising in modern scientific applications can involve simultaneously testing thousands or even millions of hypotheses, with relatively few true signals. In this article, we consider the multiple testing problem where prior information is available (for instance, from an earlier study under different experimental conditions), that can allow us to test the hypotheses as a ranked list to increase the number of discoveries. Given an ordered list of n hypotheses, the aim is to select a data-dependent cutoff k and declare the first k hypotheses to be statistically significant while bounding the false discovery rate (FDR). Generalizing several existing methods, we develop a family of “accumulation tests” to choose a cutoff k that adapts to the amount of signal at the top of the ranked list. We introduce a new method in this family, the HingeExp method, which offers higher power to detect true signals compared to existing techniques. Our theoretical results prove that these metho...
Greedy signal recovery review

The two major approaches to sparse recovery are L1-minimization and greedy methods. Recently, Needell and Vershynin developed regularized orthogonal matching pursuit (ROMP) that has bridged the gap between these two approaches. ROMP is the first stable greedy algorithm providing uniform guarantees. Even more recently, Needell and Tropp developed the stable greedy algorithm compressive sampling matching pursuit (CoSaMP). CoSaMP provides uniform guarantees and improves upon the stability bounds and RIC requirements of ROMP. CoSaMP offers rigorous bounds on computational cost and storage. In many cases, the running time is just O(N log N), where N is the ambient dimension of the signal. This review summarizes these major advances.
Trade in business services in general equilibrium

Trade in business services has been attracting attention from academic researchers, policy makers, and business journalists. While there are many anecdotes, there has been little in the way of formal theory applied to this issue. In this paper, we adapt a general model of fragmentation of production activities to try to capture the specific features of business services. Following a general discussion, we calibrate a numerical general-equilibrium simulation model to a situation in which both trade and foreign investment in services are initially banned to technically infeasible. We then compute three counter-factual scenarios: one in which trade but not investment in services is feasible or allowed, one in which investment but not trade is allowed, and one in which both trade and investment in services are allowed.
Belief revision in probability theory

In a probability-based reasoning system, Bayes' theorem and its variations are often used to revise the system's beliefs. However, if the explicit conditions and the implicit conditions of probability assignments are properly distinguished, it follows that Bayes' theorem is not a generally applicable revision rule. Upon properly distinguishing belief revision from belief updating, we see that Jeffrey's rule and its variations are not revision rules, either. Without these distinctions, the limitation of the Bayesian approach is often ignored or underestimated. Revision, in its general form, cannot be done in the Bayesian approach, because a probability distribution function alone does not contain the information needed by the operation.
Stationary random fields with linear regressions

We analyze and identify stationary fields with linear regressions and quadratic conditional variances. We give sufficient conditions to determine one-dimensional distributions uniquely as normal and as certain compactly supported distributions. Our technique relies on orthogonal polynomials, which under our assumptions turn out to be a version of the so-called continuous q-Hermite polynomials.
Interplay of disorder and geometrical frustration in doped gadolinium gallium garnet

The geometrically frustrated triangular antiferromagnet Gadolinium Gallium Garnet (Gd_3Ga_5O_(12) or GGG) exhibits a rich mix of short-range order and isolated quantum states. We investigate the effects of up to 1% neodymium substitution for gallium on the ac magnetic response at temperatures below 1 K in both the linear and nonlinear regimes. Substitutional disorder actually drives the system toward a more perfectly frustrated state, apparently compensating for the effects of imperfect gadolinium/gallium stoichiometry, while at the same time more closely demarcating the boundaries of isolated, coherent clusters composed of hundreds of spins. Optical measurements of the local Nd environment substantiate the picture of an increased frustration index with doping.
On finding minimal w-cutset

The complexity of a reasoning task over a graphical model is tied to the induced width of the underlying graph. It is well-known that the conditioning (assigning values) on a subset of variables yields a subproblem of the reduced complexity where instantiated variables are removed. If the assigned variables constitute a cycle-cutset, the rest of the network is singly-connected and therefore can be solved by linear propagation algorithms. A w-cutset is a generalization of a cycle-cutset defined as a subset of nodes such that the subgraph with cutset nodes removed has induced-width of w or less. In this paper we address the problem of finding a minimal w-cutset in a graph. We relate the problem to that of finding the minimal w-cutset of a tree-decomposition. The latter can be mapped to the well-known set multi-cover problem. This relationship yields a proof of NP-completeness on one hand and a greedy algorithm for finding a w-cutset of a tree decomposition on the other. Empirical evaluation of the algorithms is presented.
Regulator theory for switched systems

In this paper the exact output tracking problem for systems with parameter jumps is considered. Necessary and sufficient conditions are derived for the elimination of switching-introduced output transient. Previous works have studied this problem for minimum-phase systems. In contrast, our approach, which is also applicable for nonminimum-phase systems, obtains bounded but possibly noncausal solutions. A major advantage, when reference trajectories are generated by an exosystem, is that a feedback-control based solution is obtained. As in standard regulator theory, we obtain a linear map from the states of the exosystem to the desired system state which is defined via a matrix differential equation. The constant solution of this differential equation provides asymptotic tracking, and coincides with the feedback law used in standard regulator theory. The obtained results are applied to a simple flexible manipulator with jumps in the pay-load mass.
Analysis and design of graphical password techniques

In recent years, graphical passwords have become a viable alternative to the traditional text-based passwords due to their superior ease of recall and potential large password space. However, there is very limited research in classifying and mathematically analyzing the graphical password techniques. In this paper, we conduct a comprehensive study of the existing graphical password techniques. We propose the first taxonomy for graphical passwords methods and discuss the important elements in designing them. We present a mathematical analysis of the graphical password space. Finally we present a new graphical password scheme.
Multi-valued graphs in embedded constant mean curvature disks

In this paper we prove that an embedded constant mean curvature disk with Gaussian curvature large at a point contains a multi-valued graph around that point on the scale of |A| 2 . This generalizes Colding and Minicozzi's result for minimal surfaces.
Patterns of Sexual Arousal in Young, Heterosexual Men Who Experience Condom-Associated Erection Problems (CAEP)

Abstract Introduction Condom‐associated erection problems (CAEPs) are reported by a substantial number of young men and are associated with inconsistent and/or incomplete condom use. The underlying mechanisms of CAEP are not well understood, and research examining the possibility that men who report CAEP differ from other men in their sexual responsivity is lacking. Aim This study used psychophysiological methods to examine whether men who report CAEP have a higher threshold for sexual arousal, a stronger need for tactile stimulation, and/or more easily lose their sexual arousal due to neutral distractors or performance‐related demands. Methods A total of 142 young, heterosexual men (53% reporting CAEP) were presented with four 3‐minute erotic film clips. Three film clips were combined with one of the following manipulations: (i) distraction; (ii) performance demand; or (iii) vibrotactile stimulation. One erotic film clip was presented with no further instructions or manipulations. Main Outcome Measures Average penile circumference changes during the first, second, and third minute (time) of the erotic film stimuli (condition) were submitted to a mixed‐model analysis of variance with condition and time as within‐subjects factors and group (CAEP/no‐CAEP) as between‐subjects factor. Results Significant main effects of condition and time and a significant interaction of group × time were found. No significant interactions involving condition were found. Men who reported CAEP had smaller erectile responses during the first minute, regardless of film condition, than men who reported no CAEP ( F (1,141) = 8.64, P Conclusion The findings suggest that men with and without CAEP differ in the ease with which they become sexually aroused. Men reporting CAEP needed more time and/or more intense stimulation to become aroused. To our knowledge, this study is the first to use psychophysiological methods to assess sexual responsivity in men who report CAEP. Janssen E, Sanders SA, Hill BJ, Amick E, Oversen D, Kvam P, and Ingelhart K. Patterns of sexual arousal in young, heterosexual men who experience condom‐associated erection problems ( CAEP ). J Sex Med 2014;11:2285‐2291.
Neutrino Oscillations with Three Active and Three Sterile Neutrinos

This is an extension of estimates of the probability of μ to e neutrino oscillation with one sterile neutrino to three sterile neutrinos, using a 6x6 matrix. Since the mixing angle for only one sterile neutrino has been experimentally determined, we estimate the μ to e neutrino oscillation probability with different mixing angles for two of the sterile neutrinos.
Classification of atmospheric river events on the U.S. West Coast using a trajectory model

Author(s): Ryoo, JM; Waliser, DE; Waugh, DW; Wong, S; Fetzer, EJ; Fung, I | Abstract: We investigate transport pathways of water vapor associated with landfalling atmospheric river (AR) events that result in precipitation along the West Coast of the U.S. for winters of 1997-2010. The water vapor transport pathways are determined by computing back trajectories with a trajectory model using the Modern Era Retrospective analysis for Research and Applications reanalysis data set. The majority of AR events (86%) over the West Coast of the U.S. are grouped into three trajectory types, and two of them are closely associated with the AR events. We designate the first type as Ascending near landfall and of Tropical Origin (AT), the second type as Ascending near landfall and of Extratropical Origin (AE), and the third type as Descending or parallel near landfall and of Extratropical Origin (DE), which is accompanied but not directly associated with the AR events. The magnitude and spatial distribution of precipitation of a given AR event are found to be strongly determined by the type of trajectories. In general, AR events composed of both AT and AE trajectories have more frequent precipitation over a broad region of the western U.S. and AR events composed of both AT and DE trajectories have intense precipitation over the southwestern U.S. due to AT trajectories. AR events of AT-only trajectories have intense precipitation, especially over the northwestern U.S., but are less frequent compared to those of AT + AE trajectories. In addition, different patterns of trajectory types among AR events are closely linked to upper level potential vorticity (PV) anomalies; 66% of AR events are associated with anticyclonic Rossby wave breaking events.
On some bisymmetric functions on closed intervals

The author presents some technical results concerning binary operations on closed intervals of real numbers. The main goal is to develop a unified approach to t-norms, t-conorms, and means. Although t-norms, t-conorms, and means are quite different operations with respect to their properties, there is a particular common property which they share. It is called bisymmetry. The class of quasi-linear functions satisfying the bisymmetry condition is completely described. These functions are important tools in modeling generalized implication functions in the framework of fuzzy logic. >
The Foundational Cryptography Framework

We present the Foundational Cryptography Framework FCF for developing and checking complete proofs of security for cryptographic schemes within a proof assistant. This is a general-purpose framework that is capable of modeling and reasoning about a wide range of cryptographic schemes, security definitions, and assumptions. Security is proven in the computational model, and the proof provides concrete bounds as well as asymptotic conclusions. FCF provides a language for probabilistic programs, a theory that is used to reason about programs, and a library of tactics and definitions that are useful in proofs about cryptography. The framework is designed to leverage fully the existing theory and capabilities of the Coq proof assistant in order to reduce the effort required to develop proofs.
73 GHz wideband millimeter-wave foliage and ground reflection measurements and models

This paper presents 73 GHz wideband outdoor foliage and ground reflection measurements. Propagation measurements were made with a 400 Megachips-per-second sliding correlator channel sounder, with rotatable 27 dBi (7° half-power beamwidth) horn antennas at both the transmitter and receiver, to study foliage-induced scattering and de-polarization effects, to assist in developing future wireless systems that will use adaptive array antennas. Signal attenuation through foliage was measured to be 0.4 dB/m for both co- and cross-polarized antenna configurations. Measured ground reflection coefficients for dirt and gravel ranged from 0.02 to 0.34, for incident angles ranging from 60° to 81° (with respect to the normal incidence of the surface). These data are useful for link budget design and site-specific (ray-tracing) models for future millimeter-wave communications systems.
Adaptive shortest-path routing under unknown and stochastically varying link states

We consider adaptive shortest-path routing in wireless networks. In this problem, we aim to optimize the quality of communication between a source and a destination through adaptive path selection. Due to the randomness and uncertainties in the network dynamics, the state of each communication link varies over time according to a stochastic process with unknown distributions. The link states are not directly observable. The aggregated end-to-end cost of a path from the source to the destination is revealed after the path is chosen for communication. The objective is an adaptive path selection algorithm that minimizes regret defined as the additional cost over the ideal scenario where the best path is known a priori. This problem can be cast as a variation of the classic multi-armed bandit (MAB) problem with each path as an arm and arms dependent through common links. We show that by exploiting arm dependencies, a regret polynomial with the network size can be achieved while maintaining the optimal logarithmic order with time. This is in sharp contrast with the exponential regret order with the network size offered by a direct application of the classic MAB policies that ignores arm dependencies. Furthermore, our results are obtained under a general model of link state distributions (including heavy-tailed distributions). These results find applications in cognitive radio and ad hoc networks with unknown and dynamic communication environments.
Failure of Intracoronary Nitroglycerin to Alleviate Pacing-Induced Angina

Relief of angina by nitroglycerine has been attributed to two possible mechanisms: (1) Increase in myocardial blood supply by direct action of the drug on the coronary arteries. (2) Reduction in myocardial oxygen demand by action of the drug on the systemic circulation. Sublingual application of nitroglycerin in previous studies did not allow the ruling out of the operation of either or both mechanisms. This study was, therefore, designed in such a way that the effect of the direct action of nitroglycerin on the coronary bed on angina could be studied in the absence of changes in the systemic circulation. In 25 patients undergoing cardiac catheterization and coronary arteriography as possible candidates for revascularization surgery, nitroglycerin, 0.075 mg in 1 ml of 5% dextrose, was injected into the left coronary artery through the angiographic catheter during angina pectoris induced by pacing. Coronary sinus blood flow by the continuous thermodilution method, femoral artery blood pressure, and lead V5...
Ignition of a Deuterium Micro-Detonation with a Gigavolt Super Marx Generator

The Centurion–Halite experiment demonstrated the feasibility of igniting a deuterium–tritium micro-explosion with an energy of not more than a few megajoule, and the Mike test, the feasibility of a pure deuterium explosion with an energy of more than 106 MJ. In both cases the ignition energy was supplied by a fission bomb explosive. While an energy of a few megajoule, to be released in the time required of less than 10−9 s, can be supplied by lasers and intense particle beams, this is not enough to ignite a pure deuterium explosion. Because the deuterium–tritium reaction depends on the availability of lithium, the non-fission ignition of a pure deuterium fusion reaction would be highly desirable. It is shown that this goal can conceivably be reached with a “Super Marx Generator”, where a large number of “ordinary” Marx generators charge (magnetically insulated) fast high voltage capacitors of a second stage Marx generator, called a “Super Marx Generator”, ultimately reaching gigavolt potentials with an energy output in excess of 100 MJ. An intense 107 Ampere-GeV proton beam drawn from a “Super Marx Generator” can ignite a deuterium thermonuclear detonation wave in a compressed deuterium cylinder, where the strong magnetic field of the proton beam entraps the charged fusion reaction products inside the cylinder. In solving the stand-off problem, the stiffness of a GeV proton beam permits to place the deuterium target at a comparatively large distance from the wall of a cavity confining the deuterium micro-explosion.
A New Formulation of Multiple-Input Multiple-Output Quantitative Feedback Theory

The QFT robust performance problem in its entirety may be reduced to an H∞ problem by casting each specification as a frequency domain constraint on the nominal sensitivity function and the complementary sensitivity function. It is shown that the existence of a solution to a standard H∞ problem guarantees a solution to the QFT problem whereas the existence of a QFT solution does not necessarily guarantee an H∞ solution. A solution obtained via this formulation for the QFT problem is in general more conservative when compared to what may be obtained from classical QFT loopshaping. However, one does not have to restrict the QFT controller to be diagonal as is usually done in MIMO-QFT. In addition, a simple constructive approach is provided for the design of a prefilter matrix for MIMO systems. In the standard QFT approach, the synthesis of a prefilter matrix for the MIMO case is much more involved than that of the SISO case.
Dissipative effects from transport and viscous hydrodynamics

We compare 2 → 2 covariant transport theory and causal Israel–Stewart hydrodynamics in a (2 + 1)-dimensional longitudinally boost-invariant geometry with RHIC-like initial conditions and a conformal e = 3p equation of state. The pressure evolution in the center of the collision zone and the final differential elliptic flow v2(pT) from the two theories agree remarkably well for a small shear viscosity to entropy density ratio η/s ≈ 1/(4π), and also for a large cross section σ ≈ 50 mb. A key to this agreement is keeping all terms in the Israel–Stewart equations of motion. Our results indicate promising prospects for the applicability of Israel–Stewart dissipative hydrodynamics at RHIC, provided the shear viscosity of hot and dense quark–gluon matter is indeed very small for the relevant temperatures T ~ 200–500 MeV.
Spin Polarized Current Generation from Quantum Dots without Magnetic Fields

An unpolarized charge current passing through a chaotic quantum dot with spin-orbit coupling can produce a spin-polarized exit current without magnetic fields or ferromagnets. We use random matrix theory to estimate the typical spin polarization as a function of the number of channels in each lead in the limit of large spin-orbit coupling. We find rms spin polarizations up to 45% with one input channel and two output channels. Finite temperature and dephasing both suppress the effect, and we include dephasing effects using a variation of the third lead model. If there is only one channel in the output lead, no spin polarization can be produced, but we show that dephasing lifts this restriction.
Charge Transport in Weyl Semimetals

We study transport in Weyl semimetals with N isotropic Weyl nodes in the presence of Coulomb interactions or disorder at temperature T. In the interacting clean limit, we determine the conductivity σ(ω,T) by solving a quantum Boltzmann equation within a "leading log" approximation and find it to be proportional to T, up to logarithmic factors arising from the flow of couplings. In the noninteracting disordered case, we compute the Kubo conductivity and show that it behaves differently for ω > T: in the former regime we recover a previous result, of a finite dc conductivity and a Drude width vanishing as NT(2); in the latter, we find that σ(ω,T) vanishes linearly with ω with a leading term as T → 0 equal to the clean, free-fermion result: σ(0)((N))(ω,T = 0) = Ne(2)/12h|ω|/v(F). We compare our results to transport data on Y(2)Ir(2)O(7) and comment on the possible relevance to recent experiments on Eu(2)Ir(2)O(7).
Hybrid mesons from lattice QCD

Abstract Recent lattice simulation studies of heavy-quark hybrid mesons in which the quark and antiquark are bound together by an excited gluon field are summarized.
Enantioselective catalytic intramolecular hydroacylation

Abstract Catalysts of the type [Rh(diphosphine)] + catalyze intramolecular cyclization of 4-pentenals to cyclopentanones. By using chiral diphosphines, 4-substituted pentenals are converted to β-substituted cyclopentanones with unusually high enantioselectivities. The mechanism of hydroacylation is exceptionally complex and has been elucidated by deuterium labeling studies. It is shown that the enantioselection is controlled by a series of intermediates and cannot be ascribed to a single step.
Nonlinear Force/Pressure Tracking of an Electro-Hydraulic Actuator

In this paper, a Lyapunov-based control algorithm is developed for the force/pressure tracking control of an electro-hydraulic actuator. The controller relies on an accurate model of the system. To compensate for the parameter uncertainties, a standard parameter adaptation based on Lyapunov analysis is applied. The control law is coupled with the adaptation scheme and applied to an experimental system. Friction modeling and compensation for pressure tracking are discussed and experimental results shown. The results show that the nonlinear control algorithm together with the adaptation scheme gives a good performance for the specified task.
The Measurement of Boundary Layers on a Compressor Blade in Cascade: Part 4—Flow Fields for Incidence Angles of −1.5 and −8.5 Degrees

Measurements, made with laser Doppler velocimetry, about a double-circular-arc compressor blade in cascade are presented for −1.5 and −8.5 deg incidence angles and a chord Reynolds number near 500,000. Comparisons between the results of the current study and those of our earlier work at a 5.0 deg incidence are made. It is found that in spite of the relative sophistication of the measurement techniques, transition on the pressure surface at the −1.5 deg incidence is dominated by a separation “bubble” too small to be detected by the laser Doppler velocimeter. The development of the boundary layers at −1.5 and 5.0 deg is found to be similar. In contrast to the flow at these two incidence angles, the leading edge separation bubble is on the pressure surface for the −8.5 deg incidence. Here, all of the measured boundary layers on the pressure surface are turbulent—but extremely thin—while on the suction surface, a laminar separation/turbulent reattachment bubble lies between roughly 35 percent and 60 percent chord. This bubble is quite thin, and some problems in interpreting the backflow data are discussed.
Superheavy supersymmetry from scalar mass ??? A parameter fixed points

Abstract In supersymmetric models, the well-known tension between naturalness and experimental constraints is relieved if the squarks and sleptons of the first two generations are superheavy, with masses m heavy ≳10 TeV , and all other superpartners are light, with masses m light ≲1 TeV . We show that even if all scalar masses and trilinear A parameters are of order m heavy at some high scale, a hierarchy of m heavy 2 / m light 2 ∼400 may be generated dynamically through renormalization group evolution. The required high energy relations are consistent with grand unification, or, alternatively, may be realized in moduli-dominated supersymmetry-breaking scenarios.
Self-Censorship in Public Discourse A Theory of “Political Correctness” and Related Phenomena

Uncertainty about what motivates “senders” of public messages leads “receivers” to “read between the lines” to discern the sender's deepest commitments. Anticipating this, senders “write between the lines,” editing their expressions so as to further their own ends. I examine how this interactive process of inference and deceit affects the quality and extent of public deliberations on sensitive issues. A principle conclusion is that genuine moral discourse on difficult social issues can become impossible when the risks of upsetting some portion of one's audience are too great. Reliance on euphemism and platitude should be expected in this strategic climate. Groups may embark on a tragic course of action, believed by many at the outset to be ill-conceived, but that has become impossible to criticize.
In-Flight Performance of the High Energy X-Ray Timing Experiment on the Rossi X-Ray Timing Explorer

The High Energy X-Ray Timing Experiment (HEXTE) is one of three scientific instruments aboard the Rossi X-Ray Timing Explorer (RXTE), which was launched on 1995 December 30. RXTE performs timing and spectral studies of bright X-ray sources to determine the physical parameters of these systems. The HEXTE consists of two independent clusters of detectors, each cluster containing four NaI(Tl)/CsI(Na) phoswich scintillation counters sharing a common 1° FWHM field of view. The field of view of each cluster is switched on and off source to provide near real-time background measurements. The net open area of the eight detectors is 1600 cm2, and each detector covers the energy range 15-250 keV with an average energy resolution of 15.4% at 60 keV. The in-flight performance of the HEXTE is described, the light curve and spectrum of the Crab Nebula/pulsar is given, and the 15-240 keV spectrum of the weak source, active galaxy MCG +8-11-11 is presented to demonstrate the weak source spectral capabilities of HEXTE.
Finite Element Calculation of Microwave Absorption by the Cranial Structure

Using an axisymmetric inhomogeneous lossy dielectric model of the human cranial structure, calculations yielding interiorabsorbed power density spatial distributions and whole-body cross sections are presented. These computations are preformed by way of a finite element implementation of the coupled azimuthal potential formulation. Results are considered for two angles of plane wave incidence, with two orthogonal polarizations, at the frequencies of 1 and 3 GHz. Comparisons are made with a simpler multilayered spherical model. Attention is given to the sensitivity of "hot spot" intensities to incident field orientations and model parameter uncertainties.