Narrow Results

This paper provides an explicit closed form of generalized Jacobi–Koornwinder’s polynomials of degree $r\le n$ in terms of the Bernstein basis of fixed degree $n.$ Moreover, explicit forms of generalized Jacobi–Koornwinder’s type and Bernstein polynomials bases transformations are considered.

This paper describes the transformation of (almost arbitrary) sequential functions on covers to parallel, collective operations (skeletons). This allows the direct re-use of existing, but sequential, code on parallel machines without the necessity to hand-code the desired parallel operations. A necessary pre-requisite for this skeleton lifting is the availability of a cover which holds the mapping information of the local subobjects, including their topology information. The lifting transformation distinguishes sequential values, which are available on each processor, from parallel values, which are only stored once. Accesses to parallel values are either ignored locally if they will be computed on another processor, or they induce communication messages to transfer the necessary data, depending on the behavior of the original function.

This paper presents the main concepts of the mathematical theory PEI for parallel programming and emphasizes its derivation power. The mathematical basis of this theory leads to a nice implementation in CENTAUR⁷ of an environment whose purpose is to transform parallel programs. It is illustrated by two similar examples: the convolution sum and the Dirichlet product. The second one uses non-affine dependencies that can be easily taken into account using PEI.

In this paper, a discrete-time risk model is considered. We assume that the premium received in each time interval is a positive real-valued random variable, and the sequence of premiums is a Markov chain. In any time interval the probability of a claim occurrence is related to the premium received in the corresponding period. We discuss control strategies for dividends paid periodically to the shareholders under two cases: absence and presence of ceiling restriction for dividend rates. We provide algorithms and some properties for the optimal control strategies by transforming the value function.

Microstructure evolution and texture formation in low carbon CSP steel were observed by means of metallgraphic, TEM, and SEM equipped with electron back scattered diffraction (EBSD) system. The influence of large particles and fine carbonitrides precipitates on recrystallization and texture formation during the annealing procedure was analyzed with Small Angle X-ray Scattering (SAXS) technique in the steel. It was found that the fine precipitates present in the steel have shown ability to stimulate recrystallization nucleation and transformation during deformation, but hard to accelerate recrystallization growth because of grain boundary pinning effects in the steel. Compared with the conventional low carbon steel, the recrystallization texture and microstructure of the CSP steel show distinct character, and thus modify the mechanical behaviour of the final products.

We investigate the problem of teleportation of tripartite entangled coherent state (ECS) using linear optical devices such as beam splitters, phase shifters, and two-mode number measurements. The scheme is based on the maximally four-partite ECS with bipartite maximal entanglement as the quantum channel to teleportation tripartite ECS. Our scheme is efficient in the sense that for mean number of photons equal to 2, the minimum of average fidelity (MAF) for teleportation an arbitrary tripartite entangled state is 1-2.3 × 10^-7. We also generalize the tripartite scheme into multipartite case and calculate the MAF for the schemes in multipartite cases.

Analysis of distributed energy systems (DESs) is more challenging, as multiple energy sources are connected with different loads through power electronics converters. Modeling and simulation become an essential step during the design stage, prior to actual implementation. These DESs comprised numerous converters in various configurations, e.g., parallel and cascade. This paper presents behavioral modeling technique for interconnected converters that can be used to predict dynamics of overall system. First models are developed for two converters in parallel and cascade configuration using direct approach (DA). The model derivation using DA becomes too complex for larger systems. A new transformation-based approach (TBA) is proposed, which, unlike DA, is simple and can easily be extended to model $N$ interconnected converters. In this method, the measured $g$-parameter set is transformed to another domain, equivalent model is computed simply by the addition or multiplication of transformed $g$-parameters and then the equivalent model is transformed back to $g$-parameter set. The modeling techniques are implemented in Matlab/Simulink. The results from DA and TBA are compared, and their close agreement suggests that the new TBA can be used for the analysis of interconnected systems, comprised of multiple parallel and cascade converters.

This paper proposes a transformation-based method to automatically generate functional test cases from use cases named USLTG (Use case Specification Language (USL)-based Test Generation). We first focus on developing a modeling language named Test Case Specification Language (TCSL) in order to express test cases. Test cases in TCSL can contain detailed information including test steps, test objects within steps, actions of test objects, and test data. Such information is often ignored in currently available test case specifications. We then aim to generate test cases in a TCSL model by a transformation from use cases that are represented by a USL. The USLTG transformation includes three main steps in generating (1) scenarios, (2) test data, and (3) a TCSL model. Within our transformation, the OCL solver is employed in order to build system snapshots as the part of test cases and to identify other test data. We applied our method to two case studies and evaluated our method by comparing it with other recent works.

