Miracle-dz/UniFAR-FTUs huggingface dataset:
Shibata Without Stimulus Presentation Perceptual Learning Incepted by Decoded fMRI Neurofeedback

, 1413 (2011); 334 Science et al. Kazuhisa Shibata Without Stimulus Presentation Perceptual Learning Incepted by Decoded fMRI Neurofeedback This copy is for your personal, non-commercial use only. clicking here. colleagues, clients, or customers by , you can order high-quality copies for your If you wish to distribute this article to others here. following the guidelines can be obtained by Permission to republish or repurpose articles or portions of articles ): March 31, 2014 www.sciencemag. org (this information is current as of The following resources related to this article are available online at http://www.sciencemag. org/content/334/6061/1413.full. html version of this article at: including high-resolution figures, can be found in the online Updated information and services, http://www.sciencemag. org/content/suppl/2011/12/08/334.6061. 1413.DC1. html can be found at: Supporting Online Material http://www.sciencemag. org/content/334/6061/1413.full. html#related found at: can be related to this article A list of selected additional articles on the Science Web sites http://www.sciencemag. org/content/334/6061/1413.full. html#ref-list-1 , 11 of which can be accessed free: cites 31 articles This article http://www.sciencemag. org/content/334/6061/1413.full. html#related-urls 9 articles hosted by HighWire Press; see: cited by This article has been http://www.sciencemag. org/cgi/collection/neuroscience Neuroscience subject collections: This article appears in the following
Building a German/Simple German Parallel Corpus for Automatic Text Simplification

In this paper we report our experiments in creating a parallel corpus using German/Simple German documents from the web. We require parallel data to build a statistical machine translation (SMT) system that translates from German into Simple German. Parallel data for SMT systems needs to be aligned at the sentence level. We applied an existing monolingual sentence alignment algorithm. We show the limits of the algorithm with respect to the language and domain of our data and suggest ways of circumventing them.
A thermal Object Tracking benchmark

Short-term single-object (STSO) tracking in thermal images is a challenging problem relevant in a growing number of applications. In order to evaluate STSO tracking algorithms on visual imagery, there are de facto standard benchmarks. However, we argue that tracking in thermal imagery is different than in visual imagery, and that a separate benchmark is needed. The available thermal infrared datasets are few and the existing ones are not challenging for modern tracking algorithms. Therefore, we hereby propose a thermal infrared benchmark according to the Visual Visual Object Tracking (VOT) protocol for evaluation of STSO tracking methods. The benchmark includes the new LTIR dataset containing 20 thermal image sequences which have been collected from multiple sources and annotated in the format used in the VOT Challenge. In addition, we show that the ranking of different tracking principles differ between the visual and thermal benchmarks, confirming the need for the new benchmark.
A Newton-Like Algorithm for Likelihood Maximization: The Robust-Variance Scoring Algorithm

This article studies a Newton-like method already used by several authors but which has not been thouroughly studied yet. We call it the robust-variance scoring (RVS) algorithm because the main version of the algorithm that we consider replaces minus the Hessian of the loglikelihood used in the Newton-Raphson algorithm by a matrix $G$ which is an estimate of the variance of the score under the true probability, which uses only the individual scores. Thus an iteration of this algorithm requires much less computations than an iteration of the Newton-Raphson algorithm. Moreover this estimate of the variance of the score estimates the information matrix at maximum. We have also studied a convergence criterion which has the nice interpretation of estimating the ratio of the approximation error over the statistical error; thus it can be used for stopping the iterative process whatever the problem. A simulation study confirms that the RVS algorithm is faster than the Marquardt algorithm (a robust version of the Newton-Raphson algorithm); this happens because the number of iterations needed by the RVS algorithm is barely larger than that needed by the Marquardt algorithm while the computation time for each iteration is much shorter. Also the coverage rates using the matrix $G$ are satisfactory.
Minimum Disclosure Routing for network virtualization

Although virtual collocation of Service Providers (SPs) on top of Infrastructure Providers (InPs) via network virtualization brings various benefits, we posit that operational confidentiality has not been considered in this network model. We extend and apply the Secure Multiparty Computation (SMC) protocol to solving Minimum Disclosure Routing (MDR), that is, enabling an SP to route packets without disclosing routing information to InPs. Our study reveals that MDR can be achieved securely with marginal latency overhead with regard to the convergence time in well-engineered routing algorithms. Our study sheds light on the path for network virtualization to be used to resolve the challenges for ISPs of today.
An Industrial Application of Model Checking to a Vessel Control System

Model checking allows an abstracted finite state model of a system to be developed and a set of mathematically defined correctness properties, based on the design specifications, to be defined. The model checker performs an exhaustive state space search of the model, checking the correctness properties hold at each step. This paper describes how model checking has been applied to find and correct problems in the software design of a distributed vessel control system currently under development at a control systems specialist in New Zealand.
The total path length of split trees

We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409‐ 432, 1998]. The model encompasses many important randomized algorithms and data structures. The pieces of data (items) are stored in a randomized fashion in the nodes of a tree. The total path length (sum of depths of the items) is a natural measure of the efficiency of the algorithm/data structure. Using renewal theory, we prove convergence in distribution of the total path length towards a distribution characterized uniquely by a fixed point equation. Our result covers, using a unified approach, many data structures such as binary search trees, m-ary search trees, quad trees, median-of-(2k + 1) trees, and simplex trees.
Segmentation Based Features for Wide-Baseline Multi-view Reconstruction

