Miracle-dz/UniFAR-FTUs huggingface dataset:
On the Split Delivery Vehicle Routing Problem Based on Python

This paper studies the split delivery vehicle routing problem (SDVRP) with single depot, single type of vehicle, without windows, loading-unloading. Then, the three subscript mathematical model of SDVRP is established. In this paper, we adopt natural number to code, generates the initial solution randomly, take fit(i)=l/zi×100 as fitness function, take p(i) as the selection probability, and adopt reciprocal exchange mutation as the variation operation. We call the geatpy library encapsulated in Python to cross, and use partial mapping cross PMX, and the called method is named xovpm, and we use 50 generations of the maximum evolutionary generation as the termination condition. Compared with three cases, the advantages of this genetic algorithm (GA) are verified, and this GA shows that the split strategy can provide a new idea for distribution service.
Spatial-Temporal Transformer for Crime Recognition in Surveillance Videos

Human-related crime recognition from surveillance videos becomes an even more challenging task when dealing with relatively similar human actions. We propose a transformer-based model that relies on the spatial-temporal representation of extracted skeletal trajectories for fine-grained classification. We validate the effectiveness of our model on the complex HR-Crime dataset consisting of videos representing 13 categories of human-related crimes. Quantitative and qualitative results suggest that building a transformer architecture with coupled spatial and temporal modules enables the model to compete in performance while improving intrinsic interpretability.
Survey on Integrated Vehicular Platforms for Next Generation Mobility

The vehicle is becoming a computing platform rather than mechanical machinery. Vehicles are now being equipped with advanced electronic functions such as autonomous driving, in-vehicle infortainment (IVI), and driver assistant systems together with communication capabilities. To this end, studies on open platforms for vehicles to resolve dependencies between vehicle software and hardware have been actively conducted. In this paper, we first investigate the research on representative vehicle operating systems and software platforms, Automotive Open System Architecture (AUTOSAR) and Connected Vehicle Systems Alliance (COVESA). We review academic research pa-pers published by major academic publishers and categorize them according to their purposes. We also investigate recent research trends on open vehicle platforms by major automobile companies and research institutes to provide insight into future directions for next-generation mobility.
Downlink Secrecy Rate Maximization for IRS-Aided Cell-Free Massive MIMO Networks: Analysis and Deep Learning Design

In this paper, we study to maximize the downlink secrecy rate for IRS-Aided Cell-Free Massive MIMO (CF-mMIMO) networks. Particularly, firstly, we derive the signal to interference plus noise ratio (SINR) at users and the eavesdropper to obtain the downlink achievable secrecy rate of an attacked user. Then, we propose an optimization problem to maximize the downlink achievable secrecy rate of the attacked user. Secondly, we propose a mathematical analysis and deep learning methods to solve the optimization problem. Finally, the simulation results show that the secrecy rate is significantly improved compared to the conventional CF-mMIMO. Moreover, the approximate results of the mathematical analysis and the deep learning method mean that the deep learning method can replace the mathematical analysis method to save computational costs.
Ballistic Timing of Smiles is Robust to Context, Gender, Ethnicity, and National Differences

Smiles are highly variable. In some, contraction of the orbicularis oculi raises the cheeks and amplifies their intensity. In others, smile controls counteract the oblique pull of the zygomatic major, alter their shape, and decrease their intensity. Despite this variability, some features appear to be stereotypic. These features include a high correlation between the amplitude and velocity of smile onsets and same for smile offsets. The larger a smile's amplitude, the greater its velocity. This dependence is referred to as ballistic timing. In two relatively large publicly available databases (EB+ and Belfast), we tested the hypothesis of ballistic timing of smile onsets and offsets. We found high and consistent non-linear correlations between amplitude and velocity of both onsets and offsets that were robust to individual differences in persons (gender and ethnicity), context, presence or absence of the Duchenne marker, and country of residence (United States, Ireland, Peru). All $R_{2}$ exceeded 0.85. The findings were highly consistent with ballistic timing. They have implications for detecting smiles that may be posed (which have been found to violate ballistic timing) and for realistic synthesis of smiles in social robots and virtual humans. Smiles that depart from ballistic timing are likely to be perceived as false or uncanny.
Monitoring sea pollution using wireless QCM-based sensors

