Miracle-dz/UniFAR-FTUs huggingface dataset:
Suppressing fatty acid uptake has therapeutic effects in preclinical models of prostate cancer

Prostate cancer depends on fatty acid uptake and remodeling of the prostate lipidome, and blocking fatty acid uptake impairs prostate tumorigenesis. Leave the fat out Prostate cancer is one of the most common tumors in men. Although characterized by slow growth rate, preventing prostate cancer progression to an aggressive stage is a major challenge. Watt et al. focused on cancer metabolism and showed increased fatty acid uptake in human malignant prostate cancer tissue. The increased uptake was mediated by up-regulation of the fatty acid translocase CD36. Silencing CD36 in human prostate cancer cells reduced fatty acid uptake and cell proliferation. In prostate cancer mouse and human preclinical models, Cd36 ablation or inhibition reduced prostate cancer severity. The data suggest that CD36 might be targeted for treating prostate cancer. Metabolism alterations are hallmarks of cancer, but the involvement of lipid metabolism in disease progression is unclear. We investigated the role of lipid metabolism in prostate cancer using tissue from patients with prostate cancer and patient-derived xenograft mouse models. We showed that fatty acid uptake was increased in human prostate cancer and that these fatty acids were directed toward biomass production. These changes were mediated, at least partly, by the fatty acid transporter CD36, which was associated with aggressive disease. Deleting Cd36 in the prostate of cancer-susceptible Pten−/− mice reduced fatty acid uptake and the abundance of oncogenic signaling lipids and slowed cancer progression. Moreover, CD36 antibody therapy reduced cancer severity in patient-derived xenografts. We further demonstrated cross-talk between fatty acid uptake and de novo lipogenesis and found that dual targeting of these pathways more potently inhibited proliferation of human cancer-derived organoids compared to the single treatments. These findings identify a critical role for CD36-mediated fatty acid uptake in prostate cancer and suggest that targeting fatty acid uptake might be an effective strategy for treating prostate cancer.
An ingestible self-orienting system for oral delivery of macromolecules

Delivering fragile drugs to the gut Oral delivery is the simplest and least invasive way to deliver many pharmaceuticals, but many drugs and medications, including insulin, cannot survive passage through the stomach or the gastrointestinal tract. Abramson et al. developed an ingestible delivery vehicle that could self-reorient from any starting position so as to attach to the gastric wall. Encapsulation of a spring in a sugar casing allowed for triggered actuation for the delivery of biomolecules. The approach successfully provided active insulin delivery in pigs. Science, this issue p. 611 An oral device efficiently delivers biomacromolecules via gastric injection. Biomacromolecules have transformed our capacity to effectively treat diseases; however, their rapid degradation and poor absorption in the gastrointestinal (GI) tract generally limit their administration to parenteral routes. An oral biologic delivery system must aid in both localization and permeation to achieve systemic drug uptake. Inspired by the leopard tortoise’s ability to passively reorient, we developed an ingestible self-orienting millimeter-scale applicator (SOMA) that autonomously positions itself to engage with GI tissue. It then deploys milliposts fabricated from active pharmaceutical ingredients directly through the gastric mucosa while avoiding perforation. We conducted in vivo studies in rats and swine that support the applicator’s safety and, using insulin as a model drug, demonstrated that the SOMA delivers active pharmaceutical ingredient plasma levels comparable to those achieved with subcutaneous millipost administration.
Contributions to Shared Control Architectures for Advanced Telemanipulation. (Contributions aux architectures de contrôle partagé pour la télémanipulation avancée)

While full autonomy in unknown environments is still in far reach, shared-control architectures where the human and an autonomous controller work together to achieve a common objective may be a pragmatic "middle-ground". In this thesis, we have tackled the different issues of shared-control architectures for grasping and sorting applications. In particular, the work is framed in the H2020 RoMaNS project whose goal is to automatize the sort and segregation of nuclear waste by developing shared control architectures allowing a human operator to easily manipulate the objects of interest. The thesis proposes several shared-control architectures for dual-arm manipulation with different operator/autonomy balance depending on the task at hand. While most of the approaches provide an instantaneous interface, we also propose architectures which automatically account for the pre-grasp and post-grasp trajectories allowing the operator to focus only on the task at hand (ex., grasping). The thesis also proposes a shared control architecture for controlling a force-controlled humanoid robot in which the user is informed about the stability of the humanoid through haptic feedback. A new balancing algorithm allowing for the optimal control of the humanoid under high interaction forces is also proposed.
Efficient algorithms for computing approximate equilibria in bimatrix, polymatrix and Lipschitz games

