Miracle-dz/UniFAR-FTUs huggingface dataset:
Propolis and its flavonoid compounds cause cytotoxicity on human urinary bladder transitional cell carcinoma in primary culture

Background and purpose: The flavonoids present in propolis are considered to be a rich source of chemopreventive agents since they have various therapeutic biological activities. This study was carried out to find whether propolis and its polyphenolic/flavonoid compounds may induce cytotoxicity in primary culture of human urinary bladder transitional cell carcinoma (TCC) cells as compared to normal urinary bladder epithelial cells. Material and Methods: Pieces of TCC or normal bladder epithelial tissue were collected by transurethral surgery from patients in different stages (grade G1, G2, G3) of TCC. Single cell suspension from pieces of either TCC or normal bladder epithelial tissue was prepared according to standard laboratory procedure. Incubation for cytotoxicity testing was carried out in RPMI-1640 medium with 20% FCS at 37°C and with 5% CO2 with or without different concentration (50, 150, 300 µg/ml) of test components. Results:. The cytotoxicity of two preparations of propolis (water and ethanolic extract of propolis; WSDP or EEP) and its polyphenolic compounds (caffeic acid, naringin, chrysin, and quercetin) was determined using trypan blue exclusion assay. The findings suggest that EEP is the most effective in inhibition of urinary bladder TCC cell proliferation as compared to WSDP or single flavonoids derived from propolis. All test components showed no cytotoxic effect on normal epithelial cells. Conclusions: The result of this study may have considerable impact on the potential use of EEP as an adjuvant to surgery to suppress or prevent tumor recurrence in urinary bladder since only a few anti-cancer drugs have been effective in tumor control. As immunomodulation by BCG has been used to improve the results of surgery it is likely that propolis preparation (EEP) as an immunomodulating compound may be a substitute for mycobacterial treatment since propolis preparation or its polyphenolic components have expressed no side effect after treatment. However, the exact cancer chemoprevention mechanisms of propolis have to be elucidated.
Research on strong-association rule based web application vulnerability detection

With the increase of the web applications in information society, web application software security become more and more important. Recent investigations show that web application vulnerabilities have become the largest security threat. Websense security report shows that in the first half of year 2008 above 75% of the most popular web site have utilized by the hackers to run malicious code. Detecting and solving vulnerability is the effective way to enhance web security. In this paper we focus on the regression test in web vulnerability detection, and present a strong-association rule based algorithm to make the detection more efficient. In the first step we traverse the whole web site to get the web page collection. And then, in the regression test, we make the association between the pages and expand the pages to a collection set. The set will used in the following iterate traverse. And we define the relational grade to describe the association. Finally, we do the experiment on our target web site which contains the known vulnerabilities such as XSS and SQL injection, and the result shows that the algorithm can detect almost all the pages that may contains vulnerabilities in the target web site.
An Ad-hoc Distributed Reasoning Scheme for Content Centric Networking

Intelligently discovering knowledge and principles hidden in massive amounts of distributed and dynamic sources is a challenging issue, since the connectivity of sources and mobility of contents are frequent changing. For achieving intelligently discovering knowledge and principles in network environments, it requires a strong adaptive mechanism of distributed reasoning to discover the indirect and dynamic semantics in content-centric networking. In this paper, we propose a novel ad-hoc scheme for distributed reasoning by extending the name-based routing mechanism in content centric networking. The ad-hoc scheme of distributed reasoning is a native process of the content-centric networking. First, a two-stage reasoning mechanism is presented for reasoning query forwarding and knowledge reasoning. And then for guiding original or evolved queries to all right sources and supporting the knowledge integration in the way back, a recursive reasoning procedure and various reasoning rules are introduced.
Interval analysis of microcontroller code using abstract interpretation of hardware and software