Nowadays, the availability of systems able to measure the pollution level in environments such as the sea and the coasts is of paramount importance in order to improve the quality of life and to prevent health issues. In this paper, a novel embedded system aimed to measure the level of pollutants in the sea water is presented. The system exploits QCM (Quartz Crystal Microbalance) in order to generate an electric signal whose frequency is a function of the concentration of the chemical agent. The frequency of the electric signal is measured using a frequency estimation algorithm that is so lightweight that it can be run even on a low-cost Internet of Things platform. Measures are sent to a remote unit using LoRaWAN, a wireless technology that supports low power wide area network communications. In this paper, a first prototype is described and preliminary experimental results are reported.
Dynamics of Noncommutative Solitons II: Spectral Theory, Dispersive Estimates and Stability

We consider the Schr\"odinger equation with a (matrix) Hamiltonian given by a second order difference operator with nonconstant growing coefficients, on the half one dimensional lattice. This operator appeared first naturally in the construction and dynamics of noncommutative solitons in the context of noncommutative field theory. We completely determine the spectrum of the Hamiltonian linearized around a ground state soliton and prove the optimal decay rate of $t^{-1}\log^{-2}t$ for the associated time decay estimate. We use a novel technique involving generating functions of orthogonal polynomials to achieve this estimate.
Performance Evaluation of OCW Control Algorithm in IEEE 802.11ax Networks

IEEE 802.11 standard develops novel medium access control (MAC) protocol called orthogonal frequency division multiple access (OFDMA) in IEEE 802.11ax. The OFDMA divides channel into many resource unit (RUs). The nodes transmit the data packet using the RUs at the same time in the OFDMA MAC protocol. Especially, the random access (RA) can use in uplink. The nodes generate OFDMA backoff (OBO) counter in OFDMA contention windows (OCW) value to access the channel. However, the OCW value is fixed value. If the number of nodes increases, collision rate increase too. As a result, the network performance decrease. Thus, if the access point (AP) can control OCW value according to exact the number of nodes, the network performance increases. However, it is difficult to the AP estimates exact the number of nodes without overhead. Therefore, we propose the OCW control algorithm without overhead. The AP estimates the number of nodes using states of RUs and controls OCW value according to the estimated nodes. Simulation results show that the performance of proposed algorithm outperforms that of the conventional algorithm. Also, the performance of the proposed algorithm is almost same that of the ideal algorithm.
Thresholds for vanishing of ‘Isolated’ faces in random Čech and Vietoris–Rips complexes

