Comparaison théorique sur la performativité de l’insulte homophobe. Austin, Bourdieu, Butler by Grégoire Ben-Aïssa

“…However, this reproduction is unequally guaranteed in our two authors’ theories, because of their divergent conceptions of repetition, which for Bourdieu rhymes with reproduction and reconduction and for Butler with iteration and alteration.…”
Get full text

Age of information-oriented sampling and power control in vehicular status update networks by Jianhua ZENG, Chongtao GUO, Cheng GUO

“…In a vehicular status update network based on broadcast communication, a D/Geo/1/1 queuing mechanism with minimum timestamp priority was adopted to transmit data packets.The queuing theory was used to analyze the age-ofinformation (AoI) outage probability of the receivers and the average transmit power of the transmitter.Based on the monotonicity of the AoI outage probability with respect to packet sampling rate and transmit power, an iterative algorithm for jointly optimizing sampling rate and transmit power was proposed to minimize the maximum AoI outage probability of all receivers under power constraint, which fairly improved information freshness of all receivers under sampling and power control.Simulation results verify the accuracy of theoretical analysis and the efficiency of the algorithm.…”
Get full text

Multi-level feedback based time synchronization algorithm for wireless sensor networks by HUANGFU Wei1, ZHOU Xin-yun1, CHEN Can-feng3

“…Aiming at the fast and efficient time synchronization protocol for the wireless sensor networks under resource constraints, a novel feedback-based full-scale time synchronization（FTS） algorithm was proposed.The basic idea of FTS is to execute iteratively time synchronization downlink operations on all the nodes of the wireless sensor network and collect the two-way path delay information from only a part of nodes to calculate the average delay adjustment per hop.The stochastically feedback scheme is adopted to reduce the uplink packets.The FTS algorithm also consists of the mechanisms of synchronization error monitoring and clock skew correction.The FTS was implemented on the popular TelosB sensor nodes from UC Berkeley.The experiments show that FTS is a fast, resource-efficient algorithm with ra-tional synchronization precision.…”
Get full text

D’étudiant à chercheur by Alain Baudrit

“…During investigation activities of an iterative nature, they can be helped in this by teachers but also benefit from the contribution of digital tools, hence the notions of teaching presence and digital presence examined in this article in support of work carried out on these questions. …”
Get full text

Similarity Property and Slide Attack of Block Cipher FESH by Yafei Zheng, Wenling Wu

“…The similarity properties and extended slide property are immune to the increasing of iterated rounds, i.e., it cannot be avoided by increasing the round number of FESH. …”
Get full text

Robust secure design for relay wireless sensor networks with simultaneous wireless information and power transfer by Hehao Niu, Bangning Zhang, Daoxing Guo, Mingyue Lu

“…By studying the hidden convexity of the problem, we propose an iterative algorithm combining semi-definite relaxation and a gradient-based method. …”
Get full text

Improved segmented CRC assisted puncturing Polar decoding by Yanhong NI, Xiangxiong LOU, Jianrong BAO

“…A segmented cyclic redundancy check (CRC) assisted decoding algorithm was proposed.This method makes use of the high parallelism of BP decoding and the high reliability of CRC verification,and uniformly or proportionally disperses CRC verification bits into the original information bits.Simulation results show that when the code length N is 1 024 and the SNR is 3.5 dB,the average iterations of segmented CRC（2,16×2）and CRC (2,24+8) are 2.7 and 2.8 times less than those of G matrix based decoding.When the code length M is 896,the two segmented methods with a bit error rate of 10^-5obtained about 0.7 dB gain compared with the non-CRC assisted BP puncturing decoding.…”
Get full text

Space alternating generalized maximum-likelihood based low-complexity list detection algorithm by Chang-le JING, Xin WANG, Ji-bo WEI, Bin CHEN, Shi-qi WU

“…Moreover, the proposed SAGL algorithm could further iteratively improve the detection results. Ana is and simulation results present the corresponding enhanced per-formance at the cost of slightly increased complexity, compared with the traditional list detection algorithm.…”
Get full text

Identifying Initial Condition in Degenerate Parabolic Equation with Singular Potential by K. Atifi, Y. Balouki, El-H. Essoufi, B. Khouiti

“…This problem can be formulated in a least-squares framework, an iterative procedure which minimizes the difference between the given measurements and the value at sensor locations of a reconstructed field. …”
Get full text

A Fast Implicit Finite Difference Method for Fractional Advection-Dispersion Equations with Fractional Derivative Boundary Conditions by Taohua Liu, Muzhou Hou

“…Then, we present a fast iterative method for the implicit finite difference scheme, which only requires storage of O(K) and computational cost of O(Klog⁡K). …”
Get full text

