4 Super symmetric quantum field theories 32 4.1 Super manifolds . . . . . . . . . . . . . . . . . . . . . . . . . . 32 4.2 Super Riemannian structures on 1|1-manifolds . . . . . . . . . 36 4.3 Super Riemannian structures on 2|1-manifolds . . . . . . . . . 40 4.4 The super bordism category RB . . . . . . . . . . . . . . . . 46 4.5 Extending TV to a super category . . . . . . . . . . . . . . . . ...

We construct the analogue of the plactic monoid for the super semistandard Young tableaux over a signed alphabet. This is done by developing a generalization of the Knuth's relations. Moreover we get generalizations of Greene's invariants and Young-Pieri rule. A generalization of the symmetry theorem in the signed case is also obtained. Except for this last result, all the other results are pro...

Picture fuzzy sets (PFSs) utilize the positive, neutral, negative and refusal membership degrees to describe behaviours of decision-makers in more detail. In this article, we expound application extended TODIM based on cumulative prospect theory under picture multiple attribute group decision making (MAGDM). addition, adopt Information Entropy, which is used ascertain weighting vector attribute...

A super-mean filter (SUMF) is proposed to remove high density salt & pepper noise from digital images. The proposed filter works in two stages, in the first stage the noisy pixels are detected and in the second stage each noisy pixel is replaced by the mean value of noise free pixel of 2×2 matrix. Extensive simulation and experimental results shows that the proposed filter works well consistent...

The question of whether the class of decision problems that can be solved by deterministic polynomial-time algorithms (P ) is equal to the class of decision problems that can be solved by nondeterministic polynomial-time algorithms (NP) has been open since it was first formulated by Cook, Karp, and Levin in 1971. In this paper, we prove that they are not equal by showing that any algorithm that...

We present a dynamic model of sequential information acquisition by a heterogeneous committee. At each date agents decide whether to vote to adopt one of two alternatives or continue to collect more information. The process stops when a qualified majority vote for an alternative. Three main insights emerge from our analysis and match an array of stylized facts on committee decision making. Firs...

The main concern of the software industry is to deliver more products in shorter time-cycles to customers with an acceptable economic justification. In virtue of these concerns, the software industry and researchers in the field of software engineering have engaged in the process of adopting lean principles. In this paper, we are seeking the knowledge that could help us better understand the na...

Automatic synthesis of hardware components from declarative specifications is an ambitious endeavor in computer aided design. Existing synthesis algorithms are often implemented with Binary Decision Diagrams (BDDs), inheriting their scalability limitations. Instead of BDDs, we propose several new methods to synthesize finite-state systems from safety specifications using decision procedures for...