Droplet generation in a microchannel with a controllable deformable wall

We report the droplet generation behavior of a microfluidic droplet generator with a controllable deformable membrane wall using experiments and analytical model. The confinement at the droplet generation junction is controlled by using external pressure, which acts on the membrane, to generate droplets smaller than junction size (with other parameters fixed) and stable and monodispersed droplets even at higher capillary numbers. A non-dimensional parameter, i.e., controlling parameter K _p, is used to represent the membrane deformation characteristics due to the external pressure. We investigate the effect of the controlled membrane deformation (in terms of K _p), viscosity ratio λ and flow rate ratio r on the droplet size and mobility. A correlation is developed to predict droplet size in the controllable deformable microchannel in terms of the controlling parameter K _p, viscosity ratio λ and flow rate ratio r. Due to the deflection of the membrane wall, we demonstrate that the transition from the stable dripping regime to the unstable jetting regime is delayed to a higher capillary number Ca (as compared to rigid droplet generators), thus pushing the high throughput limit. The droplet generator also enables generation of droplets of sizes smaller than the junction size by adjusting the controlling parameter.     

From frequency domain to time domain: performance analysis on cyclic prefixed multi-user single-carrier transmission

This paper analyzes the performance of cyclic prefixed single-carrier transmission under multiuser interference (MUI). For multi-user receivers using single carrier frequency domain adaptive antenna array, we derive the signal to interference plus noise ratio by analyzing the time domain estimated signal after the transformation from frequency domain to time domain. By assuming the MUI follows the Gaussian distribution, we can derive the analytical expression for the bit error rate (BER) performance. The analytical result is verified by the numerical results generated by Monte Carlo method. It is concluded from the analytical results that if the number of receive antennas goes to infinity as assumed in massive multiple input multiple output (MIMO) system, the BER performance will be determined by two ratios: signal to noise ratio as well as the N_r to U ratio, where N_r is the number of receive antennas and U is the number of users.     

Identifying correlated heavy-hitters in a two-dimensional data stream

We consider online mining of correlated heavy-hitters (CHH) from a data stream. Given a stream of two-dimensional data, a correlated aggregate query first extracts a substream by applying a predicate along a primary dimension, and then computes an aggregate along a secondary dimension. Prior work on identifying heavy-hitters in streams has almost exclusively focused on identifying heavy-hitters on a single dimensional stream, and these yield little insight into the properties of heavy-hitters along other dimensions. In typical applications however, an analyst is interested not only in identifying heavy-hitters, but also in understanding further properties such as: what other items appear frequently along with a heavy-hitter, or what is the frequency distribution of items that appear along with the heavy-hitters. We consider queries of the following form: “In a stream S of (x, y) tuples, on the substream H of all x values that are heavy-hitters, maintain those y values that occur frequently with the x values in H”. We call this problem as CHH. We formulate an approximate formulation of CHH identification, and present an algorithm for tracking CHHs on a data stream. The algorithm is easy to implement and uses workspace much smaller than the stream itself. We present provable guarantees on the maximum error, as well as detailed experimental results that demonstrate the space-accuracy trade-off.     

Inertial migration of single particle in a square microchannel over wide ranges of <Emphasis Type="Italic">Re</Emphasis> and particle sizes

Inertial migration of particles has been widely used in inertial microfluidic systems to passively manipulate cells/particles. However, the migration behaviors and the underlying mechanisms, especially in a square microchannel, are still not very clear. In this paper, the immersed boundary-lattice Boltzmann method (IB-LBM) was introduced and validated to explore the migration characteristics and the underlying mechanisms of an inertial focusing single particle in a square microchannel. The grid-independence analysis was made first to highlight that the grid number across the thin liquid film (between a particle and its neighboring channel wall) was of significant importance in accurately capturing the migrating particle’s dynamics. Then, the inertial migration of a single particle was numerically investigated over wide ranges of Reynolds number (Re, from 10 to 500) and particle sizes (diameter-to-height ratio a/H, from 0.16 to 0.5). It was interesting to find that as Re increased, the channel face equilibrium (CFE) position moved outward to channel walls at first, and then inflected inwards to the channel center at high Re (Re?>?200). To account for the physical mechanisms behind this behavior, the secondary flow induced by the inertial focusing single particle was further investigated. It was found that as Re increased, two vortices appeared around the particle and grew gradually, which pushed the particle away from the channel wall at high Re. Finally, a correlation was proposed based on the numerical data to predict the critical length L_c (defined to describe the size of fluid domain that was strongly influenced by the particle) according to the particle size a/H and Re.     

