Miracle-dz/UniFAR-FTUs huggingface dataset:
Public Internet Access for Young Children in the Inner City: Evidence to Inform Access Subsidy and Content Regulation

Significant U.S. policy initiatives in the late 1990s were intended to control Internet access, privacy, and indecency--specifically among children. This study reflects on these using quantitative data from a computer center in a children's library in the inner city. Researchers gathered 16 weeks of page requests ( n = 203,647) using "click stream" and behavioral data, and analyzed these using nonparametric tests. Findings show that users are highly influenced by each other and browse only a small universe of sites. Game playing and communicating with individuals (via e-mail and chat) were the most popular uses. Children were uninterested in pornography and sites directed toward children. Advertising was extremely common. Children were most likely to engage in sharing when using games and chat. For this population, access, privacy and indecency initiatives to control Internet use fails to achieve its stated goals, but activities that encourage sharing in public places hold some promise for building computer knowledge.
Integration of Statistics and Geographic Information Systems: the R/TerraLib Case

This work presents a panorama of GIS integration in Spatial Statistics environments. It highlights the current needs of communities considering such integration. Spatial Statistics is treated in a context focused on the use of computational tools. A review of types of integration is accomplished and a new approach is proposed integrating the statistical software R and the GIS library TerraLib.
Predictive Inferences for Future Order Statistics Coming from an Inverse Gaussian Distribution

— This paper provides procedures for constructing prediction limits on order statistics of future samples using the results of a previous sample from the same underlying inverse Gaussian distribution. Prediction limits are obtained from a point of view of frequentist approach. Bayesian methods are not considered here. The results have direct application in reliability theory, where the time until the first failure in a group of several items in service provides a measure of assurance regarding the operation of the items. The prediction limits are required as specifications on future life for components, as warranty limits for the future performance of a specified number of systems with standby units, and in various other applications. Prediction limit is an important statistical tool in the area of quality control. The lower prediction limits are often used as warranty criteria by manufacturers. The technique used here does not require the construction of any tables. It requires a quantile of the G q qq q and F distributions and is conceptually simple and easy to use. The prediction limits obtained in the paper are generalizations of the usual prediction limits on observations or functions of observations of only one future sample. For illustration, a numerical example is given.
Microtubule‐Affinity Regulating Kinase (MARK) Is Tightly Associated with Neurofibrillary Tangles in Alzheimer Brain: A Fluorescence Resonance Energy Transfer Study

Paired helical filaments, the main structural components of the neurofibrillary tangles in Alzheimer disease, consist of phosphorylated tau protein. Because the levels and degree of phosphorylation are significantly higher in paired helical filament (PHF)-derived tau than in normal adult tau, and because phosphorylation of tau severely disrupts microtubule stability, it is postulated that tau phosphorylation is an important step in PHF formation. The kinases and/or phosphatases that act in vivo to help induce such a pathological state of tau, however, are not yet known. In this study we implicate the non-proline directed kinase MARK in PHF-tau phosphorylation, by virtue of its close intermolecular association with the phosphorylated Ser262 epitope on PHF-tau as assessed by fluorescence resonance energy transfer. Moreover, because this tight enzyme-substrate association is observed in neurofibrillary tangles in Alzheimer tissue, we suggest that PHF-tau phosphorylation may occur to some extent on assembled PHF filaments.
Traffic scheduling with sustainable Cyber Physical Systems applying in smart grid

CPS, Cyber Physical Systems, one of key techniques in smart grid, makes the electric power system become more intelligent and easier to be controlled, and then the system can provide better quality electric power service for users, great efficiently utilize sustainable, green energy, and decrease carbon emission. Based on distributed agent technologies and traffic engineering, this paper proposes a novel multi-QoS data traffic scheduling algorithm with applying in sustainable cyber physical systems in smart grid. With the algorithm, multiple traffic from second equipments, distribute generation, and dispatching centre can effectively exchange electrical information. Theory analysis proves that the algorithm is convergence and validity. Using the simplified topology from “CERTS Micro-grid System” as simulation case, proposed algorithm's performance is evaluated in different traffic load levels. Bandwidth utilization ratios in light and high load levels are analyzed, it shows that the proposed algorithm makes resource used more balanceable, and congestion can be avoided effectively in high traffic load.
Ieee Transactions on Information Theory 1 Pairwise Intersession Network Coding on Directed Networks

