gebhart/patrepeval huggingface dataset:
Indoor infrared wireless networks utilising PPM CDMA (2002)

A new hybrid PPM-CDMA is proposed for the mobile indoor infrared network. The technique provides asynchronous multiple access where each user (or facility on the network) is assigned a signature code belonging to the class of optical orthogonal codes (OOC). Original results are presented indicating that there exists an optimum PPM-CDMA order that maximises the achievable bit rate at a given number of users. Performance results are presented and the optimum operating parameters are specified.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Prohead RNA of bacteriophage<i>π</i>29: size, stoichiometry and biological activity (1989)

We previously demonstrated (Guo et al., 1987. Nucl. Acids Res. 15, 7081-7090) that purified proheads of bacteriophage phi 29 contain an RNA of 120 bases which is essential for DNA packaging. Here we report that this RNA exists primarily as a polymer of ca. 174 residues in phage-infected cells and that ca. 54 bases are cleaved from its 3'-terminus by adventitious nucleases during the purification of proheads. The long and short forms of the RNA had similar activity in in vitro DNA packaging and phage assembly. We report the sequence of the long form of the RNA and show that similar long and short forms can be isolated from the proheads of the phi 29 relatives phi 21, phi 15 and SF5. The concentration dependence in the reconstitution of RNA-free proheads suggests that one copy of the RNA is sufficient to restore DNA packaging activity to RNA-free proheads. However, quantitative measurements indicate that 5 to 6 copies of the RNA are present on proheads isolated from phage-infected cells.
CS proofs (2002)

This paper puts forward a computationally-based notion of proof and explores its implications to computation at large. In particular, given a random oracle or a suitable cryptographic assumption, we show that every computation possesses a short certificate vouching its correctness, and that, under a cryptographic assumption, any program for a /spl Nscr//spl Pscr/-complete problem is checkable in polynomial time. In addition, our work provides the beginnings of a theory of computational complexity that is based on "individual inputs" rather than languages.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Methane Emissions from Process Equipment at Natural Gas Production Sites in the United States: Liquid Unloadings (2014)

Methane emissions from liquid unloadings were measured at 107 wells in natural gas production regions throughout the United States. Liquid unloadings clear wells of accumulated liquids to increase production, employing a variety of liquid lifting mechanisms. In this work, wells with and without plunger lifts were sampled. Most wells without plunger lifts unload less than 10 times per year with emissions averaging 21,000-35,000 scf methane (0.4-0.7 Mg) per event (95% confidence limits of 10,000-50,000 scf/event). For wells with plunger lifts, emissions averaged 1000-10,000 scf methane (0.02-0.2 Mg) per event (95% confidence limits of 500-12,000 scf/event). Some wells with plunger lifts are automatically triggered and unload thousands of times per year and these wells account for the majority of the emissions from all wells with liquid unloadings. If the data collected in this work are assumed to be representative of national populations, the data suggest that the central estimate of emissions from unloadings (270 Gg/yr, 95% confidence range of 190-400 Gg) are within a few percent of the emissions estimated in the EPA 2012 Greenhouse Gas National Emission Inventory (released in 2014), with emissions dominated by wells with high frequencies of unloadings.
Nicotine induced periodontal ligament fibroblasts (PDLFs) apoptosis through NF-κB and p53 path way (2011)

Objective To study the signal transduction mechanism of nicotine induced periodontal ligament fibroblasts (PDLFs) apoptosis. Methods This study used 1 μg/ml, 10μg/ml and 100μg/ml nicotine to intervene PDLFs cells for 24h separately. NF-κB, p53, I-κB and Caspase3 expression were detected. Results After Nicotine was done on PDLFs cells for 24h, the transcription of p53, and Caspase3,and the translation of Caspase 3 protein were increased, while NF-κB was decreased. At the same time, the transcription of NF-κB decreased gradually with the concentration of nicotine increased ( r = 0. 707, F =33. 705, P ＜0. 01 ), nevertheless, I-κB was reversed ( r =0. 964, F =374. 883, P ＜0. 01 ). p53 expression was increased gradually with the concentration of nicotine increased ( r =0. 957, F = 153. 377, P ＜0. 01).Both Caspase3 mRNA (r =0.935, F =318.371, P ＜0.01) and protein (r =0.677, F =8. 459, P ＜ 0. 05 )increased gradually. Conclusion Nicotine induced PDLFs apoptosis was mediated through NF-κB and p53 pathway.

