Additively manufactured device for dynamic culture of large arrays of 3D tissue engineered constructs

The ability to test large arrays of cell and biomaterial combinations in 3D environments is still rather limited in the context of tissue engineering and regenerative medicine. This limitation can be generally addressed by employing highly automated and reproducible methodologies. This study reports on the development of a highly versatile and upscalable method based on additive manufacturing for the fabrication of arrays of scaffolds, which are enclosed into individualized perfusion chambers. Devices containing eight scaffolds and their corresponding bioreactor chambers are simultaneously fabricated utilizing a dual extrusion additive manufacturing system. To demonstrate the versatility of the concept, the scaffolds, while enclosed into the device, are subsequently surface-coated with a biomimetic calcium phosphate layer by perfusion with simulated body fluid solution. 96 scaffolds are simultaneously seeded and cultured with human osteoblasts under highly controlled bidirectional perfusion dynamic conditions over 4 weeks. Both coated and noncoated resulting scaffolds show homogeneous cell distribution and high cell viability throughout the 4 weeks culture period and CaP-coated scaffolds result in a significantly increased cell number. The methodology developed in this work exemplifies the applicability of additive manufacturing as a tool for further automation of studies in the field of tissue engineering and regenerative medicine.

Anterior cruciate ligament reconstruction with special reference to magnetic resonance imaging of the postoperative outcome

Anterior cruciate ligament (ACL) tear is a common sports injury of the knee. Arthroscopic reconstruction using autogenous graft material is widely used for patients with ACL instability. The grafts most commonly used are the patellar and the hamstring tendons, by various fixation techniques. Although clinical evaluation and conventional radiography are routinely used in follow-up after ACL surgery, magnetic resonance imaging (MRI) plays an important role in the diagnosis of complications after ACL surgery. The aim of this thesis was to study the clinical outcome of patellar and hamstring tendon ACL reconstruction techniques. In addition, the postoperative appearance of the ACL graft was evaluated using several MRI sequences. Of the 175 patients who underwent an arthroscopically assisted ACL reconstruction, 99 patients were randomized into patellar tendon (n=51) or hamstring tendon (n=48) groups. In addition, 62 patients with hamstring graft ACL reconstruction were randomized into either cross-pin (n=31) or interference screw (n=31) fixation groups. Follow-up evaluation determined knee laxity, isokinetic muscle performance and several knee scores. Lateral and anteroposterior view radiographs were obtained. Several MRI sequences were obtained with a 1.5-T imager. The appearance and enhancement pattern of the graft and periligamentous tissue, and the location of bone tunnels were evaluated. After MRI, arthroscopy was performed on 14 symptomatic knees. The results revealed no significant differences in the 2-year outcome between the groups. In the hamstring tendon group, the average femoral and tibial bone tunnel diameter increased during 2 years follow-up by 33% and 23%, respectively. In the asymptomatic knees, the graft showed homogeneous and low signal intensity with periligamentous streaks of intermediate signal intensity on T2-weighted MR images. In the symptomatic knees, arthroscopy revealed 12 abnormal grafts and two meniscal tears, each with an intact graft. Among 3 lax grafts visible on arthroscopy, MRI showed an intact graft and improper bone tunnel placement. For diagnosing graft failure, all MRI findings combined gave a specificity of 90% and a sensitivity of 81%. In conclusion, all techniques appeared to improve patients' performance, and were therefore considered as good choices for ACL reconstruction. In follow-up, MRI permits direct evaluation of the ACL graft, the bone tunnels, and additional disorders of the knee. Bone tunnel enlargement and periligamentous tissue showing contrast enhancement were non-specific MRI findings that did not signify ACL deficiency. With an intact graft and optimal femoral bone tunnel placement, graft deficiency is unlikely, and the MRI examination should be carefully scrutinized for possible other causes for the patients symptoms.

On the Cubicity of AT-Free Graphs and Circular-Arc Graphs

