Search results for "Crete"
showing 10 items of 2495 documents
Durability assessment of basalt fiber polymer as reinforcement to expanded clay concrete in harsh environment
2021
Basalt fiber-reinforced polymer composites are receiving considerable attention as they represent a low-cost green source of raw materials. In most cases, fiber-reinforced polymer composites face harsh environments, such as chloride ions in coastal marine environments or cold regions with salt deicing. The resistance of fiber-reinforced polymers subjected to the above environments is critical for the safe design and application of such composites. This research aims to develop a framework to investigate the durability properties of the lightweight expanded clay basalt fiber polymer reinforced concrete exposed to the NaCl environment. The specified quantity of concrete structural elements wa…
Stiffness and strength of composite truss beam to R.C. column connection in MRFs
2015
Abstract The results of experimental and numerical investigations on the cyclic behavior of composite truss beam to reinforced concrete column connection of moment resisting frames are reported. The beams are constituted by a steel truss and end zone added rebar embedded within a concrete block cast in place, so that, after curing, the steel truss and the added rebar work together with the concrete matrix as reinforcement of the composite beam. Particularly, three specimens of two-span continuous beams were tested under monotonic and cyclic actions as three point bending test. With the goal to investigate about the behavior of the end zone of the beam integrated into a moment resisting fram…
Performance of Steel Fibrous Reinforced Concrete Corbels Subjected to Vertical and Horizontal Loads
2009
A softened strut-and-tie macromodel able to reproduce the flexural behavior of corbels in plain and fibrous concrete and with the presence of steel bars, including softening of compressed struts and yielding of main and secondary steel bars, is presented in this paper. The main focus of the proposed model is the determination of the load-deflection curves of corbels subjected to the coupled effects of vertical and horizontal forces bearing in mind the influence of the type of concrete (normal or high strength), of the fiber percentage and of the arrangement and percentage of the main and secondary (horizontal stirrup) steel bars. A validation of the proposed model is made therefore with ref…
Chiral/Achiral Copolymers of Biphenylylacetylenes Bearing Various Substituents: Chiral Amplification through Copolymerization, Followed by Enhancemen…
2020
A series of dynamic helical homo- and copolymers of chiral and/or achiral biphenylylacetylenes (PBPAs) bearing achiral methoxymethoxy or acetyloxy groups at the 2,2′-positions along with a chiral o...
Fast Algorithms for Pseudoarboricity
2015
The densest subgraph problem, which asks for a subgraph with the maximum edges-to-vertices ratio d∗, is solvable in polynomial time. We discuss algorithms for this problem and the computation of a graph orientation with the lowest maximum indegree, which is equal to ⌈d∗⌉. This value also equals the pseudoarboricity of the graph. We show that it can be computed in O(|E| √ log log d∗) time, and that better estimates can be given for graph classes where d∗ satisfies certain asymptotic bounds. These runtimes are achieved by accelerating a binary search with an approximation scheme, and a runtime analysis of Dinitz’s algorithm on flow networks where all arcs, except the source and sink arcs, hav…
Protein-protein interaction network querying by a "focus and zoom" approach
2008
We propose an approach to network querying in protein-protein interaction networks based on bipartite graph weighted matching. An algorithm is presented that first “focuses” the potentially relevant portion of the target graph by performing a global alignment of this one with the query graph, and then “zooms” on the actual matching nodes by considering their topological arrangement, hereby obtaining a (possibly) approximated occurrence of the query graph within the target graph. Approximation is related to node insertions, node deletions and edge deletions possibly intervening in the query graph. The technique manages networks of arbitrary topology. Moreover, edge labels are used to represe…
Novel Iris Biometric Watermarking Based on Singular Value Decomposition and Discrete Cosine Transform
2014
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2014/926170 A novel iris biometric watermarking scheme is proposed focusing on iris recognition instead of the traditional watermark for increasing the security of the digital products. The preprocess of iris image is to be done firstly, which generates the iris biometric template from person's eye images. And then the templates are to be on discrete cosine transform; the value of the discrete cosine is encoded to BCH error control coding. The host image is divided into four areas equally correspondingly. The BCH codes are embedded in the sing…
On the lattice of prefix codes
2002
AbstractThe natural correspondence between prefix codes and trees is explored, generalizing the results obtained in Giammarresi et al. (Theoret. Comput. Sci. 205 (1998) 1459) for the lattice of finite trees under division and the lattice of finite maximal prefix codes. Joins and meets of prefix codes are studied in this light in connection with such concepts as finiteness, maximality and varieties of rational languages. Decidability results are obtained for several problems involving rational prefix codes, including the solution to the primeness problem.
On the decomposition of prefix codes
2017
Abstract In this paper we focus on the decomposition of rational and maximal prefix codes. We present an effective procedure that allows us to decide whether such a code is decomposable. In this case, the procedure also produces the factors of some of its decompositions. We also give partial results on the problem of deciding whether a rational maximal prefix code decomposes over a finite prefix code.
The mechanically-based approach to 3D non-local linear elasticity theory: Long-range central interactions
2010
Abstract This paper presents the generalization to a three-dimensional (3D) case of a mechanically-based approach to non-local elasticity theory, recently proposed by the authors in a one-dimensional (1D) case. The proposed model assumes that the equilibrium of a volume element is attained by contact forces between adjacent elements and by long-range forces exerted by non-adjacent elements. Specifically, the long-range forces are modelled as central body forces depending on the relative displacement between the centroids of the volume elements, measured along the line connecting the centroids. Further, the long-range forces are assumed to be proportional to a proper, material-dependent, dis…