Key words: 
Nicotine/AD;  Apoptosis;  Periodontal ligament/ME/DE;  Fibroblasts/ME/DE;  NFkappa B/ME/DE; Tumor suppressor protein p53/ME/DE
Compiler-directed physical address generation for reducing dTLB power (2004)

Address translation using the Translation Lookaside Buffer (TLB) consumes as much as 16% of the chip power on some processors because of its high associativity and access frequency. While prior work has looked into optimizing this structure at the circuit and architectural levels, this paper takes a different approach of optimizing its power by reducing the number of data TLB (dTLB) lookups for data references. The main idea is to keep translations in a set of translation registers, and intelligently use them in software to directly generate the physical addresses without going through the dTLB. The software has to work within the confines of the translation registers provided by the hardware, and has to maximize the reuse of such translations to be effective. We propose strategies and code transformations for achieving this in array-based and pointer-based codes, looking to optimize data accesses. Results with a suite of Spec95 array-based and pointer-based codes show dTLB energy savings of up to 73% and 88%, respectively, compared to directly using the dTLB for all references. Despite the small increase in instructions executed with our mechanisms, the approach can in fact provide performance benefits in certain cases.
The clinical meaning of mucin phenotype and Epstein-Barr virus infection in gastric cancer. (2008)

There appears to be little need to determine the mucin phenotype or EBV status of endoscopically resected lesions. In cases of gastric cancer where surgical resection is indicated, however, where the preoperative findings indicate a depth of invasion to SM or greater, and/or an undifferentiated lesion, then mucin phenotyping of biopsy specimens may be useful in predicting the predominant histological type of the tumor.
A phase Ib/II, open-label, dose escalation study to evaluate the safety, pharmacokinetics, and efficacy of SM88 in patients with prostate cancer. (2017)

TPS2615 Background: Non-hormonal treatments for biochemically recurrent non-metastatic prostate cancer (nmPC) are limited. SM88 is a novel combination of proprietary tyrosine isomer (TI) and other repurposed agents (CYP3a4 inducer, mTOR inhibitor and catalyst) designed to selectively increase metabolic oxidative stress in cancer cells. Early data reported SM88 activity in solid tumors without significant toxicity (Hoffman et al J Clin Oncol 2013; e22095, Hoffman et al Ann Onc 2016: vi551). Methods: This is an open-label multi-center, dose escalating, dose expansion study in nmPC who have failed or refused androgen deprivation. The study includes a dose escalation phase Ib and dose expansion phase 2. The primary objectives are to determine the effect of SM88 on circulating tumor cells (CTC), and progression-free survival. Secondary objectives are: LDH, bone-specific alkaline phosphatase, urinary N-telopeptide, neutrophyll/llymphocyte ratio, cutaneous hyper-pigmentation correlation, PSA doubling times, safety, and patient reported outcomes. As of Jan ‘17, Phase 1b cohorts 1 and 2, with TI and component PK evaluations, have completed enrollment with adequate numbers to establish the Phase 2 dose without DLT. Phase 2 has begun, with 33 patients planned for at least 6 cycles (@28d) to reach the desired power. This would be followed by a pivotal Phase 3 study in the same group of patients. We propose to conduct a pivotal randomized phase 3 of SM88 in rising PSA, nmPC versus patient’s and clinician’s choice, limited to 2 options i.e. observation or ADT therapy. Inclusion would include doubling time < 9 months, elevated CTCs and recurrent disease after localized curative intent therapy (the same population as our completed Phase I and ongoing phase II). Outcomes will include delay of radiographic PFS, and delay of time to subsequent toxic therapy i.e. cytotoxic systemic chemo and/or radiation therapy. We proposed this pivotal trial will lead to a successful NDA for an indication in this population of patients. Rapid accrual is expected at several institutions because of the urgent need for less toxic alternatives to androgen deprivation therapy.
An easily computed functional level testability measure (2003)

