Search results for "complexi"
showing 10 items of 1116 documents
Moving Learning Machine Towards Fast Real-Time Applications: A High-Speed FPGA-based Implementation of the OS-ELM Training Algorithm
2018
Currently, there are some emerging online learning applications handling data streams in real-time. The On-line Sequential Extreme Learning Machine (OS-ELM) has been successfully used in real-time condition prediction applications because of its good generalization performance at an extreme learning speed, but the number of trainings by a second (training frequency) achieved in these continuous learning applications has to be further reduced. This paper proposes a performance-optimized implementation of the OS-ELM training algorithm when it is applied to real-time applications. In this case, the natural way of feeding the training of the neural network is one-by-one, i.e., training the neur…
An efficient distributed algorithm for generating and updating multicast trees
2006
As group applications are becoming widespread, efficient network utilization becomes a growing concern. Multicast transmission represents a necessary lower network service for the wide diffusion of new multimedia network applications. Multicast transmission may use network resources more efficiently than multiple point-to-point messages; however, creating optimal multicast trees (Steiner Tree Problem in networks) is prohibitively expensive. This paper proposes a distributed algorithm for the heuristic solution of the Steiner Tree Problem, allowing the construction of effective distribution trees using a coordination protocol among the network nodes. Furthermore, we propose a novel distribut…
New separation between $s(f)$ and $bs(f)$
2011
In this note we give a new separation between sensitivity and block sensitivity of Boolean functions: $bs(f)=(2/3)s(f)^2-(1/3)s(f)$.
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity
2014
Sensitivity, certificate complexity and block sensitivity are widely used Boolean function complexity measures. A longstanding open problem, proposed by Nisan and Szegedy, is whether sensitivity and block sensitivity are polynomially related. Motivated by the constructions of functions which achieve the largest known separations, we study the relation between 1-certificate complexity and 0-sensitivity and 0-block sensitivity. Previously the best known lower bound was $C_1(f)\geq \frac{bs_0(f)}{2 s_0(f)}$, achieved by Kenyon and Kutin. We improve this to $C_1(f)\geq \frac{3 bs_0(f)}{2 s_0(f)}$. While this improvement is only by a constant factor, this is quite important, as it precludes achi…
Computational Complexity and Communication: Coordination in Two-Player Games
2002
The main contribution of this paper is the development and application of cryptographic techniques to the design of strategic communication mechanisms. One of the main assumptions in cryptography is the limitation of the computational power available to agents. We introduce the concept of limited computational complexity, and by borrowing results from cryptography, we construct a communication protocol to establish that every correlated equilibrium of a two-person game with rational payoffs can be achieved by means of computationally restricted unmediated communication. This result provides an example in game theory where limitations of computational abilities of players are helpful in solv…
The absolute center of a unicyclic network
1989
Abstract A unicyclic network is one generalization of a tree network. In this paper we examine the problem of finding an absolute center of a unicyclic network. We show that this problem can be solved in linear time with respect to the number of vertices in the network.
Using FOCAP tool for teaching microarchitecture simulation and optimization
2013
This paper presents our new developed FOCAP tool (Framework for optimizing the Computer Architecture Performance) in order to gain a better understanding and familiarity of the students with new advanced learning methods and tools in the Microarchitecture Simulation and Optimization. At this stage, FOCAP allows a mono-objective automatic design space exploration (DSE) of a superscalar processor by varying several architectural parameters. Such DSE tools are very useful, since it is impossible to simulate all the configurations of a highly parameterized microarchitecture. Therefore, heuristic methods, local search algorithms and advanced machine learning methods are good candidates to find n…
Effect of Demand Side Management on the Operation of PV-Integrated Distribution Systems
2020
In this new era of high electrical energy dependency, electrical energy must be abundant and reliable, thus smart grids are conducted to deliver load demands. Hence, smart grids are implemented alongside distributed generation of renewable energies to increase the reliability and controllability of the grid, but, with the very volatile nature of the Distributed Generation (DG), Demand Side Management (DSM) helps monitor and control the load shape of the consumed power. The interaction of DSM with the grid provides a wide range of mutual benefits to the user, the utility and the market. DSM methodologies such as Conservation Voltage Reduction (CVR) and Direct Load Control (DLC) collaborate i…
A Novel Priority-Based Ambulance-to-Traffic Light Communication for Delay Reduction in Emergency Rescue Operations
2019
Rescue operations are very critical and sensitive. Only one-second delay could make a serious difference between life and death. Therefore, the delay in rescue operations must be reduced as much as possible. The siren signal can be used to warn other vehicles nearby the ambulance. However, it has no impact on the traffic lights, which is normally a main cause of delay in rescue operations. For this reason, many ambulances get stuck and experience long delay at the intersections, which should not happen by any means. To enhance the rescue operations, this paper proposes a novel Priority-based Ambulance-to-Traffic Light Communication (PATCom). PATCom allows information exchanging between traf…
Approximate 3-Dimensional Electrical Impedance Imaging
2001
We discuss a new approach to three-dimensional electrical impedance imaging based on a reduction of the information to be demanded from a reconstruction algorithm. Images are obtained from a single measurement by suitably simplifying the geometry of the measuring chamber and by restricting the nature of the object to be imaged and the information required from the image. In particular we seek to establish the existence or non-existence of a single object (or a small number of objects) in a homogeneous background and the location of the former in the (x,y)-plane defined by the measuring electrodes. Given in addition the conductivity of the object rough estimates of its position along the z-a…