Abstract: The Boundary Representation of a 3D manifold contains
FACES (connected subsets of a parametric surface S : R2 -!
R3). In many science and engineering applications it is cumbersome
and algebraically difficult to deal with the polynomial set and
constraints (LOOPs) representing the FACE. Because of this reason, a
Piecewise Linear (PL) approximation of the FACE is needed, which is
usually represented in terms of triangles (i.e. 2-simplices). Solving the
problem of FACE triangulation requires producing quality triangles
which are: (i) independent of the arguments of S, (ii) sensitive to the
local curvatures, and (iii) compliant with the boundaries of the FACE
and (iv) topologically compatible with the triangles of the neighboring
FACEs. In the existing literature there are no guarantees for the point
(iii). This article contributes to the topic of triangulations conforming
to the boundaries of the FACE by applying the concept of parameterindependent
Gabriel complex, which improves the correctness of the
triangulation regarding aspects (iii) and (iv). In addition, the article
applies the geometric concept of tangent ball to a surface at a point to
address points (i) and (ii). Additional research is needed in algorithms
that (i) take advantage of the concepts presented in the heuristic
algorithm proposed and (ii) can be proved correct.
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: This paper focuses on the use of project work as a
pretext for applying the conventions of writing, or the correctness of
mechanics, usage, and sentence formation, in a content-based class in
a Rajabhat University. Its aim was to explore to what extent the
student teachers’ academic achievement of the basic writing features
against the 70% attainment target after the use of project is. The
organization of work around an agreed theme in which the students
reproduce language provided by texts and instructors is expected to
enhance students’ correct writing conventions. The sample of the
study comprised of 38 fourth-year English major students. The data
was collected by means of achievement test and student writing
works. The scores in the summative achievement test were analyzed
by mean score, standard deviation, and percentage. It was found that
the student teachers do more achieve of practicing mechanics and
usage, and less in sentence formation. The students benefited from
the exposure to texts during conducting the project; however, their
automaticity of how and when to form phrases and clauses into
simple/complex sentences had room for improvement.
Abstract: Wireless mobile communications have experienced
the phenomenal growth through last decades. The advances in
wireless mobile technologies have brought about a demand for high
quality multimedia applications and services. For such applications
and services to work, signaling protocol is required for establishing,
maintaining and tearing down multimedia sessions. The Session
Initiation Protocol (SIP) is an application layer signaling protocols,
based on request/response transaction model. This paper considers
SIP INVITE transaction over an unreliable medium, since it has been
recently modified in Request for Comments (RFC) 6026. In order to
help in assuring that the functional correctness of this modification is
achieved, the SIP INVITE transaction is modeled and analyzed using
Colored Petri Nets (CPNs). Based on the model analysis, it is
concluded that the SIP INVITE transaction is free of livelocks and
dead codes, and in the same time it has both desirable and
undesirable deadlocks. Therefore, SIP INVITE transaction should be
subjected for additional updates in order to eliminate undesirable
deadlocks. In order to reduce the cost of implementation and
maintenance of SIP, additional remodeling of the SIP INVITE
transaction is recommended.
Abstract: In this paper, we generalize several techniques in
developing Fault Tolerant Software. We introduce property
“Correctness" in evaluating N-version Systems and compare it to
some commonly used properties such as reliability or availability.
We also find out the relation between this property and the number of
versions of system. Our experiments to verify the correctness and the
applicability of the relation are also presented.
Abstract: In order to research Internet quantificationally and
better model the performance of network, this paper proposes a novel
AS level network performance model (MNPM), it takes autonomous
system (AS) as basic modeling unit, measures E2E performance
between any two outdegrees of an AS and organizes measurement
results into matrix form which called performance matrix (PM).
Inter-AS performance calculation is defined according to performance
information stored in PM. Simulation has been implemented to verify
the correctness of MNPM and a practical application of MNPM
(network congestion detection) is given.