Miracle-dz/UniFAR-FTUs huggingface dataset:
Regulation of Pseudomonas Quinolone Signal Synthesis in Pseudomonas aeruginosa

ABSTRACT Pseudomonas aeruginosa is an opportunistic pathogen that causes chronic lung infections in cystic fibrosis patients and is a major source of nosocomial infections. This bacterium controls many virulence factors by using two quorum-sensing systems, las and rhl. The las system is composed of the LasR regulator protein and its cell-to-cell signal, N-(3-oxododecanoyl) homoserine lactone, and the rhl system is composed of RhlR and the signal N-butyryl homoserine lactone. A third intercellular signal, the Pseudomonas quinolone signal (PQS; 2-heptyl-3-hydroxy-4-quinolone), also regulates numerous virulence factors. PQS synthesis requires the expression of multiple operons, one of which is pqsABCDE. Previous experiments showed that the transcription of this operon, and therefore PQS production, is negatively regulated by the rhl quorum-sensing system and positively regulated by the las quorum-sensing system and PqsR (also known as MvfR), a LysR-type transcriptional regulator protein. With the use of DNA mobility shift assays and β-galactosidase reporter fusions, we have studied the regulation of pqsR and its relationship to pqsA, lasR, and rhlR. We show that PqsR binds the promoter of pqsA and that this binding increases dramatically in the presence of PQS, implying that PQS acts as a coinducer for PqsR. We have also mapped the transcriptional start site for pqsR and found that the transcription of pqsR is positively regulated by lasR and negatively regulated by rhlR. These results suggest that a regulatory chain occurs where pqsR is under the control of LasR and RhlR and where PqsR in turn controls pqsABCDE, which is required for the production of PQS.
An XML-Based Bootstrapping Method for Pattern Acquisition

Extensible Markup Language (XML) has been widely used as a middleware because of its flexibility. Fixed domain is one of the bottlenecks of Information Extraction (IE) technologies. In this paper we present a XML-based domain-adaptable bootstrapping method of pattern acquisition, which focuses on minimizing the cost of domain migration. The approach starts from a seed corpus with some seed patterns; extends the corpus based on the seed corpus through the Internet and acquires the new patterns from extended corpus. Positive and negative examples classified from training corpus are used to evaluate the patterns acquired. The result shows our method is a practical way in pattern acquisitions.
Towards table tennis with a quadrotor autonomous learning robot and onboard vision

Robot table tennis is a challenging domain in both robotics, artificial intelligence and machine learning. In terms of robotics, it requires fast and reliable perception and control; in terms of artificial intelligence, it requires fast decision making to determine the best motion to hit the ball; in terms of machine learning, it requires the ability to accurately estimate where and when the ball will be so that it can be hit. The use of sophisticated perception (relying, for example, in multi-camera vision systems) and state-of-the-art robot manipulators significantly alleviates concerns with perception and control, leaving room for the exploration of novel approaches that focus on estimating where, when and how to hit the ball. In this paper, we move away from the hardware setup commonly used in this domain-typically relying on robotic manipulators combined with an array of multiple fixed cameras-and give the first steps towards having autonomous aerial table tennis robotic players. Specifically, we focus on the task of hitting a ping pong ball thrown at a commercial drone, equipped with a light cardboard racket and an onboard camera. We adopt a general framework for learning complex robot tasks and show that, in spite of the perceptual and actuation limitations of our system, the overall approach enables the quadrotor system to successfully respond to balls served by a human user.
The literacy fieldtrip: using UbiComp to support children's creative writing

Fieldtrips, traditionally associated with science, history and geography teaching, have long been used to support children's learning by allowing them to engage with environments first-hand. Recently, ubiquitous computing (UbiComp) has been used to enhance fieldtrips in these educational areas by augmenting environments with a range of instruments, devices and sensors. However, the sorts of interaction design that UbiComp makes possible have the potential not just to enhance the value of educational techniques in known application areas, but also to expand the application of those techniques into new areas of curriculum. We report on a UbiComp-supported fieldtrip to support creative writing, associated with the learning of literacy skills. We discuss how the fieldtrip, designed and run in the grounds of a historic English country house with Year 5 UK schoolchildren, engendered interactions which changed both the processes and products of creative writing, with benefits for both teachers and children.
A modified genetic algorithm for a special case of the generalized assignment problem