A common problem in wide-baseline stereo is the sparse and non-uniform distribution of correspondences when using conventional detectors such as SIFT, SURF, FAST and MSER. In this paper we introduce a novel segmentation based feature detector SFD that produces an increased number of 'good' features for accurate wide-baseline reconstruction. Each image is segmented into regions by over-segmentation and feature points are detected at the intersection of the boundaries for three or more regions. Segmentation-based feature detection locates features at local maxima giving a relatively large number of feature points which are consistently detected across wide-baseline views and accurately localised. A comprehensive comparative performance evaluation with previous feature detection approaches demonstrates that: SFD produces a large number of features with increased scene coverage, detected features are consistent across wide-baseline views for images of a variety of indoor and outdoor scenes, and the number of wide-baseline matches is increased by an order of magnitude compared to alternative detector-descriptor combinations. Sparse scene reconstruction from multiple wide-baseline stereo views using the SFD feature detector demonstrates at least a factor six increase in the number of reconstructed points with reduced error distribution compared to SIFT when evaluated against ground-truth and similar computational cost to SURF/FAST.
Assembling the components of the quorum sensing pathway in African trypanosomes

African trypanosomes, parasites that cause human sleeping sickness, undergo a density‐dependent differentiation in the bloodstream of their mammalian hosts. This process is driven by a released parasite‐derived factor that causes parasites to accumulate in G1 and become quiescent. This is accompanied by morphological transformation to ‘stumpy’ forms that are adapted to survival and further development when taken up in the blood meal of tsetse flies, the vector for trypanosomiasis. Although the soluble signal driving differentiation to stumpy forms is unidentified, a recent genome‐wide RNAi screen identified many of the intracellular signalling and effector molecules required for the response to this signal. These resemble components of nutritional starvation and quiescence pathways in other eukaryotes, suggesting that parasite development shares similarities with the adaptive quiescence of organisms such as yeasts and Dictyostelium in response to nutritional starvation and stress. Here, the trypanosome signalling pathway is discussed in the context of these conserved pathways and the possible contributions of opposing ‘slender retainer’ and ‘stumpy inducer’ arms described. As evolutionarily highly divergent eukaryotes, the organisation and conservation of this developmental pathway can provide insight into the developmental cycle of other protozoan parasites, as well as the adaptive and programmed developmental responses of all eukaryotic cells.
Data center power reduction by heuristic variation-aware server placement and chassis consolidation

The growth in number of data centers and its power consumption costs in recent years, along with ever increasing process variation in nanometer technologies emphasizes the need to incorporate variation-aware power reduction strategies in early design stages. Moreover, since the power characteristics of identically manufactured servers vary in the presence of process variation, their position in the data center should be optimally determined. In this paper, we introduce two heuristic variation-aware server placement algorithm based on power characteristic of servers and heat recirculation model of data center. In the next step, we utilize an Integer Linear Programming (ILP) based variation-aware chassis consolidation technique to assign tasks to servers such that total power consumption of data center is minimized under obtained server placement. Evaluating the proposed server placement heuristics reveals that up to 14.85% power savings can be achieved under different utilization rates compared to conventional random server placement method.
A new hybrid tolerant controller design and its application to the flight control

A new hybrid tolerant controller design method for linear system with input disturbance and system uncertainty is presented. Based on the proper controller fault mode definition, the passive tolerant state feedback controller design method is derived for systems which contain non-parameter uncertainties. Theoretical analysis and simulation verify the conservation of the method above, and then a new hybrid tolerant control method is given for this problem, the proposed approach is evaluated by an aircraft example, and the conclusion is validated by the simulation.
Performance of 2/spl times/2 MIMO spatial multiplexing in indoor environments

