Miracle-dz/UniFAR-FTUs huggingface dataset:
Urban Aerosol Impacts on Downwind Convective Storms

Abstract The impacts of urban-enhanced aerosol concentrations on convective storm development and precipitation over and downwind of St. Louis, Missouri, are investigated. This is achieved through the use of a cloud-resolving mesoscale model, in which sophisticated land use processes and aerosol microphysics are both incorporated. The results indicate that urban-forced convergence downwind of the city, rather than the presence of greater aerosol concentrations, determines whether storms actually develop in the downwind region. Once convection is initiated, urban-enhanced aerosols can exert a significant effect on the dynamics, microphysics, and precipitation produced by these storms. The model results indicate, however, that the response to urban-enhanced aerosol depends on the background concentrations of aerosols; a weaker response occurs with increasing background aerosol concentrations. The effects of aerosols influence the rate and amount of liquid water and ice produced within these storms, the accu.
Attributing Creative Agency: Are we doing it right?

When contemplating the creativity of computational systems, a host of factors have been taken into consideration, many of which people have attempted to measure or otherwise operationalise: novelty, value, P-creativity versus H-creativity, exploration versus transformation, the subjective evaluation and contextualisation of the artefact, and so on. Whilst of equal importance, the systematic and rigorous attribution of creative agency to different actors in the production of a specific output has been given less attention. It is common to make the simplifying assumption that the most direct contributor to an artefact is that artefact’s sole author, but arguably this is never the case: all human creativity occurs in the context of networks of mutual influence, including a cumulative pool of knowledge. This paper looks at how we might better formalise creative authorship suchthat for any artefact, aset of agents could be precisely attributed with their relative contributions to the existence of that entity. It asks only what the nature of this formalisation should be, and concludes that a more critical approach is needed to the creative agency of human actors, and thus the expected creative agency of machines. I draw on two critical notions that can inform a methodology for the ascription of creative origins in computational creativity: becoming, and the agency of networks of interaction. I look at a example from both historical human creativity and computation creativity, to consider how we can break down creative agency and ascribe it to different sources. Practical implications are dicsussed.
A Bi-Projection Neural Network for Solving Constrained Quadratic Optimization Problems

In this paper, a bi-projection neural network for solving a class of constrained quadratic optimization problems is proposed. It is proved that the proposed neural network is globally stable in the sense of Lyapunov, and the output trajectory of the proposed neural network will converge globally to an optimal solution. Compared with existing projection neural networks (PNNs), the proposed neural network has a very small model size owing to its bi-projection structure. Furthermore, an application to data fusion shows that the proposed neural network is very effective. Numerical results demonstrate that the proposed neural network is much faster than the existing PNNs.
Effects of movement velocity, acceleration and initial degree of muscle flexion on bicep EMG signal amplitude

This study aims to determine the factors that affect the electromyography signal amplitude of human muscles. In a previous study, it was determined that increases in movement velocity and acceleration led to an increase in EMG signal amplitude. In this study, EMG signal amplitudes were investigated under varying degree of muscle flexion while at rest, by varying the angle of initial positions. Eight healthy subjects performed bicep curl movements with three different velocities at three different initial positions, with at least thirty movement repetitions each. The results were summarized, processed, and statistically analysed in order to show the relationship between the above stated factors and EMG signal amplitude.
Software Function, Source Lines of Code, and Development Effort Prediction: A Software Science Validation

One of the most important problems faced by software developers and users is the prediction of the size of a programming system and its development effort. As an alternative to "size," one might deal with a measure of the "function" that the software is to perform. Albrecht [1] has developed a methodology to estimate the amount of the "function" the software is to perform, in terms of the data it is to use (absorb) and to generate (produce). The "function" is quantified as "function points," essentially, a weighted sum of the numbers of "inputs," "outputs,"master files," and "inquiries" provided to, or generated by, the software. This paper demonstrates the equivalence between Albrecht's external input/output data flow representative of a program (the "function points" metric) and Halstead's [2] "software science" or "software linguistics" model of a program as well as the "soft content" variation of Halstead's model suggested by Gaffney [7].
Single channel source separation using static and dynamic features in the power domain

In this paper we address the problem of separating the sound sources composing complex sound mixtures using a single microphone. The a-priori information of static and delta power of each source is represented by Gaussian mixture models (GMMs) and incorporated into a full posterior probability density function. We present a unified probabilistic framework that integrates the a-priori information of the power and the delta power of the sources and we derive a closed-form approximate minimum mean square error (MMSE) estimator of the audio sources. The experimental part evaluates our approach on mixtures of real environmental sounds in scenarios that involve speakers talking in a music background. Comprehensive experiments clarify the importance of incorporating delta in the separation process by presenting separation results using the static only and the joint static and delta a-priori models.
Variational multiscale approach to LAI profile inversion based on LiDAR full waveform measurements

