Miracle-dz/UniFAR-FTUs huggingface dataset:
Healthy Eats—Evaluation of a Social Marketing Program Delivered in Primary School Settings in Queensland

One in four school children in Australia are overweight or obese. In response, the Healthy Eats program was developed, piloted, and delivered using a whole-of-school approach underpinned by the socio-ecological model to increase fruit and vegetable consumption among children aged 8–10 years in regional Queensland, Australia. This research presents an outcome evaluation of the Healthy Eats program using pre–post data collected throughout 2021 (cross-sectional for knowledge and longitudinal for behaviour) from 19 schools to assess whether changes occurred in students’ nutritional knowledge (n = 1868 (pre = 933, post = 935)) and fruit and vegetable consumption (n = 1042 (pre = 521, post = 521)). Knowledge data was collected via self-reports two weeks prior and immediately after the Nutrition Module. Behavioural data on daily fruit and vegetable consumption was gathered via student passports (i.e., surveys) one week before and for four consecutive weeks after the Nutrition Module. Chi-Square Difference tests and t-Tests were conducted with a significance level set at p < 0.05. Across all 19 schools, knowledge of the daily recommended serves of fruit and vegetables improved significantly following participation in the program, aligning knowledge closer to the Australian dietary guidelines. Behavioural results for fruit consumption were favourable, with clear improvements reported. Increases in vegetable consumption were demonstrated in two of the eight schools. A discussion on the knowledge–action gap is provided, including recommendations for future iterations of the Healthy Eats program.
On the numerical solution of non-linear first order ordinary differential equation systems

In this article, firstly we develop a method for a type of difference equations, applicable to solve approximately a class of first order ordinary differential equation systems. In a second step, we apply the results obtained to solve a non-linear two point boundary value problem relating a flight mechanics model. We highlight the algorithm obtained seems to be robust and of easy computational implementation.
Heat-constrained modelling of calcium sulphate reduction

A two-dimensional finite difference model has been developed to describe the reduction of kilogram quantities of dehydrated phosphogypsum. The model's scope has been limited to focus on the heat transfer and reactions that occur within a mass of material contained in a vessel inside a furnace rather than also including the effects of heat transfer to the vessel. Changes in the heat transfer properties (k, p, and Cp) are incorporated as the composition of the mass changes as the chemical reactions progress. The model is validated against experimental data, with samples heated to iooo°C at 3°C min-1 while purging with nitrogen gas. A sensitivity analysis of model predictions to the pre-exponential factor of the reaction rate constant of the main chemical reaction and the thermal conductivity of the powder bed indicated that, at the envisaged process conditions, the behaviour of the system depends much more on the rate of heat transfer than on the rate of the chemical reaction. The model demonstrated a significant increase in accuracy when the thermal conductivity was modelled to increase linearly with temperature compared to assuming a constant value.
Diversity and conservation of endemic true bugs for four family groups in China

Protected areas (PAs) in China have typically been designed by considering one or several focal taxa (e.g., relict plant and vertebrate species), but the effectiveness of these “protective umbrellas” in safeguarding insects remains unclear. In this study, we aim to investigate the distribution and diversity of endemic true bugs for four family groups (i.e., Miridae, Lygaeoidea, Pentatomidae, and Reduviidae) in China, the environmental factors shaping these diversity patterns, and the effectiveness of China's PAs in safeguarding their diversity.
Complexity and invariant measure of the period-doubling subshift

Explicit formulas for complexity and unique invariant measure of the period-doubling subshift can be derived from those for the Thue-Morse subshift, obtained by Brlek, De Luca and Varricchio, and Dekking. In this note we give direct proofs based on combinatorial properties of the period-doubling sequence. We also derive explicit formulas for correlation integral and other recurrence characteristics of the period-doubling subshift. As a corollary we obtain that the determinism of this subshift converges to 1 as the distance threshold approaches 0.
Characterizing weak solutions for vector optimization problems

