Differences in cytocompatibility,dynamics of the oxide layers’ formation,and nickel release between superelastic and thermo-activated nickel–titanium archwires

Superelastic (SE) and thermo-activated (TA) nickel–titanium (NiTi) archwires are used in everyday orthodontic practice, based on their acceptable biocompatibility and well-defined shape memory properties. However, the differences in their surface microstructure and cytotoxicity have not been clearly defined, and the standard cytotoxicity tests are too robust to detect small differences in the cytotoxicity of these alloys, all of which can lead to unexpected adverse reactions in some patients. Therefore, we tested the hypothesis that the differences in manufacture and microstructure of commercially available SE and TA archwires may influence their biocompatibility. The archwires were studied as-received and after conditioning for 24 h or 35 days in a cell culture medium under static conditions. All of the tested archwires, including their conditioned medium (CM), were non-cytotoxic for L929 cells, but Rematitan SE (both as received and conditioned) induced the apoptosis of rat thymocytes in a direct contact. In contrast, TruFlex SE and Equire TA increased the proliferation of thymocytes. The cytotoxic effect of Rematitan SE correlated with the higher release of Ni ions in CM, higher concentration of surface Ni and an increased oxygen layer thickness after the conditioning. In conclusion, the apoptosis assay on rat thymocytes, in contrast to the less sensitive standard assay on L929 cells, revealed that Rematitan SE was less cytocompatible compared to other archwires and the effect was most probably associated with a higher exposition of the cells to Ni on the surface of the archwire, due to the formation of unstable oxide layer.     

An adaptive method based on the improved LPA-ICI algorithm for MRI enhancement

Various diseases are diagnosed using medical imaging used for analysing internal anatomical structures. However, medical images are susceptible to noise introduced in both acquisition and transmission processes. We propose an adaptive data-driven image denoising algorithm based on an improvement of the intersection of confidence intervals (ICI), called relative ICI (RICI) algorithm. The 2D mask of the adaptive size and shape is calculated for each image pixel independently, and utilized in the design of the 2D local polynomial approximation (LPA) filters. Denoising performances, in terms of the PSNR, are compared to the original ICI-based method, as well as to the fixed sized filtering. The proposed adaptive RICI-based denoising outperformed the original ICI-based method by up to 1.32 dB, and the fixed size filtering by up to 6.48 dB. Furthermore, since the denoising of each image pixel is done locally and independently, the method is easy to parallelize.     

A SLIT THROUGH PHOTOGRAPHY

Post-war experimental and conceptual photography in former Yugoslavia has only rarely been the subject of detailed study and interpretation. In considering this period, it is necessary to take into account several factors, including the absence of permanent exhibition spaces for photography, the lack of magazines in which photographic themes were presented and discussed, the impossibility of studying the field of photography and, finally, the inadequate knowledge and application of contemporary criticism and theories of photography. Nevertheless, from the mid-1950s onwards it is possible to note a variety of innovations in the field, in terms of both form and subject-matter. This article considers rare instances of institutional support for progressive photography-related events and unique, intellectual-poetic works. After the break-up of Yugoslavia, there is a dominant tendency to nationalize art created in the former state, thus ignoring the specific Yugoslav cultural field as well as the European context. Based on a methodology which surpasses the national (but still acknowledges it) and searches for meaning within the broader socio-political space to which art is referring, the research aims to change the paradigm of the peripheral position and general ignorance of the circumstances under which this innovative practice emerges.     

Improvements in data reduction in direct pulse heating calorimetry

