Miracle-dz/UniFAR-FTUs huggingface dataset:
Reinforcement Learning-Based Optimization Framework for Application Component Migration in NFV Cloud-Fog Environments

By decoupling network functions from the underlying hardware, Network Function Virtualization (NFV) allows application components to be implemented as sets of Virtual Network Functions (VNFs) chained in a specific order, represented by VNF-Forwarding Graphs (VNF-FG). Fog computing is instrumental to tap into the full potential of NFV by deploying VNFs in close proximity to end-users, thus decreasing the latency significantly. However, the mobility of end-users and the fog nodes, and the limited fog nodes coverage results in service discontinuity and may increase application delay. Application component migration offers great potential to address this issue. In this paper, we propose a component migration strategy in an NFV-based hybrid cloud/fog system considering the mobility of both end-users and fog nodes. We use the Gauss-Markov mobility model and a random walk mobility model for fog nodes and end-user devices, respectively. We modeled the problem mathematically, which minimizes the aggregated weighted function of application delay and cost. However, considering the mobility of both end-users and fog nodes makes the problem quite complex. Hence, we propose a Deep Reinforcement Learning (DRL) approach to decide where and when to migrate application components and to achieve rapid decision-making. Simulation results demonstrate that the proposed scheme performs well. It offers favorable convergence and outperforms existing algorithms in terms of application delay and migration costs.
A Survey on Matching Theory for Distributed Computation Offloading in IoT-Fog-Cloud Systems: Perspectives and Open Issues

Fog computing has been widely integrated in the IoT-based systems, creating IoT-Fog- Cloud (IFC) systems to improve the system performances and satisfy the quality of services (QoS) and quality of experience (QoE) requirements for the end users (EUs). This improvement is enabled by computational offloading schemes, which perform the task computation nearby the task generation sources (i.e., IoT devices, EUs) on behalf of remote cloud servers. To realize the benefits of offloading techniques, however, there is a need to incorporate efficient resource allocation frameworks, which can deal effectively with intrinsic properties of computing environment in the IFC systems such as resource heterogeneity of computing devices, various requirements of computation tasks, high task request rates, and so on. While the centralize optimization and non-cooperative game theory based solutions are applicable in a certain number of application scenarios, they fail to be efficient in many of cases, where the global information and control might be unavailable or cost-intensive to achieve it in the large-scale systems. The need of distributed computational offloading algorithms with low computation complexity has motivated a surge of solutions using matching theory. In the present review, we first describe the fundamental concept of this emerging tool enabling the distributed implementation in the computing environment. Then the key solution concepts and algorithmic implementations proposed in the framework of literature are highlighted and discussed. Given the powerful tool of matching theory, its full capability is still unexplored and unexploited in the literature. We thereby discover and discuss existing challenges and corresponding solutions that the matching theory can be applied to resolve them. Furthermore, new problems and open issues for application scenarios of modern IFC systems are also investigated thoroughly.
Engineering Grammar-Based Type Checking for Graph Rewriting Languages

The ability to handle evolving graph structures is important both for programming languages and modeling languages. Of various languages that adopt graphs as primary data structures, a graph rewriting language LMNtal provides features of both (concurrent) programming languages and modeling languages, and its implementation unifies ordinary program execution and model checking functionalities. Unlike pointer manipulation in imperative languages, LMNtal allows us to manipulate graph structures in such a way that the well-formedness of graphs is guaranteed by the language itself. However, since the shapes of graphs can be complex and diverse compared to algebraic data structures such as lists and trees, it is a non-obvious important task to formulate types of graphs to verify individual programs. With this motivation, this paper discusses LMNtal ShapeType, a type checking framework that applies the basic idea of Structured Gamma to a concrete graph rewriting language. Types are defined by generative grammars written as LMNtal rules, and type checking of LMNtal programs can accordingly be done by exploiting the model checking features of LMNtal itself. We gave a full implementation of type checking exploiting the features of the LMNtal meta-interpreter and confirmed that it works for practical operations on various graph structures, including single-step and multi-step operations on non-algebraic data structures and data structures with numerical shape constraints.
Nonlocal quantum gravity and M-theory

