Repeatedly foldable AMOLED display

In this study, a 5.9‐inch foldable active‐matrix organic light emitting diode (AMOLED) display was developed. A folding test was performed repeatedly. The display survived the folding test (100,000 folds) with a curvature radius of 2 mm. To protect an organic light emitting diode (OLED) against moisture, inorganic passivation layers are provided on the upper and lower sides of the flexible display. Using our transfer technology, high density passivation layers can be obtained. The measured water vapor transmission rate of the layer is 7 × 10^?6 g/m²?day or less, which improves OLED reliability. With these techniques, we have developed a book‐type display, which is repeatedly foldable like a book, and a tri‐fold display including a display area, which is foldable in three.     

Partition Into Triangles on Bounded Degree Graphs

We consider the Partition Into Triangles problem on bounded degree graphs. We show that this problem is polynomial-time solvable on graphs of maximum degree three by giving a linear-time algorithm. We also show that this problem becomes $\mathcal{NP}$ -complete on graphs of maximum degree four. Moreover, we show that there is no subexponential-time algorithm for this problem on graphs of maximum degree four unless the Exponential-Time Hypothesis fails. However, the Partition Into Triangles problem on graphs of maximum degree at most four is in many cases practically solvable as we give an algorithm for this problem that runs in $\mathcal{O}(1.02220^{n})$ time and linear space.     

Grid resource brokering algorithms enabling advance reservations and resource selection based on performance predictions

We present algorithms, methods, and software for a Grid resource manager, that performs resource brokering and job scheduling in production Grids. This decentralized broker selects computational resources based on actual job requirements, job characteristics, and information provided by the resources, with the aim to minimize the total time to delivery for the individual application. The total time to delivery includes the time for program execution, batch queue waiting, and transfer of executable and input/output data to and from the resource. The main features of the resource broker include two alternative approaches to advance reservations, resource selection algorithms based on computer benchmark results and network performance predictions, and a basic adaptation facility. The broker is implemented as a built-in component of a job submission client for the NorduGrid/ARC middleware.     

Accelerating Ray Tracing using Constrained Tetrahedralizations

In this paper we introduce the constrained tetrahedralization as a new acceleration structure for ray tracing. A constrained tetrahedralization of a scene is a tetrahedralization that respects the faces of the scene geometry. The closest intersection of a ray with a scene is found by traversing this tetrahedralization along the ray, one tetrahedron at a time. We show that constrained tetrahedralizations are a viable alternative to current acceleration structures, and that they have a number of unique properties that set them apart from other acceleration structures: constrained tetrahedralizations are not hierarchical yet adaptive; the complexity of traversing them is a function of local geometric complexity rather than global geometric complexity; constrained tetrahedralizations support deforming geometry without any effort; and they have the potential to unify several data structures currently used in global illumination.     

Copper planar microcoils applied to magnetic actuation

Recent advances in microtechnology allow realization of planar microcoils. These components are integrated in MEMS as magnetic sensor or actuator. In the latter case, it is necessary to maximize the effective magnetic field which is proportional to the current passing through the copper track and depends on the distance to the generation microcoil. The aim of this work was to determine the optimal microcoil design configuration for magnetic field generation. The results were applied to magnetic actuation, taking into account technological constraints. In particular, we have considered different realistic configurations that involve a magnetically actuated device coupled to a microcoil. Calculations by a semi-analytical method using Matlab software were validated by experimental measurements. The copper planar microcoils are fabricated by UV micromoulding on different substrates: flexible polymer (Kapton^®) and silicate on silicon. They are constituted by a spiral-like continuous track. Their total surface is about 1 mm².     

Comparison of the identification performance of conventional FEM updating and integrated DIC

