Miracle-dz/UniFAR-FTUs huggingface dataset:
Concurrent Processing Memory

A theoretical memory with limited processing power and internal connectivity at each element is proposed. This memory carries out parallel processing within itself to solve generic array problems. The applicability of this in-memory finest-grain massive SIMD approach is studied in some details. For an array of N items, it reduces the total instruction cycle count of universal operations such as insertion/deletion and match finding to ~ 1, local operations such as filtering and template matching to ~ local operation size, and global operations such as sum, finding global limit and sorting to ~\sqroot{N} instruction cycles. It eliminates most streaming activities for data processing purpose on the system bus. Yet it remains general-purposed, easy to use, pin compatible with conventional memory, and practical for implementation.
How to find good finite-length codes: from art towards science

We explain how to optimize finite-length LDPC codes for transmission over the binary erasure channel. Our approach relies on an analytic approximation of the erasure probability. This is in turn based on a finite-length scaling result to model large scale erasures and a union bound involving minimal stopping sets to take into account small error events. We show that the performances of optimized ensembles as observed in simulations are well described by our approximation. Although we only address the case of transmission over the binary erasure channel, our method should be applicable to a more general setting.
A Comprehensive Framework to Evaluate Hydraulic and Water Quality Impacts of Pipe Breaks on Water Distribution Systems

Pipe breaks have significant impacts on the hydraulic and water quality performance of water distribution systems (WDSs). Therefore, it is important to evaluate these impacts for developing effective strategies to ultimately minimize the consequences of these events. However, there has been surprisingly limited research focusing on impact evaluation for pipe breaks so far. To address this gap, this paper proposes a framework to comprehensively evaluate hydraulic and water quality impacts of pipe breaks on a WDS using six quantitative metrics. These metrics primarily focus on identifying (i) break outflow volume, (ii) water shortage, (iii) nodes with reduced service quality, (iv) pipes with affected pressures, (v) pipes with reversed flow directions, and (vi) pipes with significantly increased velocities, for each breaking event within a WDS. Statistical behaviors, spatial properties, and pipe rankings of metric results are analyzed to reveal the underlying characteristics of impacts induced by pipe breaks. We illustrate the proposed framework using three WDSs with different properties. Results show that impacts of pipe breaks not only vary with pipe diameters but are also significantly influenced by pipe locations, when the break occurs, and the specific metric considered. The proposed framework greatly enhances the fundamental understanding of the underlying properties of breaking impacts on the hydraulic and water quality of WDSs, as well as the ranking of pipes based on the consequences of breaks. Such understanding offers important guidance to develop effective pipe management, resource planning, and break restoration strategies to minimize the impacts of breaking events on WDSs.
Diversity and habitat use of medium-large sized mammals across oil palm landscapes in the Llanos region of Colombia

The Knowledge of carnivores distribution in Colombia is limited, especially in human dominated landscapes. Using camera trapping to detect mammals in 56 sites across an oil palm (Elaeis guineensis) dominated landscape in the eastern plains of Colombia, we confirmed the presence of puma (Puma concolor) only in the outskirts of San Carlos de Guaroa. My results bring to attention the scarcity of puma in the region and highlights the role of riparian forests for the conservation of this species in agricultural landscapes.
Termination proofs for logic programs with tabling

Tabled evaluation is receiving increasing attention in the logic programming community. It avoids many of the shortcomings of SLD execution and provides a more flexible and often considerably more efficient execution mechanism for logic programs. In particular, tabled execution terminates more often than execution based on SLD-resolution. In this article, we introduce two notions of universal termination of logic programming with tabling: quasi-termination and (the stronger notion of) LG-termination. We present sufficient conditions for these two notions of termination, namely quasi-acceptability and LG-acceptability, and we show that these conditions are also necessary in case the selection of tabled predicates meets certain natural criteria. Starting from these conditions, we develop modular termination proofs, i.e., proofs capable of combining termination proofs of separate programs to obtain termination proofs of combined programs. Finally, in the presence of mode information, we state sufficient conditions which form the basis for automatically proving termination in a constraint-based way.
Bunsetsu Identification Using Category-Exclusive Rules

This paper describes two new bunsetsu identification methods using supervised learning. Since Japanese syntactic analysis is usually done after bunsetsu identification, bunsetsu identification is important for analyzing Japanese sentences. In experiments comparing the four previously available machine-learning methods (decision tree, maximum-entropy method, example-based approach and decision list) and two new methods using category-exclusive rules, the new method using the category-exclusive rules with the highest similarity performed best.
Estimation of Stochastic Attribute-Value Grammars using an Informative Sample

