We present a method for the inclusion of finite width effects in the simulation of Beyond Standard Model (BSM) physics. In order to test the validity of the method we compare our results with matrix elements for a range of production and decay processes in the Standard Model, Minimal Supersymmetric Standard Model (MSSM) and Minimal Universal Extra Dimensions model (MUED). This procedure has bee...

The power supply of remote sites and applications at minimal cost and with low emissions is an important issue when discussing future energy concepts. This paper presents modeling and optimization of a photovoltaic (PV)/wind/diesel system with batteries storage for electrification to an off-grid remote area located in Rafsanjan, Iran. For this location, different hybrid systems are studied and ...

A fundamental part of a fault diagnosis system is the residual generator. Here a new method, the minimal polynomial basis approach, for design of residual generators for linear systems, is presented. The residual generation problem is transformed into a problem of finding polynomial bases for null-spaces of polynomial matrices. This is a standard problem in established linear systems theory, wh...

-Machines are minimal, unifilar presentations of stationary stochastic processes. They were originally defined in the history machine sense, as hidden Markov models whose states are the equivalence classes of infinite pasts with the same probability distribution over futures. In analyzing synchronization, though, an alternative generator definition was given: unifilar, edge-emitting hidden Mark...

We examine how a statistical test based on discrete spacings between points, in 1 or more dimensions, detects the regularities in certain popular classes of random number generators. We provide a rule of thumb giving the minimal sample size for the test to reject the generator systematically, as a function of the generator's size (or period length), for generator families such as the linear con...

We demonstrate how virtually all common cardinal invariants associated to a von Neumann algebra M can be computed from the decomposability number, dec(M), and the minimal cardinality of a generating set, gen(M). Applications include the equivalence of the well-known generator problem, “Is every separably-acting von Neumann algebra singly-generated?”, with the formally stronger questions, “Is ev...

We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOG programs are derived by an off-line compilation process: a parser and a generator for this language. The centerpiece of the system is the inversion algorithm designed to compute the generator code from the parser's PROLOG code, using the collection of minimal sets...

In this paper, we study Z2Z2[u]-(1 + u)-additive constacyclic code of arbitrary length. Firstly, we study the algebraic structure of this family of codes and a set of generator polynomials for this family as a (Z2+uZ2)[x]-submodule of the ring Rα,β. Secondly, we give the minimal generating sets of this family codes, and we determine the relationship of generators between the Z2Z2[u]-(1 + u)-add...

This paper presents a high-performance low-ringing ultra-wideband monocycle picosecond pulse generator, formed using a step recovery diode (SRD), simulated in ADS software and generated through experimentation. The pulse generator comprises three parts, a step recovery diode, a field-effect transistor and a Schottky diode, used to eliminate the positive and negative ringing of pulse. Simulated ...

Given a finite Abelian group A and an integer t, 1 ≤ t ≤ A −1, a subset S of A is called a t-sum generator of A if every element of A can be written as the sum of exactly t distinct elements of S. In this paper we investigate the minimal integer M(t, A) such that every set S ⊆ A of size S > M(t, A) is a t-sum generator of A. The value of M(t, A) is completely determined for groups of even order.