Ontology is an important part of the W3C standards for the Semantic Web used to specify standard conceptual vocabularies to exchange data among systems, provide reusable knowledge bases, and facilitate interoperability across multiple heterogeneous systems and databases. However, current ontology is not sufficient for handling vague information that is commonly found in many application domains...

General method of side-channel attacks protection, based on random cipher isomorphisms is presented. Isomorphic ciphers produce common outputs for common inputs. Cipher isomor-phisms can be changed independently on transmitting and receiving sides. Two methods of RIJNDAEL protection are considered. The first one is based on random commutative isomor-phisms of underlying structure. The set of fi...

in this paper a network comprising alternative branching nodes with probabilistic outcomes is considered. in other words, network nodes are probabilistic with exclusive-or receiver and exclusive-or emitter. first, an analytical approach is proposed to simplify the structure of network. then, it is assumed that the duration of activities is positive trapezoidal fuzzy number (tfn). this paper com...

....................................................................................................................... v 1.0 INTRODUCTION ...................................................................................................... 1 1.1 What is Phase Change? ............................................................................................. 1 1.2 Other Work in this Area ......

Fuzzy numbers in number theory are a foundation of fuzzy sets and fuzzy mathematics that extend the domain of numbers from those of real numbers to fuzzy numbers. Fuzzy arithmetic is a system of fuzzy operations on fuzzy numbers. A theory of fuzzy arithmetic is presented towards a fuzzy mathematical structure for fuzzy inference and cognitive computation. The mathematical models of fuzzy number...

We derive upper and lower bounds for the policy regret of T -round online learning problems with graph-structured feedback, where the adversary is nonoblivious but assumed to have a bounded memory. We obtain upper bounds of Õ(T ) and Õ(T ) for strongly-observable and weakly-observable graphs, respectively, based on analyzing a variant of the Exp3 algorithm. When the adversary is allowed a bound...

We initiate the study of perfectly secure multiparty computation over asynchronous networks tolerating generalized adversaries. The classical results in information-theoretically secure asynchronous multiparty computation among n players state that less than n4 active adversaries can be tolerated in the perfect setting [4]. Strictly generalizing these results to the non-threshold setting, we sh...

Wireless sensor networks are easily compromised by an adversary, such as fabricated with false votes attacks and false votes on real reports attacks. These attacks generate false data to drain the energy resource of sensors and interrupt the inflow of a real report. PVFS was proposed to detect them by verifying votes in the real report. When a real event occurs, a cluster head collects all of t...

Many sensor network applications are dependent on the secure operation of networks, and serious problems may result if the network is disrupted or injured. An adversary using these restrictions can compromise sensors and use them to inject bogus reports into the network. Bogus reports can lead to both false alarms and the depletion of limited resources. A statistical enroute filtering scheme (S...

A fundamental communication primitive in distributed computing is Reliable Message Transmission (RMT), which refers to the task of correctly sending a message from a party to another, despite the presence of Byzantine corruptions. In this work we address the problem in the general adversary model of Hirt and Maurer [5], which subsumes earlier models such as the global or local threshold adversa...