We argue that some of the computational complexity associated with estimation of stochastic attribute value grammars can be reduced by training upon an informative subset of the full training set. Results using the parsed Wall Street Journal corpus show that in some circumstances, it is possible to obtain better estimation results using an informative sample than when training upon all the available material. Further experimentation demonstrates that with unlexicalised models, a Gaussian prior can reduce overfitting. However, when models are lexicalised and contain overlapping features, overfitting does not seem to be a problem, and a Gaussian prior makes minimal difference to performance. Our approach is applicable for situations when there are an infeasibly large number of parses in the training set, or else for when recovery of these parses from a packed representation is itself computationally expensive.
Crunching Numbers, Making Decisions: Artificial Intelligence and Statistics for Financial Distress Forecasting in Algeria and Saudi Arabia

Predicting financial distress has been a significant concern for both researchers and practitioners for long period. This topic has garnered substantial interest due to the potential benefits of using predictive models to anticipate financial troubles and help companies steer clear of financial risks that could lead to bankruptcy and liquidation. The primary aim of this research is to forecast financial distress, comparing the effectiveness of Artificial Neural Network (ANN) with Logistic Regression (LR). This evaluation is based on data from 12 Algerian companies and 12 Saudi companies during the period from 2015 to 2019. The study's findings indicate that the LR model outperformed the Wide Neural Network (WNN) model in accurately predicting financial distress, achieving optimal classification accuracy for both Algerian and Saudi companies. Consequently, the LR model emerges as the preferred choice for forecasting financial distress in both countries.
Detecting Urban Emissions Changes and Events With a Near‐Real‐Time‐Capable Inversion System

In situ observing networks are increasingly being used to study greenhouse gas emissions in urban environments. While the need for sufficiently dense observations has often been discussed, density requirements depend on the question posed and interact with other choices made in the analysis. Focusing on the interaction of network density with varied meteorological information used to drive atmospheric transport, we perform geostatistical inversions of methane flux in the South Coast Air Basin, California, in 2015–2016 using transport driven by a locally tuned Weather Research and Forecasting configuration as well as by operationally available meteorological products. We find total‐basin flux estimates vary by as much as a factor of two between inversions, but the spread can be greatly reduced by calibrating the estimates to account for modeled sensitivity. Using observations from the full Los Angeles Megacities Carbon Project observing network, inversions driven by low‐resolution generic wind fields are robustly sensitive (p < 0.05) to seasonal differences in methane flux and to the increase in emissions caused by the 2015 Aliso Canyon natural gas leak. When the number of observing sites is reduced, the basin‐wide sensitivity degrades, but flux events can be detected by testing for changes in flux variance, and even a single site can robustly detect basin‐wide seasonal flux variations. Overall, an urban monitoring system using an operational methane observing network and off‐the‐shelf meteorology could detect many seasonal or event‐driven changes in near real time—and, if calibrated to a model chosen as a transfer standard, could also quantify absolute emissions.
Efficient Binary and Run Length Morphology and its Application to Document Image Processing

This paper describes the implementation and evaluation of an open source library for mathematical morphology based on packed binary and run-length compressed images for document imaging applications. Abstractions and patterns useful in the implementation of the interval operations are described. A number of benchmarks and comparisons to bit-blit based implementations on standard document images are provided.
Object-Based Groupware: Theory, Design and Implementation Issues

Document management software systems are having a wide audience at present. However, groupware as a term has a wide variety of possible definitions. Groupware classification attempt is made in this paper. Possible approaches to groupware are considered including document management, document control and mailing systems. Lattice theory and concept modelling are presented as a theoretical background for the systems in question. Current technologies in state-of-the-art document managenent software are discussed. Design and implementation aspects for user-friendly integrate enterprise systems are described. Results for a real system to be implemented are given. Perspectives of the field in question are discussed.
A C ] 2 7 A pr 2 00 6 COUNTING SOLUTIONS TO BINOMIAL COMPLETE INTERSECTIONS

We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is finite. We give a combinatorial formula for computing the total number of affine solutions (with or without multiplicity) from which we deduce that this counting problem is #P-complete. We discuss special cases in which this formula may be computed in polynomial time; in particular, this is true for generic exponent vectors.
The Beatles Eleanor Rigby Michelle Eric Clapton Cocaine Layla

We present a fully automatic method for music classification , based only on compression of strings that represent the music pieces. The method uses no background knowledge ab out music whatsoever: it is completely general and can, without change, be used in different areas like ling uistic classification and genomics. It is based on an ideal theory of the information content in individual objec ts (Kolmogorov complexity), information distance, and a universal similarity metric. Experiments show that the met hod distinguishes reasonably well between various musical genres and can even cluster pieces by composer.
Are Patient Views about Antibiotics Related to Clinician Perceptions, Management and Outcome? A Multi-Country Study in Outpatients with Acute Cough

