866 resultados para split-operator scheme
Resumo:
Dynamic conferencing refers to a scenario wherein any subset of users in a universe of users form a conference for sharing confidential information among themselves. The key distribution (KD) problem in dynamic conferencing is to compute a shared secret key for such a dynamically formed conference. In literature, the KD schemes for dynamic conferencing either are computationally unscalable or require communication among users, which is undesirable. The extended symmetric polynomial based dynamic conferencing scheme (ESPDCS) is one such KD scheme which has a high computational complexity that is universe size dependent. In this paper we present an enhancement to the ESPDCS scheme to develop a KD scheme called universe-independent SPDCS (UI-SPDCS) such that its complexity is independent of the universe size. However, the UI-SPDCS scheme does not scale with the conference size. We propose a relatively scalable KD scheme termed as DH-SPDCS that uses the UI-SPDCS scheme and the tree-based group Diffie- Hellman (TGDH) key exchange protocol. The proposed DH-SPDCS scheme provides a configurable trade-off between computation and communication complexity of the scheme.
Resumo:
Waveband switching (WBS) is an important technique to save switching and transmission cost in wavelength -division multiplexed (WDM) optical networks. A cost-efficient WBS scheme would enable network carriers to increase the network throughput (revenue) while achieving significant cost savings. We identify the critical factors that determine the WBS network throughput and switching cost and propose a novel intermediate waveband switching (IT-WBS) algorithm, called the minimizing-weighted-cost (MWC) algorithm. The MWC algorithm defines a cost for each candidate route of a call. By selecting the route with the smallest weighted cost, MWC balances between minimizing the call blocking probability and minimizing the network switching cost. Our simulations show that MWC outperforms other wavelength/waveband switching algorithms and can enhance the network throughput at a reduced cost.
Resumo:
Key management is a core mechanism to ensure the security of applications and network services in wireless sensor networks. It includes two aspects: key distribution and key revocation. Key distribution has been extensively studied in the context of sensor networks. However, key revocation has received relatively little attention. Existing key revocation schemes can be divided into two categories: centralized key revocation scheme and distributed key revocation scheme. In this paper, we first summarize the current key revocation schemes for sensor networks. Then, we propose an efficient centralized key revocation scheme, KeyRev, for wireless sensor networks. Unlike most proposed key revocation schemes focusing on removing the compromised keys, we propose to use key updating techniques to obsolesce the keys owned by the compromised sensor nodes and thus remove the nodes from the network. Our analyses show that the KeyRev scheme is secure inspite of not removing the pre-distributed key materials at compromised sensor nodes. Simulation results also indicate that the KeyRev scheme is scalable and performs very well in wireless sensor networks.
Resumo:
We propose an efficient scheduling scheme that optimizes advance-reserved lightpath services in reconfigurable WDM networks. A re-optimization approach is devised to reallocate network resources for dynamic service demands while keeping determined schedule unchanged.
Resumo:
The ICT revolution has permeated every profession and all areas of human endeavour. Professions such as law, medicine , engineering, and library and information science are adjusting to the ICT environment through re-tooling, retraining, and curriculum revision. The purpose of this study is to explore the impact of ICT on the student industrial work experience scheme (SIWES) of library and information science students. It traces the historical development of the scheme, the ICT development trends in LIS, and the challenges this development brings to SIWES. Strategies to absorb this shock created by ICT are offered.
Resumo:
We define the Virasoro algebra action on imaginary Verma modules for affine and construct an analogue of the Knizhnik-Zamolodchikov equation in the operator form. Both these results are based on a realization of imaginary Verma modules in terms of sums of partial differential operators.
Resumo:
The study proposes a constrained least square (CLS) pre-distortion scheme for multiple-input single-output (MISO) multiple access ultra-wideband (UWB) systems. In such a scheme, a simple objective function is defined, which can be efficiently solved by a gradient-based algorithm. For the performance evaluation, scenarios CM1 and CM3 of the IEEE 802.15.3a channel model are considered. Results show that the CLS algorithm has a fast convergence and a good trade-off between intersymbol interference (ISI) and multiple access interference (MAI) reduction and signal-to-noise ratio (SNR) preservation, performing better than time-reversal (TR) pre-distortion.
Resumo:
A new methodology for the synthesis of tunable patch filters is presented. The methodology helps the designer to perform a theoretical analysis of the filter through a coupling matrix that includes the effect of the tuning elements used to tune the filter. This general methodology accounts for any tuning parameter desired and was applied to the design of a tunable dual-mode patch filter with independent control of center frequency and bandwidth (BW). The bandpass filter uses a single triangular resonator with two etched slots that split the fundamental degenerate modes and form the filter passband. Varactor diodes assembled across the slots are used to vary the frequency of each degenerate fundamental mode independently, which is feasible due to the nature of the coupling scheme of the filter. The varactor diode model used in simulations, their assembling, the dc bias configuration, and measured results are presented. The theory results are compared to the simulations and to measurements showing a very good agreement and validating the proposed methodology. The fabricated filter presents an elliptic response with 20% of center frequency tuning range around 3.2 GHz and a fractional BW variation from 4% to 12% with low insertion loss and high power handling with a 1-dB compression point higher than +14.5 dB.
Resumo:
The neutron-rich lead isotopes, up to Pb-216, have been studied for the first time, exploiting the fragmentation of a primary uranium beam at the FRS-RISING setup at GSI. The observed isomeric states exhibit electromagnetic transition strengths which deviate from state-of-the-art shell-model calculations. It is shown that their complete description demands the introduction of effective three-body interactions and two-body transition operators in the conventional neutron valence space beyond Pb-208.
Resumo:
Consider a communication system in which a transmitter equipment sends fixed-size packets of data at a uniform rate to a receiver equipment. Consider also that these equipments are connected by a packet-switched network, which introduces a random delay to each packet. Here we propose an adaptive clock recovery scheme able of synchronizing the frequencies and the phases of these devices, within specified limits of precision. This scheme for achieving frequency and phase synchronization is based on measurements of the packet arrival times at the receiver, which are used to control the dynamics of a digital phase-locked loop. The scheme performance is evaluated via numerical simulations performed by using realistic parameter values. (C) 2011 Elsevier By. All rights reserved.
Resumo:
This paper reports experiments on the use of a recently introduced advection bounded upwinding scheme, namely TOPUS (Computers & Fluids 57 (2012) 208-224), for flows of practical interest. The numerical results are compared against analytical, numerical and experimental data and show good agreement with them. It is concluded that the TOPUS scheme is a competent, powerful and generic scheme for complex flow phenomena.
Resumo:
This paper deals with the numerical solution of complex fluid dynamics problems using a new bounded high resolution upwind scheme (called SDPUS-C1 henceforth), for convection term discretization. The scheme is based on TVD and CBC stability criteria and is implemented in the context of the finite volume/difference methodologies, either into the CLAWPACK software package for compressible flows or in the Freeflow simulation system for incompressible viscous flows. The performance of the proposed upwind non-oscillatory scheme is demonstrated by solving two-dimensional compressible flow problems, such as shock wave propagation and two-dimensional/axisymmetric incompressible moving free surface flows. The numerical results demonstrate that this new cell-interface reconstruction technique works very well in several practical applications. (C) 2012 Elsevier Inc. All rights reserved.
Resumo:
The deformation of a ring under axial compression is analyzed in order to estimate a favorable ring specimen geometry capable of limiting the influence of friction on the stress-strain curve obtained from SHPB tests. The analysis shows that the use of a ring specimen with a large inner diameter and a small radial thickness offers some advantages comparing with the traditional disk sample. In particular, it can improve the reliability of the test results for ductile materials in the presence of friction. Based on the deformation analysis of a ductile ring under compression, a correction coefficient is proposed to relate the actual material stress strain curve with the reading from the SHPB. It is shown using finite element simulation that the proposed correction can be used for a wide range of conventional ductile materials. Experimental results with steel alloys indicate that the correction procedure is an effective technique for an accurate measurement of the dynamic material strength response. (C) 2012 Elsevier Ltd. All rights reserved.
Resumo:
Three-party password-authenticated key exchange (3PAKE) protocols allow entities to negotiate a secret session key with the aid of a trusted server with whom they share a human-memorable password. Recently, Lou and Huang proposed a simple 3PAKE protocol based on elliptic curve cryptography, which is claimed to be secure and to provide superior efficiency when compared with similar-purpose solutions. In this paper, however, we show that the solution is vulnerable to key-compromise impersonation and offline password guessing attacks from system insiders or outsiders, which indicates that the empirical approach used to evaluate the scheme's security is flawed. These results highlight the need of employing provable security approaches when designing and analyzing PAKE schemes. Copyright (c) 2011 John Wiley & Sons, Ltd.
Resumo:
Measurement-based quantum computation is an efficient model to perform universal computation. Nevertheless, theoretical questions have been raised, mainly with respect to realistic noise conditions. In order to shed some light on this issue, we evaluate the exact dynamics of some single-qubit-gate fidelities using the measurement-based quantum computation scheme when the qubits which are used as a resource interact with a common dephasing environment. We report a necessary condition for the fidelity dynamics of a general pure N-qubit state, interacting with this type of error channel, to present an oscillatory behavior, and we show that for the initial canonical cluster state, the fidelity oscillates as a function of time. This state fidelity oscillatory behavior brings significant variations to the values of the computational results of a generic gate acting on that state depending on the instants we choose to apply our set of projective measurements. As we shall see, considering some specific gates that are frequently found in the literature, the fast application of the set of projective measurements does not necessarily imply high gate fidelity, and likewise the slow application thereof does not necessarily imply low gate fidelity. Our condition for the occurrence of the fidelity oscillatory behavior shows that the oscillation presented by the cluster state is due exclusively to its initial geometry. Other states that can be used as resources for measurement-based quantum computation can present the same initial geometrical condition. Therefore, it is very important for the present scheme to know when the fidelity of a particular resource state will oscillate in time and, if this is the case, what are the best times to perform the measurements.