Miracle-dz/UniFAR-FTUs huggingface dataset:
Latency Equalization : A Routing Service for Interactive Applications

Multi-party interactive network applications such as teleconferencing, network gaming and online trading are gaining popularity. In addition to end-to-end latency bounds, these applications require that the perceiveddelay difference among multiple users of the service is minimized. We propose a Latency EQualization (LEQ) servicefor interactive network applications, which equalizes the perceived latency for al l users of an application. To scalably and effectively implement LEQ service, network support is essential. We propose to deploy a few hubs in provider networks to redirect the packets of interactive applications through routes with similar end-to-end delay. We formulate the hub placement problem, prove its NP hardness, and provide a greedy algorithm to solve this probl em. Through extensive simulations, we show that our LEQ hubrouting architecture significantly reduces delay difference in large network topologies. The LEQ architecture is incrementally deployable in today’s networks, requiring only a few nodes t o be modified to perform the LEQ service.
3D colour object reconstruction based on Growing Neural Gas

With the advent of low-cost 3D sensors and 3D printers, surface reconstruction has become an important research topic in the last years. In this work, we propose an automatic method for 3D surface reconstruction from raw unorganized point clouds acquired using low-cost sensors. We have modified the Growing Neural Gas (GNG) network, which is a suitable model because of its flexibility, rapid adaptation and excellent quality of representation, to perform 3D surface reconstruction of different real-world objects. Some improvements have been made on the original algorithm considering colour information during the learning stage and creating complete triangular meshes instead of basic wire-frame representations. The proposed method is able to create 3D faces online, whereas existing 3D reconstruction methods based on Self-Organizing Maps (SOMs) required post-processing steps to close gaps and holes produced during the 3D reconstruction process. Performed experiments validated how the proposed method improves existing techniques removing post-processing steps and including colour information in the final triangular mesh.
SMOWR : Sequential Minimal Optimization with Weighted Ray

Résumé : Les SVM ont pour argument leurs fondements mathématiques et des résultats pratiques très conva incant. Cependant dans le domaine du data mining, les SVM p résentent un handicape sérieux. En effet face à de larges ens mbles de données, les SVM sont très gourmandes en temps de c alcule et en mémoire vive. Notre proposition s’inscrit dans ce c adre là. Nous proposons une nouvelle méthode plus apte à faire fa ce à de gros volumes de données.
Extracting the earth response from noise measurements

Recent research has shown that noise can be turned from a nuisance into a useful seismic source. In seismology and other fields in science and engineering, the estimation of the system response from noise measurements has proven to be powerful technique. To convey the essence of the method, we first treat the simplest case of a homogeneous medium to show how noise measurements can be used to estimate waves that propagate between sensors. We provide an overview of research in physics that dates back more than 100 years that shows that random field fluctuations contain information about the system response. This principle has found extensive use in surface wave seismology, but can also be applied to the estimation of body waves. Because noise provides a continuous illumination of the subsurface, the extracted response in ideally suited for time-lapse monitoring. We present examples of the softening of soil after the 2011 Tohoku-oki earthquake, the detection of a precursor to a landslide, and monitoring the lunar soil.
The big fish in a small pond: Accommodation and the processing of novel definites

Definite phrases are often used to introduce new entities into discourse but the conditions under which this is possible are not well understood. Evans (2005) argued that the definite article may be used to introduce an entity if it is the most relevant of its type in its local frame of reference, dubbing this the “Small world hypothesis. ” Additional arguments will be given in support of the Small world hypothesis, and the hypothesis will be developed in an attempt to understand the role of the small frame in processing novel definites. It will be argued that the definite article does not carry a familiarity presupposition, but only an existential and maximality presupposition. Maximize presupposition is also important and plays a critical role in regulating the impact of the Small world hypothesis: a definite will be favored under circumstances where it may be used unless it brings along unwanted implicatures, typically implicatures concerning number. Other types of presupposition accommodation are also considered with an eye to evaluating the claim that distinct classes of presuppositions exist.
TROPOSPHERIC OZONE INFORMATION IN GOME LONG-TERM DATA RECORD

