Previous months: - 0908(1) - 1003(2) - 1004(2) - 1008(1)
[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.
[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.
[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.
[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.
[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.
[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.
[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.