Complete characterization of epitaxial systems from the lattice geometrical point of view

1993 ◽  
Vol 128 (1-4) ◽  
pp. 122-126
Author(s):  
P. Möck
Minerals ◽  
2019 ◽  
Vol 9 (5) ◽  
pp. 268 ◽  
Author(s):  
Luciana Randazzo ◽  
Michela Ricca ◽  
Silvestro Ruffolo ◽  
Marco Aquino ◽  
Barbara Davidde Petriaggi ◽  
...  

This paper aims to carry out an archaeometric characterization of mortar samples taken from an underwater environment. The fishpond of the archaeological site of Castrum Novum (Santa Marinella, Rome, Italy) was chosen as a pilot site for experimentation. The masonry structures reached the maximum thickness at the apex of the fishpond (4.70 m) and consisted of a concrete conglomerate composed of slightly rough stones of medium size bound with non-hydraulic mortar. After sampling, for a complete characterization of selected mortar fragments, different and complementary techniques (stereomicroscopy, polarizing optical microscopy, and X-ray powder diffraction analysis) were carried out in order to: a) define the minero-petrographic features; and b) investigate their state of conservation. The obtained data allowed the determination of the main constituents of mortars from a compositional point of view. The raw materials, in fact, were quite homogeneous, as well as the ratio in which they were mixed, confirming the typical "recipe" used in Roman times to manufacture hydraulic-type mortars by adding pozzolana. At the same time, it was possible to identify the various degradation processes we were interested in, namely, biological colonization (bio-fouling) that develops differently according to environmental conditions. Based on characterization phase results, the research will help to develop adequate techniques for intervention (innovative tools and methods for the protection of underwater cultural heritage) with particular regard to cleaning and consolidating procedures to be carried out directly in situ.


2014 ◽  
Vol 79 (01) ◽  
pp. 89-102 ◽  
Author(s):  
LORENZO CARLUCCI ◽  
KONRAD ZDANOWSKI

Abstract We characterize the effective content and the proof-theoretic strength of a Ramsey-type theorem for bi-colorings of so-called exactly large sets. An exactly large set is a set $X \subset {\bf{N}}$ such that ${\rm{card}}\left( X \right) = {\rm{min}}\left( X \right) + 1$ . The theorem we analyze is as follows. For every infinite subset M of N, for every coloring C of the exactly large subsets of M in two colors, there exists and infinite subset L of M such that C is constant on all exactly large subsets of L. This theorem is essentially due to Pudlák and Rödl and independently to Farmaki. We prove that—over RCA0 —this theorem is equivalent to closure under the ωth Turing jump (i.e., under arithmetical truth). Natural combinatorial theorems at this level of complexity are rare. In terms of Reverse Mathematics we give the first Ramsey-theoretic characterization of ${\rm{ACA}}_0^ +$ . Our results give a complete characterization of the theorem from the point of view of Computability Theory and of the Proof Theory of Arithmetic. This nicely extends the current knowledge about the strength of Ramsey’s Theorem. We also show that analogous results hold for a related principle based on the Regressive Ramsey’s Theorem. We conjecture that analogous results hold for larger ordinals.


1982 ◽  
Vol 10 (1) ◽  
pp. 37-54 ◽  
Author(s):  
M. Kumar ◽  
C. W. Bert

Abstract Unidirectional cord-rubber specimens in the form of tensile coupons and sandwich beams were used. Using specimens with the cords oriented at 0°, 45°, and 90° to the loading direction and appropriate data reduction, we were able to obtain complete characterization for the in-plane stress-strain response of single-ply, unidirectional cord-rubber composites. All strains were measured by means of liquid mercury strain gages, for which the nonlinear strain response characteristic was obtained by calibration. Stress-strain data were obtained for the cases of both cord tension and cord compression. Materials investigated were aramid-rubber, polyester-rubber, and steel-rubber.


2020 ◽  
Vol 4 (2) ◽  
pp. 118-129
Author(s):  
Asti Gumartifa ◽  
◽  
Indah Windra Dwie Agustiani

