Search results for "vector"
showing 10 items of 2660 documents
Distributed Learning Automata-based S-learning scheme for classification
2019
This paper proposes a novel classifier based on the theory of Learning Automata (LA), reckoned to as PolyLA. The essence of our scheme is to search for a separator in the feature space by imposing an LA-based random walk in a grid system. To each node in the grid, we attach an LA whose actions are the choices of the edges forming a separator. The walk is self-enclosing, and a new random walk is started whenever the walker returns to the starting node forming a closed classification path yielding a many-edged polygon. In our approach, the different LA attached to the different nodes search for a polygon that best encircles and separates each class. Based on the obtained polygons, we perform …
Smart Beam Element Approach for LRPH Device
2020
LRPH (Limited Resistance Rigid Perfectly Plastic Hinge) device is a special steel device mainly usable to join beam elements of plane or spatial steel frames covered by patent n. 102017000088597 at the Italian Ministry of Economic Development and identified in the International Patent System with the number PCT/IB2018/055766. In the framework of moment (rigid) connection, the main fundamental innovation of LRPH consists in the mutual independence of its own resistance and stiffness features. The device is constituted by a sequence of three steel elements of limited length bounded by two parallel steel plates joined up with the connected structure elements. The cross-sections of the three st…
Extensible User-Based XML Grammar Matching
2009
International audience; XML grammar matching has found considerable interest recently due to the growing number of heterogeneous XML documents on the web and the increasing need to integrate, and consequently search and retrieve XML data originated from different data sources. In this paper, we provide an approach for automatic XML grammar matching and comparison aiming to minimize the amount of user effort required to perform the match task. We propose an open framework based on the concept of tree edit distance, integrating different matching criterions so as to capture XML grammar element semantic and syntactic similarities, cardinality and alternativeness constraints, as well as data-ty…
On the integration of Riemann-measurable vector-valued functions
2016
We confine our attention to convergence theorems and descriptive relationships within some subclasses of Riemann-measurable vector-valued functions that are based on the various generalizations of the Riemann definition of an integral.
Dendrimers as Non-Viral Vectors in Gene-Directed Enzyme Prodrug Therapy.
2021
Gene-directed enzyme prodrug therapy (GDEPT) has been intensively studied as a promising new strategy of prodrug delivery, with its main advantages being represented by an enhanced efficacy and a reduced off-target toxicity of the active drug. In recent years, numerous therapeutic systems based on GDEPT strategy have entered clinical trials. In order to deliver the desired gene at a specific site of action, this therapeutic approach uses vectors divided in two major categories, viral vectors and non-viral vectors, with the latter being represented by chemical delivery agents. There is considerable interest in the development of non-viral vectors due to their decreased immunogenicity, higher…
A Novel Energy Model for MANETs based on Graphs with Activation Windows
2005
Energy usage optimization is still an important issue and a critical design factor for mobile ad hoc networks (MANETs). Only recently a few proposals appeared that consider energy-aware optimizations for routing protocols. In this paper we describe an analytical model for MANETs which is based on graphs with activation windows. The activation windows allow to model the on-off status of the network devices. Moreover, we propose an algorithm with pseudo-polynomial complexity, called STP algorithm (STPA), that based on the current position and state of the nodes determines the shortest time path between the source node and the destination node.
A Branch-and-Cut method for the Capacitated Location-Routing Problem
2011
International audience; Recent researches in the design of logistic networks have shown that the overall distribution cost may be excessive if routing decisions are ignored when locating depots. The Location-Routing Problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles. The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities. The computational evaluation on three sets of instances (34 instances in total), with 5–10 potential depots and 20–88 …
TBRA: A scalable routing algorithm in highly mobile large scale pure ad hoc wireless mesh networks
2009
In highly mobile pure ad-hoc wireless mesh networks, fast rerouting within low routing discovery delay is a mandatory requirement for routing algorithm to support interactive applications such as VoIP. Also, the communication overhead should be thwarted when networks grow to a large scale. We propose a Tree-Based Routing Algorithm - TBRA to facilitate such two goals. On one hand, TBRA has very low routing discovery delay due to its proactive property. On the other hand, TBRA performs more efficiently than other proactive protocols with respect to low communication overhead, which thanks to its short routing packet length, less numbers and smaller routing table size. Our modeling analysis an…
Logic-Based Distributed Routing for NoCs
2008
The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. Although 2D meshes are usually proposed for NoCs, heterogeneous cores, manufacturing defects, hard failures, and chip virtualization may lead to irregular topologies. In this context, efficient routing becomes a challenge. Although switches can be easily configured to support most routing algorithms and topologies by using routing tables, this solution does not scale in terms of latency and area. We propose a new circuit that removes the need for using routing tables. The new mechanism, referred to as logic-based dis…
Input-Output Feedback Linearization Control of a Linear Induction Motor Taking Into Consideration Its Dynamic End-Effects and Iron Losses
2020
This article proposes a new input-output feedback linearization control (FLC) technique of linear induction motors (LIMs), taking into consideration both the dynamic end-effects and the iron losses. Starting from a previously conceived dynamic model, including the dynamic end-effects and the iron losses, all the theoretical framework of the FLC has been developed. The proposed FLC improves a previous version of FLC in accounting also the iron losses, which in LIMs with fixed-secondary sheet play a pivotal role more than in rotating induction motors (RIMs). The proposed FLC has been experimentally tested on a suitably developed test setup, and experimental comparisons between the proposed FL…