Data Structures and Algorithms

1602 Submissions

[4] viXra:1602.0349 [pdf] submitted on 2016-02-27 10:52:47

Social Networks Based e-Learning Systems Via Review of Recommender Systems Techniques

Authors: A. A. Salama, M.M.Eisa, S.A.EL-Hafeez, M.M. Lotfy
Comments: 28 Pages.

e-Learning has turned to be a necessity for everyone, as it enables continuous and life-long education. Learners are social by nature. They want to connect to othersand share the same interests. Online communities are important to help and encourage learners to continue education. Learners through social capabilities can share different experiences.Social networks are cornerstone for e-Learning. However, alternatives are many. Learners might get lost in the tremendous learning resources that are available. It is the role of recommender systems to help learners find their own way through e-Learning. We present a review of different recommender system algorithms that are utilized in social networks based e-Learning systems. Future research will include our proposed our e-Learning system that utilizes Recommender System and Social Network
Category: Data Structures and Algorithms

[3] viXra:1602.0250 [pdf] submitted on 2016-02-20 09:00:12

Thoughts about Modular Programming

Authors: J.A.J. van Leunen
Comments: 3 Pages.

Modular programming is a very efficient way of system creation. By reducing the number of relevant relations the method diminishes the complexity of configuring and supporting modular systems. The method uses the available resources in an optimal way. The current way of software generation uses an object oriented way of system construction that does not encapsulate the objects, such that their internals are effectively hidden and guarded against obstructive access by external objects. This paper introduces a new way of notation that enforces this encapsulation. Many programming languages already implement part of the required methodology. An example is the razor language. This paper extends these ideas to a modular way of programming. The approach makes from every relational database a modular database and from every file system a modular file system. It makes from every communication service a modular communication service and it standardizes programming such that reuse can be optimized in a global way. It will improve the robustness and reliability of software and enables to a large extent automated system configuration.
Category: Data Structures and Algorithms

[2] viXra:1602.0033 [pdf] submitted on 2016-02-02 18:19:36

Woodcoin a Peer to Peer Electronic Currency Designed for Stability and Longevity

Authors: Funkenstein the Dwarf
Comments: 4 Pages. Published Oct. 2014

We outline here the design considerations and implementation of woodcoin, in particular those which separate it from other cryptocurrencies. Woodcoin is a cryptocurrency very much like bitcoin. However the design of bitcoin explicitly models a non-renewable resource: gold. For woodcoin we more closely model a sustainable resource. In particular woodcoin avoids the time asymmetries of the bitcoin release model, maximizing the incentive to participate and the longevity of the coin at the same time. Our solution is logarithmic growth of the money supply. In addition, we outline the design considerations behind two other changes to the core protocol: mining with the Skein hash function and securing digital ownership with the X9_prime256v1 curve using ECDSA.
Category: Data Structures and Algorithms

[1] viXra:1602.0011 [pdf] submitted on 2016-02-01 10:52:44

Non-Newtonian ai for Solving NP-Complete Problems.

Authors: Michail Zak
Comments: 11 Pages.

A new kind of dynamics for simulations based upon quantum-classical hybrid is discussed. The model is represented by a modified Madelung equation in which the quantum potential is replaced by different, specially chosen potentials. As a result, the dynamics attains both quantum and classical properties: it preserves superposition and entanglement of random solutions, while allowing one to measure its state variables using classical methods. Such an optimal combination of characteristics is a perfect match for quantum- inspired information processing. In this paper, the retrieval of stored items from an exponentially large unsorted database is performed by quantum-inspired resonance using polynomial resources due to quantum-like superposition effect.
Category: Data Structures and Algorithms