The exact average complexity analysis of the basic sphere decoder for general space-time codes applied to multipleinput multiple-output (MIMO) wireless channel is known to be difficult. In this work, we shed the light on the computational complexity of sphere decoding for the quasi-static, LAttice Space-Time (LAST) coded MIMO channel. Specifically, we drive an upper bound of the tail distributi...

Visual patterns are common in animals. A broad survey of the literature has revealed that different patterns have distinct functions. Irregular patterns (e.g., stipples) typically function in static camouflage, whereas regular patterns (e.g., stripes) have a dual function in both motion camouflage and communication. Moreover, irregular and regular patterns located on different body regions ("bi...

Dynamic computational complexity is the study of resource bounded dynamic computation. We study the computational power of a persistent data structure that processes a stream of updates and queries, using limited computational resources. In this paper, we define new, extremely restricted dynamic complexity classes. We show that these classes are strictly contained in previously studied dynamic ...

this research is intended to investigate educational change in complexity paradigm. complexity paradigm provide a new perspective for thinkers to changing the world and it's phenomena and many of theorists present new viewpoints in variant scientific domains according to the main components of this paradigm. for this, the researcher first investigates and criticizes educational change theories ...

sciences exist to demonstrate the fundamental order underlying nature. chaos/complexity theory is a novel and amazing field of scientific inquiry. notions of our everyday experiences are somehow in connection to the laws of nature through chaos/complexity theory’s concerns with the relationships between simplicity and complexity, between orderliness and randomness (retrieved from http://www.inc...

This paper discusses how to construct a legal ontology using a general ontology that has already been developed. In the construction process, we must solve two hard issues. The one is to localize legal contexts in a general ontology in order to extract a legal ontology with a general ontology. The other is to identify bugs in a constructed legal ontology and re ne them. Here is presented a meth...

This paper presents an efficient diagnosis scheme for RAMs. Three March-based algorithms are proposed to diagnose simple functional faults of RAMs. A March-15N algorithm is used for locating and partially diagnosing faults of bit-oriented or word-oriented memories, where N represents the address number. Then a 3N March-like algorithm is used for locating the aggressor words (bits) of coupling f...

We present a methodology for checking the termination of Prolog programs that can be automated and is scalable. Furthermore, the proposed method can be used to locate errors. It has been successfully implemented as part of a tool that uses static analysis based on formal methods in order to validate Prolog programs. This tool is aimed at supporting the design and maintenance of Prolog programs....