Miracle-dz/UniFAR-FTUs huggingface dataset:
Sketches for Matrix Norms: Faster, Smaller and More General

We design new sketching algorithms for unitarily invariant matrix norms, including the Schatten $p$-norms~$\|{\cdot}\|_{S_p}$, and obtain, as a by-product, streaming algorithms that approximate the norm of a matrix $A$ presented as a turnstile data stream. The primary advantage of our streaming algorithms is that they are simpler and faster than previous algorithms, while requiring the same or less storage. Our three main results are a faster sketch for estimating $\|{A}\|_{S_p}$, a smaller-space $O(1)$-pass sketch for $\|{A}\|_{S_p}$, and more general sketching technique that yields sublinear-space approximations for a wide class of matrix norms. These improvements are powered by dimensionality reduction techniques that are modern incarnations of the Johnson-Lindenstrauss Lemma~\cite{JL84}. When $p\geq 2$ is even or $A$ is PSD, our fast one-pass algorithm approximates $\|{A}\|_{S_p}$ in optimal, $n^{2-4/p}$, space with $O(1)$ update time and $o(n^{2.4(1-2/p)})$ time to extract the approximation from the sketch, while the $\lceil p/2\rceil$-pass algorithm is built on a smaller sketch of size $n^{1-1/(p-1)}$ with $O(1)$ update time and $n^{1-1/(p-1)}$ query time. Finally, for a PSD matrix $A$ and a unitarily invariant norm $l(\cdot)$, we prove that one can obtain an approximation to $l(A)$ from a sketch $GAH^T$ where $G$ and $H$ are independent Oblivious Subspace Embeddings and the dimension of the sketch is polynomial in the intrinsic dimension of $A$. The intrinsic dimension of a matrix is a robust version of the rank that is equal to the ratio $\sum_i\sigma_i/\sigma_1$. It is small, e.g., for models in machine learning which consist of a low rank matrix plus noise. Naturally, this leads to much smaller sketches for many norms.
District: Embracing local markets in truthful spectrum double auctions

Market-driven spectrum auctions offer an efficient way to improve spectrum utilization by transferring unused or under-used spectrum from its primary license holder to spectrum-deficient secondary users. Such a spectrum market exhibits strong locality in two aspects: 1) that spectrum is a local resource and can only be traded to users within the license area, and 2) that holders can partition the entire license areas and sell any pieces in the market. We design a spectrum double auction that incorporates such locality in spectrum markets, while keeping the auction economically robust and computationally efficient. Our designs in District are tailored to cases with and without knowledge of bid distributions. An auctioneer can start from one design without any a priori information, and then switch to the other alternative after accumulating sufficient distribution knowledge. Complementary simulation studies show that spectrum utilization can be significantly improved when distribution information is available.
The community network game project: enhancing collaborative activities in online games

One of the most attractive features of Massively Multiplayer Online Games (MMOGs) is the possibility for users to interact with a large number of other users in a variety of collaborative and competitive situations. Gamers within an MMOG become members of active communities with common interests and shared adventures. The EU-funded Community Network Game (CNG) project will provide MMOG players new tools for the generation, distribution, and insertion of user generated content (UGC) without changing the game code and without adding new processing or network loads to the MMOG central servers. The UGC considered by the CNG project includes 3D objects and graphics as well as video. We present the objectives of the project, focusing on its main scientific and technological contributions.
Financial Network and Systemic Risk via Forward ‐ Looking Partial Default Correlations

