OpenRaiser/Intern-Atlas huggingface dataset:
Enhancing CryptoGuards Deployability for Continuous Software Security Scanning
Venue: arXiv cs.CR 2021
Year: 2021

The increasing development speed via Agile may introduce overlooked security steps in the process, with an example being the Iowa Caucus application. Verifying the protection of confidential information such as social security numbers requires security at all levels, providing protection through any connected applications. CryptoGuard is a static code analyzer for Java. This program verifies that developers do not leave vulnerabilities in their applications. The program aids the developer by identifying cryptographic misuses such as hard-coded keys, weak program hashes, and using insecure protocols. In my Master's thesis work, I made several important contributions to improving the deployability, accessibility, and usability of CryptoGuard. I extended CryptoGuard to scan source and compiled code, created live documentation, and supported a dual cloud and local tool-suite. I also created build tool plugins and a program aid for CryptoGuard. In addition, I also analyzed several Java-related surveys encompassing more than 50,000 developers and reported interesting current practices of real-world software developers.
Energy-Efficient Techniques for UAVs in Communication-based Applications
Venue: arXiv cs.NI 2021
Year: 2021

Unmanned Aerial Vehicles (UAVs), which are at the forefront of cutting-edge technology, have unmatched potential for pioneering applications in a wide range of disciplines. In particular, in the field of cognitive radio (CR), which is a key aspect in the implementation of the new 5G telecommunication technology. The integration between the drone and CR consolidates the drone's capabilities at the heart of the remarkably promising Internet-of-Things (IoT) technology supported by CR. The highly dynamic network topologies, weakly networked communication links, reliable line-of-sight (LOS) communication links, and orbital or flight paths are characteristic features of UAV communication compared to terrestrial wireless networks. Nevertheless, the implementation of this system is constrained by several severe challenges, such as energy efficiency, battery power limitation, spectrum handover, propagation channel modeling, routing protocols, security policy, and delay setbacks. In this paper, we consider the impact of energy scarcity faced by the UAV in various CR applications. We also analyze the impact of energy scarcity on communication-based applications and present the general problem of battery limitation. Finally, we give an overview and comparison between recent solutions proposed by researchers both in the field of communication and based on batteries and consider possible future directions according to the state of the art, such as novel Graph Signal Processing (GSP) and machine learning (ML).
Serverless Architecture for Bulk Email Management
Venue: arXiv cs.DC 2021
Year: 2021

Sending emails in large quantities can be tedious considering free services do not cover bulk email and paid services can be costly and are not easy to customize. Traditional email client used for basic emailing services fail to be useful in larger volumes of emails to target people or spread information to consented individuals. This paper proposes a serverless architecture to tackle such problems by using one such offering from the Amazon Web Services(AWS) API which can be easily replaced by a software architects choice of service. The constraints help to make an architecture using components that can fit most of the needs of a serverless backend and extend it to scenarios such mobile notifications, One Time Password (OTP) systems or other means of communication to minimize single point of failure and also decrease the dependency on physical servers for such operations offering a comparable solution within the cloud. The architecture proposed is tested to find the time taken to send the emails of various quantities and see how it affects the cost. The architecture was successful able to send multiple emails in a quick and single invocation and has demonstrated a higher level of scalability compared to conventional methods.
Survey on some optimization possibilities for data plane applications
Venue: arXiv cs.NI 2021
Year: 2021

By programming both the data plane and the control plane, network operators can customize their networks based on their needs, regardless of the hardware manufacturer. Control plane programming, a major component of the SDN (Software Defined Network) concept, has been developed for more than 10 years and successfully implemented in real networks. Efforts to develop reconfigurable data planes and high-level network programming languages make it truly possible to program data planes. Therefore, the programmable data planes and SDNs offer great flexibility in network customization, allowing many innovations to be introduced on the network. The general focus of research on the data plane is data-plane abstractions, languages and compilers, data plane algorithms, and applications. This paper outlines some emerging applications on the data plane and offers opportunities for further improvement and optimization.
Enhancing Performance of Cloud-based Software Applications with GraalVM and Quarkus
Venue: arXiv cs.DC 2021
Year: 2021

Increased complexity of network-based software solutions and the ever-rising number of concurrent users forced a shift of the IT industry to cloud computing. Conventional network software systems commonly based on monolithic application stack running on costly physical single-purpose servers are affected by significant problems of resource management, computing power distribution, and scalability.Such implementation is restricting applications to be reduced to smaller, independent services that can be more easily deployed, managed, and scaled dynamically; therefore, embellishing environmental uniformity across development, testing, and production. Current cloud-based infrastructure frequently runs on containers placed in Kubernetes or Docker-based cluster, and the system configuration is considerably different compared to the environment prevailed with common virtualizations. This paper discusses the usage of GraalVM, a polyglot high-performance virtual machine for JVM-based and other languages, combined with new Kubernetes native Java tailored stacked framework named Quarkus, formed from enhanced Java libraries. Moreover, our research explores GraalVMs creation of native images using Ahead-Of-Time (AOT) compilation and Quarkus deployment to Kubernetes. Furthermore, we examined the architectures of given systems, various performance variables, and differing memory usage cases within our academic testing environment and presented the comparison results of selected performance measures with other traditional and contemporary solutions
Recognising the overlap graphs of subtrees of restricted trees is hard
Venue: arXiv cs.CC 2021
Year: 2021