The particle-field limit of string field theory (SFT) and the properties of its gravity sector are territories still subject to exploration. Having assumed that one has integrated out all massive degrees of freedom of string theory, what is the form of the resulting massless quantum field theory and what are its ultraviolet (UV) properties? To give a definite answer to such a question, one should calculate an effective Wilsonian action for the massless fields. The form of the action should then be fixed by deriving an exact renormalization-group equation that determines the explicit cutoff dependence of the infinite set of terms. In particular, one possibility would be to take the Batalin–Vilkovisky equation rigorously obtained in string field theory [1, 2] and reduce its solution to an exact Wilsonian action for the massless fields. This challenge is rather demanding from a technical point of view and, to the best of our knowledge, still unaccepted. However, to see the type of result one might expect to obtain, we follow a different path. In this paper, we explore the possibility to achieve a super-renormalizable theory of gravity in ten dimensions capable of capturing the main properties of effective string field theory. In this respect, and to summarize the steps of the strategy employed here, we will start from a class of nonlocal quantum-gravity models that are independent of string theory. These models have generic but well-behaved (in a sense made precise below) form factors, i.e., nonlocal covariant operators with an infinite number of derivatives. The next step is to fix such form factors uniquely by requiring the linearized action for the graviton to match that of string field theory. The result is a ten-dimensional field theory for gravity which is proposed to describe simultaneously the nonlinear (in the metric) extension of the closed-SFT effective nonlocal action for the graviton and the nonlocal extension
GLOBAL ATTRACTOR FOR WEAKLY DAMPED, FORCED mKdV EQUATION BELOW ENERGY SPACE

We prove the existence of the global attractor in ${\dot{H}}^{s}$, $s>11/12$ for the weakly damped and forced mKdV on the one-dimensional torus. The existence of global attractor below the energy space has not been known, though the global well-posedness below the energy space has been established. We directly apply the $I$-method to the damped and forced mKdV, because the Miura transformation does not work for the mKdV with damping and forcing terms. We need to make a close investigation into the trilinear estimates involving resonant frequencies, which are different from the bilinear estimates corresponding to the KdV.
A gene subset requires CTCF bookmarking during the fast post‐mitotic reactivation of mouse ES cells

Mitosis leads to global downregulation of transcription that then needs to be efficiently resumed. In somatic cells, this is mediated by a transient hyper‐active state that first reactivates housekeeping and then cell identity genes. Here, we show that mouse embryonic stem cells, which display rapid cell cycles and spend little time in G1, also display accelerated reactivation dynamics. This uniquely fast global reactivation lacks specificity towards functional gene families, enabling the restoration of all regulatory functions before DNA replication. Genes displaying the fastest reactivation are bound by CTCF, a mitotic bookmarking transcription factor. In spite of this, the post‐mitotic global burst is robust and largely insensitive to CTCF depletion. There are, however, around 350 genes that respond to CTCF depletion rapidly after mitotic exit. Remarkably, these are characterised by promoter‐proximal mitotic bookmarking by CTCF. We propose that the structure of the cell cycle imposes distinct constrains to post‐mitotic gene reactivation dynamics in different cell types, via mechanisms that are yet to be identified but that can be modulated by mitotic bookmarking factors.
The Effect of Development-induced Displacement on Adivasis: Evidence from the Rourkela Steel Plant Project in India

This paper analyses the long-term impact of displacement by assessing the impoverishment risks among the displaced adivasi population of Rourkela resettled in peri-urban and rural resettlement colonies. The study ascertains that even after six decades of displacement, adivasis in both resettlement colonies continue to face such risks, however, to a different degree according to where they were resettled. Joblessness has been a common risk among them, and it seems central to all other risks. Moreover, the persistence of these impoverishment risks among them is attributed to the violation of constitutional provisions and unfulfilled promises during and post-displacement period.
Oscillations on the Stretched Sierpinski Gasket

