Translating a Large Subset of Stateflow to Hybrid CSP with Code Optimization

Abstract We analyse the flux-induced scalar potential for type IIA orientifolds in the presence of p-form, geometric and non-geometric fluxes. Just like in the Calabi-Yau case, the potential presents a bilinear structure, with a factorised dependence on axions and saxions. This feature allows one to perform a systematic search for vacua, which we implement for the case of geometric backgrounds. Guided by stability criteria, we consider configurations with a particular on-shell F-term pattern, and show that no de Sitter extrema are allowed for them. We classify branches of supersymmetric and non-supersymmetric vacua, and argue that the latter are perturbatively stable for a large subset of them. Our solutions reproduce and generalise previous results in the literature, obtained either from the 4d or 10d viewpoint.

Download Full-text

A formal approach to code optimization

ACM SIGPLAN Notices ◽

10.1145/390013.808486 ◽

1970 ◽

Vol 5 (7) ◽

pp. 86-100 ◽

Cited By ~ 9

Author(s):

Alfred V. Aho ◽

Ravi Sethi ◽

J. D. Ullman

Keyword(s):

Code Optimization ◽

Formal Approach

Download Full-text

Y-Logic: A Framework for Reasoning About Chameleonic Programs with Inconsistent Completions

Fundamenta Informaticae ◽

10.3233/fi-1990-13405 ◽

1990 ◽

Vol 13 (4) ◽

pp. 465-483

Author(s):

V.S. Subrahmanian

Keyword(s):

Classical Logic ◽

Logic Program ◽

Logic Programs ◽

Large Subset ◽

General Logic ◽

Traditional Sense

Large logic programs are normally designed by teams of individuals, each of whom designs a subprogram. While each of these subprograms may have consistent completions, the logic program obtained by taking the union of these subprograms may not. However, the resulting program still serves a useful purpose, for a (possibly) very large subset of it still has a consistent completion. We argue that “small” inconsistencies may cause a logic program to have no models (in the traditional sense), even though it still serves some useful purpose. A semantics is developed in this paper for general logic programs which ascribes a very reasonable meaning to general logic programs irrespective of whether they have consistent (in the classical logic sense) completions.

Download Full-text

Understudied G Protein-Coupled Receptors in the Kidney

Nephron ◽

10.1159/000517355 ◽

2021 ◽

pp. 1-4

Author(s):

Nathan A. Zaidman ◽

Jennifer L. Pluznick

Keyword(s):

Renal Function ◽

Cell Surface ◽

Gene Family ◽

G Protein ◽

External Environment ◽

G Protein Coupled Receptors ◽

Surface Proteins ◽

Cell Surface Proteins ◽

Large Subset ◽

G Protein Coupled

G protein-coupled receptors (GPCRs) are cell surface proteins which play a key role in allowing cells, tissues, and organs to respond to changes in the external environment in order to maintain homeostasis. Despite the fact that GPCRs are known to play key roles in a variety of tissues, there are a large subset of GPCRs that remain poorly studied. In this minireview, we will summarize what is known regarding the “understudied” GPCRs with respect to renal function, and in so doing will highlight the promise represented by studying this gene family.

Download Full-text

A novel technique for interdependent trim code optimization

2016 IEEE 34th VLSI Test Symposium (VTS) ◽

10.1109/vts.2016.7477261 ◽

2016 ◽

Cited By ~ 2

Author(s):

Pankaj Bongale ◽

Vinothkumar Sundaresan ◽

Partha Ghosh ◽

Rubin Parekhji

Keyword(s):

Code Optimization ◽

Novel Technique

Download Full-text

TRANSFORMATION OF NESTED LOOPS WITH MODULO INDEXING TO AFFINE RECURRENCES

Parallel Processing Letters ◽

10.1142/s0129626494000260 ◽

1994 ◽

Vol 04 (03) ◽

pp. 271-280 ◽

Cited By ~ 6

Author(s):

FLORIN BALASA ◽

FRANK H.M. FRANSSEN ◽

FRANCKY V.M. CATTHOOR ◽

HUGO J. DE MAN

Keyword(s):

Code Generation ◽

State Of The Art ◽

Transformation Method ◽

Control Flow ◽

Code Optimization ◽

Transformation Techniques ◽

Hermite Normal Form ◽

Nested Loops ◽

Affine Functions ◽

Systems Transformation

For multi-dimensional (M-D) signal and data processing systems, transformation of algorithmic specifications is a major instrument both in code optimization and code generation for parallelizing compilers and in control flow optimization as a preprocessor for architecture synthesis. State-of-the-art transformation techniques are limited to affine index expressions. This is however not sufficient for many important applications in image, speech and numerical processing. In this paper, a novel transformation method is introduced, oriented to the subclass of algorithm specifications that contains modulo expressions of affine functions to index M-D signals. The method employs extensively the concept of Hermite normal form. The transformation method can be carried out in polynomial time, applying only integer arithmetic.

Download Full-text