Miracle-dz/UniFAR-FTUs huggingface dataset:
23.2 A 32Gb/s bidirectional 4-channel 4pJ/b capacitively coupled link in 14nm CMOS for proximity communication

Proximity communication offers the convenience of a connector-less high-speed interface using energy-efficient mixed-signal transceivers [1-4]. Such interfaces are attractive for ultra-thin handheld/mobile devices with zero-insertion depth connectors on the periphery, modular phones, and hermetically sealed devices. Proximity communication near millimeter-range using inductive coupling is typically limited to relatively low sampling rates of <;1.25GS/s [1] due to inductor self-resonance. While interfaces using coupled transmission line (CTL) couplers are wideband (<;12GS/s) [2-3], implementations have been limited to a single-channel, which is likely due to inter-channel crosstalk. Multi-channel chip-to-chip communication using capacitive coupling has been demonstrated [4], albeit at a limited distance of 10μm. This work presents a 4-channel capacitively coupled interface (Fig. 23.2.1(a)) that supports an aggregate data-rate of 32Gb/s and up to 0.8mm air separation.
Neuropathology of Parkinson's disease with the R1441G mutation in LRRK2

We report the neuropathological findings in a patient with Parkinson's disease (PD) associated with Basque R1441G‐LRRK2/dardarin mutation. The patient was a man with disease onset at 68 years of age, with unilateral rest tremor; the Parkinsonism was well controlled with medication for 15 years. He died at the age of 86, after 18 years of evolution. The neuropathological examination disclosed mild neuronal loss in the substantia nigra pars compacta without α‐synuclein, tau, LRRK2, or ubiquitin cytoplasmic inclusions. Lewy bodies and Lewy neurites were absent. This is the first neuropathological study of PD associated with brain with the R1441G mutation in LRRK2. © 2009 Movement Disorder Society
Source-Channel Coding for Fading Channels With Correlated Interference

We consider the problem of sending a Gaussian source over a fading channel with Gaussian interference known to the transmitter. We study joint source-channel coding schemes for the case of unequal bandwidth between the source and the channel and when the source and the interference are correlated. An outer bound on the system's distortion is first derived by assuming additional information at the decoder side. We then propose layered coding schemes based on proper combination of power splitting, bandwidth splitting, Wyner-Ziv and hybrid coding. More precisely, a hybrid layer, that uses the source and the interference, is concatenated (superimposed) with a purely digital layer to achieve bandwidth expansion (reduction). The achievable (square error) distortion region of these schemes under matched and mismatched noise levels is then analyzed. Numerical results show that the proposed schemes perform close to the best derived bound and to be resilient to channel noise mismatch. As an application of the proposed schemes, we derive both inner and outer bounds on the source-channel-state distortion region for the fading channel with correlated interference; the receiver, in this case, aims to jointly estimate both the source signal as well as the channel-state (interference).
Objects to the rescue! or httpd: the next generation operating system

This position paper suggests that object-oriented operating systems may provide the means to meet the ever-growing demands of applications. As an example of a successful OOOS, we cite the http daemon. To support the contention that httpd is in fact an operating system, we observe that it implements uniform naming, persistent objects and an invocation meta-protocol, specifies and implements some useful objects, and provides a framework for extensibility.We also believe that the modularity that is characteristic of OO systems should provide a performance benefit rather than a penalty. Our ongoing work in the Synthetix project at OGI is exploring the possibilities for advanced optimizations in such systems.
A fast simultaneous input vector generation and gate replacement algorithm for leakage power reduction

The Input vector control (IVC) technique is based on the observation that the leakage current in a CMOS logic gate depends on gate input state, and a good input vector is able to minimize leakage when the circuit is in sleep mode. The gate replacement technique is a very effective method to further reduce the leakage current. In this article, we propose a fast heuristic algorithm to find a low-leakage input vector with simultaneous gate replacement. Results on MCNC91 benchmark circuits show that our algorithm produces 14% better leakage current reduction with several orders of magnitude speedup in runtime for large circuits compared to the previous state-of-the-art algorithm. In particular, the average runtime for the ten largest combinational circuits has been dramatically reduced from 1879 seconds to 0.34 seconds.
Global Stability of a Saturated Nonlinear PID Controller for Robot Manipulators

This paper presents a simple and global stable nonlinear proportional-integral-derivative (N-PID) controller incorporated with a new saturated function design. The new class of saturated function is derived from quasi-natural potential function to shape the position and velocity errors. The coordinate of the saturated function is either in joint space or in Cartesian space, and the function is adjustable by changing the function parameters. The new controller formulation differs from traditional SP-ID control in that a nonlinear velocity (D-) control term is added. The global asymptotic stability of the controlled system is analyzed. Experiments performed on a two-link robot manipulator demonstrate the improved performance of the proposed nonlinear PID controller.
Development in Russia of 170 GHz gyrotron for ITER