The Stretched Sierpinski Gasket is a non-self-similar set but it still exhibits very high symmetry. In an earlier work we calculated the leading term for the eigenvalue counting function for operators coming from resistance forms that were introduced by Alonso-Ruiz, Freiberg and Kigami. In this work we want to refine the results. The next question that arises is if there are oscillations in the leading term which are typical for highly symmetrical fractals. We have to distinguish between the existence of a periodic function in front of the leading term and oscillations in general. The first one is unlikely as we will see, however the second one still holds. This means there are oscillations in the leading term, but these will not have this very strict periodic behaviour that we know of the Sierpinski Gasket. We will show, that there exist localized eigenfunctions on the SSG which have eigenvalues with very high multiplicities. However in contrast to the self-similar case this fact alone is not enough to show that there can't be convergence. We need to use another method to show the existence of oscillations.
Geometric dimension of groups for the family of virtually cyclic subgroups

By studying commensurators of virtually cyclic groups, we prove that every elementary amenable group of finite Hirsch length h and cardinality ℵn admits a finite‐dimensional classifying space with virtually cyclic stabilizers of dimension n+h+2 . We also provide a criterion for groups that fit into an extension with torsion‐free quotient to admit a finite‐dimensional classifying space with virtually cyclic stabilizers. Finally, we exhibit examples of integral linear groups of type F whose geometric dimension for the family of virtually cyclic subgroups is finite but arbitrarily larger than the geometric dimension for proper actions. This answers a question posed by W. Lück.
Lipschitz 1-connectedness for Some Solvable Lie Groups

Abstract A space X is said to be Lipschitz 1-connected if every Lipschitz loop 𝛾 : S 1 → X bounds a O (Lip(𝛾))-Lipschitz disk f : D 2 → X. A Lipschitz 1-connected space admits a quadratic isoperimetric inequality, but it is unknown whether the converse is true. Cornulier and Tessera showed that certain solvable Lie groups have quadratic isoperimetric inequalities, and we extend their result to show that these groups are Lipschitz 1-connected.
Value-Wise ConvNet for Transformer Models: An Infinite Time-Aware Recommender System

Finding the most suitable individual to answer a question using brief content has important usages, including the community of question answering systems and online recommender frameworks. However, one must tackle challenges: Disregarding the indispensable noise in short text contents, authors usually answer the input query with mismatched words that can negatively influence the textual relevance. Moreover, many vocabularies imply various alterations. Finally, not every expert is eager to answer an input query given the time constraint, named the reluctance dilemma. To overcome the challenges, we devise a novel embedding approach that constructs context-aware vectors. We then extract the knowledge domains out of the online contextual content. While we track user textual-temporal behavioral patterns via an infinite continuous-time module, we recommend a set of experts pertinent to the given query and willingly provide the response during the expected time. Experimental results on two real-world datasets of StackOverflow and Yahoo show that our online time-sensitive value-wise transformer can achieve higher effectiveness and efficiency versus other trending rivals in online expert recommendation systems. In addition, we empirically experience that Fourier transformers can automatically infer multi-aspect base signals and overpass manual discrete-time models in obtaining time-specific user profiles.
Some cohomology of finite general linear groups

We prove that the degree $r(2p-3)$ cohomology of any (untwisted) finite group of Lie type over $\mathbb{F}_{p^r}$, with coefficients in characteristic $p$, is nonzero as long as its Coxeter number is at most $p$. We do this by providing a simple explicit construction of a nonzero element. Furthermore, for the groups $GL_n\mathbb{F}_{p^r}$, when $p=2$ or $r=1$, we calculate the cohomology in degree $r(2p-3)$, for all $n$.
A Compact CMOS Broadband Bidirectional Digital Transceiver Frontend With Capacitor Bank and Transformer Matching Network Reuse

