Search results for "block"
showing 10 items of 1177 documents
Logic gates scheme based on Coulomb blockade in metallic nanoclusters with organic ligands
2010
We propose a logic gates scheme based on the electron transfer through metallic nanoclusters linked to organic ligands and discuss theoretically the characteristics needed for practical implementation. As a proof-of-the-concept, we demonstrate the OR, AND and NOT gates and study the performance in terms of temperature, applied voltage, and noise.
Cloud motion detection from infrared satellite images
2002
The estimation of cloud motion from a sequence of satellite images can be considered a challenging task due to the complexity of phenomena implied. Being a non-rigid motion and implying non-linear events, most motion models are not suitable and new algorithms have to be developed. We propose a novel technique, combining a Block Matching Algorithm (BMA) and a best candidate block search along with a vector median regularisation.
Optimal implementation of neural activation functions in programmable logic using fuzzy logic
2006
Abstract This work presents a methodology for implementing neural activation function in programmable logic using tools from fuzzy logic. This methodology will allow implementing these intrinsic non-linear functions using comparators and simple linear modellers, easily implemented in programmable logic. This work is particularized to the case of a hyperbolic tangent, the most common function in neural models, showing the excellent results yielded with the proposed approximation.
Privacy Enhanced Device Access
2012
In this paper we present the case for a device authentication protocol that authenticates a device/service class rather than an individual device. The devices in question are providing services available to the public. The proposed protocol is an online protocol and it uses a pseudo-random temporary identity scheme to provide user privacy.
Network channel allocation and revenue maximization
2002
This paper introduces a model that can be used to share link capacity among customers under different kind of traffic conditions. This model is suitable for different kind of networks like the 4G networks (fast wireless access to wired network) to support connections of given duration that requires a certain quality of service. We study different types of network traffic mixed in a same communication link. A single link is considered as a bottleneck and the goal is to find customer traffic profiles that maximizes the revenue of the link. Presented allocation system accepts every calls and there is not absolute blocking, but the offered data rate/user depends on the network load. Data arriva…
A characterization of the line set of an odd-dimensional Baer subspace
1990
Generalizing a theorem of Beutelspacher and Seeger, we consider line sets\(\mathcal{L}\) inP=PG(2t + 1,q),t ∈ IN, with the following properties: (1) any (t + 1)-dimensional subspace ofP contains at least one line of\(\mathcal{L}\), (2) if a pointx ofP is incident with at least two lines of\(\mathcal{L}\) then the points in the factor geometryP/x which are induced by the lines of\(\mathcal{L}\) throughx form a blocking set of type (t, 1) inP/x, (3) any line of\(\mathcal{L}\) is coplanar with at least one further line of\(\mathcal{L}\). We will show that the examples of minimal cardinality are exactly the line sets of Baer subspaces ofP.
Degrees of characters in the principal block
2021
Abstract Let G be a finite group. We prove that if the set of degrees of characters in the principal p-block of G has size at most 2 then G is p-solvable, and G / O p ′ ( G ) has a metabelian normal Sylow p-subgroup. The general question of proving that if an arbitrary p-block has two degrees then their defect groups are metabelian remains open.
Adaptation based on interpolation errors for high order mesh refinement methods applied to conservation laws
2012
Adaptive mesh refinement is nowadays a widely used tool in the numerical solution of hyperbolic partial differential equations. The algorithm is based on the numerical approximation of the solution of the equations on a hierarchical set of meshes with different resolutions. Among the different parts that compose an adaptive mesh refinement algorithm, the decision of which level of resolution is adequate for each part of the domain, i.e., the design of a refinement criterion, is crucial for the performance of the algorithm. In this work we analyze a refinement strategy based on interpolation errors, as a building block of a high order adaptive mesh refinement algorithm. We show that this tec…
A Maximal-Space Algorithm for the Container Loading Problem
2008
In this paper, a greedy randomized adaptive search procedure (GRASP) for the container loading problem is presented. This approach is based on a constructive block heuristic that builds upon the concept of maximal space, a nondisjoint representation of the free space in a container. This new algorithm is extensively tested over the complete set of Bischoff and Ratcliff problems [Bischoff, E. E., M. S. W. Ratcliff. 1995. Issues in the development of approaches to container loading. Omega 23 377–390], ranging from weakly heterogeneous to strongly heterogeneous cargo, and outperforms all the known nonparallel approaches that, partially or completely, have used this set of test problems. When …
Approximation of Feasible Parameter Set in worst case identification of block-oriented nonlinear models
2003
Abstract The estimation of the Feasible Parameter Set for block-oriented nonlinear models in a worst case setting is considered. A bounding procedure is determined both for polytopic and ellipsoidie sets, consisting in the projection of the FPS ⊂ R MN of the extended parameter vector onto suitable M or N-dimensional subspaces and in the solution of convex optimization problems which provide the extreme points of the Parameter Uncertainties Intervals of the model parameteres. Bounds obtained are tighter then in the previous approaches.