Based on the indoor measurement campaign, the performance of MIMO spatial multiplexing in the LOS environments has been compared with that in the NLOS ones. It has been shown that the average BER performance in the LOS environments is better than that in the NLOS ones despite higher fading correlations. The BER is obtained by computer simulations using MIMO channel measurements. We compare the performance with the one in NLOS environments. Furthermore, we investigate the BER performance of an eigenbeam-space division multiplexing (E-SDM) system where the channel state information is known also at the TX end.
Monitoring Actives Volcanoes by Using of Envisat and Ers Data: First Results of the Eurorisk-Preview Project

In the framework of the Eurorisk-Preview project, funded by the European Union, a task is dedicated to the assessment, prevention and management of volcanic risk. We are developing a multidisciplinary approach, integrating the geophysical prospecting at local scale and large scale remote sensing data. To achieve this task, two volcanic test sites have been identified: Mt. Etna, in Sicily (Italy), and Tenerife, in Canary Islands (Spain). We investigate the surface deformation and the volcanic emission in the atmosphere by using SAR series and multispectral data, requested in the ESA Category 1 (n. 3560). For Mt. Etna data from historical to recent eruptions (1992 - 2006) has been analysed while for Tenerife archived SAR data from 1992 to 2005 has been analysed, individuating anomaly ground deformations in Pico de Teide and surrounding areas as suggested by GPS campaigns.
Oxygen-dependent expression of cytochrome c oxidase subunit 4-2 gene expression is mediated by transcription factors RBPJ, CXXC5 and CHCHD2

Cytochrome c oxidase (COX) is the terminal enzyme of the electron transport chain, made up of 13 subunits encoded by both mitochondrial and nuclear DNA. Subunit 4 (COX4), a key regulatory subunit, exists as two isoforms, the ubiquitous isoform 1 and the tissue-specific (predominantly lung) isoform 2 (COX4I2). COX4I2 renders lung COX about 2-fold more active compared with liver COX, which lacks COX4I2. We previously identified a highly conserved 13-bp sequence in the proximal promoter of COX4I2 that functions as an oxygen responsive element (ORE), maximally active at a 4% oxygen concentration. Here, we have identified three transcription factors that bind this conserved ORE, namely recombination signal sequence–binding protein Jκ (RBPJ), coiled-coil-helix-coiled-coil-helix domain 2 (CHCHD2) and CXXC finger protein 5 (CXXC5). We demonstrate that RBPJ and CHCHD2 function towards activating the ORE at 4% oxygen, whereas CXXC5 functions as an inhibitor. To validate results derived from cultured cells, we show using RNA interference a similar effect of these transcription factors in the gene regulation of COX4I2 in primary pulmonary arterial smooth muscle cells. Depending on the oxygen tension, a concerted action of the three transcription factors regulates the expression of COX4I2 that, as we discuss, could augment both COX activity and its ability to cope with altered cellular energy requirements.
Rough Sets-Based Prototype Optimization in Kanerva-Based Function Approximation

Problems involving multi-agent systems can be complex and involve huge state-action spaces, making such problems difficult to solve. Function approximation schemes such as Kanerva coding with dynamic, frequency-based prototype selection can improve performance. However, selecting the number of prototypes is difficult and the approach often still gives poor performance. In this paper, we solve a collection of hard instances of the predator-prey pursuit problem and argue that poor performance is caused by inappropriate selection of the prototypes for Kanerva coding, including the number and allocation of these prototypes. We use rough sets theory to reformulate the selection of prototypes and their implementation in Kanerva coding. We introduce the equivalence class structure to explain how prototype collisions occur, use a reduct of the set of prototypes to eliminate unnecessary prototypes, and generate new prototypes to split the equivalence classes causing prototype collisions. The Rough Sets-based approach increases the fraction of predator-prey test instances solved by up to 24.5% over frequency-based Kanerva coding. We conclude that prototype optimization based on rough set theory can adaptively explore the optimal number of prototypes and greatly improve a Kanerva-based reinforcement learner's ability to solve large-scale multi-agent problems.
Hodgkin's Lymphoma Diagnosed from Peritoneal Effluent

In infective cases of peritoneal dialysis (PD) peritonitis, examination of the effluent fluid usually shows a predominance of neutrophils, and a bacterial organism is frequently isolated by culture. Where no organisms are identified, cases are often referred to as culture-negative ‘peritonitis,’ but non-infective causes for cloudy effluent are rare. We report the unusual finding of cloudy effluent as a presenting sign of recurrent lymphoma, diagnosed by cytological examination of the peritoneal effluent.
An empirical study of bug report field reassignment

