Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

Binary field multiplication is the most fundamental building block of binary field Elliptic Curve Cryptography (ECC) and Galois/Counter Mode (GCM). Both bit-wise scanning and Look-Up Table (LUT) based methods are commonly used for binary field multiplication. In terms of Side Channel Attack (SCA), bit-wise scanning exploits insecure branch operations which leaks information in a form of timing ...

The concept of horizontal or lateral gene transfer (the non-genealogical transmission of genetic material between organisms) was introduced in 1990s to explain the observed incongruence in phylogenetic reconstructions using different genes. Today, horizontal gene transfer is accepted as an important force modulating evolution of Bacteria, Archaea and unicellular eukaryotes, and evidence is risi...

Segmentation is a rst step towards successful tracking and object recognition in 2-D pictures. Mostly the pictures are segmented with respect to quantities as range, intensity etc. Here a method is presented for segmentation of 2-D laser range pictures with respect to both range and variance simultaneously. This is very useful since man-made objects diier from the background in the terrain by t...

We consider the representational state complexity of unranked tree automata. The bottomup computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the horizontal string languages defining the transitions are represented by a DFA or an NFA. Also, we consider for unranked tree automata the alternative syntactic defi...

Reconstruction of binary images from their projections is one of the main tasks in many image processing areas, therefore determining the computational complexity of those problems is essential. The reconstruction complexity is highly dependent on the requirements of the image. In this paper, we will show that the reconstruction is NP-complete if the horizontal and vertical projections and the ...

Based on rapid upsurge in the demand and usage of electronic media devices such as tablets, smart phones, laptops, personal computers, etc. and its different display specifications including the size and shapes, image retargeting became one of the key components of communication technology and internet. The existing techniques in image resizing cannot save the most valuable information of image...

In static analysis of queries over trees in the presence of schemas, there is an exponential complexity gap between conjunctive queries (CQs, positive existential first-order formulae without disjunction) and tree patterns (tree-like acyclic CQs). Motivated by applications in XML data management, we consider various restrictions of CQs that bring their complexity down to that of tree patterns. ...

the present meta-analysis was conducted to provide a quantitative measure of the overall effects of task complexity on chinese efl learners’ language production. based on the strict inclusion criteria, 12 primary studies were synthesized according to key features. eleven of them were meta-analyzed to investigate effects of raising the resource-directing task complexity. results revealed that ...