We continue and complete a Coxeter spectral study (presented in our talk given in SYNASC11, Timisoara, September 2011 [6]) of the root systems in the sense of Bourbaki [4], the mesh geometries Γ(R Δ , Φ A ) of root...
详细信息
We continue and complete a Coxeter spectral study (presented in our talk given in SYNASC11, Timisoara, September 2011 [6]) of the root systems in the sense of Bourbaki [4], the mesh geometries Γ(R Δ , Φ A ) of roots of Δ in the sense of [20], and matrix morsifications A ∈ Mor Δ , for simply-laced Dynkin diagrams Δ ∈ {A n , D n , E 6 , E 7 , E 8 }. One of the main aims of the talk is to present a progress obtained during the last year in solving the problems stated in our talk [6]. We show that the reduced mesh root systems and mesh geometries of roots for each of the Dynkin diagrams Δ can be classified for n ≤ 9 by applying symbolic computer algebra computations and numeric algorithmic computations. We also compute the isotropy group Gl(n, Z) Δ of Δ defined in [22]-[23], determine its structure and compute the Gl(n, Z) Δ -orbits of the morsifications A ∈ Mor Δ , for Δ ∈ {A n , D m }, with n ≤ 9 and 4 ≤ m ≤ 8. Results of our computing experiences are presented in three tables of Section 4.
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all of them when seen as isomorp...
详细信息
We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all of them when seen as isomorphic withthe set of natural numbers. Constructors and deconstructors seen through an initial algebra semantics are generalized to recursively defined functions obeying similar laws. Implementations using GHC's "view" construct are discussed, based on the free algebra of rooted ordered binary trees.
Solving a linear system of equations is a common task performed for most of the scientific experiments. Everyday, these applications increase their demands, pushing the computational capacity to the limits. At a certa...
详细信息
Solving a linear system of equations is a common task performed for most of the scientific experiments. Everyday, these applications increase their demands, pushing the computational capacity to the limits. At a certain point, our systems, running common algorithms, become unable to process such massive amounts of information. the paper analyses and modifies the standard Gaussian reduction so that a huge array may be handled by almost any distributed system. Moreover, the paper focuses on providing a decent level of fault tolerance in order to comply with a real, heterogeneous distributed system and on becoming a solution for sensitive applications.
the accuracy of a classifier relies heavily on the encoding and representation of input data. Many machine learning algorithms require that the input vectors be composed of numeric values on which arithmetic and compa...
详细信息
the first concern when we think about adopting cloud computing is security. Even if, cloud computing seems to be remarkably cheap, the security part might transform the "buzz world" in a terribly expensive t...
详细信息
the first concern when we think about adopting cloud computing is security. Even if, cloud computing seems to be remarkably cheap, the security part might transform the "buzz world" in a terribly expensive technology. the goal of this paper is to present a different perspective of delivering security as a service thru a new defined concept, trust engines. this concept, introduced in this paper, relies on trust management. A trust management system can be achieved in cloud computing by implementing multiple trust models that define what a user can do and what type of protection he has. By identifying the static and dynamic trust models, the cloud provider and the cloud user can have a proper control of the cloud security. A trust model engine could create both static and dynamic rules that will establish a classified profile for all the cloud users.
We start from the set theory axioms and we represent sets by monotone lists (sorted lists without duplications). For this, we define a representation function R and its reverse S and we want to synthesize the implemen...
详细信息
We start from the set theory axioms and we represent sets by monotone lists (sorted lists without duplications). For this, we define a representation function R and its reverse S and we want to synthesize the implementation of the essential corresponding predicates and functions over sets. Each synthesis starts as an inductive constructive proof which applies specific strategies and inference rules. We synthesize (by extracting from proofs) five algorithms among which two predicates: membership and inclusion, and three functions: union, intersection, and difference. In the process of proving we use properties from the theory of sets and we also add other necessary properties in the knowledge base. In this way we explore the theory of sets (represented as monotone lists). the program synthesis and the corresponding theory exploration are carried out in the frame of the theorem a system. One of the major advantages of our approach is that the algorithms for operating on sets represented as monotone lists are more efficient than the ones for operating on sets represented as non-sorted lists.
the Cloud-computing paradigm was considered as a revolution. thanks to the abstraction of computing resources "in the clouds" this paradigm provides "anything" as a service, on a pay-as-you-go basi...
详细信息
the Cloud-computing paradigm was considered as a revolution. thanks to the abstraction of computing resources "in the clouds" this paradigm provides "anything" as a service, on a pay-as-you-go basis. Unfortunately, there is no reference software that one can use to properly compare a cloud approach against others. We propose the SENSAPP platform to tackle this challenge. SENSAPP is designed as a prototypical cloud application and is provided as an open-source service-based application used to store and exploit data collected by the Internet of things. We propose SENSAPP as a reference implementation to compare different cloud approaches. In this paper we present initial experiments about scalability based on this platform.
the dawn of Cloud computing has opened new opportunities for IT-based industries, enabling them to cut costs and extend their businesses to a level which was previously hard to attain. While Cloud adoption is an ongoi...
详细信息
the dawn of Cloud computing has opened new opportunities for IT-based industries, enabling them to cut costs and extend their businesses to a level which was previously hard to attain. While Cloud adoption is an ongoing process, many enterprises are still reluctant to pursue it because its downside outweighs its benefits, especially due to problems related to security and privacy. Coming from Service Oriented Architecture (SOA) Governance, Cloud Governance aims to cover these issues by offering a set of complementary services to the already available Cloud Management ones. this paper covers one of the core aspects of Cloud Governance, its ability to provide service brokering. A semantic approach is proposed where related services and cloud ontologies as well as brokering mechanisms are discussed.
We present a logic-based verification method for imperative loops (including ones with abrupt termination) and the automatic proof of its soundness. the verification method consists in generating verification conditio...
详细信息
We present a logic-based verification method for imperative loops (including ones with abrupt termination) and the automatic proof of its soundness. the verification method consists in generating verification conditions for total correctness of an imperative loop annotated with an invariant. We realized, in the \textit{theorem a} system (\url{***}), the automatic proof of the soundness of verification method: if the verification conditions hold, then the imperative loop is totally correct with respect to its given invariant. the approach is simpler than the others because it is based on functional semantics (no additional theory of program execution is necessary) and produces verification conditions in the object theory of the program. the computer-supported proofs reveal the minimal collection of logical assumptions (some from natural number theory) and logical inferences (including induction) which are necessary for the soundness of the verification technique.
We introduce OF Bench, a new research benchmark for enterprise applications. OF Bench is a load generator for the demo e-commerce component of the Apache OF Biz enterprise resource planning (ERP) framework. ERP applic...
详细信息
We introduce OF Bench, a new research benchmark for enterprise applications. OF Bench is a load generator for the demo e-commerce component of the Apache OF Biz enterprise resource planning (ERP) framework. ERP applications are increasingly important in the cloud market due to the growing popularity of Software-as-a-Service (SaaS) solutions, hence OF Bench is useful to explore the resource consumption patterns arising in these applications. On client-side, OF Bench features randomized customer surfing patterns, workload generation based on automation of real web browsers, reproducible burstiness in inter-request and inter-session think times, non-stationary workload generation. On server-side, it features JMX performance monitoring, business logic instrumentation, and synchronization with client-side monitoring via TCP sockets. We illustrate the execution of the benchmark in example runs and use them to investigate the overheads of JMX-based monitoring.
暂无评论