Search results for "Abstract"
showing 10 items of 1959 documents
Using an Adaptive Network-based Fuzzy Inference System to Estimate the Vertical Force in Single Point Incremental Forming
2019
Manufacturing processes are usually complex ones, involving a significant number of parameters. Unconventional manufacturing processes, such as incremental forming is even more complex, and the establishment of some analytical relationships between parameters is difficult, largely due to the nonlinearities in the process. To overcome this drawback, artificial intelligence techniques were used to build empirical models from experimental data sets acquired from the manufacturing processes. The approach proposed in this work used an adaptive network-based fuzzy inference system to extract the value of technological force on Z-axis, which appears during incremental forming, considering a set of…
Analysis of HMAX Algorithm on Black Bar Image Dataset
2020
An accurate detection and classification of scenes and objects is essential for interacting with the world, both for living beings and for artificial systems. To reproduce this ability, which is so effective in the animal world, numerous computational models have been proposed, frequently based on bioinspired, computational structures. Among these, Hierarchical Max-pooling (HMAX) is probably one of the most important models. HMAX is a recognition model, mimicking the structures and functions of the primate visual cortex. HMAX has already proven its effectiveness and versatility. Nevertheless, its computational structure presents some criticalities, whose impact on the results has never been…
Efficient analysis of cubic junction of rectangular waveguides using admittance-matrix representation
2000
In the paper an efficient and accurate method, based on the multimode-admittance-matrix representation and the theory of cavities, is proposed for the analysis of a six-port ‘cubic’ junction composed of the orthogonal intersection of three rectangular waveguides. Very simple closed-form analytical expressions are explicitly detailed for all matrix elements of this basic key building block. More general waveguide multiport junctions, composed of a central cubic junction with arbitrarily shaped waveguide access ports, are also studied using a segmentation procedure. To validate the theory, numerical results are first discussed for a standard rectangular waveguide six-port cross junction. Fina…
Worst Case Analysis of Non-local Games
2013
Non-local games are studied in quantum information because they provide a simple way for proving the difference between the classical world and the quantum world. A non-local game is a cooperative game played by 2 or more players against a referee. The players cannot communicate but may share common random bits or a common quantum state. A referee sends an input x i to the i th player who then responds by sending an answer a i to the referee. The players win if the answers a i satisfy a condition that may depend on the inputs x i .
Advantage of Quantum Strategies in Random Symmetric XOR Games
2013
Non-local games are known as a simple but useful model which is widely used for displaying nonlocal properties of quantum mechanics. In this paper we concentrate on a simple subset of non-local games: multiplayer XOR games with 1-bit inputs and 1-bit outputs which are symmetric w.r.t. permutations of players.
Automatic construction of test sets: Theoretical approach
2005
We consider the problem of automatic construction of complete test set (CTS) from program text. The completeness criterion adopted is C1, i.e., it is necessary to execute all feasible branches of program at least once on the tests of CTS. A simple programming language is introduced with the property that the values used in conditional statements are not arithmetically deformed. For this language the CTS problem is proved to be algorithmically solvable and CTS construction algorithm is obtained. Some generalizations of this language containing counters, stacks or arrays are considered where the CTS problem remains solvable. In conclusion the applications of the obtained results to CTS constr…
Non-Model Based Method for an Automation of 3D Acquisition and Post-Processing
2008
Most of the automation for 3D acquisition concerns objects with simple shape, like mechanical parts. For cultural heritage artefacts, the process is more complex, and it doesn't exist general solution nowadays. This paper presents a method to generate a complete 3D model of cultural heritage artefacts. In a first step, MVC is used to solve the view planning problem. Then, holes remaining in 3D model are detected, and their features are calculated to finish acquisition. Different post-processing are applied on each view to increase quality of the 3D model. This procedure has been tested with simulated scanner, before being implemented on a motion system with five degrees of freedom.
Information Abstraction from Crises Related Tweets Using Recurrent Neural Network
2016
Social media has become an important open communication medium during crises. The information shared about a crisis in social media is massive, complex, informal and heterogeneous, which makes extracting useful information a difficult task. This paper presents a first step towards an approach for information extraction from large Twitter data. In brief, we propose a Recurrent Neural Network based model for text generation able to produce a unique text capturing the general consensus of a large collection of twitter messages. The generated text is able to capture information about different crises from tens of thousand of tweets summarized only in a 2000 characters text.
Ranking-Oriented Collaborative Filtering: A Listwise Approach
2016
Collaborative filtering (CF) is one of the most effective techniques in recommender systems, which can be either rating oriented or ranking oriented. Ranking-oriented CF algorithms demonstrated significant performance gains in terms of ranking accuracy, being able to estimate a precise preference ranking of items for each user rather than the absolute ratings (as rating-oriented CF algorithms do). Conventional memory-based ranking-oriented CF can be referred to as pairwise algorithms. They represent each user as a set of preferences on each pair of items for similarity calculations and predictions. In this study, we propose ListCF, a novel listwise CF paradigm that seeks improvement in bot…
Topology Inference and Signal Representation Using Dictionary Learning
2019
This paper presents a Joint Graph Learning and Signal Representation algorithm, called JGLSR, for simultaneous topology learning and graph signal representation via a learned over-complete dictionary. The proposed algorithm alternates between three main steps: sparse coding, dictionary learning, and graph topology inference. We introduce the “transformed graph” which can be considered as a projected graph in the transform domain spanned by the dictionary atoms. Simulation results via synthetic and real data show that the proposed approach has a higher performance when compared to the well-known algorithms for joint undirected graph topology inference and signal representation, when there is…