Miracle-dz/UniFAR-FTUs huggingface dataset:
Increased Thin-Cap Neoatheroma and Periprocedural Myocardial Infarction in Drug-Eluting Stent Restenosis: Multimodality Intravascular Imaging of Drug-Eluting and Bare-Metal Stents

Background—Re-endothelialization is delayed after drug-eluting stent (DES) implantation. In this setting, neointima is more prone to become lipid laden and develop neoatherosclerosis (NA), potentially increasing plaque vulnerability. Methods and Results—Optical coherence tomography and near-infrared spectroscopy with intravascular ultrasound were used to characterize NA in 65 (51 DES and 14 bare-metal stents) consecutive symptomatic patients with in-stent restenosis. Median duration poststent implantation was 33 months. Optical coherence tomography–verified NA was observed in 40 stents with in-stent restenosis (62%), was more prevalent in DES than bare-metal stents (68% versus 36%; P=0.02), and demonstrated significantly higher prevalence of thin-cap neoatheroma (47% versus 7%; P=0.01) in DES. Near-infrared spectroscopy assessment demonstrated that the total lipid core burden index (34 [interquartile range, 12–92] versus 9 [interquartile range, 0–32]; P<0.001) and the density of lipid core burden index (lipid core burden index/4 mm, 144 [interquartile range, 60–285] versus 26 [interquartile range, 0–86]; P<0.001) were higher in DES compared with bare-metal stents. Topographically, NA was classified as I (thin-cap NA), II (thick-cap NA), and III (peri-strut NA). Type I thin-cap neoatheroma was more common in DES (20% versus 3%; P=0.01) and in areas of the stented segment without significant in-stent restenosis (71%). Periprocedural myocardial infarction occurred only in DES (11 versus 0; P=0.05), of which 6 (55%) could be attributed to segments with >70% in-stent restenosis. By logistic regression, prior DES was the only independent predictor of both NA (odds ratio, 7.0; 95% confidence interval, 1.7–27; P=0.006) and periprocedural myocardial infarction (odds ratio, 1.8; 95% confidence interval, 1.1–2.4; P=0.05). Conclusions—In-stent thin-cap neoatheroma is more prevalent, is distributed more diffusely across the stented segment, and is associated with increased periprocedural myocardial infarction in DES compared with bare-metal stents. These findings support NA as a mechanism for late DES failure.
Putting events in context: aspects for event-based distributed programming

Event-based programming is an appealing paradigm for developing pervasive systems since events enable the decoupling of interacting components. Unfortunately, many event-based languages and systems have hardwired notions of physical or logical time and space. This limits their adaptability and target deployment environments, as pervasive systems rely on inherent interaction and interchanging of different protocols and infrastructures. This paper introduces domain-specific aspects for capturing event context, generalizing beyond the classic time and space dimensions associated with events. Through examples, we demonstrate that our context aspects - conspects for short - modularize the design and implementation of event contexts, enabling code reuse, and making programs portable across infrastructures. We illustrate the benefits of conspects by using them to transparently switch protocols in two pervasive software suites implemented in EventJava: (1) a tornado monitoring system deployed on different architectures ranging from desktop x86 to embedded LEON3, and (2) a mobile social networking suite with protocols for different application scenarios.
NFS over RDMA

The NFS filesystem was designed as a work-group filesystem, making a central file store available to and shared between a number of client workstations. However, more recently NFS has grown in popularity in the server room, connecting large application servers with back-end file servers. In this environment, where high-speed access to data is critical, high capacity interconnects like gigabit Ethernet, Fibre Channel and Infiniband are to be expected. With RDMA technology we can fully utilize the data capacity of these interconnects, while providing relief for host CPU and memory buses from the demands of managing a "fire hose" of data.Here we describe the use of RDMA as an RPC transport layer. We show that the NFS protocol running over this new transport achieves higher throughput than a conventional TCP transport along with a reduction in CPU utilization. The benefits of an RDMA transport are enjoyed not only by the applications that use NFS mounts, but extend to any RPC service that requires high speed and efficient transfer of large volumes of data.
Sink-insertion for mesh improvement