In this thesis, we study the problem of computing approximate equilibria in several classes of games. In particular, we study approximate Nash equilibria and approximate well-supported Nash equilibria in polymatrix and bimatrix games and approximate equilibria in Lipschitz games, penalty games and biased games. We construct algorithms for computing approximate equilibria that beat the cur- rent best algorithms for these problems. In Chapter 3, we present a distributed method to compute approximate Nash equilibria in bimatrix games. In contrast to previous approaches that analyze the two payoff matrices at the same time (for example, by solving a single LP that combines the two players’ payoffs), our algorithm first solves two independent LPs, each of which is derived from one of the two payoff matrices, and then computes an approximate Nash equilibrium using only limited communication between the players. In Chapter 4, we present an algorithm that, for every δ in the range 0 < δ ≤ 0.5, finds a (0.5+δ)-Nash equilibrium of a polymatrix game in time polynomial in the input size and 1 . Note that our approximation guarantee does not depend on δ the number of players, a property that was not previously known to be achievable for polymatrix games, and still cannot be achieved for general strategic-form games. In Chapter 5, we present an approximation-preserving reduction from the problem of computing an approximate Bayesian Nash equilibrium (e-BNE) for a two-player Bayesian game to the problem of computing an e-NE of a polymatrix game and thus show that the algorithm of Chapter 4 can be applied to two-player Bayesian games. Furthermore, we provide a simple polynomial-time algorithm for computing a 0.5-BNE. In Chapter 5, we study games with non-linear utility functions for the players. Our key insight is that Lipschitz continuity of the utility function allows us to provide algorithms for finding approximate equilibria in these games. We begin by studying Lipschitz games, which encompass, for example, all concave games with Lipschitz continuous payoff functions. We provide an efficient algorithm for computing approximate equilibria in these games. Then we turn our attention to penalty games, which encompass biased games and games in which players take risk into account. Here we show that if the penalty function is Lipschitz continuous, then we can provide a quasi-polynomial time approximation scheme. Finally, we study distance biased games, where we present simple strongly poly- nomial time algorithms for finding best responses in L1, L2, and L∞ biased games, and then use these algorithms to provide strongly polynomial algorithms that find 2/3, 5/7, and 2/3 approximations for these norms, respectively.
A comparison of ABR and UBR to support TCP traffic