Ozone Profile Retrieval Algorithm (OPERA) version R2 has generated a long-term, global record of atmospheric ozone profile data from backscattered ultraviolet spectra measured since 1996 by ESA’s ERS2 Global Ozone Monitoring Experiment (GOME). The GOME/OPERA data record contains tropospheric ozone information that has been characterised by an ensemble of complementary diagnostic techniques. In addition to classical ground-based validations based on comparisons of the retrieved ozone data with correlative ozonesonde measurements, the tropospheric information content has been explored via an extensive analysis of the averaging kernels associated with the retrieval and an assessment of the vertical smoothing error. Results highlight geographical, seasonal and longer-term variations of the tropospheric information contributed by the GOME measurement and of its agreement with ozonesonde network observations. The impact of these findings on the geophysical usability of GOME OPERA R2 tropospheric ozone data is discussed for applications in the fields of tropospheric chemistry, air pollution monitoring and atmospheric dynamics.
Final Report – 18-799 b Algorithms and Computation in Signal Processing

The optimization of matrix-matrix multiplication (MMM) performance has been well studied on conventional general-purpose processors like the Intel Pentium 4. Fast algorithms, such as those in the Goto and ATLAS BLAS libraries, exploit common microarchitectural features including superscalar execution and the cache and TLB hierarchy to achieve near-peak performance. However, the microarchitectures of embedded processors typically use explicitly parallel in-order execution and have configurable memory hierarchies. Thus, approaches that find good MMM code for processors like the Pentium may not be as effective for embedded processors. For this project, I investigated the methods needed to achieve high performance MMM on an embedded VLIW (very-long instruction word) processor, the Texas Instruments C6713 floating-point DSP. This processor has three distinguishing features that affect an MMM implementation: an 8-wide in-order pipeline, an L2 mapped RAM, i.e., software-controlled scratch pad, and a direct memory access (DMA) engine. I present MMM implementations obtained through search and a model-driven approach that leverage the DSP microarchitecture. By using the scratch pad and DMA, I observed a 51% performance increase over a blocked MMM implementation.
Fine-grained sketch-based image retrieval: The role of part-aware attributes

We study the problem of fine-grained sketch-based image retrieval. By performing instance-level (rather than category-level) retrieval, it embodies a timely and practical application, particularly with the ubiquitous availability of touchscreens. Three factors contribute to the challenging nature of the problem: (i) free-hand sketches are inherently abstract and iconic, making visual comparisons with photos more difficult, (ii) sketches and photos are in two different visual domains, i.e. black and white lines vs. color pixels, and (iii) fine-grained distinctions are especially challenging when executed across domain and abstraction-level. To address this, we propose to detect visual attributes at part-level, in order to build a new representation that not only captures fine-grained characteristics but also traverses across visual domains. More specifically, (i) we propose a dataset with 304 photos and 912 sketches, where each sketch and photo is annotated with its semantic parts and associated part-level attributes, and with the help of this dataset, we investigate (ii) how strongly-supervised deformable part-based models can be learned that subsequently enable automatic detection of part-level attributes, and (iii) a novel matching framework that synergistically integrates low-level features, mid-level geometric structure and high-level semantic attributes to boost retrieval performance. Extensive experiments conducted on our new dataset demonstrate value of the proposed method.
Can Emissions Trading Work Beyond A National Program: Some Practical Observations on the Available Tools

Over the past ten years, the concept of emission trading has become the darling of innovative regulators and business people in the United States. The 1990 Amendments to the Clean Air Act contained the first nation-wide emission trading program for the reduction of Acid Rain. ' Several regional air quality districts, like the South Coast Air Quality Management District ("SCAQMD") Regional Clean Air Incentives Market ("RECLAIM") program in California, and the State of Illinois, have also developed emission trading programs to enable them to attain the National Ambient Air Quality Standards ("NAAQS") for various pollutants.2 Most recently, in the context of ongoing meetings of the subsidiary bodies of the United Nations Conference on Environment and Development Framework Convention on Climate Change ("FCCC"),3 the United States has proposed
Implementation of a semi-formal verification for embedded systems

