The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Green data centers have become more and more popular recently due to their sustainability. The resource management module within a green data center, which is in charge of dispatching jobs and scheduling energy, becomes especially critical since it directly affects a center's profit and sustainability. The thrust of managing a green data center's machine and energy resources lies at the uncertainty...
Artificial fish swarm algorithm is a kind of swarm intelligence algorithm that imitates the behavior of individuals and information interactions among them during feeding process in real environment. This paper proposes an improved artificial fish swarm algorithm. First of all, it adopts dynamic adjustments for the view and step length of artificial fish, which let it keep a large value during the...
The discretization problem of continuous attribute is an important topic of machine learning, and data preprocessing. The discretization algorithm based on dynamic hierarchical clustering proposed in the paper is an improvement of hierarchical clustering algorithm. First, the qualitative analysis of the algorithm is made. Second, clustering analysis of the random collection data according to the similarity...
Model-based testing creates tests from abstract models of the software. These models are often described as graphs, and test requirements are defined as sub paths in the graphs. As a step toward creating concrete tests, complete (test) paths that include the sub paths through the graph are generated. Each test path is then transformed into a test. If we can generate fewer and shorter test paths, the...
By providing a detailed analysis of the particle swarm optimization (PSO) principle and job-shop scheduling problems, this paper presents a new hybrid discrete GAPSO combining the genetic strategy. Adjusting factors are introduced to regulate the generation of convergence; the proposed algorithm is tested by a set of benchmark problems. The results obtained show good convergence of the algorithm....
In this paper, we study energy management algorithms for job scheduling. In our model, each job has a release time, a processing time, a reward, and a deadline. The objective is to maximize net profit, defined as the difference between the total reward achieved by completing jobs by their deadlines and the total energy consumption accrued during this course. The net profit model generalizes the well-studied...
In order to predict the dynamic surface subsidence and deformation, a working face was divided into some mining elements along strike according to the face advancing, and the dynamic surface subsidence and deformation was regard as the superposition of the dynamic subsidence and deformation independently of all these mining elements. There might be a section of which width was shorter than a mining...
Viruses are devastating pathogens of humans, animals, and plants and virus infection mechanism is an important subject of virology and pathology research. To further our understanding of how viruses use the resource of infected cells, we systematically tested virus-yeast PPI network for the effect of virus perturbation on host proteins. Two viruses used in our study interact with vastly different...
In this paper, we undertake the competitive analysis of the online real-time scheduling problems under a given hard energy constraint. Specifically, we derive worst-case performance bounds that apply to any online algorithm, when compared to an optimal algorithm that has the knowledge of the input sequence in advance. First, by focusing on uniform value-density settings, we prove that no online algorithm...
This paper addresses the problem of estimating the odor path which is most likely taken by the odor patch detected by the concentration sensor on a mobile robot moving in an indoor dynamic airflow environment. The odor path estimation is useful for plume tracing and odor source declaration. A novel algorithm for odor path likelihood mapping in the dynamic airflow environment is proposed. The algorithm...
To realize the real-time exchange of grid network data information, ensure the security in the process of information transmission, ensure that information will not be illegally amended, illegally wiretapped and destructed during transmission, this paper presents a secure network communications model on the basis of public-key and double identity authentication. The model not only ensured the confidentiality...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.