This paper provides characterizations of the weak solutions of optimization problems where a given vector function $F,$ from a decision space $X$ to an objective space $Y$, is "minimized" on the set of elements $x\in C$ (where $C\subset X$ is a given nonempty constraint set), satisfying $G\left( x\right) \leqq_{S}0_{Z},$ where $G$ is another given vector function from $X $ to a constraint space $Z$ with positive cone $S$. The three spaces $X,Y,$ and $Z$ are locally convex Hausdorff topological vector spaces, with $Y$ and $Z$ partially ordered by two convex cones $K$ and $S,$ respectively, and enlarged with a greatest and a smallest element. In order to get suitable versions of the Farkas lemma allowing to obtain optimality conditions expressed in terms of the data, the triplet $\left( F,G,C\right) ,$ we use non-asymptotic representations of the $K-$epigraph of the conjugate function of $F+I_{A},$ where $I_{A}$ denotes the indicator function of the feasible set $A,$ that is, the function associating the zero vector of $Y$ to any element of $A$ and the greatest element of $Y$ to any element of $X\diagdown A. $
On Non-Newtonian fluids and phase field approach: Existence and Regularity

The object of this paper is twofold. Firstly, we study a class of generalized Newtonian fluid related to "power law ". For the corresponding non-Newtonian Navier-Stokes problems, the existence of a weak and periodic solutions is proved in the large for a bounded domain in $\mathbb{R}^3$. Further, variational inequalities and local-in-time well-posedness of the initial-boundary value problem are investigated. Secondly, we deduce a generalization of the Graffi-Kazhikhov-Smagulov model based on an advective-diffusion process in the context of multiphase theory. Local-in-time well-posedness of the initial-boundary value problem is investigated
Algebraic independence for values of integral curves

We prove a transcendence theorem concerning values of holomorphic maps from a disk to a quasi-projective variety over $\overline{\mathbf{Q}}$ that are integral curves of some algebraic vector field (defined over $\overline{\mathbf{Q}}$). These maps are required to satisfy some integrality property, besides a growth condition and a strong form of Zariski-density that are natural for integral curves of algebraic vector fields. This result generalizes a theorem of Nesterenko concerning algebraic independence of values of the Eisenstein series $E_2,E_4,E_6$. The main technical improvement in our approach is the replacement of a rather restrictive hypothesis of polynomial growth on Taylor coefficients by a geometric notion of moderate growth formulated in terms of Value Distribution Theory.
Detection of Microgrid Cyberattacks Using Network and System Management

Microgrids, as a major domain of smart grids, facilitate the integration of distributed and renewable energy sources. They are capable of operating autonomously when the connection to the main grid is difficult or cost-ineffective. As the presence of microgrids in the smart grid becomes more common, it becomes more urgent to protect the microgrid from cyberattacks. In this paper, we present the first design and implementation of a microgrid security monitoring platform based on IEC 62351–7:2017 Network and System Management (NSM). The capabilities of this platform are demonstrated on a detailed microgrid model that is deployed on a real-time co-simulation testbed. A hybrid rule-based and machine learning anomaly detection approach is developed to detect attacks targeting the microgrid. To investigate the effectiveness of the NSM security monitoring platform, evaluate the proposed detection schemes, and observe the impact of cyberattacks on the microgrid operation, several formulated attacks against the microgrid are simulated. The effectiveness of different parameters and architectures for the anomaly detection schemes are compared against one another, including Long Short-Term Memory (LSTM) and Gated Recurrent Unit (GRU). The obtained results demonstrate the strengths and gaps of security monitoring based on NSM, and can be seen as first step towards the design of more comprehensive monitoring platforms that integrate NSM along with complementary mechanisms such as passive network traffic inspection and device log analysis.
Extraction of Sugarcane Planting Area Based on Similarity of NDVI Time Series