In the era of billion-transistor design, it is critical to establish effective verification technologies from the system level, all the way down to the implementations. This paper presents a PNPM simulation based verification methodology for equivalence checking between different abstraction levels and property verification at different abstraction levels. How to implement it with coverage-aware input biasing is elaborated.
activity after enzyme assembly on the phagosome regulates NADPH oxidase phox phosphoinositide-binding protein p 40 R-stimulated activation of the NADPH oxidase :

http://bloodjournal.hematologylibrary. org/content/112/9/3867.full. html Updated information and services can be found at: (973 articles) Phagocytes  Articles on similar topics can be found in the following Blood collections http://bloodjournal.hematologylibrary. org/site/misc/rights.xhtml#repub_requests Information about reproducing this article in parts or in its entirety may be found online at: http://bloodjournal.hematologylibrary. org/site/misc/rights.xhtml#reprints Information about ordering reprints may be found online at: http://bloodjournal.hematologylibrary. org/site/subscriptions/index.xhtml Information about subscriptions and ASH membership may be found online at:
Predicting a Song ’ s Path through the Billboard Hot 100

In this project we explore the space of predicting the (n + 1) position in the Billboard Hot 100 charts given the first n positions and musical data. We can then use this prediction as the next entry to predict the (n + 2) entry, and keep repeating this regression until the song drops out of the charts. Considerable research has gone into predicting the commercial success of a song based on its innate characteristics, yet no major effort has endeavored to use previous chart success as a predictor of future success. Our results display a robust prediction engine that leverages both nonmusical and musical features to predict the full path of a song across the Billboard charts.
Information Integration Problem in B 2 B Relationships – A State-ofthe-ar t

In business-to-business (B2B) relationships, enterprises share heterogeneous and distributed information that is the result of decision-making activities involved in inter-enterprise and intra-enterprise processes. The problem of bringing together heterogeneous and distributed computer systems is known as interoperability problem. Interoperability has to be provided on a technical and on an information level. The focus of this paper is to present the backgroung of information interoperability problem in B2B relationships and to identify the challenges in this area.
Impact of dissociation on treatment of depressive and anxiety spectrum disorders with and without personality disorders

Objective The central goal of the study was to analyze the impact of dissociation on the treatment effectiveness in patients with anxiety/neurotic spectrum and depressive disorders with or without comorbid personality disorders. Methods The research sample consisted of inpatients who were hospitalized in the psychiatric department and met the ICD-10 criteria for diagnosis of depressive disorder, panic disorder, generalized anxiety disorder, mixed anxiety–depressive disorder, agoraphobia, social phobia, obsessive compulsive disorder, posttraumatic stress disorder, adjustment disorders, dissociative/conversion disorders, somatoform disorder, or other anxiety/neurotic spectrum disorder. The participants completed these measures at the start and end of the therapeutic program – Beck Depression Inventory, Beck Anxiety Inventory, a subjective version of Clinical Global Impression-Severity, Sheehan Patient-Related Anxiety Scale, and Dissociative Experience Scale. Results A total of 840 patients with anxiety or depressive spectrum disorders, who were resistant to pharmacological treatment on an outpatient basis and were referred for hospitalization for the 6-week complex therapeutic program, were enrolled in this study. Of them, 606 were statistically analyzed. Data from the remaining 234 (27.86%) patients were not used because of various reasons (103 prematurely finished the program, 131 did not fill in most of the questionnaires). The patients’ mean ratings on all measurements were significantly reduced during the treatment. Also, 67.5% reached at least minimal improvement (42.4% showed moderate and more improvement, 35.3% of the patients reached remission). The patients without comorbid personality disorder improved more significantly in the reduction of depressive symptoms than those with comorbid personality disorder. However, there were no significant differences in change in anxiety levels and severity of the mental issues between the patients with and without personality disorders. Higher degree of dissociation at the beginning of the treatment predicted minor improvement, and also, higher therapeutic change was connected to greater reduction of the dissociation level. Conclusion Dissociation is an important factor that influences the treatment effectiveness in anxiety/depression patients with or without personality disorders resistant to previous treatment. Targeting dissociation in the treatment of these disorders may be beneficial.
On the distance observable in the Moyal plane and in a novel two-dimensional space with string-theory pregeometry