—When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow theorem. For the case of more than one coexisting sessions, network coding also demonstrates throughput improvement over non-coded solutions. This paper proposes pairwise intersession network coding, which allows for arbitrary directed networks but restricts the coding operations to being between two symbols (for acyclic networks) or between two strings of symbols (for cyclic networks). A graph-theoretic characterization of pairwise intersession network coding is proven based on paths with controlled edge-overlap. This new characterization generalizes the edge-disjoint path characterization of non-coded network communication and includes the well-studied butterfly graph as a special case. Based on this new characterization, various aspects of pairwise intersession network coding are studied, including the sufficiency of linear codes, the complexity of identifying coding opportunities, its topological analysis, and bandwidth-and coding-efficiency. Index Terms—Controlled edge-overlap, edge-disjoint paths, intersession network coding, intrasession network coding, the min-cut/max-flow theorem.
The Infant Skin Barrier: Can We Preserve, Protect, and Enhance the Barrier?

Infant skin is different from adult in structure, function, and composition. Despite these differences, the skin barrier is competent at birth in healthy, full-term neonates. The primary focus of this paper is on the developing skin barrier in healthy, full-term neonates and infants. Additionally, a brief discussion of the properties of the skin barrier in premature neonates and infants with abnormal skin conditions (i.e., atopic dermatitis and eczema) is included. As infant skin continues to mature through the first years of life, it is important that skin care products (e.g., cleansers and emollients) are formulated appropriately. Ideally, products that are used on infants should not interfere with skin surface pH or perturb the skin barrier. For cleansers, this can be achieved by choosing the right type of surfactant, by blending surfactants, or by blending hydrophobically-modified polymers (HMPs) with surfactants to increase product mildness. Similarly, choosing the right type of oil for emollients is important. Unlike some vegetable oils, mineral oil is more stable and is not subject to oxidation and hydrolysis. Although emollients can improve the skin barrier, more studies are needed to determine the potential long-term benefits of using emollients on healthy, full-term neonates and infants.
Is Money Really 'Smart'? New Evidence on the Relation between Mutual Fund Flows, Manager Behavior, and Performance Persistence

Mutual fund returns strongly persist over multi-year periods - that is the central finding of this paper. Further, consumer and fund manager behavior both play a large role in explaining these long-term continuation patterns - consumers invest heavily in last-year's winning funds, and managers of these winners invest these inflows in momentum stocks to continue to outperform other funds for at least two years following the ranking year. By contrast, managers of losing funds appear reluctant to sell their losing stocks to finance the purchase of new momentum stocks, perhaps due to a disposition effect. Thus, momentum continues to separate winning from losing managers for a much longer period than indicated by prior studies. Even more surprising is that persistence in winning fund returns is not entirely explained by momentum - we find strong evidence that flow-related buying, especially among growth-oriented funds, pushes up stock prices. Specifically, stocks that winning funds purchase in response to persistent flows have returns that beat their size, book-to-market, and momentum benchmarks by two to three percent per year over a four-year period. Cross-sectional regressions indicate that these abnormal returns are strongly related to fund inflows, but not to the past performance of the funds - thus, casting some doubt on prior findings of persistent manager talent in picking stocks. Finally, at the style-adjusted net returns level, we find no persistence, consistent with the results of prior studies. On balance, we confirm that money is smart in chasing winning managers, but that a "copycat" strategy of mimicking winning fund stock trades to take advantage of flow-related returns appears to be the smartest strategy.
MCTS with influence map for general video game playing

In the General Video Game-AI competition in 2014 IEEE Computational Intelligence in Games, Monte Carlo Tree Search (MCTS) outperformed other alternatives. Interestingly, the sample MCTS ranked in the third place. However, MCTS was not always perfect in this problem. For example, it cannot explore enough search space of video games because of time constraints. As a result, if the AI player receives only limited rewards from game environments, it is likely to lose the way and moves almost randomly. In this paper, we propose to use influence map (IM), a numerical representation of influence on the game map, to find a road to rewards over the horizon. We reported average winning ratio improvement over alternatives and successful/unsuccessful cases of our algorithm.
Cytochrome Oxidase, Acetylcholinesterase, and NADPH-Diaphorase Staining in Human Supratemporal and Insular Cortex: Evidence for Multiple Auditory Areas

The pattern of cytochrome oxidase, acetylcholinesterase, and NADPH-diaphorase activity was studied in the supratemporal plane, the posterior part of the superior temporal gyrus, and the insula of normal human brains. Five dark cytochrome oxidase regions were found: (i) on Heschl's gyrus (area TC of von Economo and Koskinas); (ii) on the planum polare (area TC/TG); (iii) posterior to Heschl's gyrus (within area TA); (iv) on the posterior convexity of the superior temporal gyrus (within area TA); and (v) on the posterosuperior insula (area IB). More lightly stained cortex separated these regions (areas IA, TD, and part of TB). The laminar distribution of cytochrome oxidase activity varied in different areas. Acetylcholinesterase-positive fibers predominated in area TC and pyramidal neurons in areas TA and IA and in parts of TB; a mixture of fiber and neuronal staining was found in TC/TG, TD, and IB. NADPH-diaphorase positive profiles included large darkly stained nonpyramidal neurons, mostly in infragranular layers and in subcortical white matter, small faintly stained cells, and a dense array of fibers. The NADPH-diaphorase staining pattern did not vary between areas. The present results suggest that the supratemporal plane, the posterior part of the superior temporal gyrus, and the insula contain at least eight putative cortical areas. Comparison with activation studies by others suggest that, apart from the primary auditory area, six other putative areas may be auditory whereas one putative area, on posterior insula, may be vestibular.
Vessels as 4-D Curves: Global Minimal 4-D Paths to Extract 3-D Tubular Surfaces and Centerlines

