Search results for " complexity."
showing 10 items of 603 documents
A metrics suite for evaluating agent-oriented architectures
2010
The Multi-agent Systems (MASs) paradigm continues to consolidate itself as a new branch of software engineering. Traditional software engineering strongly recommends to apply metrics in software developments. However, several research groups of experts in agent-oriented software engineering agree that classical software metrics and object-oriented metrics cannot directly measure the quality of MAS architectures. For this reason, this work proposes a suite of metrics to measure certain quality attributes of MAS architectures, considering agents and their organization. Most of these metrics are inspired by object-oriented metrics but they are adapted to agent-oriented concepts. Proposed metri…
Quantum counter automata
2011
The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirmative answer to this question, by demonstrating a non-context-free language that can be recognized with perfect soundness by a rtQ1CA. This is the first demonstration of the superiority of a quantum model to the corresponding classical one in the real-time case with an error bound less than 1. We also introduce a generalization of the rtQ1CA, the quantum one-way one-counter automaton (1Q1CA), and show that they too are superior to the corresponding family of probabilistic machines. For this purpose, we provide gene…
Assessing maintainability change over multiple software releases
2008
The focus of the paper is to reveal the relationships between software maintainability and other internal software quality attributes. The source code characteristics of five Java-based open-source software products are analyzed using the software measurement tool SoftCalc. The relationships between maintainability and internal quality attributes are identified based on the Pearson product moment correlation analysis. Our results show negative correlations between maintainability and some well-known internal software quality attributes, as well as the ones between maintainability and complexity metrics. Particularly, according to our results, the Number of Data Variables Declared and the De…
Routing Algorithm for Maximizing Lifetime of Wireless Sensor Network for Broadcast Transmission
2018
In the article we discuss solutions of the maximum lifetime broadcasting problem in wireless sensor networks. Due to limited energy resources of the network nodes to find an optimal transmission route of the broadcasted data we minimize the maximum energy consumed by the nodes. We give an analytical solution of the problem in one dimensional regular sensor network for the point-to-point and point-to-multipoint data transmission scheme. We show that in such a network, when the cost of data transmission is a polynomial function of distance between transmitter and receiver, there exist solutions with an equal energy, i.e., all nodes of the network consume the same amount of energy. We assume t…
Reducing complexity in H.264/AVC motion estimation by using a GPU
2011
H.264/AVC applies a complex mode decision technique that has high computational complexity in order to reduce the temporal redundancies of video sequences. Several algorithms have been proposed in the literature in recent years with the aim of accelerating this part of the encoding process. Recently, with the emergence of many-core processors or accelerators, a new approach can be adopted for reducing the complexity of the H.264/AVC encoding algorithm. This paper focuses on reducing the inter prediction complexity adopted in H.264/AVC and proposes a GPU-based implementation using CUDA. Experimental results show that the proposed approach reduces the complexity by as much as 99% (100x of spe…
Simplified spiking neural network architecture and STDP learning algorithm applied to image classification
2015
Spiking neural networks (SNN) have gained popularity in embedded applications such as robotics and computer vision. The main advantages of SNN are the temporal plasticity, ease of use in neural interface circuits and reduced computation complexity. SNN have been successfully used for image classification. They provide a model for the mammalian visual cortex, image segmentation and pattern recognition. Different spiking neuron mathematical models exist, but their computational complexity makes them ill-suited for hardware implementation. In this paper, a novel, simplified and computationally efficient model of spike response model (SRM) neuron with spike-time dependent plasticity (STDP) lear…
Wavelet Frames Generated by Spline Based p-Filter Banks
2014
This chapter presents a design scheme to generate tight and so-called semi-tight frames in the space of discrete-time periodic signals. The frames originate from oversampled perfect reconstruction periodic filter banks. The filter banks are derived from discrete-time and discrete periodic splines. Each filter bank comprises one linear phase low-pass filter (in most cases interpolating) and one high-pass filter, whose magnitude response mirrors that of a low-pass filter. In addition, these filter banks comprise a number of band-pass filters. In this chapter, frames generated by four-channel filter banks are briefly outlined (see Chap. 17 in [2] for details) and tight frames generated by six-…
Block-Based Inversion of the Heat Equations
2014
This chapter presents robust methods, which refine the algorithms, in Sect. 7.2, for inversion of the heat equations. The idea behind the algorithms is to solve the inversion problem separately in different frequency bands. This is achieved by using spline wavelet packets. The solutions that minimize some parameterized quadratic functionals, are derived as linear combinations of the wavelet packets. Choice of parameters, which is performed automatically, determines the trade-off between the solution regularity and the initial data approximation. The Spline Harmonic Analysis (SHA) technique provides a unified computational scheme for the fast implementation of the algorithm and an explicit r…
Invariant aspects in M-commerce environments
2005
Mobile phones and other small and powerful portable devices have revolutionized personal communication and affected the lifestyles of the people in the industrialized world. Following credible estimates, in a few years there will over two - billions of such portable devices in use. An emerging trend is the electronic commerce performed using mobile terminals over wireless networks, often called mobile commerce or M-commerce. Mobile commerce environments are characterized by high complexity, including myriads of technical and organizational aspects. This property makes it difficult to distinguish the more fundamental issues, structures, and concepts in mobile commerce from the hype. To captu…
Unary Probabilistic and Quantum Automata on Promise Problems
2015
We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error QFAs are more powerful than PFAs. But, in contrary to the binary problems, the computational powers of Las-Vegas QFAs and bounded-error PFAs are equivalent to deterministic finite automata (DFAs). Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.