We propose sink-insertion as a new technique to improve the mesh quali ty of Delaunay triangulations. We compare it with the conventional circumcenter-insertion technique under three scheduling regimes: incremental, in blocks, and in parallel. Justification for sink-insertion is given in terms of mesh quality, numerical robustness, running time, and ease of parallelization.
Improved phenol emulsion DNA reassociation technique (PERT) using thermal cycling.

Phenol emulsion reassociation technique (PERT) greatly enhances the rate of DNA hybridization in solution over typical hybridization conditions (1) and has successfully been used to accelerate competitive DNA reassociation for performing subtraction based genomic cloning (2-5). PERT is accomplished through the establishment and maintenance of a phenol emulsion, typically by mechanical vortexing or shaking. While using this technique, we encountered emulsion stability problems and found stability was directly dependent upon DNA concentration. At low DNA concentrations and small volumes the emulsions became difficult to maintain even with vigorous agitation. Since it is at low DNA concentrations, when hybridization times using standard conditions are prohibitively long that PERT is most useful, we sought alternative mechanisms for maintaining a phenol emulsion. We describe a method to maintain a phenol emulsion in the presence of low DNA concentrations which does not require mechanical agitation. Rather, an emulsion is established and maintained by thermal cycling the PERT hybridization reaction.
Brain Accumulation of Dasatinib Is Restricted by P-Glycoprotein (ABCB1) and Breast Cancer Resistance Protein (ABCG2) and Can Be Enhanced by Elacridar Treatment

Purpose: Imatinib, a BCR-ABL tyrosine kinase inhibitor, is a substrate of the efflux transporters P-glycoprotein (P-gp; ABCB1) and ABCG2 (breast cancer resistance protein), and its brain accumulation is restricted by both transporters. For dasatinib, an inhibitor of SCR/BCR-ABL kinases, in vivo interactions with P-gp and ABCG2 are not fully established yet. Experimental Design: We used Abcb1a/1b−/−, Abcg2−/−, and Abcb1a/1b;Abcg2−/− mice to establish the roles of P-gp and ABCG2 in the pharmacokinetics and brain accumulation of dasatinib. Results: We found that oral uptake of dasatinib is limited by P-gp. Furthermore, relative brain accumulation, 6 hours after administration, was not affected by Abcg2 deficiency, but absence of P-gp resulted in a 3.6-fold increase after oral and 4.8-fold higher accumulation after i.p. administration. Abcb1a/1b;Abcg2−/− mice had the most pronounced increase in relative brain accumulation, which was 13.2-fold higher after oral and 22.7-fold increased after i.p. administration. Moreover, coadministration to wild-type mice of dasatinib with the dual P-gp and ABCG2 inhibitor elacridar resulted in a similar dasatinib brain accumulation as observed for Abcb1a/1b;Abcg2−/− mice. Conclusions: Brain accumulation of dasatinib is primarily restricted by P-gp, but Abcg2 can partly take over this protective function at the blood-brain barrier. Consequently, when both transporters are absent or inhibited, brain uptake of dasatinib is highly increased. These findings might be clinically relevant for patients with central nervous system Philadelphia chromosome–positive leukemia, as coadministration of an inhibitor of P-gp and ABCG2 with dasatinib might result in better therapeutic responses in these patients.
Hysteresis-Free Lead-Free Double-Perovskite Solar Cells by Interface Engineering

Hybrid perovskite solar cells have been creating considerable excitement in the photovoltaic community. However, they still rely on toxic elements, which impose severe limits on their commercialization. Lead-free double hybrid perovskites in the form of Cs2AgBiBr6 have been shown to be a promising nontoxic and highly stable alternative. Nevertheless, device development is still in its infancy, and performance is affected by severe hysteresis. Here we realize for the first time hysteresis-free mesoporous double-perovskite solar cells with no s-shape in the device characteristic and increased device open-circuit voltage. This has been realized by fine-tuning the material deposition parameters, enabling the growth of a highly uniform and compact Cs2AgBiBr6, and by engineering the device interfaces by screening different molecular and polymeric hole-transporting materials. Our work represents a crucial step forward in lead-free double perovskites with significant potential for closing the gap for their market.
THE ELECTRIC CAPACITY OF SUSPENSIONS WITH SPECIAL REFERENCE TO BLOOD

