Bubble dynamics: Long-time behavior and interaction in viscous liquids

A mathematical two-phase model is used to numerically investigate physical and rheological effects on small, individual bubbles in high-viscosity liquids under pressure impact. It is found out that bubbles remain stable over time at high viscosity and surface tension. The steady case is considered and connected to the stability behavior of the bubble. An upper bound for the bubble radius is derived and the new equilibrium state of the bubble can be predicted by means of stability theorems of differential equations. Finally, the interaction of a limited number of well separated bubbles in an Hele-Shaw flow is mathematically analyzed to visualize and physically interpret their trajectories. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Multibody dynamics with unilateral constraints and friction

In the view of robotics or granular media mechanics, we ask for the statement of the dynamical evolution problem for multibody systems with contacts and friction. The “event driven” approach does not allow to state an evolution problem in a systematic way: it gives a peculiar status to the instants of impact and to the contact points although they are unknowns of the problem. This matter of fact has given rise to a new approach in the frictionless case [4, 6] we generalize to the case including friction. Following to the point of view of Lagrange on the equation of the dynamics, we emphasize the systematic use of virtual powers and duality. This bias suggests to put emphasis on generalized reaction forces in the statement of the evolution problem and not on local reaction forces of the real world. This point of view allows to escape from pathologies e.g. Painlevé paradox [5] and Kane Paradox [3]. The proposed evolution problem accounts for impacts and friction in case of multiple unilateral constraints. We prove the existence and uniqueness of the solution to the associated rate problem. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

New results and applications for multi-secret sharing schemes

In a multi-secret sharing scheme (MSSS), \(\ell \) different secrets are distributed among the players in some set \(\mathcal{P }=\{P_1,\ldots ,P_n\}\) , each one according to an access structure. The trivial solution to this problem is to run \(\ell \) independent instances of a standard secret sharing scheme, one for each secret. In this solution, the length of the secret share to be stored by each player grows linearly with \(\ell \) (when keeping all other parameters fixed). Multi-secret sharing schemes have been studied by the cryptographic community mostly from a theoretical perspective: different models and definitions have been proposed, for both unconditional (information-theoretic) and computational security. In the case of unconditional security, there are two different definitions. It has been proved that, for some particular cases of access structures that include the threshold case, a MSSS with the strongest level of unconditional security must have shares with length linear in \(\ell \) . Therefore, the optimal solution in this case is equivalent to the trivial one. In this work we prove that, even for a more relaxed notion of unconditional security, and for some kinds of access structures (in particular, threshold ones), we have the same efficiency problem: the length of each secret share must grow linearly with \(\ell \) . Since we want more efficient solutions, we move to the scenario of MSSSs with computational security. We propose a new MSSS, where each secret share has constant length (just one element), and we formally prove its computational security in the random oracle model. To the best of our knowledge, this is the first formal analysis on the computational security of a MSSS. We show the utility of the new MSSS by using it as a key ingredient in the design of two schemes for two new functionalities: multi-policy signatures and multi-policy decryption. We prove the security of these two new multi-policy cryptosystems in a formal security model. The two new primitives provide similar functionalities as attribute-based cryptosystems, with some advantages and some drawbacks that we discuss at the end of this work.     

Rinneite,K3Na[FeCl6], at 293, 84 and 9.5 K

The crystal structure of tripotassium sodium hexa­chloro­ferrate(II) has been determined by X‐ray diffraction at 293, 84 and 9.5 K. The accurate and extensive data sets collected should be suitable for charge–density analysis studies.     

Microwave-assisted synthesis of α-ethoxycarbamates

An efficient and reproducible synthesis of various α-ethoxycarbamates is described via a microwave heating mode. Compared to the thermal process, the microwave dielectric heating induces a dramatic reduction of the reaction time and the improvement of the yields. The reaction is general since applicable to aromatic and aliphatic aldehydes with various primary amines. Several examples involving chiral aldehydes have also been considered.     

Minimizing the number of machines for minimum length schedules

In this paper, we present a new objective function for scheduling on parallel machines: minimizing the number of machines for schedules of minimum length. We study its complexity and we prove the NP-completeness of this problem, even if there is no precedences or for unitary execution times. We propose several polynomial algorithms for various particular cases.     

Fine-tunable monodentate phosphoroamidite and aminophosphine ligands for Rh-catalyzed asymmetric hydroformylation

A biaryl-based monophosphoroamidite L1–L4a–f and aminophosphine L5–L7a–f ligand library was screened in the Rh-catalyzed asymmetric hydroformylation of several vinylarenes and heterocyclic olefins. Our results indicate that the selectivity is strongly dependent on the ligand parameters and on the substrate type. Enantioselectivities (up to 46%) were moderate in the hydroformylation of several vinylarenes S1–S5 and promising (up to 58%) for the more challenging heterocyclic olefins S6–S9.