Exact and approximate flexible aggregate similarity search

Aggregate similarity search, also known as aggregate nearest-neighbor (Ann) query, finds many useful applications in spatial and multimedia databases. Given a group Q of M query objects, it retrieves from a database the objects most similar to Q, where the similarity is an aggregation (e.g., \({{\mathrm{sum}}}\), \(\max \)) of the distances between each retrieved object p and all the objects in Q. In this paper, we propose an added flexibility to the query definition, where the similarity is an aggregation over the distances between p and any subset of \(\phi M\) objects in Q for some support \(0< \phi \le 1\). We call this new definition flexible aggregate similarity search and accordingly refer to a query as a flexible aggregate nearest-neighbor ( Fann ) query. We present algorithms for answering Fann queries exactly and approximately. Our approximation algorithms are especially appealing, which are simple, highly efficient, and work well in both low and high dimensions. They also return near-optimal answers with guaranteed constant-factor approximations in any dimensions. Extensive experiments on large real and synthetic datasets from 2 to 74 dimensions have demonstrated their superior efficiency and high quality.     

Time-weighted counting for recently frequent pattern mining in data streams

How can we discover interesting patterns from time-evolving high-speed data streams? How to analyze the data streams quickly and accurately, with little space overhead? How to guarantee the found patterns to be self-consistent? High-speed data stream has been receiving increasing attention due to its wide applications such as sensors, network traffic, social networks, etc. The most fundamental task on the data stream is frequent pattern mining; especially, focusing on recentness is important in real applications. In this paper, we develop two algorithms for discovering recently frequent patterns in data streams. First, we propose TwMinSwap to find top-k recently frequent items in data streams, which is a deterministic version of our motivating algorithm TwSample providing theoretical guarantees based on item sampling. TwMinSwap improves TwSample in terms of speed, accuracy, and memory usage. Both require only O(k) memory spaces and do not require any prior knowledge on the stream such as its length and the number of distinct items in the stream. Second, we propose TwMinSwap-Is to find top-k recently frequent itemsets in data streams. We especially focus on keeping self-consistency of the discovered itemsets, which is the most important property for reliable results, while using O(k) memory space with the assumption of a constant itemset size. Through extensive experiments, we demonstrate that TwMinSwap outperforms all competitors in terms of accuracy and memory usage, with fast running time. We also show that TwMinSwap-Is is more accurate than the competitor and discovers recently frequent itemsets with reasonably large sizes (at most 5–7) depending on datasets. Thanks to TwMinSwap and TwMinSwap-Is, we report interesting discoveries in real world data streams, including the difference of trends between the winner and the loser of U.S. presidential candidates, and temporal human contact patterns.     

The <Emphasis Type="Italic">B</Emphasis><Superscript><Emphasis Type="Italic">dual</Emphasis></Superscript>-Tree: indexing moving objects by space filling curves in the dual space

Existing spatiotemporal indexes suffer from either large update cost or poor query performance, except for the B ^x -tree (the state-of-the-art), which consists of multiple B ⁺-trees indexing the 1D values transformed from the (multi-dimensional) moving objects based on a space filling curve (Hilbert, in particular). This curve, however, does not consider object velocities, and as a result, query processing with a B ^x -tree retrieves a large number of false hits, which seriously compromises its efficiency. It is natural to wonder “can we obtain better performance by capturing also the velocity information, using a Hilbert curve of a higher dimensionality?”. This paper provides a positive answer by developing the B ^dual -tree, a novel spatiotemporal access method leveraging pure relational methodology. We show, with theoretical evidence, that the B ^dual -tree indeed outperforms the B ^x -tree in most circum- stances. Furthermore, our technique can effectively answer progressive spatiotemporal queries, which are poorly supported by B ^x -trees.     

Study on microchannel flows with a sudden contraction–expansion at a wide range of Knudsen number using lattice Boltzmann method