The authors consider the problem of estimating the testability of a digital circuit at the functional level. Using an information-theoretic approach, they have developed a functional testability measure for both controllability and observability. They introduce two techniques that can efficiently and accurately estimate the measure. In addition, some applications of the testability measure for automated design for testability, such as automatic circuit partitioning and test point insertion, are described.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Enhancing Power Saving Mechanisms for Ad Hoc Networks Using Neighborhood Information (2008)

The power saving mechanism (PSM) was proposed by IEEE 802.11 for ad hoc networks in order to help prolong battery longevity for mobile nodes. A closer look at this mechanism enables us to see some room for further improvements of its performance especially for dense networks. According to the PSM, each station must announce its traffic before it can send it. Thus, PSM can require a large announcement period (the ATIM window) when there are many defined traffic flows so that all the stations can transmit their announcement frames. This paper contributes to the betterment of the PSM by proposing two new protocols (the BTA-PSM and the UTA- PSM), derived from the PSM. These protocols try to enhance its performance by inferring from the already advertised future behaviors of the neighboring nodes of a given mobile station. The proposed improvements aim at reducing the number of exchanged announcement frames in order to increase the throughput and decrease power consumption and delay. Simulations results testified to the superiority of the BTA-PSM and UTA-PSM schemes over the traditional PSM in ensuring greater power saving, higher throughput and lower delay.
Storing Custom Data Sets in a Blockchain System (2019)

Saving important data has become a problem, not only for data consistency but also for data security and privacy. Nowadays is rather possible that data will reach bad people or processes rather than to be lost. That is why redundant data backup must be done with strict supervision and acknowledgement. In this sense, blockchain systems are very interesting solution for keeping important data (personal or business). This paper shows how a blockchain type system can be used for storing data. As an example, the paper will present how both automated measured data (virtual instrumentation) and manual computed (some marketing results) can be saved to blockchain system using an application programming interface (API).
Trusted Collaborative Real Time Scheduling in a Smart Card Exokernel (2004)

This paper presents the work we have conducted concerning real time scheduling in Camille, an exokernel dedicated to smart cards. We show that it is possible to embedded a flexible real-time operating system despite the important hardware limitations of the smart card platform. We present the major difficulties one has to face when integrating real time support in an exokernel embedded on a very resource-limited platform. We first present a naive solution consisting in allocating an equal time slice to every system extensions and letting each one share it as needed amongst its tasks. We show that this solution does not account for loading of new extensions in the system, and that it can fail if some extensions have much more work to carry out than the others. We then present a more complex solution based upon collaborative schedulers grouped as virtual extensions. We show that this solution supports dynamic loading of new extensions and works even for very unbalanced task repartitions. We finally address the issue of trust between the collaborating extensions and we propose a solution based on exhaustive testing and formal proving of the plan functions.
Photochemical polishing of fused-silica optics by using ArF excimer laser (2001)

Polishing of fused silica micro optics was demonstrated without polishing dummy by using an ArF excimer laser and water solution. A fused silica glass sample was placed on the fluorocarbon grinding turntable. And the water solution was poured into a thin gap between the sample and fluorocarbon surface by capillary phenomenon. And a patterned ArF excimer laser light was irradiated on the fluorocarbon surface through the fused silica sample surface at the laser fluence of 15 mJ/cm<SUP>2</SUP>. By this photo irradiation, the water and fluorocarbon surface were photo- dissociated and produced hydrofluoric acid locally. By the hydrofluoric acid, the silica glass surface which were contacted with the hydrofluoric acid and fluorocarbon surface was etched. As a result, the only photo irradiated part of the silica glass sample was polished effectively.
A novel reactor for making uniform capsules (2001)

