A URI-based approach for addressing fragments of media resources on the Web

To make media resources a prime citizen on the Web, we have to go beyond simply replicating digital media files. The Web is based on hyperlinks between Web resources, and that includes hyperlinking out of resources (e.g., from a word or an image within a Web page) as well as hyperlinking into resources (e.g., fragment URIs into Web pages). To turn video and audio into hypervideo and hyperaudio, we need to enable hyperlinking into and out of them. The W3C Media Fragments Working Group is taking on the challenge to further embrace W3C??s mission to lead the World Wide Web to its full potential by developing a Media Fragment protocol and guidelines that ensure the long-term growth of the Web. The major contribution of this paper is the introduction of Media Fragments as a media-format independent, standard means of addressing media resources using URIs. Moreover, we explain how the HTTP protocol can be used and extended to serve Media Fragments and what the impact is for current Web-enabled media formats.     

Conception assistée par ordinateur des circuits intégrés monolithiques hyperfréquences

Computer aided design of microwave monolithic integrated circuits must combine two different fields. The first domain is the simulation of microwave circuits taking into account non linear aspects development of time domain and harmonic balance simulation algorithms specialized for microwave circuits. In the second place are found, the layout algorithms which were developed for logic circuits (on Si or GaAs). The association of these two types of algorithms leads to the constitution of aCad workstation for microwave monolithic integrated circuits. Two examples of design and realization of integrated circuits with these tools are presented.     

On the Black-Box Complexity of Sperner’s Lemma

We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over pseudo-manifolds of arbitrary dimension. The query complexity of our algorithm is linear in the separation number of the skeleton graph of the manifold and the size of its boundary. As a corollary we get an deterministic query algorithm for the black-box version of the problem 2D-SPERNER, a well studied member of Papadimitriou’s complexity class PPAD. This upper bound matches the deterministic lower bound of Crescenzi and Silvestri. The tightness of this bound was not known before. In another result we prove for the same problem an lower bound for its probabilistic, and an lower bound for its quantum query complexity, showing that all these measures are polynomially related. Research supported by the European Commission IST Integrated Project Qubit Application (QAP) 015848, the OTKA grants T42559 and T46234, and by the ANR Blanc AlgoQP grant of the French Research Ministry.     

Ferritin Protein Regulates the Degradation of Iron Oxide Nanoparticles

Proteins implicated in iron homeostasis are assumed to be also involved in the cellular processing of iron oxide nanoparticles. In this work, the role of an endogenous iron storage protein—namely the ferritin—is examined in the remediation and biodegradation of magnetic iron oxide nanoparticles. Previous in vivo studies suggest the intracellular transfer of the iron ions released during the degradation of nanoparticles to endogenous protein cages within lysosomal compartments. Here, the capacity of ferritin cages to accommodate and store the degradation products of nanoparticles is investigated in vitro in the physiological acidic environment of the lysosomes. Moreover, it is questioned whether ferritin proteins can play an active role in the degradation of the nanoparticles. The magnetic, colloidal, and structural follow‐up of iron oxide nanoparticles and proteins in lysosome‐like medium confirms the efficient remediation of potentially harmful iron ions generated by nanoparticles within ferritins. The presence of ferritins, however, delays the degradation of particles due to a complex colloidal behavior of the mixture in acidic medium. This study exemplifies the important implications of intracellular proteins in processes of degradation and metabolization of iron oxide nanoparticles.     

Embossable grating couplers for planar waveguide optical sensors

Planar optical waveguides are an attractive tool for use in analytical chemistry and spectroscopy. Although similar to fiber optics, planar waveguides have been slow to be commercially accepted due to the difficulty of coupling light into the guide. Generally, prism coupling is the method of choice in the laboratory, as efficiencies approaching 80% can be reached. However, prisms are impractical for routine use for several reasons: expensive positioning equipment is required, coupled power is sensitive to environmental fluctuations, and prism coupling prohibits the fabrication of a truly planar device. The use of thin gratings on the surface of the waveguide allows for a two-dimensional structure to be maintained, while providing enough efficiency to be useful as a sensor. Our research efforts focus on developing a technique to make inexpensive, reproducible gratings that are easy to fabricate. By chemically modifying the surface of a commercial grating with a suitable release agent, it is possible to emboss replica gratings onto a variety of waveguide types. The fabrication of embossed gratings will be described, and their performance on glass, ion-diffused, polymer, and semiconductor waveguides will be presented.     

Throughput optimization in two-machine flowshops with flexible operations

In this study, a two-machine flowshop producing identical parts is considered. Each of the identical parts is assumed to require a number of manufacturing operations, and the machines are assumed to be flexible enough to perform different operations. Due to economical or technological constraints, some specific operations are preassigned to one of the machines. The remaining operations, called flexible operations, can be performed on either one of the machines, so that the same flexible operation can be performed on different machines for different parts. The problem is to determine the assignment of the flexible operations to the machines for each part, with the objective of maximizing the throughput rate. We consider various cases regarding the number of parts to be produced and the capacity of the buffer between the machines. We present solution methods for each variant of the problem.     

Solving subgraph isomorphism problems with constraint programming

The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated filtering algorithm to solve this problem within the context of constraint programming. The main idea of the filtering algorithm is to label every node with respect to its relationships with other nodes of the graph, and to define a partial order on these labels in order to express compatibility of labels for subgraph isomorphism. This partial order over labels is used to filter domains. Labelings can also be strengthened by adding information from the labels of neighbors. Such a strengthening can be applied iteratively until a fixpoint is reached. Practical experiments illustrate that our new filtering approach is more effective on difficult instances of scale free graphs than state-of-the-art algorithms and other constraint programming approaches.