Numerical simulations have been performed on the pressure-driven rarefied flow through channels with a sudden contraction–expansion of 2:1:2 using isothermal two and three-dimensional lattice Boltzmann method (LBM). In the LBM, a Bosanquet-type effective viscosity and a modified second-order slip boundary condition are used to account for the rarefaction effect on gas viscosity to cover the slip and transition flow regimes, that is, a wider range of Knudsen number. Firstly, the in-house LBM code is verified by comparing the computed pressure distribution and flow pattern with experimental ones measured by others. The verified code is then used to study the effects of the outlet Knudsen number Kn _o , driving pressure ratio P _i /P _o , and Reynolds number Re, respectively, varied in the ranges of 0.001–1.0, 1.15–5.0, and 0.02–120, on the pressure distributions and flow patterns as well as to document the differences between continuum and rarefied flows. Results are discussed in terms of the distributions of local pressure, Knudsen number, centerline velocity, and Mach number. The variations of flow patterns and vortex length with Kn _o and Re are also documented. Moreover, a critical Knudsen number is identified to be Kn _oc  = 0.1 below and above which the behaviors of nonlinear pressure profile and velocity distribution and the variations of vortex length with Re upstream and downstream of constriction are different from those of continuum flows.     

Inertia-driven enhancement of mixing efficiency in microfluidic cross-junctions: a combined Eulerian/Lagrangian approach

Mixing of a diffusing species entrained in a three-dimensional microfluidic flow-focusing cross-junction is numerically investigated at low Reynolds numbers, \(1 \le Re \le 150\), for a value of the Schmidt number representative of a small solute molecule in water, \(Sc = 10^3\). Accurate three-dimensional simulations of the steady-state incompressible Navier–Stokes equations confirm recent results reported in the literature highlighting the occurrence of different qualitative structures of the flow geometry, whose range of existence depends on Re and on the ratio, R, between the volumetric flowrates of the impinging currents. At low values of R and increasing Re, the flux tube enclosing the solute-rich stream undergoes a topological transition, from the classical flow-focused structure to a multi-branched shape. We here show that this transition causes a nonmonotonic behavior of mixing efficiency with Re at constant flow ratio. The increase in efficiency is the consequence of a progressive compression of the cross-sectional diffusional lengthscale, which provides the mechanism sustaining the transversal Fickian flux even when the Peclet number, \({Pe=Re \, Sc}\), characterizing mass transport, becomes higher due to the increase in Re. The quantitative assessment of mixing efficiency at the considerably high values of the Peclet number considered (\(10^3 \le Pe \le 1.5 \times 10^5\)) is here made possible by a novel method of reconstruction of steady-state cross-sectional concentration maps from velocity-weighted ensemble statistics of noisy trajectories, which does away with the severe numerical diffusion shortcomings associated with classical Eulerian approaches to mass transport in complex 3d flows.     

Online Search with Time-Varying Price Bounds

Online search is a basic online problem. The fact that its optimal deterministic/randomized solutions are given by simple formulas (however with difficult analysis) makes the problem attractive as a target to which other practical online problems can be transformed to find optimal solutions. However, since the upper/lower bounds of prices in available models are constant, natural online problems in which these bounds vary with time do not fit in the available models.We present two new models where the bounds of prices are not constant but vary with time in certain ways. The first model, where the upper and lower bounds of (logarithmic) prices have decay speed, arises from a problem in concurrent data structures, namely to maximize the (appropriately defined) freshness of data in concurrent objects. For this model we present an optimal deterministic algorithm with competitive ratio \(\sqrt{D}\), where D is the known duration of the game, and a nearly-optimal randomized algorithm with competitive ratio \(\frac{\ln D}{1+\ln2-\frac{2}{D}}\). We also prove that the lower bound of competitive ratios of randomized algorithms is asymptotically \(\frac{\ln D}{4}\).The second model is inspired by the fact that some applications do not utilize the decay speed of the lower bound of prices in the first model. In the second model, only the upper bound decreases arbitrarily with time and the lower bound is constant. Clearly, the lower bound of competitive ratios proved for the first model holds also against the stronger adversary in the second model. For the second model, we present an optimal randomized algorithm. Our numerical experiments on the freshness problem show that this new algorithm achieves much better/smaller competitive ratios than previous algorithms do, for instance 2.25 versus 3.77 for D=128.     

Developing heatable microfluidic chip to generate gelatin emulsions and microcapsules

The heatable microfluidic chip developed herein successfully integrates a microheater and flow-focusing device to generate uniform-sized gelatin emulsions under various flow rate ratios (sample phase/oil phase, Q _s/Q _o) and driven voltages. The gelatin emulsions can be applied to encapsulate vitamin C for drug release. Our goal is to create the thermal conditions for thermo-sensitive hydrogel materials in the microfluidic chip and generate continuous and uniform emulsions under any external environment. The gelatin emulsion sizes have a coefficient of variation of <5 % and can be precisely controlled by altering the flow rate ratio (Q _s/Q _o) and driven voltage. The gelatin emulsion diameters range from 45 to 120 μm. Moreover, various sizes of these gelatin microcapsules containing vitamin C were used for drug release. The developed microfluidic chip has the advantages of a heatable platform in the fluid device, active control over the emulsion diameter, the generation of uniform-sized emulsions, and simplicity. This new approach for gelatin microcapsules will provide many potential applications in drug delivery and pharmaceuticals.     