This article presents a fully integrated bidirectional class-G digital Doherty switched capacitor transmitter (TX) and N-path Quadrature receiver (RX) in CMOS. Through sharing on-chip capacitor banks, typically occupying a major portion of the digital TX or RX chip area, as well as the RF passive matching networks, the overall size can be radically reduced. Moreover, the overall performance could be further improved by eliminating the need for an integrated T/RX switch and its corresponding loss and area overhead. The class-G operation is used within the Doherty TX to increase the output power and backoff efficiency, while the capacitive stacking technique is used in the RX to increase the voltage gain. A transformer network is used to present the optimum impedance for both the parallel Doherty TX and RX mode of operation, as well as the class-G Doherty active load modulation. As a proof-of-concept, the joint bidirectional class-G digital Doherty switched-capacitor TX and N-path Quadrature RX through capacitor bank sharing is implemented in a 45-nm CMOS SOI process. The TX demonstrates a <inline-formula> <tex-math notation="LaTeX">$\text{P}_{\mathrm {out}}~1$ </tex-math></inline-formula>dB bandwidth (BW) of 1.6-3.1 GHz, a fractional BW >63%, and peak output power (<inline-formula> <tex-math notation="LaTeX">$\text{P}_{\mathrm {out}}$ </tex-math></inline-formula>) of 22.5dBm at 2.4GHz. The peak drain efficiency (DE) of the TX is 49.5% at 1.8GHz and 41.5%/38.7%/31.6%/18.1% for the peak/2.5/6/12dB power back off (PBO) at 2.4GHz. The DE improvement compared to class-B PA is <inline-formula> <tex-math notation="LaTeX">$1.24\times /1.51\times /1.72\times $ </tex-math></inline-formula> at 2.5/6/12dB PBO. The TX is measured using 64-QAM/20MHz modulation without the use of AM-PM pre-distortion or pattern based DPD. It achieves an excellent −27.1dB EVM, −31.31dBc ACLR, 14.6dBm average <inline-formula> <tex-math notation="LaTeX">$\text{P}_{\mathrm {out}}$ </tex-math></inline-formula> and 25.8% average DE at 1.6GHz. The RX achieves a noise figure (NF) of 7.6dB at 2.2GHz and a conversion gain of 17dB with a 12 MHz bandwidth. In addition, the proposed RX front-end achieves <inline-formula> <tex-math notation="LaTeX">$ < -60$ </tex-math></inline-formula> dBm LO leakage over the operating frequency range
Off-the-Shelf Solutions as Potential Cyber Threats to Industrial Environments and Simple-To-Implement Protection Methodology

The paper investigates cyber threats and potential solutions for protecting industrial control systems (ICS). On the cyber threats side, different off-the-shelf offensive solutions, both hardware and software, are analysed and tested. The goal of the paper is to increase cyber threat awareness by showing how such off-the-shelf solutions, well known to IT security experts, can be utilised as (or inspire) attack vectors to gain access to generally unprotected industrial plants. After obtaining an accessing point, Man-in-the-Middle (MITM) and Legal-Client-to-Server (LCSA) types of attacks from reconnaissance, client-to-server and server-to-client categories are demonstrated. For this purpose, a Modbus communication protocol implemented in a real compressor station is used as basis. Regarding potential protection solutions, the paper proposes a simple-to-implement and cheap hardening methodology applicable inside almost any industrial plant. A novel, PLC-based ICS cyber security protection method, made of a signal validity monitoring mechanism and a control system integrity check mechanism is also discussed and demonstrated. Both penetration testing and hardening methodology are verified experimentally, using real PLC and HMI devices.
Dimension towers of SICs. I. Aligned SICs and embedded tight frames

