Miracle-dz/UniFAR-FTUs huggingface dataset:
Towards Engineering Novel PE-Based Immunotoxins by Targeting Them to the Nucleus

Exotoxin A (PE) from Pseudomonas aeruginosa is a bacterial ADP-ribosyltransferase, which can permanently inhibit translation in the attacked cells. Consequently, this toxin is frequently used in immunotoxins for targeted cancer therapies. In this study, we propose a novel modification to PE by incorporating the NLS sequence at its C-terminus, to make it a selective agent against fast-proliferating cancer cells, as a nucleus-accumulated toxin should be separated from its natural substrate (eEF2) in slowly dividing cells. Here, we report the cytotoxic activity and selected biochemical properties of newly designed PE mutein using two cellular models: A549 and HepG2. We also present a newly developed protocol for efficient purification of recombinant PE and its muteins with very high purity and activity. We found that furin cleavage is not critical for the activity of PE in the analyzed cell lines. Surprisingly, we observed increased toxicity of the toxin accumulated in the nucleus. This might be explained by unexpected nuclease activity of PE and its potential ability to cleave chromosomal DNA, which seems to be a putative alternative intoxication mechanism. Further experimental investigations should address this newly detected activity to identify catalytic residues and elucidate the molecular mechanism responsible for this action.
The impact and cost-effectiveness of strategies to detect drug-resistant tuberculosis

Drug-resistant tuberculosis (TB) is a serious emerging problem in many low-resource countries. TB control programmes are uncertain of which drug susceptibility tests (DSTs) to use and when to test patients. We predicted the potential cost-effectiveness of different DST strategies, in settings with varying prevalence of drug resistance. Using decision analysis, we assessed the cost-effectiveness of conventional and rapid DSTs for previously diagnosed smear-positive TB cases. Five different time-points were considered for administering DSTs. Different initial drug resistance and HIV scenarios were also considered. All DST scenarios in the wide range of settings considered were found to be cost-effective. The strategy of performing a rapid DST that detects any form of isoniazid (INH) and rifampicin (RIF) resistance for all patients before the initiation of treatment was predicted to be the most cost-effective strategy. In a setting with moderate drug resistance, the cost per disability-adjusted life year gained was as low as US$744. Our findings support the roll-out of rapid drug susceptibility testing at the moment of diagnosis to detect any form of INH and RIF resistance in all countries with moderate or greater burdens of drug-resistant TB.
1 Extending Transactions in Enterprise JavaBeans

Enterprise JavaBeans (EJB) is a new technology that aims at supporting distributed component-based applications written in Java. Since distributed electronic transactions are one of the frequent applications of EJB, the paper discusses the EJB support for advanced transactional applications and proposes an extension of the current transactional concepts in EJB. The extension, Bourgogne transactions, allows a transaction to delegate bean objects to transactions, to share bean objects with other transactions, and to establish flow control dependencies between transactions. Implementation issues together with pitfalls of the proposed extension are discussed.
"Follow Me" - Digital Jitter Measurement Method

This paper consists description of research results regarding digital jitter measurements for higher data rates. In previous publications (1)(2)(3) author has investigated different methods of digital jitter measurements, however they were applicable for data streams with lower clock frequencies. Developed methods and algorithms were optimised for implementation in FPGAs or ASICs. This work consists description of novel digital jitter measurement technique using programmable clock generators with phase shifters. Tests of this method were performed on well-known FPGA chips however may be easily extended to other digital environments. Obtained results are very promising; whole system may by integrated in one chip, measurement accuracy and resolution is pretty good and solution is easily scalable.
Webis at the TREC 2011 Session Track

In this paper we give a brief overview of the Webis group’s participation in the TREC 2011 Sessions track with an extended version of our last year’s approach [HSV10]. The basic idea can be described as a conservative query expansion based on terms used in previous queries or terms contained in clicked snippets. Furthermore, a query’s result set is reduced by removing documents shown for previous queries or documents containing important terms from non-clicked snippets.
An efficient load balancing method for constant degree P2P systems

Constant degree P2P systems are turning into the P2P domain's promising hotspot due to their good properties. However, it is often hard to convert a standard constant degree digraph to a flexible DHT schema adapting to dynamic P2P environments. Thus, most research about constant degree P2P focus on DHT's construction and maintenance, while leaving optimization and supporting to upper-layer application behind, such as complex query, load balance, etc. Combining constant degree topology's bit-shift routing schema, we presents an efficient load balancing algorithm based on Reverse Spanning Tree (REST) for constant degree P2P systems. Using the statistic information in joining process, REST judges how many Virtual Servers that a new join super peer can run, and then join all virtual servers evenly and fast with low cost based on the Spanning Tree Peer Set. Experimental results show, without additional data structure, REST keeps the constant degree P2P system load-balanced by assuring each peer of owning a key space proportional to its capability.
‘Dialogue divides if it is not fair’: Québec First Nations’ youth call for responsive spaces of citizenship

