In this paper we present a signaling protocol for QoS differentiation suitable for optical burst switching networks. The proposed protocol is a two-way reservation scheme that employs delayed and in-advance reservatio...
详细信息
In this paper we present a signaling protocol for QoS differentiation suitable for optical burst switching networks. The proposed protocol is a two-way reservation scheme that employs delayed and in-advance reservation of resources. In this scheme delayed reservations may be relaxed, introducing a reservation duration parameter that is negotiated during call setup phase. This feature allows bursts to reserve resources beyond their actual size to increase their successful forwarding probability and is used to provide QoS differentiation. The proposed signaling protocol offers a low blocking probability for bursts that can tolerate the round-trip delay required for the reservations. We present the main features of the protocol and describe in detail timing considerations regarding the call setup and the reservation process. We also describe several methods for choosing the protocol parameters so as to optimize performance and present corresponding evaluation results. Furthermore, we compare the performance of the proposed protocol against that of two other typical reservation protocols, a Tell-and-Wait and a Tell-and-Go protocol.
Computational methods on molecular sequence data are at the heart of computational molecular biology. Identification of known or unknown DNA and RNA motifs or regions involved in various biological processes such as i...
Computational methods on molecular sequence data are at the heart of computational molecular biology. Identification of known or unknown DNA and RNA motifs or regions involved in various biological processes such as initiation of transcription, gene expression and translation, or the discovery of various types of repeats are some of the applications of major concern. An accurate identification and localization of such elements will allow biologists to perform deeper studies of the structure, function and evolution of genomes. This requires the development of faster and more complex mathematical models and computer algorithms. In this work we discuss current techniques to cope with string problems in molecular sequence data. We focus on Weighted Sequences and Sequences with “don't care characters”, explaining the open problems and their relevance to biological applications.
We propose a MAC protocol for mobile ad hoc networks that uses power control for the RTS/CTS and DATA frame transmissions in order to improve energy and capacity utilization efficiency. Unlike IEEE 802.11, in our sche...
详细信息
We propose a MAC protocol for mobile ad hoc networks that uses power control for the RTS/CTS and DATA frame transmissions in order to improve energy and capacity utilization efficiency. Unlike IEEE 802.11, in our scheme the RTS frames are not sent using the maximum transmission power to silence neighbouring nodes, and the CTS frames do not silence all receiving nodes to the same degree. In contrast, the transmission power of the RTS frames follows a slow start principle, while the CTS frames, which are sent at maximum transmission power, prevent the neighbouring nodes from transmitting their DATA frames with power more than a computed threshold, while allowing them to transmit at power levels less than that threshold. This is done by including in the RTS and the CTS frames additional information, such as the power of the transmissions, and the interference tolerance of the nodes. Moreover the DATA frames are sent at the minimum required transmission power increased by a small margin to ensure connectivity with the intended receiver, so as to cause minimal interference to neighbouring nodes and allow for future interference to be added to the receiver of the DATA frames. The power to be used by the transmitter is computed by the recipient of the RTS frame and is included in the CTS frame. It is expected that a network with such a power management scheme would achieve a better throughput performance and more power savings than a network without such a scheme
In this poster, we present an approach to contex-tualized semantic image annotation as an optimization problem. Ontologies are used to capture general and contextual knowledge of the domain considered, and a genetic a...
详细信息
In this poster, we present an approach to contex-tualized semantic image annotation as an optimization problem. Ontologies are used to capture general and contextual knowledge of the domain considered, and a genetic algorithm is applied to realize the final annotation. Experiments with images from the beach vacation domain demonstrate the performance of the proposed approach and illustrate the added value of utilizing contextual information.
To acquire detection performance required for an operational system in the detection for satellite image for environmental change, it is necessary to use multiple images over years to know the environmental changes ov...
详细信息
ISBN:
(纸本)9608457564
To acquire detection performance required for an operational system in the detection for satellite image for environmental change, it is necessary to use multiple images over years to know the environmental changes over years. This paper describes a method for decision-level fusion technique where the fusion can compensate for correlation among images. The fusion is done using possibilistic combiners based on T-norms families that better represent the correlation of images. This technique was applied to Nile River Delta, Egypt (1973, 1987). These images show the dramatic urban growth within the Nile River delta and the expansion of agriculture into adjoining desert areas.
To acquire detection performance required for an operational system in the detection for satellite image for environmental changes, it is necessary to use multiple images over years to know the environmental changes o...
详细信息
ISBN:
(纸本)9608457564
To acquire detection performance required for an operational system in the detection for satellite image for environmental changes, it is necessary to use multiple images over years to know the environmental changes over years. This paper describes a method for decision-level fusion technique where the fusion can compensate for correlation among images. The fusion is done using possibilistic combiners based on T-norms families that better represent the correlation of images. This technique was applied to satellite images for free vegetation of Africa (1998 April 01, 1998 September 01). The performance of this technique, compared to the other techniques such as naïve Bayes, Dempster-Shafer, voting, rule-based and linear discriminant, is evaluated by simple theoretical models.
In this paper the impact of user's hand holding a Multiple-Input-Multiple- Output (MIMO) terminal on the system performance is investigated. A 4×4 MIMO system is considered with a Personal Digital Assistant (...
详细信息
ISBN:
(纸本)9290929375
In this paper the impact of user's hand holding a Multiple-Input-Multiple- Output (MIMO) terminal on the system performance is investigated. A 4×4 MIMO system is considered with a Personal Digital Assistant (PDA) terminal equipped with a compact array of 4 patch elements. The radiation patterns of the antenna elements are simulated in the presence of the other elements and in the presence of a user's hand. The obtained patterns are used to evaluate the covariance matrix of the receive antenna which is incorporated in a correlation-based MIMO channel model. MIMO channel capacity is calculated to demonstrate the capacity degradation caused by the user's hand.
In this paper we introduce a new test-data compression method for IP cores with unknown structure. The proposed method encodes the test data provided by the core vendor using a new, very effective compression scheme b...
详细信息
ISBN:
(纸本)9783981080100
In this paper we introduce a new test-data compression method for IP cores with unknown structure. The proposed method encodes the test data provided by the core vendor using a new, very effective compression scheme based on multilevel Huffman coding. Specifically, three different kinds of information are compressed using the same Huffman code, and thus significant test data reductions are achieved. A simple architecture is proposed for decoding on-chip the compressed data. Its hardware overhead is very low and comparable to that of the most efficient methods in the literature. Additionally, the proposed technique offers increased probability of detection of unmodeled faults since the majority of the unknown values of the test set are replaced by pseudorandom data generated by an LFSR.
We consider a security problem on a distributed network. We assume a network whose nodes are vulnerable to infection by threats (e.g. viruses), the attackers. A system security software, the defender, is available in ...
详细信息
We consider a security problem on a distributed network. We assume a network whose nodes are vulnerable to infection by threats (e.g. viruses), the attackers. A system security software, the defender, is available in the system. However, due to the network’s size, economic and performance reasons, it is capable to provide safety, i.e. clean nodes from the possible presence of attackers, only to a limited part of it. The objective of the defender is to place itself in such a way as to maximize the number of attackers caught, while each attacker aims not to be caught. In [7], a basic case of this problem was modeled as a non-cooperative game, called the Edge model. There, the defender could protect a single link of the network. Here, we consider a more general case of the problem where the defender is able to scan and protect a set of k links of the network, which we call the Tuple model. It is natural to expect that this increased power of the defender should result in a better quality of protection for the network. Ideally, this would be achieved at little expense on the existence and complexity of Nash equilibria (profiles where no entity can improve its local objective unilaterally by switching placements on the network). In this paper we study pure and mixed Nash equilibria in the model. In particular, we propose algorithms for computing such equilibria in polynomial time and we provide a polynomial-time transformation of a special class of Nash equilibria, called matching equilibria, between the Edge model and the Tuple model, and vice versa. Finally, we establish that the increased power of the defender results in higher-quality protection of the network.
暂无评论