Motivation for the study of spacetime noncommutativity comes primarily from its possible use in investigations of (Planck-scale) spacetime fuzziness, but most work focuses on S-matrix/field-theory observables and still very little has been established for geometric observables. We argue that it might be useful to exploit the "pregeometric" formulation of spacetime noncommutativity, which in particular describes the coordinates of the Moyal plane in terms of the phase-space coordinates of a point particle "living" in a auxiliary/fictitious spacetime ($\{x_1,x_2\}_{Moyal} \equiv \{q,p\}_{particle}$). This leads us straightforwardly to a distance operator for the Moyal plane, and allows us to expose some limitations of a previous attempt to describe the "area of a disc" in the Moyal plane. We also observe that from our pregeometric perspective it is rather natural to contemplate a spacetime whose pregeometric picture is based on the phase-space coordinates (fields) of a string. The fact that such "stringspaces" essentially provide spacetime points with extendedness is relevant for the fuzziness of geometric spacetime observables in ways that we preliminarily characterize through an analysis of the distance observable on a two-dimensional stringspace and through the observation that by implementing the Amati-Ciafaloni-Veneziano/Gross-Mende uncertainty relation in the phase space of the pregeometric string one could have stringspaces with a novel type of fuzzy coordinates.
Sonic Hedgehog Control of Size and Shape in Midbrain Pattern Formation

Little is known about how patterns of cell types are organized to form brain structures of appropriate size and shape. To study this process, we employed in vivo electroporation during midbrain development to create ectopic sources of Sonic Hedgehog, a signaling molecule previously shown to specify different neuronal cell types in a concentration-dependent manner in vitro. We provide direct evidence that a Sonic Hedgehog source can control pattern at a distance in brain development and demonstrate that the size, shape, and orientation of the cell populations produced depend on the geometry of the morphogen source. Thus, a single regulatory molecule can coordinate tissue size and shape with cell-type identity in brain development.
Using the PCP to prove fixed parameter hardness

