Context-free grammars for triangular arrays

We consider context-free grammars of the form G = {f → fb1+b2+1ga1+a2, g → fb1 ga1+1},where ai and bi are integers sub ject to certain positivity conditions. Such a grammar G gives rise to triangular arrays {T(n, k)}0≤k≤n satisfying a three-term recurrence relation. Many combinatorial sequences can be generated in this way. Let Tn (x) =∑nk=0T(n, k)xk. Based on the differential operator with respect to G, we define a sequence of linear operators Pn such that Tn+1(x) = Pn(Tn(x)). Applying the characterization of real stability preserving linear operators on the multivariate polynomials due to Borcea and Br?ndén, we obtain a necessary and sufficient condition for the operator Pn to be real stability preserving for any n. As a consequence, we are led to a sufficient condition for the real-rootedness of the polynomials defined by certain triangular arrays, obtained by Wang and Yeh.Moreover, as special cases we obtain grammars that lead to identities involving the Whitney numbers and the Bessel numbers.     

基于故事情景链语法的偶动画短片分析与建模

偶动画是动画领域一个重要的分支,与传统手绘动画同步出现,甚至更早。偶动画作品以其独特的拍摄方法和艺术魅力,为众多艺术家和观众所喜爱。偶动画影片设计周期长、工作量大、生产过程复杂、经济风险高,用传统手工工艺制作完成一部5 min的定格动画影片,通常需要数年。本文以丹麦知名动画导演克里多夫·皮拉丹的《柏树山上的风》及德国格里高利·祖坎导演的《龙焰火枪》为例,提出以故事情节(storyline(i)),?i∈1,2,…,n?与情景链（scenario?chain）语法有限集的形式语言表达式分解偶动画电影的故事元素,通过叙事空间（narrative?space）中镜头画面的组接逻辑,形成不同叙事结构,以分析定格动画电影的故事寓意（implied?meaning）,从故事计算的角度将其转化为标准化设计流程,为构建偶动画电影故事建模理论以及辅助智能计算提供思路,方法提高了偶动画电影的设计与制作效率,为多学科协同创作提供了新模式,使普通偶动画爱好者也能参与创作。     

Code2vect: An efficient heterogenous data classifier and nonlinear regression technique

The aim of this paper is to present a new classification and regression algorithm based on Artificial Intelligence. The main feature of this algorithm, which will be called Code2Vect, is the nature of the data to treat: qualitative or quantitative and continuous or discrete. Contrary to other artificial intelligence techniques based on the “Big-Data,” this new approach will enable working with a reduced amount of data, within the so-called “Smart Data” paradigm. Moreover, the main purpose of this algorithm is to enable the representation of high-dimensional data and more specifically grouping and visualizing this data according to a given target. For that purpose, the data will be projected into a vectorial space equipped with an appropriate metric, able to group data according to their affinity (with respect to a given output of interest). Furthermore, another application of this algorithm lies on its prediction capability. As it occurs with most common data-mining techniques such as regression trees, by giving an input the output will be inferred, in this case considering the nature of the data formerly described. In order to illustrate its potentialities, two different applications will be addressed, one concerning the representation of high-dimensional and categorical data and another featuring the prediction capabilities of the algorithm.     

肉牛饲料添加剂中铅含量的测定

利用火焰原子吸收光谱法(FAAS),测定了硫酸铜、硫酸锌、膨润土、米糠、氧化锌、菜渣、盐等7种肉牛饲料添加剂中铅(Pb)元素的含量.各添加剂的加标回收率在98%-108%之间,相对标准偏差(RSD)小于1.3%,具有良好的准确度和精确度.结果表明,试验中所测的硫酸铜、硫酸锌、氧化锌添加剂中铅含量严重超出国家标准.     

最大乘积型Fuzzy文法与自动机

本文对提出的最大乘积型Ｆｕｚｚｙ文法与最大乘积型Ｆｕｚｚｙ自动机的关系作了详细讨论，得出了两个重要的结论。即：由给定的最大乘积型Ｆｕｚｚｙ正规文法可构造一个最大乘积型Ｆｕｚｚｙ自动机使得二者接受的语言集相同，反之亦然。从而达到自动识别语言的目的。     

Non-associative Lambek Categorial Grammar in Polynomial Time

We present a new axiomatization of the non-associative Lambek calculus. We prove that it takes polynomial time to reduce any non-associative Lambek categorial grammar to an equivalent context-free grammar. Since it is possible to recognize a sentence generated by a context-free grammar in polynomial time, this proves that a sentence generated by any non-associative Lambek categorial grammar can be recognized in polynomial time.     

Powerset Residuated Algebras and Generalized Lambek Calculus

We prove a representation theorem for (abstract) residuated algebras: each residuated algebra is isomorphically embeddable into a powerset residuated algebra. As a consequence, we obtain a completeness theorem for the Generalized Lambek Calculus. We use a Labelled Deductive System which generalizes the one used by Buszkowski [4] and Pankrat'ev [17] in completeness theorems for the Lambek Calculus.     

On Commutative and Nonassociative Syntactic Calculi and Categorial Grammars

Two axiomatizations of the nonassociative and commutative Lambek syntactic calculus are given and their equivalence is proved. The first axiomatization employs Permutation as the only structural rule, the second one, with no Permutation rule, employs only unidirectional types. It is also shown that in the case of the Ajdukiewicz calculus an analogous equivalence is valid only in the case of a restricted set of formulas. Unidirectional axiomatizations are employed in order to establish the generative power of categorial grammars based on the nonassociative and commutative Lambek calculus with product. Those grammars produce CF-languages of finite degree generated by CF-grammars closed with respect to permutations.     

Categorical data clustering with automatic selection of cluster number

In this paper, we investigate the problem of determining the number of clusters in the k-modes based categorical data clustering process. We propose a new categorical data clustering algorithm with automatic selection of k. The new algorithm extends the k-modes clustering algorithm by introducing a penalty term to the objective function to make more clusters compete for objects. In the new objective function, we employ a regularization parameter to control the number of clusters in a clustering process. Instead of finding k directly, we choose a suitable value of regularization parameter such that the corresponding clustering result is the most stable one among all the generated clustering results. Experimental results on synthetic data sets and the real data sets are used to demonstrate the effectiveness of the proposed algorithm.