On Computability and Applicability of Mann-Reich-Sabach-Type Algorithms for Approximating the Solutions of Equilibrium Problems in Hilbert Spaces by F. O. Isiogugu, P. Pillay, P. U. Nwokoro

“…We establish the existence of a strong convergent selection of a modified Mann-Reich-Sabach iteration scheme for approximating the common elements of the set of fixed points F(T) of a multivalued (or single-valued) k-strictly pseudocontractive-type mapping T and the set of solutions EP(F) of an equilibrium problem for a bifunction F in a real Hilbert space H. …”
Get full text

Intelligent Manipulator with Flexible Link and Joint: Modeling and Vibration Control by Minqiang Shao, Yuming Huang, Vadim V. Silberschmidt

“…In order to reduce the dimensions and maintain the precision of the model, an iterated improved reduction system (IIRS) method is adopted. …”
Get full text

An Improved Artificial Bee Colony Algorithm Based on Balance-Evolution Strategy for Unmanned Combat Aerial Vehicle Path Planning by Bai Li, Li-gang Gong, Wen-lun Yang

“…In this new algorithm, convergence information during the iteration is fully utilized to manipulate the exploration/exploitation accuracy and to pursue a balance between local exploitation and global exploration capabilities. …”
Get full text

Hierarchical deep learning framework for automated marine vegetation and fauna analysis using ROV video data by Bjørn Christian Weinbach, Rajendra Akerkar, Marianne Nilsen, Reza Arghandeh

“…FjordVision combines state-of-the-art object detection, iterative dataset refinement, and a taxonomy-aware hierarchical reclassification framework that enhances accuracy across four taxonomic levels: binary, class, genus, and species. …”
Get full text

Low-complexity signal detection algorithm based on preconditioned conjugate gradient method by Hua QU, Jing LIANG, Jihong ZHAO, Weihua WANG

“…The simulation results show that the proposed algorithm can achieve the near-optimal bit error rate performance of minimum mean square error detection algorithm with a small number of iterations，and computation complexity reduces a order of magnitude. …”
Get full text

A Novel Differential Evolution Invasive Weed Optimization Algorithm for Solving Nonlinear Equations Systems by Yongquan Zhou, Qifang Luo, Huan Chen

“…This paper presents an invasive weed optimization (IWO) algorithm which has population diversity with the heuristic global search of differential evolution (DE) algorithm. In the iterative process, the global exploration ability of invasive weed optimization algorithm provides effective search area for differential evolution; at the same time, the heuristic search ability of differential evolution algorithm provides a reliable guide for invasive weed optimization. …”
Get full text

High capacity cross layer optimization strategy for multi-hop wireless network with interference management by Lei SHI, Jiang-hong HAN, Yi SHI, Zhen-chun WEI

“…A high-throughput cross-layer optimization strategy based on the interference management for the multi-hop multi-base-station wireless network environment was proposed.In the physical layer the successive interference cancella-tion was used to realize the interference management.In the up layers,first the Voronoi algorithm was used to achieve the zoning,second based on the min-hop algorithm,the initial link allocation and multi-hop routing scheme was established,third optimize the scheme based on the multi-time-slot allocating or multi-hop routing,and at last try to find a better strategy in each iteration.Theoretical analysis shows that the strategy has a polynomial time complexity,and the simula-tion results show that the entire network throughput has a 2 to 5 fold increase by using interference management.…”
Get full text

Successive relaying secure transmission scheme based on inter-relay interference cancellation by Yi ZOU, Kai-zhi HUANG, Xiao-lei KANG

“…A secure scheme based on inter-relay interference cancellation was proposed to solve untrusted relay eavesdropping problem in successive relaying systems.First inter-relay interference between trusted relay and untrusted relay was exploited as artificial noise to degrade untrusted relay’s eavesdropping condition,then interference iterative cancellation was adapted to improve signal quality at legitimate user by making use of correlation between signals in time domain.Based on this,a quick power allocation algorithm aiming to minimize untrusted relay’s sum rate was proposed.Analysis and simulation results show that the proposed scheme suppress untrusted relay’s eavesdropping without loss of communication efficiency,a promotion of at least 2 bit·s^-1·Hz^-1in secrecy rate can be observed.…”
Get full text

The Quest of Building a Precision TPC Field Cage by Behnke Ties, Diener Ralf, Schäfer Oliver

“…This setup includes a large field cage as test bed for the different readout technologies to be studied under comparable conditions. A second iteration of this field cage has recently been constructed to improve on the shortcomings noticed with its predecessor. …”
Get full text

Implementation Aspects in Simulation Extrapolation-Based Stocking–Lord Linking by Alexander Robitzsch

“…This article evaluates two computational shortcuts to SIMEX-based SL linking through a simulation study: a quasi-Monte Carlo method that replicates items and a proposal using an approximate noniterative estimation instead of the iterative one in the SIMEX application of SL linking. …”
Get full text