Full‐field identification methods are increasingly used to adequately identify constitutive parameters to describe the mechanical behavior of materials. This paper investigates the more recently introduced one‐step method of integrated digital image correlation (IDIC) with respect to the most commonly used two‐step method of finite element model updating (FEMU), which uses a subset‐based DIC algorithm. To make the comparison as objective as possible, both methods are implemented in the most equivalent manner and use the same FE model. Various virtual test cases are studied to assess the performance of both methods when subjected to different error sources: (1) systematic errors, (2) poor initial guesses for the constitutive parameters, (3) image noise, (4) constitutive model errors, and (5) experimental errors. Results show that, despite the mathematical similarity of both methods, IDIC produces less erroneous and more reliable results than FEMU, particularly for more challenging test cases exhibiting small displacements, complex kinematics, misalignment of the specimen, and image noise. Copyright © 2015 John Wiley & Sons, Ltd.     

An annotated corpus for the analysis of VP ellipsis

Verb Phrase Ellipsis (VPE) has been studied in great depth in theoretical linguistics, but empirical studies of VPE are rare. We extend the few previous corpus studies with an annotated corpus of VPE in all 25 sections of the Wall Street Journal corpus (WSJ) distributed with the Penn Treebank. We annotated the raw files using a stand-off annotation scheme that codes the auxiliary verb triggering the elided verb phrase, the start and end of the antecedent, the syntactic type of antecedent (VP, TV, NP, PP or AP), and the type of syntactic pattern between the source and target clauses of the VPE and its antecedent. We found 487 instances of VPE (including predicative ellipsis, antecedent-contained deletion, comparative constructions, and pseudo-gapping) plus 67 cases of related phenomena such as do so anaphora. Inter-annotator agreement was high, with a 0.97 average F-score for three annotators for one section of the WSJ. Our annotation is theory neutral, and has better coverage than earlier efforts that relied on automatic methods, e.g. simply searching the parsed version of the Penn Treebank for empty VP’s achieves a high precision (0.95) but low recall (0.58) when compared with our manual annotation. The distribution of VPE source–target patterns deviates highly from the standard examples found in the theoretical linguistics literature on VPE, once more underlining the value of corpus studies. The resulting corpus will be useful for studying VPE phenomena as well as for evaluating natural language processing systems equipped with ellipsis resolution algorithms, and we propose evaluation measures for VPE detection and VPE antecedent selection. The stand-off annotation is freely available for research purposes.     

Two nonlinear optimization methods for black box identification compared

In this paper, two nonlinear optimization methods for the identification of nonlinear systems are compared. Both methods estimate the parameters of e.g. a polynomial nonlinear state-space model by means of a nonlinear least-squares optimization of the same cost function. While the first method does not estimate the states explicitly, the second method estimates both states and parameters adding an extra constraint equation. Both methods are introduced and their similarities and differences are discussed utilizing simulation data. The unconstrained method appears to be faster and more memory efficient, but the constrained method has a significant advantage as well: it is robust for unstable systems of which bounded input-output data can be measured (e.g. a system captured in a stabilizing feedback loop). Both methods have successfully been applied on real-life measurement data.     

Multiway Spectral Clustering with Out-of-Sample Extensions through Weighted Kernel PCA

A new formulation for multiway spectral clustering is proposed. This method corresponds to a weighted kernel principal component analysis (PCA) approach based on primal-dual least-squares support vector machine (LS-SVM) formulations. The formulation allows the extension to out-of-sample points. In this way, the proposed clustering model can be trained, validated, and tested. The clustering information is contained on the eigendecomposition of a modified similarity matrix derived from the data. This eigenvalue problem corresponds to the dual solution of a primal optimization problem formulated in a high-dimensional feature space. A model selection criterion called the Balanced Line Fit (BLF) is also proposed. This criterion is based on the out-of-sample extension and exploits the structure of the eigenvectors and the corresponding projections when the clusters are well formed. The BLF criterion can be used to obtain clustering parameters in a learning framework. Experimental results with difficult toy problems and image segmentation show improved performance in terms of generalization to new samples and computation times.