Background Outpatients with acute cough who expect, hope for or ask for antibiotics may be more unwell, benefit more from antibiotic treatment, and be more satisfied with care when they are prescribed antibiotics. Clinicians may not accurately identify those patients. Objective To explore whether patient views (expecting, hoping for or asking for antibiotics) are associated with illness presentation and resolution, whether patient views are accurately perceived by clinicians, and the association of all these factors with antibiotic prescribing and patient satisfaction with care. Methods Prospective observational study of 3402 adult patients with acute cough presenting in 14 primary care networks. Correlations and associations tested with multilevel logistic regression and McNemar ‘s tests, and Cohen’s Kappa, positive agreement (PA) and negative agreement (NA) calculated as appropriate. Results 1,213 (45.1%) patients expected, 1,093 (40.6%) hoped for, and 275 (10.2%) asked for antibiotics. Clinicians perceived 840 (31.3%) as wanting to be prescribed antibiotics (McNemar’s test, p<0.05). Their perception agreed modestly with the three patient views (Kappa’s = 0.29, 0.32 and 0.21, PA’s = 0.56, 0.56 and 0.33, NA’s = 0.72, 0.75 and 0.82, respectively). 1,464 (54.4%) patients were prescribed antibiotics. Illness presentation and resolution were similar for patients regardless their views. These associations were not modified by antibiotic treatment. Patient expectation and hope (OR:2.08, 95% CI:[1.48,2.93] and 2.48 [1.73,3.55], respectively), and clinician perception (12.18 [8.31,17.84]) were associated with antibiotic prescribing. 2,354 (92.6%) patients were satisfied. Only those hoping for antibiotics were less satisfied when antibiotics were not prescribed (0.39 [0.17,0.90]). Conclusion Patient views about antibiotic treatment were not useful for identifying those who will benefit from antibiotics. Clinician perceptions did not match with patient views, but particularly influenced antibiotic prescribing. Patients were generally satisfied with care, but those hoping for but not prescribed antibiotics were less satisfied. Clinicians need to more effectively elicit and address patient views about antibiotics.
Animation manifolds for representing topological alteration

An animation manifold encapsulates an animation sequence of surfaces contained within a higher dimensional manifold with one dimension being time. An iso–surface extracted from this structure is a frame of the animation sequence. In this dissertation I make an argument for the use of animation manifolds as a representation of complex animation sequences. In particular animation manifolds can represent transitions between shapes with differing topological structure and polygonal density. I introduce the animation manifold, and show how it can be constructed from a keyframe animation sequence and rendered using raytracing or graphics hardware. I then adapt three Laplacian editing frameworks to the higher dimensional context. I derive new boundary conditions for both primal and dual Laplacian methods, and present a technique to adaptively regularise the sampling of a deformed manifold after editing. The animation manifold can be used to represent a morph sequence between surfaces of arbitrary topology. I present a novel framework for achieving this by connecting planar cross sections in a higher dimension with a new constrained Delaunay triangulation. Topological alteration is achieved by using the Voronoi skeleton, a novel structure which provides a fast medial axis approximation.
Quantum time-space tradeoffs for sorting

We investigate the complexity of sorting in the model of sequential quantum circuits. While it is known that in general a quantum algorithm based on comparisons alone cannot outperform classical sorting algorithms by more than a constant factor in time complexity, this is wrong in a space bounded setting. We observe that for all storage bounds <i>n</i>/log ≥ <i>S</i> ≥ log<sup>3</sup><i>n</i>, one can devise a quantum algorithm that sorts <i>n</i> numbers (using comparisons only) in time <i>T</i>=<i>O</i>(<i>n</i><sup>3/2</sup> log<sup>3/2</sup> <i>n</i>/√<i>S</i>). We then show the following lower bound on the time-space tradeoff for sorting <i>n</i> numbers from a polynomial size range in a general sorting algorithm (not necessarily based on comparisons): <i>TS</i>=Ω(<i>n</i><sup>3/2</sup>). Hence for small values of <i>S</i> the upper bound is almost tight. Classically the time-space tradeoff for sorting is <i>TS</i>=Θ(<i>n</i><sup>2</sup>).
Parameterized Type Definitions in Mathematica: Methods and Advantages

The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the utility of the parameterized categorical approach by deriving a multivariate polynomial category (over various coefficient domains), which is used by our Mathematica implementation of Buchberger's algorithms for determining the Groebner basis. These implementations are designed according to domain and category parameterization principles underlining their advantages: operation protection, inheritance, generality, easy extendibility. In particular, such an extension of Mathematica, a widely used symbolic computation system, with a new type system has a certain practical importance. The approach we propose for Mathematica is inspired from D. Gruntz and M. Monagan's work in Gauss, for Maple.
Evaluating Mobility Pattern Space Routing for DTNs

