Let r, s, q,m, n ∈ N be such that s ≥ r ≤ q. Let Y be a fibered manifold with m-dimensional basis and n-dimensional fibers. All natural affinors on (J(Y,R)0) are classified. It is deduced that there is no natural generalized connection on (J(Y,R)0). Similar problems with (J(Y,R)0) instead of (J(Y,R)0) are solved.

We describe mechanisms to emulate properties of prime numbers by connecting them to computationally simpler representations involving bijections from natural numbers to sequences and multisets of natural numbers. Through a generic framework, implemented as a Haskell type class, we model interesting properties of canonical representation of factorization and its simpler equivalents, like informa...

large panel precast structures are analyzed based on the connection rigidity. however, the connections undergo nonlinear and inelastic response, when subjected to seismic loads. thus, to study the actual behavior of structure, the connection nonlinearity should be implemented in the joints. in this paper, three conventional connection types are modeled based on the envelope of their cyclic resp...

The paper describes the hierarchy of models used in the modeling of interconnects in high-speed designs and focuses on the development of techniques needed for the high-frequency simulation of complete modules.

We propose an evolution of the hyper-connection axiomatic in order to improve the consistency of hyper-connected filters and to simplify their design. Our idea relies on the principle that the decomposition of an image into h-components must be necessary and sufficient. We propose a set of three equivalent axioms to achieve this goal. We show that an existing h-connection already fulfills these...

We consider Boolean algebras endowed with a contact relation which are abstractions of Boolean algebras of regular closed sets together with Whitehead’s connection relation [17], in which two non-empty regular closed sets are connected if they have a non-empty intersection. These are standard examples for structures used in qualitative reasoning, mereotopology, and proximity theory. We exhibit ...

In Huang and Weng (2004), Huang and Weng introduced pooling spaces, and constructed pooling designs from a pooling space. In this paper, we introduce the concept of pooling semilattices and prove that a pooling semilattice is a pooling space, then show how to construct pooling designs from a pooling semilattice. Moreover, we give many examples of pooling semilattices and thus obtain the corresp...