Timely and accurate estimation of the sugarcane planting area is of vital importance to the country’s agricultural production and sugar development. In remote sensing crop mapping based on spectral similarity, there will be have a phenomenon of foreign matters with the same spectrum by obtaining an accurate crop reference curve for crop identification, limiting mapping accuracy. In this study, we improved the spectral reconstruction method based on singular value decomposition (SR-SVD). A decision tree model was established based on the similarity of the sugarcane Normalized Difference Vegetation Index (NDVI) time series curve and the fluctuation range of NDVI in different growth periods. Using the Sentinel-2 (Level-2A) image data set to extract sugarcane planting area in two regions of Chongzuo City, Guangxi, China, the overall accuracy was higher than 96%, respectively. The results show that through the spectral similarity and the determination of the threshold fluctuation range, not only high-precision mapping of sugarcane can be achieved, but the problem of “same spectrum with different objects” can also be solved. Therefore, this method can provide accurate information on the sugarcane planting areas and technical support for monitoring the structure of sugarcane planting in the region.
Upper Bounds for the First Eigenvalue of the Laplacian on Non-Orientable Surfaces

In 1980 Yang and Yau~\cite{YY} proved the celebrated upper bound for the first eigenvalue on an orientable surface of genus $\gamma$. Later Li and Yau~\cite{LY} gave a simple proof of this bound by introducing the concept of conformal volume of a Riemannian manifold. In the same paper they proposed an approach for obtaining a similar estimate for non-orientable surfaces. In the present paper we formalize their argument and improve the bounds stated in~\cite{LY}.
A Resource-Efficient Feature Extraction Framework for Image Processing in IoT Devices

Extracting features from image data on Internet of Things (IoT) devices to reduce the amount of data that needs to be uploaded to cloud/edge servers has received increasing attention. However, most of the existing related approaches suffer from two major limitations, (i) low performance and high network traffic, and (ii) a lot of storage resource consumption. To this end, we propose a resource-efficient feature extraction framework for image processing in IoT devices. The proposed framework consists of the edge-assisted extractor generation method and the NestE method. The extractor generated by the edge-assisted extractor generation method can extract the features required by the application, which can not only avoid the IoT device uploading useless feature data but also improve application performance. The proposed NestE generates a nonredundant subextractor by splitting the extractor into multiple subextractors, removing redundant subextractors, and nesting small-capacity subextractors in large-capacity subextractors in a parameter-sharing manner. Compared with deploying multiple independent subextractors on IoT devices, deploying the nonredundant multifunctional extractor can save considerable storage resources and switching overhead. Extensive experimental results show that the proposed framework reduces the storage footprint by approximately 90.7% and switching overhead by approximately 92.4% compared with deploying independent subextractors when using the classical principal component analysis algorithm.
Symmetric rank one updating from partial spectrum with an application to out-of-sample extension

Rank-one updating of the spectrum of a matrix is fundamental in classical perturbation theory. In this paper, we suggest an updating method for a case where only partial spectrum is available. This scenario is ubiquitous in many modern applications that involve big matrices. One particular application is the extension of the top eigenvectors of the graph Laplacian to a new data sample. Each extension is then modeled as a perturbation problem and is solved by updating the leading eigenpairs. We provide a theoretical analysis of the error for such approximation approach, and back it up with empirical results that illustrate the advantages of our method.
Smooth linearization of nonautonomous difference equations with a nonuniform dichotomy

There have been obtained many results on smooth linearization for diffeomorphisms, those results cannot be simply applied to nonautonomous difference equations. In this paper we investigate $$C^1$$C1 smooth linearization for nonautonomous difference equations with a nonuniform strong exponential dichotomy. Reducing the linear part of the nonautonomous system, defined by a sequence of invertible linear operators on $$\mathbb {R}^d$$Rd, to a bounded linear operator on a Banach space, we discuss the spectrum and its spectral gaps. Then we obtain a gap condition for $$C^1$$C1 linearization of such a nonautonomous difference equation. We finally extend the result to the infinite dimensional case. Our theorems improve known results even in the case of uniform strong exponential dichotomies.
Exploring Handwritten Signature Image Features for Hardware Security

