Miracle-dz/UniFAR-FTUs huggingface dataset:
Vascular Endothelium As a Contributor of Plasma Sphingosine 1-Phosphate

Sphingosine 1-phosphate (S1P), an abundant lipid mediator in plasma, regulates vascular and immune cells by activating S1P receptors. In this report, we investigated the mechanisms by which high plasma S1P levels are maintained in mice. We found that plasma S1P turns over rapidly with a half-life of ≈15 minutes, suggesting the existence of a high-capacity biosynthetic source(s). Transplantation of bone marrow from wild-type to Sphk1−/−Sphk2+/− mice restored plasma S1P levels, suggesting that hematopoietic cells are capable of secreting S1P into plasma. However, plasma S1P levels were not appreciably altered in mice that were thrombocytopenic, anemic, or leukopenic. Surprisingly, reconstitution of Sphk1−/−Sphk2+/− bone marrow cells into wild-type hosts failed to reduce plasma S1P, suggesting the existence of an additional, nonhematopoietic source for plasma S1P. Adenoviral expression of Sphk1 in the liver of Sphk1−/− mice restored plasma S1P levels. In vitro, vascular endothelial cells, but not hepatocytes, secreted S1P in a constitutive manner. Interestingly, laminar shear stress downregulated the expression of S1P lyase (Sgpl) and S1P phosphatase-1 (Sgpp1) while concomitantly stimulating S1P release from endothelial cells in vitro. Modulation of expression of endothelial S1P lyase with small interfering RNA and adenoviral expression altered S1P secretion, suggesting an important role played by this enzyme. These data suggest that the vascular endothelium, in addition to the hematopoietic system, is a major contributor of plasma S1P.
Robust nuclear lamina-based cell classification of aging and senescent cells

Changes in the shape of the nuclear lamina are exhibited in senescent cells, as well as in cells expressing mutations in lamina genes. To identify cells with defects in the nuclear lamina we developed an imaging method that quantifies the intensity and curvature of the nuclear lamina. We show that this method accurately describes changes in the nuclear lamina. Spatial changes in nuclear lamina coincide with redistribution of lamin A proteins and local reduction in protein mobility in senescent cell. We suggest that local accumulation of lamin A in the nuclear envelope leads to bending of the structure. A quantitative distinction of the nuclear lamina shape in cell populations was found between fresh and senescent cells, and between primary myoblasts from young and old donors. Moreover, with this method mutations in lamina genes were significantly distinct from cells with wild-type genes. We suggest that this method can be applied to identify abnormal cells during aging, in in vitro propagation, and in lamina disorders.
Special report from the National Institute of Neurological Disorders and Stroke. Classification of cerebrovascular diseases III.

Introduction The purpose of this Classification of Cerebrovascular Diseases III is to delineate the types of cerebrovascu-lar disease in clinical and pathological terminology so that all or any portion of the classification may be used by clinicians, surgeons, pathologists, or physiatrists as well as by other groups interested in the subject. It is also intended to define clinical and pathological diagnostic terms for common use. The background material is intended as supporting information for the clinical and pathological classifications. The second Ad Hoc Committee on Cerebrovascular Diseases 1 developed a classification, published in 1975, that provided a clinical and pathological framework for cerebrovascular diseases at that time. The Classification and Outline of Cerebrovascular Diseases II was published near the beginning of an explosion in technological developments that have dramatically enhanced our capability to evaluate patients with these disorders. Technological advances will continue, but the present Classification of Cerebrovascular Diseases III and background material reflect the current state of our knowledge. By the term "cerebrovascular diseases" we refer to all disorders in which there is an area of brain transiently or permanently affected by ischemia or bleeding and/or in which one or more blood vessels of the brain are primarily impaired by a pathological process. The terms "cerebrovascular" and "cerebral" are used in the original Latin sense, referring to the entire brain and not merely to the hemispheres of the forebrain. The term "stroke" is commonly used as a generic term to represent any one or all of a group of disorders, including cerebral infarction, intracerebral hemorrhage, or subarachnoid hemorrhage. The background material supporting the Classification of Cerebrovascular Diseases III recognizes the potential impact of preventive measures on stroke occurrence. It also recognizes the enhancements of our capabilities . o define anatomic lesions in the brain and in the blood vessels in living patients by technological developments. The outline summarizes the classification of the clinical and pathologic disorders and the background material on prevention, clinical assessment, evaluation , status of the patient following stroke, and anatomy. The anatomy and pathology are sufficiently defined in the outline; therefore, the descriptive material, which follows the outline precisely, does not provide information for anatomy and pathology. The document begins with the classification and then provides an orderly format for proceeding from prevention through clinical assessment and evaluation to the poststroke status of the patient and to the organization of the anatomical terms. It is intended …
PORTAGE Phrase-Based System for Chinese-to-English Translation