This paper studies systemic risk in a global network with around 2,000 exchange-traded banks and insurance companies. Network construction follows a methodology comprising three parts: (1) using the default correlation model of Duan and Miao (2016) to produce a forward-looking probability of default (PD) total correlation matrix and then transform it into a partial correlation matrix by applying the CONCORD algorithm; (2) measuring financial institutions’ systemic importance based on six network centrality indicators derived from the partial correlation matrix, which represent the direct connections among firms; and (3) relying on a graphical analysis of the global financial network which can then be partitioned into overlapping firm/group centric local communities. We specifically study the firms’ systemic importance in 2008 and 2015. Using the 2015 sample, we are able to compare the systemic importance rankings under alternative measures, including the G-SIBs and G-SIIs identified by the Financial Stability Board (FSB) in 2016. Our results suggest the FSB rankings tilt towards singling out large institutions as systemic, with connectivity playing a minor role.
Detection of Hydrogen Peroxide with Fluorescent Dyes.

SIGNIFICANCE Hydrogen peroxide (H2O2) is a powerful effector of redox signaling. It is able to oxidize cysteine residues, metal ion centers, and lipids. Understanding H2O2-mediated signaling requires, to some extent, measurement of H2O2 level. Recent Advances: Chemically and genetically encoded fluorescent probes for the detection of H2O2 are currently the most sensitive and popular. Novel probes are constantly being developed, with the latest progress particular with boronates and genetically encoded probes. CRITICAL ISSUES All currently available probes display limitations in terms of sensitivity, local and temporal resolution, and specificity in the detection of low H2O2 concentrations. In this review, we discuss the power of fluorescent probes and the systems in which they have been successfully employed. Moreover, we recommend approaches for overcoming probe limitations and for the avoidance of artifacts. FUTURE DIRECTIONS Constant improvements will lead to the generation of probes that are not only more sensitive but also specifically tailored to individual cellular compartments. Antioxid. Redox Signal. 29, 585-602.
Nonlinear Distortion Analysis of Polar Transmitters

This paper gives a comprehensive analysis of the major nonlinear distortion generation mechanisms present in modern wireless polar transmitters. Based on a simplified description of the physical operation of voltage supply modulated switching mode power amplifiers (PAs), it derives an analytical model of both the AM-AM and AM-PM distortions usually encountered on polar transmitters excited by the standard two-tone excitation. The predictions of this model match extensive measurement and simulation results for a real PA circuit of a polar transmitter architecture.
Digital Transactions in a Physical World: a Resource-based Model of Foreign Market Entry for Electronic Commerce

This article is concerned with the entry into foreign markets of business-to-consumer electronic commerce organizations. We propose a model that conceptualizes retail products along two key dimensions: the physical or digital nature of the goods, and the local or global appeal of the products. This framework classifies retail products into four categories as a function of the two dimensions and propositions are formulated to explain both the likelihood and the mode of foreign market entry of online retailers using concepts from the resource-based view of the firm. The model is illustrated using specific cases of international expansion in e-commerce from four different industries.
A 40nm CMOS full asynchronous nano-watt SAR ADC with 98% leakage power reduction by boosted self power gating

This paper presents an ultra low power and ultra low voltage SAR ADC. Full asynchronous operation and boosted self power gating are proposed to improve conversion accuracy and reduce static leakage power. Test chip fabricated in 40nm CMOS process has successfully reduced leakage power by 98% and it performs ENOB of 8.2bit and consumes only 0.65nW with 0.1kS/s at 0.5V. The power consumption is scalable up to 4MS/s and power supply range from 0.4 to 0.7V. The best figure of merit (FoM) of 5.2fJ/conversion-step was obtained with 20kS/s at 0.5V.
Scaling link-based similarity search

To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed architecture. The similarity of multi-step neighborhoods of vertices are numerically evaluated by similarity functions including SimRank [20], a recursive refinement of cocitation; PSimRank, a novel variant with better theoretical characteristics; and the Jaccard coefficient, extended to multi-step neighborhoods. Our methods are presented in a general framework of Monte Carlo similarity search algorithms that precompute an index database of random fingerprints, and at query time, similarities are estimated from the fingerprints. The performance and quality of the methods were tested on the Stanford Webbase [19] graph of 80M pages by comparing our scores to similarities extracted from the ODP directory [26]. Our experimental results suggest that the hyperlink structure of vertices within four to five steps provide more adequate information for similarity search than single-step neighborhoods.
Neurosurgery concepts: Key perspectives on imaging characteristics of spinal metastases, surgery for low back pain, anesthesia for disc surgery, and laminectomy versus laminectomy and fusion for lumbar spondylolisthesis

