Let A be a Banach algebra and X a Banach A-bimodule, the derivation D : A → X is semi-inner if there are ξ, μ ∈ X such that D(a) = a.ξ − μ.a, (a ∈ A). A is called semi-amenable if every derivation D : A → X∗ is semi-inner. The dual Banach algebra A is Connes semi-amenable (resp. approximately semi-amenable) if, every D ∈ Z1w _ (A,X), for each normal, dual Banach A-bimodule X, is semi -inner (re...

In this paper, we present an automated approach to discover patterns that can distinguish between sequences belonging to different labeled groups. Our method searches for approximately conserved motifs that occur with varying statistical properties in positive and negative training examples. We propose a two-step process to discover such patterns. Using locality sensitive hashing (LSH), we firs...

This paper defines the area measure of the quality of approximate convex hulls and proposes two new approximate convex hull algorithms. The first one is superior to known techniques under the area measure and comparable under the distance measure and time complexity. The second algorithm is superior to all known algorithms in both area and distance measures (including the first algorithm) while...

In this paper, we present an automated approach to discover patterns that can distinguish between sequences belonging to different labeled groups. Our method searches for approximately conserved motifs that occur with varying statistical properties in positive and negative training examples. We propose a two-step process to discover such patterns. Using locality sensitive hashing (LSH), we firs...

The paper presents a first level of coarse-grained parallelization in a sequential approximate optimization framework. A sequential approximate optimization framework builds local approximations of the system every iteration by evaluating a set of design points around the current design. In this research the database is generated by distributing the data sampling process among several processor...

In many practical problems, in particular in engineering design, the function form of criteria is not given explicitly in terms of design variables. Given the value of design variables, under this circumstance, the value of objective functions is obtained by real/computational experiments such as structural analysis, fluidmechanic analysis, thermodynamic analysis, and so on. Usually, these expe...

Sequential pattern mining is an important data mining task with broad applications. However, conventional methods may meet inherent difficulties in mining databases with long sequences and noise. They may generate a huge number of short and trivial patterns but fail to find interesting patterns approximately shared by many sequences. To attack these problems, in this paper, we propose the theme...

We investigate generalized amenability and biflatness properties of various (operator) Segal algebras in both the group algebra, L (G), and the Fourier algebra, A(G), of a locally compact group, G. Barry Johnson introduced the important concept of amenability for Banach algebras in [20], where he proved, among many other things, that a group algebra L1(G) is amenable precisely when the locally ...

We show that Tsirelson’s problem concerning the set of quantum correlations and Connes’ embedding problem on finite approximations in von Neumann algebras (known to be equivalent to Kirchberg’s QWEP conjecture) are essentially equivalent. Specifically, Tsirelson’s problem asks whether the set of bipartite quantum correlations generated between tensor product separated systems is the same as the...