Search results for "Algorithm"

showing 10 items of 4887 documents

A General Frame-by-Frame Wavelet Transform Algorithm for a Three-Dimensional Analysis with Reduced Memory Usage

2007

The 3D-DWT is a mathematical tool of increasing importance. However, the huge memory requirement of the algorithms that compute it is one of the main drawbacks in practical implementations. In this paper, we introduce a frame-by-frame algorithm to calculate the 3D-DWT with low memory usage. This algorithm is general, in the sense that it can be employed with any wavelet transform and, contrary to other proposals, it gets the same results as the regular wavelet transform. In addition, there is no need to divide the input video sequence into group of frames, and it can be applied in a continuous manner, so that coding efficiency is increased and no blocking artifacts appear.

Discrete wavelet transformWaveletSecond-generation wavelet transformStationary wavelet transformComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONWavelet transformCascade algorithmHarmonic wavelet transformAlgorithmWavelet packet decompositionMathematics2007 IEEE International Conference on Image Processing
researchProduct

The Wavelet Scalogram in the Study of Time Series

2014

Wavelet theory has been proved to be a useful tool in the study of time series. Specifically, the scalogram allows the detection of the most representative scales (or frequencies) of a signal. In this work, we present the scalogram as a tool for studying some aspects of a given signal. Firstly, we introduce a parameter called scale index, interpreted as a measure of the degree of the signal’s non-periodicity. In this way, it can complement the maximal Lyapunov exponent method for determining chaos transitions of a given dynamical system. Secondly, we introduce a method for comparing different scalograms. This can be applied for determining if two time series follow similar patterns.

Discrete wavelet transformsymbols.namesakeWaveletSeries (mathematics)Computer sciencesymbolsLyapunov exponentDynamical systemAlgorithmMeasure (mathematics)Continuous wavelet transformComplement (set theory)
researchProduct

Discrete-mathematical approach to formal description of measurement procedure

1996

The discrete-mathematical model of measurement procedure is developed for facilitating the description of measurements in both quantitative and qualitative scales. On the basis of this model the Measurement Problem is formulated. It is shown that the problem can be considered, in the general case, as one of the discrete optimization problems. The suggested approach brings closer the concepts of a computing algorithm and measurement procedure so that it permits the application of similar tools for the analysis and development of both of them.

DiscretizationBasis (linear algebra)Applied MathematicsMeasurement problemCondensed Matter PhysicsMeasurement theoryDevelopment (topology)Discrete optimization problemCalculusSearch problemElectrical and Electronic EngineeringInstrumentationAlgorithmFormal descriptionMathematicsMeasurement
researchProduct

A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector Routing Algorithms

2013

Count-to-infinity problem is characteristic for routing algorithms based on the distributed implementation of the classical Bellman-Ford algorithm. In this paper a probabilistic solution to this problem is proposed. It is argued that by the use of a Bloom Filter added to the routing message the routing loops will with high probability not form. An experimental analysis of this solution for use in Wireless Sensor Networks in practice is also included.

Distance-vector routing protocolLink-state routing protocolComputer scienceAnt colony optimization algorithmsComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSMultipath routingComputer Science::Networking and Internet ArchitectureProbabilistic logicPath vector protocolProbabilistic analysis of algorithmsRouting (electronic design automation)Algorithm
researchProduct

Criteria for Selecting Restructuring Strategies for Distressed or Declining Enterprises

2005

This paper seeks to determine the criteria for choosing restructuring strategies for declining or distressed enterprises. First, the paper differentiates between different stages of decline and different levels of distress, of which bankruptcy is an application. Second, it reviews the different forms of restructuring appearing in the academic literature. Third, it formalizes a descriptive model of determining restructuring applicable to distressed and declining enterprises. Specifically, the selection of a restructuring strategy is influenced not only be general restructuring criteria (firm-specific factors, the environment and characteristics of different restructuring) but also by the dec…

DistressPublic economicsRestructuringBankruptcyBusiness administrationBusinessSelection (genetic algorithm)SSRN Electronic Journal
researchProduct

Production Planning in Production Networks: Models for Medium and Short-term Planning

2008

Distributed production networks are structures which are considered able to provide the organisational agility and efficiency necessary to compete in the global market. The performance of such organisations heavily depends on the ability of those involved in the network to coordinate their activities. Two approaches are available for managing complex distributed production networks: a centralised approach, where a unique entity (the planner, for instance) has all the necessary information to make planning decisions for the entire network; or a decentralised approach where each entity in the network has the necessary information and knowledge to make autonomous planning decisions, while the …

Distributed Decision Making Manufacturing Multi-agent Systems Negotiation Production Networks Production Planning Simulation algorithms productionSettore ING-IND/35 - Ingegneria Economico-GestionaleSettore ING-IND/16 - Tecnologie E Sistemi Di Lavorazione
researchProduct

A recognize-and-accuse policy to speed up distributed processes

1994

Distributed design patternsSpeedupComputer scienceDistributed algorithmDistributed computingDistributed concurrency controlParallel computingProceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94
researchProduct

Topic 5: Parallel and Distributed Data Management

2013

Nowadays we are facing an exponential growth of new data that is overwhelming the capabilities of companies, institutions and the society in general to manage and use it in a proper way. Ever-increasing investments in Big Data, cutting edge technologies and the latest advances in both application development and underlying storage systems can help dealing with data of such magnitude. Especially parallel and distributed approaches will enable new data management solutions that operate effectively at large scale.

Distributed design patternsbusiness.industryDistributed algorithmComputer scienceScale (chemistry)Data managementBig dataEnhanced Data Rates for GSM EvolutionbusinessData science
researchProduct

Distributed Learning Automata-based S-learning scheme for classification

2019

This paper proposes a novel classifier based on the theory of Learning Automata (LA), reckoned to as PolyLA. The essence of our scheme is to search for a separator in the feature space by imposing an LA-based random walk in a grid system. To each node in the grid, we attach an LA whose actions are the choices of the edges forming a separator. The walk is self-enclosing, and a new random walk is started whenever the walker returns to the starting node forming a closed classification path yielding a many-edged polygon. In our approach, the different LA attached to the different nodes search for a polygon that best encircles and separates each class. Based on the obtained polygons, we perform …

Distributed learningLearning automataComputer sciencePolygonsFeature vector020207 software engineering02 engineering and technologyGridRandom walkVDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420Learning automataSupport vector machinesymbols.namesakeArtificial IntelligenceKernel (statistics)Polygon0202 electrical engineering electronic engineering information engineeringGaussian functionsymbols020201 artificial intelligence & image processingComputer Vision and Pattern RecognitionClassificationsAlgorithmPattern Analysis and Applications
researchProduct

Ant Colony Search algorithm for optimal strategical planning of electrical distribution systems expansion

2005

Strategical planning is one of many research fields in the design of electrical distribution systems. The problem of strategical planning is a multiobjective combinatorial problem and the search space may often be quite large concerning to the options. The aim is to identify a strategy of expansion of a given distribution system in a given timeframe. For this problem, the search space is created beforehand by running a multiobjective optimisation algorithm for the optimal design of distribution networks for different load levels related to different years. The sets of Pareto-optimal solutions obtained for each load level at each year are equivalent in terms of the considered objectives, the…

Distribution systemMathematical optimizationIdentification (information)Artificial IntelligenceSearch algorithmComputer scienceSimulated annealingEnumerationAnt colony
researchProduct