Compressive properties of pristine and SiC-Te-added MgB2 powders,green compacts and spark-plasma-sintered bulks

Pristine and (SiC+Te)-added MgB₂ powders, green and spark plasma sintered (SPS) compacts were investigated from the viewpoint of quasi-static and dynamic (Split-Hopkinson Pressure Bar, SHPB) compressive mechanical properties The amount of the additive (SiC+Te) was selected to be the optimum one for maximization of the superconducting functional parameters. Pristine and added MgB₂ show very similar compressive parameters (tan δ, fracture strength, Vickers hardness, others) and fragment size in the SHPB test. However, for the bulk SPSed samples the ratio of intergranular to transgranular fracturing changes, the first one being stronger in the added sample. This is reflected in the quasi-static K_IC that is higher for the added sample. Despite this result, sintered samples are brittle and have roughly similar fragmentation behavior as for brittle engineering ceramics. In the fragmentation process, the composite nature of our samples should be considered with a special focus on MgB₂ blocks (colonies) that show the major contribution to fracturing. The Glenn-Chudnovsky model of fracturing under dynamic load provides the closest values to our experimental fragment size data.     

Compatibility of polysaccharide/maleic copolymer blends. IV. Thermal behavior of hydroxypropyl cellulose‐containing blends

The compatibility of the hydroxypropyl cellulose (HPC) with maleic acid–vinyl acetate copolymer in the solid state was studied by thermogravimetry, thermo‐optical analysis, differential scanning calorimetry (DSC), Fourier transform infrared spectroscopy (FTIR), and optical microscopy. It was established that physical interactions are prevalent in blends with a high content of HPC, whereas chemical interactions predominate in blends with a medium and low content of HPC. By increasing the temperature, the thermochemical reactions are favored. Thermal properties are dependent on the mixing ratio of the components. © 2003 Wiley Periodicals, Inc. J Appl Polym Sci 88: 2585–2597, 2003     

Complexes With Biologically Active Ligands. Part 6 Ni(II) Coordination Compounds of Hydrazine and Heterocyclic Sulfonamides as Inhibitors of the Zinc Enzyme Carbonic Anhydrase

Ternary Ni(II) complexes of hydrazine and eight heterocyclic sulfonamides possessing carbonic anhydrase (CA) inhibitory properties, were prepared and characterized by elemental analysis, spectroscopic, magnetic, thermogravimetric, and conductimetric measurements. The complexes behave as strong inhibitors for two isozymes (I and II) of carbonic anhydrase.     

InSAR validation based on GNSS measurements in Bucharest

This research aims to complex validate radar displacement products over Bucharest based on Global Navigation Satellite System or GNSS. Validation was represented by the comparison of the recent TerraSAR-X (TSX) displacement results with field GNSS data. For this purpose, 24 and 27 high-resolution images acquired from the TSX satellite between 2011 and 2014 were processed by Permanent Scatterer Inteferometry (PSI) and Small BASeline Subset (SBAS) – interferometric techniques using synthetic aperture radar (SAR) images. The images were selected from a larger pool of SAR images, after consulting weather databases, which helped eliminate the images acquired under adverse weather conditions. GNSS locations were cross-checked on high-resolution optical images and 21 ground points (including three permanent stations) were selected. All these points were (1) characterized by high coherence on radar images; (2) were on the ground; (3) were situated in large vacant spaces; and (4) far away from radar obstacles such as trees. A major challenge in achieving the research goal was to overcome the lack of permanent stations at the ground level within the area of Bucharest. Instead of permanent stations, our team designed and installed forced centring systems that remained stable over time, eliminating the instalment errors of GNSS receivers. The line-of-site (LOS) components derived from GNSS data have been compared with those of the SAR scatterers closest to the GNSS markers (never coinciding). For each location, the vertical reading was projected in the LOS of the SAR sensor. These readings were compared with the displacement values determined at the locations of permanent scatterers (PSs) within 100 m from the GNSS nodes, by eliminating all scatterers on buildings. The comparison has shown a good agreement.     

AGAPIA v0.1: A Programming Language for Interactive Systems and Its Typing System

