Abstract: There exists an injective, information-preserving function
that maps a semantic network (i.e a directed labeled network)
to a directed network (i.e. a directed unlabeled network). The edge
label in the semantic network is represented as a topological feature
of the directed network. Also, there exists an injective function that
maps a directed network to an undirected network (i.e. an undirected
unlabeled network). The edge directionality in the directed network
is represented as a topological feature of the undirected network.
Through function composition, there exists an injective function that
maps a semantic network to an undirected network. Thus, aside from
space constraints, the semantic network construct does not have any
modeling functionality that is not possible with either a directed
or undirected network representation. Two proofs of this idea will
be presented. The first is a proof of the aforementioned function
composition concept. The second is a simpler proof involving an
undirected binary encoding of a semantic network.
Abstract: In this paper, a new time discontinuous expanded mixed finite element method is proposed and analyzed for two-order convection-dominated diffusion problem. The proofs of the stability of the proposed scheme and the uniqueness of the discrete solution are given. Moreover, the error estimates of the scalar unknown, its gradient and its flux in the L1( ¯ J,L2( )-norm are obtained.
Abstract: RFID tag is a small and inexpensive microchip which is
capable of transmitting unique identifier through wireless network in a
short distance. If a group of RFID tags can be scanned simultaneously
by one reader, RFID Group proof could be generated. Group proof can
be used in various applications, such as good management which is
usually achieved using barcode system. A lot of RFID group proof
schemes have been proposed by many researchers. In this paper, we
introduce some existing group proof schemes and then analyze their
vulnerabilities to the privacy. Moreover, we propose a new attack
model, which threats the privacy of user by tracking tags in a group.
Abstract: As in today's semiconductor industries test costs can make up to 50 percent of the total production costs, an efficient test error detection becomes more and more important. In this paper, we present a new machine learning approach to test error detection that should provide a faster recognition of test system faults as well as an improved test error recall. The key idea is to learn a classifier ensemble, detecting typical test error patterns in wafer test results immediately after finishing these tests. Since test error detection has not yet been discussed in the machine learning community, we define central problem-relevant terms and provide an analysis of important domain properties. Finally, we present comparative studies reflecting the failure detection performance of three individual classifiers and three ensemble methods based upon them. As base classifiers we chose a decision tree learner, a support vector machine and a Bayesian network, while the compared ensemble methods were simple and weighted majority vote as well as stacking. For the evaluation, we used cross validation and a specially designed practical simulation. By implementing our approach in a semiconductor test department for the observation of two products, we proofed its practical applicability.
Abstract: During the last couple of years, the degree of dependence on IT systems has reached a dimension nobody imagined to be possible 10 years ago. The increased usage of mobile devices (e.g., smart phones), wireless sensor networks and embedded devices (Internet of Things) are only some examples of the dependency of modern societies on cyber space. At the same time, the complexity of IT applications, e.g., because of the increasing use of cloud computing, is rising continuously. Along with this, the threats to IT security have increased both quantitatively and qualitatively, as recent examples like STUXNET or the supposed cyber attack on Illinois water system are proofing impressively. Once isolated control systems are nowadays often publicly available - a fact that has never been intended by the developers. Threats to IT systems don’t care about areas of responsibility. Especially with regard to Cyber Warfare, IT threats are no longer limited to company or industry boundaries, administrative jurisdictions or state boundaries. One of the important countermeasures is increased cooperation among the participants especially in the field of Cyber Defence. Besides political and legal challenges, there are technical ones as well. A better, at least partially automated exchange of information is essential to (i) enable sophisticated situational awareness and to (ii) counter the attacker in a coordinated way. Therefore, this publication performs an evaluation of state of the art Intrusion Detection Message Exchange protocols in order to guarantee a secure information exchange between different entities.
Abstract: Various solar energy technologies exist and they have
different application techniques in the generation of electrical power.
The widespread use of photovoltaic (PV) modules in such
technologies has been limited by relatively high costs and low
efficiencies. The efficiency of PV panels decreases as the operating
temperatures increase. This is due to the affect of solar intensity and
ambient temperature. In this work, Computational Fluid Dynamics
(CFD) was used to model the heat transfer from a standard PV panel
and thus determine the rate of dissipation of heat. To accurately
model the specific climatic conditions of the United Arab Emirates
(UAE), a case study of a new build green building in Dubai was
used. A finned heat pipe arrangement is proposed and analyzed to
determine the improved heat dissipation and thus improved
performance efficiency of the PV panel. A prototype of the
arrangement is built for experimental testing to validate the CFD
modeling and proof of concept.
Abstract: Arenga pinnata is an abundantly natural fiber that can be used for sound proof material. However, the scientific data of acoustics properties of Arenga pinnata was not available yet. In this study the sound absorption of pure arenga pinnata was measured. The thickness of Arenga pinnata was varied in 10 mm, 20 mm, 30mm, and 40mm. This work was carried out to investigate the potential of using Arenga pinnata fiber as raw material for sound absorbing material. Impedance Tube Method was used to measure sound absorption coefficient (α). The Measurements was done in accordance with ASTM E1050-98, that is the standard test method for impedance and absorption of acoustical materials using a tube, two microphones and a digital frequency analysis system . The results showed that sound absorption coefficients of Arenga pinnata were good from 2000 Hz to 5000 Hz within the range of 0.75 – 0.90. The optimum sound absorption coefficient was obtained from the thickness of 40 mm. These results indicated that Arenga pinnata fiber is promising to be used as raw material of sound absorbing material with low cost, light, and biodegradable.
Abstract: Urban water management in Australia faces increasing pressure to deal with the challenges of droughts, growing population and the climate change uncertainty. Addressing these challenges is an opportunity to incorporate the parallel goals of sustainable water management and climate change adaptation through holistic, non-technical means. This paper presents case studies from Perth and Sydney which show how despite robust adaptation plans and experience, recent efforts to 'drought proof' cities have focused on supply-side measures (i.e. desalination), rather than rethinking how water is used and managing demand. The trend towards desalination as a climate adaptation measure raises questions about the sustainability of urban water futures in Australia.
Abstract: This paper presents a protocol aiming at proving that an encryption system contains structural weaknesses without disclosing any information on those weaknesses. A verifier can check in a polynomial time that a given property of the cipher system output has been effectively realized. This property has been chosen by the prover in such a way that it cannot been achieved by known attacks or exhaustive search but only if the prover indeed knows some undisclosed weaknesses that may effectively endanger the cryptosystem security. This protocol has been denoted zero-knowledge-like proof of cryptanalysis. In this paper, we apply this protocol to the Bluetooth core encryption algorithm E0, used in many mobile environments and thus we suggest that its security can seriously be put into question.
Abstract: A proof of convergence of a new continuation algorithm for computing the Analytic SVD for a large sparse parameter– dependent matrix is given. The algorithm itself was developed and numerically tested in [5].
Abstract: In the Top Right Access point Minimum Length Corridor (TRA-MLC) problem [1], a rectangular boundary partitioned into rectilinear polygons is given and the problem is to find a corridor of least total length and it must include the top right corner of the outer rectangular boundary. A corridor is a tree containing a set of line segments lying along the outer rectangular boundary and/or on the boundary of the rectilinear polygons. The corridor must contain at least one point from the boundaries of the outer rectangle and also the rectilinear polygons. Gutierrez and Gonzalez [1] proved that the MLC problem, along with some of its restricted versions and variants, are NP-complete. In this paper, we give a shorter proof of NP-Completeness of TRA-MLC by findig the reduction in the following way.
Abstract: In this paper, we propose ablock-wise watermarking scheme for color image authentication to resist malicious tampering of digital media. The thresholding technique is incorporated into the scheme such that the tampered region of the color image can be recovered with high quality while the proofing result is obtained. The watermark for each block consists of its dual authentication data and the corresponding feature information. The feature information for recovery iscomputed bythe thresholding technique. In the proofing process, we propose a dual-option parity check method to proof the validity of image blocks. In the recovery process, the feature information of each block embedded into the color image is rebuilt for high quality recovery. The simulation results show that the proposed watermarking scheme can effectively proof the tempered region with high detection rate and can recover the tempered region with high quality.
Abstract: In this article, a formal specification and verification of the Rabin public-key scheme in a formal proof system is presented. The idea is to use the two views of cryptographic verification: the computational approach relying on the vocabulary of probability theory and complexity theory and the formal approach based on ideas and techniques from logic and programming languages. A major objective of this article is the presentation of the first computer-proved implementation of the Rabin public-key scheme in Isabelle/HOL. Moreover, we explicate a (computer-proven) formalization of correctness as well as a computer verification of security properties using a straight-forward computation model in Isabelle/HOL. The analysis uses a given database to prove formal properties of our implemented functions with computer support. The main task in designing a practical formalization of correctness as well as efficient computer proofs of security properties is to cope with the complexity of cryptographic proving. We reduce this complexity by exploring a light-weight formalization that enables both appropriate formal definitions as well as efficient formal proofs. Consequently, we get reliable proofs with a minimal error rate augmenting the used database, what provides a formal basis for more computer proof constructions in this area.
Abstract: The group mutual exclusion (GME) problem is an
interesting generalization of the mutual exclusion problem. Several
solutions of the GME problem have been proposed for message
passing distributed systems. However, none of these solutions is
suitable for real time distributed systems. In this paper, we propose a
token-based distributed algorithms for the GME problem in soft real
time distributed systems. The algorithm uses the concepts of priority
queue, dynamic request set and the process state. The algorithm uses
first come first serve approach in selecting the next session type
between the same priority levels and satisfies the concurrent
occupancy property. The algorithm allows all n processors to be
inside their CS provided they request for the same session. The
performance analysis and correctness proof of the algorithm has also
been included in the paper.
Abstract: In this paper we will constructively prove the existence
of an equilibrium in a competitive economy with sequentially locally
non-constant excess demand functions. And we will show that the
existence of such an equilibrium in a competitive economy implies
Sperner-s lemma. We follow the Bishop style constructive mathematics.
Abstract: According to the governmental data, the cases of oral
cancers doubled in the past 10 years. This had brought heavy burden to
the patients- family, the society, and the country. The literature
generally evidenced the betel nut contained particular chemicals that
can cause oral cancers. Research in Taiwan had also proofed that 90
percent of oral cancer patients had experience of betel nut chewing. It
is thus important to educate the betel-nut hobbyists to cease such a
hazardous behavior. A program was then organized to establish
several training classes across different areas specific to help ceasing
this particular habit. Purpose of this research was to explore the
attitude and intention toward ceasing betel-nut chewing before and
after attending the training classes. 50 samples were taken from a
ceasing class with average age at 45 years old with high school
education (54%). 74% of the respondents were male in service or
agricultural industries. Experiences in betel-nut chewing were 5-20
years with a dose of 1-20 pieces per day. The data had shown that 60%
of the respondents had cigarette smoking habit, and 30% of the
respondents were concurrently alcoholic dependent. Research results
indicated that the attitude, intentions, and the knowledge on oral
cancers were found significant different between before and after
attendance. This provided evidence for the effectiveness of the training
class. However, we do not perform follow-up after the class.
Noteworthy is the test result also shown that participants who were
drivers as occupation, or habitual smokers or alcoholic dependents
would be less willing to quit the betel-nut chewing. The test results
indicated as well that the educational levels and the type of occupation
may have significant impacts on an individual-s decisions in taking
betel-nut or substance abuse.
Abstract: This paper introduces a temporal epistemic logic
CBCTL that updates agent-s belief states through communications
in them, based on computational tree logic (CTL). In practical
environments, communication channels between agents may not be
secure, and in bad cases agents might suffer blackouts. In this study,
we provide inform* protocol based on ACL of FIPA, and declare the
presence of secure channels between two agents, dependent on time.
Thus, the belief state of each agent is updated along with the progress
of time. We show a prover, that is a reasoning system for a given
formula in a given a situation of an agent ; if it is directly provable
or if it could be validated through the chains of communications, the
system returns the proof.
Abstract: Foundation of tower crane serves to ensure stability
against vertical and horizontal forces. If foundation stress is not
sufficient, tower crane may be subject to overturning, shearing or
foundation settlement. Therefore, engineering review of stable support
is a highly critical part of foundation design. However, there are not
many professionals who can conduct engineering review of tower
crane foundation and, if any, they have information only on a small
number of cranes in which they have hands-on experience. It is also
customary to rely on empirical knowledge and tower crane renter-s
recommendations rather than designing foundation on the basis of
engineering knowledge. Therefore, a foundation design automation
system considering not only lifting conditions but also overturning
risk, shearing and vertical force may facilitate production of foolproof
foundation design for experts and enable even non-experts to utilize
professional knowledge that only experts can access now. This study
proposes Automatic Design Algorithm for the Tower Crane
Foundations considering load and horizontal force.
Abstract: In this article 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 (σ-algebras, probability spaces and conditional
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 article 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 cryptographic
research, if the corresponding basic mathematical knowledge
is available in a database.
Abstract: Software reliability, defined as the probability of a
software system or application functioning without failure or errors
over a defined period of time, has been an important area of research
for over three decades. Several research efforts aimed at developing
models to improve reliability are currently underway. One of the
most popular approaches to software reliability adopted by some of
these research efforts involves the use of operational profiles to
predict how software applications will be used. Operational profiles
are a quantification of usage patterns for a software application. The
research presented in this paper investigates an innovative multiagent
framework for automatic creation and management of
operational profiles for generic distributed systems after their release
into the market. The architecture of the proposed Operational Profile
MAS (Multi-Agent System) is presented along with detailed
descriptions of the various models arrived at following the analysis
and design phases of the proposed system. The operational profile in
this paper is extended to comprise seven different profiles. Further,
the criticality of operations is defined using a new composed metrics
in order to organize the testing process as well as to decrease the time
and cost involved in this process. A prototype implementation of the
proposed MAS is included as proof-of-concept and the framework is
considered as a step towards making distributed systems intelligent
and self-managing.