Publicaciones

• THESE

Modélisation du transfert thermique des câbles en galerie, Heat transfer modeling of power cables in tunnels

Fahd Boukrouche

Une analyse critique de la modélisation des échanges thermiques des câbles d’énergie en galerie est réalisée, avec l’étude de facteurs d’influences propres aux modes de pose des câbles dans ces ouvrages. Les câbles, de plusieurs kilomètres, chauffent du fait du courant transmis dans leurs âmes. Ils..., A critical analysis of the thermal rating of power cables in tunnels is carried out, with the study of factors of influence specific to cable laying constrains. The heat generation in the cables, due to the transiting current, is dissipated by an axial turbulent forced convection and by radiation...

Thermique [physics.class-ph]. Université de Valenciennes et du Hainaut-Cambresis, 2017. Français. ⟨NNT : 2017VALE0005⟩. ⟨tel-01576750⟩

• THESE

Stratégie numérique et expérimentale pour la maîtrise des dégradations des outillages en mise en forme à froid, Experimental and numerical strategy for the evaluation of the degradations mechanisms of cold forging tools

Kevin Le Mercier

La mise en forme à froid des alliages d’aluminium peut être limitée par les transferts de matière sur la surface des outillages pouvant mener au grippage. L’objectif de ce travail de thèse est de contribuer à une meilleure compréhension de ces mécanismes pour permettre à terme d’optimiser les..., Cold forming of aluminium alloys can be limited by a severe material transfer to the die surfaces, compromising the process viability. The purpose of this research work is to contribute to a broader understanding of the galling mechanisms which would further allow the optimisation of the forming...

Mécanique des matériaux [physics.class-ph]. Université de Valenciennes et du Hainaut-Cambresis, 2017. Français. ⟨NNT : 2017VALE0007⟩. ⟨tel-01545700⟩

• ART

Simplified Log - Likelihood Ratio Calculation for Binary LDPC Codes

Latifa Mostari, Abdelmalik Taleb-Ahmed

Combining binary LDPC codes and high order constellations is a simple but effective way to improve the bandwidth efficiency. Since the binary LDPC codes require soft decisions as the input information, the constellation has to provide soft information calculated by Log-Likelihood Ratio (LLR) to it...

Journal of Engineering Science and Technology Review, 2017, 10 (1), pp.37-40. ⟨10.25103/JESTR.101.06⟩. ⟨hal-03429461⟩

• COMM

MATLAB/SIMULINK -VS- ARENA/OPTQUEST - OPTIMAL PRODUCTION CONTROL OF UNRELIABLE MANUFACTURING SYSTEMS

Abdessamad Ait El Cadi

Séminaire du Département Informatique du LAMIH, Feb 2017, Valenciennes, France. ⟨hal-03389622⟩

• ART

Special issue on Variable neighborhood search methods in business and engineering

Abraham Duarte, Bassem Jarboui, Nenad Mladenovic

Computers and Operations Research, 2017, 78, pp.382-384. ⟨10.1016/j.cor.2016.10.010⟩. ⟨hal-03391585⟩

• ART

A basic variable neighborhood search heuristic for the uncapacitated multiple allocation p-hub center problem

Jack Brimberg, Nenad Mladenovic, Raca Todosijević, Dragan Urošević

The uncapacitated multiple allocation p-hub center problem (UMApHCP) consists of choosing p hub locations from a set of nodes with pairwise traffic demands in order to route the traffic between the origin-destination pairs such that the maximum cost between origin-destination pairs is minimum. It...

Optimization Letters, 2017, 11 (2), pp.313-327. ⟨10.1007/s11590-015-0973-5⟩. ⟨hal-03576814⟩

• ART

Variable neighborhood search variants for Min-power symmetric connectivity problem

A.I. Erzin, Nenad Mladenovic, R.V. Plotnikov

We consider the problem of optimal communication tree construction in a given undirected weighted graph. Such a problem occurs while minimizing the power consumption of data transmission in different distributed networks in the case when network elements are able to adjust their transmission ranges...

Computers and Operations Research, 2017, 78, pp.557-563. ⟨10.1016/j.cor.2016.05.010⟩. ⟨hal-03402157⟩

• ART

J-means and I-means for minimum sum-of-squares clustering on networks

Alexey Nikolaev, Nenad Mladenovic, Raca Todosijević

Given a graph, the Edge minimum sum-of-squares clustering problem requires finding p prototypes (cluster centres) by minimizing the sum of their squared distances from a set of vertices to their nearest prototype, where a prototype can be either a vertex or an inner point of an edge. In this paper...

Optimization Letters, 2017, 11 (2), pp.359-376. ⟨10.1007/s11590-015-0974-4⟩. ⟨hal-03402127⟩

• ART

Multi-level energy/power-aware design methodology for MPSoC

Bassem Ouni, Imen Mhedbi, Chiraz Trabelsi, Rabie Ben Atitallah, Cécile Belleudy

Multiprocessor Systems-on-Chip (MPSoC) are becoming one of the most used solutions in order to meet the growing computation requirements of modern embedded applications. In such systems, power/energy consumption is a critical metric that should be taken into account in the design flow. System...

Journal of Parallel and Distributed Computing, 2017, 100, pp.203-215. ⟨10.1016/j.jpdc.2016.03.013⟩. ⟨hal-01570540⟩

• ART

A general variable neighborhood search for the swap-body vehicle routing problem

Raca Todosijević, Said Hanafi, Dragan Urošević, Bassem Jarboui, Bernard Gendron

The Swap-Body Vehicle Routing Problem, a generalization of the well known Vehicle Routing Problem, can be stated as follows: the vehicle fleet consisting of trucks, semi-trailers, and swap bodies, is available at a single depot to serve a given set of customers. To serve a subset of customers, one...

Computers and Operations Research, 2017, 78, pp.468-479. ⟨10.1016/j.cor.2016.01.016⟩. ⟨hal-03402315⟩