Miracle-dz/UniFAR-FTUs huggingface dataset:
MIMO Radar Waveform Design in Colored Noise Based on Information Theory

In this paper, we consider multiple input multiple output (MIMO) radar waveform design in colored noise. Two information theoretic measures are used as criterions for optimal waveform design under transmitted power constraint. The first one is by maximizing the mutual information between target impulse response and target echoes; the second one is by maximizing the relative entropy between two hypotheses: in the first hypothesis we assume the target is not present in the echoes while in the second hypothesis we assume the target exists in the echoes. We derive optimal solutions for both cases. Interestingly, both optimal solutions require that transmitted waveform should “match” with the target and noise. However, the optimal solutions of the two problems lead to different power allocation strategies.
A New Approach Towards Graph Coloring

Consider the problem of deciding whether a graph is 3-colorable. This problem is NP-complete. The optimization version of this problem is, given a 3-colorable graph G, color it using as few colors as possible. In the regime of polynomial time approximation algorithms, this problem has been studied extensively [Wig82, Blu94, KMS98, ACC06, Chl07]. The current best known approximation factor is achieved by an algorithm due to Kawarabayashi and Thorup [iKT12] which uses at most n0.2038 colors to color a 3-colorable graph. Surprisingly, very few lower bounds are known for the approximability of the chromatic number of a graph. Dinur, Mossel and Regev [DMR06] showed that it’s hard to color a 3-colorable graph with O(1) colors based on a variant of Unique Games Conjecture. Feige, Langberg and Schechtman [FLS02] showed that the simple SDP relaxation has an integrality gap of at least n0.157. In a recent work, Barak, Raghavendra and Steurer [BRS11] and Guruswami and Sinop [GS11] showed a new way to round vector solutions of semidefinite programming (SDP) hierarchies into integral solutions, based on a connection between these hierarchies and the spectrum of the input graph. In another recent work [BBH12], Barak et. al. gave a natural polynomial time algorithm based on the ‘Sum of Squares’ SDP hierarchy that solves the previously proposed hard instances for Unique Games [RS09, KS09, KPS10, BGH11]. Along these line, we propose to study a new approach towards sub-exponential time algorithms with improved approximation guarantees for combinatorial problems like graph coloring, vertex cover, etc. Barak et. al.’s algorithm [BRS11] can be viewed as a divide-and-conquer approach. Consider an instance I of MAX 2-CSP. The constraint graph G of I is first partitioned into sets with small ε-threshold rank 1 such that only O(ε) fraction of the edges are cut. This step is same as the preprocession step used in Arora, Barak and Steurer’s sub-exponential time algorithm for unique games [ABS10]. Barak et. al. show that graphs with low threshold rank are ‘easy’. More formally, they show that O(rank1−ε(G) levels of the Lasserre hierarchy is sufficient to recover an integral solution from the SDP’s vector solution whose cost2 is at most O(ε) lesser than that of the SDP solution.
Incidences of the improvement of the interactions between MAC and routing protocols on MANET performance

In this paper, we present an improvement for the interactions between MAC and routing protocols to better energy consumption in MANET (Mobile Ad hoc Networks) and show its incidences on the performance of the network. We propose a new approach called IMREE (Improvement of the Interactions between MAC and Routing protocol for Energy Efficient) which exploits tow communication environment parameters. The first one is the number of nodes; our approach reduces the additional energy used to transmit the lost data by making the size of the backoff interval of MAC protocol adaptable to the nodes number in the network. The second parameter is the mobility of nodes; IMR-EE uses also the mobility of nodes to calculate a fairness threshold in order to guarantee the same level of the residual energy for each node in the network. We evaluate our IMR-EE solution with NS (Networks Simulator) and study its incidences on data lost and energy consumption in the network under varied network conditions such as load and mobility. The results showed that IMR-EE outperform MAC standard and allows significant energy saving and an increase in average lifetime of a mobiles nodes in the network.
DYNAMIC AUCTIONS: A SURVEY By Dirk Bergemann and Maher Said March 2010 Revised May 13, 2010 COWLES FOUNDATION DISCUSSION PAPER NO. 1757R COWLES FOUNDATION FOR RESEARCH IN ECONOMICS

We survey the recent literature on designing auctions and mechanisms for dynamic settings. Two settings are considered: those with a dynamic population of agents whose private information remains fixed throughout time; and those with a fixed population of agents whose private information changes across time. Within each of these settings, we discuss both efficient (welfare-maximizing) and optimal (revenue-maximizing) mecha-
Time to line crossing for lane departure avoidance: a theoretical study and an experimental setting

The main goal of this paper is to develop a distance to line crossing (DLC) based computation of time to line crossing (TLC). Different computation methods with increasing complexity are provided. A discussion develops the influence of assumptions generally assumed for approximation. A sensitivity analysis with respect to vehicle parameters and positioning is performed. For TLC computation, both straight and curved vehicle paths are considered. The road curvature being another important variable considered in the proposed computations, an observer for its estimation is then proposed. An evaluation over a digitalized test track is first performed. Real data are then collected through an experiment carried out in test tracks with the equipped prototype vehicle. Based on these real data, TLC is then computed with the theoretically proposed methods. The obtained results outlined the necessity to take into consideration vehicle dynamics to use the TLC as a lane departure indicator.
Nitrate does not compete with abscisic acid as a substrate of AtNPF4.6/NRT1.2/AIT1 in Arabidopsis

We identified a member of the Arabidopsis NRT1/PTR FAMILY (NPF), AtNPF4.6, as an abscisic acid (ABA) transporter, AIT1. AtNPF4.6 was originally characterized as a low-affinity nitrate transporter NRT1.2. We hypothesized that the competition between nitrate and ABA as substrates for AtNPF4.6 might be involved in the interactions between nitrate and ABA signaling. However, the ABA transport activity of AtNPF4.6 was not inhibited by an excess amount of nitrate. In addition, the npf4.6 mutant was less sensitive to ABA than the wild type during germination irrespective of nitrate concentrations in the media. Furthermore, nitrate promoted germination of both wild type and npf4.6 in the presence of ABA. These results do not support the idea of a physiological linkage between nitrate and ABA signals through AtNPF4.6.
Performance evaluation for unsolicited grant service flows in 802.16 networks

In this paper, the performance of unsolicited grant service (UGS) connections defined in IEEE 802.16 Std. is investigated. A simple admission control strategy based on the periodic exhaustive service principle is first introduced to provide Quality of Service (QoS) satisfaction for such connections. The task of system parameter selection and performance evaluation for the UGS flows is tackled. In particular, the maximum retransmission limit that works along with the embedded Automatic Repeat reQuest (ARQ) mechanism is emphasized. A novel transferred model is formulated such that the lossy characteristic of the wireless channels in real networks can be completely engineered by way of the traffic arrival pattern and the size of the messages in the proposed model. Significant merits and efficiency have been identified in the proposed model through extensive simulation, where a complete match between the analytical and simulation results is observed.
Towards Automated Recognition of Human Emotions using EEG

Towards Automated Recognition of Human Emotions using EEG Haiyan Xu Master of Applied Science Graduate Department of Electrical and Computer Engineering University of Toronto 2012 Emotional states greatly influence many areas in our daily lives, such as: learning, decision making and interaction with others. Therefore, the ability to detect and recognize one’s emotional states is essential in intelligence Human Machine Interaction (HMI). In this thesis, a pattern classification framework was developed to sense and communicate emotion changes expressed by the Central Nervous System (CNS) through the use of EEG signals. More specifically, an EEG-based subject-dependent affect recognition system was developed to quantitatively measure and categorize three affect states: Positively excited, neutral and negatively excited. Several existing feature extraction algorithms and classifiers were researched, analyzed and evaluated through a series of classification simulations using a publicly available emotion-based EEG database. Simulation results were presented followed by an interpretation discussion. The findings in this thesis can be useful for the design of affect sensitive applications such as augmented means of communication for severely disabled people that cannot directly express their emotions. Furthermore, we have shown that with significantly reduced number of channels, classification rates maintained a level that is feasible for emotion recognition. Thus current HMI paradigms to integrate consumer electronics such as smart hand-held devices with commercially available EEG headsets is promising and will significantly broaden the application cases.
Impact of Pursuer Speed on the Performance of Distributed Surveillance Sensor Network

The main purpose of developing a surveillance system is to become aware of unauthorized target in wireless sensor networks (WSNs). The challenge is how efficiently and fast the traversal can be perceived in a WSN. This paper demonstrates the advantages of using mobile sink, which is called as a‘pursuer’, in order to observe/ capture the target in a distributed surveillance sensor network (DSSN). In this target tracking scheme, we consider a vehicle tracking. The nodes aggregate their observations in the direction of the approaching vehicle. The network then uses an extended Kalman filter (EKF) to combine the measurements from multiple measurements to locate the vehicle. In order to rapidly select the best nodes as a ”master node” and ”slave node” to localize the vehicle with the minimum mean square position error and low power consumption, this paper proposes a sophisticated observation of relative distance between the vehicle and the pursuer. Performance evaluation shows that the pursuer is able to capture the vehicle quickly and efficiently, while synergies between the energy consumption and pursuer speed are explored.
The ring statistics - how to separate E- and B-modes of cosmic shear correlation functions on a finite interval

Aims. Cosmic shear, the distortion of images of distant sources by the tidal gravitational field of the large-scale matter distribution in the Universe, is one of the most powerful cosmological probes. The measured shear field may be due not only to the gravitational lensing effect, but may contain systematic effects from the measurement process or intrinsic alignment of galaxy shapes. One of the main probes for these systematics is the division of the shear field into E- and B-mode shear, where lensing only produces the former. As shown in a recent note, all currently used E-/B-mode separation methods for the shear correlation functions $\xi_\pm$ require them to be measured to arbitrarily small and/or large separations which is of course not feasible in practice. Methods. We derive second-order shear statistics which provide a clean separation into E- and B-modes from measurements of $\xi_\pm(\vartheta)$ over a finite interval only. We call these new statistics the circle and ring statistics, respectively; the latter is obtained by an integral over the former. The mathematical properties of these new shear statistics are obtained, as well as specific expressions for applying them to observed data. Results. It is shown that an E-/B-mode separation can be performed on measurements of $\xi_\pm$ over a finite interval in angular separation, using the ring statistics. We furthermore generalize this result to derive the most general class of second-order shear statistics which provide a separation of E- and B-mode shear on a given angular interval $\vartheta_{\rm min}\le \vartheta\le \vartheta_{\rm max}$. In view of these generalization, we discuss the aperture dispersion and the shear dispersion and their relation to the shear correlation functions. Our results will be of practical use particularly for future cosmic shear surveys where highly precise measurements of the shear will become available and where control of systematics will be mandatory.
125 to 181 GHz fundamental-wave VCO chips in SiGe technology

This paper presents four signal-generation chips that comprise a fundamental-wave voltage-controlled oscillator (VCO), an output buffer, and a divide-by-32 prescaler. The VCOs with contiguous tuning ranges cover almost the full waveguide band from 110 to 170GHz (D-band). The fastest VCO operates at up to 181GHz in combination with the prescaler. The VCOs run on 1.8V, draw ~35 mA, and achieve a single-sideband phase noise ranging from -92 to -82 dBc/Hz at 1MHz offset frequency. Power consumption of the high-speed frequency divider in the first prescaler stage is 70mW. The circuits are based on an Infineon SiGe technology, which features HBTs with an fmax of 340 GHz.
Tolerating Multiple Failures In Raid Architectures With Optimal Storage And Uniform Declustering

We present DATUM, a novel method for tolerating multiple disk failures in disk arrays. DATUM is the first known method that can mask any given number of failures, requires an optimal amount of redundant storage space, and spreads reconstruction accesses uniformly over disks in the presence of failures without needing large layout tables in controller memory. Our approach is based on information dispersal, a coding technique that admits an efficient hardware implementation. As the method does not restrict the configuration parameters of the disk array, many existing RAID organizations are particular cases of DATUM. A detailed performance comparison with two other approaches shows that DATUM'S response times are similar to those of the best competitor when two or less disks fail, and that the performance degrades gracefully when more than two disks fail.
A practical SIM learning formulation with margin capacity control

Given a finite i.i. d. dataset of the form (yi, Xi), the Single Index Model (SIM) learning problem is to estimate a regression of the form u o f(xi) where u is some Lipschitz-continuous nondecreasing function and / is a linear function. This paper applies Vapnik's Structural Risk Minimization principle to SIM learning. I show that a risk structure for the space of model functions/gives a risk structure for the space of functions u o f. Second, I provide a practical learning formulation for SIM using a risk structure defined by margin-based capacity control. The new learning formulation is compared with support vector regression.
Divalent cation selectivity for external block of voltage-dependent Na+ channels prolonged by batrachotoxin. Zn2+ induces discrete substates in cardiac Na+ channels

The mechanism of block of voltage-dependent Na+ channels by extracellular divalent cations was investigated in a quantitative comparison of two distinct Na+ channel subtypes incorporated into planar bilayers in the presence of batrachotoxin. External Ca2+ and other divalent cations induced a fast voltage-dependent block observed as a reduction in unitary current for tetrodotoxin-sensitive Na+ channels of rat skeletal muscle and tetrodotoxin-insensitive Na+ channels of canine heart ventricular muscle. Using a simple model of voltage-dependent binding to a single site, these two distinct Na+ channel subtypes exhibited virtually the same affinity and voltage dependence for fast block by Ca2+ and a number of other divalent cations. This group of divalent cations exhibited an affinity sequence of Co congruent to Ni greater than Mn greater than Ca greater than Mg greater than Sr greater than Ba, following an inverse correlation between binding affinity and ionic radius. The voltage dependence of fast Ca2+ block was essentially independent of CaCl2 concentration; however, at constant voltage the Ca2+ concentration dependence of fast block deviated from a Langmuir isotherm in the manner expected for an effect of negative surface charge. Titration curves for fast Ca2+ block were fit to a simplified model based on a single Ca2+ binding site and the Gouy-Chapman theory of surface charge. This model gave similar estimates of negative surface charge density in the vicinity of the Ca2+ blocking site for muscle and heart Na+ channels. In contrast to other divalent cations listed above, Cd2+ and Zn2+ are more potent blockers of heart Na+ channels than muscle Na+ channels. Cd2+ induced a fast, voltage-dependent block in both Na+ channel subtypes with a 46- fold higher affinity at 0 mV for heart (KB = 0.37 mM) vs. muscle (KB = 17 mM). Zn2+ induced a fast, voltage-dependent block of muscle Na+ channels with low affinity (KB = 7.5 mM at 0 mV). In contrast, micromolar Zn2+ induced brief closures of heart Na+ channels that were resolved as discrete substate events at the single-channel level with an apparent blocking affinity of KB = 0.067 mM at 0 mV, or 110-fold higher affinity for Zn2+ compared with the muscle channel. High- affinity block of the heart channel by Cd2+ and Zn2+ exhibited approximately the same voltage dependence (e-fold per 60 mV) as low affinity block of the muscle subtype (e-fold per 54 mV), suggesting that the block occurs at structurally analogous sites in the two Na+ channels. (ABSTRACT TRUNCATED AT 400 WORDS)
The impact of expert visual guidance on trainee visual search strategy, visual attention and motor skills

Minimally invasive and robotic surgery changes the capacity for surgical mentors to guide their trainees with the control customary to open surgery. This neuroergonomic study aims to assess a “Collaborative Gaze Channel” (CGC); which detects trainer gaze-behavior and displays the point of regard to the trainee. A randomized crossover study was conducted in which twenty subjects performed a simulated robotic surgical task necessitating collaboration either with verbal (control condition) or visual guidance with CGC (study condition). Trainee occipito-parietal (O-P) cortical function was assessed with optical topography (OT) and gaze-behavior was evaluated using video-oculography. Performance during gaze-assistance was significantly superior [biopsy number: (mean ± SD): control = 5.6 ± 1.8 vs. CGC = 6.6 ± 2.0; p < 0.05] and was associated with significantly lower O-P cortical activity [ΔHbO2 mMol × cm [median (IQR)] control = 2.5 (12.0) vs. CGC 0.63 (11.2), p < 0.001]. A random effect model (REM) confirmed the association between guidance mode and O-P excitation. Network cost and global efficiency were not significantly influenced by guidance mode. A gaze channel enhances performance, modulates visual search, and alleviates the burden in brain centers subserving visual attention and does not induce changes in the trainee’s O-P functional network observable with the current OT technique. The results imply that through visual guidance, attentional resources may be liberated, potentially improving the capability of trainees to attend to other safety critical events during the procedure.
Individual And Collective Innovative Use Of Enterprise System- Mediating Role Of Collective Learning

Although information system researchers have long recognized the possibility for collective-level information system use patterns and outcomes to emerge from individual-level IT use behavior, few have empirical the key factors involved in this individual-collective innovative use process. This study builds a research model drawing on the concepts to investigate how between individual innovative use in group influences collective innovative use of enterprise systems. And this study argues that collective learning plays the role of interactive processing among individuals, such that it can mediate the effect of individual innovative use on collective innovative use. To test the research hypotheses, a field study is conducted on 200 users in 55 work group of different enterprise in China. The results indicated that individual innovative use in group has an effect on collective innovative use, and the effect of individual innovative use on collective innovative use are mediated by collective learning.
Analysis of Voltage Doubler Behavior of 2.45-GHz Voltage Doubler-Type Rectenna

This paper describes the voltage doubler (VD) behavior of a 2.45-GHz VD-type rectenna. An important feature of the developed VD-type rectenna is the absence of the charge pump capacitor that is present in conventional VDs. Based on the circuit simulation and measurement results, the developed VD-type rectenna shows drastic improvement to the radio frequency-to-direct current (RF–dc) conversion efficiency in comparison with a half-wave rectifier (HWR)-type rectenna at output loads exceeding $100~\Omega $ . From the simulation, both the VD- and HWR-type rectennas show VD behavior, even without the charge pump capacitor. This behavior was found to be attributable to the electric charge stored in the junction and package capacitances of the Schottky barrier diode in the rectennas. Additionally, it was found that the improvement of the RF–dc conversion efficiency is caused by the voltage conservation in the series diode. This improvement is dependent on the microwave period and the electric discharge time constant. When the microwave period is comparable with the electric discharge time constant, the VD-type rectenna conserves a dc voltage even when the input microwave voltage is negative. These phenomena were observed by analyzing the voltage and current waveforms of the rectenna equivalent circuit obtained via circuit simulation.
Accentuation of Adpositions and Particles in a Text-to-Speech System for Dutch

In this paper I propose an accent placement algorithm that locates accents on adpositions and particles for the use in a Dutch text-to-speech (TTS) system. The algorithm is intended to be a refinement of the rule that accents only content words, which is used in most TTS systems. Before the algorithm is set up, I discuss when adpositions and particles are accented in Dutch. For this empirical research, I made use of the Spoken Dutch Corpus (CGN) as empirical material. The combination of part-of-speech, syntactic as well as prosodic information for approximately 125,000 words in the CGN made it possible to determine whether the accentuation of adpositions and particles depends on their syntactic use within a sentence, or on the syntactic use of other constituents in the same sentence. The proposed accentuation algorithm takes a dependency tree with part-of-speech information as input.