Algebraic number theory relates SIC-POVMs in dimension d > 3 to those in dimension d(d − 2). We define a SIC in dimension d(d − 2) to be aligned to a SIC in dimension d if and only if the squares of the overlap phases in dimension d appear as a subset of the overlap phases in dimension d(d − 2) in a specified way. We give 19 (mostly numerical) examples of aligned SICs. We conjecture that given any SIC in dimension d, there exists an aligned SIC in dimension d(d − 2). In all our examples, the aligned SIC has lower dimensional equiangular tight frames embedded in it. If d is odd so that a natural tensor product structure exists, we prove that the individual vectors in the aligned SIC have a very special entanglement structure, and the existence of the embedded tight frames follows as a theorem. If d − 2 is an odd prime number, we prove that a complete set of mutually unbiased bases can be obtained by reducing an aligned SIC to this dimension.
Direct Modeling of Thermal-Radiation Reception by Antenna in Close Range

In this work, an interesting near-field propagation problem in the microwave radiometer calibration is addressed, which is the antenna reception of thermal radiation from calibration target. Efforts in simultaneously modeling the target and antenna within the same 2-D full-wave scenario are reported. Specifically, the coated pyramids and horn antennas are considered. Based on the incoherent nature of local thermal sources in the coating layer and the fluctuation-dissipation theorem (FDT), the direct modeling of receiving power and further brightness temperature ( $BT$ ) at the antenna waveguide port can be achieved. The direct modeling is then quantified based on the classic concept of antenna reception in an ideal blackbody chamber. Further, it is shown in the results that mutual coupling affects the antenna reception in a fluctuating manner, and the target structural radiation raises the antenna reception in a very close distance. That means, the thermal reception can be affected by both the antenna and target structures in the near field. Also, the Lambertian radiation properties of the coated pyramidal blackbody are clarified in the direct calculated results. This work reveals the complex scenario of close range $BT$ transfer, and opens the possibility of quantitatively modeling it for practical applications with further investigations.
Experimental realization of the Furuta pendulum to emulate the Segway motion

A Laboratory device is designed to emulate the Segway motion, modifying the Furuta pendulum experiment. To copy the person on the Segway transportation unit to the Furuta pendulum, a second pendulum is added to the main one. Using LMI theory, the control objective consists to manipulate the base of the Furuta pendulum according to the inclination of the added pendulum whereas the coupled pendulums are maintained near to theirs upright positions. According to the inclination of the second pendulum, the base will rotate as long as the second pendulum remains inclined, emulating the Segway behavior. The base rotation will depend on the side of the inclination too. Experimental results are offered too (video link: this http URL).
Decomplexification of the Capelli identities and holomorphic factorization

The Capelli identities claim $det(A)det(B) = det(AB+correction)$ for certain matrices with noncommutative entries. They have applications in representation theory and integrable systems. We propose new examples of these identities, constructed according to the following principle. For several known identities for $n$ by $n$ matrices we construct new identity for $2n$ by $2n$ matrices where each element $z$ of the original matrix is substituted by 2x2 matrix of the form $[real(z) ~imag(z); ~ -imag(z) ~ real(z)]$, i.e. we view the original identity as complex valued, while the new identity is its real form (decomplexification). It appears that "decomplexification" affects non-trivially the "correction term". It becomes tridiagonal matrix, in contrast to the diagonal in the classical case. The key result is an extension to the non-commutative setting of the fact that the determinant of the decomplexified matrix is equal to the square module of the determinant of the original matrix (in non-commutative setting the corrections are necessary). The decomplexified Capelli's identities are corollaries of this fact and standard Capelli identities. We also discuss analogs of the Cayley identity; observe that the Capelli determinant coincides with the Duflo image of the standard determinant; give short proof of the Cayley identity via Harish-Chandra's radial part calculation. The main motivation for us is a recent paper by An Huang (arXiv:1102.2657). From our viewpoint his result is a "dequaternionification" of 1 by 1 Capelli identity. Apparently it can be extended to $n$ by $n$ case, but our approach should be somehow modified for this. The paper aims to be accessible and interesting not only for experts. It gives brief review of Capelli identities, applications, their relation with Wick quantization, Duflo map, some open issues, etc.