Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hamlet Medina Ruiz

dblp:115/6330 · also Hamlet Jesse Medina Ruiz · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Privacy and data protection · 100%
Computer networks
1 paper
Transport protocols and congestion control · 100%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 100%

Topics — the 7 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training › biologically plausible learning › feedback alignment
direct feedback alignment
0.512021
Photonic Differential Privacy with Direct Feedback Alignment · NeurIPS 2021
Privacy and data protection
differential privacy
0.512021
Photonic Differential Privacy with Direct Feedback Alignment · NeurIPS 2021
Privacy and data protection › privacy-preserving machine learning
private training
0.512021
Photonic Differential Privacy with Direct Feedback Alignment · NeurIPS 2021
Transport protocols and congestion control › congestion control modeling
equilibrium and fairness
0.212016
TCP and Network Coding: Equilibrium and Dynamic Properties · IEEE/ACM Trans. Netw. 2016
Transport protocols and congestion control
TCP congestion control
0.212016
TCP and Network Coding: Equilibrium and Dynamic Properties · IEEE/ACM Trans. Netw. 2016
Transport protocols and congestion control
active queue management
0.112016
TCP and Network Coding: Equilibrium and Dynamic Properties · IEEE/ACM Trans. Netw. 2016
Transport protocols and congestion control › active queue management
random early detection
0.112016
TCP and Network Coding: Equilibrium and Dynamic Properties · IEEE/ACM Trans. Netw. 2016

Methods — techniques the papers use, named apart from their topics

random projection · 1.5direct feedback alignment · 1.5simulation · 0.2fluid model · 0.2
YearPublicationVenuePosition
2021 Photonic Differential Privacy with Direct Feedback Alignment
abstract
Optical Processing Units (OPUs) -- low-power photonic chips dedicated to large scale random projections -- have been used in previous work to train deep neural networks using Direct Feedback Alignment (DFA), an effective alternative to backpropagation. Here, we demonstrate how to leverage the intrinsic noise of optical random projections to build a differentially private DFA mechanism, making OPUs a solution of choice to provide a \emph{private-by-design} training. We provide a theoretical analysis of our adaptive privacy mechanism, carefully measuring how the noise of optical random projections propagates in the process and gives rise to provable Differential Privacy. Finally, we conduct experiments demonstrating the ability of our learning procedure to achieve solid end-task performance.
Ruben Ohana, Hamlet Medina Ruiz, Julien Launay, Alessandro Cappelli, Iacopo Poli, Liva Ralaivola, Alain Rakotomamonjy
NeurIPS2
2016 TCP and Network Coding: Equilibrium and Dynamic Properties
abstract
This paper analyzes the impact on the stability of the TCP-Reno congestion control mechanism when a network coding (NC) layer is inserted in the TCP/IP stack. A model of the dynamics of the TCP-NC protocol combined with random early detection (RED) as active queue management mechanism is considered to study the network equilibrium and stability properties. The existence and uniqueness of an equilibrium point is demonstrated and characterized in terms of average throughput, loss rate, and queue length. Global stability is proved in absence of forward delay, and the effects of the NC redundancy factor and of the delay on the local stability of TCP-NC-RED are studied around the equilibrium. The fairness of TCP-NC with respect to TCP-Reno-like protocols is also studied. A version of TCP-NC with adaptive redundancy factor (TCP-NCAR) is also introduced. Results provided by the proposed model are compared to those obtained by simulation for N sources sharing a single link. TCP-NC-RED becomes unstable when delay or capacity increases, as TCP-Reno does, but also when the redundancy factor increases. Its stability region is characterized as a function of the redundancy factor. If TCP-NC and TCP-Reno share the same links, TCP-NC is fair with TCP-Reno-like protocols when no redundancy is added. Simulations show that TCP-NCAR is able to compensate losses on the wireless parts of the network.
Hamlet Medina Ruiz, Michel Kieffer, Béatrice Pesquet-Popescu
IEEE/ACM Trans. Netw.1
2012 Evaluation of multicasting schemes based on joint multiple description and network coding
abstract
This paper considers a multicast scenario and compares the average reception quality obtained when combining multiple description coding (MDC) and network coding (NC). Plain (single description) network coding (NC-SDC) serves as reference. In the considered scenario, a single source is multicast to several receivers with various channel conditions. Contrary to a NC-SDC scheme, unable to recover the coded packets when not enough combinations of packets have been received, NC of MDC packets allows a more progressive quality improvement with the number of received packets, and a reduction of the effect of the quantization noise when MDC is performed via frame expansion before quantization. Considering a probability distribution for the bit transition probability during transmission to any user in the multicast group, the expected signal-to-noise ratio is evaluated. Performance comparisons are made for various error distributions, field sizes, and MDC methods (via frame expansion and correlating transform).
Hamlet Medina Ruiz, Lana Iwaza, Michel Kieffer, Béatrice Pesquet-Popescu, Khaldoun Al Agha
WCNC1