A novel statistical linearization solution for randomly excited coupled bending-torsional beams resting on non-linear supports

A novel statistical linearization technique is developed for computing stationary response statistics of randomly excited coupled bending-torsional beams resting on non-linear elastic supports. The key point of the proposed technique consists in representing the non-linear coupled response in terms of constrained linear modes. The resulting set of non-linear equations governing the modal amplitudes is then replaced by an equivalent linear one via a classical statistical error minimization procedure, which provides algebraic non-linear equations for the second-order statistics of the beam response, readily solved by a simple iterative scheme. Data from Monte Carlo simulations, generated by a pertinent boundary integral method in conjunction with a Newmark numerical integration scheme, are used as benchmark solutions to check accuracy and reliability of the proposed statistical linearization technique.

     

Word problems and ceers

This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same reducibility degree (under the notion of reducibility for equivalence relations usually called “computable reducibility”), or in the same isomorphism type (with the isomorphism induced by a computable function), or in the same strong isomorphism type (with the isomorphism induced by a computable permutation of the natural numbers). We observe, e.g., that every ceer is isomorphic to the word problem of some c.e. semigroup, but (answering a question of Gao and Gerdes) not every ceer is in the same reducibility degree of the word problem of some finitely presented semigroup, nor is it in the same reducibility degree of some non-periodic semigroup. We also show that the ceer provided by provable equivalence of Peano Arithmetic is in the same strong isomorphism type as the word problem of some non-commutative and non-Boolean c.e. ring.     

Effect of Sulfation Route and Subsequent Oxidation on Derivatization Degree and Biocompatibility of Cellulose Sulfates

Sulfated cellulose (CS) represents an interesting biopolymer due to bioactivity comparable to heparin. However, use of CS for making surface coatings or hydrogels requires the presence of reactive groups for covalent reactions. Here, an approach is presented to oxidize cellulose sulfates for subsequent cross‐linking reactions with amino groups to form imine bonds. Cellulose is sulfated by direct sulfation or acetosulfation, followed by a M alaprade oxidation. The CS obtained is characterized by elemental analysis and ¹³C‐NMR spectroscopy. The resulting oxidized cellulose sulfates (oxCS) have different degrees of sulfation ranging from 0.79 to 1.13 and oxidation degrees from 0.18 to 0.34, but also different mass average molecular mass (M_W). Toxicity studies are carried out with mouse 3T3 fibroblasts exposed to aqueous solutions of oxCS. The results show that all oxCS are non‐toxic at lower concentrations (0.5 mg mL^?1), but with both increasing degree of oxidation and concentrations, toxic effects are observed particularly for acetosulfated and lesser for direct sulfated oxCS, which is related to a decrease in the M_W of the products. It is concluded that oxCS obtained by direct sulfation with M_W above 70 kDa may represent a biocompatible material for the applications suggested above.     

The location of median paths on grid graphs

In this paper we consider the location of a path shaped facility on a grid graph. In the literature this problem was extensively studied on particular classes of graphs as trees or series-parallel graphs. We consider here the problem of finding a path which minimizes the sum of the (shortest) distances from it to the other vertices of the grid, where the path is also subject to an additional constraint that takes the form either of the length of the path or of the cardinality. We study the complexity of these problems and we find two polynomial time algorithms for two special cases, with time complexity of O(n) and O(nℓ) respectively, where n is the number of vertices of the grid and ℓ is the cardinality of the path to be located. The literature about locating dimensional facilities distinguishes between the location of extensive facilities in continuous spaces and network facility location. We will show that the problems presented here have a close connection with continuous dimensional facility problems, so that the procedures provided can also be useful for solving some open problems of dimensional facilities location in the continuous case.     

Hermitian matrices and cohomology of Kähler varieties

We give some upper bounds on the dimension of the kernel of the cup product map $H^{1}(X,\mathbb{C}) \otimes H^{1}(X,\mathbb{C}) \to H^{2}(X,\mathbb{C})We give some upper bounds on the dimension of the kernel of the cup product map , where X is a compact K?hler variety without Albanese fibrations.     

Metamaterials and plasmonics: From nanoparticles to nanoantenna arrays,metasurfaces, and metamaterials

The rise of plasmonic metamaterials in recent years has unveiled the possibility of revolutionizing the entire field of optics and photonics, challenging well-established technological limitations and paving the way to innovations at an unprecedented level To capitalize the disruptive potential of this rising field of science and technology, it is important to be able to combine the richness of optical phenomena enabled by nanoplasmonics in order to realize metamaterial components, devices, and systems of increasing complexity. Here, we review a few recent research directions in the field of plasmonic metamaterials, which may foster further advancements in this research area. We will discuss the anomalous scattering features enabled by plasmonic nanoparticles and nanoclusters, and show how they may represent the fundamental building blocks of complex nanophotonic architectures. Building on these concepts, advanced components can be designed and operated, such as optical nanoantennas and nanoantenna arrays, which, in turn, may be at the basis of metasurface devices and complex systems. Following this path, from basic phenomena to advanced functionalities, the field of plasmonic metamaterials offers the promise of an important scientific and technological impact, with applications spanning from medical diagnostics to clean energy and information processing.     

Cortical disinhibition occurs in chronic neuropathic,but not in chronic nociceptive pain

Background  

The aim of this study was to examine the relationship between chronic neuropathic pain after incomplete peripheral nerve lesion, chronic nociceptive pain due to osteoarthritis, and the excitability of the motor cortex assessed by transcranial magnetic stimulation (TMS). Hence in 26 patients with neuropathic pain resulting from an isolated incomplete lesion of the median or ulnar nerve (neuralgia), 20 patients with painful osteoarthritis of the hand, and 14 healthy control subjects, the excitability of the motor cortex was tested using paired-pulse TMS to assess intracortical inhibition and facilitation. These excitability parameters were compared between groups, and the relationship between excitability parameters and clinical parameters was examined.     

On Pythagoras Theorem for Products of Spectral Triples

We discuss a version of Pythagoras theorem in noncommutative geometry. Usual Pythagoras theorem can be formulated in terms of Connes’ distance, between pure states, in the product of commutative spectral triples. We investigate the generalization to both non-pure states and arbitrary spectral triples. We show that Pythagoras theorem is replaced by some Pythagoras inequalities, that we prove for the product of arbitrary (i.e. non-necessarily commutative) spectral triples, assuming only some unitality condition. We show that these inequalities are optimal, and we provide non-unital counter-examples inspired by K-homology.     

Weakly precomplete computably enumerable equivalence relations

Using computable reducibility ? on equivalence relations, we investigate weakly precomplete ceers (a “ceer” is a computably enumerable equivalence relation on the natural numbers), and we compare their class with the more restricted class of precomplete ceers. We show that there are infinitely many isomorphism types of universal (in fact uniformly finitely precomplete) weakly precomplete ceers , that are not precomplete; and there are infinitely many isomorphism types of non‐universal weakly precomplete ceers. Whereas the Visser space of a precomplete ceer always contains an infinite effectively discrete subset, there exist weakly precomplete ceers whose Visser spaces do not contain infinite effectively discrete subsets. As a consequence, contrary to precomplete ceers which always yield partitions into effectively inseparable sets, we show that although weakly precomplete ceers always yield partitions into computably inseparable sets, nevertheless there are weakly precomplete ceers for which no equivalence class is creative. Finally, we show that the index set of the precomplete ceers is Σ₃‐complete, whereas the index set of the weakly precomplete ceers is Π₃‐complete. As a consequence of these results, we also show that the index sets of the uniformly precomplete ceers and of the e‐complete ceers are Σ₃‐complete.