ABSTRACT The contemporary contours of citizenship and socio-spatial relationships between Indigenous peoples and settlers in Québec, Canada, are changing. Indigenous youth contribute in important ways to those changes. While some youth have become involved in formal sites of politics, others work in diverse settings weaving together a fragile network of sites and spaces that collectively challenge deeply engrained colonial relationships and division of space. The Wapikoni mobile is an Indigenous video training project that addresses the First Nations communities. Through this project, certain young people are taught to produce and direct films and some are invited to present their creations in public events. The analysis presented in this article investigated the places, practices and relationships around the mobility, speech acts and narratives of the Wapikoni mobile’s participants who travelled to present their film(s) in different settings in Canada and overseas. In these locations, First Nations’ youth challenge the colonial division of space and negotiate new relationships while (re)claiming their identity and engaging in citizenship formation processes. This article argues that these important processes are nevertheless entangled in broader colonial and neoliberal contexts that hinder their full transformative potential.
On Bayesian decision-making and approximation of probability densities

An approximation of a true, unknown, posterior probability density (pd) representing some real state-space system is presented as Bayesian decision-making among a set of possible descriptions (models). The decision problem is carefully defined on its basic elements and it is shown how it leads to the use of the Kullback-Leibler (KL) divergence [11] for evaluating a loss of information between the unknown posterior pd and its approximation. The resulting algorithm is derived on a general level, allowing specific algorithms to be designed according to a selected class of the probability distributions. A concrete example of the algorithm is proposed for the Gaussian case. An experiment is performed assuming that none of the possible descriptions is precisely identical with the unknown system.
Some prevalent results about strongly monoHölder functions

We study the typical behaviour of strongly monoHölder functions from the prevalence point of view. To this end we first prove wavelet-based criteria for strongly monoHölder functions. We then use the notion of prevalence to show that the functions of Cα(Rd) are almost surely strongly monoHölder with Hölder exponent α. Finally, we prove that for any α ∊ (0, 1) on a prevalent set of Cα(Rd) the Hausdorff dimension of the graph is equal to d + 1 − α.
The Role of the Hippocampus in Trace Conditioning: Temporal Discontinuity or Task Difficulty?

It is well established that the hippocampal formation is critically involved in the acquisition of trace memories, a paradigm in which the conditioned (CS) and unconditioned stimuli (US) are separated by a temporal gap (Solomon et al., 1986). The structure is reportedly not critical for the acquisition of delay memories, where the CS and the US overlap in time (Berger & Orr, 1983; Schmaltz & Theios, 1972). Based on these results, it is often stated that the hippocampus is involved in "filling the gap" or otherwise associating the two stimuli in time. However, in addition to the presence of a temporal gap, there are other differences between trace and delay conditioning. The most apparent difference is that animals require many more trials to learn the trace task, and thus it is inherently more difficult than the delay task. Here, we tested whether the hippocampus was critically involved in delay conditioning, if it was rendered more difficult such that the rate of acquisition was shifted to be analogous to trace conditioning. Groups of rats received excitotoxic lesions to the hippocampus, sham lesions or were left intact. Using the same interstimulus intervals (ISI), control animals required more trials to acquire the trace than the delay task. As predicted, animals with hippocampal lesions were impaired during trace conditioning but not delay conditioning. However, when the delay task was rendered more difficult by extending the ISI (a long delay task), animals with hippocampal lesions were impaired. In addition, once the lesioned animal learned the association between the CS and the US during delay conditioning, it could learn and perform the trace CR. Thus, the role of the hippocampus in classical conditioning is not limited to learning about discontiguous events in time and space; rather the structure can become engaged simply as a function of task difficulty.
Designing Case Studies for the Voice Interactive Classroom

In this paper we present a design of case studies for a service-oriented middleware named Voice Interactive Classroom, which allows providing aural access to existing e-learning platforms. This research provides an insight into the process for designing, developing, documenting and evaluating research cases studies based on the middleware. In addition, we summarise the development of three voice-enabled learning services which address the experimental aspects of the design process. This research is intended to provide students and practitioners with indications they can use to plan, implement and evaluate case studies based on the proposed solution.
Proceedings of the 2002 Usenix Annual Technical Conference a Precise and Efficient Evaluation of the Proximity between Web Clients and Their Local Dns Servers

