Search results for " Complexity"

Fluted Logic with Counting

2021

The fluted fragment is a fragment of first-order logic in which the order of quantification of variables coincides with the order in which those variables appear as arguments of predicates. It is known that the fluted fragment possesses the finite model property. In this paper, we extend the fluted fragment by the addition of counting quantifiers. We show that the resulting logic retains the finite model property, and that the satisfiability problem for its (m+1)-variable sub-fragment is in m-NExpTime for all positive m. We also consider the satisfiability and finite satisfiability problems for the extension of any of these fragments in which the fluting requirement applies only to sub-form…

Superresolved imaging of remote moving targets.

2006

We present a superresolving approach that allows one to exceed the diffraction limit and recover highly resolved contours of moving targets from a sequence of low-resolution images. The presented approach is suitable for remote sensing applications. The resolution decoding algorithm that is used to recover the high-resolution features of the target can be run partially via optical means and that way can be used to reduce the required computational complexity.

Optimal Impulse Control Problems and Linear Programming

2009

Optimal impulse control problems are, in general, difficult to solve. A current research goal is to isolate those problems that lead to tractable solutions. In this paper, we identify a special class of optimal impulse control problems which are easy to solve. Easy to solve means that solution algorithms are polynomial in time and therefore suitable to the on-line implementation in real-time problems. We do this by using a paradigm borrowed from the Operations Research field. As main result, we present a solution algorithm that converges to the exact solution in polynomial time. Our approach consists in approximating the optimal impulse control problem via a binary linear programming proble…

Complejidad social y calidad informativa: hacia un periodismo "glocal"

2013

In the so-called information (and knowledge) society, quality information is, more than ever, an indispensable and inalienable public good for any citizen who wants to exercise his or her civic and political rights. Because of this, we need to have reliable (rigorous and autonomous) communication media, which disseminate relevant and quality information. But journalism does not only depend on structural questions, but also on the conditions and limits (such as simplification, for instance) that mark professional praxis, either of the political or the socioeconomic type. Social complexity requires a treatment of information that might explain reality, which implies taking advantage of the sc…

The Crane Beach Conjecture

2002

A language L over an alphabet A is said to have a neutral letter if there is a letter e/spl isin/A such that inserting or deleting e's from any word in A* does not change its membership (or non-membership) in L. The presence of a neutral letter affects the definability of a language in first-order logic. It was conjectured that it renders all numerical predicates apart from the order predicate useless, i.e., that if a language L with a neutral letter is not definable in first-order logic with linear order then it is not definable in first-order. Logic with any set /spl Nscr/ of numerical predicates. We investigate this conjecture in detail, showing that it fails already for /spl Nscr/={+, *…

On the influence of context-based complexity on information search patterns: An individual perspective

2014

Although context-based complexity measured as the similarity and conflict across alternatives is dependent on individual preference structures, existing studies investigating the influence of context-based complexity on information search patterns have largely ignored that context-based complexity is user- and preference-dependent. Addressing this research gap, this article elicits the individual preferences of decision makers by using the pairwise-comparison-based preference measurement (PCPM) technique and records individuals' search patterns using eye tracking. Our results show that an increased context-based complexity leads to an increase in information acquisition and the use of a mor…

Convolutional Neural Network-Based Human Movement Recognition Algorithm in Sports Analysis

2021

In order to analyse the sports psychology of athletes and to identify the psychology of athletes in their movements, a human action recognition (HAR) algorithm has been designed in this study. First, a HAR model is established based on the convolutional neural network (CNN) to classify the current action state by analysing the action information of a task in the collected videos. Secondly, the psychology of basketball players displaying fake actions during the offensive and defensive process is investigated by combining with related sports psychological theories. Then, the psychology of athletes is also analysed through the collected videos, so as to predict the next response action of the …

Project complexity and team-level absorptive capacity as drivers of project management performance

2018

Abstract Many believe that project complexity reduces project management performance. However, so far research has failed to establish this causal relationship conclusively. We extend research on project complexity by introducing the concept of team-level absorptive capacity and by studying its role as mediator between project complexity and project management success. Applying structural equation modelling to a sample of 285 respondents, we find an unequivocal, direct and positive statistical association between project complexity and delays and overspending. Further, we show that team-level absorptive capacity is critical for successful project management, but also that absorptive capacit…

Topical issue on Ecological Complex Systems

2008

The Role of Low Complexity Regions in Protein Interaction Modes: An Illustration in Huntingtin

2021

Low complexity regions (LCRs) are very frequent in protein sequences, generally having a lower propensity to form structured domains and tending to be much less evolutionarily conserved than globular domains. Their higher abundance in eukaryotes and in species with more cellular types agrees with a growing number of reports on their function in protein interactions regulated by post-translational modifications. LCRs facilitate the increase of regulatory and network complexity required with the emergence of organisms with more complex tissue distribution and development. Although the low conservation and structural flexibility of LCRs complicate their study, evolutionary studies of proteins …