Miracle-dz/UniFAR-FTUs huggingface dataset:
A longitudinal investigation of information processing biases and self-reported cognitions and behaviours in Chronic Fatigue Syndrome

Unless another licence is stated on the immediately following page this work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International licence. https://creativecommons.org/licenses/by-nc-nd/4.0/ You are free to copy, distribute and transmit the work Under the following conditions:  Attribution: You must attribute the work in the manner specified by the author (but not in any way that suggests that they endorse you or your use of the work).  Non Commercial: You may not use this work for commercial purposes.  No Derivative Works You may not alter, transform, or build upon this work.
Atmospheric Chemistry and Physics the Influence of Biogenic Emissions from Africa on Tropical Tropospheric Ozone during 2006: a Global Modeling Study

We have performed simulations using a 3-D global chemistry-transport model to investigate the influence that biogenic emissions from the African continent exert on the composition of the troposphere in the tropical region. For this purpose we have applied two recently developed bio-genic emission inventories provided for use in large-scale global models (Granier et al., 2005;Lathì ere et al., 2006) whose seasonality and temporal distribution for biogenic emissions of isoprene, other volatile organic compounds and NO is markedly different. The use of the 12 year average values for biogenic emissions provided byLathì ere et al. (2006) results in an increase in the amount of nitrogen sequestrated into longer lived reservoir compounds which contributes to the reduction in the tropospheric ozone burden in the tropics. The associated re-partitioning of nitrogen between PAN, HNO 3 and organic nitrates also results in a ∼5% increase in the loss of nitrogen by wet deposition. At a global scale there is a reduction in the oxidizing capacity of the model atmosphere which increases the atmospheric lifetimes of CH 4 and CO by ∼1.5% and ∼4%, respectively. Comparisons against a range of different measurements indicate that applying the 12 year average ofLathì ere et al. (2006) improves the performance of TM4 AMMA for 2006 in the tropics. By the use of sensitivity studies we show that the release of NO from soils in Africa accounts for between ∼2–45% of tropo-spheric ozone in the African troposphere, ∼10% in the upper troposphere and between ∼5–20% of the tropical tropo-spheric ozone column over the tropical Atlantic Ocean. The subsequent reduction in OH over the source regions allows enhanced transport of CO out of the region. For biogenic volatile organic C1 to C3 species released from Africa, the effects on tropical tropospheric ozone are rather limited, although this source contributes to the global burden of VOC by between ∼2–4% and has a large influence on the organic composition of the troposphere over the tropical Atlantic Ocean.
Matrix Completion via Non-convex Programming

We consider the matrix completion problem in the noisy setting. To achieve statistically efficient estimation of the unknown low-rank matrix, solving convex optimization problems with nuclear norm constraints has been both theoretically and empirically proved a successful strategy under certain regularity conditions. However, the bias induced by the nuclear norm penalty may compromise the estimation accuracy. To address this problem, following a parallel line of research in sparse regression models, we study the performance of a family of non-convex regularizers in the matrix completion problem. In particular, a fast first-order algorithm is proposed to solve the non-convex programming problem. We also describe a degree-of-freedom based reparametrization to “refine” the search along the solution path. Numerical experiments show that these non-convex methods outperform the traditional use of nuclear norm regularization in both simulated and real data sets.
Influence of the spatial super channel guard-band width on the performance of dynamic Flex-Grid/SDM optical Core networks

Spatial Division Multiplexing (SDM) arises as the only solution to overcome the capacity limits of single-mode optical fibres (SMFs). Among the different SDM flavours, Multi-Core Fibres (MCFs) are gaining interest thanks to their low inter-core crosstalk (XT). In this context, Flex-Grid is envisioned as the technology that enables the efficient allocation of connections in SDM-based optical networks. Despite the benefits that the combination of Flex-Grid/SDM brings, the necessary guard-bands between connections can limit the performance, especially when allocating spatial super channels. In this paper, we evaluate the influence of the guard-band width on the performance of dynamic Flex-Grid/SDM optical networks when allocating spatial super-channel connections. The obtained results reveal that significant improvements can be achieved for reduced guard-band requirements.
A population Monte Carlo scheme for computational inference in high dimensional spaces

In this paper we address the Monte Carlo approximation of integrals with respect to probability distributions in high-dimensional spaces. In particular, we investigate the population Monte Carlo (PMC) scheme, which is based on an iterative importance sampling (IS) approach. Both IS and PMC suffer from the well known problem of degeneracy of the importance weights (IWs), which is closely related to the curse-of-dimensionality, and limits their applicability in large-scale practical problems. In this paper we investigate a novel PMC scheme that consists in performing nonlinear transformations of the IWs in order to smooth their variations and avoid degeneracy. We apply the modified IS scheme to the well-known mixture-PMC (MPMC) algorithm, which constructs the importance functions as mixtures of kernels. We present numerical results that show how the modified version of MPMC clearly outperforms the original scheme.
A Survey on Radio over Fiber (RoF) for Wireless Broadband Access Technologies