: Many central examinations are performed nationwide in Turkey. These examinations are held simultaneously throughout Turkey. Examinees attempt to arrive at the examination centers at the same time and they encounter problems such as traﬃc congestion, especially in metropolises. The state of mind that this situation puts them into negatively aﬀects the achievement and future goals of the test takers. Our solution to minimize the negative eﬀects of this issue is to assign the test takers to closest examination centers taking into account the capacities of examination halls nearby. This solution is a special case of the generalized assignment problem (GAP). Since the scale of the problem is quite large, we have focused on heuristic methods. In this study, a modi(cid:12)ed genetic algorithm (GA) is used for the solution of the problem since the classical GA often generates infeasible solutions when it is applied to GAPs. A new method, named nucleotide exchange, is designed in place of the crossover method. The designed method is run between the genes of a single parent chromosome. In addition to the randomness, the consciousness factor is taken into consideration in the mutation process. With this new GA method, results are obtained successfully and quickly in large-sized data sets.
Survey of Approaches for Security Verification of Hardware/Software Systems

Variety of computing systems have been proposed to provide protection for sensitive code or data through hardware or software mechanisms. This paper surveys the landscape of security verification approaches and techniques for hardware/software systems at different levels: from a software-application level all the way to the physical hardware level. Different existing projects are compared, based on the tools used and security aspects being examined. Since many systems require both hardware and software components to work together to provide the system’s promised security protections, it is no longer sufficient to verify the software levels or the hardware levels in a mutually exclusive fashion. This survey highlights common sets of system levels that are verified by the different existing projects and presents to the readers the state of the art in hardware security verification. Few approaches come close to providing full-system verification, and there is still much room for improvement. In this survey, readers will gain insights into existing approaches in formal modeling and security verification of hardware/software systems, and gain insights for future research directions.
Techniques to Improve Preoperative Planning Precision for Oral Implantology

Most software systems for oral implantology are based on a multiview approach and often accompanied with a 3-D rendered model. A more integrated and realistic 3-D approach for implant surgery-also guaranteeing correctness in measures-is desirable to gain a deep and sure knowledge of the patient's anatomy before inserting the implants, thus reducing the risk of damaging surrounding structures. We present a 3-D software system where computer graphic techniques have been used to create a smooth and user-friendly 3-D environment to work upon for oral implant planning and simulation. Interpolation of the axial slices is used to produce a continuous radiographic volume and get an isotropic voxel to achieve a correct work context. Freedom of choosing, arbitrarily, during the planning phase, the best cross-sectional plane for achieving correct measurements is obtained through interpolation and texture generation. Correct orientation of the planned implants is also easily computed by exploiting a radiological mask with radio-opaque markers, which is worn by the patient during the computed tomography (CT) scan. Measurement precision was validated considering different scans of a dried human partially edentulous mandible, which was scanned several times, with different angular orientations. The achieved precision (from 0.14% to 0.84% of the absolute value of error) outperforms that using usual DentaScan multiview approaches, and it is even better than the precision previously obtained by the DentalVox tool.
Query optimization in distributed networks of autonomous database systems

Large-scale distributed environments, where each node is completely autonomous and offers services to its peers through external communication, pose significant challenges to query processing and optimization. Autonomy is the main source of the problem, as it results in lack of knowledge about any particular node with respect to the information it can produce and its characteristics, for example, cost of production or quality of produced results. In this article, inspired by e-commerce technology, we recognize queries as commodities and model query optimization as a trading negotiation process. Subquery answers and subquery operator execution jobs are traded between nodes until deals are struck with some nodes for all of them. Such trading may also occur recursively, in the sense that some nodes may play the role of intermediaries between other nodes (subcontracting). We identify the key parameters of the overall framework and suggest several potential alternatives for each one. In comparison to trading negotiations for e-commerce, query optimization faces unique new challenges that stem primarily from the fact that queries have a complex structure and can be broken into smaller parts. We address these challenges through a particular instantiation of our framework focusing primarily on the optimization algorithms run on “buying” and “selling” nodes, the evaluation metrics of the queries, and the negotiation strategy. Finally, we present the results of several experiments that demonstrate the performance characteristics of our approach compared to those of traditional query optimization.
Always Acyclic Distributed Path Computation

Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We present a new algorithm, Distributed Path Computation with Intermediate Variables (DIV), which can be combined with any distributed routing algorithm to guarantee that the directed graph induced by the routing decisions remains acyclic at all times. The key contribution of DIV, besides its ability to operate with any routing algorithm, is an update mechanism using simple message exchanges between neighboring nodes that guarantees loop-freedom at all times. DIV provably outperforms existing loop-prevention algorithms in several key metrics such as frequency of synchronous updates and the ability to maintain paths during transitions. Simulation results quantifying these gains in the context of shortest path routing are presented. In addition, DIV's universal applicability is illustrated by studying its use with a routing that operates according to a nonshortest path objective. Specifically, the routing seeks robustness against failures by maximizing the number of next-hops available at each node for each destination.
An execution-driven simulation tool for teaching cache memories in introductory computer organization courses