Static analysis is often performed on source code where intervals -- possibly the most widely used numeric abstract domain -- have successfully been used as a program abstraction for decades. Binary code on microcontroller platforms, however, is different from high-level code in that data is frequently altered using bitwise operations and the results of operations often depend on the hardware configuration. We describe a method that combines word- and bit-level interval analysis and integrates a hardware model by means of abstract interpretation in order to handle these peculiarities. Moreover, we show that this method proves powerful enough to derive invariants that could so far only be verified using computationally more expensive techniques such as model checking.
A Zero Knowledge Sumcheck and its Applications

Many seminal results in Interactive Proofs (IPs) use algebraic techniques based on low-degree polynomials, the study of which is pervasive in theoretical computer science. Unfortunately, known methods for endowing such proofs with zero knowledge guarantees do not retain this rich algebraic structure. In this work, we develop algebraic techniques for obtaining zero knowledge variants of proof protocols in a way that leverages and preserves their algebraic structure. Our constructions achieve unconditional (perfect) zero knowledge in the Interactive Probabilistically Checkable Proof (IPCP) model of Kalai and Raz [KR08] (the prover first sends a PCP oracle, then the prover and verifier engage in an Interactive Proof in which the verifier may query the PCP). Our main result is a zero knowledge variant of the sumcheck protocol [LFKN92] in the IPCP model. The sumcheck protocol is a key building block in many IPs, including the protocol for polynomial-space computation due to Shamir [Sha92], and the protocol for parallel computation due to Goldwasser, Kalai, and Rothblum [GKR15]. A core component of our result is an algebraic commitment scheme, whose hiding property is guaranteed by algebraic query complexity lower bounds [AW09,JKRS09]. This commitment scheme can then be used to considerably strengthen our previous work [BCFGRS16] that gives a sumcheck protocol with much weaker zero knowledge guarantees, itself using algebraic techniques based on algorithms for polynomial identity testing [RS05,BW04]. We demonstrate the applicability of our techniques by deriving zero knowledge variants of well-known protocols based on algebraic techniques, including the protocols of Shamir and of Goldwasser, Kalai, and Rothblum, as well as the protocol of Babai, Fortnow, and Lund [BFL91].
CMOS smart temperature sensors for RFID applications

This paper presents an overview of the capabilities and different architectures for integrated temperature sensors in RFID tags using CMOS technology. A feasibility study for the integration of temperature sensors in RFID tags is described. The study focuses on four topologies to make temperature measurements and compare them regarding power, temperature range, accuracy, resolution and technology node. Measurement results of a test structure based on a potential proportional to absolute temperature (Vptat) fabricated in deep-submicron CMOS technology is presented and discussed.
A sensorless vector strategy for the PMSM using improved sliding mode observer and fuzzy PI speed controller

To reduce the cost and obtain accurate rotor position of the permanent magnet synchronous motor (PMSM), a sensorless vector strategy for the PMSM using an improved sliding mode observer (SMO) and a fuzzy PI speed controller is proposed. The mathematical model of the PMSM is firstly presented. Then, a sigmoid function is applied to the improved SMO for overcoming chattering, and the observer of back electromotive force instead of the low-pass filter is introduced to the SMO. The stability of the improved SMO is further proved with the Lyapunov function. Additionally, the fuzzy PI speed controller is designed. The simulation is performed based on MATLAB, and the experiment is carried out under the developed test rig based on DSP TMS320F2808. The effectiveness of the proposed strategy is finally verified.
A set of interactions to help resolve 3D geometry problems

Tablets with touch-screens, multi-touch interfaces and various sensors are becoming increasingly common. More and more schools are testing them with their pupils in the hope of bringing pedagogic benefits. Thanks to this new type of device, new sets of interactions can be thought of. Many studies have tested user reception of innovative interactions. At the present time, pedagogic benefits can be evaluated to resolve 3D geometry problems. In this paper, we used an already accepted set of interactions to manage rotation of solids and we evaluated its pedagogic benefit on a test group of learners aged 9 to 15. We propose a protocol based on mathematics didactic and pedagogy. We compared the set of interactions with classic sheets of paper and solids. Our results show that using our set of interactions increase significantly good answers.
Complex Determinantal Processes and $H1$ Noise

