Lecture

Microfluidic Valves

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

MICRO-560: BioMEMS

This course covers the main applications of micro devices for life science and biomedical applications. The course is organized by application topic. It is also covering the basic physical, biological, chemical, technological concepts, which are presented ...

Description

This lecture covers the principles and applications of microfluidic valves, including PDMS valves with control channels, latchable PDMS valves, normally closed PDMS valves, and alternative valve designs using flexible membranes. It also discusses the use of valves in creating massively parallel microfluidic systems, peristaltic pumping, and valveless particle sorting.

Instructor

Philippe Renaud

Philippe Renaud is Professor at the Microsystem Laboratory (LMIS4) at EPFL. He is also the scientific director of the EPFL Center of MicroNanoTechnology (CMI). His main research area is related to micronano technologies in biomedical applications (BioMEMS) with emphasis on cell-chips, nanofluidics and bioelectronics. Ph. Renaud is invloved in many scientifics papers in his research area. He received his diploma in physics from the University of Neuchâtel (1983) and his Ph.D. degree from the University of Lausanne (1988). He was postdoctoral fellow at University of California, Berkeley (1988-89) and then at the IBM Zürich Research Laboratory in Switzerland (1990-91). In 1992, he joined the Sensors and Actuators group of the Swiss Center for Electronics and Microtechnology (CSEM) at Neuchâtel, Switzerland. He was appointed assistant professor at EPFL in 1994 and full professor in 1997. In summer 1996, he was visiting professor at the Tohoku University, Japan. Ph. Renaud is active in several scientific committee (scientific journals, international conferences, scientific advisory boards of companies, PhD thesis committee). He is also co-founder of the Nanotech-Montreux conference. Ph. Renaud is committed to valorization of basic research through his involvement in several high-tech start-up companies.

Official source

Related concepts (18)

Microfluidics

Microfluidics refers to a system that manipulates a small amount of fluids ((10−9 to 10−18 liters) using small channels with sizes ten to hundreds micrometres. It is a multidisciplinary field that involves molecular analysis, biodefence, molecular biology, and microelectronics. It has practical applications in the design of systems that process low volumes of fluids to achieve multiplexing, automation, and high-throughput screening.

Droplet-based microfluidics

Droplet-based microfluidics manipulate discrete volumes of fluids in immiscible phases with low Reynolds number and laminar flow regimes. Interest in droplet-based microfluidics systems has been growing substantially in past decades. Microdroplets offer the feasibility of handling miniature volumes (μl to fl) of fluids conveniently, provide better mixing, encapsulation, sorting, sensing and are suitable for high throughput experiments.

Merge sort

In computer science, merge sort (also commonly spelled as mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the relative order of equal elements is the same in the input and output. Merge sort is a divide-and-conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of bottom-up merge sort appeared in a report by Goldstine and von Neumann as early as 1948.

Sorting algorithm

In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order and lexicographical order, and either ascending or descending. Efficient sorting is important for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists. Sorting is also often useful for canonicalizing data and for producing human-readable output.

Radix sort

In computer science, radix sort is a non-comparative sorting algorithm. It avoids comparison by creating and distributing elements into buckets according to their radix. For elements with more than one significant digit, this bucketing process is repeated for each digit, while preserving the ordering of the prior step, until all digits have been considered. For this reason, radix sort has also been called bucket sort and digital sort. Radix sort can be applied to data that can be sorted lexicographically, be they integers, words, punch cards, playing cards, or the mail.

Related lectures (64)

Merge Sort: Sorting Algorithm

Explains the merge sort algorithm, its correctness, and time complexity compared to other sorting algorithms.

Introduction to Algorithms: Course Overview and Basics

Introduces the CS-250 Algorithms course, covering its structure, objectives, and key topics in algorithmic problem-solving.

Hashing and Sorting

Covers hashing, sorting, extendible hashing, linear hashing, and external sorting.

Sorting Algorithms: Selection and Insertion

Introduces selection and insertion sorting algorithms, explaining their correctness and time complexity.

Optimization Algorithms: Greedy Approach