The industrial production prototype of the ITER gyrotron was tested at the new test stand in Kurchatov institute with power 1 MW in 500 second pulses, and 0.9MW in 1000 second pulses. Operation reliability of the gyrotron in long pulses and output power modulation characteristics also were studied. Last year one more gyrotron prototype was fabricated and its testing began. Simultaneously at IAP a short pulse gyrotron with an increased size cavity was tested at power 1.5–2 MW. In the long pulse version 1.2 MW pulses with duration 100 second were registered.
A critical-conduction-mode bridgeless interleaved boost power factor correction

This paper explains about fundamental working principles, governing equations, implementation problems, and experimental results of a new power factor correction (PFC) topology. In this proposed topology, bridgeless technique is applied to a critical-conduction-mode (CRM) interleaved boost PFC in order to gain fundamental understanding towards high efficiency, high performance, low-cost, simple control scheme, and low conducted electromagnetic interference (EMI) circuit. This application is targeted for low to middle power applications that normally employs continuous or interleaved boost converter.
F-Box Protein DOR Functions As a Novel Inhibitory Factor for Abscisic Acid-Induced Stomatal Closure under Drought Stress in Arabidopsis1[C][W]

Guard cells, which form stoma in leaf epidermis, sense and integrate environmental signals to modulate stomatal aperture in response to diverse conditions. Under drought stress, plants synthesize abscisic acid (ABA), which in turn induces a rapid closing of stoma, to prevent water loss by transpiration. However, many aspects of the molecular mechanism for ABA-mediated stomatal closure are still not understood. Here, we report a novel negative regulator of guard cell ABA signaling, DOR, in Arabidopsis (Arabidopsis thaliana). The DOR gene encodes a putative F-box protein, a member of the S-locus F-box-like family related to AhSLF-S2 and specifically interacting with ASK14 and CUL1. A null mutation in DOR resulted in a hypersensitive ABA response of stomatal closing and a substantial increase of drought tolerance; in contrast, the transgenic plants overexpressing DOR were more susceptible to the drought stress. DOR is strongly expressed in guard cells and suppressed by ABA treatment, suggesting a negative feedback loop of DOR in ABA responses. Double-mutant analyses of dor with ABA-insensitive mutant abi1-1 showed that abi1-1 is epistatic to dor, but no apparent change of phospholipase Dα1 was detected between the wild type and dor. Affymetrix GeneChip analysis showed that DOR likely regulates ABA biosynthesis under drought stress. Taken together, our results demonstrate that DOR acts independent of phospholipase Dα1 in an ABA signaling pathway to inhibit the ABA-induced stomatal closure under drought stress.
Privacy preserving extraction of fuzzy rules from distributed data with different attributes

Data mining has emerged as a significant technology for discovering knowledge in vast quantities of data. It is, however, accompanied by the danger that private information will be revealed in the processing of data mining. Hence, privacy-preserving data mining has received a growing amount of attention in recent years. We have proposed a method to extract global fuzzy rules from distributed data with the same attributes in a privacy-preserving manner. This method transfers only values necessary for the extraction process without collecting any data at one place and can obtain the global fuzzy rules at all places. In this paper, we propose a method to extract global fuzzy rules in a privacy-preserving manner from distributed data with different attributes based on the method for distributed data with the same attributes. We illustrate a result for experiments using Iris data by R.A. Fisher.
Coding of Stereoscopic Depth Information in Visual Areas V3 and V3A

The process of stereoscopic depth perception is thought to begin with the analysis of absolute binocular disparity, the difference in position of corresponding features in the left and right eye images with respect to the points of fixation. Our sensitivity to depth, however, is greater when depth judgments are based on relative disparity, the difference between two absolute disparities, compared to when they are based on absolute disparity. Therefore, the visual system is thought to compute relative disparities for fine depth discrimination. Functional magnetic resonance imaging studies in humans and monkeys have suggested that visual areas V3 and V3A may be specialized for stereoscopic depth processing based on relative disparities. In this study, we measured absolute and relative disparity-tuning of neurons in V3 and V3A of alert fixating monkeys, and we compared their basic tuning properties with those published previously for other visual areas. We found that neurons in V3 and V3A predominantly encode absolute, not relative, disparities. We also found that basic parameters of disparity-tuning in V3 and V3A are similar to those from other extrastriate visual areas. Finally, by comparing single-unit activity with multi-unit activity measured at the same recording site, we demonstrate that neurons with similar disparity selectivity are clustered in both V3 and V3A. We conclude that areas V3 and V3A are not particularly specialized for processing stereoscopic depth information compared to other early visual areas, at least with respect to the tuning properties that we have examined.
Challenges for on-Demand Technology and the Unseen Opportunities