Generally, in one form of the invention, a computer system for executing application programs in hard real-time, comprises a central processing unit (CPU) for executing the application programs and system programs and a computer memory partitioned into a data memory and a code memory. A garbage collector, which executes on said CPU, places a write barrier over certain portions of memory. Furthermore, it transfers an object from a location in the memory to a second object at another location in the memory. In a critical section, which may not be interrupted, it allocates sufficient space for the second object so that the entire contents from the first object can be copied into the second object, and in an interruptable section, it copies the entire contents of the first object into the second object. A write routine is linked into the application programs for updating objects in the computer memory. The write routine is operable to update both the first object and the second object whenever the garbage collector is transferring the contents of the object into the second object. Both copies are thereby kept current.
Dielectric Characterization by Microwave Cavity Perturbation Corrected for Nonuniform Fields

Nonuniform fields decrease the accuracy of dielectric characterization by microwave cavity perturbation. These fields are due to the slot in the cavity through which the sample is inserted and the boundary between the sample and the metallic walls inside of the cavity. To address this problem, we measured the natural frequency and damping ratio of a resonant cavity as a sample is inserted into the rectangular cavity. We found that for a range of cavity filling fractions, a linear regression on the natural frequency and damping ratio versus the effective volume fraction of the sample in the cavity could be used to extract the complex permittivity of the sample. We verified our technique by measuring a known quartz substrate and comparing the results to finite-element simulations. When compared to the conventional technique, we found a significant improvement in the accuracy for our samples and measurement setup. We confirmed our technique on two lossy samples: a neat stoichiometric mixture bisphenol A epoxy resin and one containing a mass fraction of 3.5% multi-walled carbon nanotubes (MWCNTs). At the TE103 mode (7.31 GHz), the permittivity and loss tangent of the epoxy were measured to be εr=2.93±0.11 and tanδ = 0.028±0.002, respectively. The epoxy with a mass fraction of 3.5% MWCNTs had a permittivity of εr=8.01±0.48 and loss tangent of tanδ = 0.137±0.010.
Sliding-mode control of a direct-drive submersible grinding robot

The goal of this paper is to present the first controller that has been applied to an original system, which is a direct-drive submersible grinding robot. Since this application is quite recent, an analogy is made with machine tools equipped with linear motors, and the control methods that have been applied are reviewed. This review has led to the selection of the sliding-mode controller with the best potential because of its robustness to external perturbations and its ease of implementation. Experimental results show that the controller manages to maintain a good trajectory tracking error while being robust to disturbances, such as those generated by the grinding process.
MER-1 EARLY SIMULATION RESULTS OF THE ARIES-1 SATELLITE SENSOR FOR MULTI-TEMPORAL VEGETATION RESEARCH DERIVED FROM AVIRIS

The Australian-based ARIES Consortium (Australian Resource Information and Environment Satellite), a commercial joint venture between CSIRO and private industry, is on track for deployment of the ARIES-1 hyperspectral resource mapping satellite in the year 2001/2002. The ARIES-1 spectrometer will be an area array scanning up to 105 spectral bands between 0.4 2. 5μm at 30m spatial resolution. The satellite will also include a 10m panchromatic high spatial resolution imager.
A simple model to characterize social networks

For the purpose of prediction analysis of customer relationships in social networks, this paper proposes a simple model that can generate future states of a social network based on relevant data analysis. In this model, nodes and edges of the social network are inserted at the same preferential attachment probabilities, but deleted at different anti-preferential attachment probabilities. In this model, we consider the limit of the network size, the directions of incident links and the factor of time in attractiveness when deleting nodes. Networks generated from this model have a nice property that the degree distribution follows the power-law, which desirably characterizes an essential property of social networks. This property is derived by applying the mean-field theory [7]. It is validated through simulation: we use C++, MATLAB to generate the degree distribution map of our model, and PAJEK to draw the topology map of social networks that was generated by our model. We also show that networks generated from our model can self-organize into scale-free networks. If −C − 1< E < m−2C/2, deleting nodes will not result in destruction of the network.
Introduction to the Special Issue on Managing Knowledge in Organizations: Creating, Retaining, and Transferring Knowledge

Interest in the issues of organizational learning and knowledge management on the part of academics and practitioners increased dramatically in recent years. On the practical side, changes in technology and modes of organizing work, globalization, and increased competition brought the issues of organizational learning and knowledge management to center stage for organizations. New developments in computing and information technology enabled the retention and transfer of information in organizations on a larger scale than was once possible. Shifts to more distributed modes of organizing work made knowledge transfer a priority for firms. The greater prevalence of the multiunit organizational form, such as a franchise or chain (Baum and Greve 2001), and the greater frequency of interorganizational relationships (Powell et al. 1996) also increased the importance of knowledge transfer for firms. Parallel to the surge in interest among practitioners, academic interest in organizational learning and knowledge management also grew considerably, as evidenced by the proliferation of books and articles recently published on the subject.1 In addition, a
Correlation of systemic superoxide dismutase deficiency to airflow obstruction in asthma.