Gaining English language learning effectively has been discussed all years long. Similarly, Learners have various troubles outcomes in the learning process. Creating a joyful and comfortable situation must be considered by learners. Thus, the implementation of effective learning strategies is certainly necessary for English learners. This descriptive study has two purposes: first, to introduce the classification and characterization of learning strategies such as; memory, cognitive, metacognitive, compensation, social, and affective strategies that are used by learners in the classroom and second, it provides some questionnaires item based on Strategy of Inventory for Language Learning (SILL) version 5.0 that can be used to examine the frequency of students’ learning strategies in the learning process. The summary of this study explains and discusses the researchers’ point of view on the impact of learning outcomes by learning strategies used. Finally, utilizing appropriate learning strategies are certainly beneficial for both teachers and learners to achieve the learning target effectively.


Author(s):  
G. Meneghesso ◽  
E. Zanoni ◽  
P. Colombo ◽  
M. Brambilla ◽  
R. Annunziata ◽  
...  

Abstract In this work, we present new results concerning electrostatic discharge (ESD) robustness of 0.6 μm CMOS structures. Devices have been tested according to both HBM and socketed CDM (sCDM) ESD test procedures. Test structures have been submitted to a complete characterization consisting in: 1) measurement of the tum-on time of the protection structures submitted to pulses with very fast rise times; 2) ESD stress test with the HBM and sCDM models; 3) failure analysis based on emission microscopy (EMMI) and Scanning Electron Microscopy (SEM).


Keyword(s):  

The article discusses a sequence of activities to identify a crime as jointly committed. The requirements to the algorithm of such activities are formulated. Programme-based and targeted methods applied by the authors allowed detecting a range of stages of the algorithm. The first four stages aim at defining mandatory elements of a crime allowing to characterize it as a jointly committed action. The rest of the stages focus on identifying a type of criminal complicity. In the article, each stage is described. It is emphasized that in each stage there is a special objective. At the same time, all these stages, taken together, constitute a separate module of the program of criminal characterization of an action. From the authors’ point of view, algorithms are necessary not only for detection of crimes and their criminal characterization, but also for answering the question on existence of criminal complicity in each case. Also the authors give their opinions on interpretation of criminal complicity as a legal category. In particular, it is emphasized that not all of crimes merely committed with participation of two or more persons should be understood as jointly committed. It is joint participation that makes a crime jointly committed. Various forms of criminal complicity and types of co-offenders are considered in the article as well. In various crimes, criminal complicity manifests itself differently. Therefore the proposed algorithm can be applied only after identification a specific article of the Russian Criminal Code stipulating the responsibility for the crime committed.


2019 ◽  
Vol 125 (1) ◽  
pp. 10008 ◽  
Author(s):  
Bat-el Friedman ◽  
Atanu Rajak ◽  
Emanuele G. Dalla Torre

2019 ◽  
Vol 53 (5) ◽  
pp. 1763-1773
Author(s):  
Meziane Aider ◽  
Lamia Aoudia ◽  
Mourad Baïou ◽  
A. Ridha Mahjoub ◽  
Viet Hung Nguyen

Let G = (V, E) be an undirected graph where the edges in E have non-negative weights. A star in G is either a single node of G or a subgraph of G where all the edges share one common end-node. A star forest is a collection of vertex-disjoint stars in G. The weight of a star forest is the sum of the weights of its edges. This paper deals with the problem of finding a Maximum Weight Spanning Star Forest (MWSFP) in G. This problem is NP-hard but can be solved in polynomial time when G is a cactus [Nguyen, Discrete Math. Algorithms App. 7 (2015) 1550018]. In this paper, we present a polyhedral investigation of the MWSFP. More precisely, we study the facial structure of the star forest polytope, denoted by SFP(G), which is the convex hull of the incidence vectors of the star forests of G. First, we prove several basic properties of SFP(G) and propose an integer programming formulation for MWSFP. Then, we give a class of facet-defining inequalities, called M-tree inequalities, for SFP(G). We show that for the case when G is a tree, the M-tree and the nonnegativity inequalities give a complete characterization of SFP(G). Finally, based on the description of the dominating set polytope on cycles given by Bouchakour et al. [Eur. J. Combin. 29 (2008) 652–661], we give a complete linear description of SFP(G) when G is a cycle.


Sign in / Sign up

Export Citation Format

Share Document