Because a delay tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm based on the use of a high-dimensional Euclidean space, that we call MobySpace, constructed upon nodes' mobility patterns. We provide here an analysis and a large scale evaluation of this routing scheme in the context of ambient networking by replaying real mobility traces. The specific MobySpace evaluated is based on the frequency of visits of nodes to each possible location. We show that routing based on MobySpace can achieve good performance compared to that of a number of standard algorithms, especially for nodes that are present in the network a large portion of the time. We determine that the degree of homogeneity of node mobility patterns has a high impact on routing. And finally, we study the ability of nodes to learn their own mobility patterns.
Methylphenidate effects on children with Attention Deficit Hyperactivity Disorder: Self-report of symptoms, side-effects, and self-esteem

Examined the effects of methylphenidate (MPH) on the self-report ratings of 24 children with Attention Deficit Hyperactivity Disorder (ADHD). Children provided ratings of ADHD symptoms, side-effects, and self-esteem in a double-blind, placebo-controlled evaluation of three MPH doses (.16 mg/kg, .29 mg/kg, .42 mg/kg). Mothers and teachers completed ratings of ADHD symptoms and side-effects. Children reported significant improvements in ADHD symptoms with medication in an analogous fashion to parent and teacher ratings. Regardless of dose, children reported some side-effects to be more severe than did parents or teachers. Children reported marginally significant increases in side-effect severity with MPH vs. placebo whereas teachers reported significant reductions in the severity of side-effects with treatment. The low dose led to significant improvements in children's behavioral self-concept compared to placebo, although most children showed no overall change in self-concept. These results highlight the importance of children's perceptions of MPH treatment for research and clinical purposes.
Model checking synchronized products of infinite transition systems

Formal verification using the model-checking paradigm has to deal with two aspects. The systems models are structured, often as products of components, and the specification logic has to be expressive enough to allow the formalization of reachability properties. The present paper is a study on what can be achieved for infinite transition systems under these premises. As models, we consider products of infinite transition systems with different synchronization constraints. We introduce finitely synchronized transition systems, i.e. product systems which contain only finitely many synchronized transitions, and show that the decidability of FO(R), first-order logic extended by reachability predicates, of the product system can be reduced to the decidability of FO(R) of the components in a Feferman-Vaught like style. This result is optimal in the following sense. (1) If we allow semifinite synchronization, i.e. just in one component infinitely many transitions are synchronized, the FO(R)-theory of the product system is in general undecidable. (2) We cannot extend the expressive power of the logic under consideration. Already a weak extension of first-order logic with transitive closure, where we restrict the transitive closure operators to arity one and nesting depth two, is undecidable for an asynchronous (and hence finitely synchronized) product, namely for the infinite grid.
Awareness And Risk Behaviors Towards Zoonotic Disease Among Ethnic Minority In Mountainous Area Of Central Vietnam

Background: As a result of the population explosion and rapid urbanization, human activities have been causing negative impacts on the environment. The changing patterns of transmissible diseases among wild animals, livestock and human have been getting more and more complicated in the context of climate change. Ethnic community from mountainous and isolated areas undoubtedly are the most vulnerable, with the high risk of emerging and re-emerging zoonosis. Objectives: To explore the awareness and risk behaviors of the residents in Nham commune, A Luoi district towards zoonosis transmission. To determine the factors related to the risk behaviors of the residents. Methods: A sectional-cross study was conducted among 230 residents whose ages range from 18 – 85, currently living in Nham commune, A Luoi district, adjacent to the Vietnam – Laos border. All participants were interviewed directly with a questionnaire including the following categories: demographics, household wealth, awareness of zoonosis, livestock management and behaviors related to wildlife animals. Descriptive analysis and multivariable logistic regression analysis were conducted to determine factors associated with risk behaviors. Results: The proportion of respondents who have heard about zoonotic diseases was 40%. The majority of subjects raise free-range livestock (83,4%), especially on poultry and cow. The percentage of participants who consumed culled sick and dead animals accounted for 26%, over 30% of villagers slept in forest and more than 50% consumed bushmeat. Risk behaviors related to management livestock and wildlife were statistically significantly associated with gender, age of subjects, educational background, household wealth, information approach on zoonosis, and the number of livestocks. Conclusions: The proportion of respondents who have heard about zoonotic diseases was 40%. The high-risk group falls on those who consume dead domestic animals, wildlife animals and sleep in the forest. Behaviors of human-wildlife contact and zoonosis are quite common with the Nham locals, which emphasizes the necessity for intervention programs in zoonotic disease control.