Light Detection and Ranging (LiDAR) is one of the important techniques of remote sensing that is currently attracting considerable interest in description of vegetation structure, obtaining information about the canopy height as well as the foliage density of vegetation layer profiles. In this study, we estimate one of the important structural properties of vegetation: the profile of leaf area index (LAI). It is retrieved based on airborne full waveform LiDAR data inversion. It consists of estimating the value of LAI each time an echo is recorded. The proposed approach approximates the scattering taking into account just the first pulse collision within the vegetation cover. Moreover, to be independent from both the scattering coefficient and the pulse energy, the ratio between two successive echoes is model instead of the echo itself. The proposed algorithm is based on Bayesian modeling. Indeed, we propose a variational approach having two components: data attachment (simulated waveform is close to actual one) and regularity (the LAI value slowly varies from a position to the next). The problem is finally written as a non-linear cost function to optimize. To solve it and overcome non-linearity, we propose a new multiscale gradient technique, which start by solving simpler problem and increases progressively the complexity until converging to the original problem. For evaluating our methods, we parametrize the DART model to simulate Lidar full waveform and vegetation scenes; one with Turbid medium and the other with imported 3D olive tree. The results are promising.
QBD Modelling of a finite state controller for queueing systems with unobservable Markovian environments

We address the problem of stabilizing control for complex queueing systems with known parameters but unobservable Markovian random environment. In such systems, the controller needs to assign servers to queues without having full information about the servers' states. A control challenge is to devise a policy that matches servers to queues in a way that takes state estimates into account. Maximally attainable stability regions are non-trivial. To handle these situations, we model the system under given decision rules. The model is using Quasi-Birth-and-Death (QBD) structure to find a matrix analytic expression for the stability bound. We use this formulation to illustrate how the stability region grows as the number of controller belief states increases.
The Application of Metaphor Identification Procedure (Mip) and Conceptual Metaphor in Japanese Poetry

The aims of this study are to apply the method of the metaphor identification procedure (Pragglejaz Group, 2007) to find out the linguistic metaphors in Japanese poetry, and apply the theory of conceptual metaphor (CMT) (Lakoff a Johnson, 2003) to find out the conceptual metaphors that motivate the use of linguistic metaphor in the poetry. Descriptive qualitative method was applied in this research. The data of this research were taken from Takuboku Ishikawa dan Segenggam Pasir nbook, written by Edizal (2000). The result shows that metaphor identification procedure (MIP) provides a explicit, reliable, and flexible instrument for identifying linguistic metaphors and conceptual metaphor theory (CMT) provides a systematic tool to identify the concepts behind the linguistic metaphors. The linguistic metaphors identified in the poetry are: koi no amasa to nagashisa, kanashimi no tama, and te ga shirokukatsu dainariki. The conceptual metaphors that are found to underlie the linguistic metaphors are: nVIRTUE IS WHITE, LOVE IS FOOD OR DRINK, SAD IS INSTABILITY
A New Exact and More Powerful Unconditional Test of No Treatment Effect from Binary Matched Pairs

Summary We consider the problem of testing for a difference in the probability of success from matched binary pairs. Starting with three standard inexact tests, the nuisance parameter is first estimated and then the residual dependence is eliminated by maximization, producing what I call an E+M P‐value. The E+M P‐value based on McNemar's statistic is shown numerically to dominate previous suggestions, including partially maximized P‐values as described in Berger and Sidik (2003, Statistical Methods in Medical Research12, 91–108). The latter method, however, may have computational advantages for large samples.
FPGAs for Dynamic (XML) Query Workloads

While the performance opportunities of ﬁeld-programmable gate arrays (FPGAs) for high-volume query processing are well known, complicated and tedious query compilation procedures still defeat the use of the technology for dynamic query workloads, which are relevant in practice. In this work we report on an FPGA-based stream processing engine that does not have this limitation. We provide a hardware implementation of XML projection [10] that can be reconﬁgured in less than a micro-second and thus supports even highly dynamic query workloads. Our work brings the architectural advantages of FPGA technology to the XML world. Using our system, XML streams can be ﬁltered in the network , saving network band-width, client-side parsing, and expensive pre-processing. The system is ready now and can be run on widely available FPGA hardware (on XUPV5 development boards).
Global Properties of Some Preferential Attachment Graphs

