Search results for "tract"
showing 10 items of 9251 documents
Do Randomized Algorithms Improve the Efficiency of Minimal Learning Machine?
2020
Minimal Learning Machine (MLM) is a recently popularized supervised learning method, which is composed of distance-regression and multilateration steps. The computational complexity of MLM is dominated by the solution of an ordinary least-squares problem. Several different solvers can be applied to the resulting linear problem. In this paper, a thorough comparison of possible and recently proposed, especially randomized, algorithms is carried out for this problem with a representative set of regression datasets. In addition, we compare MLM with shallow and deep feedforward neural network models and study the effects of the number of observations and the number of features with a special dat…
Lying Cheating Robots : Robots and Infidelity
2018
Love has been described as unpredictable, immeasurable and non-purchasable and as such, poses challenges for anyone in a relationship to both stay in love, and to not fall in love with someone else. Scientists are still discovering whether or not love follows any specific recipe. Outlooks, personality, sense of humor and talent may not perfectly guarantee an individual falls in love with another, and more importantly is able to sustain that relationship. This article portrays a futuristic scenario in which truly intelligent and emotional robots already exist. Here, the bi-directional love discussed in Lovotics is not simulated through engineering, but rather is genuine from the perspectives…
Comparison of fully non-stationary artificial accelerogram generation methods in reproducing seismicity at a given site
2020
Abstract Seismic input modelling is a crucial step when Non-Linear Time-History Analyses (NLTHAs) are performed, the seismic response of structures being highly responsive to the input employed. When natural accelerograms able to represent local seismicity are not available, the use of generated accelerograms is an efficient solution for input modelling. The aim of the present paper is to compare four methods for generating fully non-stationary artificial accelerograms on the basis of a target spectrum, identified using seven recorded accelerograms registered in the neighbourhood of the construction site during a single event, assumed as target accelerograms. For each method, seven accelero…
Las huellas de la interdisciplinariedad en la trayectoria de Enric Mestre. ?Intercambios e investigaciones cruzadas entre las esculturas cerámicas y …
2020
La destacada actividad artística de Enric Mestre (Alboraya / Valencia, 1936) solo pude abordarse, en su compleja diversidad y riqueza, si se mantiene, como eje metodológico básico de su estudio crítico, el abierto enfoque de su sistemática interdisciplinariedad. Los diálogos e intercambios entre la escultura cerámica, la arquitectura, la pintura, el dibujo y los murales conforman precisamente el ámbito plural de su constante quehacer artístico. Especialmente la investigación se centra en las esculturas cerámicas y en las pinturas geométricas, que constituyen los dos dilatados campos de su creación plástica, cultivados asiduamente, a lo largo del último medio siglo
A note on best proximity point theory using proximal contractions
2018
In this paper, a reduction technique is used to show that some recent results on the existence of best proximity points for various classes of proximal contractions can be concluded from the corresponding results in fixed point theory.
A Novel Border Identification Algorithm Based on an “Anti-Bayesian” Paradigm
2013
Published version of a chapter in the book: Computer Analysis of Images and Patterns. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-642-40261-6_23 Border Identification (BI) algorithms, a subset of Prototype Reduction Schemes (PRS) aim to reduce the number of training vectors so that the reduced set (the border set) contains only those patterns which lie near the border of the classes, and have sufficient information to perform a meaningful classification. However, one can see that the true border patterns (“near” border) are not able to perform the task independently as they are not able to always distinguish the testing samples. Thus, researchers have worked on thi…
Rough Set Theory for Optimization of Packet Management Mechanism in IP Routers
2020
Bandwidth and consequently optimum overall efficiency of network system relies greatly on mechanism of packet management in IP routers. Our research objective is to implement rough set theory to minimizing number of the network system attributes responsible for decision making in selection of those packets, which improve its transmission. Such an approach is called priority queuing system model, as we assign priority to the packets selected, following rough set theory. Regardless of the file format, for all the routers, packets are transmitted in sequence one-by-one. Nonetheless, quality of streaming data largely depends on how much the packet loss is minimized, or eliminated at all, if pos…
Best proximity point theorems for proximal cyclic contractions
2017
The purpose of this article is to compute a global minimizer of the function $$x\longrightarrow d(x, Tx)$$ , where T is a proximal cyclic contraction in the framework of a best proximally complete space, thereby ensuring the existence of an optimal approximate solution, called a best proximity point, to the equation $$Tx=x$$ when T is not necessarily a self-mapping.
Combined column-and-row-generation for the optimal communication spanning tree problem
2018
Abstract This paper considers the exact solution of the optimal communication spanning tree problem (OCSTP), which can be described as follows: Given an undirected graph with transportation costs on every edge and communication requirements for all pairs of vertices, the OCSTP seeks for a spanning tree that minimizes the sum of the communication costs between all pairs of vertices, where the communication cost of a pair of vertices is defined as their communication requirement multiplied by the transportation cost of the unique tree path that connects the two vertices. Two types of compact formulations for OCSTP were presented in the literature. The first one is a four-index model based on …
The ELECTRE I method to support the FMECA
2018
Abstract In traditional Failure Modes, Effects and Criticality Analysis (FMECA), risk priorities of failure modes are determined through the Risk Priority Number (RPN), which is a function of the three risk parameters Occurrence (O), Severity (S), and Detection (D). In the present paper, an alternative approach to RPN is proposed for the criticality assessment of system failure modes. Particularly, the Multi-Criteria Decision Making (MCDM) method ELECTRE I is proposed to select the most critical failure mode in the set of the failure modes charactering a complex system. The method has been applied to a case study previously proposed by Zammori and Gabrielli (2012).