In this paper, we propose an innovative approach to the segmentation of tubular structures. This approach combines all of the benefits of minimal path techniques such as global minimizers, fast computation, and powerful incorporation of user input, while also having the capability to represent and detect vessel surfaces directly which so far has been a feature restricted to active contour and surface techniques. The key is to represent the trajectory of a tubular structure not as a 3-D curve but to go up a dimension and represent the entire structure as a 4-D curve. Then we are able to fully exploit minimal path techniques to obtain global minimizing trajectories between two user supplied endpoints in order to reconstruct tubular structures from noisy or low contrast 3-D data without the sensitivity to local minima inherent in most active surface techniques. In contrast to standard purely spatial 3-D minimal path techniques, however, we are able to represent a full tubular surface rather than just a curve which runs through its interior. Our representation also yields a natural notion of a tube's "central curve. " We demonstrate and validate the utility of this approach on magnetic resonance (MR) angiography and computed tomography (CT) images of coronary arteries.
Adaptive Refinement Tree: A New High-Resolution N-Body Code for Cosmological Simulations

We present a new high-resolution N-body algorithm for cosmological simulations. The algorithm employs a traditional particle-mesh technique on a cubic grid and successive multilevel relaxations on the finer meshes, introduced recursively in a fully adaptive manner in the regions where the density exceeds a predefined threshold. The mesh is generated to effectively match an arbitrary geometry of the underlying density field—a property particularly important for cosmological simulations. In a simulation the mesh structure is not created at every time step but is properly adjusted to the evolving particle distribution. The algorithm is fast and effectively parallel: the gravitational relaxation solver is approximately half as fast as the fast Fourier transform solver on the same number of mesh cells. The required CPU time scales with the number of cells, Nc, as ~O(Nc). The code allows us to improve considerably the spatial resolution of the particle-mesh code without loss in mass resolution. We present a detailed description of the methodology, implementation, and tests of the code. We further use the code to study the structure of dark matter halos in high-resolution (~2 h-1 kpc) simulations of standard CDM (Ω = 1, h = 0.5, σ8 = 0.63) and ΛCDM (ΩΛ = 1 - Ω0 = 0.7, h = 0.7, σ8 = 1.0) models. We find that halo density profiles in both CDM and ΛCDM models are well fitted by the analytical model presented recently by Navarro et al., which predicts a singular [ρ(r) ∝ r-1] behavior of the halo density profiles at small radii. We therefore conclude that halos formed in the ΛCDM model have structure similar to that of CDM halos and thus cannot explain the dynamics of the central parts of dwarf spiral galaxies, as inferred from the galaxies' rotation curves.
Comparative Review Study Of MANET Routing Protocols

Mobile Ad-hoc Networks(MANET) are the assembly of mobile nodes that inter-communicate on shared wireless channels without any fixed infrastructure or any centralized control. It's a self configuring network where each node must function as a router. These mobile nodes move arbitrarily and form irregular topologies. Routing is consequently a prime challenge in ad-hoc networks. Many routing protocols have been proposed to date where each one has its own advantages and pitfalls and thus used in different scenarios. These protocols mainly belong to three categories namely proactive, reactive and hybrid. This paper provides an overview and comparison of some of the protocols by presenting their characteristics, functionality, benefits and limitations.
Generating compiler optimizations from proofs

We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical insight of our technique is that a proof of equivalence between the original and transformed concrete programs informs us which aspects of the programs are important and which can be discarded. Our technique therefore uses these proofs, which can be produced by translation validation or a proof-carrying compiler, as a guide to generalize the original and transformed programs into broadly applicable optimization rules. We present a category-theoretic formalization of our proof generalization technique. This abstraction makes our technique applicable to logics besides our own. In particular, we demonstrate how our technique can also be used to learn query optimizations for relational databases or to aid programmers in debugging type errors. Finally, we show experimentally that our technique enables programmers to train a compiler with application-specific optimizations by providing concrete examples of original programs and the desired transformed programs. We also show how it enables a compiler to learn efficient-to-run optimizations from expensive-to-run super-optimizers.
Block space-time antenna precoding/decoding for generalized multicarrier communications in unknown multipath

