Search results for "Algorithm"
showing 10 items of 4887 documents
Horizontal visibility graphs: exact results for random time series
2009
The visibility algorithm has been recently introduced as a mapping between time series and complex networks. This procedure allows us to apply methods of complex network theory for characterizing time series. In this work we present the horizontal visibility algorithm, a geometrically simpler and analytically solvable version of our former algorithm, focusing on the mapping of random series (series of independent identically distributed random variables). After presenting some properties of the algorithm, we present exact results on the topological properties of graphs associated with random series, namely, the degree distribution, the clustering coefficient, and the mean path length. We sh…
Multi-subject fMRI analysis via combined independent component analysis and shift-invariant canonical polyadic decomposition
2014
Canonical polyadic decomposition (CPD) may face a local optimal problem when analyzing multi-subject fMRI data with inter-subject variability. Beckmann and Smith proposed a tensor PICA approach that incorporated an independence constraint to the spatial modality by combining CPD with ICA, and alleviated the problem of inter-subject spatial map (SM) variability.This study extends tensor PICA to incorporate additional inter-subject time course (TC) variability and to connect CPD and ICA in a new way. Assuming multiple subjects share common TCs but with different time delays, we accommodate subject-dependent TC delays into the CP model based on the idea of shift-invariant CP (SCP). We use ICA …
Inverted and mirror repeats in model nucleotide sequences.
2007
We analytically and numerically study the probabilistic properties of inverted and mirror repeats in model sequences of nucleic acids. We consider both perfect and non-perfect repeats, i.e. repeats with mismatches and gaps. The considered sequence models are independent identically distributed (i.i.d.) sequences, Markov processes and long range sequences. We show that the number of repeats in correlated sequences is significantly larger than in i.i.d. sequences and that this discrepancy increases exponentially with the repeat length for long range sequences.
A New Wavelet Tool to Quantify Non-Periodicity of Non-Stationary Economic Time Series
2020
We introduce a new wavelet tool, the windowed scale index, to study the degree of non-periodicity of time series. The windowed scale index is based on some recently defined tools, such as the windowed scalogram and the scale index. This novel measure is appropriate for non-stationary time series whose characteristics change over time and, therefore, it can be applied to a wide variety of disciplines. Furthermore, we revise the concept of the scale index and pose a theoretical problem: it is known that if the scale index of a function is not zero then it is non-periodic, but if the scale index of a function is zero, then it is not proved that it has to be periodic. This problem is solved for…
ADT implementation and completion by induction from examples
1991
There exists a fast algorithm [2] for inductive synthesis of terminating and ground confluent term rewriting systems from samples. The principles of this algorithm and the methodology of its use for implementation and completion of abstract data types are described.
Inductive synthesis of term rewriting systems
2005
Fast algorithm for inductive synthesis of term rewriting systems is described and proved to be correct. It is implemented and successfully applied for inductive synthesis of different algorithms, including the binary multiplication. The algorithm proposed supports automatic learning process and can be used for designing and implementation of ADT.
A particle swarm approach for tuning washout algorithms in vehicle simulators
2018
Abstract The MCA tuning problem involves finding the most appropriate values for the parameters (or coefficients) of Motion Cueing Algorithms (MCA), also known as washout algorithms. These algorithms are designed to control the movements of the robotic mechanisms, referred to as motion platforms, employed to generate inertial cues in vehicle simulators. This problem can be approached in several different ways. The traditional approach is to perform a manual pilot-in-the-loop subjective tuning, using the opinion of several pilots/drivers to guide the process. A more systematic approach is to use optimization techniques to explore the vast parameter space of the MCA, using objective motion fi…
INVESTIGATIONS ON INFILTRATION METHODS FOR AN IMPROVED SOIL HYDRAULIC CHARACTERIZATION
2020
Some New Symbolic Algorithms for the Computation of Generalized Asymptotes
2022
We present symbolic algorithms for computing the g-asymptotes, or generalized asymptotes, of a plane algebraic curve, C, implicitly or parametrically defined. The g-asymptotes generalize the classical concept of asymptotes of a plane algebraic curve. Both notions have been previously studied for analyzing the geometry and topology of a curve at infinity points, as well as to detect the symmetries that can occur in coordinates far from the origin. Thus, based on this research, and in order to solve practical problems in the fields of science and engineering, we present the pseudocodes and implementations of algorithms based on the Puiseux series expansion to construct the g-asymptotes of a p…
Augmenting the algorithm: emerging human-in-the-loop work configurations
2020
Abstract How do configurations of humans and algorithms evolve as firms adopt artificial intelligence (AI) capabilities, and what are the implications for work and organization? We explored these questions through a two-year long case study of an organization in the international maritime trade that introduced automated algorithmic support for data analysis and prediction work. Drawing on a human–machine configuration perspective, we found that humans and the algorithm were configured and reconfigured in multiple ways over time as the organization dealt with the introduction of algorithmic analysis. In contrast to replacing human work, the emergent configurations required new roles and redi…