Cache memories are the most ubiquitous mechanisms devoted to hide memory latencies in current microprocessors. Due to this importance, they are a core topic in computer architecture curricula, both in graduate and undergraduate courses. As a consequence, traditional literature and current educational proposals devote important efforts to this topic. In this context, exercises dealing with simple algorithms, also known as code-based exercises, have a good acceptance among instructors because they permit students to realize how the accesses generated by the programs affect the cache's state. From about one decade ago, simulators have been extensively employed as a valuable pedagogical tool as they enable students to visualize how computer units work and interact each other. Unfortunately, there is no simple simulator allowing to perform code-based exercises for cache memories. Hence, students perform these exercises by means of the classic "paper and pencil" methodology. In this paper we introduce Spim-cache, a simple execution-driven cache simulator to carry out such experiments, intended to use in undergraduate courses. The tool allows, in an intuitive and easy way, to select a given cache organization and run step-by-step the code proposed while visualizing dynamic changes in the cache's state.
A Frequency-Domain Silence Noise Model

This paper proposes a simple, computationally efficient 2-mixture model approach to discrimination between speech and background noise. It is directly derived from observations on real data, and can be used in a fully unsupervised manner, with the EM algorithm. A first application to sector-based, joint audio source localization and detection, using multiple microphones, confirms that the model can provide major enhancement. A second application to the single channel speech recognition task in a noisy environment yields major improvement on stationary noise and promising results on non-stationary noise.
The effect of heating the hypothalamus on respiration in the ox (Bos taurus)

When the ox is exposed to heat, respiratory frequency increases before there is any increase in the temperature of the blood at the bicarotid junction (Bligh, 1957b) or of the brain (Findlay & Ingram, 1961). Furthermore, in cool conditions when the temperatures of the extremities are low, localized infra-red irradiation of part of the trunk may be accompanied by large increases in the temperature of the unheated extremities without any change in the deep body temperature (Whittow, 1962; Ingram & Whittow, 1962). These findings lead to the conclusion that, in the ox, at least part of the stimulus for the initiation of heat loss mechanisms originates at the periphery. Nevertheless it is known that the brain contains centres concerned with the maintenance of homoeothermy, and which are sensitive to changes in temperature (Ranson, 1940; Andersson, Grant & Larsson, 1956; Andersson & Persson, 1957). Previous observations on the ox revealed that localized heating of the region between the optic chiasma and the anterior commissure was accompanied by an increase in respiratory frequency and in the skin temperatures of the ears (Findlay & Ingram, 1961) and also in the rate of moisture loss from the skin (Ingram, McLean & Whittow, 1961). It seems probable, therefore, that the heat-loss mechanisms of the ox are controlled by the integration of stimuli originating from both central and peripheral receptors, but nothing is known about the relative importance of these stimuli. The present study was undertaken to provide information about changes in respiratory frequency, tidal volume and minute volume, and the temperatures of the extremities, when the temperature of the hypothalamus was increased by different amounts at various temperatures of body and environment.
Cost Minimization for Big Data Processing in Geo-Distributed Data Centres

Demand on big data is being increasing day by day and also increasing heavy burden on computation, storage and communication in data centres, which lead to considerable expenditure to data centre providers. So, cost minimization became an issue for the upcoming big data. One of the main feature of big data is coupling of data and computation as computation task. This can be done only when that corresponding is available for computation. Three tasks like data placement, task assignment and data movement influence the expense of data centres. In this paper we study how to minimize cost through joint optimization of these above three factors for big data service in geo distributes data centres. Here we propose 2-D Markov chain to describe time to complete a particular task with consideration of data transmission and computation to derive average task completion time in closed time. In addition, we here model the problem as mixed integer nonlinear programming and propose a solution to linearize it.
Modeling of Reliable Messaging in Service Oriented Architectures 3