For a minimization (resp, maximization) problem P , and a parameter k, an algorithm is called a (r(k), t(k))-FPT-approximation algorithm, if for an instance I of size n with optimum opt, the algorithm either computes a feasible solution for I, with value at most k · r(k) (resp, at least k/r(k)) or it computes a certificate that k < opt (resp, k > opt), in time t(k) · poly(n). For maximization problems, the condition k/r(k) = o(k) is also required. A problem P is (r, t)-FPT-inapproximable (or, (r, t)FPT-hard) if the problem does not admit an (r, t)-FPT-approximation algorithm. All FPT-hardness results, we are aware off, use the assumptions W [1] 6= FPT or W [2] 6= FPT. This immediately implies that for a minimization (respectively maximization) problems, its not possible to tell between opt = k or opt = k + 1 (respectively, opt = k + 1 and opt = k) in time poly(n) · t(opt) for any function t. Making the hardness stronger requires increasing the gap from k to k + 1 to a large gap r(k). This is usually a very hard thing to do. The difficulty of increasing a gap of k versus k + 1 to a larger one motivates this paper. We suggest a novel way to prove FPT -hardness. Use the standard idea of Gap reductions via the PCP followed by Gap preserving/increasing Reductions that drastically reduces opt. In all our hardness proofs k = opt(I) for some instance I. This does not hold in previous reductions,. In addition the value of k is known, in all our reductions, again a new property. Our proofs are simple, because we overcome the k versus k+1 difficulty. Assuming the eth and the pgc (to be described later) we prove that setcover admits no log opt ratio, for c > 0 for any algorithm with running and time t(opt) = exp ( opt(log f opt) ) · poly(n) for constant f > 0. ∗Maryland University. Supported in part by NSF CAREER award 1053605, NSF grant CCF1161626, ONR YIP award N000141110662, and DARPA/AFOSR grant FA9550-12-1-0423. Email: hajiagha@cs.umd. edu. †KCG holdings Inc., USA Email: rkhandekar@gmail.com ‡Computer Science department, Rutgers University, Camden. Email: guyk@crab.rutgers. edu Partially supported by NSF grant number 1218620. Under the eth alone, we prove that setcover admits no √ logopt ratio, in time exp ( opt(log f opt) ) · poly(n) for constant f > 0. Under the eth we prove clique admits no (c, t(opt)), approximation, for any constant c in time exp(exp(optd)) with d a constant that depends on c. We study the subject of increasing/preserving gaps reductions that make opt small. As a toy problem we study Minimum Maximal Independent Set, (mmis) problem. This problem is not that relevant for FPT, as its not monotone. However, the reduction of opt in this case is non trivial and may have future application. For every slowly increasing function f , and for some parameter q, we can reduce from any instance I of mmis to another instance I ′ of mmis, so that the optimum for a yes instance I ′ is f(q) and the gap between the values of the no instance over the value of a yes instance is q/f(q).
Research on Routing Algorithm Based on the ZigBee-GPRS Technology and the Hypergraph Model

In order to solve problems of centralized heating, household metering, complex structure of sensor nodes in heating networks and enhance accuracy and timeliness of the heating data, we use the ZigBee wireless sensor technology and GPRS remote transmission technique, take the hypergraph theory into heat-supply networks and propose a kind of routing algorithm. This algorithm abstracts the heating network of large-scale, strong connected wireless sensor network as the hypergraph model. It reduces energy consumption of the sensor nodes and improves the reliability of the heating network. Finally, compared the routing algorithm based on the hypergraph model with the classic LEACH algorithm, the algorithm analysis and experimental results show that it can effectively improve the success rate of data transmission, reduce the node’s energy consumption and prolong the lifetime of heating networks.
Effective Lagrangian approach to electroweak baryogenesis: Higgs boson mass limit and electric dipole moments of fermions.

A natural solution to the hierarchy problem of the standard model is to assume new physics to appear at the TeV scale. We parametrize the effects of this new physics in terms of an effective Lagrangian and examine its impact on electroweak baryogenesis. We point out that with such an effective Langrangian successful electroweak baryogenesis implies (i) the Higgs boson lies within the reach of CERN LEP II; and (ii) electric dipole moments of the electron and neutron are detectable in the near future.
Dimensions of collaboration on a tabletop interface for children with autism spectrum disorder

In this paper we describe a co-located suite of games on a tabletop device to support social competence training for children with Autism Spectrum Disorder. This suite has been designed to use patterns of collaboration to support therapists in their use of Cognitive-Behavioral Therapy (CBT). In this paper, we discuss the observations collected during a field study where two therapists used the system for social competence training sessions with 8 children. We conclude with lessons learned from meshing software enhanced collaboration within the CBT model.
Design of a fully integrated array of high-voltage digital-to-analog converters

The first fully integrated array of high voltage (HV) digital-to-analog converters (DACs) was designed in DALSA Semiconductor's 0.8 /spl mu/m CMOS/DMOS HV process technology. The 6-bit 300 V DACs are based on a current-steering, thermometer coded architecture and show a DNL (differential nonlinearity) of 0.16 LSB and an INL (integral nonlinearity) of 0.18 LSB. The current-to-high-voltage conversion is done using a high-compliance current mirror adapted to the HV technology, as traditional output resistor or op-amp solutions are not optimum for the HV process. The design is suited for applications requiring a set of digitally-controlled high-voltage signals.