Abstract: An acyclic coloring of a graph G is a coloring of its
vertices such that:(i) no two neighbors in G are assigned the same
color and (ii) no bicolored cycle can exist in G. The acyclic chromatic
number of G is the least number of colors necessary to acyclically
color G. Recently it has been proved that any graph of maximum
degree 5 has an acyclic chromatic number at most 8. In this paper
we present another proof for this result.
Abstract: Developing countries are facing a problem of slums and there appears to be no fool proof solution to eradicate them. For improving the quality of life there are three approaches of slum development and In-situ up-gradation approach is found to be the best one, while the relocation approach has proved to be failure. Factors responsible for failure of relocation projects are needed to be assessed, which is the basic aim of the paper. Factors responsible for failure of relocation projects are loss of livelihood, security of tenure and inefficiency of the Government. These factors are traced out & mapped from the examples of Western & Indian cities. National habitat, Resettlement policy emphasized relationship between shelter and work place. SRA has identified 55 slums for relocation due reservation of land uses, security of tenure and non- notified status of slums. The policy guidelines have been suggested for successful relocation projects. KeywordsLivelihood, Relocation, Slums, Urban poor.
Abstract: The purposes of this paper are to (1) promote excellence in computer science by suggesting a cohesive innovative approach to fill well documented deficiencies in current computer science education, (2) justify (using the authors' and others anecdotal evidence from both the classroom and the real world) why this approach holds great potential to successfully eliminate the deficiencies, (3) invite other professionals to join the authors in proof of concept research. The authors' experiences, though anecdotal, strongly suggest that a new approach involving visual modeling technologies should allow computer science programs to retain a greater percentage of prospective and declared majors as students become more engaged learners, more successful problem-solvers, and better prepared as programmers. In addition, the graduates of such computer science programs will make greater contributions to the profession as skilled problem-solvers. Instead of wearily rememorizing code as they move to the next course, students will have the problem-solving skills to think and work in more sophisticated and creative ways.
Abstract: In this paper we analyze the application of a formal proof system to the discrete logarithm problem used in publickey cryptography. That means, we explore a computer verification of the ElGamal encryption scheme with the formal proof system Isabelle/HOL. More precisely, the functional correctness of this algorithm is formally verified with computer support. Besides, we present a formalization of the DSA signature scheme in the Isabelle/HOL system. We show that this scheme is correct what is a necessary condition for the usefulness of any cryptographic signature scheme.
Abstract: When architecting an application, key nonfunctional requirements such as performance, scalability, availability and security, which influence the architecture of the system, are some times not adequately addressed. Performance of the application may not be looked at until there is a concern. There are several problems with this reactive approach. If the system does not meet its performance objectives, the application is unlikely to be accepted by the stakeholders. This paper suggests an approach for performance modeling for web based J2EE and .Net applications to address performance issues early in the development life cycle. It also includes a Performance Modeling Case Study, with Proof-of-Concept (PoC) and implementation details for .NET and J2EE platforms.
Abstract: Segmentation techniques based on Active Contour
Models have been strongly benefited from the use of prior information
during their evolution. Shape prior information is captured from
a training set and is introduced in the optimization procedure to
restrict the evolution into allowable shapes. In this way, the evolution
converges onto regions even with weak boundaries. Although
significant effort has been devoted on different ways of capturing
and analyzing prior information, very little thought has been devoted
on the way of combining image information with prior information.
This paper focuses on a more natural way of incorporating the
prior information in the level set framework. For proof of concept
the method is applied on hippocampus segmentation in T1-MR
images. Hippocampus segmentation is a very challenging task, due
to the multivariate surrounding region and the missing boundary
with the neighboring amygdala, whose intensities are identical. The
proposed method, mimics the human segmentation way and thus
shows enhancements in the segmentation accuracy.
Abstract: We study a long-range percolation model in the hierarchical
lattice ΩN of order N where probability of connection between
two nodes separated by distance k is of the form min{αβ−k, 1},
α ≥ 0 and β > 0. The parameter α is the percolation parameter,
while β describes the long-range nature of the model. The ΩN is
an example of so called ultrametric space, which has remarkable
qualitative difference between Euclidean-type lattices. In this paper,
we characterize the sizes of large clusters for this model along the
line of some prior work. The proof involves a stationary embedding
of ΩN into Z. The phase diagram of this long-range percolation is
well understood.
Abstract: Malware is software which was invented and meant for doing harms on computers. Malware is becoming a significant threat in computer network nowadays. Malware attack is not just only involving financial lost but it can also cause fatal errors which may cost lives in some cases. As new Internet Protocol version 6 (IPv6) emerged, many people believe this protocol could solve most malware propagation issues due to its broader addressing scheme. As IPv6 is still new compares to native IPv4, some transition mechanisms have been introduced to promote smoother migration. Unfortunately, these transition mechanisms allow some malwares to propagate its attack from IPv4 to IPv6 network environment. In this paper, a proof of concept shall be presented in order to show that some existing IPv4 malware detection technique need to be improvised in order to detect malware attack in dual-stack network more efficiently. A testbed of dual-stack network environment has been deployed and some genuine malware have been released to observe their behaviors. The results between these different scenarios will be analyzed and discussed further in term of their behaviors and propagation methods. The results show that malware behave differently on IPv6 from the IPv4 network protocol on the dual-stack network environment. A new detection technique is called for in order to cater this problem in the near future.
Abstract: Most of the concurrent transactional protocols consider
serializability as a correctness criterion of the transactions execution.
Usually, the proof of the serializability relies on mathematical proofs
for a fixed finite number of transactions. In this paper, we introduce
a protocol to deal with an infinite number of transactions which are
iterated infinitely often. We specify serializability of the transactions
and the protocol using a specification language based on temporal
logics. It is worthwhile using temporal logics such as LTL (Lineartime
Temporal Logic) to specify transactions, to gain full automatic
verification by using model checkers.
Abstract: Tackling emergency situations is performed based on emergency scenarios. These scenarios do not have a uniform form in the Czech Republic. They are unstructured and developed primarily in the text form. This does not allow solving emergency situations efficiently. For this reason, the paper aims at defining a Process Oriented Architecture to support and thus to improve tackling emergency situations in the Czech Republic. The innovative Process Oriented Architecture is based on the Workflow Reference Model while taking into account the options of Business Process Management Suites for the implementation of process oriented emergency scenarios. To verify the proposed architecture the Proof of Concept has been used which covers the reception of an emergency event at the district emergency operations centre. Within the particular implementation of the proposed architecture the Bonita Open Solution has been used. The architecture created in this way is suitable not only for emergency management, but also for educational purposes.
Abstract: One of the primary uses of higher order statistics in
signal processing has been for detecting and estimation of non-
Gaussian signals in Gaussian noise of unknown covariance. This is
motivated by the ability of higher order statistics to suppress additive
Gaussian noise. In this paper, several methods to test for non-
Gaussianity of a given process are presented. These methods include
histogram plot, kurtosis test, and hypothesis testing using cumulants
and bispectrum of the available sequence. The hypothesis testing is
performed by constructing a statistic to test whether the bispectrum
of the given signal is non-zero. A zero bispectrum is not a proof of
Gaussianity. Hence, other tests such as the kurtosis test should be
employed. Examples are given to demonstrate the performance of the
presented methods.
Abstract: Chronic diseases prevailed along with economic
growth as well as life style changed in recent years in Taiwan.
According to the governmental statistics, hypertension related disease
is the tenth of death causes with 1,816 died directly from hypertension
in 2010. There were more death causes amongst the top ten had been
proofed that having strong association with the hypertension, such as
heart diseases, cardiovascular diseases, and diabetes. Hypertension or
High blood pressure is one of the major indicators for chronic diseases,
and was generally perceived as the major causes of mortality. The
literature generally suggested that regular physical exercise was
helpful to prevent the occurrence or to ease the progress of a
hypertension. This paper reported the process and outcomes in
detailed of an improvement project of physical exercise intervention
specific for hypertension patients. Physical information were
measured before and after the project to obtain information such as
weight, waistline, cholesterol (HD & LD), blood examination, as well
as self-perceived health status. The intervention project involved a
six-week exercise program, of which contained three times a week, 30
minutes of tutored physical exercise intervention. The project had
achieved several gains in changing the subjects- behavior in terms of
many important biophysical indexes. Around 20% of the participants
had significantly improved their cholesterols, BMI, and changed
unhealthy behaviors. Results from the project were encouraging, and
would be good reference for other samples.
Abstract: In this paper we explore the application of a formal proof system to verification problems in cryptography. Cryptographic properties concerning correctness or security of some cryptographic algorithms are of great interest. Beside some basic lemmata, we explore an implementation of a complex function that is used in cryptography. More precisely, we describe formal properties of this implementation that we computer prove. We describe formalized probability distributions (o--algebras, probability spaces and condi¬tional probabilities). These are given in the formal language of the formal proof system Isabelle/HOL. Moreover, we computer prove Bayes' Formula. Besides we describe an application of the presented formalized probability distributions to cryptography. Furthermore, this paper shows that computer proofs of complex cryptographic functions are possible by presenting an implementation of the Miller- Rabin primality test that admits formal verification. Our achievements are a step towards computer verification of cryptographic primitives. They describe a basis for computer verification in cryptography. Computer verification can be applied to further problems in crypto-graphic research, if the corresponding basic mathematical knowledge is available in a database.
Abstract: The optimal bisection width of r-dimensional N×
· · ·× N grid is known to be Nr-1 when N is even, but when
N is odd, only approximate values are available. This paper
shows that the exact bisection width of grid is Nr
-1
N-1 when N is odd.
Abstract: In this paper we discuss the effect of unbounded particle interaction operator on particle growth and we study how this can address the choice of appropriate time steps of the numerical simulation. We provide also rigorous mathematical proofs showing that large particles become dominating with increasing time while small particles contribute negligibly. Second, we discuss the efficiency of the algorithm by performing numerical simulations tests and by comparing the simulated solutions with some known analytic solutions to the Smoluchowski equation.
Abstract: The use of machine vision to inspect the outcome of
surgical tasks is investigated, with the aim of incorporating this
approach in robotic surgery systems. Machine vision is a non-contact
form of inspection i.e. no part of the vision system is in direct contact
with the patient, and is therefore well suited for surgery where
sterility is an important consideration,. As a proof-of-concept, three
primary surgical tasks for a common neurosurgical procedure were
inspected using machine vision. Experiments were performed on
cadaveric pig heads to simulate the two possible outcomes i.e.
satisfactory or unsatisfactory, for tasks involved in making a burr
hole, namely incision, retraction, and drilling. We identify low level
image features to distinguish the two outcomes, as well as report on
results that validate our proposed approach. The potential of using
machine vision in a surgical environment, and the challenges that
must be addressed, are identified and discussed.
Abstract: Compliance requires an effective communication
within an enterprise as well as towards a company-s external
environment. This requirement commences with the
implementation of compliance within large scale compliance
projects and still persists in the compliance reporting within
standard operations. On the one hand the understanding of
compliance necessities within the organization is promoted.
On the other hand reduction of asymmetric information with
compliance stakeholders is achieved. To reach this goal, a
central reporting must provide a consolidated view of different
compliance efforts- statuses. A concept which could be
adapted for this purpose is the balanced scorecard by Kaplan /
Norton. This concept has not been analyzed in detail
concerning its adequacy for a holistic compliance reporting
starting in compliance projects until later usage in regularly
compliance operations.
At first, this paper evaluates if a holistic compliance
reporting can be designed by using the balanced scorecard
concept. The current status of compliance reporting clearly
shows that scorecards are generally accepted as a compliance
reporting tool and are already used for corporate governance
reporting. Additional specialized compliance IT - solutions
exist in the market. After the scorecard-s adequacy is
thoroughly examined and proofed, an example strategy map as
the basis to derive a compliance balanced scorecard is defined.
This definition answers the question on proceeding in
designing a compliance reporting tool.
Abstract: Probabilistic techniques in computer programs are becoming
more and more widely used. Therefore, there is a big
interest in the formal specification, verification, and development
of probabilistic programs. In our work-in-progress project, we are
attempting to make a constructive framework for developing probabilistic
programs formally. The main contribution of this paper
is to introduce an intermediate artifact of our work, a Z-based
formalism called PZ, by which one can build set theoretical models of
probabilistic programs. We propose to use a constructive set theory,
called CZ set theory, to interpret the specifications written in PZ.
Since CZ has an interpretation in Martin-L¨of-s theory of types, this
idea enables us to derive probabilistic programs from correctness
proofs of their PZ specifications.
Abstract: Users of computer systems may often require the
private transfer of messages/communications between parties across
a network. Information warfare and the protection and dominance of
information in the military context is a prime example of an
application area in which the confidentiality of data needs to be
maintained. The safe transportation of critical data is therefore often
a vital requirement for many private communications. However,
unwanted interception/sniffing of communications is also a
possibility. An elementary stealthy transfer scheme is therefore
proposed by the authors. This scheme makes use of encoding,
splitting of a message and the use of a hashing algorithm to verify the
correctness of the reconstructed message. For this proof-of-concept
purpose, the authors have experimented with the random sending of
encoded parts of a message and the construction thereof to
demonstrate how data can stealthily be transferred across a network
so as to prevent the obvious retrieval of data.
Abstract: In this paper, we propose a method of alter duration in
frequency domain that control prosody in real time after pitch
alteration. If there has a method to alteration duration freely among
prosody information, that may used in several fields such as speech
impediment person's pronunciation proof reading or language study.
The pitch alteration method used control prosody altered by PSOLA
synthesis method which is in time domain processing method.
However, the duration of pitch alteration speech is changed by the
frequency domain. In this paper, we altered the duration with the
method of duration alteration by Fast Fourier Transformation in
frequency domain. Consequently, the intelligibility of the pitch and
duration are controlled has a slight decrease than the case when only
pitch is changed, but the proposed algorithm obtained the higher MOS
score about naturalness.