A unit cube in k dimensions (k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), a(i) + 1] on the real line. A graph G on n nodes is said to be representable as the intersection of k-cubes (cube representation in k dimensions) if each vertex of C can be mapped to a k-cube such that two vertices are adjacent in G if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G denoted as cub(G) is the minimum k for which G can be represented as the intersection of k-cubes. An interesting aspect about cubicity is that many problems known to be NP-complete for general graphs have polynomial time deterministic algorithms or have good approximation ratios in graphs of low cubicity. In most of these algorithms, computing a low dimensional cube representation of the given graph is usually the first step. We give an O(bw . n) algorithm to compute the cube representation of a general graph G in bw + 1 dimensions given a bandwidth ordering of the vertices of G, where bw is the bandwidth of G. As a consequence, we get O(Delta) upper bounds on the cubicity of many well-known graph classes such as AT-free graphs, circular-arc graphs and cocomparability graphs which have O(Delta) bandwidth. Thus we have: 1. cub(G) <= 3 Delta - 1, if G is an AT-free graph. 2. cub(G) <= 2 Delta + 1, if G is a circular-arc graph. 3. cub(G) <= 2 Delta, if G is a cocomparability graph. Also for these graph classes, there axe constant factor approximation algorithms for bandwidth computation that generate orderings of vertices with O(Delta) width. We can thus generate the cube representation of such graphs in O(Delta) dimensions in polynomial time.

Deterministic schemes for key distribution in wireless sensor networks

In this paper, we propose a new security metric for measuring resilience of a symmetric key distribution scheme in wireless sensor network. A polynomial-based and a novel complete connectivity schemes are proposed and an analytical comparison, in terms of security and connectivity, between the schemes is shown. Motivated by the schemes, we derive general expressions for security and connectivity. A number of conclusions are made using these general expressions.

Bounding Run-Times of Local Adiabatic Algorithms

A common trick for designing faster quantum adiabatic algorithms is to apply the adiabaticity condition locally at every instant. However it is often difficult to determine the instantaneous gap between the lowest two eigenvalues, which is an essential ingredient in the adiabaticity condition. In this paper we present a simple linear algebraic technique for obtaining a lower bound on the instantaneous gap even in such a situation. As an illustration, we investigate the adiabatic un-ordered search of van Dam et al. [17] and Roland and Cerf [15] when the non-zero entries of the diagonal final Hamiltonian are perturbed by a polynomial (in log N, where N is the length of the unordered list) amount. We use our technique to derive a bound on the running time of a local adiabatic schedule in terms of the minimum gap between the lowest two eigenvalues.

Classification of Indian meteorological stations using cluster and fuzzy cluster analysis, and Kohonen artificial neural networks

The present study deals with the application of cluster analysis, Fuzzy Cluster Analysis (FCA) and Kohonen Artificial Neural Networks (KANN) methods for classification of 159 meteorological stations in India into meteorologically homogeneous groups. Eight parameters, namely latitude, longitude, elevation, average temperature, humidity, wind speed, sunshine hours and solar radiation, are considered as the classification criteria for grouping. The optimal number of groups is determined as 14 based on the Davies-Bouldin index approach. It is observed that the FCA approach performed better than the other two methodologies for the present study.

Kernels for large margin time-series classification

In this paper we propose a novel family of kernels for multivariate time-series classification problems. Each time-series is approximated by a linear combination of piecewise polynomial functions in a Reproducing Kernel Hilbert Space by a novel kernel interpolation technique. Using the associated kernel function a large margin classification formulation is proposed which can discriminate between two classes. The formulation leads to kernels, between two multivariate time-series, which can be efficiently computed. The kernels have been successfully applied to writer independent handwritten character recognition.

Constructing commutative semifields of square order