Transmit antenna diversity has been exploited recently to develop high performance space-time coders and simple maximum-likelihood decoders for transmissions over known at fading channels. Relying on block precoding, this paper develops generalized space-time coded multicarrier transceivers appropriate for wireless propagation over frequency-selective (and perhaps unknown) multipath channels. Multicarrier precoding maps the frequency-selective channel into a set of at fading sub-channels, whereas space-time encoding/decoding facilitates equalization and achieves performance gains by exploiting the diversity available with transmit (and possibly receive) antennas. When unknown, channel status information is acquired blindly based on a deterministic variant of the constant-modulus algorithm that capitalizes on block precoding. System performance is evaluated both analytically and with simulations.
Revisiting globally sorted indexes for efficient document retrieval

There has been a large amount of research on efficient document retrieval in both IR and web search areas. One important technique to improve retrieval efficiency is early termination, which speeds up query processing by avoiding scanning the entire inverted lists. Most early termination techniques first build new inverted indexes by sorting the inverted lists in the order of either the term-dependent information, e.g., term frequencies or term IR scores, or the term-independent information, e.g., static rank of the document; and then apply appropriate retrieval strategies on the resulting indexes. Although the methods based only on the static rank have been shown to be ineffective for the early termination, there are still many advantages of using the methods based on term-independent information. In this paper, we propose new techniques to organize inverted indexes based on the term-independent information beyond static rank and study the new retrieval strategies on the resulting indexes. We perform a detailed experimental evaluation on our new techniques and compare them with the existing approaches. Our results on the TREC GOV and GOV2 data sets show that our techniques can improve query efficiency significantly.
A New Rate-based Active Queue Management: Adaptive Virtual Queue RED

In an effort to improve performance of congested gateways, a new Active Queue Management (AQM) algorithm, Adaptive Virtual Queue Random Early Detection (AVQRED), was developed by feeding virtual queue size to the RED algorithm. The objective of the new algorithm is to improve overall performance by keeping link utilization high, link utilization stable, queueing delay low and consecutive packet drop rate low. This paper shows the objective is met by comparing AVQRED with six other well known AQM methods in a realistic emulation environment. To provide fair comparisons, the AQM parameters are fine-tuned by exploring many different parameter settings via emulations. The emulation results conclude that AVQRED improves overall performance by 8 to 25%. To provide intuitive properties and validate the emulation results, a mathematical model is proposed and fed to MATLAB, and the results from MATLAB and emulations are compared.
IMMERSIVE VISUAL ANALYTIC OF EARTH OBSERVATION DATA

New trends in exploration and visualization are highly demanded in dealing with the massive amount of collected Earth Observation (EO) data. In this work, we propose an immersive visual analytic of EO data utilizing Virtual Reality technology. Precisely, we introduce the visualization of large scale SAR images in an immersive 3D environment and also introduce an interactive learning algorithm for the data clustering using Nonnegative Matrix Factorization framework. We conduct our experiments on a dataset of SAR images represented by different features and show that the proposed interactive clustering outperforms the others.
Quantics-TT Collocation Approximation of Parameter-Dependent and Stochastic Elliptic PDEs

Abstract We investigate the convergence rate of the quantics-TT (QTT) stochas- tic collocation tensor approximations to solutions of multiparametric elliptic PDEs and construct efficient iterative methods for solving arising high-dimensional parameter- dependent algebraic systems of equations. Such PDEs arise, for example, in the para- metric, deterministic reformulation of elliptic PDEs with random field inputs, based, for example, on the M-term truncated Karhunen-Loève expansion. We consider both the case of additive and log-additive dependence on the multivariate parameter. The local-global versions of the QTT-rank estimates for the system matrix in terms of the parameter space dimension is proven. Similar rank bounds are observed in numerics for the solutions of the discrete linear system. We propose QTT-truncated iteration based on the construction of solution-adaptive preconditioner that provides robust conver- gence in both additive and log-additive cases. Various numerical tests indicate that the numerical complexity scales almost linearly in the dimension of parametric space M.
Incremental interpretation in second language sentence processing

The degree to which native and non-native readers interpret English sentences incrementally was investigated by examining plausibility effects on reanalysis processes. Experiment 1 required participants to read sentences word by word and to make on-line plausibility judgements. The results showed that natives and non-natives immediately computed the plausibility of the preferred structural analysis, which then affected ease of reanalysis. Experiment 2 required participants to read the same sentences word by word in order to perform a memory task. The natives showed a similar pattern of results to Experiment 1, whereas for the non-natives plausibility effects were delayed. However, the non-natives still appeared to be performing immediate syntactic reanalysis. It is concluded that syntactic processing was person- and task-independent, whereas the incrementality of interpretation was more dependent on task demands for the non-natives than for the natives.