This paper presents a novel hardware security technique that leverages handwritten signature image features for securing intellectual property (IP) cores, such as digital signal processing (DSP) cores, against IP piracy and false claim of IP ownership threats. In our approach, an IP vendor's handwritten signature image features are first converted into a corresponding digital template, followed by mapping into hardware security constraints and implanting them into the design during high level synthesis (HLS) process. This paper presents methodologies of extracting feature set of a handwritten signature through sampling and of encoding of the samples into binary values using a tree based encoding, for generating the digital template. The results of the proposed approach are assessed in terms of strength of IP ownership proof, security against a forged signature and impact of embedding signature constraints on design cost. The results revealed that the proposed approach provides robust security at negligible design cost overhead and also outperforms state of the art hardware security approaches for DSP cores.
Fluid limit of a heavily loaded EDF queue with impatient customers

In this paper we present the fluid limit of an heavily loaded Earliest Deadline First queue with impatient customers, represented by a measure-valued process keeping track of residual time-credits of lost and waiting customers. This fluid limit is the solution of an integrated transport equation. We then use this fluid limit to derive fluid approximations of the processes counting the number of waiting and already lost customers.
Size Ramsey numbers of stars versus cliques

The size Ramsey number rˆ(G,H) of two graphs G and H is the smallest integer m such that there exists a graph F on m edges with the property that every red‐blue colouring of the edges of F yields a red copy of G or a blue copy of H . In 1981, Erdős observed that rˆ(K1,k,K3)≤2k+12−k2 and he conjectured that this upper bound on rˆ(K1,k,K3) is sharp. In 1983, Faudree and Sheehan extended this conjecture as follows: rˆ(K1,k,Kn)={(k(n−1)+12)−(k2),k≥norkodd,(k(n−1)+12)−k(n−1)∕2otherwise. They proved the case k=2 . In 2001, Pikhurko showed that this conjecture is not true for n=3 and k≥5 , by disproving the mentioned conjecture of Erdős. Here, we prove Faudree and Sheehan's conjecture for a given k≥2 and n≥k3+2k2+2k .
Sliding control for single-degree-of-freedom fractional oscillators

This paper proposes fractional sliding control designs for single-degree-of-freedom fractional oscillators respectively of the Kelvin-Voigt type, the modified Kelvin-Voigt type and D\"{u}ffing type, whose dynamical behaviors are described by second-order differential equations involving fractional derivatives. Firstly, the differential equations of motion are transformed into non-commensurate fractional state equations by introducing state variables with physical significance. Secondly, fractional sliding manifolds are constructed and stability of the corresponding sliding dynamics is addressed via the infinite state approach and Lyapunov stability theory. Thirdly, sliding control laws and adaptive sliding laws are designed for fractional oscillators respectively in cases that the bound of the external exciting force is known or unknown. Finally, numerical simulations are carried out to validate the above control designs.
Speed of random walks, isoperimetry and compression of finitely generated groups

We give a solution to the inverse problem (given a function, find a corresponding group) for large classes of speed, entropy, isoperimetric profile, return probability and $L_p$-compression functions of finitely generated groups of exponential volume growth. For smaller classes, we give solutions among solvable groups. As corollaries, we prove a recent conjecture of Amir on joint evaluation of speed and entropy exponents and we obtain a new proof of the existence of uncountably many pairwise non-quasi-isometric solvable groups, originally due to Cornulier and Tessera. We also obtain a formula relating the $L_p$-compression exponent of a group and its wreath product with the cyclic group for $p$ in $[1,2]$.
Ideal Liouville Domains, a cool gadget

Liouville domains have become central objects in symplectic and contact geometry. However, the auxiliary data they involve --- namely, Liouville forms --- and the non-compactness of their completions generate some inconvenience. The notion of ideal Liouville domains is designed to suppress these awkward aspects and to let symplectic structures play the leading role. Ideal Liouville domains are compact manifolds with boundary whose interior carries a symplectic form satisfying some tameness condition along the boundary. Their definition and their basic properties are presented in the first part of these notes, while the second part discusses their relevance in contact geometry.
The number of maximal torsion cosets in subvarieties of tori

Abstract We present sharp bounds on the number of maximal torsion cosets in a subvariety of the complex algebraic torus 𝔾 m n {\mathbb{G}_{\mathrm{m}}^{n}} . Our first main result gives a bound in terms of the degree of the defining polynomials. We also give a bound for the number of isolated torsion point, that is maximal torsion cosets of dimension 0, in terms of the volume of the Newton polytope of the defining polynomials. This result proves the conjectures of Ruppert and of Aliev and Smyth on the number of isolated torsion points of a hypersurface. These conjectures bound this number in terms of the multidegree and the volume of the Newton polytope of a polynomial defining the hypersurface, respectively.
U(N) coherent states for loop quantum gravity

We investigate the geometry of the space of N-valent SU(2) intertwiners. We propose a new set of holomorphic operators acting on this space and a new set of coherent states which are covariant under U(N) transformations. These states are labeled by elements of the Grassmannian GrN, 2, they possess a direct geometrical interpretation in terms of framed polyhedra and are shown to be related to the well-known coherent intertwiners.
A mathematical and experimental study on iron rings formation in porous stones.

In this interdisciplinary paper, we study the formation of iron precipitates - the so-called Liesegang rings - in Lecce stones in contact with iron source. These phenomena are responsible of exterior damages of lapideous artifacts, but also in the weakening of their structure. They originate in presence of water, determining the flow of carbonate compunds mixing with the iron ions and then, after a sequence of reactions and precipitation, leading to the formation of Liesegang rings. In order to model these phenomena observed in situ and in laboratory experiments, we propose a modification of the classical Keller-Rubinow model and show the results obtained with some numerical simulations, in comparison with the experimental tests. Our model is of interest for a better understanding of damage processes in monumental stones.
Product of expansive Markov maps with hole

We consider product of expansive Markov maps on an interval with hole which is conjugate to a subshift of finite type. For certain class of maps, it is known that the escape rate into a given hole does not just depend on its size but also on its position in the state space. We illustrate this phenomenon for maps considered here. We compare the escape rate into a connected hole and a hole which is a union of holes with a certain property, but have same measure. This gives rise to some interesting combinatorial problems.
Digital Transformation Strategy providing drivers, prioritization, and an assertive planning: an Experience Report of a Business Conglomerate

During the development of a Digital Transformation (DT) Strategic Plan, it should be considered Business drivers, management models, recognized IT methodologies, IT processes and technical/business dimensions. However, human value is so important as the plan because behavioral issues and conflicts of interest could limit or destroy the plan. This paper also discusses project phases and what were the main points emerged. The project enabled discussions and the engagement of IT leaders, respecting points of view and defining priority actions that were materialized in initiatives in DT Strategic Plan. In addition, it was necessary to re-design IT organizational structure with roles and responsibilities to support DT Strategic Plan.
Extremal Positive Semidefinite Matrices for Graphs without $K_5$ Minors

For a graph $G$ with $p$ vertices the closed convex cone $\mathbb{S}^p_{\succeq0}(G)$ consists of all real positive semidefinite $p\times p$ matrices with zeros in the off-diagonal entries corresponding to nonedges of $G$. The extremal rays of this cone and their associated ranks have applications to matrix completion problems, maximum likelihood estimation in Gaussian graphical models in statistics, and Gauss elimination for sparse matrices. For a graph $G$ without $K_5$ minors, we show that the normal vectors to the facets of the $(\pm1)$-cut polytope of $G$ specify the off-diagonal entries of extremal matrices in $\mathbb{S}^p_{\succeq0}(G)$. We also prove that the constant term of the linear equation of each facet-supporting hyperplane is the rank of its corresponding extremal matrix in $\mathbb{S}^p_{\succeq0}(G)$. Furthermore, we show that if $G$ is series-parallel then this gives a complete characterization of all possible extremal ranks of $\mathbb{S}^p_{\succeq0}(G)$, consequently solving the sparsity order problem for series-parallel graphs.