Due to the increasing need of highly dependable services in Service-Oriented Architectures (SOA), service-level agreements include more and more frequently such traditional aspects as security, safety, availability, reliability, e tc. Whenever a service can no longer be provided with the required QoS, the service requester need t o switch dynamically to a new service having adequate service parameters. In the current paper, we propose a metamodel to capture such parameters required for reliable messaging in services in a semi-formal way (as an extension to [1]). Furthermore, we incorporate fa ult-tolerant algorithms into appropriate reconfiguration mechanisms for modeling relia ble message delivery by graph transformation rules.
Pertuzumab: A New Targeted Therapy for HER2‐Positive Metastatic Breast Cancer

Trastuzumab, a humanized monoclonal antibody, has become an important targeted therapy for patients with all stages of human epidermal growth factor receptor‐2 (HER2)‐positive breast cancer. However, primary and acquired resistance to trastuzumab remains a significant problem. Pertuzumab, a humanized monoclonal antibody that binds to a domain of the HER2 receptor separate from trastuzumab, may have the potential to overcome trastuzumab resistance. Clinical trials have shown that pertuzumab can be effectively combined with other biologic therapy or chemotherapy in patients with metastatic HER2‐positive breast cancer. Pertuzumab is relatively well tolerated with minimal increases in hematologic and cardiac toxicity observed when added to trastuzumab and/or docetaxel. In addition to becoming the standard of care in combination with docetaxel and trastuzumab in patients with newly diagnosed HER2‐positive metastatic breast cancer, clinical trials continue to evaluate pertuzumab in combination with other targeted therapy, chemotherapy, and in patients with early stage breast cancer. These trials will help to further determine the role of pertuzumab in the treatment of HER2‐positive breast cancer.
Joint Power Splitting and Secure Beamforming Design in the Wireless-Powered Untrusted Relay Networks

In this work, we maximize the secrecy rate of the wireless-powered untrusted amplify-and-forward relay networks by jointly designing power splitting (PS) ratio and relay beamforming with the proposed global optimal algorithm (GOA) and local optimal algorithm (LOA). To guarantee secure communication, the destination-based artificial noise is sent to degrade the reception of the untrusted relay, and it also becomes a new source of energy powering relay to forward the information with power splitting (PS) technique. Simulation result shows that LOA can achieve satisfactory secrecy rate performance compared with that of GOA, but with less computation time. It also manifests that both proposed algorithms outperform the benchmark method.
Evaluating Value Weighting: Corporate Events and Market Timing

Corporate events, such as new issues and new lists, appear in waves. These waves imply that the market portfolio has a time-varying weight in new lists, and one can decompose the market return into a fixed weight return plus a timing return. Most of the reduction in aggregate market returns caused by holding new lists comes from timing, not from average underperformance. When new lists are a high fraction of the market, subsequent returns for both new and old lists are low. A mean variance optimizing investor holding the market would be better off replacing holdings of new lists with old lists, t-bills, or even currency stuffed in a mattress.
Vlogcast yourself: nonverbal behavior and attention in social media

We introduce vlogs as a type of rich human interaction which is multimodal in nature and suitable for new large-scale behavioral data analysis. The automatic analysis of vlogs is useful not only to study social media, but also remote communication scenarios, and requires the integration of methods for multimodal processing and for social media understanding. Based on works from social psychology and computing, we first propose robust audio, visual, and multimodal cues to measure the nonverbal behavior of vloggers in their videos. Then, we investigate the relation between behavior and the attention videos receive in YouTube. Our study shows significant correlations between some nonverbal behavioral cues and the average number of views per video.
Energy-Efficient and Low-Complexity Schemes for Uplink Cognitive Cellular Networks

This Letter proposes two types of energy-efficient and low-complexity schemes for uplink cognitive cellular networks. In the considered system, both cognitive users (CUs) and primary user (PU) share the same base station (BS). Under an outage probability protection criterion for the PU, we firstly propose a round-robin CU scheduling scheme and analytically show its achieved signal-to-interference ratio statistics at the BS, from which it is observed that the round-robin scheduling is much more energy-efficient than opportunistic scheduling to achieve the same mean capacity and bit error rate. Inspired by this interesting observation, a statistics-based CU scheduling scheme is also presented, whose energy-efficiency is further improved.