Content Distribution Networks (CDNs) attempt to improve Web performance by delivering Web content to end-users from servers located at the edge of the network. An important factor contributing to the performance improvement is the ability of a CDN to select servers in the proximity of the requesting clients. Most CDNs today use the Domain Name System (DNS) to make such server selection decisions. However, DNS provides only the IP address of the client's local DNS server to the CDN, rather than the client's IP address. Therefore, CDNs using DNS-based server selection assume that clients are " close " to their local DNS servers. To quantify the proximity between clients and their local DNS servers, we propose a novel, precise, and efficient technique for finding the associations of client to local DNS servers. We collected more than 4.2 million such unique associations in three months. From this data, we study the impact of proximity on DNS-based server selection using four different proximity metrics. We conclude that DNS is good for very coarse-grained server selection, since 64% of the associations belong to the same Autonomous System. DNS is less useful for finer-grained server selection, since only 16% of the client and local DNS associations are in the same network-aware cluster [13] (based on BGP routing information from a wide set of routers). As an application of this methodology , we evaluate DNS-based server selection in three of the largest commercially deployed CDNs to study its accuracy.
Decomposition of the Multimodal Multidirectional M2 Internal Tide Field

The M2 internal tide field contains waves of various baroclinic modes and various horizontal propagation directions. This paper presents a technique for decomposing the sea surface height (SSH) field of the multimodal multidirectional internal tide. The technique consists of two steps: first, different baroclinic modes are decomposed by two-dimensional (2D) spatial filtering, utilizing their different horizontal wavelengths; second, multidirectional waves in each mode are decomposed by 2D plane wave analysis. The decomposition technique is demonstrated using the M2 internal tide field simulated by the MITgcm. This paper focuses on a region lying off the U.S. West Coast ranging 20°–50°N, 220°–245°E. The lowest three baroclinic modes are separately resolved from the internal tide field; each mode is further decomposed into five waves of arbitrary propagation directions in the horizontal. The decomposed fields yield unprecedented details on the internal tide’s generation and propagation, which cannot be observed in the harmonically fitted field. The results reveal that the mode-1 M2 internal tide in the study region is dominantly from the Hawaiian Ridge to the west but also generated locally at the Mendocino Ridge and continental slope. The mode-2 and mode-3 M2 internal tides are generated at isolated seamounts, as well as at the Mendocino Ridge and continental slope. The Mendocino Ridge radiates both southbound and northbound M2 internal tides for all three modes. Their propagation distances decrease with increasing mode number: mode-1 waves can travel over 2000 km, while mode-3 waves can only be tracked for 300 km. The decomposition technique may be extended to other tidal constituents and to the global ocean.
Alleviating the Latency and Bandwidth Problems in WWW Browsing

This work addresses three problems that are associated with Web browsing: (a) low bandwidth available to the end user who is connected via slow modems or outdoor wireless networks, (b) long and variable latencies in document access, and (c) temporary disconnections of mobile users. Three techniques are used with a variety of heuristics in order to overcome these problems: (a) profiling user and group access patterns and using these profiles in order to pre-fetch documents, (b) filtering HTTP requests and responses in order to reduce data transmission over bottleneck links, and (c) hoarding documents based on user profiles in order to support limited web browsing even during disconnection. In this paper, we describe the design and implementation of a WWW proxy-based system that incorporates the above techniques. We describe our experiences with the proxy system, and present performance results that show an improvement in the experience of Web browsing using this system.
Enterprise crowdsourcing solutions for software development and ideation

This paper looks into two crowdsourcing applications which attempt to tackle software development and ideation problems in an enterprise environment. The software development crowdsourcing application (Crowdsourcer) is used for internal crowdsourcing of client and internal software development projects across self organizing groups and individuals. Crowdsourcer relies on workflows to identify capable free agents from inside the organization to design, build, test and appraise software projects through a functionality set which rely on crowdsourcing patterns such as virtual marketplaces, intelligent auctions and bidding processes, collaborative project management and reputation systems with virtual currencies and reward systems. The ideation crowdsourcing application features crowdsourced idea creation along with workflows to form actualization groups, which help in bringing an idea to fruition from concept stage. With advanced filter mechanisms, a reputation system and a system of peer based participatory marketplace for evaluation of ideas, this application features sophisticated crowdsourcing patterns to identify and execute ideas through harnessing the wisdom of the crowds.
Optical Image Encryption and Decryption Considering Wireless Communication Channels