We are looking at a model of preferential attachment graphs that can evolve in ﬁve diﬀerent ways. On any given iteration, a single vertex may be connected to the graph, a path may be connected to the graph, an edge may be added to the graph, an edge may be removed from a graph, or a vertex may be removed from a graph, with each option having a given probability of occurring. If a single vertex or a path is added, one or both of the new vertices also may be connected to the neighborhood of the existing vertex. We explore the order, size, and degree distribution of the graphs which result from a large number of iterations.
Language Emergence in Development: A Computational Perspective

IntroductionEmergentist accounts of language typically seek to explain acquisition as being rooted in simple learning mechanisms. Such an approach requires not only that the input to children be rich with cues to the structure of the language being learned, but also that children's learning mechanisms be well-attuned to these cues. Languages themselves must be, in turn, well-tailored to the learner through processes of cultural evolution (e.g., Christiansen & Chater, 2008). While a number of developmental psycholinguistic findings have lent support to such an approach, computational work has allowed researchers to directly uncover a wealth of potentially useful statistical information in corpora of child-directed speech, as well as to test explicit models of language acquisition using representative input. Computational modeling provides a means to directly test the capacity of simple learning mechanisms to give rise to complex linguistic knowledge, and therefore represents a core methodology in emergentist work on language development.Many of the early strides in emergentist modeling of language development were achieved by researchers working within the connectionist framework. In recent years, the computational limitations of connectionist techniques have lead to a shift away from artificial neural networks, towards higher-level models capable of scaling up to deal with input in the form of entire corpora of child-directed speech. A number of such models have made contact with emergentist principles, demonstrating that learning structure from input through general cognitive mechanisms can account for specific developmental patterns in syntactic production (Freudenthal, Pine, & Gobet, 2006, 2007; Gobet, Freudenthal, & Pine, 2004; Jones, Gobet, & Pine, 2000), the acquisition of constructions and construction-like units (Chang, 2008; Solan, 2
Visual servoing for large camera displacements

The first aim of any visual-servoing strategy is to avoid features being lost from the field of view and that the desired location may not be reached. However, avoiding both these system failures turns out to be very difficult, especially when the initial and desired locations are distant. Moreover, the methods that succeed in presence of large camera displacements often produce a long translational trajectory that may not be allowed by the robot workspace and/or joint limits. In this paper, a new strategy for dealing with such problems is proposed, which consists of generating circular-like trajectories that may satisfy the task requirements more naturally than other solutions. Knowledge of geometrical models of the object or points depth is not required. It is shown that system failures are avoided for a calibrated camera. Moreover, necessary and sufficient conditions are provided for establishing tolerable errors on the estimates of the intrinsic and extrinsic parameters, in order to guarantee a robust field of view and robust local asymptotic stability. Several simulation results show that the translational trajectories obtained in presence of large displacements are significantly shorter than those produced by the existing methods, in cases of both correct and bad camera calibration. Very satisfactory results are achieved also in presence of small displacements.
DCU-TCD@LogCLEF 2010: Re-ranking Document Collections and Query Performance Estimation

This paper describes the collaborative participation of Dublin City University and Trinity College Dublin in LogCLEF 2010. Two sets of experiments were conducted. First, dierent aspects of the TEL query logs were analysed after extracting user sessions of consecutive queries on a topic. The relation between the queries and their length (number of terms) and position (rst query or further reformulations) was examined in a session with respect to query performance estimators such as query scope, IDF-based measures, simplied query clarity score, and average inverse document collection frequency. Results of this analysis suggest that only some estimator values show a correlation with query length or position in the TEL logs (e.g. similarity score between collection and query). Second, the relation between three attributes was investigated: the user's country (detected from IP address), the query language, and the interface language. The investigation aimed to explore the inuence of the three attributes on the user's collection selection. Moreover, the investigation involved assigning dierent weights to the three attributes in a scoring function that was used to re-rank the collections displayed to the user according to the language and country. The results of the collection re-ranking show a signicant improvement in Mean Average Precision (MAP) over the original collection ranking of TEL. The results also indicate that the query language and interface language have more inuence than the user's country on the collections selected by the users.
A Review of the Role of Amphiphiles in Biomass to Ethanol Conversion