The overlap graphs of subtrees in a tree (SOGs) generalise many other graphs classes with set representation characterisations. The complexity of recognising SOGs in open. The complexities of recognising many subclasses of SOGs are known. We consider several subclasses of SOGs by restricting the underlying tree. For a fixed integer $k \geq 3$, we consider: \begin{my_itemize} \item The overlap graphs of subtrees in a tree where that tree has $k$ leaves \item The overlap graphs of subtrees in trees that can be derived from a given input tree by subdivision and have at least 3 leaves \item The overlap and intersection graphs of paths in a tree where that tree has maximum degree $k$ \end{my_itemize} We show that the recognition problems of these classes are NP-complete. For all other parameters we get circle graphs, well known to be polynomially recognizable.
A Survey about application based on RF signals
Venue: arXiv cs.NI 2021
Year: 2021

With the popularity of commercial wireless devices, the research based on RF signal has developed rapidly in the past decade. RF signals have great advantages in environmental perception. Wireless signals are transmitted through the transmitter. With the propagation of these signals in the medium, they are reflected from different objects and people in space to the receiver. In this process, rich environmental perception information is carried. These ubiquitous perceptual information has rich application significance and bright prospects in the fields of indoor positioning, motion perception, behavior recognition, human-computer interaction, fall detection, health monitoring, smart home, search and rescue and so on. This paper will discuss and analyze the current research results by combing some existing literature and the research status of relevant researchers in relevant fields at this stage, so as to understand the future development trend of RF signal based applications.
Introduction to Semi-discrete Calculus
Venue: arXiv cs.DM 2022
Year: 2022

The Infinitesimal Calculus explores mainly two measurements: the instantaneous rates of change and the accumulation of quantities. This work shows that scientists, engineers, mathematicians, and teachers increasingly apply another change measurements tool: functions' local trends. While it seems to be a special case of the rate (via the derivative sign), this work proposes a separate and favorable mathematical framework for the trend, called Semi-discrete Calculus.
A low multiplicative complexity fast recursive DCT-2 algorithm
Venue: arXiv cs.IT 2022
Year: 2022

A fast Discrete Cosine Transform (DCT) algorithm is introduced that can be of particular interest in image processing. The main features of the algorithm are regularity of the graph and very low arithmetic complexity. The 16-point version of the algorithm requires only 32 multiplications and 81 additions. The computational core of the algorithm consists of only 17 nontrivial multiplications, the rest 15 are scaling factors that can be compensated in the post-processing. The derivation of the algorithm is based on the algebraic signal processing theory (ASP). MATLAB implementation of the algorithm can be found in the public repository https://github.com/Mak-Sim/Fast_recursive_DCT.
A New Chase-type Soft-decision Decoding Algorithm for Reed-Solomon Codes
Venue: arXiv cs.IT 2022
Year: 2022

A new Chase-type soft-decision decoding algorithm for Reed-Solomon codes is proposed, referred to as tree-based Chase-type algorithm}. The proposed tree-based Chase-type algorithm takes the set of all vectors as the set of testing patterns, and hence definitely delivers the most-likely codeword provided that the computational resources are allowed. All the testing patterns are arranged in an ordered rooted tree according to the likelihood bounds of the possibly generated codewords, which is an extension of Wu and Pados' method from binary into $q$-ary linear block codes. While performing the algorithm, the ordered rooted tree is constructed progressively by adding at most two leafs at each trial. The ordered tree naturally induces a sufficient condition for the most-likely codeword. That is, whenever the tree-based Chase-type algorithm exits before a preset maximum number of trials is reached, the output codeword must be the most-likely one. But, in fact, the algorithm can be terminated by setting a discrepancy threshold instead of a maximum number of trials. When the tree-based Chase-type algorithm is combined with Guruswami-Sudan (GS) algorithm, each trial can be implement in an extremely simple way by removing from the gradually updated Grobner basis one old point and interpolating one new point. Simulation results show that the tree-based Chase-type algorithm performs better than the recently proposed Chase-type algorithm by Bellorado et al with less trials (on average) given that the maximum number of trials is the same.
Non-Elementary Complexities for Branching VASS, MELL, and Extensions
Venue: arXiv cs.LO 2022
Year: 2022