A novel chemical reactor was designed and developed for the continuous high-rate production of uniform capsules. This reactor helps to control precisely the reaction time between the reacting liquids (anion drops and the cation bath, or vice versa), thereby leading to the formation of uniform capsules with walls of identical thickness. In addition, mild tumbling of the capsules during transit through the reactor ensures that every capsule wall is uniformly thick all around.
Tolerating data access latency with register preloading (1992)

By exploiting fine grain parallelism, superscalar processors can potentially increase the performance of future supercomputers. However, supercomputers typically have a long access delay to their first level memory which can severely restrict the performance of superscalar processors. Compilers attempt to move load instructions far enough ahead to hide this latency. However, conventional movement of load instructions is limited by data dependence analysis. This paper introduces a simple hardware scheme, referred to as preload register update, to allow the compiler to move load instructions even in the presence of inconclusive data dependence analysis results. Preload register update keeps the load destination registers coherent when load instructions are moved past store instructions that reference the same location. With this addition, superscalar processors can more effectively tolerate longer data access latencies.
Control of integrated micro-resonator wavelength via balanced homodyne locking (2014)

We describe and experimentally demonstrate a method for active control of resonant modulators and filters in an integrated photonics platform. Variations in resonance frequency due to manufacturing processes and thermal fluctuations are corrected by way of balanced homodyne locking. The method is compact, insensitive to intensity fluctuations, minimally disturbs the micro-resonator, and does not require an arbitrary reference to lock. We demonstrate long-term stable locking of an integrated filter to a laser swept over 1.25 THz. In addition, we show locking of a modulator with low bit error rate while the chip temperature is varied from 5 to 60° C.
Functional Incorporation of Chimeric <i>b</i> Subunits into F <sub>1</sub> F <sub>o</sub> ATP Synthase (2007)

F(1)F(o) ATP synthases function by a rotary mechanism. The enzyme's peripheral stalk serves as the stator that holds the F(1) sector and its catalytic sites against the movement of the rotor. In Escherichia coli, the peripheral stalk is a homodimer of identical b subunits, but photosynthetic bacteria have open reading frames for two different b-like subunits thought to form heterodimeric b/b' peripheral stalks. Chimeric b subunit genes have been constructed by substituting sequence from the Thermosynechococcus elongatus b and b' genes in the E. coli uncF gene, encoding the b subunit. The recombinant genes were expressed alone and in combination in the E. coli deletion strain KM2 (Deltab). Although not all of the chimeric subunits were incorporated into F(1)F(o) ATP synthase complexes, plasmids expressing either chimeric b(E39-I86) or b'(E39-I86) were capable of functionally complementing strain KM2 (Deltab). Strains expressing these subunits grew better than cells with smaller chimeric segments, such as those expressing the b'(E39-D53) or b(L54-I86) subunit, indicating intragenic suppression. In general, the chimeric subunits modeled on the T. elongatus b subunit proved to be more stable than the b' subunit in vitro. Coexpression of the b(E39-I86) and b'(E39-I86) subunits in strain KM2 (Deltab) yielded F(1)F(o) complexes containing heterodimeric peripheral stalks composed of both subunits.
Self-coherent phase reference sharing for continuous-variable quantum key distribution (2016)