Department of Neurosurgery, University of California, Los Angeles, David Geffen School of Medicine, Los Angeles, California, 1Department of Neurosurgery, Northwestern University Feinberg School of Medicine, Chicago, Illinois, United States, 2Department of Neurosurgery, Ajou University School of Medicine, Suwon, South Korea, 3Department of Neurosurgery, Beaumont Hospital, Grosse Pointe, MI, 4Department of Neurosurgery, Baylor College of Medicine, 5Texas Children’s Hospital, Houston, Texas, 6Department of Neurological Surgery, Loyola University Chicago, Stritch School of Medicine, Illinois, 7Department of Neurosurgery, University of California, San Diego School of Medicine, San Diego, California, United States, 8Department of Neurosurgery, Seoul National University College of Medicine and Bundang Hospital, Seongnam, Korea, 9Department of Neurosurgery, Stanford School of Medicine, Stanford, California, 10Department of Neurosurgery, Johns Hopkins School of Medicine, Baltimore, Maryland, 11Department of Neurosurgery, George Washington University School of Medicine and Health Sciences, Washington DC, 12Seton Brain and Spine Institute Neurosurgery, Kyle, Texas, 13Department of Neurosurgery, Keck School of Medicine of the University of Southern California, Los Angeles, California, United States
GCOM-W and GCOM-C project status

JAXA (Japan Aerospace Exploration Agency) initiated GCOM (Global Change Observation Mission) to monitor the global Earth surface and contribute to the research of the climate change and the operational usage. By using the satellite observation data in the climate system model, it is expected that the prediction accuracy of the climate change will be improved. This information will be useful for making a policy against the climate change. GCOM consists of 3 generations of satellites to make observation for more than 10 years. The satellites of the first generation, GCOM-W1 and GCOM-C1, have been developed to aim at the launch in Japanese Fiscal Year 2011 and 2014, respectively.
Managing SER costs of complex systems through Linear Programming

Single Event Effects negatively impact the reliability of complex electronic devices and systems. System architects, reliability engineers and digital designers have to invest considerable resources to successfully meet the reliability goals set by the final user or application. The cost of SER mitigation techniques (e.g. additional power and reduced performance) may render the product less competitive. This paper proposes an approach that allows a system architect to select the best SEE management techniques subject to given cost and performance constraints. In this methodology, the costs of SER protection (area, power, engineering effort, IP costs) are expressed as a cost function depending on the selected protection schemes. A separate function expresses the reliability and/or availability as a function of the protection schemes. Then, Linear Programming techniques are used to select a set of protection techniques that minimizes the costs, subject to the reliability constraints being met. This systematic approach enables system-architects to find a minimal-cost SER protection strategy and thus reducing over-design and unnecessary overheads.
Cooperative cache scrubbing

Managing the limited resources of power and memory bandwidth while improving performance on multicore hardware is challenging. In particular, more cores demand more memory bandwidth, and multi-threaded applications increasingly stress memory systems, leading to more energy consumption. However, we demonstrate that not all memory traffic is necessary. For modern Java programs, 10 to 60% of DRAM writes are useless, because the data on these lines are dead — the program is guaranteed to never read them again. Furthermore, reading memory only to immediately zero initialize it wastes bandwidth. We propose a software/hardware cooperative solution: the memory manager communicates dead and zero lines with cache scrubbing instructions. We show how scrubbing instructions satisfy MESI cache coherence protocol invariants and demonstrate them in a Java Virtual Machine and multicore simulator. Scrubbing reduces average DRAM traffic by 59%, total DRAM energy by 14%, and dynamic DRAM energy by 57% on a range of configurations. Cooperative software/hardware cache scrubbing reduces memory bandwidth and improves energy efficiency, two critical problems in modern systems.
MIMO DF Relay Beamforming for Secrecy with Artificial Noise, Imperfect CSI, and Finite-Alphabet

