Data Structures and Algorithms

1605 Submissions

[8] viXra:1605.0235 [pdf] submitted on 2016-05-22 18:39:09

FPGA Programming Step by Step

Authors: Edwin Eugene Klingman
Comments: 8 Pages. Embedded Systems Programming

FPGAs and microprocessors are more similar than you may think. Here's a primer on how to program an FPGA and some reasons why you'd want to. Small processors are, by far, the largest selling class of computers and form the basis of many embedded systems. The first single-chip microprocessors contained approximately 10,000 gates of logic and 10,000 bits of memory. Today, field programmable gate arrays (FPGAs) provide single chips approaching 10 million gates of logic and 10 million bits of memory...
Category: Data Structures and Algorithms

[7] viXra:1605.0234 [pdf] submitted on 2016-05-22 18:44:43

FPGA Design from the Outside In

Authors: Edwin Eugene Klingman
Comments: 10 Pages. Embedded Systems Programming

FPGAs enable everyone to be a chip designer. This installment shows how to design the bus interface for a generic peripheral chip. When designing with an embedded microprocessor, you always have to take into account, if not begin with, the actual pinout of the device. Each pin on a given microprocessor is uniquely defined by the manufacturer and must be used in a specific manner to achieve a specific function. Part of learning to design with embedded processors is learning the pin definitions. In contrast, field programmable gate array (FPGA) devices come to the design with pins completely undefined (except for power and ground). You have to define the FPGA's pins yourself. This gives you incredible flexibility but also forces you to think through the use of each pin...
Category: Data Structures and Algorithms

[6] viXra:1605.0152 [pdf] submitted on 2016-05-14 06:12:52

Sequential Ranking Under Random Semi-Bandit Feedback

Authors: Hossein Vahabi, Paul Lagree, Claire Vernade, Olivier Cappe
Comments: 19 Pages.

In many web applications, a recommendation is not a single item sug- gested to a user but a list of possibly interesting contents that may be ranked in some contexts. The combinatorial bandit problem has been studied quite extensively these last two years and many theoretical re- sults now exist : lower bounds on the regret or asymptotically optimal algorithms. However, because of the variety of situations that can be considered, results are designed to solve the problem for a specific reward structure such as the Cascade Model. The present work focuses on the problem of ranking items when the user is allowed to click on several items while scanning the list from top to bottom.
Category: Data Structures and Algorithms

[5] viXra:1605.0109 [pdf] submitted on 2016-05-11 02:37:54

Optimising Linear Seating Arrangements with a First-Principles Genetic Algorithm

Authors: Robert A. Martin
Comments: 21 Pages.

We discuss the problem of finding an optimum linear seating arrangement for a small social network, i.e. approaching the problem put forth in XKCD comic 173 – for a small social network, how can one determine the seating order in a row (e.g at the cinema) that corresponds to maximum enjoyment? We begin by improving the graphical notation of the network, and then propose a method through which the total enjoyment for a particular seating arrangement can be quantified. We then discuss genetic programming, and implement a first-principles genetic algorithm in python, in order to find an optimal arrangement. While the method did produce acceptable results, outputting an optimal arrangement for the XKCD network, it was noted that genetic algorithms may not be the best way to find such an arrangement. The results of this investigation may have tangible applications in the organising of social functions such as weddings.
Category: Data Structures and Algorithms

[4] viXra:1605.0033 [pdf] submitted on 2016-05-04 01:44:47

Abordarea Ierarhizata a Deciziilor de Grup

Authors: Marian Dragoi, Ciprian Palaghianu
Comments: 8 pages, 4 figures, language: Romanian (abstract in English)

Group decision makers making process - an analytic hierarchy approach The paper deals with a step-wise analytic hierarchy process (AHP) applied by a group of decision makers wherein nobody has a dominant position and it is unlikely to come to terms with respect to either the weights of different objectives or expected utilities of different alternatives. One of the AHP outcomes, that is the consistency index is computed for each decision maker, for all other decision makers but that one, and for the whole group. Doing so, the group is able to assess to which extent each decision maker alters the group consistency index and a better consistency index could be achieved if the assessment procedure is being resumed by the most influential decision maker in terms of consistency. The main contribution of the new approach is the algorithm presented in as a flow chart where the condition to stop the process might be either a threshold value for the consistency index, or a given number of iterations for the group or decision maker, depending on the degree to which the targeted goal has been decomposed into conflictual objectives.
Category: Data Structures and Algorithms

[3] viXra:1605.0018 [pdf] submitted on 2016-05-02 12:46:50

Cloud Computing IAAS

Authors: Slim hannachi
Comments: 133 Pages. Cloud Computer

IAAS
Category: Data Structures and Algorithms

[2] viXra:1605.0016 [pdf] submitted on 2016-05-02 07:29:37

Neutrosophic Image Retrieval with Hesitancy Degree

Authors: A.A.Salama, Mohamed Eisa, Hewayda ElGhawalby, A.E.Fawzy
Comments: 6 Pages.

The aim of this paper is to present texture features for images embedded in the neutrosophic domain with Hesitancy degree. Hesitancy degree is the fourth component of Neutrosophic set. The goal is to extract a set of features to represent the content of each image in the training database to be used for the purpose of retrieving images from the database similar to the image under consideration.
Category: Data Structures and Algorithms

[1] viXra:1605.0014 [pdf] submitted on 2016-05-02 04:38:44

Neutrosophic Features for Image Retrieval

Authors: A.A.Salama, Mohamed Eisa, Hewayda ElGhawalby, A.E.Fawzy
Comments: 6 Pages.

The goal of an Image Retrieval System is to retrieve images that are relevant to the user's request from a large image collection. In this paper we present texture features for images embedded in the neutrosophic domain. The aim is to extract a set of features to represent the content of each image in the training database to be used for the purpose of retrieving images from the database similar to the image under consideration.
Category: Data Structures and Algorithms