9 resultados para P-Compact Space
em Aston University Research Archive
Resumo:
A free space quantum key distribution system has been demonstrated. Consideration has been given to factors such as field of view and spectral width, to cut down the deleterious effect from background light levels. Suitable optical sources such as lasers and RCLEDs have been investigated as well as optimal wavelength choices, always with a view to building a compact and robust system. The implementation of background reduction measures resulted in a system capable of operating in daylight conditions. An autonomous system was left running and generating shared key material continuously for over 7 days. © 2009 Published by Elsevier B.V..
Resumo:
In this paper we discuss a fast Bayesian extension to kriging algorithms which has been used successfully for fast, automatic mapping in emergency conditions in the Spatial Interpolation Comparison 2004 (SIC2004) exercise. The application of kriging to automatic mapping raises several issues such as robustness, scalability, speed and parameter estimation. Various ad-hoc solutions have been proposed and used extensively but they lack a sound theoretical basis. In this paper we show how observations can be projected onto a representative subset of the data, without losing significant information. This allows the complexity of the algorithm to grow as O(n m 2), where n is the total number of observations and m is the size of the subset of the observations retained for prediction. The main contribution of this paper is to further extend this projective method through the application of space-limited covariance functions, which can be used as an alternative to the commonly used covariance models. In many real world applications the correlation between observations essentially vanishes beyond a certain separation distance. Thus it makes sense to use a covariance model that encompasses this belief since this leads to sparse covariance matrices for which optimised sparse matrix techniques can be used. In the presence of extreme values we show that space-limited covariance functions offer an additional benefit, they maintain the smoothness locally but at the same time lead to a more robust, and compact, global model. We show the performance of this technique coupled with the sparse extension to the kriging algorithm on synthetic data and outline a number of computational benefits such an approach brings. To test the relevance to automatic mapping we apply the method to the data used in a recent comparison of interpolation techniques (SIC2004) to map the levels of background ambient gamma radiation. © Springer-Verlag 2007.
Resumo:
Non-uniform B-spline dictionaries on a compact interval are discussed in the context of sparse signal representation. For each given partition, dictionaries of B-spline functions for the corresponding spline space are built up by dividing the partition into subpartitions and joining together the bases for the concomitant subspaces. The resulting slightly redundant dictionaries are composed of B-spline functions of broader support than those corresponding to the B-spline basis for the identical space. Such dictionaries are meant to assist in the construction of adaptive sparse signal representation through a combination of stepwise optimal greedy techniques.
Resumo:
Classification is the most basic method for organizing resources in the physical space, cyber space, socio space and mental space. To create a unified model that can effectively manage resources in different spaces is a challenge. The Resource Space Model RSM is to manage versatile resources with a multi-dimensional classification space. It supports generalization and specialization on multi-dimensional classifications. This paper introduces the basic concepts of RSM, and proposes the Probabilistic Resource Space Model, P-RSM, to deal with uncertainty in managing various resources in different spaces of the cyber-physical society. P-RSM’s normal forms, operations and integrity constraints are developed to support effective management of the resource space. Characteristics of the P-RSM are analyzed through experiments. This model also enables various services to be described, discovered and composed from multiple dimensions and abstraction levels with normal form and integrity guarantees. Some extensions and applications of the P-RSM are introduced.
Resumo:
A novel approach to optical subcarrier multiplexing with compact spectrum is demonstrated using a 42.6 Gbit/s AM-PSK payload and 2.5 Gbit/s NRZ label. In this implementation, the payload introduces a 4.8 dB penalty on the label receiver sensitivity, and the label causes <1 dB penalty on the payload receiver sensitivity.
Resumo:
We describe a free space quantum cryptography system which is designed to allow continuous unattended key exchanges for periods of several days, and over ranges of a few kilometres. The system uses a four-laser faint-pulse transmission system running at a pulse rate of 10MHz to generate the required four alternative polarization states. The receiver module similarly automatically selects a measurement basis and performs polarization measurements with four avalanche photodiodes. The controlling software can implement the full key exchange including sifting, error correction, and privacy amplification required to generate a secure key.
Resumo:
A ground-based laser system for space-debris cleaning will use powerful laser pulses that can self-focus while propagating through the atmosphere. We demonstrate that for the relevant laser parameters, this self-focusing can noticeably decrease the laser intensity on the target. We show that the detrimental effect can be, to a great extent, compensated for by applying the optimal initial beam defocusing. The effect of laser elevation on the system performance is discussed.
Resumo:
Purpose: To study the mechanical and dynamic swelling properties of grewia gum, evaluate its compression behaviour and determine the effect of drying methods on its properties. Methods: Compacts (500 mg) of both freeze-dried and air-dried grewia gum were separately prepared by compression on a potassium bromide (KBr) press at different pressures and subjected to Heckel analysis. Swelling studies were performed using 200 mg compacts of the gum (freeze-dried or air-dried) compressed on a KBr press. The mechanical properties of the films of the gum prepared by casting 1 % dispersions of the gum were evaluated using Hounsfield tensiometer. The mechanical properties of grewia gum films were compared with films of pullulan and guar gum which were similarly prepared. The effect of temperature on the water uptake of the compacts was studied and the data subjected to Schott's analysis. Results: Drying conditions had no effect on the yield pressure of the gum compacts as both air-dried and freeze-dried fractions had a yield pressure of 322.6 MPa. The plots based on Schott's equation for the grewia gum samples showed that both samples (freeze-dried and air-dried) exhibited long swelling times. Grewia gum film had a tensile strength of 19.22±3.61 MPa which was similar to that of pullulan films (p > 0.05). It had an elastic modulus of 2.13±0.12 N/mm2 which was significantly lower (p < 0.05) than those of pullulan and guar gum with elastic moduli of 3.33±0.00 and 2.86±0.00 N/mm2, respectively. Conclusion: The type of drying method used does not have any effect on the degree of plasticity of grewia gum compacts. Grewia gum obtained by either drying method exhibited extended swelling duration. Matrix tablet formulations of the gum will likely swell slowly and promote sustained release of drug. © Pharmacotherapy Group, Faculty of Pharmacy, University of Benin, Benin City.
Resumo:
This research focuses on automatically adapting a search engine size in response to fluctuations in query workload. Deploying a search engine in an Infrastructure as a Service (IaaS) cloud facilitates allocating or deallocating computer resources to or from the engine. Our solution is to contribute an adaptive search engine that will repeatedly re-evaluate its load and, when appropriate, switch over to a dierent number of active processors. We focus on three aspects and break them out into three sub-problems as follows: Continually determining the Number of Processors (CNP), New Grouping Problem (NGP) and Regrouping Order Problem (ROP). CNP means that (in the light of the changes in the query workload in the search engine) there is a problem of determining the ideal number of processors p active at any given time to use in the search engine and we call this problem CNP. NGP happens when changes in the number of processors are determined and it must also be determined which groups of search data will be distributed across the processors. ROP is how to redistribute this data onto processors while keeping the engine responsive and while also minimising the switchover time and the incurred network load. We propose solutions for these sub-problems. For NGP we propose an algorithm for incrementally adjusting the index to t the varying number of virtual machines. For ROP we present an ecient method for redistributing data among processors while keeping the search engine responsive. Regarding the solution for CNP, we propose an algorithm determining the new size of the search engine by re-evaluating its load. We tested the solution performance using a custom-build prototype search engine deployed in the Amazon EC2 cloud. Our experiments show that when we compare our NGP solution with computing the index from scratch, the incremental algorithm speeds up the index computation 2{10 times while maintaining a similar search performance. The chosen redistribution method is 25% to 50% faster than other methods and reduces the network load around by 30%. For CNP we present a deterministic algorithm that shows a good ability to determine a new size of search engine. When combined, these algorithms give an adapting algorithm that is able to adjust the search engine size with a variable workload.