361 research outputs found

    Redundancy in nonlinear systems: A set covering approach.

    Get PDF
    In this thesis we present Boneh\u27s Set Covering (SC) approach to the redundancy detection problem, and we show that his approach is also applicable to the related problem of finding a Prime Representation (PR), an Irreducible Infeasible System (IIS) or a Minimal Infeasible System (MIS). In order to generate the SC matrix E, we need a probabilistic method for sampling points in Rn. Consequently we can assign a detection probability to each row of E, and we show that if a row of E has a zero detection probability, then it must correspond to what we call a local quasi-minimizer We show that convex systems have no such local quasi-minimizers.Dept. of Economics, Mathematics, and Statistics. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis1999 .F46. Source: Masters Abstracts International, Volume: 39-02, page: 0516. Adviser: Richard J. Caron. Thesis (M.Sc.)--University of Windsor (Canada), 1999

    Hardware/software partitioning algorithm based on the combination of genetic algorithm and tabu search

    Get PDF
    To solve the hardware/software (HW/SW) partitioning problem of a single Central Processing Unit (CPU) system, a hybrid algorithm of Genetic Algorithm (GA) and Tabu Search(TS) is studied. Firstly, the concept hardware orientation is proposed and then used in creating the initial colony of GA and the mutation, which reduces the randomicity of initial colony and the blindness of search. Secondly, GA is run, the crossover and mutation probability become smaller in the process of GA, thus they not only ensure a big search space in the early stages, but also save the good solution for later browsing. Finally, the result of GA is used as initial solution of TS, and tabu length adaptive method is put forward in the process of TS, which can improve the convergence speed. From experimental statistics, the efficiency of proposed algorithm outperforms comparison algorithm by up to 25% in a large-scale problem, what is more, it can obtain a better solution. In conclusion, under specific conditions, the proposed algorithm has higher efficiency and can get better solutions

    A Monte Carlo Study of Erraticity Behavior in Nucleus-Nucleus Collisions at High Energies

    Get PDF
    It is demonstrated using Monte Carlo simulation that in different nucleus-nucleus collision samples, the increase of the fluctuation of event factorial moments with decreasing phase space scale, called erraticity, is still dominated by the statistical fluctuations. This result does not depend on the Monte Carlo models. Nor does it depend on the concrete conditions, e.g. the collision energy, the mass of colliding nuclei, the cut of phase space, etc.. This means that the erraticity method is sensitive to the appearance of novel physics in the central collisions of heavy nuclei.Comment: 9 pages, 4 figures (in eps form

    Hardware/software partitioning algorithm based on the combination of genetic algorithm and tabu search

    Get PDF
    To solve the hardware/software (HW/SW) partitioning problem of a single Central Processing Unit (CPU) system, a hybrid algorithm of Genetic Algorithm (GA) and Tabu Search(TS) is studied. Firstly, the concept hardware orientation is proposed and then used in creating the initial colony of GA and the mutation, which reduces the randomicity of initial colony and the blindness of search. Secondly, GA is run, the crossover and mutation probability become smaller in the process of GA, thus they not only ensure a big search space in the early stages, but also save the good solution for later browsing. Finally, the result of GA is used as initial solution of TS, and tabu length adaptive method is put forward in the process of TS, which can improve the convergence speed. From experimental statistics, the efficiency of proposed algorithm outperforms comparison algorithm by up to 25% in a large-scale problem, what is more, it can obtain a better solution. In conclusion, under specific conditions, the proposed algorithm has higher efficiency and can get better solutions

    Automatic Deduction Path Learning via Reinforcement Learning with Environmental Correction

    Full text link
    Automatic bill payment is an important part of business operations in fintech companies. The practice of deduction was mainly based on the total amount or heuristic search by dividing the bill into smaller parts to deduct as much as possible. This article proposes an end-to-end approach of automatically learning the optimal deduction paths (deduction amount in order), which reduces the cost of manual path design and maximizes the amount of successful deduction. Specifically, in view of the large search space of the paths and the extreme sparsity of historical successful deduction records, we propose a deep hierarchical reinforcement learning approach which abstracts the action into a two-level hierarchical space: an upper agent that determines the number of steps of deductions each day and a lower agent that decides the amount of deduction at each step. In such a way, the action space is structured via prior knowledge and the exploration space is reduced. Moreover, the inherited information incompleteness of the business makes the environment just partially observable. To be precise, the deducted amounts indicate merely the lower bounds of the available account balance. To this end, we formulate the problem as a partially observable Markov decision problem (POMDP) and employ an environment correction algorithm based on the characteristics of the business. In the world's largest electronic payment business, we have verified the effectiveness of this scheme offline and deployed it online to serve millions of users

    Exponential Cluster Synchronization of Neural Networks with Proportional Delays

    Get PDF
    Exponential cluster synchronization of neural networks with proportional delays is studied in this paper. Unlike previous constant delay or bounded time delay, we consider the time-varying proportional delay is unbounded, less conservative, and more widely applied. Furthermore, we designed a novel adaptive controller based on Lyapunov function and inequality technique to achieve exponential cluster synchronization for neural networks and by using a unique way of equivalent system we proved the main conclusions. Finally, an example is given to illustrate the effectiveness of our proposed method

    Notch signaling regulates adipose browning and energy metabolism

    Get PDF
    Beige adipocytes in white adipose tissue (WAT) are similar to classical brown adipocytes in that they can burn lipids to produce heat. Thus, an increase in beige adipocyte content in WAT browning would raise energy expenditure and reduce adiposity. Here we report that adipose-specific inactivation of Notch1 or its signaling mediator Rbpj in mice results in browning of WAT and elevated expression of uncoupling protein 1 (Ucp1), a key regulator of thermogenesis. Consequently, as compared to wild-type mice, Notch mutants exhibit elevated energy expenditure, better glucose tolerance and improved insulin sensitivity and are more resistant to high fat diet-induced obesity. By contrast, adipose-specific activation of Notch1 leads to the opposite phenotypes. At the molecular level, constitutive activation of Notch signaling inhibits, whereas Notch inhibition induces, Ppargc1a and Prdm16 transcription in white adipocytes. Notably, pharmacological inhibition of Notch signaling in obese mice ameliorates obesity, reduces blood glucose and increases Ucp1 expression in white fat. Therefore, Notch signaling may be therapeutically targeted to treat obesity and type 2 diabetes
    corecore