The "if–then–else" construction is one of the most elementary programming commands, and its abstract laws have been widely studied, starting with McCarthy. Possibly, the most obvious extension of this is to include the operation of composition of programs, which gives a semigroup of functions (total, partial, or possibly general binary relations) that can be recombined using if–then–else. We show that this particular extension admits no finite complete axiomatization and instead focus on the case where composition of functions with predicates is also allowed (and we argue there is good reason to take this approach). In the case of total functions — modeling halting programs — we give a complete axiomatization for the theory in terms of a finite system of equations. We obtain a similar result when an operation of equality test and/or fixed point test is included.

The safety evaluations of structures are usually performed by assuming uncertain 18 input parameters either as probabilistic or possibilistic in nature. Safety evaluations of structural systems characterized by some of the input parameters as possibilistic and others that are sufficient enough to model as probabilistic are unsuitable and restricted to gross assumption at early stages of modeling. The present paper deals with the safety analysis of such a hybrid uncertain system. Relying on the fundamental concept of entropy-based transformation; the feasibility of reliability analysis of a hybrid uncertain system in a possibilistic format is demonstrated in the present study. This will enable the designers to model the structural parameter uncertainty probabilistically as well possibilistically depending on the nature and quality of the input data. The bounds on the probability of failure based on the evidence theory are also computed to study the consistency of the possibility of failure results obtained by the transformation-based algorithm. A numerical example illustrates the capability of the proposed possibilistic approach of safety evaluation of hybrid uncertain system.

The amount of information available to us via the Web has increased enormously over the last few years. Even more, it seems that we are more and more dependent on this Web information in our day to day lives. Often we retrieve this information by querying the Web: data resources found on the web may provide the information that we are looking for. This implies that the Web may be seen as an information market: authors supply information and searchers may find it. In this article we present a formal reference model for the syntactic aspects of the information market. We explore the information landscape using a modeling approach. An important part of this model is a (syntactic) framework for transformations, which allows us to deal with the heterogeneity of the data resources found on the Web. Last but not least, we attempt to give an outline how our model may lead to a better understanding of how information is supplied via the Web. For this we use an example from the field of information retrieval.

When an application must evolve to cope with new context and user requirements, integrating new functionalities into its software architecture is necessary. The architect has thus to manually modify the architecture description, which is often tedious and error prone.

In this paper, we propose FIESTA, a generic framework for automatically integrating new functionalities into an architecture description. Our approach is inspired by TranSAT, an integration framework. However, TranSAT is dedicated to a specific architecture description language (ADL) while our approach is ADL-independent. We have performed a domain analysis, studying for many ADLs how to integrate new functionalities. Based on this analysis, we have defined a generic ADL model to manipulate and reason about architectural elements that are involved in integration. Furthermore, we have developed a generic integration engine.

Singapore-Based Asian American Medical Group and Rich Tree Holdings Break Ground on Zhuhai-Singapore Life Science Park; Advanced Diagnostic and Wellness Medical Centre Will Bring World-Class Services to Southern China in 2018.

ASLAN Pharmaceuticals Opens China Office.

China to Improve Basic Science Research.

Chinese Scientists Edit Genes to Resist HIV in Embryos.

Scientists Find How Red Wine Compound Protects Heart.

Alliance for Stem Cell Technologies Established in Guangzhou.

China and Germany Keen to Deepen R&D Cooperation.

Study Unveils Novel Crosstalk Mechanism between Mitochondrial Translation and Cytoplasmic Translation.

China's Seed Haven Protects Endangered Plants.

Scientists Find that miR-155 Suppresses ErbB2-induced Malignant Transformation.

Nectar and Scent Secretion Patterns Reflect Floral Color Change Rhythm in Quisqualis indica.

China’s Healthcare Reforms: Who Will Survive?

Neovia Enrolls First Patient in Cancer Trial for Immunotherapy Enhancing Drug.

$5M Foundation Gift to Help Support US-China Energy Center at Berkeley Lab.

Scientists Make Breakthrough in 21st Century Killers Research.

Chinese Scientist Participates in Human Gene Editing Committee.

Monkeys Master a Key Sign of Self-awareness: Recognizing Their Reflections.

