Search results for "Programming Languages"
showing 10 items of 138 documents
Lua Code: Security Overview and Practical Approaches to Static Analysis
2017
Lua is an interpreted, cross-platform, embeddable, performant and low-footprint language. Lua's popularity is on the rise in the last couple of years. Simple design and efficient usage of resources combined with its performance make it attractive for production web applications even to big organizations such as Wikipedia, CloudFlare and GitHub. In addition to this, Lua is one of the preferred choices for programming embedded and IoT devices. This context allows to assume a large and growing Lua codebase yet to be assessed. This growing Lua codebase could be potentially driving production servers and extremely large number of devices, some perhaps with mission-critical function for example i…
Black-Box Solvers
2017
Linear programming is perhaps the best-known tool for optimization. Linear programming is a general-purpose framework that allows a real system to be abstracted as a model with a linear objective function subject to a set of linear constraints.
Understanding star-fundamental algebras
2021
Star-fundamental algebras are special finite dimensional algebras with involution ∗ * over an algebraically closed field of characteristic zero defined in terms of multialternating ∗ * -polynomials. We prove that the upper-block matrix algebras with involution introduced in Di Vincenzo and La Scala [J. Algebra 317 (2007), pp. 642–657] are star-fundamental. Moreover, any finite dimensional algebra with involution contains a subalgebra mapping homomorphically onto one of such algebras. We also give a characterization of star-fundamental algebras through the representation theory of the symmetric group.
Clarkson-McCarthy inequalities with unitary and isometry orbits
2020
Abstract A refinement of a trace inequality of McCarthy establishing the uniform convexity of the Schatten p-classes for p > 2 is proved: if A , B are two n-by-n matrices, then there exists some pair of n-by-n unitary matrices U , V such that U | A + B 2 | p U ⁎ + V | A − B 2 | p V ⁎ ≤ | A | p + | B | p 2 . A similar statement holds for compact Hilbert space operators. Another improvement of McCarthy's inequality is given via the new operator parallelogramm law, | A + B | 2 ⊕ | A − B | 2 = U 0 ( | A | 2 + | B | 2 ) U 0 ⁎ + V 0 ( | A | 2 + | B | 2 ) V 0 ⁎ for some pair of 2n-by-n isometry matrices U 0 , V 0 .
TWO-DIMENSIONAL FINITE STATE RECOGNIZABILITY
1996
The purpose of this paper is to investigate about a new notion of finite state recognizability for two-dimensional (picture) languages. This notion takes as starting point the characterization of one-dimensional recognizable languages in terms of local languages and projections. Such notion can be extended in a natural way to the two-dimensional case. We first introduce a notion of local picture language and then we define,a recognizable picture language as a projection of a local picture language. The family of recognizable picture languages is denoted by REC. We study some combinatorial and language-theoretic properties of family REC. In particular we prove some closure properties with re…
Robust three-dimensional best-path phase-unwrapping algorithm that avoids singularity loops.
2009
In this paper we propose a novel hybrid three-dimensional phase-unwrapping algorithm, which we refer to here as the three-dimensional best-path avoiding singularity loops (3DBPASL) algorithm. This algorithm combines the advantages and avoids the drawbacks of two well-known 3D phase-unwrapping algorithms, namely, the 3D phase-unwrapping noise-immune technique and the 3D phase-unwrapping best-path technique. The hybrid technique presented here is more robust than its predecessors since it not only follows a discrete unwrapping path depending on a 3D quality map, but it also avoids any singularity loops that may occur in the unwrapping path. Simulation and experimental results have shown that …
A Hidden Markov Model for Automatic Generation of ER Diagrams from OWL Ontology
2014
Connecting ontological representations and data models is a crucial need in enterprise knowledge management, above all in the case of federated enterprises where corporate ontologies are used to share information coming from different databases. OWL to ERD transformations are a challenging research field in this scenario, due to the loss of expressiveness arising when OWL axioms have to be represented using ERD notation. In this paper we propose an innovative technique for estimating the most likely composition of ERD constructs that correspond to a given sequence of OWL axioms. We model such a process using a Hidden Markov Model (HMM) where the OWL inputs are the observable states, while E…
Ulam Stability for the Composition of Operators
2020
Working in the setting of Banach spaces, we give a simpler proof of a result concerning the Ulam stability of the composition of operators. Several applications are provided. Then, we give an example of a discrete semigroup with Ulam unstable members and an example of Ulam stable operators on a Banach space, such that their sum is not Ulam stable. Another example is concerned with a C 0 -semigroup ( T t ) t &ge
Entanglement correlations, Bell inequalities, and the concurrence
2005
Probabilities of measurement outcomes of two-particle entangled states give a physically transparent interpretation of the concurrence and of the I-concurrence as entanglement measures. The (I)-concurrence can thus be measured experimentally. The tight connection between these measures and Bell inequalities is highlighted.
Clustering with Terracotta
2008
Masteroppgave i informasjons- og kommunikasjonsteknologi 2008 – Universitetet i Agder, Grimstad In today’s java community, modern enterprise application products have more constraints and requirements then ever. High availability, application scalability and also good performance are required, which means an application is needed to be deployed on multiple JVMs, in other words, it has to be clustered or distributed. It is essential for the application to scale out well, has better performance and less complexity during development of clustering. This master thesis focuses on clustering with Terracotta which is a JVM level clustering technique. First I start analyzing the complexity when an …