1. The specific capacity of a suspension is that capacity which) combined in parallel with a certain resistance, electrically balances 1 cm. cube of the suspension. 2. The following formula holds for the specific capacity of a suspension of spheroids, each of which is composed of a well conducting interior surrounded by a thin membrane of a comparatively high resistance: See PDF for Equation C, specific capacity of suspension; Co, static capacity of one sq. cm. of membrane; r, r 1 specific resistances respectively of suspension and of suspending liquid; 2 q major axis of spheroid, α constant tabulated in Table I. 3. The following formula holds practically for any suspension whatever the form of the suspended particle. See PDF for Equation C = C 100 being the specific capacity of a suspension with a concentration of 100 per cent. Formulæ (1a) and (1b) hold only for the case, when the frequency is so low, that the impedance of the static capacity of the membrane around a single particle is high as compared with the resistance of the interior of the particle. The formulae hold also for a suspension of homogeneous particles, when polarization takes place at the surface of each particle, provided the polarization resistance is low as compared with the impedance of the polarization capacity. 4. A description is given of a method for measuring the capacity of a suspension at frequencies between 800 and 4½ million cycles. By means of a specially designed bridge, a substitution method is employed, by which in the last analysis the suspension is compared with the suspending liquid which is so diluted as to have the same specific resistance as the suspension, consecutive measurements being made in the same electrolytic cell. 5. Formula (1b) is verified by measurements of the capacity of suspensions of varying volume concentrations of the red corpuscles of a dog. 6. By means of the above measurements, the value of Co is calculated by equation (1a). 7. It is found that Co is independent of the frequency up to 4½ million cycles and that it is also independent of the suspending liquid. These results furnish considerable evidence of the validity of the theory, that Co represents the static capacity of a corpuscle membrane. 8. On this assumption and using a probable value for the dielectric constant of the membrane, the thickness of the membrane is calculated to be 3.3·10 –7 cm.
Surface Morphology of Amygdala Is Associated with Trait Anxiety

Previous neuroimaging studies have suggested a role of amygdala in trait anxiety level, in which amygdala was typically treated as a whole. To date, it remains unknown whether the morphology of specific subregions of amygdala are associated with trait anxiety. Here, we employed a shape analysis approach to locate the association between its morphology and trait anxiety on the surface of amygdala. 24 healthy young participants were included. The boundary of amygdala for each subject was first manually outlined using high-resolution magnetic resonance (MR) image, followed by 3D surface reconstruction and parameterization using spherical harmonic description. Two point-wise metrics, direct displacement between the individual surface and atlas surface and its normal projection, were used to quantify the surface morphology of amygdala. Statistical analysis revealed significant correlations between the two surface metrics and trait anxiety levels, which were located around the lateral and central nucleus of right amygdala. Our results provided localized information for the association between amygdala and trait anxiety, and suggested a central role of the lateral and central nucleus of right amygdala on trait anxiety.
Computational complexity of combinatorial surfaces

We investigate the computational problems associated with combinatorial surfaces. Specifically, we present an algorithm (based on the Brahana-Dehn-Heegaard approach) for transforming the polygonal schema of a closed triangulated surface into its canonical form in <italic>&Ogr;</italic>(<italic>n</italic> log <italic>n</italic>) time, where <italic>n</italic> is the total number of vertices, edges and faces. We also give an <italic>&Ogr;</italic>(<italic>n</italic> log <italic>n</italic> + <italic>gn</italic>) algorithm for constructing canonical generators of the fundamental group of a surface of genus <italic>g</italic>. This is useful in constructing homeomorphisms between combinatorial surfaces.
Managing a large database of camera fingerprints