this paper presents a survey on RoF for Wireless Broadband Access technology like WiMAX (Fixed and Mobile). RoF is considered to achieve an effective delivery of wireless and baseband signal, and it also reduces the power consumption. In the other hand WiMAX (Worldwide Interoperability for Microwave Access) is recent fast growing broadband access technology through wireless. In this paper survey to possible, the RoF implement into wireless broadband access technologies like WiMAX. And also in this combination will be carried out different technical and keying concept from the different methodology. KeywordsWiMAX, Wireless Broadband, Fiber Optical, WDM, OFDM.
Bimodal Hearing Benefit for Speech Recognition with Competing Voice in Cochlear Implant Subject with Normal Hearing in Contralateral Ear

Objectives: This project assessed electroacoustic benefit for speech recognition with a competing talker. Design: Using a cochlear implant subject with normal hearing in the contralateral ear, the contribution of low-pass and high-pass natural sound to speech recognition was systematically measured. Results: High-frequency sound did not improve performance, but low-frequency sound did, even when unintelligible and limited to frequencies below 150 Hz. Conclusions: The low-frequency sound assists separation of the two talkers, presumably using the fundamental frequency cue. Extrapolating this finding to regular cochlear implant users may suggest that using a hearing aid on the contralateral ear will improve performance, even with limited residual hearing.
Performance Evaluation of Spectrum Sensing in Cognitive Radios for Different Channel Conditions

this paper the detection performance of relay based cognitive radio networks is studied. Relays are assigned in cognitive radio networks to transmit the primary user's signal to cognitive coordinator or CPU thus achieving cooperative spectrum sensing. The soft fusion rule is used at the relays which acts as amplify and forward relays. For the detection purpose the energy detector is employed at the cognitive coordinator. Sensing performance is analyzed for different fading channels and comparison between different relay conditions is also studied.
Food price pass-through in the euro area: the role of asymmetries and non-linearities

In this paper we analyse the pass-through of a commodity price shock along the food price chain in the euro area. Unlike the existing literature, which mainly focuses on food commodity prices quoted in international markets, we use a novel database that accounts for the role of the Common Agricultural Policy in the European Union. We model several departures from the linear pass-through benchmark and compare alterative specifications with aggregate and disaggregate food data. Overall, when the appropriate dataset and methodology are used, it is possible to identify a significant and long-lasting food price pass-through. The results of our new regressions are applied to the strong increase in food prices in the 2007-08 period; a simple decomposition exercise shows that commodity prices are the main determinant of the increase in producer and consumer prices, thus solving the pass-through puzzle highlighted in the existing literature for the euro area.
A Learning Based Rate Adaption Algorithm in 802.11n Networks

Rate adaptation algorithms play an important role in improving the performance of WLANs. However, just few numbers of efforts have been made on this area. These algorithms try to provide more throughputs by increasing or decreasing rates upon channel condition and obtained goodput. However, it is a little different in 802.11n. Unfortunately, just a few efforts have been made on this issue. This paper presents a learning automata based algorithm, called learning_RA, to determine the best rate in 802.11n networks. As it is shown in the results, our proposed algorithm provides better results and it has a simple implementation too. We provided a comparison of three different states in the same scenario, that is, without rate adaption, using zigzag and learning_RA algorithms. Obtained results imply that the proposed algorithm outperforms zigzag, which is a well-known rate adaption algorithm. Keywords-component; rate adaption; learning automta; 802.11n
Evaluation of stereo confidence measures on synthetic and recorded image data

We comparatively discuss a set of confidence measures for stereo analysis by testing them on semi-global matching (SGM) cost functions. The aim is a prediction of (potentially) erroneous areas in calculated disparity maps. The evaluation is done by using the sparsification technique which provides more information than commonly used RMS or NCC measures. We also present an approach for combining different confidence measures. This allows us to perform a quantisation of confidence estimates in terms of disparity errors.
Alternative run-length coding through scan chain reconfiguration for joint minimization of test data volume and power consumption in scan test

Test data volume and scan power are two major concerns in SoC test. In this paper we present an alternative run-length coding method through scan chain reconfiguration to reduce both test data volume and scan-in power consumption. The proposed method analyzes the compatibility of the internal scan cells for a given test set and then divides the scan cells into compatible classes. To extract the compatible scan cells we apply a heuristic algorithm by solving the graph coloring problem; and then a simple greedy algorithm is used to configure the scan chain for the minimization of scan power. Experimental results for the larger ISCAS'89 benchmarks show that the proposed approach leads to highly reduced test data volume with significant power savings during scan test.
Spare Cells With Constant Insertion for Engineering Change