This paper compares the performance of ABR and UBR for providing high-speed network interconnection services for TCP traffic. We test the hypothesis that UBR with adequate buffering in the ATM switches results in better overall goodput for TCP traffic than explicit rate ABR for LAN interconnection. This is shown to be true in a wide selection of scenarios. Four phenomena that may lead to bad ABR performance are identified and we test whether each of these has a significant impact on TCP goodput. This reveals that the extra delay incurred in the ABR end-systems and the overhead of RM cells account for the difference in performance. We test whether it is better to use ABR to push congestion to the end-systems in a parking-lot scenario or whether we can allow congestion to occur in the network. Finally, we test whether the presence of a `multiplexing loop' causes performance degradation for ABR and UBR. We find our original hypothesis to be true in all cases. We observe, however, that ABR is able to improve performance when the buffering inside the ABR part of the network is small compared to that available at the ABR end-systems. We also see that ABR allows the network to control fairness between end-systems.
Error detection and correction using fast coding

This paper presents new methods to encode the message, detects the error, and corrects the message in the communication processes. These methods have been developed based on Reed Muller basic matrix. The key point for the implementation of error-free communication is the encoding of the information to be transmitted in such a way that some extent of redundancy is included in the encoded data, and a method for efficient decoding at the receiver is available. These two requirements have been achieved in the new method in an efficient and simple way. The new methods are demonstrated using some examples, and have give a good result.
Experiments in Automatic Phrase Indexing For Document Retrieval: A Comparison of Syntactic and Non-Syntactic Methods

In order for an automatic information retrieval system to effectively retrieve documents related to a given subject area, the content of each document in the system''s database must be represented accurately. This study examines the hypothesis that better representations of document content can be constructed if the content analysis method takes into consideration the syntactic structure of document and query texts. Two methods of automatically generating phrases for use as content indicators have been implemented and tested experimentally. The non-syntactic (or statistical) method is based on simple text characteristics such as word frequency and the proximity of words in text. The syntactic method uses augmented phrase structure rules (production rules) to selectively extract phrases from parse trees generated by an automatic syntactic analyzer. Experimental results show that the effect of non-syntactic phrase indexing is inconsistent. For the five collections tested, increases in average precision ranged from 22.7% to 2.2% over simple, single term indexing. The syntactic phrase indexing method was tested on two collections. Precision figures averaged over all test queries indicate that non-syntactic phrase indexing performs significantly better than syntactic phrase indexing for one collection, but that the difference is insignificant for the other collection. More detailed analysis of individual queries, however, indicates that the performance of both methods is highly variable, and that there is evidence that syntax-based indexing has certain benefits not available with the non-syntactic approach. Possible improvements of both methods of phrase indexing are considered. It is concluded that the prospects for improving the syntax-based approach to document indexing are better than for the non-syntactic approach. The PLNLP system was used for syntactic analysis of document and query texts, and for implementing the syntax-based phrase construction rules. The SMART information retrieval system was used for retrieval experimentation.
Self-adaptive Route Selection for DHT in Wireless Sensor Networks

Using distributed hash tables (DHTs) over wireless sensor networks (WSNs) as the overlay layer has gained much attention recently because of its well designed topology and efficient data management [1]. The data of sensor nodes are stored in the overlay network, which ensures the data integrity against node failures. Nodes in a WSN are randomly deployed and may switch to sleep mode or fail due to the energy depletion, which results in changes of the network topology. Retrieving data is therefore a challenging task in such distributed and varying environments. Query latency is the most important performance metric in DHT and may not be proportional to the hop count along a route. Proximity neighbor/route selection (PNS/PRS) are used to find the shortest route and reduce latency based on the basic DHT routing. However, most existing works on PNS and PRS suffer from high overhead and frequent node arrival and departure (churn). Therefore, we propose a proximity-aware routing algorithm based on Pastry [2], dubbed PastryAS, to provide self-adaptive selection of routes and neighbors based on attractor selection [3], a biologically inspired model which operates well in ambient and fluctuating environments. Attractor selection performs a stochastic adaptation of its system state taking into account environmental changes by to an activity term, and converges to a stable state known as an attractor. In Pastry, each node has a unique ID and maintains a leafset and routing table, which corresponds to the partition of the node ID space. We propose a redundant routing table (RRT) to implement both route selection and parallel query forwarding. A passive routing table maintenance scheme is used to piggyback the routing information onto the query requests and ACKs. Only r candidates with IDs within a particular range are stored in the RRT entry as possible states, among which attractor selection is performed inspired by the equations in [3]. The performance of the selected route, such as the measured RTT, is mapped to the activity and influences the next selection. Finally, an attractor is selected from close-by neighbors. Since the topology of WSNs is always changing, whenever a node discovers new neighbors or their departure, the activity becomes low and drives the node to search for a new attractor solution. Thus, a low latency is achieved after several selections without any explicit probing and it is also maintained under churn. Parallel query forwarding is enabled by the nodes with sufficient bandwidth to achieve less timeouts and quick dissemination of the routing information. Compared with the original Pastry, we expect Pastry-AS to achieve lower latency in routing and less overhead in the routing table maintenance. In a dynamic network, RRT and parallel forwarding achieve a very low probability of timeouts, which further reduces the latency.
Usability Specifications as Tool in Iterative Development.

Abstract : Poor usability of contemporary computer systems has impelled a concern with how usability can play a role in the system design process. In this chapter, we criticize approaches that consist of usability analysis of fully articulated design alternatives. Such approaches cannot in principle support the design process that produced the alternative designs in the first place. We develop an approach based on usability specifications: precise, testable statements of performance goals for typical users carrying out tasks typical of their projected use of the system. These in turn must be factored into their behavioral prerequisites, which we call subskills, in order to pinpoint and remedy specific problems in a design. Like functional specifications, the usability specifications and the subskills they imply are viewed as being iteratively elaborated and refined throughout the design process. An extended example from the domain of text editing is presented.
Science Words Students Know

centripetal heterogeneous kinetic propagate terrestrial abyss conduct homogenous latent quantitative trajectory acoustics diffract hybrid narcosis refract tropism amplitude dipole hypothesis oscillation replicate turbidity anaerobic dynamic inhibit ovule salinity variation apogee ellipse interval oxidation superpose vestigial aurora energy invariant pattern synthesis viscosity biennial exothermic joule perennial taxonomy volatile biosphere ze ith lary related to science, is presented, were identified in locally produced This word list was developed to promaterials. From these words a list vide teachers evidence of the recogof 277 scientific terms, which nition of selected science words by could be defined by use of cornstudents in grades 7, 8, 9, 10, 11, mon graded word lists, was seand 12. Though the list was devellected. Definitions were provided oped for use by teachers in the that contained words with diffiBroward County (Florida) Schools, a culty already established as besubsequent study indicates its utility low the seventh grade vocabulary for other populations (Knight and (Rinsland, 1945; Thorndike and Barry, in press). Lorge, 1944). Each word was Initially, some 450 science words tested with a significant sample KNIGHT & BETHUNE: Science Words 505 This content downloaded from 157.55. 39.112 on Wed, 07 Sep 2016 05:01:50 UTC All use subject to http://about.jstor. org/terms of students (N = 2,920) in grades 7-12 from the twenty-nine junior and senior high schools in Broward County. The instruments were designed to test the ability of students to substitute meaningful words or phrases for the vocabulary words as they are used in sentences. The definition developed for each word was not designed to test depth of science knowledge but hopefully would provide a measure of the ability of students to read material that contained these words (Bethune, 1969; Knight and Bethune, 1970). In compiling the lists, if 75 percent of the students at a given grade level knew the word, it was included for that grade level. This is an arbitrary percentage. It is felt that, given proper contextual support, students at a given grade level would recognize a larger percentage of words. The words in the list could thus be used successfully in classes at that level. Since the trend was to higher percentages at higher grades any word appearing on the seventh grade list could be considered proper for eighth grade and above. Conversely any word on the eighth grade list but not on the seventh grade list should be clarified for the seventh grade students. Some possible applications for this list are: 1. Teachers may use words that are already in the reading vocabulary of students as they prepare materials for classroom use. They will be able to omit words which are probably not understood by the intended reader thereby making their materials more readable. 2. Teachers may use the list as a guide in estimating the number of "new" vocabulary words introduced in commercially prepared
Visualizzazione Volumetrica Diretta Interattiva con effetti di illuminazione mediante Register Combiner OpenGL

In diversi ambiti scientifici e industriali, la sempre piu frequente acquisizione di dati volumetrici fa crescere la domanda di potenti tool per la loro visualizzazione, analisi e manipolazione interattiva. In questo rapporto presentiamo una tecnica di visualizzazione volumetrica diretta che consente l’applicazione del modello di illuminazione di Phong in tempo reale. La tecnica implementa il modello ottico di assorbimento + emissione eseguendo in tempo reale campionamento, mapping e integrazione delle proprieta ottiche esclusivamente attraverso funzionalita base di OpenGL 1.2. L’implementazione del modello di Phong, basato sul calcolo del gradiente di opacita, e eseguito in tempo reale utilizzando i Register Combiner. I vincoli del real-time sono soddisfatti anche grazie alla applicazione di una tecnica di accelerazione multipass basata sulla copia rapida di informazioni dal framebuffer alla memoria di texture, offerta gia dalla versione 1.1 di OpenGL.
Design of a simulation of atmospheric sunbeams

Computer graphics researchers have made significant progress in modelling clouds and light. However, for a model of atmospheric sunbeams to have any pseudo-physical basis, it is necessary for these two classes of models to interact. In this paper we review each of these classes and design a model for offline rendering of sunbeams. Applications could include photorealistic rendering of outdoor scenes for computer generated movies using high-performance computing.
Optimisation d'une antenne miniature pour des applications de capteurs sans fil

Cet article presente le developpement et la realisation d'une antenne miniature destinee a etre utilisee pour des capteurs sans fil. Une etude sur la topologie de l'antenne a ete effectuee afin d'optimiser ses performances. Son ren-dement important ainsi que son fort facteur de qualite per-mettent ainsi d'augmenter sa portee ainsi que d'accroitre son efficacite spectrale. La mesure des proprietes d'im-pedance et de rayonnement de trois prototypes valide le comportement obtenu en simulation.
Towards Simplification of the Software Development Process The Hyper-Code Abstraction

The photoelastic strain gauge coating comprises a sheet of photoelastic material of predetermined shape having a multiplicity of minute discontinuities or sets of discontinuities arranged in a predetermined grid. The predetermined shape and grid, together with boundary devices, provide a standard format to enable use of supporting computer programs. In practicing the method, the coating is bonded to the workpiece surface to be analyzed, and then illuminated by polarized light and photographed. The photograph is then magnified greatly to enable examination seriatim of the patterns at and about each discontinuity or set of discontinuities. The data thus obtained is processed, using the supporting computer programs to obtain a strain field of the portion of the workpiece covered by the coating.
Enhancing Computer Security with Smart Technology

Downloading the book in this website lists can give you more advantages. It will show you the best book collections and completed collections. So many books can be found in this website. So, this is not only this enhancing computer security with smart technology. However, this book is referred to read because it is an inspiring book to give you more chance to get experiences and also thoughts. This is simple, read the soft file of the book and you get it.
A Coherent Family of Analyzable Graphical Representations for Object-Oriented Software

Many software engineering tools and techniques rely on graphical representations of software, such as control ow graphs, program dependence graphs, or system dependence graphs. To apply these tools and techniques to object-oriented software, we cannot necessarily use existing graphical representations of procedural software. Representations of object-oriented software, like those for procedural software, must depict individual procedures (methods) and entire programs; however, they must also depict classes and their interactions , and account for the eeects of inheritance, polymorphism, and aggregation. These representations should facilitate the use of existing program analysis tools and techniques, rather than requiring us to create new techniques. A system for constructing and managing these representations should take advantage of the code reuse inherent in object-oriented software, by reusing representational components. In this paper, we describe a coherent family of graphical representations of object-oriented software that meet the foregoing qualiications, and we outline the architecture of an eecient, extensible system for constructing and managing those representations.