A complex fuzzy set (CFS) is described by a complex-valued truth membership function, which combination of standard true function plus phase term. In this paper, we extend the idea graph (FG) to (CFG). The CFS complexity arises from variety values that its can attain. contrast range expanded plane’s unit circle rather than [0,1]. As result, provides mathematical structure for representing in te...

One of the big challenges in program obfuscation consists in modifying not only the program’s straight-line code (SLC) but also the program’s control flow graph (CFG). Indeed, if only SLC is modified, the program’s CFG can be extracted and analyzed. Usually, the CFG leaks a considerable amount of information on the program’s structure. In this work we propose a method allowing to re-write a cod...

We present a method to approximate a LTAG grammar by a CFG. A key process in the approximation method is finite enumeration of partial parse results that can be generated during parsing. We applied our method to the XTAG English grammar and LTAG grammars which are extracted from the Penn Treebank, and investigated characteristics of the obtained CFGs. We perform CFG filtering for LTAG by the ob...

Esse estudo comparou o efeito de dois programas treinamento sobre a aptidão fí­sica e qualidade vida em mulheres com Varizes, sendo um programa condicionamento fí­sico geral (CFG) outro fortalecimento membros inferiores (MMII) aplicado 2 grupos voluntárias, praticantes regulares exercí­cio fí­sico, por 12 semanas. Foram coletados, pré pós treinamento, dados vida, perimetria panturrilha, goniome...

As a starting point for static program analysis a control flow graph (CFG) is needed. If only the binary executable is available, this CFG has to be reconstructed from sequences of instructions. The usual way to do this is a top-down approach: the executable’s information about routines is used to split the sequence into routines, and then, each instruction is analysed for branch targets in ord...

In this work the relation between Boolean Matrix Multiplication (BMM) and Context Free Grammar (CFG) parsing is shown. The first described approach, which is due to Valiant (1975), shows how CFG parsing can be reduced to Boolean Matrix Multiplication. Afterwards the reverse direction, i.e. how a CFG parser can be used to multiply two Boolean matrices, is presented, which is due to Lee (2002). T...

The compound fuling granule (CFG) is a traditional Chinese drug which has been used to treat ovarian cancer in China for over twenty years. Nevertheless, the underlying molecular mechanism of its anti-cancer effect remains unclear. In this study, microarray data analysis was performed to search differentially expressed genes in CFG-treated ovarian cancer cells. Several cell cycle and epithelial...

Following the proposal for a Petri Net (PN) representation of the Context Free Grammar (CFG), we propose in this paper, an algorithm to eliminate the useless productions of CFG. First the CFG is represented by a PN. Then, based on the reachability, an algorithm is developed to eliminate Useless-productions. The algorithm is analyzed and implemented in Pascal using examples of a CFG. The propose...

The US food industry would benefit from a domestically produced gum with a dependable supply and consistent quality that can be used for preparing oil-in-water (O-in-W) emulsions, such as citrus oil emulsions for beverages. Corn fiber gum (CFG) is an arabinoxylan (hemicellulose) extracted from the corn kernel pericarp and/or endosperm fiber fractions that can possibly fulfill this need. In this...