One of the concerns for economical production of ethanol from biomass is the large volume and high cost of the cellulolytic enzymes used to convert biomass into fermentable sugars. The presence of acetyl groups in hemicellulose and lignin in plant cell walls reduces accessibility of biomass to the enzymes and makes conversion a slow process. In addition to low enzyme accessibility, a rapid deactivation of cellulases during biomass hydrolysis can be another factor contributing to the low sugar recovery. As of now, the economical reduction in lignin content of the biomass is considered a bottleneck, and raises issues for several reasons. The presence of lignin in biomass reduces the swelling of cellulose fibrils and accessibility of enzyme to carbohydrate polymers. It also causes an irreversible adsorption of the cellulolytic enzymes that prevents effective enzyme activity and recycling. Amphiphiles, such as surfactants and proteins have been found to improve enzyme activity by several mechanisms of action that are not yet fully understood. Reduction in irreversible adsorption of enzyme to non-specific sites, reduction in viscosity of liquid and surface tension and consequently reduced contact of enzyme with air-liquid interface, and modifications in biomass chemical structure are some of the benefits derived from surface active molecules. Application of some of these amphiphiles could potentially reduce the capital and operating costs of bioethanol production by reducing fermentation time and the amount of enzyme used for saccharification of biomass. In this review article, the benefit of applying amphiphiles at various stages of ethanol production (i.e., pretreatment, hydrolysis and hydrolysis-fermentation) is reviewed and the proposed mechanisms of actions are described.
Protein Structure Searching using Suffix Arrays

Searching for similarities of proteins using Structured-based query, has a vital role in many applications like drug discovery and drug design, disease diagnosis and treatment and protein classification. Indexing the protein structure is one approach of searching protein structure for similarities. In this paper we proposed a method to enhance the memory space for storing the indexed data without affecting other performance criteria. Our technique starts by extracting the local feature vectors of proteins structures. Normalization is applied to these vectors components. Finally we use the generalized suffix array to index these vectors. Suffix array is used to return the maximal structural similarities as a result for a structured query. The experimental results, which based on the structural classification of protein (SCOP) dataset, show that our method outperforms existing similar methods in memory utilization. Our results show an enhancement in the memory usage with factor exceeds 50%.
The Permanent Income Hypothesis Revisited. Reconciling Evidence from Aggregate Data with the Representative Consumer Behaviour

The evidence on the excessive smoothness and sensitivity of consumption with respect to income is sufficiently overwhelming to refute the rational expectations version of the permanent income hypothesis known as the random walk model. This paper proposes an alternative model which (i) is compatible with the “excess smoothness” and the “excess sensitivity” phenomena, (ii) can be interpreted as a rule-of-thumb revision, or smoothing, scheme similar to that proposed by Friedman, and (iii) can also be derived as the solution to a forward-looking intertemporal optimising problem where the rational consumer maximises a time-nonseparable utility function subject to the life-time budget constraint. Data from Canada, the U.K. and the U.S. are used to examine the proposed model. The findings strongly support the theoretical generalisation of the PIH proposed in the paper.
A simple polar parameterisation method to show quantitative spatial variation between delineations on medical image datasets

Any single valued function over a sphere or cylinder can be parameterised in terms of the spherical or cylindrical coordinate systems respectively. An organ structure created during medical image segmentation can be written as such a function if the shape is polar (i.e. star shaped), the polar radial distance from a reference point inside the structure to its surface becoming a function of the polar parameters. The parameterisation allows shape variation (as a function of the polar parameters) between multiple structures to be analysed quantitatively, improving on the traditional measure of radiotherapy delineation variability, the delineated structures' volume statistics. We include an example inter-observer delineation variability case study. The parameterised variability maps were found to match well with measurements taken from superimposed contour outlines.
Automated method-extraction refactoring by using block-based slicing

Refactoring improves the design of existing code but is not complex to do by hand. This paper proposes a mechanism that automatically refactors methods of object-oriented programs by using program slicing. To restructure a method without changing its observable behavior, the mechanism uses block-based slicing that does not extract the fragments of code from the whole program but from the region consisting of some consecutive basic-blocks of the program. A refactoring tool implementing the mechanism constructs a new method that contains the extracted code and re-forms the source method that contains this tool, a programmer indicates only a variable of interest in the code that he/she wants to refactor and then selects a suitable method from among the candidates created by the tool. The programmer does not have to test the refactored code since the mechanism is based on data-and control-flow analysis. Thus the tool enables programmers to avoid manual refactoring whose process is error-prone and time-consuming
One Missing Value Problem in Latin Square Design of Any Order: Regression Sum of Squares

This paper introduced an incomplete Latin square design that leads to difficulties in the analysis of variance (ANOVA). The aim was to determine the explicit and mathematical formulae for the regression sum of squares for the full model of experimental data by means of the exact approach. From an overall review of the literature, the gap was a lack of definite formula for the ANOVA table for the cases of the incomplete Latin square designs. However, in this paper, the least square normal equations for the one-missing-value Latin square design were built to determine the estimates of model parameters and the regression sum of squares of the full effect model. It is noted that the regression sum of squares of the full effect model is one part of the analysis of variance with the exact approach.