Search results for "TELECOMMUNICATIONS"
showing 10 items of 1639 documents
Finland
1999
Safeguarding the Ultra-dense Networks with the aid of Physical Layer Security: A review and a case study
2016
In the wake of the extensive application of the fourth generation system, investigations of new technologies have been moving ahead vigorously to embrace the next generation communications in 2020. Thereinto, the technique of ultra-dense networks (UDNs) serves as a key enabler in meeting the roaring mobile traffic demands. With the prevalence of mobile Internet services especially those involve the mobile payment, security has gained an unprecedented amount of attention and become a highlighted feature for the fifth generation. Resource allocation, one of the most significant tools on getting over the obstacle of ubiquitous interference as well as elevating the spectrum/energy efficiency, h…
Shall we follow? Impact of reputation concern on information security managers’ investment decisions
2020
Information security (infosec) is important for organizations. While budgeting for infosec is a crucial resource allocation decision, infosec managers may choose to follow other fellow experts’ recommendations or baseline practices. The present paper uses reputational herding theory to explain the decision made by infosec managers to use a “let's follow others” strategy in this context. Based on a sample of 106 organizations in Finland, we find that infosec managers’ ability to accurately predict the benefit of infosec investment, as well as their reputations, have significant effects on motivating them to discount their own information. Infosec managers’ discounting of their own informatio…
Minimal forbidden patterns of multi-dimensional shifts
2005
We study whether the entropy (or growth rate) of minimal forbidden patterns of symbolic dynamical shifts of dimension 2 or more, is a conjugacy invariant. We prove that the entropy of minimal forbidden patterns is a conjugacy invariant for uniformly semi-strongly irreducible shifts. We prove a weaker invariant in the general case.
A novel methodology for large-scale phylogeny partition
2011
Understanding the determinants of virus transmission is a fundamental step for effective design of screening and intervention strategies to control viral epidemics. Phylogenetic analysis can be a valid approach for the identification of transmission chains, and very-large data sets can be analysed through parallel computation. Here we propose and validate a new methodology for the partition of large-scale phylogenies and the inference of transmission clusters. This approach, on the basis of a depth-first search algorithm, conjugates the evaluation of node reliability, tree topology and patristic distance analysis. The method has been applied to identify transmission clusters of a phylogeny …
Wind speed spatial estimation for energy planning in Sicily: A neural kriging application
2008
Abstract One of the first steps for the exploitation of any energy source is necessarily represented by its estimation and mapping at the aim of identifying the most suitable areas in terms of energy potential. In the field of renewable energies this is often a very difficult task, because the energy source is in this case characterized by relevant variations over space and time. This implies that any temporal, but also spatial, estimation model has to be able to incorporate this spatial and temporal variability. The paper deals with the spatial estimation of the wind fields in Sicily (Italy) by following a data-driven approach. Starting from the results of a preliminary study, a novel tech…
Indirect Protection System
2014
As it was characterised in Chap. 5 of this book, protection of IGOs in the EU law consists of two protection systems: the direct protection system and the indirect protection system. If the first protection system is generally ensured through the applicable Regulations that are applicable without their further transposition into the national law of EU Member States, the other one is generally ensured through directives to be further transposed into the national law of EU Member States.
Climate and structure of the 8.2 ka event reconstructed from three speleothems from Germany
2020
Abstract The most pronounced climate anomaly of the Holocene was the 8.2 ka cooling event. We present new 230Th/U-ages as well as high-resolution stable isotope and trace element data from three stalagmites from two different cave systems in Germany, which provide important information about the structure and climate variability of the 8.2 ka event in central Europe. In all three speleothems, the 8.2 ka event is clearly recorded as a pronounced negative excursion of the δ18O values and can be divided into a ‘whole event’ and a ‘central event’. All stalagmites show a similar structure of the event with a short negative excursion prior to the ‘central event’, which marks the beginning of the …
On ARQ feedback intensity of the IEEE 802.16 ARQ mechanism
2008
The IEEE 802.16 standard defines the ARQ mechanism as a part of the MAC layer. The functioning of the ARQ mechanism depends on a number of parameters. The IEEE 802.16 specification defines them but it does not provide concrete values and solutions. We ran simulation scenarios to study how the ARQ feedback intensity impacts the performance of application protocols. The simulation results reveal that a low ARQ feedback intensity results only in a marginal improvement. Though it is possible to optimize the ARQ feedback intensity, it is reasonable to rely upon more frequent ARQ feedback messages as they do not result in a performance degradation. At the same time, ARQ connections, which work on…
Gray code for permutations with a fixed number of cycles
2007
AbstractWe give the first Gray code for the set of n-length permutations with a given number of cycles. In this code, each permutation is transformed into its successor by a product with a cycle of length three, which is optimal. If we represent each permutation by its transposition array then the obtained list still remains a Gray code and this allows us to construct a constant amortized time (CAT) algorithm for generating these codes. Also, Gray code and generating algorithm for n-length permutations with fixed number of left-to-right minima are discussed.