Previous months: - 0908(1) - 1003(2) - 1004(2) - 1008(1) - 1101(3) - 1106(3) - 1107(1) - 1108(1) - 1109(1) - 1112(2) - 1202(1)
Any replacements are listed further down
[17] viXra:1202.0036 [pdf] submitted on 2012-02-13 09:49:02
Authors: Baldha Prashantkumar Mansukhbhai
Comments: 4 Pages.
The new algorithm for multiplication. The multiplication algorithm is best for multiplication algorithm in some cases.
Category: Data Structures and Algorithms
[16] viXra:1112.0029 [pdf] submitted on 2011-12-07 18:58:12
Authors: Wu Sheng-Ping
Comments: 2 Pages.
This article propose a new Booth multiplier design that the booth
expansion is rearranged in square term like:
\[
ab=((a+b)^2-a^2-b^2)/2
\]
If the code length of $a,b$ is $n$, the multiplier on the right is
with the size $2^{2n}$, but multiplier on the left is with the size
$2^n$.
Category: Data Structures and Algorithms
[15] viXra:1112.0028 [pdf] submitted on 2011-12-07 19:00:52
Authors: Sheng-Ping Wu
Comments: 2 Pages.
This article uses the hybrids between the evolutionary method and Monte Carlo method to solve the differential equation, for example in this article, the Schrodinger equation for atom
Category: Data Structures and Algorithms
[14] viXra:1109.0036 [pdf] submitted on 16 Sep 2011
Authors: Sven De Smet
Comments: 9 pages
This paper describes an implementation strategy in preparation for an
implementation of an OpenCL FFT. The two most essential factors (memory bandwidth
and locality) that are crucial to obtain high performance on a GPU for an
FFT implementation are highlighted. Theoretical upper bounds for performance in
terms of the locality factor are derived. An implementation strategy is proposed that
takes these factors into consideration so that the resulting implementation has the
potential to obtain high performance.
Category: Data Structures and Algorithms
[13] viXra:1108.0028 [pdf] submitted on 22 Aug 2011
Authors: Sven de Smet
Comments: 21 pages. This paper is a slightly modified version of a draft paper that was submitted to ParCo 2011 and is very preliminary. Since I do not have the resources to complete this paper by increasing its clarity, adding examples, adding an experimental evaluation and adding a section on related work,
I'm making it available so that it may be useful to others.
This paper proposes to extend graph-based weakly relational domains
to a generalized relational context. Using a new definition of coherence, we show
that the definition of a normal form for this domain is simplified. A transitive closure
algorithm for combined relations is constructed and a proof of its correctness
is given. Using the observed similarity between transitive closure of a combined
relation and the normal form closure of a graph-based weakly relational domain,
we extract a mathematical property that a relational abstract domain must satisfy in
order to allow us to use an algorithm with the same form as the transitive closure
algorithm to compute the normal form of a graph-based weakly relational domain.
Category: Data Structures and Algorithms
[12] viXra:1106.0033 [pdf] submitted on 15 Jun 2011
Authors: Sven de Smet
Comments: 4 Pages.
This paper proposes to use a group theoretical model for the optimization
of algorithms. We first investigate some of the fundamental properties that are required
in order to allow the optimization of parallelism and communication. Next,
we explore how a group theoretical model of computations can satisfy these requirements.
As an application example, we demonstrate how this group theoretical
model can uncover new optimization possibilities in the polyhedral model.
Category: Data Structures and Algorithms
[11] viXra:1106.0023 [pdf] submitted on 12 Jun 2011
Authors: Sven de Smet
Comments: 12 pages. This paper is a slightly modified version of a draft paper that was
submitted to ParCo 2011 and is very preliminary. Since I do not have the resources to complete
this paper by increasing its clarity, extending the experimental evaluation and adding a
section on related work, I'm making it available so that it may be useful to others.
This paper describes a unified model for the optimization of communication
in parallel algorithms and architectures. Based on a property that provides a
unified view of locality in space and time, an algorithm is constructed that generates
a parallel architecture that is optimized for communication for a given computation.
The optimization algorithm is constructed using the lattice algebraic properties
of congruence relations and is therefor applicable in a general context. An
application to a bio-informatics algorithm demonstrates the value of the model and
optimization algorithm.
Category: Data Structures and Algorithms
[10] viXra:1106.0022 [pdf] submitted on 12 Jun 2011
Authors: Sven de Smet
Comments: 16 pages, This paper is a slightly modified version of a draft paper that was submitted to ParCo 2011 (with added proofs) and is very preliminary.
Since I do not have the resources to complete this paper by increasing its clarity, adding examples, adding an experimental evaluation and adding a section on related work, I'm making it available so that it may be useful to others.
This paper describes a new technique for automatic parallelisation in the
Z-polyhedral model. The presented technique is applicable to arbitrarily nested
loopnests with iteration spaces that can be represented as unions of Z-polyhedra
and affine modular data-access functions. The technique partitions both iteration
and data spaces of the computation. The maximal amount of parallelism that can
be represented using grid partitions is extracted.
Category: Data Structures and Algorithms
[9] viXra:1101.0082 [pdf] submitted on 24 Jan 2011
Authors: Ir J.A.J. van Leunen
Comments: 3 pages
A C# class library is described that offers an efficient and secure way of
object oriented data transfer and data storage. The classes convert a relational database
in an effective object
oriented database and a file system in an object oriented data storage and transfer system.
Category: Data Structures and Algorithms
[8] viXra:1101.0062 [pdf] submitted on 19 Jan 2011
Authors: Ir J.A.J. van Leunen
Comments: 20 pages
The current software generation process is rotten.
This paper analyses why that is the case and what can be done about it.
Category: Data Structures and Algorithms
[7] viXra:1101.0061 [pdf] submitted on 19 Jan 2011
Authors: Ir J.A.J. van Leunen
Comments: 6 pages
This is the account of the course of a project that had the aim to improve
the efficiency of embedded software generation with several orders of magnitude. All
factors that determined the success of the project are treated honestly and in detail.
Category: Data Structures and Algorithms
[6] viXra:1008.0032 [pdf] submitted on 11 Aug 2010
Authors: Priti Singh, Florentin Smarandache, Dipti Chauhan, Amit Bhaghel
Comments: 10 pages
Crashing is a process of expediting project schedule by compressing the total project duration. It is helpful when
managers want to avoid incoming bad weather season. However, the downside is that more resources are needed to
speed-up a part of a project, even if resources may be withdrawn from one facet of the project and used to speed-up
the section that is lagging behind. Moreover, that may also depend on what slack is available in a non-critical
activity, thus resources can be reassigned to critical project activity. Hence, utmost care should be taken to make
sure that appropriate activities are being crashed and that diverted resources are not causing needless risk and
project scope integrity. In this paper we want to present a technique called "Unit Crashing" to reduce the total cost
of project. Unit Crashing means to crash the project duration by one unit (day) instead of crashing it completely.
This technique uses an iterative approach to perform unit crashing until all activities along the critical path are
crashed by desired amount. The output of this method will reduce the cost of project, and is useful at places where
cost is of major consideration. Crashing PERT networks can save a significant amount of money in crashing and
overrun costs of a company. Even if there are no direct costs in the form of penalties for late completion of projects,
there is likely to be intangible costs because of reputation damage.
Category: Data Structures and Algorithms
[5] viXra:1004.0015 [pdf] submitted on 8 Mar 2010
Authors: Haibin Wang, Rajshekhar Sunderraman, Florentin Smarandache, André Rogatko
Comments: 25 pages
In this paper, we present a generalization of the relational data model based on interval
neutrosophic set [1]. Our data model is capable of manipulating incomplete as well as
inconsistent information. Fuzzy relation or intuitionistic fuzzy relation can only handle
incomplete information. Associated with each relation are two membership functions one is
called truth-membership function T which keeps track of the extent to which we believe the
tuple is in the relation, another is called falsity-membership function F which keeps track of the
extent to which we believe that it is not in the relation. A neutrosophic relation is inconsistent if
there exists one tuple a such that T(α) + F(α) > 1. In order to handle inconsistent situation, we
propose an operator called "split" to transform inconsistent neutrosophic relations into
pseudo-consistent neutrosophic relations and do the set-theoretic and relation-theoretic
operations on them and finally use another operator called "combine" to transform the result
back to neutrosophic relation. For this data model, we define algebraic operators that are
generalizations of the usual operators such as intersection, union, selection, join on fuzzy
relations. Our data model can underlie any database and knowledge-base management system
that deals with incomplete and inconsistent information.
Category: Data Structures and Algorithms
[4] viXra:1004.0007 [pdf] submitted on 8 Mar 2010
Authors: Florentin Smarandache
Comments: 3 pages
It is easy to deal with a Venn Diagram for 1 ≤ n ≤ 3 sets. When n gets larger, the picture
becomes more complicated, that's why we thought at the following codification. That's
why we propose an easy and systematic algebraic way of dealing with the representation
of intersections and unions of many sets.
Category: Data Structures and Algorithms
[3] viXra:1003.0135 [pdf] submitted on 6 Mar 2010
Authors: M. Khoshnevisan, Sukanto Bhattacharya, Florentin Smarandache
Comments: 13 pages
In this paper we have proposed a semi-heuristic optimization algorithm for designing
optimal plant layouts in process-focused manufacturing/service facilities. Our proposed
algorithm marries the well-known CRAFT (Computerized Relative Allocation of
Facilities Technique) with the Hungarian assignment algorithm. Being a semi-heuristic
search, our algorithm is likely to be more efficient in terms of computer CPU engagement
time as it tends to converge on the global optimum faster than the traditional CRAFT
algorithm - a pure heuristic. We also present a numerical illustration of our algorithm.
Category: Data Structures and Algorithms
[2] viXra:1003.0134 [pdf] submitted on 6 Mar 2010
Authors: Florentin Smarandache
Comments: 15 pages
Thirty-three new definitions are presented, derived from
neutrosophic set, neutrosophic probability, neutrosophic statistics, and
neutrosophic logic.
Each one is independent, short, with references and cross references
like in a dictionary style.
Category: Data Structures and Algorithms
[1] viXra:0908.0052 [pdf] submitted on 10 Aug 2009
Authors: Hamid V. Ansari
Comments: 3 pages
It is shown that we can take all numbers to odd bases such that we
require only about half of the digits required in the current method provided
that we introduce negative mark for each digit. Most probably this
method will have various applications in the computer technology.
Category: Data Structures and Algorithms
[4] viXra:1109.0036 [pdf] replaced on 19 Sep 2011
Authors: Sven De Smet
Comments: 9 pages
This paper describes an implementation strategy in preparation for an
implementation of an OpenCL FFT. The two most essential factors (memory bandwidth
and locality) that are crucial to obtain high performance on a GPU for an
FFT implementation are highlighted. Theoretical upper bounds for performance in
terms of the locality factor are derived. An implementation strategy is proposed that
takes these factors into consideration so that the resulting implementation has the
potential to achieve high performance.
Category: Data Structures and Algorithms
[3] viXra:1107.0056 [pdf] replaced on 12 Dec 2011
Authors: Andreï V. Serghienko
Comments: 41 Pages. 10 Figures, v3 in English, v5 in Russian
The literature on Delphi [1] numbers many manuals. However among them there are few
books, oriented to the solution of scientific and technical problems. In order to fill this want,
the author wrote the paper, containing the examples of programs in Delphi.
Depending on the type of problems it is convenient to use or graphic (usual), or console
applications of Delphi. Graphic applications are applicable for the plotting of functions.
Console applications are applicable especially, when we needn’t the visualization, and it is
necessary to introduce by hand lots of data. One can tell the console applications from the
graphic ones with the presence of the next line in the text of program:
Category: Data Structures and Algorithms
[2] viXra:1107.0056 [pdf] replaced on 2011-12-11 04:55:56
Authors: Andrei V. Serghienko
Comments: 38 Pages. 13 figures
The literature on Delphi numbers many manuals. However among them there are few
books, oriented to the solution of scientific and technical problems. In order to fill this want,
the author wrote the paper, containing the examples of programs in Delphi.
Depending on the type of problems it is convenient to use or graphic (usual), or console
applications of Delphi. Graphic applications are applicable for the plotting of functions.
Console applications are applicable especially, when we needn’t the visualization, and it is
necessary to introduce by hand lots of data. One can tell the console applications from the
graphic ones with the presence of the next line in the text of program:
{$APPTYPE CONSOLE}
Category: Data Structures and Algorithms
[1] viXra:1004.0007 [pdf] replaced on 12 Apr 2010
Authors: Florentin Smarandache
Comments: 3 pages
It is easy to deal with a Venn Diagram for 1 ≤ n ≤ 3 sets. When n gets larger, the picture
becomes more complicated, that's why we thought at the following codification. That's
why we propose an easy and systematic algebraic way of dealing with the representation
of intersections and unions of many sets.
Category: Data Structures and Algorithms