The projection construction has been used to construct semifields of odd characteristic using a field and a twisted semifield [Commutative semi-fields from projection mappings, Designs, Codes and Cryptography, 61 (2011), 187{196]. We generalize this idea to a projection construction using two twisted semifields to construct semifields of odd characteristic. Planar functions and semifields have a strong connection so this also constructs new planar functions.

Data-aware task scheduling for all-to-all comparison problems in heterogeneous distributed systems

Solving large-scale all-to-all comparison problems using distributed computing is increasingly significant for various applications. Previous efforts to implement distributed all-to-all comparison frameworks have treated the two phases of data distribution and comparison task scheduling separately. This leads to high storage demands as well as poor data locality for the comparison tasks, thus creating a need to redistribute the data at runtime. Furthermore, most previous methods have been developed for homogeneous computing environments, so their overall performance is degraded even further when they are used in heterogeneous distributed systems. To tackle these challenges, this paper presents a data-aware task scheduling approach for solving all-to-all comparison problems in heterogeneous distributed systems. The approach formulates the requirements for data distribution and comparison task scheduling simultaneously as a constrained optimization problem. Then, metaheuristic data pre-scheduling and dynamic task scheduling strategies are developed along with an algorithmic implementation to solve the problem. The approach provides perfect data locality for all comparison tasks, avoiding rearrangement of data at runtime. It achieves load balancing among heterogeneous computing nodes, thus enhancing the overall computation time. It also reduces data storage requirements across the network. The effectiveness of the approach is demonstrated through experimental studies.

Affected sibling pairs with juvenile idiopathic arthritis : An immunogenetic study of the disease in multicase families

Genetic susceptibility to juvenile idiopathic arthritis (JIA) was studied in the genetically homogeneous Finnish population by collecting families with two or three patients affected by this disease from cases seen in the Rheumatism Foundation Hospital. The number of families ranged in different studies from 37 to 45 and the total number of patients with JIA, from among whom these cases were derived, was 2 000 to 2 300. Characteristics of the disease in affected siblings in Finland were compared with a population-based series and with a sibling series from the United States. A thorough clinical and ophthalmological examination was made of all affected patients belonging to sibpair series. Information on the occurrence of chronic rheumatic diseases in parents was collected by questionnaire and diagnoses were confirmed from hospital records. All patients, their parents and most of the healthy sibs were typed for human leukocyte antigen (HLA) alleles in loci A, C, B, DR and DQ. The HLA allele distribution of the cases was compared with corresponding data from Finnish bone marrow donors. The genetic component in JIA was found to be more significant than previously believed. A concordance rate of 25% for a disease with a population prevalence of 1 per 1000 implied a relative risk of 250 for a monozygotic (MZ) twin. An estimate for the sibling risk of an affected individual was about 15- to 20-fold. The disease was basically similar in familial and sporadic cases; the mean age at disease onset was however lower in familial cases, (4.8 years vs 7.4 years). Three sibpairs (3.4 expected) were concordant for the presence of asymptomatic uveitis. Uveitis would thus not appear to have any genetic component of its own, separate from the genetic basis of JIA. Four of the parents had JIA (0.2 cases expected), four had a type of rheumatoid factor-negative arthritis similar to that seen in juvenile patients but commencing in adulthood, and one had spondyloarthropathy (SPA). These findings provide additional support for the conception of a genetic predisposition to JIA and suggest the existence of a new disease entity, JIA of adult onset. Both the linkage analysis of the affected sibpairs and the association analysis of nuclear families provided overwhelming evidence of a major contribution of HLA to the genetic susceptibility to JIA. The association analysis in the Finnish population confirmed that the most significant associations prevailed for DRB1*0801, DQB1*0402, as expected from previous observations, and indicated the independent role of Cw*0401.

Clinical Phenotype and Genetic Epidemiology of Schizophrenia in a Finnish Isolate

This study is part of the joint project "The Genetic Epidemiology and Molecular Genetics of schizophrenia in Finland" between the Departments of Mental Health and Alcohol Research, and Molecular Medicine at the National Public Health Institute. In the study, we utilized three nationwide health care registers: 1) the Hospital Discharge Register, 2) the Free Medication Register, and 3) the Disability Pension Register, plus the National Population Register, in order to identify all patients with schizophrenia born from 1940 to 1976 (N=33,731) in Finland, and their first degree-relatives. 658 patients with at least one parent born in a homogeneous isolate in northeastern Finland were identified, as well as 4904 familial schizophrenia patients with at least two affected siblings from the whole country. The comparison group was derived from the Health 2000 Study. We collected case records and reassessed the register diagnosis. Were contacted the isolate patients and a random sample of patients from the whole country to make diagnostic clinical interviews and to assess the negative and positive symptoms and signs of schizophrenia. In addition to these patients, we interviewed siblings who were initially healthy according to the Hospital Discharge Register. Of those with a register diagnosis of schizophrenia, schizoaffective or schizophreniform disorder, 69% received a record-based consensus diagnosis and 63% an interview-based diagnosis of schizophrenia. Patients with schizophrenia having first-degree relatives with psychotic disorder had more severe affective flattening and alogia than those who were the only affected individuals in their family. The novel findings were: 1) The prevalence of schizophrenia in the isolate was relatively high based on register (1.5%), case record (0.9-1.3%), and interview (0.7-1.2%) data. 2) Isolate patients, regardless of their familial loading for schizophrenia, had less delusions and hallucinations than the whole country familial patients, which may be related to the genetic homogeneity in the isolate. This phenotype encourages the use of endophenotypes in genetic analyses instead of diagnoses alone. 3) The absence of register diagnosis does not confirm that siblings are healthy, because 7.7% of siblings had psychotic symptoms already before the register diagnoses were identified in 1991. For genetic research, the register diagnosis should therefore be reassessed using either a structured interview or a best- estimate case note consensus diagnosis. Structured clinical interview methods need be considered also in clinical practice.