This paper describes improvements introduced in data reduction in direct heating pulse specific heat experiments. In calculations of specific heat, it is necessary to calculate the first derivative of the recorded temperature data as a function of time. The error induced by different numerical differentiation techniques can represent a significant part of the overall measurement error. Thus, different digital filtering techniques, differentiation, and smoothing algorithms were applied and tested to examine their influence on the minimization of errors induced by noise, which is unavoidable in measured signals. A minimum square error criterion was applied in designing digital filters, with arbitrary prescribed magnitude characteristics. Attention was paid to applications when one or more structural phase transitions in the specimen material occur within the temperature range covered by the experiment. The cases where the frequency spectrum of induced noise overlaps with the spectrum of temperature transient signals originating from phase transitions were analyzed in detail. The effectiveness of the methods of extracting the final specific heat data from a noisy signal using different digital filtering techniques is demonstrated.Paper presented at the Fourth International Workshop on Subsecond Thermophysics, June 27–29, 1995, Köln, Germany.     

A subexponential bound for linear programming

We present a simple randomized algorithm which solves linear programs withn constraints andd variables in expected $$\min \{ O(d^2 2^d n),e^{2\sqrt {dIn({n \mathord{\left/ {\vphantom {n {\sqrt d }}} \right. \kern-\nulldelimiterspace} {\sqrt d }})} + O(\sqrt d + Inn)} \}$$ time in the unit cost model (where we count the number of arithmetic operations on the numbers in the input); to be precise, the algorithm computes the lexicographically smallest nonnegative point satisfyingn given linear inequalities ind variables. The expectation is over the internal randomizations performed by the algorithm, and holds for any input. In conjunction with Clarkson's linear programming algorithm, this gives an expected bound of $$O(d^2 n + e^{O(\sqrt {dInd} )} ).$$ The algorithm is presented in an abstract framework, which facilitates its application to several other related problems like computing the smallest enclosing ball (smallest volume enclosing ellipsoid) ofn points ind-space, computing the distance of twon-vertex (orn-facet) polytopes ind-space, and others. The subexponential running time can also be established for some of these problems (this relies on some recent results due to Gärtner).     

Extending applications using an advanced approach to DLL injection and API hooking

When programmers need to modify third‐party applications, they frequently do not have access to their source code. In such cases, DLL injection and API hooking are techniques that can be used to modify applications without intervening into their source code. The commonly used varieties of injection and hooking approaches have many practical limitations: they are inconvenient for a programmer to implement, do not work reliably in conjunction with all applications and with certain low‐level machine instructions. In this paper we present two novel approaches to DLL injection and API hooking, which we call Debugger‐aided DLL injection and Single Instruction Hooking. Our approaches overcome the limitations of the state‐of‐the art approaches. Despite incurring greater execution times, our approach allows extending of the applications in situations where the comparable approaches fail. As such, it has a notable practical value for beneficial practical applications of injection and hooking approaches, which are present in malware detection programs and computer security tools. Copyright © 2010 John Wiley & Sons, Ltd.     

Left-forbidding cooperating distributed grammar systems

A left-forbidding grammar, introduced in this paper, is a context-free grammar, where a set of nonterminal symbols is attached to each context-free production. Such a production can rewrite a nonterminal provided that no symbol from the attached set occurs to the left of the rewritten nonterminal in the current sentential form. The present paper discusses cooperating distributed grammar systems with left-forbidding grammars as components and gives some new characterizations of language families of the Chomsky hierarchy. In addition, it also proves that twelve nonterminals are enough for cooperating distributed grammar systems working in the terminal derivation mode with two left-forbidding components (including erasing productions) to characterize the family of recursively enumerable languages.     

The <Emphasis Type="Italic">L</Emphasis><Superscript>2</Superscript>-Optimality of the IIPG Method for Odd Degrees of Polynomial Approximation in 1D

The paper deals with a numerical analysis of the incomplete interior penalty Galerkin (IIPG) method applied to one dimensional Poisson problem. Based on a particular choice of the interior penalty parameter σ (order of O(h ⁻¹)), we derive the optimal error estimate in the L ²-norm for odd degrees of polynomial approximation for locally quasi-uniform meshes. Moreover, we show that only the mentioned choice of the penalty parameter leads to optimal orders of convergence. Finally, presented numerical experiments verify the theoretical results.