Efficiently Storing Well-Composed Polyhedral Complexes Computed Over 3D Binary Images

A 3D binary image I can be naturally represented by a combinatorial-algebraic structure called cubical complex and denoted by Q(I), whose basic building blocks are vertices, edges, square faces and cubes. In Gonzalez-Diaz et al. (Discret Appl Math 183:59–77, 2015), we presented a method to “locally repair” Q(I) to obtain a polyhedral complex P(I) (whose basic building blocks are vertices, edges, specific polygons and polyhedra), homotopy equivalent to Q(I), satisfying that its boundary surface is a 2D manifold. P(I) is called a well-composed polyhedral complex over the picture I. Besides, we developed a new codification system for P(I), encoding geometric information of the cells of P(I) under the form of a 3D grayscale image, and the boundary face relations of the cells of P(I) under the form of a set of structuring elements. In this paper, we build upon (Gonzalez-Diaz et al. 2015) and prove that, to retrieve topological and geometric information of P(I), it is enough to store just one 3D point per polyhedron and hence neither grayscale image nor set of structuring elements are needed. From this “minimal” codification of P(I), we finally present a method to compute the 2-cells in the boundary surface of P(I).     

Flexible integration of multimedia sub-queries with qualitative preferences

Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m simpler sub-queries, each dealing with only some of the query features. To determine which are the overall best-matching objects, a rule is then needed to integrate the results of such sub-queries, i.e., how to globally rank the m-dimensional vectors of matching degrees, or partial scores, that objects obtain on the m sub-queries. It is a fact that state-of-the-art approaches all adopt as integration rule a scoring function, such as weighted average, that aggregates the m partial scores into an overall (numerical) similarity score, so that objects can be linearly ordered and only the highest scored ones returned to the user. This choice however forces the system to compromise between the different sub-queries and can easily lead to miss relevant results. In this paper we explore the potentialities of a more general approach, based on the use of qualitative preferences, able to define arbitrary partial (rather than only linear) orders on database objects, so that a larger flexibility is gained in shaping what the user is looking for. For the purpose of efficient evaluation, we propose two integration algorithms able to work with any (monotone) partial order (thus also with scoring functions): MPO, which delivers objects one layer of the partial order at a time, and iMPO, which can incrementally return one object at a time, thus also suitable for processing top k queries. Our analysis demonstrates that using qualitative preferences pays off. In particular, using Skyline and Region-prioritized Skyline preferences for queries on a real image database, we show that the results we get have a precision comparable to that obtainable using scoring functions, yet they are obtained much faster, saving up to about 70% database accesses.     

Answering why-not and why questions on reverse top-<Emphasis Type="Italic">k</Emphasis> queries

Why-not and why questions can be posed by database users to seek clarifications on unexpected query results. Specifically, why-not questions aim to explain why certain expected tuples are absent from the query results, while why questions try to clarify why certain unexpected tuples are present in the query results. This paper systematically explores the why-not and why questions on reverse top-k queries, owing to its importance in multi-criteria decision making. We first formalize why-not questions on reverse top-k queries, which try to include the missing objects in the reverse top-k query results, and then, we propose a unified framework called WQRTQ to answer why-not questions on reverse top-k queries. Our framework offers three solutions to cater for different application scenarios. Furthermore, we study why questions on reverse top-k queries, which aim to exclude the undesirable objects from the reverse top-k query results, and extend the framework WQRTQ to efficiently answer why questions on reverse top-k queries, which demonstrates the flexibility of our proposed algorithms. Extensive experimental evaluation with both real and synthetic data sets verifies the effectiveness and efficiency of the presented algorithms under various experimental settings.     

Regular Rotating Black Holes and Solitons

Solutions describing regular rotating black holes are typically obtained by applying the Newman-Janis complex translation to spherical metrics of the Kerr-Schild class. Regular solutions of this class are specified by T _t ^t = T _r ^r and have necessarily de Sitter centers provided that the source terms T _k ⁱ satisfy the weak energy condition. Rotation transforms a de Sitter center into a de Sitter vacuum disk which is the generic common constituent of all regular rotating objects. In nonlinear electrodynamics coupled to gravity all metrics belong to the Kerr-Schild class and have the Kerr-Newman asymptotic for a distant observer. The ring singularity is replaced with the superconducting ring current which represents an electromagnetic nondissipative source of any asymptotically Kerr-Newman geometry. We outline the basic generic features of regular rotating black holes and solitons which are regular compact objects without event horizons, replacing naked singularities.     