For the plane, sphere, and hyperbolic plane we consider the canonical invariant determinantal point processes $\mathcal Z_\rho$ with intensity $\rho d\nu$, where $\nu$ is the corresponding invariant measure. We show that as $\rho\to\infty$, after centering, these processes converge to invariant $H^1$ noise. More precisely, for all functions $f\in H^1(\nu) \cap L^1(\nu)$ the distribution of $\sum_{z\in \mathcal Z} f(z)-\frac{\rho}{\pi} \int f d \nu$ converges to Gaussian with mean zero and variance $ \frac{1}{4 \pi} \|f\|_{H^1}^2$.
Area, delay, power, and cost trends for metal-programmable structured ASICs (MPSAs)

As integrated circuits are scaled to finer process geometries, the risk involved with the increased design effort and high NRE costs becomes too great for some applications. FPGAs offer one solution, but for high performance, high volume, or low power applications, FPGAs may not be suitable. For some of these applications, structured ASICs may provide a better solution. Structured ASICs share many of the same characteristics as FPGAs, but consume less power, are more dense, and can run faster. Despite these advantages, structured ASICs have not yet achieved the level of popularity some had predicted. There are several possible reasons, including unfamiliar technology, immature CAD, and claimed advantages which have not yet been concretely demonstrated. In much the same way that it has helped improve FPGA adoption, we believe that an increased public research effort can begin to address many of these issues. This paper takes a step in this direction by investigating metal-programmable structured ASICs, or MPSAs. We determine the area, delay, and power trends and quantify the cost advantages of MPSAs relative to cell based ICs (CBICs) for a wide range of possible MPSA logic architectures and layout assumptions. In particular, we quantify the impact of the number of user-defined metal mask layers on these metrics. Results suggest the number of these programmable layers should be as small as possible for most MPSAs, unless very large die sizes are required.
Three-dimensional finite element simulations of compression tests on bimrock

The paper deals with the mechanical behaviour of “bimrock” (block in matrix rock), characterized by a heterogeneous structure, constituted by rock blocks included in a small-grained, well-cemented material (matrix) with lower mechanical characteristics. The bimrock is a very peculiar material that may give rise to serious problems in engineering applications. To properly model this kind of problems it is necessary to suitably characterize the bimrock. In order to contribute to the understanding of the bimrock mechanical behaviour and to individuate strength and deformability laws suitable for the bimrock as an equivalent continuum, as the problem is clearly three-dimensional, 3D numerical analyses have been carried out by using the finite element method implemented in the Adina code. Uniaxial and triaxial compression tests on bimrock laboratory samples are simulated. Different volumetric proportions of the blocks are considered. The numerical results show the influence of the volume proportion of the blocks on the strength and deformability of bimrock, confirming the results obtained with previous 2D analyses. Furthermore, the results suggest that the interfaces between the blocks and the matrix play an important role, and may have an influence on the mechanical behaviour of bimrock.
Fe b 20 04 Principal Series Representations of Direct Limit Groups

We combine the geometric realization of principal series representations of [28] with the Bott–Borel–Weil Theorem for direct limits of compact groups found in [22], obtaining limits of principal series representations for direct limits of real reductive Lie groups. We introduce the notion of weakly parabolic direct limits and relate it to the conditions that the limit representations are norm–preserving representations on a Banach space or unitary representations on a Hilbert space. We specialize the results to diagonal embedding direct limit groups. Finally we discuss the possibilities of extending the results to limits of tempered series other than the principal series.
Phosphorylation of the Chromatin Binding Domain of KSHV LANA