Isoperimetric Problem and Meta-fibonacci Sequences

Let G = (V,E) be a simple, finite, undirected graph. For S ⊆ V, let $\delta(S,G) = \{ (u,v) \in E : u \in S \mbox { and } v \in V-S \}$ and $\phi(S,G) = \{ v \in V -S: \exists u \in S$ , such that (u,v) ∈ E} be the edge and vertex boundary of S, respectively. Given an integer i, 1 ≤ i ≤ ∣ V ∣, the edge and vertex isoperimetric value at i is defined as b e (i,G) =  min S ⊆ V; |S| = i |δ(S,G)| and b v (i,G) =  min S ⊆ V; |S| = i |φ(S,G)|, respectively. The edge (vertex) isoperimetric problem is to determine the value of b e (i, G) (b v (i, G)) for each i, 1 ≤ i ≤ |V|. If we have the further restriction that the set S should induce a connected subgraph of G, then the corresponding variation of the isoperimetric problem is known as the connected isoperimetric problem. The connected edge (vertex) isoperimetric values are defined in a corresponding way. It turns out that the connected edge isoperimetric and the connected vertex isoperimetric values are equal at each i, 1 ≤ i ≤ |V|, if G is a tree. Therefore we use the notation b c (i, T) to denote the connected edge (vertex) isoperimetric value of T at i. Hofstadter had introduced the interesting concept of meta-fibonacci sequences in his famous book “Gödel, Escher, Bach. An Eternal Golden Braid”. The sequence he introduced is known as the Hofstadter sequences and most of the problems he raised regarding this sequence is still open. Since then mathematicians studied many other closely related meta-fibonacci sequences such as Tanny sequences, Conway sequences, Conolly sequences etc. Let T 2 be an infinite complete binary tree. In this paper we related the connected isoperimetric problem on T 2 with the Tanny sequences which is defined by the recurrence relation a(i) = a(i − 1 − a(i − 1)) + a(i − 2 − a(i − 2)), a(0) = a(1) = a(2) = 1. In particular, we show that b c (i, T 2) = i + 2 − 2a(i), for each i ≥ 1. We also propose efficient polynomial time algorithms to find vertex isoperimetric values at i of bounded pathwidth and bounded treewidth graphs.

On the Average Case Communication Complexity for Detection in Sensor Networks

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space viewpoint is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces $\mathcal{S_I}$ and $\mathcal{S_C}$ and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating $\mathcal{S_I}$ and $\mathcal{S_C}$ is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. The average case CC of the relevant greater-than (GT) function is characterized within two bits. In the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm.

Phase-Field Simulation of Fusion Interface Events during Solidification of Dissimilar Welds: Effect of Composition Inhomogeneity

We investigate the events near the fusion interfaces of dissimilar welds using a phase-field model developed for single-phase solidification of binary alloys. The parameters used here correspond to the dissimilar welding of a Ni/Cu couple. The events at the Ni and the Cu interface are very different, which illustrate the importance of the phase diagram through the slope of the liquidus curves. In the Ni side, where the liquidus temperature decreases with increasing alloying, solutal melting of the base metal takes place; the resolidification, with continuously increasing solid composition, is very sluggish until the interface encounters a homogeneous melt composition. The growth difficulty of the base metal increases with increasing initial melt composition, which is equivalent to a steeper slope of the liquidus curve. In the Cu side, the initial conditions result in a deeply undercooled melt and contributions from both constrained and unconstrained modes of growth are observed. The simulations bring out the possibility of nucleation of a concentrated solid phase from the melt, and a secondary melting of the substrate due to the associated recalescence event. The results for the Ni and Cu interfaces can be used to understand more complex dissimilar weld interfaces involving multiphase solidification.

Scanning Tunneling Spectroscopy on Pr0.68Pb0.32MnO3 single crystals

Scanning tunneling microscopy/spectroscopy studies were carried out on single crystals of colossal magnetoresistive manganite Pr0.68Pb0.32MnO3 at different temperatures in order to probe their spatial homogeneity across the metal-insulator transition temperature TM-I(similar to 255 K). A metallic behavior of the local conductance was observed for temperatures T < TM-I. Zero bias conductance (dI/dV)v=(0), which is directly proportional to the local surface density of states at the Fermi level, shows a single distribution at temperatures T < 200 K suggesting a homogeneous electronic phase at low temperatures. In a narrow temperature window of 200 K < T < TM-I, however, an inhomogeneous distribution of (dI/dV)v=(0) has been observed. This result gives evidence for phase separation in the transition region in this compound.