We study the complexity of reachability problems on branching extensions of vector addition systems, which allows us to derive new non-elementary complexity bounds for fragments and variants of propositional linear logic. We show that provability in the multiplicative exponential fragment is Tower-hard already in the affine case -- and hence non-elementary. We match this lower bound for the full propositional affine linear logic, proving its Tower-completeness. We also show that provability in propositional contractive linear logic is Ackermann-complete.
Fully Dynamic All Pairs All Shortest Paths
Venue: arXiv cs.DS 2022
Year: 2022

We consider the all pairs all shortest paths (APASP) problem, which maintains all of the multiple shortest paths for every vertex pair in a directed graph $G=(V,E)$ with a positive real weight on each edge. We present two fully dynamic algorithms for this problem in which an update supports either weight increases or weight decreases on a subset of edges incident to a vertex. Our first algorithm runs in amortized $O({ν^*}^2 \cdot \log^3 n)$ time per update, where $n = |V|$, and $ν^*$ bounds the number of edges that lie on shortest paths through any single vertex. Our APASP algorithm leads to the same amortized bound for the fully dynamic computation of betweenness centrality (BC), which is a parameter widely used in the analysis of large complex networks. Our method is a generalization and a variant of the fully dynamic algorithm of Demetrescu and Italiano [DI04] for unique shortest path, and it builds on our recent decremental APASP [NPR14]. Our second (faster) algorithm reduces the amortized cost per operation by a logarithmic factor, and uses new data structures and techniques that are extensions of methods in a fully dynamic algorithm by Thorup.
Bias vs structure of polynomials in large fields, and applications in information theory
Venue: arXiv cs.DM 2022
Year: 2022

Let $f$ be a polynomial of degree $d$ in $n$ variables over a finite field $\mathbb{F}$. The polynomial is said to be unbiased if the distribution of $f(x)$ for a uniform input $x \in \mathbb{F}^n$ is close to the uniform distribution over $\mathbb{F}$, and is called biased otherwise. The polynomial is said to have low rank if it can be expressed as a composition of a few lower degree polynomials. Green and Tao [Contrib. Discrete Math 2009] and Kaufman and Lovett [FOCS 2008] showed that bias implies low rank for fixed degree polynomials over fixed prime fields. This lies at the heart of many tools in higher order Fourier analysis. In this work, we extend this result to all prime fields (of size possibly growing with $n$). We also provide a generalization to nonprime fields in the large characteristic case. However, we state all our applications in the prime field setting for the sake of simplicity of presentation. Using the above generalization to large fields as a starting point, we are also able to settle the list decoding radius of fixed degree Reed-Muller codes over growing fields. The case of fixed size fields was solved by Bhowmick and Lovett [STOC 2015], which resolved a conjecture of Gopalan-Klivans-Zuckerman [STOC 2008]. Here, we show that the list decoding radius is equal the minimum distance of the code for all fixed degrees, even when the field size is possibly growing with $n$. Additionally, we effectively resolve the weight distribution problem for Reed-Muller codes of fixed degree over all fields, first raised in 1977 in the classic textbook by MacWilliams and Sloane [Research Problem 15.1 in Theory of Error Correcting Codes].
The Square Root Agreement Rule for Incentivizing Truthful Feedback on Online Platforms
Venue: arXiv cs.GT 2022
Year: 2022

A major challenge in obtaining evaluations of products or services on e-commerce platforms is eliciting informative responses in the absence of verifiability. This paper proposes the Square Root Agreement Rule (SRA): a simple reward mechanism that incentivizes truthful responses to objective evaluations on such platforms. In this mechanism, an agent gets a reward for an evaluation only if her answer matches that of her peer, where this reward is inversely proportional to a popularity index of the answer. This index is defined to be the square root of the empirical frequency at which any two agents performing the same evaluation agree on the particular answer across evaluations of similar entities operating on the platform. Rarely agreed-upon answers thus earn a higher reward than answers for which agreements are relatively more common. We show that in the many tasks regime, the truthful equilibrium under SRA is strictly payoff-dominant across large classes of natural equilibria that could arise in these settings, thus increasing the likelihood of its adoption. While there exist other mechanisms achieving such guarantees, they either impose additional assumptions on the response distribution that are not generally satisfied for objective evaluations or they incentivize truthful behavior only if each agent performs a prohibitively large number of evaluations and commits to using the same strategy for each evaluation. SRA is the first known incentive mechanism satisfying such guarantees without imposing any such requirements. Moreover, our empirical findings demonstrate the robustness of the incentive properties of SRA in the presence of mild subjectivity or observational biases in the responses. These properties make SRA uniquely attractive for administering reward-based incentive schemes (e.g., rebates, discounts, reputation scores, etc.) on online platforms.
Random-Cluster Dynamics in $\mathbb{Z}^2$
Venue: arXiv cs.DM 2022
Year: 2022

