A novel route in bone tissue engineering : magnetic biomimetic scaffolds

In recent years, interest in tissue engineering and its solutions has increased considerably. In particular, scaffolds have become fundamental tools in bone graft substitution and are used in combination with a variety of bio-agents. However, a long-standing problem in the use of these conventional scaffolds lies in the impossibility of re-loading the scaffold with the bio-agents after implantation. This work introduces the magnetic scaffold as a conceptually new solution. The magnetic scaffold is able, via magnetic driving, to attract and take up in vivo growth factors, stem cells or other bio-agents bound to magnetic particles. The authors succeeded in developing a simple and inexpensive technique able to transform standard commercial scaffolds made of hydroxyapatite and collagen in magnetic scaffolds. This innovative process involves dip-coating of the scaffolds in aqueous ferrofluids containing iron oxide nanoparticles coated with various biopolymers. After dip-coating, the nanoparticles are integrated into the structure of the scaffolds, providing the latter with magnetization values as high as 15 emu g�1 at 10 kOe. These values are suitable for generating magnetic gradients, enabling magnetic guiding in the vicinity and inside the scaffold. The magnetic scaffolds do not suffer from any structural damage during the process, maintaining their specific porosity and shape. Moreover, they do not release magnetic particles under a constant flow of simulated body fluids over a period of 8 days. Finally, preliminary studies indicate the ability of the magnetic scaffolds to support adhesion and proliferation of human bone marrow stem cells in vitro. Hence, this new type of scaffold is a valuable candidate for tissue engineering applications, featuring a novel magnetic guiding option.

Special issue on Current Trends in Physics