A model (consisting of rv-systems), a core programming language (for developing rv-programs), several specification and analysis techniques appropriate for modeling, programming and reasoning about interactive computing systems have been recently introduced by Stefanescu using register machines and space-time duality, see [Stefanescu, G. Interactive systems with registers and voices. Fundamenta Informaticae 73 (2006), 285–306. (Early draft, School of Computing, National University of Singapore, July 2004.)]. After that, Dragoi and Stefanescu have developed structured programming techniques for rv-systems and their verification, see, e.g., [Dragoi, C., and G. Stefanescu. Structured programming for interactive rv-systems. Institute of Mathematics of the Romanian Academy, IMAR Preprint 9/2006, Bucharest 2006. Dragoi, C., and G. Stefanescu. Towards a Hoare-like logic for structured rv-programs. Institute of Mathematics of the Romanian Academy, IMAR Preprint 10/2006, Bucharest, 2006. Dragoi, C., and G. Stefanescu. Implementation and verification of ring termination detection protocols using structured rv-programs. Annals of University of Bucharest, Mathematics-Informatics Series, 55 (2006), 129–138. Dragoi, C., and G. Stefanescu. Structured interactive programs with registers and voices and their verification. Draft, Bucharest, January 2007. Dragoi, C., and G. Stefanescu. On compiling structured interactive programs with registers and voices. In: “Proc. SOFSEM 2008,” 259–270. LNCS 4910, Springer, 2008.].In the present paper a kernel programming language AGAPIA v0.1 for interactive systems is introduced. The language contains definitions for complex spatial and temporal data, arithmetic and boolean expressions, modules, and while-programming statements with their temporal, spatial, and spatio-temporal versions. In AGAPIA v0.1 one can write programs for open processes located at various sites and having their temporal windows of adequate reaction to the environment. The main technical part of the paper describes a typing system for AGAPIA v0.1 programs.     

Tree-systems of morphisms

Starting from the idea of determinism in membrane systems, we introduce a language generating device consisting of morphisms placed in the nodes of a tree. Initial strings are given in the leaves; by iteratively applying the morphisms to them, we produce new strings, which are collected in the root of the tree. Such a device is called a tree-system of morphisms (in short, a T system). We investigate here the power of T systems, both in the extended (a terminal alphabet is considered and only strings over it are accepted) and non-extended case, mainly in comparison with classes of languages in Lindenmayer hierarchy. Received: 8 February 2001 / 18 September 2001     

Languages generated by P systems with active membranes

We propose an alternative approach to generate languages by means of P systems: building up an appropriate representation for a string by means of a corresponding membrane structure and then generating the string by visiting the membrane structure according to a well-specified strategy. To this aim, we consider P systems with active membranes, allowing membrane creation or division or duplication and dissolution, where the output of a computation may be obtained either by visiting the tree associated with the membrane structure, or by following the traces of a specific object, called traveller, or sending out the objects. For each of these approaches, we provide characterizations of recursively enumerable languages based on P systems that use different sets of operations for modifying the membrane structure. Francesco Bernardini: He started his Ph.D. at the University of Sheffield in December 2002 after having previously got a master degree in Computer Science from the University of Pisa in Italy. His research is dedicated to the study of theoretical aspects of membrane computing (P systems) and discrete models of biological systems based on P systems. Marian Gheorghe, Ph.D.: His main research interests are in computational models and their applications to software modelling and testing, formal specifications of agent based systems, software engineering. He was investigating computational power of various generative devices (regular, context-free, fully initial; grammar systems; L-systems and variants). He is currently interested in natural computing (membrane calculus) and biological modelling.     

Acoustic resonant response of smooth or rough 3D small objects

This paper presents a new method in order to appreciate the roughness of elliptical or spherical small bodies by using ultrasound. This thing is possible by knowing about 2-4 acoustic resonance frequencies. The maximum diameter and medium roughness of the bodies are evaluated. Small bodies such as tumors can be detected, when other medical devices like ultrasound or tomography computerized cannot evaluate the surface shape because of limited spatial resolution. The method is intended to be used in oncological medicine for early non-invasive diagnostic for cancer, because tumor tissue has outer surface more or less rough, depending on whether or not it is malignant.     

Malware clustering using suffix trees

Clustering is an important problem in malware research, as the number of malicious samples that appear every day makes manual analysis impractical. Although these samples belong to a limited number of malware families, it is difficult to categorize them automatically as obfuscation is involved. By extracting relevant features we can apply clustering algorithms, then only analyze a couple of representatives from each cluster. However, classic clustering algorithms that compute the similarity between each pair of samples are slow when a large collection is involved. In this paper, the features will be strings of operation codes extracted from the binary code of each sample. With a modified suffix tree data structure we can find long enough substrings that correspond to portions of a program’s code. These substrings must be filtered against a database of known substrings so that common library code will be ignored. The items that have common substrings above a certain threshold will be grouped into the same cluster. Our algorithm was tested with data extracted from real-world malware and constructed quality clusters.