Search results for "Allocation"
showing 10 items of 538 documents
Solving Graph Coloring Problems Using Learning Automata
2008
The graph coloring problem (GCP) is a widely studied combinatorial optimization problem with numerous applications, including time tabling, frequency assignment, and register allocation. The growing need for more efficient algorithms has led to the development of several GCP solvers. In this paper, we introduce the first GCP solver that is based on Learning Automata (LA). We enhance traditional Random Walk with LA-based learning capability, encoding the GCP as a Boolean satisfiability problem (SAT). Extensive experiments demonstrate that the LA significantly improve the performance of RW, thus laying the foundation for novel LA-based solutions to the GCP.
Optimal Resource Discovery Paths of Gnutella2
2008
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal query paths for the peer-to-peer resource discovery problem. Global knowledge of the topology and the resources from the peer-to-peer network are required as an input to the algorithm. The algorithm provides an objective measure for defining how good local search algorithms are. The performance is evaluated in simulated peer-to-peer scenarios and in the measured Gnutella2 P2P network topology with four local search algorithms: breadth-first search, self-avoiding random walker, highest degree search and Dynamic Query …
E-learning approach of the graph coloring problem applied to register allocation in embedded systems
2016
The main aim of this paper consists in developing an effective e-learning tool, focused on evolutionary algorithms, in order to solve the graph coloring problem. Subsidiary, we apply graph coloring for register allocation in embedded systems. From didactic viewpoint, our tool has benefits in the learning process because it helps students to observe the relationship between the graph coloring problem and CPU registers allocation with the help of four developed modules: the genetic algorithm, the graphical viewer, the interference graph for a C program and a web application which collects the simulation results. All these applications are combined by a graphical interface which allows the use…
Non-cross-linked collagen type I/III materials enhance cell proliferation: in vitro and in vivo evidence
2014
Objective: To analyze Mucograft®(MG), a recently introduced collagen matrix, in vitro and in vivo, and compare it with BioGide®(BG), a well-established collagen membrane, as control. Material and Methods: A detailed analysis of the materials surface and ultra-structure was performed. Cellular growth patterns and proliferation rates of human fibroblasts on MG and BG were analyzed in vitro. In addition, the early tissue reaction of CD-1 mouse to these materials was analyzed by means of histological and histomorphometrical analysis. Results: MG showed a three-fold higher thickness both in dry and wet conditions, when compared to BG. The spongy surface of BG significantly differed from that of …
Influence of respiratory rate and end-expiratory pressure variation on cyclic alveolar recruitment in an experimental lung injury model
2012
Introduction Cyclic alveolar recruitment/derecruitment (R/D) is an important mechanism of ventilator-associated lung injury. In experimental models this process can be measured with high temporal resolution by detection of respiratory-dependent oscillations of the paO2 (ΔpaO2). A previous study showed that end-expiratory collapse can be prevented by an increased respiratory rate in saline-lavaged rabbits. The current study compares the effects of increased positive end-expiratory pressure (PEEP) versus an individually titrated respiratory rate (RRind) on intra-tidal amplitude of Δ paO2 and on average paO2 in saline-lavaged pigs. Methods Acute lung injury was induced by bronchoalveolar lavag…
Multi-label Classification Using Stacked Hierarchical Dirichlet Processes with Reduced Sampling Complexity
2018
Nonparametric topic models based on hierarchical Dirichlet processes (HDPs) allow for the number of topics to be automatically discovered from the data. The computational complexity of standard Gibbs sampling techniques for model training is linear in the number of topics. Recently, it was reduced to be linear in the number of topics per word using a technique called alias sampling combined with Metropolis Hastings (MH) sampling. We propose a different proposal distribution for the MH step based on the observation that distributions on the upper hierarchy level change slower than the document-specific distributions at the lower level. This reduces the sampling complexity, making it linear i…
Online Sparse Collapsed Hybrid Variational-Gibbs Algorithm for Hierarchical Dirichlet Process Topic Models
2017
Topic models for text analysis are most commonly trained using either Gibbs sampling or variational Bayes. Recently, hybrid variational-Gibbs algorithms have been found to combine the best of both worlds. Variational algorithms are fast to converge and more efficient for inference on new documents. Gibbs sampling enables sparse updates since each token is only associated with one topic instead of a distribution over all topics. Additionally, Gibbs sampling is unbiased. Although Gibbs sampling takes longer to converge, it is guaranteed to arrive at the true posterior after infinitely many iterations. By combining the two methods it is possible to reduce the bias of variational methods while …
Using Topic Modeling Methods for Short-Text Data: A Comparative Analysis
2020
With the growth of online social network platforms and applications, large amounts of textual user-generated content are created daily in the form of comments, reviews, and short-text messages. As a result, users often find it challenging to discover useful information or more on the topic being discussed from such content. Machine learning and natural language processing algorithms are used to analyze the massive amount of textual social media data available online, including topic modeling techniques that have gained popularity in recent years. This paper investigates the topic modeling subject and its common application areas, methods, and tools. Also, we examine and compare five frequen…
Real-time transmission over Switched Ethernet using a contracts based framework
2009
Switched Ethernet is being used for real time transmissions in industrial automation more and and more. Most modern industrial switches are equipped with mechanisms to deal with time predictability. However, real-time transmission not only requires these mechanisms, but also the proper policies for managing network resources. This paper proposes the use of contracts. A contract is a set of transmission specifications which are negotiated between the applications and the run-time support. They define the application workload and the required performance guarantees. We implement contracts for real-time streaming as an extension of FRESCOR (Framework for Real-time Embedded Systems based on COn…
Accelerated Bayesian learning for decentralized two-armed bandit based decision making with applications to the Goore Game
2012
Published version of an article in the journal: Applied Intelligence. Also available from the publisher at: http://dx.doi.org/10.1007/s10489-012-0346-z The two-armed bandit problem is a classical optimization problem where a decision maker sequentially pulls one of two arms attached to a gambling machine, with each pull resulting in a random reward. The reward distributions are unknown, and thus, one must balance between exploiting existing knowledge about the arms, and obtaining new information. Bandit problems are particularly fascinating because a large class of real world problems, including routing, Quality of Service (QoS) control, game playing, and resource allocation, can be solved …