Search results for " Computer Science"
showing 10 items of 3983 documents
A pattern recognition approach for peak prediction of electrical consumption
2016
Predicting and mitigating demand peaks in electrical networks has become a prevalent research topic. Demand peaks pose a particular challenge to energy companies because these are difficult to foresee and require the net to support abnormally high consumption levels. In smart energy grids, time-differentiated pricing policies that increase the energy cost for the consumers during peak periods, and load balancing are examples of simple techniques for peak regulation. In this paper, we tackle the task of predicting power peaks prior to their actual occurrence in the context of a pilot Norwegian smart grid network.
Assessing eco-efficiency with directional distance functions
2012
Abstract Eco-efficiency is a matter of concern at present that is receiving increasing attention in political, academic and business circles. Broadly speaking, this concept refers to the ability to create more goods and services with less impact on the environment and less consumption of natural resources, thus involving both economic and also ecological issues. In this paper we propose the use of directional distance functions and Data Envelopment Analysis techniques to assess eco-efficiency. More specifically, we show how these functions can be used to compute a wide range of indicators representing different objectives regarding economic and ecological performance. This methodological ap…
mplicit Identification of Contact Parameters in a Continuous Chain Model
2011
Accurate contact modeling is of great importance in the field of dynamic chain simulations. In this paper emphasis is on contact dynamics for a time-domain simulation model of large chains guided in a closed loop track. The chain model is based on theory for unconstrained rigid multibody dynamics where contact within the chain and with the track is defined through continuous point contacts using the contact indentation and rate as means. This paper presents an implicit method to determine contact parameters of the chain model through the use of none gradient optimization methods. The set of model parameters are estimated by minimizing the residual between simulated and measured results. The…
Analysis of the role of communication devices shared on the internet - web 2.0 in the process of emergence of public sphere and democratization of Pa…
2013
In this thesis, the first study of its kind, the role of internet specially that of social networking shared devices on web 2.0 is analyzed in the process of emergence of Public Sphere – the notion introduced by Habermas, and ultimately in the process of democratization of civil society in Pakistan. Lawyers’ Movement (March 2007 – March 2009) of Pakistan is selected to analyze this role as this successful movement for the rule of law in the country is solely responsible for a fundamental democratic change in the democratic culture and socio-political set up of Pakistan by bringing a vibrant and active civil society in the lime light of country’s political and social life.The content in Paki…
Modular Method of Detection, Localization and Counting of Mutliple-Taxon Pollen Apertures Using Bag of Words
2014
International audience; Accurate recognition of airborne pollen taxa is crucial for understanding and treating allergic diseases, which affect an important proportion of the world population. Modern computer vision techniques enables the detection of discriminant characteristics. Apertures is one of these characteristic that has been little explored up to now. In this paper, a flexible method of detection, localization and counting of apertures of different pollen taxa with varying appearances is proposed. Apertures are described based by primitive images following the Bag-of-Words strat-egy. A confidence map is estimated based on the classification of sampled regions. The method is designe…
An evolutionary method for complex-process optimization
2010
10 páginas, 7 figuras, 7 tablas
Black box scatter search for general classes of binary optimization problems
2010
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represented as binary vectors and that may or may not include constraints. Binary problems arise in a variety of settings, including engineering design and statistical mechanics (e.g., the spin glass problem). A distinction is made between two sets of general constraint types that are handled directly by the solver and other constraints that are addressed via penalty functions. In both cases, however, the heuristic treats the objective function evaluation as a black box. We perform computational experiments with four well-k…
Disturbed Exploitation compact Differential Evolution for Limited Memory Optimization Problems
2011
This paper proposes a novel and unconventional Memetic Computing approach for solving continuous optimization problems characterized by memory limitations. The proposed algorithm, unlike employing an explorative evolutionary framework and a set of local search algorithms, employs multiple exploitative search within the main framework and performs a multiple step global search by means of a randomized perturbation of the virtual population corresponding to a periodical randomization of the search for the exploitative operators. The proposed Memetic Computing approach is based on a populationless (compact) evolutionary framework which, instead of processing a population of solutions, handles …
Discrete Learning Control with Application to Hydraulic Actuators
2015
In this paper the robustness of a class of learning control algorithms to state disturbances, output noise, and errors in initial conditions is studied. We present a simple learning algorithm and exhibit, via a concise proof, bounds on the asymptotic trajectory errors for the learned input and the corresponding state and output trajectories. Furthermore, these bounds are continuous functions of the bounds on the initial condition errors, state disturbance, and output noise, and the bounds are zero in the absence of these disturbances.
Computing Euclidean Steiner trees over segments
2020
In the classical Euclidean Steiner minimum tree (SMT) problem, we are given a set of points in the Euclidean plane and we are supposed to find the minimum length tree that connects all these points, allowing the addition of arbitrary additional points. We investigate the variant of the problem where the input is a set of line segments. We allow these segments to have length 0, i.e., they are points and hence we generalize the classical problem. Furthermore, they are allowed to intersect such that we can model polygonal input. As in the GeoSteiner approach of Juhl et al. (Math Program Comput 10(2):487–532, 2018) for the classical case, we use a two-phase approach where we construct a superse…