Irrevocable-choice algorithms for sampling from a stream

The problem of sampling from data streams has attracted significant interest in the last decade. Whichever sampling criteria is considered (uniform sample, maximally diverse sample, etc.), the challenges stem from the relatively small amount of memory available in the face of unbounded streams. In this work we consider an interesting extension of this problem, the framework of which is stimulated by recent improvements in sensing technologies and robotics. In some situations it is not only possible to digitally sense some aspects of the world, but to physically capture a tangible aspect of that world. Currently deployed examples include devices that can capture water/air samples, and devices that capture individual insects or fish. Such devices create an interesting twist on the stream sampling problem, because in most cases, the decision to take a physical sample is irrevocable. In this work we show how to generalize diversification sampling strategies to the irrevocable-choice setting, demonstrating our ideas on several real world domains.     

Tackling heterogeneous concept drift with the Self-Adjusting Memory (SAM)

Instance matching is the problem of determining whether two instances describe the same real-world entity or not. Instance matching plays a key role in data integration and data cleansing, especially for building a knowledge base. For example, we can regard each article in encyclopedias as an instance, and a group of articles which refers to the same real-world object as an entity. Therefore, articles about Washington should be distinguished and grouped into different entities such as Washington, D.C (the capital of the USA), George Washington (first president of the USA), Washington (a state of the USA), Washington (a village in West Sussex, England), Washington F.C. (a football club based in Washington, Tyne and Wear, England), Washington, D.C. (a novel). In this paper, we proposed a novel instance matching approach Active Instance Matching with Pairwise Constraints, which can bring the human into the loop of instance matching. The proposed approach can generate candidate pairs in advance to reduce the computational complexity, and then iteratively select the most informative pairs according to the uncertainty, influence, connectivity and diversity of pairs. We evaluated our approach one two publicly available datasets AMINER and WIDE-NUS and then applied our approach to the two large-scale real-world datasets, Baidu Baike and Hudong Baike, to build a Chinese knowledge base. The experiments and practice illustrate the effectiveness of our approach.     

Wind Effect on Aerodynamic Optimization for Non-planar Rotor Pairs using Full-scale Measurements

Aerodynamic force measurements and a flow field survey were performed on two original non-planar rotor pairs in order to investigate the effect of wind disturbances on aerodynamic performance at low Reynolds numbers and provide effective data for the design of a rotor system for a small unmanned aerial vehicles with different disk plane angles φ and rotor spacing ratios S/D. Experiments were performed on a test-platform based on the use of two proposed rotor pairs which permit characterization of the aerodynamic performance as a function of wind turbulence with a frequency in the range from approximately 0 to 4 m/s. The measurement results show that variations in wind speed cause large variation in the mean values of the lift force and power consumption. The combined optimal configuration is S/ D = 1.0 with φ = 50 deg for the non-planar rotor systems with good wind resistance.     

Almost cover-free codes

We say that an s-subset of codewords of a code X is (s, l)-bad if X contains l other codewords such that the conjunction of these l words is covered by the disjunction of the words of the s-subset. Otherwise, an s-subset of codewords of X is said to be (s, l)-bad. A binary code X is called a disjunctive (s, l) cover-free (CF) code if X does not contain (s, l)-bad subsets. We consider a probabilistic generalization of (s, l) CF codes: we say that a binary code is an (s, l) almost cover-free (ACF) code if almost all s-subsets of its codewords are (s, l)-good. The most interesting result is the proof of a lower and an upper bound for the capacity of (s, l) ACF codes; the ratio of these bounds tends as s→∞ to the limit value log₂ e/(le).     

A game-theoretic model of TV show “The Voice”

This paper proposes a game-theoretic model of the two-player best-choice problem with incomplete information. The players (experts) choose between objects by observing their quality in the form of two components forming a sequence of random variables (x_i, y_i), i = 1,..., n. By assumption, the first quality component x_i is known to the players and the second one y_i is hidden. A player accepts or declines an object based on the first quality component only. A player with the maximal sum of the components becomes the winner in the game. The optimal strategies are derived in the cases of independent and correlated quality components.