A bug report contains many fields, such as product, component, severity, priority, fixer, operating system (OS), platform, etc., which provide important information for the bug triaging and fixing process. It is important to make sure that bug information is correct since previous studies showed that the wrong assignment of bug report fields could increase the bug fixing time, and even delay the delivery of the software. In this paper, we perform an empirical study on bug report field reassignments in open-source software projects. To better understand why bug report fields are reassigned, we manually collect 99 recent bug reports that had their fields reassigned and emailed their reporters and developers asking why these fields got reassigned. Then, we perform a large-scale empirical study on 8 types of bug report field reassignments in 4 open-source software projects containing a total of 190,558 bug reports. In particular, we investigate 1) the number of bug reports whose fields get reassigned, 2) the difference in bug fixing time between bug reports whose fields get reassigned and those whose fields are not reassigned, 3) the duration a field in a bug report gets reassigned, 4) the number of fields in a bug report that get reassigned, 5) the number of times a field in a bug report gets reassigned, and 6) whether the experience of bug reporters affect the reassignment of bug report fields. We find that a large number (approximately 80%) of bug reports have their fields reassigned, and the bug reports whose fields get reassigned require more time to be fixed than those without field reassignments.
Chapter 4: Money Supply and Control in the UK

'Virtually every monetary economist believes that the CB can control the monetary base and…the broader monetary aggregates as well. Almost all of those who have worked in a CB believe that this view is totally mistaken… What you will learn in this chapter § Why central banks are in a position to exert considerable influence over short-term interest rates; § Why they have chosen to target short-term interest rates rather than the money stock; § Why this choice effectively makes the money stock endogenous; § How the endogeneity of money affects our understanding of a range of issues in monetary economics. 4.1 Introduction In Chapter 9 we look at the evolution of UK monetary policy over the last 50 years or so. What that survey shows is (i) that monetary policy has passed through a number of distinct phases, including an initial phase when its influence upon the rest of the economy was regarded as slight; (ii) that the immediate target of policy instruments has always been the flow of credit and never (not even between 1980 and 1985) the stock of money; and (iii) that once the Bank of England moved away from direct controls on credit creation (during the 1970s) its chosen monetary policy instrument was the short-term interest rate at which it was prepared to provide liquidity to the banking system. In the terms of the discussion in our last chapter, therefore, the Bank's main focus of attention has always been on the credit counterparts of the money stock and for most of the time its policy instrument has been the rate of interest and not the monetary base. Thus, as we said in the closing paragraphs of the last chapter, it is hardly surprising that most analysis of the money and credit supply in the UK has been done using the FoF approach. In this chapter we look firstly at how a central bank is in a position to impose changes in short-term interest rates upon the rest of the financial system (and at what constraints there might be). Our illustrations draw upon the behaviour of the Bank of England but, as Borio (1997)
Reputation analysis with a ranked sentiment-lexicon

Reputation analysis is naturally linked to a sentiment analysis task of the targeted entities. This analysis leverages on a sentiment lexicon that includes general sentiment words and domain specific jargon. However, in most cases target entities are themselves part of the sentiment lexicon, creating a loop from which it is difficult to infer an entity reputation. Sometimes, the entity became a reference in the domain and is vastly cited as an example of a highly reputable entity. For example, in the movies domain it is not uncommon to see reviews citing Batman or Anthony Hopkins as esteemed references. In this paper we describe an unsupervised method for performing a simultaneous-analysis of the reputation of multiple named-entities. Our method jointly extracts named entities reputation and a domain specific sentiment lexicon. The objective is two-fold: (1) named-entities are naturally ranked by our method and (2) we can build a reputation graph of the domain's named entities. This framework has immediate applications in terms of visualization or search by reputation.
Alignment of metabolic pathways

MOTIVATION Several genome-scale efforts are underway to reconstruct metabolic networks for a variety of organisms. As the resulting data accumulates, the need for analysis tools increases. A notable requirement is a pathway alignment finder that enables both the detection of conserved metabolic pathways among different species as well as divergent metabolic pathways within a species. When comparing two pathways, the tool should be powerful enough to take into account both the pathway topology as well as the nodes' labels (e.g. the enzymes they denote), and allow flexibility by matching similar--rather than identical--pathways. RESULTS MetaPathwayHunter is a pathway alignment tool that, given a query pathway and a collection of pathways, finds and reports all approximate occurrences of the query in the collection, ranked by similarity and statistical significance. It is based on a novel, efficient graph matching algorithm that extends the functionality of known techniques. The program also supports a visualization interface with which the alignment of two homologous pathways can be graphically displayed. We employed this tool to study the similarities and differences in the metabolic networks of the bacterium Escherichia coli and the yeast Saccharomyces cerevisiae, as represented in highly curated databases. We reaffirmed that most known metabolic pathways common to both the species are conserved. Furthermore, we discovered a few intriguing relationships between pathways that provide insight into the evolution of metabolic pathways. We conclude with a description of biologically meaningful meta-queries, demonstrating the power and flexibility of our new tool in the analysis of metabolic pathways.