Sensor fingerprint is a unique noise-like pattern caused by slightly varying pixel dimensions and inhomogeneity of the silicon wafer from which the sensor is made. The fingerprint can be used to prove that an image came from a specific digital camera. The presence of a camera fingerprint in an image is usually established using a detector that evaluates cross-correlation between the fingerprint and image noise. The complexity of the detector is thus proportional to the number of pixels in the image. Although computing the detector statistic for a few megapixel image takes several seconds on a single-processor PC, the processing time becomes impractically large if a sizeable database of camera fingerprints needs to be searched through. In this paper, we present a fast searching algorithm that utilizes special "fingerprint digests" and sparse data structures to address several tasks that forensic analysts will find useful when deploying camera identification from fingerprints in practice. In particular, we develop fast algorithms for finding if a given fingerprint already resides in the database and for determining whether a given image was taken by a camera whose fingerprint is in the database.
New multilocus linkage disequilibrium measure for tag SNP selection

Numerous approaches have been proposed for selecting an optimal tag single-nucleotide polymorphism (SNP) set. Most of these approaches are based on linkage disequilibrium (LD). Classical LD measures, such as D' and r2, are frequently used to quantify the relationship between two marker (pairwise) linkage disequilibria. Despite of their successful use in many applications, these measures cannot be used to measure the LD between multiple-marker. These LD measures need information about the frequencies of alleles collected from haplotype dataset. In this study, a cluster algorithm is proposed to cluster SNPs according to multilocus LD measure which is based on information theory. After that, tag SNPs are selected in each cluster optimized by the number of tag SNPs, prediction accuracy and so on. The experimental results show that this new LD measure can be directly applied to genotype dataset collected from the HapMap project, so that it saves the cost of haplotyping. More importantly, the proposed method significantly improves the efficiency and prediction accuracy of tag SNP selection.
Joint channel and power allocation in dynamic cognitive small cell networks using asymmetric graphical game

Nowadays, cognitive small cell networks (CSCNs) have been widely accepted as a promising and efficient method to deal with exponentially increasing demand of wireless data services. As small cells become smaller and denser, inter-cell interference (ICI) at user equipments (UEs), coming from adjacent base stations (BSs), expanded dramatically and has grown more complicated to be managed. In order to improve cellular throughput in randomly changing small cell networks (SCNs), this article investigates the problem of joint channel and power allocation with dynamic active BSs, using dynamic stochastic game-theoretic learning solutions. It is challenging to address this optimization problem especially when active BSs sets are randomly changing from slot to slot. Dynamic asymmetric graphical game for network throughput maximization will be proposed in this article. It is proved to be an exact potential game (EPG) and the best Nash equilibria of this game correspond to the optimal solutions of this optimization problem. To cope with the difficulties of uncertainty and dynamicity in SCNs, a dynamic joint channel and power selection stochastic learning algorithm (DJCPS-SLA) is put forward, which is analytically proved converging to the Nash equilibria of the accurately formulated game upon changing active BSs sets. The performance of the proposed learning algorithm, DJCPSSLA, far surpasses that of random selection algorithm for joint channel and power allocation. Moreover, the dynamics promote the network throughput to some extent. Finally, the simulation results validate the convergence, annotates a tradeoff between dynamicity, optimality, and robustness.
A Combinatorial Bound on the List Size

In this paper we study the scenario in which a server sends dynamic data over a single broadcast channel to a number of passive clients. We consider the data to consist of discrete packets, where each update is sent in a separate packet. On demand, each client listens to the channel in order to obtain the most recent data packet. Such scenarios arise in many practical applications such as the distribution of weather and traffic updates to wireless mobile devices and broadcasting stock price information over the Internet. To satisfy a request, a client must listen to at least one packet from beginning to end. We thus consider the design of a broadcast schedule which minimizes the time that passes between a clients request and the time that it hears a new data packet, i.e., the waiting time of the client. Previous studies have addressed this objective, assuming that client requests are distributed uniformly over time. However, in the general setting, the clients behavior is difficult to predict and might not be known to the server. In this work we consider the design of universal schedules that guarantee a short waiting time for any possible client behavior. We define the model of dynamic broadcasting in the universal setting, and prove various results regarding the waiting time achievable in this framework.
An Example of Robustly Optimal Monetary Policy with Near-Rational Expectations