Generating "locally" the local oscillator is a fundamental requirement for continous-variable quantum key distribution (CV-QKD), both for performance and security reasons. As a consequence, next-generation CV- QKD systems will have to be implemented with a local local oscillator (LLO). This issue has been explicitly tackled in recent works, where the proposed and implemented approach, that we call LLO-sequential, consists in sequentially (temporally) multiplexing quantum signal optical pulses with phase reference pilot tones optical pulses. We develop a comprehensive analysis of the noise model and the hardware requirements in order to perform LLO CV-QKD. This analysis allows to quantitatively understand one of the limits of CV-QKD implemented with the LLO-sequential approach: such systems, unless operated at very high speed, have very strong requirements in terms of tolerable laser phase noise. LLO-sequential CV-QKD can thus in practice only be implemented with expensive, low phase noise lasers, such as ECL lasers. The main contribution of this work is to introduce designs for LLO CV-QKD based on self-coherence phase sharing, in which the phase reference information and the quantum information are coherently obtained from a single optical wavefront. We propose in particular a design, called LLO-displacement, where the phase reference information is encoded in the displacement of the standard CV-QKD Gaussian modulated coherent state (GMCS) protocol. We analyze the performance and the hardware requirements of the LLO-displacement design and our results indicate that it can be used to perform CV-QKD over distances up to 100 km with realistic and affordable hardware, in particular with standard telecom equipment and low cost DFB lasers. This opens a practical path towards the development of coherent quantum communications systems compatible with next-generation networks requirements.
Nonparametric Unfolding of Binary Choice Data (2000)

This paper shows a general nonparametric unfolding technique for maximizing the correct classification of binary choice or two-category data. The motivation for and the primary focus of the unfolding technique are parliamentary roll call voting data. However, the procedures that implement the unfolding also can be applied to the problem of unfolding rank order data as well as analyzing a data set that would normally be the subject of a probit, logit, or linear probability analysis. One aspect of the scaling method greatly improves Manski's “maximum score estimator” technique for estimating limited dependent variable models. To unfold binary choice data two subproblems must be solved. First, given a set of chooser or legislator points, a cutting plane must be found such that it divides the legislators/choosers into two sets that reproduce the actual choices as closely as possible. Second, given a set of cutting planes for the binary choices, a point for each chooser or legislator must be found which reproduces the actual choices as closely as possible. Solutions for these two problems are shown in this paper. Monte Carlo tests of the procedure show it to be highly accurate in the presence of voting error and missing data.
Layered space-time codes with iterative receiver and space-time soft-output decoding in a Rayleigh fading environment (2003)

We propose a modified BLAST architecture which employs space-time trellis codes at each layer as constituent codes, and an iterative parallel interference canceller (PIC) at the receiver. The PIC performs both interference regeneration and cancellation; and furthermore, the scheme employs maximum-likelihood soft-output decoders, based on the Viterbi algorithm. These decoders calculate the a posteriori probabilities of the codewords in order to produce a soft output. Comparisons are drawn against the original BLAST architecture and simulation results are obtained. A significant gain is achieved in the case of Horizontal BLAST and a similar gain for the case of Diagonal BLAST, at a reduced computational complexity.
Scalable power control for many-core architectures running multi-threaded applications (2011)

Optimizing the performance of a multi-core microprocessor within a power budget has recently received a lot of attention. However, most existing solutions are centralized and cannot scale well with the rapidly increasing level of core integration. While a few recent studies propose power control algorithms for many-core architectures, those solutions assume that the workload of every core is independent and therefore cannot effectively allocate power based on thread criticality to accelerate multi-threaded parallel applications, which are expected to be the primary workloads of many-core architectures. This paper presents a scalable power control solution for many-core microprocessors that is specifically designed to handle realistic workloads, i.e., a mixed group of single-threaded and multi-threaded applications. Our solution features a three-layer design. First, we adopt control theory to precisely control the power of the entire chip to its chip-level budget by adjusting the aggregated frequency of all the cores on the chip. Second, we dynamically group cores running the same applications and then partition the chip-level aggregated frequency quota among different groups for optimized overall microprocessor performance. Finally, we partition the group-level frequency quota among the cores in each group based on the measured thread criticality for shorter application completion time. As a result, our solution can optimize the microprocessor performance while precisely limiting the chip-level power consumption below the desired budget. Empirical results on a 12-core hardware testbed show that our control solution can provide precise power control, as well as 17% and 11% better application performance than two state-of-the-art solutions, on average, for mixed PARSEC and SPEC benchmarks. Furthermore, our extensive simulation results for 32, 64, and 128 cores, as well as overhead analysis for up to 4,096 cores, demonstrate that our solution is highly scalable to many-core architectures.