Search results for " Telecommunication"
showing 10 items of 996 documents
A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay
2012
In this paper we generalize an encoding method due to Girod (cf. [6]) using prefix codes, that allows a bidirectional decoding of the encoded messages. In particular we generalize it to any finite alphabet A, to any operation defined on A, to any code with finite deciphering delay and to any key x ∈ A+ , on a length depending on the deciphering delay. We moreover define, as in [4], a deterministic transducer for such generalized method. We prove that, fixed a code X ∈ A* with finite deciphering delay and a key x ∈ A *, the transducers associated to different operations are isomorphic as unlabelled graphs. We also prove that, for a fixed code X with finite deciphering delay, transducers asso…
Randomized renaming in shared memory systems.
2021
Abstract Renaming is a task in distributed computing where n processes are assigned new names from a name space of size m . The problem is called tight if m = n , and loose if m > n . In recent years renaming came to the fore again and new algorithms were developed. For tight renaming in asynchronous shared memory systems, Alistarh et al. describe a construction based on the AKS network that assigns all names within O ( log n ) steps per process. They also show that, depending on the size of the name space, loose renaming can be done considerably faster. For m = ( 1 + ϵ ) ⋅ n and constant ϵ , they achieve a step complexity of O ( log log n ) . In this paper we consider tight as well as loos…
Minimum node weight spanning trees searching algorithm for broadcast transmission in sensor networks
2017
A minimum node weight spanning tree in a weighted, directed graph is a tree whose node with maximum out-weight is minimal among all spanning trees. This type of trees are important because they appear in the solutions of the maximum lifetime broadcasting problem in wireless sensor networks. In a complete graph build of N nodes there are NN-2 spanning trees and to find such trees it is necessary to perform more than O(NN-2) operations. In this paper we propose an algorithm for searching the minimum node weight spanning trees in the graph. In the proposed algorithm, instead of calculating the symbolic determinant of the generalized Laplacian matrix, numerical operations on its exponents are p…
Uncountable Realtime Probabilistic Classes
2018
We investigate the minimal cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for realtime PTMs on unary languages. On non-unary case, we obtain the same result for double logarithmic space, which is also tight. When replacing the work tape with a few counters, we can still achieve similar results for unary linear-space two-counter automata, unary sublinear-space three-counter automata, and non-unary sublinear-space two-counter automata. We also show how to slightly improve the sublinear-space constructions by using more counters.
The Spanning Tree based Approach for Solving the Shortest Path Problem in Social Graphs
2016
Nowadays there are many social media sites with a very large number of users. Users of social media sites and relationships between them can be modelled as a graph. Such graphs can be analysed using methods from social network analysis (SNA). Many measures used in SNA rely on computation of shortest paths between nodes of a graph. There are many shortest path algorithms, but the majority of them suits only for small graphs, or work only with road network graphs that are fundamentally different from social graphs. This paper describes an efficient shortest path searching algorithm suitable for large social graphs. The described algorithm extends the Atlas algorithm. The proposed algorithm so…
Combinatorial Double Auction Radio Resource Allocation Model in Crowd Networks
2018
International audience; Industrial Partners (IPs) with Mobile Network Operators (MNOs) are extending the mobile network infrastructure with Small Cells (SCs) in order to meet the growing mobile traffic demand. Due to the increasing number of telecommunication market competitors and the scarcity of radio resources, static sharing schemes are no more efficient. New dynamic schemes should be considered to meet both user expectations and economic success. In a crowd networking context, we propose in this work a dynamic radio resource scheme based on combinatorial double auctions. The participants in these auctions are the MNOs considered as buyers and the IPs, providers of SCs, considered as se…
More firms, more competition? The case of the fourth operator in France's mobile phone market
2010
Accepted, Forthcoming; International audience; To foster competition the French government authorized a fourth operator, ‘Free', to enter the country's mobile phone market at the end of 2009 alongside Orange, SFR and Bouygues Telecom (BT), who held respectively one-half, one-third and one-sixth of the market. By using a stylized model of France's phone market, we have examined what we call the regulator's nightmares and dreams. If Cournot competition is in place before Free's entry, minimizing the total profit fails to maximize the consumer surplus and the total surplus; the maximum most realistic price fall is 6.7% compared to three-way competition and could be 1.7% only; if Orange, SFR an…
Compression Methods for Microclimate Data Based on Linear Approximation of Sensor Data
2019
Edge computing is currently one of the main research topics in the field of Internet of Things. Edge computing requires lightweight and computationally simple algorithms for sensor data analytics. Sensing edge devices are often battery powered and have a wireless connection. In designing edge devices the energy efficiency needs to be taken into account. Pre-processing the data locally in the edge device reduces the amount of data and thus decreases the energy consumption of wireless data transmission. Sensor data compression algorithms presented in this paper are mainly based on data linearity. Microclimate data is near linear in short time window and thus simple linear approximation based …
Industry 4.0: Advanced digital solutions implemented on a close power loop test bench
2021
Abstract The paradigm of Industry 4.0 allows to increase the efficiency and effectiveness of the production. Companies that will implement advanced solutions in production systems will increase their level of competitiveness and will be able reach high market shares. The present paper is focused on the development of advanced digital solutions to be implemented on a close power loop test bench designed to test high power transmissions for naval unit. In particular, the test configuration consists of a back-to-back connection between two identical mechanical reducers. Since the efficiency of these systems are very high, it is not necessary to use large electric motors, thus managing to conta…
Optical Plasmonic Yagi-Uda Nano-Antennas Array for Energy Harvesting Applications
2020
Optical nanoantennas have been of great interest recently due to their ability to support a highly efficient, localized surface plasmon resonance and produce significantly enhanced and highly confined electromagnetic fields. The Yagi-Uda nanoantenna, an optical analogue of the well-established radiofrequency Yagi-Uda antenna, stands out by its efficient unidirectional light emission and enhancement. In this paper, the design of an optical plasmonic Yagi-Uda nanoantenna for energy harvesting application is proposed. The enhancement of the directivity is reached by means of an organization in array. The simulation results, carried out by 3D code CST Studio, show that the proposed nanoantenna …