Abstract —In this paper, we discuss optical encryption and decryption considering wireless communication channels. In wireless communication systems, the wireless channel causes noise and fading effects of the transmitted information. Optical encryption technique such as double-random-phase encryption (DRPE) is used for encrypting transmitted data. When the encrypted data is transmitted, the information may be lost or distorted because there are a lot of factors such as channel noise, propagation fading, etc. Thus, using digital modulation and maximum likelihood (ML) detection, the noise and fading effects are mitigated, and the encrypted data is estimated well at the receiver. To the best of our knowledge, this is the first report that considers the wireless channel characteristics of the optical encryption technique. Keywords —Optical Encryption and Decryption, Wireless Communication Channels 1. I NTRODUCTION In information communication technologies, encryption has been researched widely [1-17]. Optical encryption techniques [5-16] have higher encryption speed than non-optical encryption methods. Optical encryption with digital holography [18] generates two holograms for the encrypted data and the key information; thus enabling secure storage and data transmission. Another optical encryption method, which is polarization encryption of holography [19], can encrypt original holographic data as two-dimensional polarization distribution. Both optical encryption techniques mentioned above need an optical holographic recording system. Thus, they require a complicated system structure. On the other hand, double-random-phase encryption (DRPE), which is one of the most widely used, has a simple system structure [5]. Note, however, that it has a weak point when the decryption keys are used many times without being updated. To address this problem, DRPE with photon-counting imaging techniques has been reported [13]. It considers a photon-limited version of the encrypted distribution such as Poisson distribution [20-22] in a perfect channel environment. In wireless communication systems, the wireless channel induces noise and fading effects of the transmitted information. Thus, in this paper, we analyze the wireless communication systems for optical encryption data. When the encrypted data is transmitted via a wireless channel, the transmitted data is distorted by a lot of factors such as channel noise, propagation fading, etc. [23-25]. Obtaining the correct encrypted data at the receiver requires digitally modulating the encrypted information at the transmitter and correctly detecting the modulated signals at the receiver [23-25]. In addition, non-linear correlation filters may be used to recognize the primary information [26]. To the best of our knowledge, this is the first report that considers the wireless
A parametric multi-convex splitting technique with application to real-time NMPC

A novel splitting scheme to solve parametric multi-convex programs is presented. It consists of a fixed number of proximal alternating minimisations and a dual update per time step, which makes it attractive in a real-time Nonlinear Model Predictive Control (NMPC) framework and for distributed computing environments. Assuming that the parametric program is semi-algebraic and that its critical points are strongly regular, a contraction estimate is derived and it is proven that the sub-optimality error remains stable under some mild assumptions. Efficacy of the method is demonstrated by solving a bilinear NMPC problem to control a DC motor. In particular, the effect of the sampling period on the optimality tracking error is analysed for a fixed computational power.
Offspring Decoded strings Reproduction Parents New generation Manipulation POPULATION EVALUATION SELECTION GENETIC

The concept of emergence takes an important role in the study of Artiicial Life, but there is not so much work to exploit this concept in the design of neural networks. Moreover, many evolutionary neural networks have paid little attention to the fact that they can evolve from modules. This paper investigates the emergence of structure and functionality of modular neural networks through evolution. The model presented at this paper might not only develop new functionality spontaneously but also grow and evolve its own structure autonomously. We show the potential of the model by applying to a visual categoriza-tion task with handwritten digits. Sophisticated network architectures as well as functional subsystems emerge from an initial set of randomly-connected networks. Moreover, the evolved neu-ral network has reproduced some of the characteristics of natural visual system, such as the organization of coarse and ne processing of stimuli in separate pathways.
Study Navigator: An Algorithmically Generated Aid for Learning from Electronic Textbooks.

We present study navigator, an algorithmically-generated aid for enhancing the experience of studying from electronic textbooks. The study navigator for a section of the book consists of helpful concept references for understanding this section. Each concept reference is a pair consisting of a concept phrase explained elsewhere and the link to the section in which it has been explained. We propose a novel reader model for textbooks and an algorithm for generating the study navigator based on this model. We also present an extension of the study navigator specialized to accommodate information processing preference of the student. Specifically, this specialization allows a student to control the balance between references to sections that help refresh material already studied vs. sections that provide more advanced information. We also present two user studies that demonstrate the e? cacy of the proposed system across textbooks on di? erent subjects from di? erent grades.