RATIONALE Increased oxidative stress and decreased superoxide dismutase (SOD) activity in the asthmatic airway are correlated to airflow limitation and hyperreactivity. We hypothesized that asthmatic individuals with higher levels of oxidative stress may have greater loss of SOD activity, which would be reflected systemically in loss of circulating SOD activity and clinically by development of severe asthma and/or worsening airflow limitation. METHODS To investigate this, serum SOD activity and proteins, the glutathione peroxidase/glutathione antioxidant system, and oxidatively modified amino acids were measured in subjects with asthma and healthy control subjects. RESULTS SOD activity, but not Mn-SOD or Cu,Zn-SOD protein, was lower in asthmatic serum as compared with control, and activity loss was significantly related to airflow limitation. Further, serum SOD activity demonstrated an inverse correlation with circulating levels of 3-bromotyrosine, a posttranslational modification of proteins produced by the eosinophil peroxidase system of eosinophils. Exposure of purified Cu,Zn-SOD to physiologically relevant levels of eosinophil peroxidase-generated reactive brominating species, reactive nitrogen species, or tyrosyl radicals in vitro confirmed that eosinophil-derived oxidative pathways promote enzyme inactivation. CONCLUSION These findings are consistent with greater oxidant stress in asthma leading to greater inactivation of SOD, which likely amplifies inflammation and progressive airflow obstruction.
The Martini Synch : Using Accelerometers for Device Pairing

Device pairing is a significant problem for a large class of increasingly popular resource-constrained wireless protocols such as BlueTooth. The objective of pairing is to establish a secure wireless communication channel between two specific devices without a public-key infrastructure, a secure near-field communication channel, or electrical contact. In this paper, we use a surprising user-device interaction as a solution to this problem. By adding an accelerometer, a device can sense its motion in a Cartesian space relative to the inertial space. The idea is to have two devices in a fixed, relative position to each other. Then, the joint object is moved randomly in 3D for several seconds. The unique motion generates approximately the same distinct signal at the accelerometers. The difference between the signals in the two inertially conjoined sensors should be relatively small under normal motion induced manually. The objective is to derive a deterministic key at both sides with maximized entropy that will be used as a private key for symmetric encryption. Currently, our prototype produces between 9–20 bits of entropy per second of usual manual motion using off-the-shelf components.
Tabulation-based Induction Proofs with Application to Automated Verification

XSB [14] is a tabled logic programming system designed to address shortcomings in Prolog’s SLD eval-uation mechanism for Horn programs. SLD’s poor termination and complexity properties have renderedProlog unsuitablefor deductive database (DDB) and non-monotonicreasoning (NMR) applications. In con-trast, XSB’s implementation achieves a computationally tight integration of the logic programming (LP),DDB, and NMR paradigms.When tabled resolution is used in XSB (by declaring particular predicates to be tabled), the systemautomatically maintains a table of predicate invocations and answers, using the table for all equivalentinvocations after the ﬁrst one. Many programs that would loo p inﬁnitely in Prolog will terminate in XSBbecause XSB calls a tabled predicate with the same arguments only once, whereas Prolog may call such apredicate inﬁnitely often. For these terminating programs XSB efﬁciently computes the least model, whichis the least ﬁxed point of the program rules understood as “eq uations” over sets of atoms. More precisely,XSB is based on SLG resolution [2], which computes queries to normal logic programs (containing defaultnegation) according to the well-founded semantics.Tabled resolution methods introduce a new level of declarativeness over traditional (Prolog-like) logicprogramming systems. Availability of tabled LP systems makes it feasible to develop a larger class of efﬁ-cient declarative solutionsto complex applications. One such application is model checking [3, 11, 4] whichis a veriﬁcation technique aimed at determining whether a sy stem speciﬁcation possesses a certain propertyexpressed as a temporal logic formula. From a computational viewpoint, algorithmic model checking canbe formulated in terms of ﬁxed-point computations. By encoding the semantics of process languages andtemporal logics as logic programs we can cast this computation at a high level into computing the minimalmodel of the logic programs. By using metaprogramming facilities of logic programming, one can imple-ment deductive techniques and thereby integrate them tightly with algorithmic model checking. Our XMCsystem [12] aims to achieve such an integration.XMC is an XSB-based model checker written in less than 200 lines of tabled Prolog code. In its currentstate, XMC can verify ﬁnite-state systems speciﬁed using va lue-passing CCS [9] and formulas expressedin modal mu-calculus [8]. XMC’s space and time performance is competitive with hand-coded (in C/C++)model checkers such as the Concurrency Factory [5] and SPIN [6] from Bell Labs.In this abstract we illustrate how tabled resolution, as realized in XSB, can be exploited to constructinduction proofs. Our motivation for using tabulation-based induction stems from our desire to performmodel checking on inﬁnite-state systems. A common example of inﬁnite-state systems are parameterizedsystems, such as an
Recovering Casing and Punctuation using Conditional Random Fields