In this paper, we consider decode-and-forward (DF) relay beamforming with imperfect channel state information (CSI), cooperative artificial noise (AN) injection, and finite-alphabet input in the presence of an user and $J$ non-colluding eavesdroppers. The communication between the source and the user is aided by a multiple-input-multiple-output (MIMO) DF relay. We use the fact that a wiretap code consists of two parts: i) common message (non-secret), and ii) secret message. The source transmits two independent messages: i) common message (non-secret), and ii) secret message. The common message is transmitted at a fixed rate $R_{0}$, and it is intended for the user. The secret message is also intended for the user but it should be kept secret from the $J$ eavesdroppers. The source and the MIMO DF relay operate under individual power constraints. In order to improve the secrecy rate, the MIMO relay also injects artificial noise. The CSI on all the links are assumed to be imperfect and CSI errors are assumed to be norm bounded. In order to maximize the worst case secrecy rate, we maximize the worst case link information rate to the user subject to: i) the individual power constraints on the source and the MIMO relay, and ii) the best case link information rates to $J$ eavesdroppers be less than or equal to $R_{0}$ in order to support a fixed common message rate $R_{0}$. Numerical results showing the effect of perfect/imperfect CSI, presence/absence of AN with finite-alphabet input on the secrecy rate are presented.
High-Definition Digital Elevation Model System Vision Paper

Digital Elevation Modeling (DEM) has been a widely used methodology in plethora of application domains, ranging from climate and geological studies, through temporal evolution of various migration patterns, to Geographic Information Systems (GIS) broadly. However, the existing DEM methodologies and systems cannot quite straightforwardly be extended to catch up with the demands due to recent developments in autonomous driving, vehicle localization, drone and dynamically evolving high-definition smart city modeling. The new challenges are the demand of higher precision, sparse(r) elevation data compression, real-time efficient retrieval and intra-sources data integration. Motivated by this, we take a first step towards developing a tile based, multi-layer high precision DEM system, which aims at seamlessly integrating (and aligning) DEM from different sources, and enables context-driven variations in zoom levels. In addition, to further improve the efficiency of the focused-retrieval of the data necessary to construct the DEM with the desired quality assurance, our vision targets the collaborative compression among heterogeneous data sources.
KAHRISMA: A Novel Hypermorphic Reconfigurable-Instruction-Set Multi-grained-Array Architecture