The pursuit of immediate services and goods have underlied the rapid development of on-demand technology. Ondemand technology offers less interaction than conventional methods. It has disrupted the conventional way of obtaining goods or services by offering a way to get immediate goods and services in real time and even on the go. The rising of on-demand technology and startups has led to the creation of an on-demand economy where conventional services are repacked in new modes of delivery and accommodate a wide range of users. More than 30 articles and journals are cited in this paper to provide a thorough discussion about on-demand technology, including the current challenges and future development of on-demand technology. This paper discusses ondemand technology along with how on-demand technology can disrupt the conventional method of obtaining services and goods. There are five unseen opportunities that new and current companies can leverage to create an on-demand economy. Those are real time technology, background history and capability, interactive maps, pricing, and distance-wise priority.
The invention of freeze fracture EM and the determination of membrane structure

[Graphic][1] Plane through a crystal of tobacco ringspot virus (left) made using Steere's do-it-yourself cold operating box (middle). A later freeze fracture image is shown at right. STEERE/STAEHELINRussell Steere believed that different was good. His new method of freeze fracture
Editorial message: special track on ubiquitous computing

Ubiquitous technologies, infrastructures, applications and services that operate across physical environments (e.g. neighbourhood, home, car etc) will soon be spanning all the different spheres of everyday life. Ubiquitous computing places humans in the center of environments saturated with computing and wireless communications capabilities, yet gracefully integrated, so that technology recedes in the background of everyday activities. The ubiquitous computing world is largely defined by applications, which present an altogether new set of requirements. In order to assess the impact of ubiquitous computing and discover caveats as early in the adoption process as possible, we need to study and analyze working prototypes applied in real-life settings and scenarios. The special track on ubiquitous computing applications, now in its third year, provides a forum for the discussion of all types of ubiquitous computing applications and related specialized infrastructures built for the deployment of targeted applications. Individual papers place applications within their use context and introduce novel and appropriate interaction paradigms while at the same time addressing related technical and business aspects and consequently identify novel opportunities or constraints.
Spar: a set of extensions Java for scientific computation

In this paper we present a set of language extensions that improve the expressiveness and performance of Java for scientific computation. First of all, the language extensions allow the manipulation of multi-dimensional arrays to be expressed more naturally, and to be implemented more efficiently. Furthermore, data-parallel programming is supported, allowing efficient parallelization of a large class of operations on arrays. We also provide language extensions to construct specialized array representations, such as symmetric, block, and sparse matrices. These extensions are: tuples, parameterized types, array subscript overloading, and the inline modifier. These extensions are not only useful to construct special array representations, but are also useful in their own right. Finally, we add complex numbers as a primitive type to the language. We evaluate our language extensions using performance results. We also compare relevant code fragments of our extended language with standard Java implementations and language extensions proposed by others.
Response to letter regarding article, "Ischemic stroke and intracranial hemorrhage with aspirin, dabigatran, and warfarin: impact of quality of anticoagulation control".

We face the same challenge as Dr Feng et al1 in managing Chinese patients with atrial fibrillation (AF). Despite a lower prevalence, AF remains a major health threat, affecting >4 million people in Mainland China. Warfarin therapy is the cornerstone in AF management, which reduces ischemic events by two thirds when good time in therapeutic range can be achieved. However, its use has been disturbingly low among Chinese patients ranging from 5% to 20%. Warfarin is commonly been blamed as the root of the problem. In our study involving a real-world cohort of 8754 Chinese patients with AF, the time in therapeutic range, a measure of the quality of anticoagulation, is embarrassingly low, 38.8%. 2 The poor time in treatment range is …
Extracting Randomness: A Survey and New Constructions

Extractors are Boolean functions that allow, in some precise sense, extraction of randomness from somewhat random distributions, using only a small amount of truly random bits. Extractors, and the closely related “dispersers,” exhibit some of the most “random-like” properties of explicitly constructed combinatorial structures. In this paper we do two things. First, we survey extractors and dispersers: what they are, how they can be designed, and some of their applications. The work described in the survey is due to a long list of research papers by various authors? most notably by David Zuckerman. Then, we present a new tool for constructing explicit extractors and give two new constructions that greatly improve upon previous results. The new tool we devise, a “merger,” is a function that acceptsdstrings, one of which is uniformly distributed and outputs a single string that is guaranteed to be uniformly distributed. We show how to build good explicit mergers, and how mergers can be used to build better extractors. Using this, we present two new constructions. The first construction succeeds in extractingallof the randomness fromanysomewhat random source. This improves upon previous extractors that extract onlysomeof the randomness from somewhat random sources with “enough” randomness. The amount of truly random bits used by this extractor, however, is not optimal. The second extractor we build extracts only some of the randomness and works only for sources with enough randomness, but uses a near-optimal amount of truly random bits. Extractors and dispersers have many applications in “removing randomness” in various settings and in making randomized constructions explicit. We survey some of these applications and note whenever our new constructions yield better results, e.g., plugging our new extractors into a previous construction we achieve the first explicitN-superconcentrators of linear size and polyloglog(N) depth.
Antiarrhythmics After Ablation of Atrial Fibrillation (5A Study): Six-Month Follow-Up Study