This paper considers optimal monetary stabilization policy in a forward-looking model, when the central bank recognizes that private-sector expectations need not be precisely model-consistent and wishes to choose a policy that will be as good as possible in the case of any beliefs that are close enough to model-consistency. It is found that commitment continues to be important for optimal policy, that the optimal long-run inflation target is unaffected by the degree of potential distortion of beliefs, and that optimal policy is even more history-dependent than if rational expectations are assumed. (JEL: E52) (c) 2006 by the European Economic Association.
Quantitative evaluation of physical assembly support in human supporting production system “attentive workbench”

We have proposed "attentive workbench (AWB)," an assembly cell that supports the production activities of human workers. Attentive workbench is composed of an augmented desk interface and self-moving trays with the Sawyer planar motors. In this paper, real assembly experiments using the implemented AWB system are carried out. The merit of the physical assembly support by the proposed system is evaluated quantitatively in the view of necessary time for product assembly.
RoμNect: Hand mounted depth sensing using a commodity gaming sensor

In this work, we investigate the applicability of the Kinect depth camera as a robot mounted measurement unit. In contrast to traditional head mounted robot sensors, Kinect is small, cheap and delivers robust depth measurements on a variety of scenes. In the course of applying it on a robot arm, we solve a number of problems: we reduce the sensor working distance to a few centimeters, replace the Laser projector unit by a focusable projector, and calibrate this sensor unit. We further exploit the motion capabilities of the robot arm to integrate multiple depth maps with 30 Hz in a volumetric fusion approach. We show how this method considerably improves completeness of the scanned models, even under severe reflections and difficult surface properties. We employ our approach in a classical bin-picking setting, where the robot scans the object during its approaching motion, and picks it afterwards.
EVEE FS : Securing Access to Untrusted Filesystems in Enclaved Execution

Enclaved execution techniques like Intel SGX guarantee secure execution of applications in presence of a compromised operating system. However, these techniques still rely on the underlying OS for services such as filesystem management. In this paper, we present attacks called syscall-abuse attacks on applications such as OpenSSL and ClamAV in presence of a compromised filesystem management service. To mitigate such attacks, we design and implement LEVEEFS — a filesystem abstraction to ensure secure access to untrusted storage in enclaved execution environment. LEVEEFS simultaneously provides security, efficiency and expressiveness guarantees. Unlike existing solutions, the trusted computing base (TCB) is small and comprises of approximately 3836 LOC i.e, 7.62 % of the total filesystem size. To evaluate the expressiveness, we execute various file benchmarks like Bonnie++, Iozone and FileBench along with application benchmarks like CoreUtils, OpenSSL and ClamAV. LEVEEFS system incurs an average overhead of 8.03 % on these benchmarks which is acceptable for practical use.
Single channel speech enhancement using adaptive filtering and best correlating noise identification

Speech enhancement using adaptive filtering methods are known to give good signal recovery from the noisy speech signal. Among these, Least Mean Square (LMS) and Recursive Least Squares (RLS) algorithms are more popular. These algorithms have a constraint that correlating noise should be given as the reference signal for denoising. Therefore in all the adaptive algorithms, two microphones are used, one for capturing noisy speech and the other for capturing noise signal alone. Always, capturing noise alone is difficult. To overcome the above constraint, we propose a novel method which identifies the best correlating part of the noise signal with respect to noise in noisy speech and this can be used as the reference for speech enhancement in adaptive algorithms. Once, best correlating noise is identified, Variable Step Size LMS (VSSLMS) and RLS algorithms are used for speech enhancement. Prior to this, noise classification is done to identify the type of noise present in the speech. Bark features and Support Vector Machine (SVM) are used for noise classification. SVM based noise classification combined with the identification of the best correlating part of noise for using as reference in adaptive algorithms for single channel speech enhancement is proposed in this work. Proposed system gives very good performance even in the case of speech mixed with non-stationary noise under very low signal-to-noise ratio (SNR) conditions.