Facing the requirements of next generation applications, current approaches of embedded systems design will soon hit the limit where they may no longer perform efficiently. The unpredictable nature and diverse processing behavior of future applications requires to transgress the barrier of tailor-made, application-/domain-specific embedded system designs. As a consequence, next generation architectures for embedded systems have to react much more flexible to unforeseeable run-time scenarios. In this paper we present our innovative processor architecture concept KAHRISMA (KArlsruhe's Hypermorphic Reconfigurable-Instruction-Set Multi-grained-Array). It tightly integrates coarse- and fine-grained run-time reconfigurable fabrics that can incorporate to realize hardware acceleration for computationally complex algorithms. Furthermore, the fabrics can be combined to realize different Instruction Set Architectures that may execute in parallel. With the help of an encrypted H.264 en-/decoding case study we demonstrate that our novel KAHRISMA architecture will deliver the required flexibility to design future-proof embedded systems that are not limited to a certain computational domain.
Indoor robot motion based on monocular images

The estimation of the 2D relative motion of an indoor robot using monocular vision is presented. The camera calibration is known, and its motion is limited to be planar. These constraints are included in the robust regression of epipolar geometry from point matches. Motion is derived from the epipolar geometry. A sequence of 54 real images is used to test the algorithm. Accurate motion, both in rotation and translation angles of 0.4 and 1.7 deg, is successfully derived.
Integrated control for pHRI: Collision avoidance, detection, reaction and collaboration

We present an integrated control framework for safe physical Human-Robot Interaction (pHRI) based on a hierarchy of consistent behaviors. Safe human robot coexistence is achieved with a layered approach for coping with undesired collisions and intended contacts. A collision avoidance algorithm based on depth information of the HRI scene is used in the first place. Since collision avoidance cannot be guaranteed, it is supported by a physical collision detection/reaction method based on a residual signal which needs only joint position measures. On top of this layer, safe human-robot collaboration tasks can be realized. Collaboration phases are activated and ended by human gestures or voice commands. Intentional physical interaction is enabled and exchanged forces are estimated by integrating the residual with an estimation of the contact point obtained from depth sensing. During the collaboration, only the human parts that are designated as collaborative are allowed to touch the robot while, consistently to the lower layers, all other contacts are considered undesired collisions. Preliminary experimental results with a KUKA LWR-IV and a Kinect sensor are presented.
Smart cards in hostile environments

One often hears the claim that smart cards are the solution to a number of security problems, including those arising in point-of-sale systems. In this paper, we characterize the minimal properties necessary for the secure smart card point-of-sale transactions. Many proposed systems fail to provide these properties: problems arise from failures to provide secure communication channels between the user and the smart card while operating in a potentially hostile environment (such as a point-of-sale application.) Moreover, we discuss several types of modifications that can be made to give smart cards additional input/output capacity with a user, and describe how this additional I/O can address the hostile environment problem. We give a notation for describing the effectiveness of smart cards under various environmental assumptions. We discuss several security equivalences among different scenarios for smart cards in hostile environments. Using our notation, these equivalences include: • private input a private output • trusted input + one-bit trusted output a trusted output + one-bit trusted input • secure input a secure output.
Quick Detection of FKS1 Mutations Responsible for Clinical Echinocandin Resistance in Candida albicans

ABSTRACT A rapid molecular-based assay for the detection of the Candida albicans FKS1 gene mutations responsible for resistance to echinocandin drugs was designed and evaluated. The assay consisted of a multiplexed PCR set of 5 tubes able to detect the most commonly described resistance mechanism, including FKS1 hot spot 1 and hot spot 2 mutations. The performance and specificity of the assay was evaluated using a double-blinded panel of 50 C. albicans strains. The assay showed a sensitivity of 96% and was able to detect all homozygous mutants included in the collection of strains, demonstrating that it is a robust, quick, and labor-saving method that is suitable for a routine clinical diagnostic laboratory.
Affinity Enrichment and Characterization of Mucin Core-1 Type Glycopeptides from Bovine Serum*

The lack of consensus sequence, common core structure, and universal endoglycosidase for the release of O-linked oligosaccharides makes O-glycosylation more difficult to tackle than N-glycosylation. Structural elucidation by mass spectrometry is usually inconclusive as the CID spectra of most glycopeptides are dominated by carbohydrate-related fragments, preventing peptide identification. In addition, O-linked structures also undergo a gas-phase rearrangement reaction, which eliminates the sugar without leaving a telltale sign at its former attachment site. In the present study we report the enrichment and mass spectrometric analysis of proteins from bovine serum bearing Galβ1–3GalNAcα (mucin core-1 type) structures and the analysis of O-linked glycopeptides utilizing electron transfer dissociation and high resolution, high mass accuracy precursor ion measurements. Electron transfer dissociation (ETD) analysis of intact glycopeptides provided sufficient information for the identification of several glycosylation sites. However, glycopeptides frequently feature precursor ions of low charge density (m/z > ∼850) that will not undergo efficient ETD fragmentation. Exoglycosidase digestion was utilized to reduce the mass of the molecules while retaining their charge. ETD analysis of species modified by a single GalNAc at each site was significantly more successful in the characterization of multiply modified molecules. We report the unambiguous identification of 21 novel glycosylation sites. We also detail the limitations of the enrichment method as well as the ETD analysis.