Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In traditional Vector Space Model (VSM) the TF*IDF method is widely used to adjust the weight of terms in text mining. However TF*EDF can not represent the semantic information of text by neglecting the semantic relevance between terms. In this paper, an improved ontology-based VSM is presented, in which the ontology-based term similarity is used to readjust the weight of semantically related terms...
In this paper, we study the upper bounds of memory storage for two different allocators. In the first case, we consider a general allocator that can allocate memory blocks anywhere in the available heap space. In the second case, a more economical allocator constrained by the address-ordered first-fit allocation policy is considered. We derive the upper bound of memory usage for all allocators and...
Under the target of maximum number of vehicles in a stage plan, the model of dynamic wagon-flow allocating under the uncertain condition can be built. The improved approximate nondeterministic tree search (ANTS) algorithm whose parameter ?? fixed by chaos sequence generator will be introduced by means of defining the possibility break up set, waiting set and choice set to mapping dynamic wagon-flow...
Resource-constrained project scheduling and configuration determine the progress of the construction and quality. This paper constructs a model for dynamic resources allocation and scheduling based on priority and fuzzy theory. And use ant colony algorithm with trust mechanism to solve it. The algorithm simulates ant feeling of mutual trust and act and is subject to significant interaction between...
The allocation of emergency resources is an important part of emergency decision. In this article, a dynamic programming model and goal programming model of emergency resources were presented. At the same time, aiming at solving the faultiness and inflexibility, the article presents a method of making multi-stage emergency decisions based on the theory of risk analysis and repast symphony platform...
Recently, more and more studies investigated the is-sue of dealing with the heterogeneity problem on heterogeneous cluster systems consisting of multi-core computing nodes. Previously we have proposed a hybrid MPI and OpenMP based loop self-scheduling approach for this kind of system. The allocation functions of several well-known schemes have been modified for better performance. Though the previous...
This paper focuses on the resource scheduling of LTE-Advanced system with carrier aggregation. With different fading characters, the aggregated carriers have different coverage between each other. Consequently, the carrier aggregation causes that the number of carriers which users can be scheduled on is various. The allocation fairness can not be achieved with the original proportional fair (PF) scheduling...
Four utility-based criteria are considered to study dynamic resource allocation in Multiple Input Multiple Output - Orthogonal Frequency Division Multiple Access (MIMO-OFDMA) multiuser cellular systems. In these criteria, two generalized bargaining strategies, GNBS and KSBS, are used to emphasize different levels of user fairness, while the criteria of utilitarian and egalitarian are briefly discussed...
To settle the contradiction between scarce radio spectrum resource and the exigent requirement, effective methods of dynamic spectrum allocation are proposed in cognitive radio system. In this paper, game theory model and graph-coloring model are analyzed, which can improve spectrum efficiency and solve the deficiency of spectrum resource.
In OFDMA systems, reducing the inter-cell interference among adjacent cells is a very important issue especially for the cell-edge users. In this paper, we propose a distributed algorithm that maximizing the system total throughput considering proportional fairness. In our proposed algorithm, the frequency resources in each cell is divided into high and low power regions. The bandwidth allocations...
In this research, we designed a novel cache mapping scheme for dynamic set-based cache partitioning. The cache mapping scheme facilitates allocation of any non-power-of-2 number of physical cache segments as a private cache to each process. An efficient near-optimal cache partitioning algorithm was designed for capturing working sets of running processes. Transparent cache reconfiguration was designed...
To solve the bottleneck problem of tasks that the interdependence between tasks fails to consider during the course of resource assignment and task scheduling based on the heuristics algorithm, a grid resource's domain split assignment method (GR-DSAM) is presented, which based on association rule model to group the sub-tasks. First, in order to enhance the sub-tasks' relationship of the same sub-task-group...
Different power management techniques have been developed to target leakage-reduction at runtime of a design by orders of magnitude. To advance an optimization, different power modes and especially costs of state transitions have to be considered in early steps, e.g. during scheduling, allocation and binding of high-level synthesis. We present an operation scheduling, binding and allocation approach...
Ubiquitous technologies are indispensable for modernizing human daily life more and more. However, the technologies are not easily widespread everywhere in our world through infrastructures and other related techniques. We have worked on a project to meet these challenges with a goal to construct a framework for the coming ubiquitous society. In our previous works, we have proposed UMP-PerComp, a...
In order to analyze the deadlock problem arose from the competition of tools resource in the flexible manufacturing system where the processes were non-interrupted, graph theory method was adopted and tool resource allocation graph (TRAG) was proposed. The relationship between tool flow deadlock and tool resource allocation graph (TRAG) was described after the TRAG was set up. A dynamic scheduling...
Multicore architectures in computer hardware bring an unprecedented need for parallel programming. In the work considered in this presentation, we are especially interested in multithreaded programs with shared data. In this widely- used programming paradigm, "lock" primitives are employed to control access to the shared data within the program threads.In this write-up, we report the progress...
The increasing power consumption levels of integrated circuits (ICs) have become a major concern of the semiconductor industry. Excessive power dissipation causes overheating, which can lead to soft errors or permanent damage. It also limits battery life in portable equipments. High power consumption can be reduced by properly increasing area. However, arbitrarily large area, namely high number of...
Resource allocations are performed statically for traditional distributed/parallel applications prior to launching application executions. This limitation could cause long resource waiting time when multiple resources need to be co-allocated. In contrast, the Adaptive Distributed/Parallel Applications (ADA), allowing resources to be added and released during executions, can adapt to the dynamic feature...
Grid computing has emerged as a way to share geographically and organizationally distributed resources that may belong to different institutions or administrative domains. In this context, the scheduling and resource management is usually performed by a grid resource broker. The scheduling task consists of distributing the jobs among the different centers resources and the need to coordinate the grid...
We present a highly automated technique to identify buffer overflows in C source code, and implement the approach in our prototype cboc. It is a sound tool, and of particular significance is its ability to easily deal with pointer expressions and dynamic memory allocations, which are integral parts of the buffer overflow problem. Our implementation hinges on a key design consideration: introducing...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.