The Kaposi sarcoma associated herpesvirus (KSHV) latency associated nuclear antigen (LANA) is expressed in all KSHV associated malignancies and is essential for maintenance of KSHV genomes in infected cells. To identify kinases that are potentially capable of modifying LANA, in vitro phosphorylation assays were performed using an Epstein Barr virus plus LANA protein microarray and 268 human kinases purified in active form from yeast. Interestingly, of the Epstein-Barr virus proteins on the array, the EBNA1 protein had the most similar kinase profile to LANA. We focused on nuclear kinases and on the N-terminus of LANA (amino acids 1–329) that contains the LANA chromatin binding domain. Sixty-three nuclear kinases phosphorylated the LANA N-terminus. Twenty-four nuclear kinases phosphorylated a peptide covering the LANA chromatin binding domain (amino acids 3–21). Alanine mutations of serine 10 and threonine 14 abolish or severely diminish chromatin and histone binding by LANA. However, conversion of these residues to the phosphomimetic glutamic acid restored histone binding suggesting that phosphorylation of serine 10 and threonine 14 may modulate LANA function. Serine 10 and threonine 14 were validated as substrates of casein kinase 1, PIM1, GSK-3 and RSK3 kinases. Short-term treatment of transfected cells with inhibitors of these kinases found that only RSK inhibition reduced LANA interaction with endogenous histone H2B. Extended treatment of PEL cell cultures with RSK inhibitor caused a decrease in LANA protein levels associated with p21 induction and a loss of PEL cell viability. The data indicate that RSK phosphorylation affects both LANA accumulation and function.
Rethinking Indoor Wireless Mesh Design: Low Power, Low Frequency, Full-Duplex

Existing indoor WiFi networks in the 2.5GHz and 5 GHz use too much transmit power, needed because the high carrier frequency limits signal penetration and connectivity. Instead, we propose a novel indoor wireless mesh design paradigm, based on Low Frequency, using the newly freed white spaces previously used as analogue TV bands, and Low Power - 100 times less power than currently used. Preliminary experiments show that this maintains a similar level of connectivity and performance to existing networks. It also yields more uniform connectivity, thus simplifies MAC and routing protocol design. We also advocate full-duplex networking in a single band, which becomes possible in this setting (because we operate at low frequencies). It potentially doubles the throughput of each link and eliminates hidden terminals.
Meta-programming in Nemerle

We present the design of a meta-programming system embedded into Nemerle, a new functional language for the . NET platform. The system enables compile-time operations – generation, transformation and automated analysis of programs by means of hygienic code quotation, syntax extensions, operating on the code like on any other datatype (e.g. listing, adding or changing members of class definition), performing partial typing of a program syntax tree (compiler internal typing procedures are executed by a macro code) and interoperability with the compilation process. All these operations can be fully parametrized with any external data (like a database, a file or a web page). Our system is a convenient tool for Aspects Oriented Programming with the ability to operate on datatypes, traverse the program code and perform various algorithmic operations on its content.
An asynchronous cluster head rotation scheme for wireless sensor networks

Inspired by the migration and division in cells' life-time, we introduce an asynchronous cluster head rotation(ACR) scheme to address unbalanced load in large-scale wireless sensor network and prolong its lifetime. ACR provides an on-demand and low-overhead scheme to rotate CHs asynchronously. Clusters migrate or reproduce using a closed-loop and heuristic mechanism, according to their energy condition individually. Simulation experiments comparing ACR with several state-of-art clustering algorithms demonstrate that ACR obtains an extended lifetime while maintaining a harmonious topology. We probed further into the simulation results and reveal the distinctions between ACR and other clustering schemes.
Merging regions based on the VDM distance

In a per-object classification system, many authors have advised a two-step process: First by obtaining small, homogeneous objects, second by merging those regions. The authors present a new method to decide whether two regions belong to the same class or not. An extension of Chang and Li's method of adaptive region-growing is proposed, in order to take into account the case of multiband images. Region dispersion is calculated by means of the vector degree of match (VDM) distance, proposed by Baraldi and Parmiggiani. This distance measures the similarity degree of two n-dimensional vectors. Each intra-region similarity is computed and then compared with other regions. Instead of defining a similarity degree fixed threshold, obtained by a trial and error process, they propose an adaptive one, based on a global percentage similarity. In short, this work proposes a reduction of the features space into a one-dimensional space which measures the similarity by a non-parametric criterion, thereby avoiding the determination of the density function problem.
Apply word vectors for sentiment analysis of APP reviews