Engineering change (EC) is the process of modifying a VLSI design implementation to eliminate design errors, to add new specifications, or to correct design constraint violations. Usually, an EC problem is resolved by using spare cells that have been inserted into unused spaces on a chip. In this paper, we describe an iterative method to determine feasible mapping solutions for an EC problem considering spare cells whose inputs can be connected to Vdd or Gnd . Setting some of the cell inputs to fixed values is referred to as constant insertion. Constant insertion can increase cells' functional flexibility. Our experimental results suggest that constant insertion reduces the area required to find a feasible mapping solution to 80% of that with no constant insertion for the selected EC equations. We also show a procedure for modifying the initial feasible EC solution such that the routing or timing improves.
Stability of a local greedy distributed routing algorithm

In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We provide a distributed and local algorithm that transmits packets hop by hop in the network and study its behaviour. At each step, a node transmits its queued packets to its neighbours in order to optimize a local gradient. This protocol is thus greedy since it does not require to record the history about the past actions, and lazy since it only needs informations of the neighborhood. We prove that this protocol is stable in the sense that the number of packets stored in the network stays bounded as soon as the sources injects a flow that another method could have exhausted. In particular, our protocol stays stable even if the feasibility condition is not strict on topologies with several sources and destinations, under a conjecture when the value of the flow is constrained at the destination nodes. We therefore reinforce a result from the literature that worked for differentiated suboptimal flows.
Control of Minimally Persistent Leader-Remote-Follower and Coleader Formations in the Plane

This paper solves an n -agent formation shape control problem in the plane. The objective is to design decentralized control laws so that the agents cooperatively restore a prescribed formation shape in the presence of small perturbations from the prescribed shape. We consider two classes of directed, cyclic information architectures associated with so-called minimally persistent formations: leader-remote-follower and coleader. In our framework the formation shape is maintained by controlling certain interagent distances. Only one agent is responsible for maintaining each distance. We propose a decentralized control law where each agent executes its control using only the relative position measurements of agents to which it must maintain its distance. The resulting nonlinear closed-loop system has a manifold of equilibria, which implies that the linearized system is nonhyperbolic. We apply center manifold theory to show local exponential stability of the desired formation shape. The result circumvents the non-compactness of the equilibrium manifold. Choosing stabilizing gains is possible if a certain submatrix of the rigidity matrix has all leading principal minors nonzero, and we show that this condition holds for all minimally persistent leader-remote-follower and coleader formations with generic agent positions. Simulations are provided.
neuTube 1.0: A New Design for Efficient Neuron Reconstruction Software Based on the SWC Format 123

Compared to other existing tools, the novel software we present has some unique features such as comprehensive editing functions and the combination of seed-based tracing and path searching algorithms, as well as their availability in parallel 2D and 3D visualization. These features allow the user to reconstruct neuronal morphology efficiently in a comfortable “What You See Is What You Get” (WYSIWYG) way. Abstract Brain circuit mapping requires digital reconstruction of neuronal morphologies in complicated networks. Despite recent advances in automatic algorithms, reconstruction of neuronal structures is still a bottleneck in circuit mapping due to a lack of appropriate software for both efficient reconstruction and user-friendly editing. Here we present a new software design based on the SWC format, a standardized neuromorphometric format that has been widely used for analyzing neuronal morphologies or sharing neuron reconstructions via online archives such as NeuroMorpho.org. We have also implemented the design in our open-source software called neuTube 1.0. As specified by the design, the software is equipped with parallel 2D and 3D visualization and intuitive neuron tracing/editing functions, allowing the user to efficiently reconstruct neurons from fluorescence image data and edit standard neuron structure files produced by any other reconstruction software. We show the advantages of neuTube 1.0 by comparing it to two other software tools, namely Neuromantic and Neurostudio. The software is available for free at http://www.neutracing. com, which also hosts complete software documentation and video tutorials.
Energy-Efficient Clustering System Model and Reconfiguration Schemes for Wireless Sensor Networks

By taking the data-receiving energy consumption into account, we propose an extended analytical model to derive the optimal parameters-the number of clusters for wireless sensor networks. Our analyses show that the previous existing model underestimates the optimal number of clusters within a sensor network. The simulation results verify our analyses and demonstrate the modified model is more accurate in deriving the optimal number of clusters to maximize the network lifetime of the wireless sensor networks. Using our extended model, we also develop the energy-threshold-driven based clustering reconfiguration schemes with the optimal number of clusters to further improve the wireless sensor-network lifetime. The simulation experiments indicate that our clustering reconfiguration schemes outperform the existing ones in terms of sensor-network lifetime while imposing low overhead due to clustering reconfigurations.
Load Sharing in Peer-to-Peer Networks using Dynamic Replication