This paper describes the winning entry to the ALTA Shared Task 2013. The theme of the shared task was recovery of casing and punctuation information from degraded English text. We tackle the task as a sequential labeling problem, jointly learning the casing and punctuation labels. We implement our sequential classifier using conditional random fields, trained using linguistic features extracted with offthe-shelf tools with simple adaptations to the specific task. We show the improvement due to adding each feature we consider, as well as the improvment due to utilizing additional training data beyond that supplied by the shared task organizers.
Seven good reasons for mobile agents

Dispatch your agents; shut off your machine. Mobility is an orthogonal property of agents, that is, not all agents are mobile. An agent can just sit there and communicate with its environment through conventional means, such as remote procedure calling and messaging. We call agents that do not or cannot move " stationary agents. " A stationary agent executes only on the system on which it begins execution. If it needs information not on that system or needs to interact with an agent on another system, it typically uses a communication mechanism, such as remote procedure calling. In contrast, a mobile agent is not bound to the system on which it begins execution [1]. It is free to travel among the hosts in the network. Created in one execution environment, it can transport its state and code with it to another execution environment in the network, where it resumes execution. The term " state " typically means the attribute values of the agent that help it determine what to do when it resumes execution at its destination. Code in an object-oriented context means the class code necessary for an agent to execute. A mobile agent has the unique ability to transport itself from one system in a network to another in the same network. This ability allows it to move to a system containing an object with which it wants to interact and then to take advantage of being in the same host or network as the object. Our interest in mobile agents is not motivated by the technology per se but rather by the benefits agents provide for creating distributed systems. There are at least seven main benefits, or good reasons, to start using mobile agents: They reduce the network load. Distributed systems often rely on communication protocols involving multiple interactions to accomplish a given task. The result is a lot of network traffic. Mobile agents allow users to package a conversation and dispatch it to a destination host where interactions take place locally. Mobile agents are also useful when reducing the flow of raw data in the network. When very large volumes of data are stored at remote hosts, that data should be processed in its locality rather than transferred over the network. The motto for agent-based data processing is simple: Move the computation to the data rather than the data to the computation. They overcome network latency. …
How to Progress Beliefs in Continuous Domains

When Lin and Reiter introduced the progression of basic action theories in the situation calculus, they were essentially motivated by long-lived robotic agents functioning over thousands of actions. However, their account does not deal with probabilistic uncertainty about the initial situation nor with effector or sensor noise, as often needed in robotic applications. In this paper, we obtain results on how to progress continuous degrees of belief against continuous effector and sensor noise in a semantically correct fashion. Most significantly, and perhaps surprisingly, we identify conditions under which our account is not only as efficient as the filtering mechanisms commonly used in robotics, but considerably more general.
Field Trial of Transgenic Indian Mustard Plants Shows Enhanced Phytoremediation of Selenium-Contaminated Sediment

G A R Y B A Ñ U E L O S , † N O R M A N T E R R Y , * , ‡ D A N I K A L . L E D U C , ‡ E L I Z A B E T H A . H . P I L O N S M I T S , § A N D B R U C E M A C K E Y | ARS-USDA, 9611 South Riverbend Avenue, Parlier, California 93648, Department of Plant and Microbial Biology, 111 Koshland Hall, University of California, Berkeley, California 94720-3102, Biology Department, Colorado State University, Fort Collins, Colorado 80523, and ARS-USDA, 800 Buchanan, Albany, California 94710
A Grid-Based Self-Deployment Schemes in Mobile Sensor Networks

Efficient deployment of sensors is one of important issues in wireless sensor networks. Several self- deployment schemes based on Voronoi diagram have been proposed. These schemes distribute sensors uniformly over the covered area, but they cannot make the sensing area fully covered and their coverage expansion speed is not high. We propose a new gridbase self-deployment scheme. The proposed scheme divides the sensing area into small cells, each of which will be covered by a sensor and sensors are deployed to grid centers. The proposed scheme makes the sensing area fully and fast, but the average moving distance of sensors are increased compared with Voronoi diagram-based algorithms. The average moving distance can be reduced by the hybrid scheme where a Voronoi diagrambased algorithm is executed for some rounds before the proposed algorithm is executed. We implement our simulator used to analyze the performance of the proposed schemes as well as the existing self-deployment schemes. The simulation results show that our schemes can makes the sensing area fully and fast.