Background—We previously demonstrated that treatment with antiarrhythmic drugs (AADs) during the first 6 weeks after atrial fibrillation (AF) ablation reduces the incidence of clinically significant atrial arrhythmias and need for cardioversion or hospitalization for arrhythmia management. Whether early rhythm suppression decreases longer-term arrhythmia recurrence is unknown. We now report the 6-month follow-up data from this study. Methods and Results—The Antiarrhythmics After Ablation of Atrial Fibrillation study prospectively randomized patients with paroxysmal AF undergoing ablation to either receive (AAD group) or not receive (no-AAD group) AAD treatment for the first 6 weeks after ablation; all patients received atrioventricular nodal blockers. Physicians were encouraged to stop the AADs after the 6-week treatment period. All patients underwent 4 weeks of transtelephonic monitoring to document asymptomatic AF and an evaluation at 6 weeks and 6 months. A total of 110 patients (71% men) aged 55±9 years were randomized, with 53 to AAD and 57 to no AAD. At 6 months, there was no difference in freedom from AF between the early AAD and no-AAD groups (38/53 [72%] versus 39/57 [68%]; P=0.84). Lack of early AF recurrence during the initial 6-week period was the only independent predictor of 6-month freedom from AF (64/76 [84%] without early recurrence versus 13/34 [38%] with early recurrence; P=0.0001). Conclusions—Although short-term use of AADs after AF ablation decreases early recurrence of atrial arrhythmias, early use of AADs does not prevent arrhythmia recurrence at 6 months. Early AF recurrence on or off AADs during the initial 6-week blanking period is a strong independent predictor of long-term AF recurrence. Clinical Trial Registration—URL: http://www.clinicaltrials. gov. Unique identifier: NCT00408200.
A tangent based method for robot path planning

This paper presents a new method of path planning for robot manipulators. It is a local roadmap method that is based on the tangent graph in configuration space. The graph is constructed incrementally as the search progresses, removing the pre-processing overhead of other methods; also, a heuristic is used to minimise the number of tangents generated. The technique is demonstrated by a simulation for a three-link planar manipulator. <<ETX>>
Is Extrapolation of the Safety and Efficacy Data in One Indication to Another Appropriate for Biosimilars?

CT-P13, the world’s first biosimilar monoclonal antibody to infliximab, was approved for marketing in South Korea for all the six indications of infliximab, which Europe may follow, although the product was tested only in rheumatoid arthritis (RA) with a limited pharmacokinetic comparison in ankylosing spondylitis. However, the extrapolation of the efficacy and safety findings of CT-P13 in RA to the other indications appears scientifically challenging when assessed by the current regulatory requirements. RA is not a sensitive clinical model to detect potential differences between CT-P13 and infliximab, and other mechanisms of action than antagonizing tumor necrosis factor α appear to be also important, which could be different by the approved indications. Furthermore, the immunogenicity and safety profiles of CT-P13 were not sufficiently characterized in that immunogenicity potential was lowest in RA, which was even further suppressed by the concomitant use of methotrexate. Extrapolation of the safety and efficacy data in one indication to another may be inappropriate for biosimilars unless backed up by strong scientific justification, which may include the mechanistic exposure–relationship approach. Therefore, regulatory agencies need to exercise caution before granting extrapolated indications to biosimilars.
Lockup-free instruction fetch/prefetch cache organization

In the past decade, there has been much literature describing various cache organizations that exploit general programming idiosyncrasies to obtain maximum hit rate (the probability that a requested datum is now resident in the cache). Little, if any, has been presented to exploit: (1) the inherent dual input nature of the cache and (2) the many-datum reference type central processor instructions. No matter how high the cache hit rate is, a cache miss may impose a penalty on subsequent cache references. This penalty is the necessity of waiting until the missed requested datum is received from central memory and, possibly, for cache update. For the two cases above, the cache references following a miss do not require the information of the datum not resident in the cache, and are therefore penalized in this fashion. In this paper, a cache organization is presented that essentially eliminates this penalty. This cache organizational feature has been incorporated in a cache/memory interface subsystem design, and the design has been implemented and prototyped. An existing simple instruction set machine has verified the advantage of this feature; future, more extensive and sophisticated instruction set machines may obviously take more advantage. Prior to prototyping, simulations verified the advantage.