In 1974, the Russian physicist Vitaly Ginzburg wrote a book entitled `Key Problems of Physics and Astrophysics' in which he presented a selection of important and challenging problems along with speculations on what the future holds. The selection had a broad range, was highly personalized, and was aimed at the general scientist, for whom it made very interesting reading

Interrelationship between Interphase Boundaries and Phase Contents near the Critical Compositions of Lead-Free Ferroelectric (Na0.5Bi0.5)TiO3-BaTiO3

Heterophase structures in lead-free perovskite-type ferroelectric solid solutions of (1 - z)(Na0.5Bi0.5)TiO3 - zBaTiO(3) are analysed for a few critical compositions near the morphotropic phase boundary (z = 0.05-0.07). Examples of the phase coexistence and elastic matching of the phases from different symmetry groups are considered to find optimum volume fractions of specific domain types and coexisting phases at the complete stress relief in two-phase samples. Some interrelations between these volume fractions are described using variants of the domain arrangement at changes in the composition and unit-cell parameters. The evaluated room-temperature volume fractions of the ferroelectric monoclinic (Cm symmetry) and tetragonal (P4mm symmetry) phases near the morphotropic phase boundary are in agreement with experimental data.

Avian comparative genomics: reciprocal chromosome painting between domestic chicken (Gallus gallus) and the stone curlew (Burhinus oedicnemus, Charadriiformes) - An atypical species with low diploid number

The chicken is the most extensively studied species in birds and thus constitutes an ideal reference for comparative genomics in birds. Comparative cytogenetic studies indicate that the chicken has retained many chromosome characters of the ancestral avia

Flying lemurs – The 'flying tree shrews'? Molecular cytogenetic evidence for a Scandentia-Dermoptera sister clade

Background: Flying lemurs or Colugos (order Dermoptera) represent an ancient mammalian lineage that contains only two extant species. Although molecular evidence strongly supports that the orders Dermoptera, Scandentia, Lagomorpha, Rodentia and Primates form a superordinal clade called Supraprimates (or Euarchontoglires), the phylogenetic placement of Dermoptera within Supraprimates remains ambiguous. Results: To search for cytogenetic signatures that could help to clarify the evolutionary affinities within this superordinal group, we have established a genome-wide comparative map between human and the Malayan flying lemur (Galeopterus variegatus) by reciprocal chromosome painting using both human and G. variegatus chromosome-specific probes. The 22 human autosomal paints and the X chromosome paint defined 44 homologous segments in the G. variegatus genome. A putative inversion on GVA 11 was revealed by the hybridization patterns of human chromosome probes 16 and 19. Fifteen associations of human chromosome segments (HSA) were detected in the G. variegatus genome: HSA1/3, 1/10, 2/21, 3/ 21, 4/8, 4/18, 7/15, 7/16, 7/19, 10/16, 12/22 (twice), 14/15, 16/19 (twice). Reverse painting of G. variegatus chromosome-specific paints onto human chromosomes confirmed the above results, and defined the origin of the homologous human chromosomal segments in these associations. In total, G. variegatus paints revealed 49 homologous chromosomal segments in the HSA genome. Conclusion: Comparative analysis of our map with published maps from representative species of other placental orders, including Scandentia, Primates, Lagomorpha and Rodentia, suggests a signature rearrangement (HSA2q/21 association) that links Scandentia and Dermoptera to one sister clade. Our results thus provide new evidence for the hypothesis that Scandentia and Dermoptera have a closer phylogenetic relationship to each other than either of them has to Primates.

Parameter Sensitive Detectors

Object detection can be challenging when the object class exhibits large variations. One commonly-used strategy is to first partition the space of possible object variations and then train separate classifiers for each portion. However, with continuous spaces the partitions tend to be arbitrary since there are no natural boundaries (for example, consider the continuous range of human body poses). In this paper, a new formulation is proposed, where the detectors themselves are associated with continuous parameters, and reside in a parameterized function space. There are two advantages of this strategy. First, a-priori partitioning of the parameter space is not needed; the detectors themselves are in a parameterized space. Second, the underlying parameters for object variations can be learned from training data in an unsupervised manner. In profile face detection experiments, at a fixed false alarm number of 90, our method attains a detection rate of 75% vs. 70% for the method of Viola-Jones. In hand shape detection, at a false positive rate of 0.1%, our method achieves a detection rate of 99.5% vs. 98% for partition based methods. In pedestrian detection, our method reduces the miss detection rate by a factor of three at a false positive rate of 1%, compared with the method of Dalal-Triggs.

Layered Graphical Models for Tracking Partially-Occluded Objects

Partial occlusions are commonplace in a variety of real world computer vision applications: surveillance, intelligent environments, assistive robotics, autonomous navigation, etc. While occlusion handling methods have been proposed, most methods tend to break down when confronted with numerous occluders in a scene. In this paper, a layered image-plane representation for tracking people through substantial occlusions is proposed. An image-plane representation of motion around an object is associated with a pre-computed graphical model, which can be instantiated efficiently during online tracking. A global state and observation space is obtained by linking transitions between layers. A Reversible Jump Markov Chain Monte Carlo approach is used to infer the number of people and track them online. The method outperforms two state-of-the-art methods for tracking over extended occlusions, given videos of a parking lot with numerous vehicles and a laboratory with many desks and workstations.

Multiplicative Kernels: Object Detection, Segmentation and Pose Estimation

Object detection is challenging when the object class exhibits large within-class variations. In this work, we show that foreground-background classification (detection) and within-class classification of the foreground class (pose estimation) can be jointly learned in a multiplicative form of two kernel functions. One kernel measures similarity for foreground-background classification. The other kernel accounts for latent factors that control within-class variation and implicitly enables feature sharing among foreground training samples. Detector training can be accomplished via standard SVM learning. The resulting detectors are tuned to specific variations in the foreground class. They also serve to evaluate hypotheses of the foreground state. When the foreground parameters are provided in training, the detectors can also produce parameter estimate. When the foreground object masks are provided in training, the detectors can also produce object segmentation. The advantages of our method over past methods are demonstrated on data sets of human hands and vehicles.

A new heuristic for three-machine flow shop scheduling

This paper considers the problem of sequencing n jobs in a three-machine flow shop with the objective of minimizing the makespan, which is the completion time of the last job. An O(n log n) time heuristic that is based on Johnson's algorithm is presented. It is shown to generate a schedule with length at most 5/3 times that of an optimal schedule, thereby reducing the previous best available worst-case performance ratio of 2. An application to the general flow shop is also discussed.

Approximation algorithms for two-machine flow shop scheduling with batch setup times

In many practical situations, batching of similar jobs to avoid setups is performed while constructing a schedule. This paper addresses the problem of non-preemptively scheduling independent jobs in a two-machine flow shop with the objective of minimizing the makespan. Jobs are grouped into batches. A sequence independent batch setup time on each machine is required before the first job is processed, and when a machine switches from processing a job in some batch to a job of another batch. Besides its practical interest, this problem is a direct generalization of the classical two-machine flow shop problem with no grouping of jobs, which can be solved optimally by Johnson's well-known algorithm. The problem under investigation is known to be NP-hard. We propose two O(n logn) time heuristic algorithms. The first heuristic, which creates a schedule with minimum total setup time by forcing all jobs in the same batch to be sequenced in adjacent positions, has a worst-case performance ratio of 3/2. By allowing each batch to be split into at most two sub-batches, a second heuristic is developed which has an improved worst-case performance ratio of 4/3. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.

Heuristics for short route job shop scheduling problems

We consider two “minimum”NP-hard job shop scheduling problems to minimize the makespan. In one of the problems every job has to be processed on at most two out of three available machines. In the other problem there are two machines, and a job may visit one of the machines twice. For each problem, we define a class of heuristic schedules in which certain subsets of operations are kept as blocks on the corresponding machines. We show that for each problem the value of the makespan of the best schedule in that class cannot be less than 3/2 times the optimal value, and present algorithms that guarantee a worst-case ratio of 3/2.

A polynomial algorithm for the three-machine open shop with a bottleneck machine

The paper considers the three‐machine open shop scheduling problem to minimize themakespan. It is assumed that each job consists of at most two operations, one of which is tobe processed on the bottleneck machine, the same for all jobs. A new lower bound on theoptimal makespan is derived, and a linear‐time algorithm for finding an optimalnon‐preemptive schedule is presented.

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is NP-hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst-case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two-machine flow shop and the open shop problems with a single server are also shown to be NP-hard in the strong sense. However, we reduce the two-machine flow shop no-wait problem with a single server to the Gilmore-Gomory traveling salesman problem and solve it in polynomial time. (c) 2000 John Wiley & Sons, Inc.

Two-machine open shop scheduling with an availability constraint

We study a two-machine open shop scheduling problem, in which one machine is not available for processing during a given time interval. The objective is to minimize the makespan. We show that the problem is NP-hard and present an approximation algorithm with a worst-case ratio of 4/3.