The peer-to-peer (P2P) architecture provides support for the next generation of information sharing applications. A difficult challenge faced by these systems in the presence of non-uniform data distribution and dynamic network conditions is load sharing. This paper addresses the problem of load sharing in P2P networks across heterogeneous super-peers. We propose two load sharing techniques that use data replication to improve access performance. In the first technique, called periodic push-based replication (PPR), super-peers periodically send replicas of the most frequently accessed files to remote super-peers. This effectively reduces the hop count to fetch these files. The second technique, called on-demand replication (ODR), performs replication based on access frequency. By performing replication on-demand, ODR provides adaptability to changes in access behavior. Extensive testing have been conducted to study the performance of the proposed techniques. The results obtained demonstrate significant performance improvements through replication
Supporting Query by Content on ECG Data with User Defined Functions

Similarity search, or query by content, is an important operation for time series databases. While the research community has been quite active in this area, we are yet to see full support for these operations and data from commercial Database Management Systems (DBMS). In this work we explore how efficiently can similarity search algorithms be implemented inside a DBMS with User Defined Functions (UDFs). We concentrate our work on querying Electrocardiograms (ECG), a biosignal and a particular type of time series data. Given the lack of support for time series as an standard data type, we identify two alternatives for managing a database of ECG signals using a DBMS, namely using either references to flat files on the operating system, or using Binary Large Object (BLOB) attributes. Our experiments show a significant overhead in the total elapsed time while doing similarity search on signals stored as BLOB. On the other hand, querying signals stored as files using UDFs is as competitive as using an ad-hoc implementation of the query by content algorithm running as a stand-alone application on the operating system.
Topological strings on Grassmannian Calabi-Yau manifolds

We present solutions for the higher genus topological string amplitudes on Calabi-Yau-manifolds, which are realized as complete intersections in Grassmannians. We solve the B-model by direct integration of the holomorphic anomaly equations using a finite basis of modular invariant generators, the gap condition at the conifold and other local boundary conditions for the amplitudes. Regularity of the latter at certain points in the moduli space suggests a CFT description. The A-model amplitudes are evaluated using a mirror conjecture for Calabi-Yau complete intersections in Grassmannians by Batyrev, Ciocan-Fontanine, Kim and Van Straten. The integrality of the BPS states gives strong evidence for the conjecture.
A Method for Assessing Leaching Potential for Petroleum Hydrocarbons Release Sites: Multiphase and Multisubstance Equilibrium Partitioning

This article presents the rationale for the mathematical fate and transport model, which has been provided in the accompanying spreadsheet (GWProt). This spreadsheet model may be used as a simple and scientifically defensible regulatory tool for determining the risk-based soil clean up level of petroleum release sites to protect groundwater quality. The model incorporates either a three- or four-phase partitioning equilibrium mechanism, depending on the detection of Non-Aqueous Phase Liquid phase presence mathematically, as well as Raoult's Law convention and default dilution and attenuation factors. A database of contaminant-specific parameters, including solubility and organic-carbon partition-coefficient, molecular weight, and Henry's Law constant, is assembled for benzene, toluene, ethylbenzene, xylenes, and 12 other TPH equivalent carbon fractions. In addition to distributing organic chemicals among aqueous, sorbed solid, air, and NAPL phases, according to traditional partitioning equations, the algorithm incorporates equations for the conservation of mass and volume. A unique solution is obtained by solving a series of mass balance equations simultaneously using the iterative spreadsheet routine built in MICROSOFT EXCELTM Solver — with the restrictions that the volume is conserved and the sum of the mole fractions is equal to one. Sample calculations are presented for a range of parameter values to illustrate the use of the model and the relative leach-ability of a wide range of representative fuels. Sensitivity analysis was also performed to quantify the effects of uncertainty in the estimates of the key model parameters on model results. Model predictions were compared with the results from a water-fuel experiment. The noncar-cinogenic Hazard Index (HI) for groundwater through direct ingestion was calculated using predetermined oral reference dose (Rfd) values. Applications and limitations of the model are also discussed.
CIGALES : A GRAPHICAL QUERY LANGUAGE FOR GEOGRAPHICAL INFORMATION SYSTEMS

: In this paper we present a graphical query language for Geographical Information System. This language is based on a graphical Query-By-Example-like (QBE) philosophy. A set of graphical primitives (icons) represents data or operations such as inclusion, intersection, etc. The user-defined query is made by composition of these icons. The application of the icons defines the query as the data are supposed to be. This graphical query is then transformed into a functional-based-language query. This expression is compiled into specific Data Management System orders or graphical operators. The main contributions of this language are its simplicity to express a query and its representative power.