Poisonous Gas May Have Driven Prehistoric Mass Extinction.

Chinese Scientists in Rice Breakthrough.

This paper describes a new approach to English to Bangla translation. The English to Bangla Translator was developed. This system (BANGANUBAD) takes a paragraph of English sentences as input sentences and produces equivalent Bangla sentences. The BANGANUBAD system comprises a preprocessor, morphological recursive parser, semantic parser using English word ontology for context disambiguation, an electronic lexicon associated with grammatical information and a discourse processor. It also employs a lexical disambiguation analyzer. This system does not rely on a stochastic approach. Rather, it is based on a special kind of amalgamated architecture of transformer and rule-based NLE architectures along with various linguistic knowledge components.

Let ${{𝒪}}_n$ be the semigroup of all singular order-preserving mappings on the finite set $X_n=\{1,2,\dots ,n\}$. It is known that ${{𝒪}}_n$ is generated by its set of idempotents of rank $n-1$, and its rank and idempotent rank are $n$ and $2n-2$, respectively. In this paper, we study the structure of the semigroup generated by any nonempty subset of idempotents of rank $n-1$ in ${{𝒪}}_n$. We also calculate its rank and idempotent rank.

Let ${{𝒫}}_n$ and ${{𝒮}{𝒫}}_n$ be the partial transformation and the strictly partial transformation semigroups on the finite set $X_n=\{1,2,\dots ,n\}$. It is well known that the ranks of the semigroups ${𝒫}(n,r)=\{\alpha \in {{𝒫}}_n:|\mathrm{im}(\alpha )|\le r\}$ and ${𝒮}{𝒫}(n,r)=\{\alpha \in {{𝒮}{𝒫}}_n:|\mathrm{im}(\alpha )|\le r\}$ are $S(n+1,r+1)$, for $2\le r\le n-1$, and $(r+1)S(n,r+1)$, for $2\le r\le n-2$, respectively. The idempotent rank, defined as the smallest number of idempotents generating set, of the semigroup ${𝒫}(n,r)$ has the same value as the rank. Idempotent can be seen as a special case (with $p=q=1$) of $(p,q)$-potent. In this paper, we determine the $(p,q)$-potent ranks, defined as the smallest number of $(p,q)$-potents generating set, of the semigroups ${𝒫}(n,r)$, for $2\le r\le n-1$, and ${𝒮}{𝒫}(n,r)$, for $2\le r\le n-2$.

For $n\in \mathbb{N}$, let ${𝒮}in{g}_n$ be the semigroup of all singular mappings on $X_n=\{1,2,\dots ,n\}$. For each nonempty subset $A$ of $X_n$, let ${{𝒮}}_n(A)=\{\alpha \in {𝒮}in{g}_n:(\forall k\in A)x\le k\Rightarrow x\alpha \le k\}$ be the semigroup of all $A$-decreasing mappings on $X_n$. In this paper we determine the rank and idempotent rank of the semigroup ${{𝒮}}_n(A)$.

The purpose of this paper is the study of congruences on semigroups of transformations on a countably infinite fence. We consider the monoid $O_{\mathbb{N}}$ of all full transformations on the set $\mathbb{N}$ of all natural numbers preserving the zig-zag order on $\mathbb{N}$, as well as the monoid $E(O_{\mathbb{N}}^{\ast })$ of all idempotent transformations in $O_{\mathbb{N}}$ additionally preserving the usual linear order on $\mathbb{N}.$ We show that there are uncountably many congruences on $O_{\mathbb{N}}$ and determine seven maximal congruences on $O_{\mathbb{N}},$ which are all the maximal congruences containing a particular congruence on $O_{\mathbb{N}}.$ Moreover, we characterize all congruences on the monoid of all transformations in $E(O_{\mathbb{N}}^{\ast })$ with infinite rank. For the semigroup of all transformations in $E(O_{\mathbb{N}}^{\ast })$ with finite rank, we determine the Rees congruences.

During challenging market conditions, enterprises have to find ways to develop and train their workforce in a manner that enhances the innovative capabilities of the enterprise. Additionally, if companies are to stay competitive, they have to ensure critical skills in their workforce are transferred from generation to generation. This study builds on recent research on system-thinking development and experiential learning methodologies. First, a conceptual model was created in order to capture a methodology to construct a system-thinking apprenticeship program for system engineers. Then, a survey of system engineering professionals was conducted in order to assess the proposed model; the findings of the model are presented and the implications of the study are discussed.