Vector representations for language have been shown to be useful in a number of Natural Language Processing tasks. In this paper, we aim to investigate the effectiveness of word vector representations for the problem of Sentiment Analysis. In particular, we target three sub-tasks namely sentiment words extraction, polarity of sentiment words detection, and text sentiment prediction. We investigate the effectiveness of vector representations over different text data and evaluate the quality of domain-dependent vectors. Vector representations has been used to compute various vector-based features and conduct systematically experiments to demonstrate their effectiveness. Using simple vector based features, we achieve F1 85.77%, the recall 85.20%, and the accuracy 86.35% for text sentiment analysis of APP reviews.
Research on situation awareness based on ontology for UUV

To solve the problem of using information to control behavior for unmanned underwater vehicle (UUV), this paper presents a situation awareness method on the basis of ontology. During the period of UUV operation, situation perceived information is more important for the safety of UUV and therefore, real-time and accurate perception of the situation has an important impact on UUV autonomous decision making. The according to the characteristics of information processing of situation awareness of UUV, architecture of situation awareness and the core ontology of UUV are set up in this paper, event monitoring module, event recognition module, and all of above base on the basis constructed ontology model of situation awareness. The ontology method expands the situation awareness information, and improves the efficiency by applying the rules reasoning and Bayesian network. Finally, the random obstacles event and the deviation event are simulated to test the validation of UUV situation awareness and its ability of decision making. The results show that UUV can quickly trigger re-planning threads according to situation awareness information, which realize autonomous controlling aiming to uncertain events. The simulating results verify the effectiveness of situation awareness method in the marine environment.
Cellular Factors Involved in HTLV-1 Entry and Pathogenicit

Human T cell leukemia virus type 1 (HTLV-1) is the causative agent of adult T cell leukemia (ATL) and HTLV-1 – associated myelopathy and tropical spastic paraparesis (HAM/TSP). HTLV-1 has a preferential tropism for CD4 T cells in healthy carriers and ATL patients, while both CD4 and CD8 T cells serve as viral reservoirs in HAM/TSP patients. HTLV-1 has also been detected other cell types, including monocytes, endothelial cells, and dendritic cells. In contrast to the limited cell tropism of HTLV-1 in vivo, the HTLV receptor appears to be expressed in almost all human or animal cell lines. It remains to be examined whether this cell tropism is determined by host factors or by HTLV-1 heterogeneity. Unlike most retroviruses, cell-free virions of HTLV-1 are very poorly infectious. The lack of completely HTLV-1-resistant cells and the low infectivity of HTLV-1 have hampered research on the HTLV entry receptor. Entry of HTLV-1 into target cells is thought to involve interactions between the env (Env) glycoproteins, a surface glycoprotein (surface unit), and a transmembrane glycoprotein. Recent studies have shown that glucose transporter GLUT1, heparan sulfate proteoglycans (HSPGs), and neuropilin-1 (NRP-1) are the three proteins important for the entry of HTLV-1. Studies using adherent cell lines have shown that GLUT1 can function as a receptor for HTLV. HSPGs are required for efficient entry of HTLV-1 into primary CD4 T cells. NRP-1 is expressed in most established cell lines. Further studies have shown that these three molecules work together to promote HTLV-1 binding to cells and fusion of viral and cell membranes. The virus could first contact with HSPGs and then form complexes with NRP-1, followed by association with GLUT1. It remains to be determined whether these three molecules can explain HTLV-1 cell tropism. It also remains to be more definitively proven that these molecules are sufficient to permit HTLV-1 entry into completely HTLV-1-resistant cells.