2,227 research outputs found

    Undergraduate Catalog of Studies, 2023-2024

    Get PDF

    Exploiting Structural Properties in the Analysis of High-dimensional Dynamical Systems

    Get PDF
    The physical and cyber domains with which we interact are filled with high-dimensional dynamical systems. In machine learning, for instance, the evolution of overparametrized neural networks can be seen as a dynamical system. In networked systems, numerous agents or nodes dynamically interact with each other. A deep understanding of these systems can enable us to predict their behavior, identify potential pitfalls, and devise effective solutions for optimal outcomes. In this dissertation, we will discuss two classes of high-dimensional dynamical systems with specific structural properties that aid in understanding their dynamic behavior. In the first scenario, we consider the training dynamics of multi-layer neural networks. The high dimensionality comes from overparametrization: a typical network has a large depth and hidden layer width. We are interested in the following question regarding convergence: Do network weights converge to an equilibrium point corresponding to a global minimum of our training loss, and how fast is the convergence rate? The key to those questions is the symmetry of the weights, a critical property induced by the multi-layer architecture. Such symmetry leads to a set of time-invariant quantities, called weight imbalance, that restrict the training trajectory to a low-dimensional manifold defined by the weight initialization. A tailored convergence analysis is developed over this low-dimensional manifold, showing improved rate bounds for several multi-layer network models studied in the literature, leading to novel characterizations of the effect of weight imbalance on the convergence rate. In the second scenario, we consider large-scale networked systems with multiple weakly-connected groups. Such a multi-cluster structure leads to a time-scale separation between the fast intra-group interaction due to high intra-group connectivity, and the slow inter-group oscillation, due to the weak inter-group connection. We develop a novel frequency-domain network coherence analysis that captures both the coherent behavior within each group, and the dynamical interaction between groups, leading to a structure-preserving model-reduction methodology for large-scale dynamic networks with multiple clusters under general node dynamics assumptions

    Graduate Catalog of Studies, 2023-2024

    Get PDF

    A foundation for synthesising programming language semantics

    Get PDF
    Programming or scripting languages used in real-world systems are seldom designed with a formal semantics in mind from the outset. Therefore, the first step for developing well-founded analysis tools for these systems is to reverse-engineer a formal semantics. This can take months or years of effort. Could we automate this process, at least partially? Though desirable, automatically reverse-engineering semantics rules from an implementation is very challenging, as found by Krishnamurthi, Lerner and Elberty. They propose automatically learning desugaring translation rules, mapping the language whose semantics we seek to a simplified, core version, whose semantics are much easier to write. The present thesis contains an analysis of their challenge, as well as the first steps towards a solution. Scaling methods with the size of the language is very difficult due to state space explosion, so this thesis proposes an incremental approach to learning the translation rules. I present a formalisation that both clarifies the informal description of the challenge by Krishnamurthi et al, and re-formulates the problem, shifting the focus to the conditions for incremental learning. The central definition of the new formalisation is the desugaring extension problem, i.e. extending a set of established translation rules by synthesising new ones. In a synthesis algorithm, the choice of search space is important and non-trivial, as it needs to strike a good balance between expressiveness and efficiency. The rest of the thesis focuses on defining search spaces for translation rules via typing rules. Two prerequisites are required for comparing search spaces. The first is a series of benchmarks, a set of source and target languages equipped with intended translation rules between them. The second is an enumerative synthesis algorithm for efficiently enumerating typed programs. I show how algebraic enumeration techniques can be applied to enumerating well-typed translation rules, and discuss the properties expected from a type system for ensuring that typed programs be efficiently enumerable. The thesis presents and empirically evaluates two search spaces. A baseline search space yields the first practical solution to the challenge. The second search space is based on a natural heuristic for translation rules, limiting the usage of variables so that they are used exactly once. I present a linear type system designed to efficiently enumerate translation rules, where this heuristic is enforced. Through informal analysis and empirical comparison to the baseline, I then show that using linear types can speed up the synthesis of translation rules by an order of magnitude

    Undergraduate Catalog of Studies, 2023-2024

    Get PDF

    Probabilistic Programming Interfaces for Random Graphs::Markov Categories, Graphons, and Nominal Sets

    Get PDF
    We study semantic models of probabilistic programming languages over graphs, and establish a connection to graphons from graph theory and combinatorics. We show that every well-behaved equational theory for our graph probabilistic programming language corresponds to a graphon, and conversely, every graphon arises in this way.We provide three constructions for showing that every graphon arises from an equational theory. The first is an abstract construction, using Markov categories and monoidal indeterminates. The second and third are more concrete. The second is in terms of traditional measure theoretic probability, which covers 'black-and-white' graphons. The third is in terms of probability monads on the nominal sets of Gabbay and Pitts. Specifically, we use a variation of nominal sets induced by the theory of graphs, which covers Erdős-Rényi graphons. In this way, we build new models of graph probabilistic programming from graphons

    Graduate Catalog of Studies, 2023-2024

    Get PDF

    Classical and quantum algorithms for scaling problems

    Get PDF
    This thesis is concerned with scaling problems, which have a plethora of connections to different areas of mathematics, physics and computer science. Although many structural aspects of these problems are understood by now, we only know how to solve them efficiently in special cases.We give new algorithms for non-commutative scaling problems with complexity guarantees that match the prior state of the art. To this end, we extend the well-known (self-concordance based) interior-point method (IPM) framework to Riemannian manifolds, motivated by its success in the commutative setting. Moreover, the IPM framework does not obviously suffer from the same obstructions to efficiency as previous methods. It also yields the first high-precision algorithms for other natural geometric problems in non-positive curvature.For the (commutative) problems of matrix scaling and balancing, we show that quantum algorithms can outperform the (already very efficient) state-of-the-art classical algorithms. Their time complexity can be sublinear in the input size; in certain parameter regimes they are also optimal, whereas in others we show no quantum speedup over the classical methods is possible. Along the way, we provide improvements over the long-standing state of the art for searching for all marked elements in a list, and computing the sum of a list of numbers.We identify a new application in the context of tensor networks for quantum many-body physics. We define a computable canonical form for uniform projected entangled pair states (as the solution to a scaling problem), circumventing previously known undecidability results. We also show, by characterizing the invariant polynomials, that the canonical form is determined by evaluating the tensor network contractions on networks of bounded size

    LIPIcs, Volume 251, ITCS 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 251, ITCS 2023, Complete Volum

    MECHANICAL ENERGY HARVESTER FOR POWERING RFID SYSTEMS COMPONENTS: MODELING, ANALYSIS, OPTIMIZATION AND DESIGN

    Get PDF
    Finding alternative power sources has been an important topic of study worldwide. It is vital to find substitutes for finite fossil fuels. Such substitutes may be termed renewable energy sources and infinite supplies. Such limitless sources are derived from ambient energy like wind energy, solar energy, sea waves energy; on the other hand, smart cities megaprojects have been receiving enormous amounts of funding to transition our lives into smart lives. Smart cities heavily rely on smart devices and electronics, which utilize small amounts of energy to run. Using batteries as the power source for such smart devices imposes environmental and labor cost issues. Moreover, in many cases, smart devices are in hard-to-access places, making accessibility for disposal and replacement difficult. Finally, battery waste harms the environment. To overcome these issues, vibration-based energy harvesters have been proposed and implemented. Vibration-based energy harvesters convert the dynamic or kinetic energy which is generated due to the motion of an object into electric energy. Energy transduction mechanisms can be delivered based on piezoelectric, electromagnetic, or electrostatic methods; the piezoelectric method is generally preferred to the other methods, particularly if the frequency fluctuations are considerable. In response, piezoelectric vibration-based energy harvesters (PVEHs), have been modeled and analyzed widely. However, there are two challenges with PVEH: the maximum amount of extractable voltage and the effective (operational) frequency bandwidth are often insufficient. In this dissertation, a new type of integrated multiple system comprised of a cantilever and spring-oscillator is proposed to improve and develop the performance of the energy harvester in terms of extractable voltage and effective frequency bandwidth. The new energy harvester model is proposed to supply sufficient energy to power low-power electronic devices like RFID components. Due to the temperature fluctuations, the thermal effect over the performance of the harvester is initially studied. To alter the resonance frequency of the harvester structure, a rotating element system is considered and analyzed. In the analytical-numerical analysis, Hamilton’s principle along with Galerkin’s decomposition approach are adopted to derive the governing equations of the harvester motion and corresponding electric circuit. It is observed that integration of the spring-oscillator subsystem alters the boundary condition of the cantilever and subsequently reforms the resulting characteristic equation into a more complicated nonlinear transcendental equation. To find the resonance frequencies, this equation is solved numerically in MATLAB. It is observed that the inertial effects of the oscillator rendered to the cantilever via the restoring force effects of the spring significantly alter vibrational features of the harvester. Finally, the voltage frequency response function is analytically and numerically derived in a closed-from expression. Variations in parameter values enable the designer to mutate resonance frequencies and mode shape functions as desired. This is particularly important, since the generated energy from a PVEH is significant only if the excitation frequency coming from an external source matches the resonance (natural) frequency of the harvester structure. In subsequent sections of this work, the oscillator mass and spring stiffness are considered as the design parameters to maximize the harvestable voltage and effective frequency bandwidth, respectively. For the optimization, a genetic algorithm is adopted to find the optimal values. Since the voltage frequency response function cannot be implemented in a computer algorithm script, a suitable function approximator (regressor) is designed using fuzzy logic and neural networks. The voltage function requires manual assistance to find the resonance frequency and cannot be done automatically using computer algorithms. Specifically, to apply the numerical root-solver, one needs to manually provide the solver with an initial guess. Such an estimation is accomplished using a plot of the characteristic equation along with human visual inference. Thus, the entire process cannot be automated. Moreover, the voltage function encompasses several coefficients making the process computationally expensive. Thus, training a supervised machine learning regressor is essential. The trained regressor using adaptive-neuro-fuzzy-inference-system (ANFIS) is utilized in the genetic optimization procedure. The optimization problem is implemented, first to find the maximum voltage and second to find the maximum widened effective frequency bandwidth, which yields the optimal oscillator mass value along with the optimal spring stiffness value. As there is often no control over the external excitation frequency, it is helpful to design an adaptive energy harvester. This means that, considering a specific given value of the excitation frequency, energy harvester system parameters (oscillator mass and spring stiffness) need to be adjusted so that the resulting natural (resonance) frequency of the system aligns with the given excitation frequency. To do so, the given excitation frequency value is considered as the input and the system parameters are assumed as outputs which are estimated via the neural network fuzzy logic regressor. Finally, an experimental setup is implemented for a simple pure cantilever energy harvester triggered by impact excitations. Unlike the theoretical section, the experimental excitation is considered to be an impact excitation, which is a random process. The rationale for this is that, in the real world, the external source is a random trigger. Harmonic base excitations used in the theoretical chapters are to assess the performance of the energy harvester per standard criteria. To evaluate the performance of a proposed energy harvester model, the input excitation type consists of harmonic base triggers. In summary, this dissertation discusses several case studies and addresses key issues in the design of optimized piezoelectric vibration-based energy harvesters (PVEHs). First, an advanced model of the integrated systems is presented with equation derivations. Second, the proposed model is decomposed and analyzed in terms of mechanical and electrical frequency response functions. To do so, analytic-numeric methods are adopted. Later, influential parameters of the integrated system are detected. Then the proposed model is optimized with respect to the two vital criteria of maximum amount of extractable voltage and widened effective (operational) frequency bandwidth. Corresponding design (influential) parameters are found using neural network fuzzy logic along with genetic optimization algorithms, i.e., a soft computing method. The accuracy of the trained integrated algorithms is verified using the analytical-numerical closed-form expression of the voltage function. Then, an adaptive piezoelectric vibration-based energy harvester (PVEH) is designed. This final design pertains to the cases where the excitation (driving) frequency is given and constant, so the desired goal is to match the natural frequency of the system with the given driving frequency. In this response, a regressor using neural network fuzzy logic is designed to find the proper design parameters. Finally, the experimental setup is implemented and tested to report the maximum voltage harvested in each test execution
    • …
    corecore