An ideal topology type convergent theorem on scale effect algebras

The famous Antosik-Mikusinski convergent theorem on the Abel topological groups has very extensive applications in measure theory, summation theory and other analysis fields. In this paper, we establish the theorem on a class of effect algebras equipped with the ideal topology. This paper shows also that the ideal topology of effect algebras is a useful topology in studying the quantum logic the- ory.     

Equitone Predicate Algebras and Their Applications

Predicates that preserve their values on a larger (extended) body of data are called equitone. An algebra of such predicates is constructed, a system of its generators is specified, and a complete system of transformations of identities is defined. The results obtained are used for construction and investigation of complete classes of compositions of various types and levels of abstractions that are used in logics of partial predicates.     

Congruences and ideals in pseudoeffect algebras

This paper is devoted to congruences and ideals in pseudoeffect algebras. Let I be a normal ideal in a pseudoeffect algebra E. We show that: (1) the relation ~ _I induced by I is a congruence if and only if for every a∈E, I∩ [0,a] is upper directed; (2) the relation ~ _I induced by I is a strong congruence if and only if I is a normal weak Riesz ideal in a pseudoeffect algebra E. Moreover, we introduce a stronger concept of congruence—namely Riesz strong congruence—and we prove that, if I is a normal weak Riesz ideal in a pseudoeffect algebra E, then ~ _I is a Riesz strong congruence and, conversely, if ~ is a Riesz strong congruence, then I = [0]_~ is a normal weak Riesz ideal, and ~ _I = ~. This work was supported by the National Natural Science Foundation of China (Grant No. 10271069).     

What is a free name in a process algebra?

There are two popular approaches to specifying the semantics of process algebras: labelled transition semantics and reaction semantics. While the notion of free name is rather unproblematic for labelled transition semantics this is not so for reaction semantics in the presence of a structural congruence for unfolding recursive declarations.We show that the standard definition of free name is not preserved under the structural congruence. We then develop a fixed point approach to the set of free names and show that it is invariant under the structural congruence.     

Huffman algebras for independent random variables

Based on a rearrangement inequality by Hardy, Littlewood, and Polya, we define two-operator algebras for independent random variables. These algebras are called Huffman algebras since the Huffman algorithm on these algebras produces an optimal binary tree that minimizes the weighted lengths of leaves. Many examples of such algebras are given. For the case with random weights of the leaves, we prove the optimality of the tree constructed by the power-of-2 rule, i.e., the Huffman algorithm assuming identical weights, when the weights of the leaves are independent and identically distributed.     

Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time

This paper extends the algorithms which were developed in Part I to cases in which there is no affine schedule, i.e. to problems whose parallel complexity is polynomial but not linear. The natural generalization is to multidimensional schedules with lexicographic ordering as temporal succession. Multidimensional affine schedules, are, in a sense, equivalent to polynomial schedules, and are much easier to handle automatically. Furthermore, there is a strong connection between multidimensional schedules and loop nests, which allows one to prove that a static control program always has a multidimensional schedule. Roughly, a larger dimension indicates less parallelism. In the algorithm which is presented here, this dimension is computed dynamically, and is just sufficient for scheduling the source program. The algorithm lends itself to a divide and conquer strategy. The paper gives some experimental evidence for the applicability, performances and limitations of the algorithm.     

Dufour's gland and its role in secretion of nest cell lining in bees of the genusColletes (Hymenoptera: Colletidae)

The liquid secretion of the Dufour's gland in mated females comprises a mixture of macrocyclic lactones, straight chain mono- and dicarboxylic acids, together with trace amounts of di- and trihydroxy monocarboxylic acids and a series ofn-alkanes. Polymerization of the liquid to form the membranous nest cell lining, which also contains alanine and glutamic acid as major constituents, may be mediated by an enzyme from the thoracic salivary gland and voided via the mouth. The composition and structure of the cell linings are similar to those of Wigglesworth's cuticulin.     

JSP嵌套SQL Server Reporting Services报表

针对传统物流行业报表的制作、呈现、管理都是由报表业务人员进行操作,不能及时的将报表呈现的数据信息反馈给决策者,导致信息的延误。通过对JSP以及SQL Server Reporting Service（SSRS）的分析介绍,提出把SSRS报表嵌套在JSP中,加入到网络物流系统操作平台。基于SQL Server 2008 R2数据库以及Spring MVC框架,运用Spring注解方式与JSP技术进行系统开发,直接将SSRS报表嵌套在JSP页面供决策者分析。结果表明,JSP页面可以嵌套带有参数要求的SSRS报表,并且可以准确的读取操作SSRS报表,获得满意的嵌套效果。     

Characterization of pedicel,paper, and larval silk from nest ofPolistes annularis (L.)

The pedicel, nest paper, and larval silk ofPolistes annularis nests were analyzed by high-resolution solid-state [¹³C]NMR. The pedicel was found to have a high nitrogen content (11%), and the NMR spectra indicated that it is a mixture of carbohydrate and protein. The pedicel protein has an amino acid composition that is very rich in glycine, alanine, serine, and proline (67% of identified residues), similar to that of some insect silks. Solid-state [¹³C]NMR indicated that the nest paper is composed predominantly of cellulose. Silk, spun by matureP. annularis larvae, was shown by [¹³C] NMR and amino acid analysis to be a protein very high in serine and alanine (53%), but the amino acid composition is distinct from that of the pedicel protein.     

An approach to the parallel solution of a high-dimensional basic flow problem

The body of mathematics of modified systems of algorithmic algebras (SAA-M) is used to formalize the Edmonds–Karp algorithm of finding the maximum flow in a network. With allowance made for the distributed system features that are usually used for solving complicated problems, optimization criteria are formulated and used to obtain parallel SAA-M-schemes. Translated from Kibernetika i Sistemnyi Analiz, No. 2, pp. 146–152, March–April 2009.