The random-cluster model has been widely studied as a unifying framework for random graphs, spin systems and electrical networks, but its dynamics have so far largely resisted analysis. In this paper we analyze the Glauber dynamics of the random-cluster model in the canonical case where the underlying graph is an $n \times n$ box in the Cartesian lattice $\mathbb{Z}^2$. Our main result is a $O(n^2\log n)$ upper bound for the mixing time at all values of the model parameter $p$ except the critical point $p=p_c(q)$, and for all values of the second model parameter $q\ge 1$. We also provide a matching lower bound proving that our result is tight. Our analysis takes as its starting point the recent breakthrough by Beffara and Duminil-Copin on the location of the random-cluster phase transition in $\mathbb{Z}^2$. It is reminiscent of similar results for spin systems such as the Ising and Potts models, but requires the reworking of several standard tools in the context of the random-cluster model, which is not a spin system in the usual sense.
Recommendations for the Technical Infrastructure for Standardized International Rights Statements
Venue: arXiv cs.DL 2022
Year: 2022

This white paper is the product of a joint Digital Public Library of America (DPLA)-Europeana working group organized to develop minimum rights statement metadata standards for organizations that contribute to DPLA and Europeana. This white paper deals specifically with the technical infrastructure of a common namespace (rightsstatements.org) that hosts the rights statements to be used by (at minimum) the DPLA and Europeana. These recommendations for a common technical infrastructure for rights statements outline a simple, flexible, and extensible framework to host the rights statements at rightsstatements.org. This white paper specifically outlines the management of rights statements as linked open data. The rights statements are published according to Best Practices for Publishing RDF Vocabularies. They are encoded into dereferenceable URIs, express further information encoded in RDF, and link to existing vocabularies and standards. The rights statements adhere to expressions of existing rights vocabularies. Furthermore the paper reviews the publication and implementation to make the rights statements available through human-readable web pages augmented with machine-readable formats.
Modified Weibull distribution for Biomedical signals denoising
Venue: arXiv cs.CV 2022
Year: 2022

A wide range of signs are acquired from the human body called Biomedical signs or biosignals, they can be at the cell level, organ level, or sub-atomic level. Electroencephalogramis the electrical activity from the cerebrum, the electrocardiogram is the electrical activity from the heart, electrical action from the muscle sound signals referred to as electromyogram, the electroretinogram from the eye, and so on. Studying these signals can be so helpful for doctors, it can help them examine and predict and cure many diseases.
Progressive Neural Networks
Venue: arXiv cs.LG 2022
Year: 2022

Learning to solve complex sequences of tasks--while both leveraging transfer and avoiding catastrophic forgetting--remains a key obstacle to achieving human-level intelligence. The progressive networks approach represents a step forward in this direction: they are immune to forgetting and can leverage prior knowledge via lateral connections to previously learned features. We evaluate this architecture extensively on a wide variety of reinforcement learning tasks (Atari and 3D maze games), and show that it outperforms common baselines based on pretraining and finetuning. Using a novel sensitivity measure, we demonstrate that transfer occurs at both low-level sensory and high-level control layers of the learned policy.
Error-Sensitive Proof-Labeling Schemes
Venue: arXiv cs.DC 2022
Year: 2022

Proof-labeling schemes are known mechanisms providing nodes of networks with certificates that can be verified locally by distributed algorithms. Given a boolean predicate on network states, such schemes enable to check whether the predicate is satisfied by the actual state of the network, by having nodes interacting with their neighbors only. Proof-labeling schemes are typically designed for enforcing fault-tolerance, by making sure that if the current state of the network is illegal with respect to some given predicate, then at least one node will detect it. Such a node can raise an alarm, or launch a recovery procedure enabling the system to return to a legal state. In this paper, we introduce error-sensitive proof-labeling schemes. These are proof-labeling schemes which guarantee that the number of nodes detecting illegal states is linearly proportional to the edit-distance between the current state and the set of legal states. By using error-sensitive proof-labeling schemes, states which are far from satisfying the predicate will be detected by many nodes, enabling fast return to legality. We provide a structural characterization of the set of boolean predicates on network states for which there exist error-sensitive proof-labeling schemes. This characterization allows us to show that classical predicates such as, e.g., acyclicity, and leader admit error-sensitive proof-labeling schemes, while others like regular subgraphs don't. We also focus on compact error-sensitive proof-labeling schemes. In particular, we show that the known proof-labeling schemes for spanning tree and minimum spanning tree, using certificates on $O(\log n)$ bits, and on $O\left(\log^2n\right)$ bits, respectively, are error-sensitive, as long as the trees are locally represented by adjacency lists, and not just by parent pointers.