Abstract: In this paper, a thorough review about dual-cubes, DCn,
the related studies and their variations are given. DCn was introduced
to be a network which retains the pleasing properties of hypercube Qn
but has a much smaller diameter. In fact, it is so constructed that the
number of vertices of DCn is equal to the number of vertices of Q2n
+1. However, each vertex in DCn is adjacent to n + 1 neighbors and
so DCn has (n + 1) × 2^2n edges in total, which is roughly half the
number of edges of Q2n+1. In addition, the diameter of any DCn is 2n
+2, which is of the same order of that of Q2n+1. For selfcompleteness,
basic definitions, construction rules and symbols are
provided. We chronicle the results, where eleven significant theorems
are presented, and include some open problems at the end.
Abstract: Vertex Enumeration Algorithms explore the methods and procedures of generating the vertices of general polyhedra formed by system of equations or inequalities. These problems of enumerating the extreme points (vertices) of general polyhedra are shown to be NP-Hard. This lead to exploring how to count the vertices of general polyhedra without listing them. This is also shown to be #P-Complete. Some fully polynomial randomized approximation schemes (fpras) of counting the vertices of some special classes of polyhedra associated with Down-Sets, Independent Sets, 2-Knapsack problems and 2 x n transportation problems are presented together with some discovered open problems.
Abstract: Smart metering and demand response are gaining
ground in industrial and residential applications. Smart Appliances
have been given concern towards achieving Smart home. The success
of Smart grid development relies on the successful implementation of
Information and Communication Technology (ICT) in power sector.
Smart Appliances have been the technology under development and
many new contributions to its realization have been reported in the
last few years. The role of ICT here is to capture data in real time,
thereby allowing bi-directional flow of information/data between
producing and utilization point; that lead a way for the attainment of
Smart appliances where home appliances can communicate between
themselves and provide a self-control (switch on and off) using the
signal (information) obtained from the grid. This paper depicts the
background on ICT for smart appliances paying a particular attention
to the current technology and identifying the future ICT trends for
load monitoring through which smart appliances can be achieved to
facilitate an efficient smart home system which promote demand
response program. This paper grouped and reviewed the recent
contributions, in order to establish the current state of the art and
trends of the technology, so that the reader can be provided with a
comprehensive and insightful review of where ICT for smart
appliances stands and is heading to. The paper also presents a brief
overview of communication types, and then narrowed the discussion
to the load monitoring (Non-intrusive Appliances Load Monitoring
‘NALM’). Finally, some future trends and challenges in the further
development of the ICT framework are discussed to motivate future
contributions that address open problems and explore new
possibilities.
Abstract: A sign pattern is a matrix whose entries belong to the set
{+,−, 0}. An n-by-n sign pattern A is said to allow an eventually
positive matrix if there exist some real matrices A with the same
sign pattern as A and a positive integer k0 such that Ak > 0 for all
k ≥ k0. It is well known that identifying and classifying the n-by-n
sign patterns that allow an eventually positive matrix are posed as two
open problems. In this article, the tree sign patterns of small order
that allow an eventually positive matrix are classified completely.
Abstract: Word sense disambiguation is one of the most important open problems in natural language processing applications such as information retrieval and machine translation. Many approach strategies can be employed to resolve word ambiguity with a reasonable degree of accuracy. These strategies are: knowledgebased, corpus-based, and hybrid-based. This paper pays attention to the corpus-based strategy that employs an unsupervised learning method for disambiguation. We report our investigation of Latent Semantic Indexing (LSI), an information retrieval technique and unsupervised learning, to the task of Thai noun and verbal word sense disambiguation. The Latent Semantic Indexing has been shown to be efficient and effective for Information Retrieval. For the purposes of this research, we report experiments on two Thai polysemous words, namely /hua4/ and /kep1/ that are used as a representative of Thai nouns and verbs respectively. The results of these experiments demonstrate the effectiveness and indicate the potential of applying vector-based distributional information measures to semantic disambiguation.
Abstract: Duplicated region detection is a technical method to
expose copy-paste forgeries on digital images. Copy-paste is one
of the common types of forgeries to clone portion of an image
in order to conceal or duplicate special object. In this type of
forgery detection, extracting robust block feature and also high
time complexity of matching step are two main open problems.
This paper concentrates on computational time and proposes a local
block matching algorithm based on block clustering to enhance time
complexity. Time complexity of the proposed algorithm is formulated
and effects of two parameter, block size and number of cluster, on
efficiency of this algorithm are considered. The experimental results
and mathematical analysis demonstrate this algorithm is more costeffective
than lexicographically algorithms in time complexity issue
when the image is complex.
Abstract: Random Oracle Model (ROM) is an effective method
for measuring the practical security of cryptograph. In this paper, we
try to use it into information hiding system (IHS). Because IHS has its
own properties, the ROM must be modified if it is used into IHS.
Firstly, we fully discuss why and how to modify each part of ROM
respectively. The main changes include: 1) Divide the attacks that IHS
may be suffered into two phases and divide the attacks of each phase
into several kinds. 2) Distinguish Oracles and Black-boxes clearly. 3)
Define Oracle and four Black-boxes that IHS used. 4) Propose the
formalized adversary model. And 5) Give the definition of judge.
Secondly, based on ROM of IHS, the security against known original
cover attack (KOCA-KOCA-security) is defined. Then, we give an
actual information hiding scheme and prove that it is
KOCA-KOCA-secure. Finally, we conclude the paper and propose the
open problems of further research.
Abstract: Research in quantum computation is looking for the consequences of having information encoding, processing and communication exploit the laws of quantum physics, i.e. the laws which govern the ultimate knowledge that we have, today, of the foreign world of elementary particles, as described by quantum mechanics. This paper starts with a short survey of the principles which underlie quantum computing, and of some of the major breakthroughs brought by the first ten to fifteen years of research in this domain; quantum algorithms and quantum teleportation are very biefly presented. The next sections are devoted to one among the many directions of current research in the quantum computation paradigm, namely quantum programming languages and their semantics. A few other hot topics and open problems in quantum information processing and communication are mentionned in few words in the concluding remarks, the most difficult of them being the physical implementation of a quantum computer. The interested reader will find a list of useful references at the end of the paper.
Abstract: The paper contains an investigation on basic problems
about the zeros of analytic theta functions. A brief introduction to
analytic representation of finite quantum systems is given. The zeros
of this function and there evolution time are discussed. Two open
problems are introduced. The first problem discusses the cases when
the zeros follow the same path. As the basis change the quantum state
|f transforms into different quantum state. The second problem is
to define a map between two toruses where the domain and the range
of this map are the analytic functions on toruses.