16 research outputs found
Equalitarian Societies are Economically Impossible
The inequality of wealth distribution is a universal phenomenon in the
civilized nations, and it is often imputed to the Matthew effect, that is, the
rich get richer and the poor get poorer. Some philosophers unjustified this
phenomenon and tried to put the human civilization upon the evenness of wealth.
Noticing the facts that 1) the emergence of the centralism is the starting
point of human civilization, i.e., people in a society were organized
hierarchically, 2) the inequality of wealth emerges simultaneously, this paper
proposes a wealth distribution model based on the hidden tree structure from
the viewpoint of complex network. This model considers the organized structure
of people in a society as a hidden tree, and the cooperations among human
beings as the transactions on the hidden tree, thereby explains the
distribution of wealth. This model shows that the scale-free phenomenon of
wealth distribution can be produced by the cascade controlling of human
society, that is, the inequality of wealth can parasitize in the social
organizations, such that any actions in eliminating the unequal wealth
distribution would lead to the destroy of social or economic structures,
resulting in the collapse of the economic system, therefore, would fail in
vain
A novel energy-efficient resource allocation algorithm based on immune clonal optimization for green cloud computing
Cloud computing is a style of computing in which dynamically scalable and
other virtualized resources are provided as a service over the Internet. The
energy consumption and makespan associated with the resources allocated should
be taken into account. This paper proposes an improved clonal selection
algorithm based on time cost and energy consumption models in cloud computing
environment. We have analyzed the performance of our approach using the
CloudSim toolkit. The experimental results show that our approach has immense
potential as it offers significant improvement in the aspects of response time
and makespan, demonstrates high potential for the improvement in energy
efficiency of the data center, and can effectively meet the service level
agreement requested by the users.Comment: arXiv admin note: text overlap with arXiv:1006.0308 by other author
An Efficient Web Usage Mining Approach Using Chaos Optimization and Particle Swarm Optimization Algorithm Based on Optimal Feedback Model
The dynamic nature of information resources as well as the continuous changes in the information demands of the users has made it very difficult to provide effective methods for data mining and document ranking. This paper proposes an efficient particle swarm chaos optimization mining algorithm based on chaos optimization and particle swarm optimization by using feedback model of user to provide a listing of best-matching webpages for user. The proposed algorithm starts with an initial population of many particles moving around in a D-dimensional search space where each particle vector corresponds to a potential solution of the underlying problem, which is formed by subsets of webpages. Experimental results show that our approach significantly outperforms other algorithms in the aspects of response time, execution time, precision, and recall
Application of Global Optimization Methods for Feature Selection and Machine Learning
The feature selection process constitutes a commonly encountered problem of global combinatorial optimization. The process reduces the number of features by removing irrelevant and redundant data. This paper proposed a novel immune clonal genetic algorithm based on immune clonal algorithm designed to solve the feature selection problem. The proposed algorithm has more exploration and exploitation abilities due to the clonal selection theory, and each antibody in the search space specifies a subset of the possible features. Experimental results show that the proposed algorithm simplifies the feature selection process effectively and obtains higher classification accuracy than other feature selection algorithms
A Novel Energy Efficient Topology Control Scheme Based on a Coverage-Preserving and Sleep Scheduling Model for Sensor Networks
In high-density sensor networks, scheduling some sensor nodes to be in the sleep mode while other sensor nodes remain active for monitoring or forwarding packets is an effective control scheme to conserve energy. In this paper, a Coverage-Preserving Control Scheduling Scheme (CPCSS) based on a cloud model and redundancy degree in sensor networks is proposed. Firstly, the normal cloud model is adopted for calculating the similarity degree between the sensor nodes in terms of their historical data, and then all nodes in each grid of the target area can be classified into several categories. Secondly, the redundancy degree of a node is calculated according to its sensing area being covered by the neighboring sensors. Finally, a centralized approximation algorithm based on the partition of the target area is designed to obtain the approximate minimum set of nodes, which can retain the sufficient coverage of the target region and ensure the connectivity of the network at the same time. The simulation results show that the proposed CPCSS can balance the energy consumption and optimize the coverage performance of the sensor network
An Efficient Recommendation Filter Model on Smart Home Big Data Analytics for Enhanced Living Environments
With the rapid growth of wireless sensor applications, the user interfaces and configurations of smart homes have become so complicated and inflexible that users usually have to spend a great amount of time studying them and adapting to their expected operation. In order to improve user experience, a weighted hybrid recommender system based on a Kalman Filter model is proposed to predict what users might want to do next, especially when users are located in a smart home with an enhanced living environment. Specifically, a weight hybridization method was introduced, which combines contextual collaborative filter and the contextual content-based recommendations. This method inherits the advantages of the optimum regression and the stability features of the proposed adaptive Kalman Filter model, and it can predict and revise the weight of each system component dynamically. Experimental results show that the hybrid recommender system can optimize the distribution of weights of each component, and achieve more reasonable recall and precision rates