We study combinatorial connectivity for two models of random geometric complexes. These two models - \v{C}ech and Vietoris-Rips complexes - are built on a homogeneous Poisson point process of intensity $n$ on a $d$-dimensional torus using balls of radius $r_n$. In the former, the $k$-simplices/faces are formed by subsets of $(k+1)$ Poisson points such that the balls of radius $r_n$ centred at these points have a mutual interesection and in the latter, we require only a pairwise intersection of the balls. Given a (simplicial) complex (i.e., a collection of $k$-simplices for all $k \geq 1$), we can connect $k$-simplices via $(k+1)$-simplices (`up-connectivity') or via $(k-1)$-simplices (`down-connectivity). Our interest is to understand these two combinatorial notions of connectivity for the random \v{C}ech and Vietoris-Rips complexes asymptically as $n \to \infty$. In particular, we analyse in detail the threshold radius for vanishing of isolated $k$-faces for up and down connectivity of both types of random geometric complexes. Though it is expected that the threshold radius $r_n = \Theta((\frac{\log n}{n})^{1/d})$ in coarse scale, our results give tighter bounds on the constants in the logarithmic scale as well as shed light on the possible second-order correction factors. Further, they also reveal interesting differences between the phase transition in the \v{C}ech and Vietoris-Rips cases. The analysis is interesting due to the non-monotonicity of the number of isolated $k$-faces (as a function of the radius) and leads one to consider `monotonic' vanishing of isolated $k$-faces. The latter coincides with the vanishing threshold mentioned above at a coarse scale (i.e., $\log n$ scale) but differs in the $\log \log n$ scale for the \v{C}ech complex with $k = 1$ in the up-connected case.
Tunable negative refraction in a two-dimensional active magneto-optical photonic crystal

A two-dimensional square photonic crystal (PC) with magnetically active semiconductor constituents, for example GaAs, is proposed to realize tunable negative refractions. By the Voigt effect, the magnetic-dependent permittivity of the semiconductor, then PC's band structure and equifrequency surface could be tuned by an external magnetic field. Taking a real model into consideration with absorption, the calculation reveals that the refraction could be manipulated from positive to negative, and then to positive by the applied fields. With the tunable negative refraction, tunable superlenses with all angle negative refraction could be established by a relatively small magnetic field $(0.262--0.315\phantom{\rule{0.3em}{0ex}}\mathrm{T})$, which might lead to great potential applications in photoelectronic devices.
A Note on the Sub-Optimality of Rank Ordering of Objects on the Basis of the Leading Principal Component Factor Scores

This paper demonstrates that if we intend to optimally rank order n objects (candidates) each of which has m attributes or rank scores awarded by m evaluators, then the ordinal ranking of objects by the conventional principal component based factor scores turns out to be suboptimal. Three numerical examples have been provided to show that principal component based rankings do not necessarily maximize the sum of squared correlation coefficients between the individual m rank scores arrays, X(n,m), and overall rank scores array, Z(n).
$r$-strongly vertex-distinguishing total coloring of graphs

Inspired by the phenomenon of co-channel interference in communication network, a novel graph parameter, called $r$-vertex-strongly-distinguishing total coloring (abbreviate as $D(r)$-VSDTC), is proposed in this paper. Given a graph $G$, an $r$-VSDTC is an assignment of $k$ colors to $V(G)\cup E(G)$ such that any two adjacent or incident elements receive different colors and any two vertices with distance at most $r$ have distinct color-set, where the color-set of a vertex $u$ is the set of colors assigned on $u$ and its neighborhoods and incident edges. The \emph{$r$-vertex-strongly-distinguishing total chromatic number} of $G$, denoted by $\chi_{r-vsdt}(G)$, is the minimum integer $k$ for which $G$ admits a $k$-$D(r)$-VSDTC. We show that $\chi_{1-vsdt}(G)\leq 4\Delta(G)$ for every graph $G$ without isolated edges and $\chi_{1-vsdt}(G)\le k\Delta(G)+3$ for a $k$-degenerated graph $G$ without isolated edges, where $1\le k\le 3$.
Poisson convergence on the free Poisson algebra

Based on recent findings by Bourguin and Peccati, we give a fourth moment type condition for an element of a free Poisson chaos of arbitrary order to converge to a free (centered) Poisson distribution. We also show that free Poisson chaos of order strictly greater than one do not contain any non-zero free Poisson random variables. We are also able to give a sufficient and necessary condition for an element of the first free Poisson chaos to have a free Poisson distribution. Finally, depending on the parity of the considered free Poisson chaos, we provide a general counterexample to the naive universality of the semicircular Wigner chaos established by Deya and Nourdin as well as a transfer principle between the Wigner and the free Poisson chaos.
On the rate of convergence to the asymptotic cone for nilpotent groups and subFinsler geometry

Addressing a question of Gromov, we give a rate in Pansu’s theorem about the convergence to the asymptotic cone of a finitely generated nilpotent group equipped with a left-invariant word metric rescaled by a factor . We obtain a convergence rate (measured in the Gromov–Hausdorff metric) of for nilpotent groups of class and for nilpotent groups of class 2. We also show that the latter result is sharp, and we make a connection between this sharpness and the presence of so-called abnormal geodesics in the asymptotic cone. As a corollary, we get an error term of the form for the volume of Cayley balls of a general nilpotent group of class r. We also state a number of related conjectural statements.
Sutured Floer homology and invariants of Legendrian and transverse knots

Using contact-geometric techniques and sutured Floer homology, we present an alternate formulation of the minus and plus version of knot Floer homology. We further show how natural constructions in the realm of contact geometry give rise to much of the formal structure relating the various versions of Heegaard Floer homology. In addition, to a Legendrian or transverse knot K in a contact manifold (Y,\xi), we associate distinguished classes EHL(K) in the minus-version of knot floer homology and EHIL(K) in the plus version, which are each invariant under Legendrian or transverse isotopies of K. The distinguished class EHL is shown to agree with the Legendrian/transverse invariant defined by Lisca, Ozsvath, Stipsicz, and Szabo despite a strikingly dissimilar definition. While our definitions and constructions only involve sutured Floer homology and contact geometry, the identification of our invariants with known invariants uses bordered sutured Floer homology to make explicit computations of maps between sutured Floer homology groups.
Sobolev spaces on locally compact abelian groups

Motivated by a class of nonlinear equations of interest for string theory, we introduce Sobolev spaces on arbitrary locally compact abelian groups and we examine some of their properties. Specifically, we focus on analogs of the Sobolev embedding and Rellich- Kondrachov compactness theorems. As an application, we prove the existence of continuous solutions to a generalized euclidean bosonic string equation possed on an arbitrary compact abelian group.
Factors Affecting the Adoption of Big Data Analytics in Hotels

Constant changes in the technological environment and the growth of digital transformation are forcing hotels to develop technological capabilities and invest more in information and communication technologies to keep pace with the competition. Therefore, Big Data Analytics (BDA) adoption is required to better predict the future, make accurate and efficient decisions, maximize the efficacy and success of the organization, gain a competitive advantage, improve market performance, improve the quality of decisions, etc. As BDA adoption brings wide-ranging benefits to hotels, it is crucial to investigate the factors that influence it. Therefore, this research examines the impact of three different types of capabilities (i.e., infrastructure, human resources, and management capabilities) and data-driven culture on BDA adoption. Besides, it investigates the effect of BDA adoption on the operational and economic performance of hotels. To achieve these objectives, 168 questionnaire forms were distributed to IT department staff (IT managers, assistant IT managers, and IT engineers) in the 28 five-star hotels in Greater Cairo representing the entire population in the study. A total of 135 usable questionnaire forms were received, with a response rate of 80.3 percent. To analyze these forms, descriptive, correlation, and multiple regression analyses were used. The findings revealed that the three types of BDA capabilities as well as the data-driven culture were found to positively influence BDA adoption. In addition, the results showed that BDA adoption has a positive impact on the two hotel performance dimensions (operational and economic). Therefore, hotel practitioners are recommended to improve IT infrastructure through its maintenance and update. Also, they should provide various types of training (e.g., lectures, role play, and workshops) to their IT staff to enhance their capabilities to use BDA applications.
Research on 3D fiber orientation distribution in arbitrary planar flows

A non-stretchable fiber rotation in planar flows has been solved. The fiber will rotate periodically or run to the asymptotical direction decided by a discriminant defined in the paper involving the fiber aspect ratio and the flow characteristics. Subsequently the fiber orientation distribution is derived directly without the bother of solving the Fokker-Planck equation. The research clearly indicates the overall configuration of a fiber rotation movement in planar flows.
On the few products, many sums problem

We prove new results on additive properties of finite sets $A$ with small multiplicative doubling $|AA|\leq M|A|$ in the category of real/complex sets as well as multiplicative subgroups in the prime residue field. The improvements are based on new combinatorial lemmata, which may be of independent interest. Our main results are the inequality $$ |A-A|^3|AA|^5 \gtrsim |A|^{10}, $$ over the reals, "redistributing" the exponents in the textbook Elekes sum-product inequality and the new best known additive energy bound $\mathsf E(A)\lesssim_M |A|^{49/20}$, which aligns, in a sense to be discussed, with the best known sum set bound $|A+A|\gtrsim_M |A|^{8/5}$. These bounds, with $M=1$, also apply to multiplicative subgroups of $\mathbb F^\times_p$, whose order is $O(\sqrt{p})$. We adapt the above energy bound to larger subgroups and obtain new bounds on gaps between elements in cosets of subgroups of order $\Omega(\sqrt{p})$.
Cloud Trails Past the Lesser Antilles

AbstractObservations and cloud-resolving simulations of elongated cloud plumes (or “cloud trails”) past the Lesser Antilles islands in the Caribbean Sea are presented. Analysis of one year of visible satellite images reveals that each island forms cloud trails on 30%–40% of days, typically in the afternoon in response to diurnal island heating. On around 10% of days the cloud bands are very well organized, with lengths of and durations of min. Radiosonde analysis suggests that the well-organized events are favored by moderate-to-strong trade winds (6–10 m s−1) and stronger trade inversions. The simulated cloud trails, which are consistent with observations in their morphology and diurnal cycle, are organized by quasi-linear bands of thermally forced convergence within the heated island wake. They are sensitive to overland surface fluxes, inversion strength and height, terrain height, and trade-wind speed. While surface fluxes control the strength of the wake thermal circulations, the inversion controls pr.
A multilevel approach towards unbiased sampling of random elliptic partial differential equations

Abstract Partial differential equations are powerful tools for used to characterizing various physical systems. In practice, measurement errors are often present and probability models are employed to account for such uncertainties. In this paper we present a Monte Carlo scheme that yields unbiased estimators for expectations of random elliptic partial differential equations. This algorithm combines a multilevel Monte Carlo method (Giles (2008)) and a randomization scheme proposed by Rhee and Glynn (2012), (2013). Furthermore, to obtain an estimator with both finite variance and finite expected computational cost, we employ higher-order approximations.
On the global rigidity of sphere packings on $3$-dimensional manifolds

In this paper, we prove the global rigidity of sphere packings on 3-dimensional manifolds. This is a 3-dimensional analogue of the rigidity theorem of Andreev-Thurston and was conjectured by Cooper and Rivin. We also prove a global rigidity result using a combinatorial scalar curvature introduced by Ge and the author.
Algorithms For Piecewise Linear Knapsack Problems With Applications In Electronic Commerce

Knapsack problems are among the most intensively studied NP-hard combinatorial optimization problems. The applications of these problems span a wide canvas from industrial applications and financial management to electronic commerce and personal health-care. The common flavor in most of these problems is resource allocation. The allocation of a specific amount of a single resource among competitive alternatives is often modeled as a knapsack problem or its variants. In nonlinear knapsack problems (also called nonlinear resource allocation problems), there are multiple units of each item and the cost of inclusion varies nonlinearly with the number of units. This thesis is an investigation on a nonlinear resource allocation problem with non-convex and piecewise linear cost structure, called as the piecewise linear knapsack problem (PLKP). Such a cost structure is motivated and inspired by major applications in electronic commerce and electronic business, in particular, electronic procurement. The thesis first deals with modeling and solving of the PLKP in detail, followed by modeling and solving of the bid evaluation problem in three representative procurement settings. The thesis is divided into three parts. The problem PLKP is introduced in Part 1. In this part, the PLKP is modeled as a mixed integer linear programming problem. The standard textbook models for modeling piecewise linear cost structure are presented followed by two new proposals: precedence constrained knapsack model (PCKM) and multiple choice knapsack model (MCKM). The proposed models PCKM and MCKM are explored for exploitable substructures to develop algorithms. Designing of algorithms for the PLKP is dealt with in detail in Part 2. The algorithms include heuristics based on greedy techniques, knapsack structure, linear programming relaxation, and Lagrangian relaxation; exact algorithms based on dynamic programming, branch-and-bound technique, and Benders’ decomposition; and a 2-approximation algorithm and a fully polynomial time approximation scheme. In Part 3, three different representative procurement scenarios, in which the PLKP is a subproblem, are considered. Modeling and solving of the bid evaluation problem in the three procurement scenarios are discussed using the algorithms and approaches discussed in Part 2.