Sunday, May 1, 2016

 

 



Soy un nuevo usuario

Olvidé mi contraseña

Entrada usuarios

Lógica Matemáticas Astronomía y Astrofísica Física Química Ciencias de la Vida
Ciencias de la Tierra y Espacio Ciencias Agrarias Ciencias Médicas Ciencias Tecnológicas Antropología Demografía
Ciencias Económicas Geografía Historia Ciencias Jurídicas y Derecho Lingüística Pedagogía
Ciencia Política Psicología Artes y Letras Sociología Ética Filosofía
 

rss_1.0 Recursos de colección

CiteSeerX Scientific Literature Digital Library and Search Engine (4,229,316 recursos)
CiteSeerX is a scientific literature digital library and search engine that focuses primarily on the literature in computer and information science. CiteSeerx aims to improve the dissemination of scientific literature and to provide improvements in functionality, usability, availability, cost, comprehensiveness, efficiency, and timeliness in the access of scientific and scholarly knowledge

Mostrando recursos 1 - 20 de 4,142,181

1. Abstract geometrical computation for Black hole computation (Extended Abstract) - Jérôme Durand-Lose
The Black hole model of computation provides a computing power that goes beyond the classical Turing computability since it offers the possibility to decide in finite time any recursively enumerable (R.E.) problem. In this article, we provide a geometric model of computation, conservative abstract geometrical computation, that has the same property: it can simulate any Turing machine and can decide any R.E. problem through the creation of an accumulation. Finitely many signals can leave any accumulation, and it can be known whether anything leaves. This corresponds to a black hole artifact.

2. On Multi-Criteria Approaches to Bandwidth Allocation - Włodzimierz Ogryczak; Adam Wierzbicki
Modern telecommunication networks face an increasing demand for services. Among these, an increasing number are services that can adapt to available bandwidth, and are therefore referred to as elastic traffic. Nominal network design for elastic traffic becomes increasingly significant. Typical resource allocation methods are concerned with the allocation of limited resources among competing activities so as to achieve the best overall performances of the system. In the network dimensioning problem for elastic traffic, one needs to allocate bandwidth to maximize service flows and simultaneously to reach a fair treatment of all the elastic services. Thus, both the overall efficiency (throughput)...

3. Equitable aggregations and multiple criteria analysis - Michael M. Kostreva; Włodzimierz Ogryczak; Adam Wierzbicki
In the past decade, increasing interest in equity issues resulted in new methodologies in the area of operations research. This paper deals with the concept of equitably efficient solutions to multiple criteria optimization problems. Multiple criteria optimization usually starts with an assumption that the criteria are incomparable. However, many applications arise from situations which present equitable criteria. Moreover, some aggregations of criteria are often applied to select efficient solutions in multiple criteria analysis. The latter enforces comparability of criteria (possibly rescaled). This paper presents aggregations which can be used to derive equitably efficient solutions to both linear and nonlinear multiple...

4. Modification of recourse data for mixed-integer recourse models (Extended Abstract) - Maarten H. van der Vlerk

5. Precise interprocedural chopping - Thomas Reps, et al.
The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many software-engineering problems, including program understanding, debugging, maintenance, testing, and merging. A slice determines either all program elements that might affect a given element (“backward slicing”) or all elements that could be affected by a given element (“forward slicing”). Jackson and Rollins introduced a related operation, called program chopping, which is a kind of “filtered” slice: Chopping answers questions of the form “What are all the program elements v that serve to transmit effects from a given source element s to a given...

6. Precise interprocedural chopping - Thomas Reps, et al.
The notion of a program slice, originally introduced by Mark Weiser, is a fundamental operation for addressing many software-engineering problems, including program understanding, debugging, maintenance, testing, and merging. A slice determines either all program elements that might affect a given element (“backward slicing”) or all elements that could be affected by a given element (“forward slicing”). Jackson and Rollins introduced a related operation, called program chopping, which is a kind of “filtered” slice: Chopping answers questions of the form “What are all the program elements v that serve to transmit effects from a given source element s to a given...

7. Predictable embedding of large data structures in multiprocessor networks-on-chip - Sander Stuijk; Twan Basten; Bart Mesman; Marc Geilen
Predictable, tile-based multiprocessor networks-onchip are considered as future embedded systems platforms. Each tile contains one or a few processors and local memories. These memories are typically too small to store large data structures (e.g. a video frame). A solution to this is to embed tiles with large memories in the architecture. However, fetching data from these memories is slow because of the large network delays. The delay can be hidden by using prefetching. Our main contributions are models that allow timing analysis to provide guaranteed quality and performance when using remote memories and prefetching. We use two realistic video applications...

8. Legal shifts in the process of proof - Floris Bex; Bart Verheij
In this paper, we continue our research on a hybrid narrative-argumentative approach to evidential reasoning in the law by showing the interaction between factual reasoning and legal reasoning. We therefore emphasize the role of legal story schemes (as opposed to factual story schemes that formed the heart of our previous proposal). Legal story schemes steer what needs to be proven, but are also selected on the basis of what can be proven. They provide a coherent, holistic legal perspective on a criminal case that steers investigation and decision making. We present an extension of our previously proposed hybrid theory of...

9. Optimization Models for General Weighted OWA Criteria - Włodzimierz Ogryczak; Paweł Olender

10. On Multi-Criteria Approaches to Bandwidth Allocation - Włodzimierz Ogryczak; Adam Wierzbicki
Modern telecommunication networks face an increasing demand for services. Among these, an increasing number are services that can adapt to available bandwidth, and are therefore referred to as elastic traffic. Nominal network design for elastic traffic becomes increasingly signicant. Typical resource allocation methods are concerned with the allocation of limited resources among competing activities so as to achieve the best overall performances of the system. In the network dimensioning problem for elastic traffic, one needs to allocate bandwidth to maximize service flows and simultaneously to reach a fair treatment of all the elastic services. Thus, both the overall efficiency (throughput)...

11. EQUITY, FAIRNESS AND MULTICRITERIA Optimization - Włodzimierz Ogryczak

12. A Multi-Criteria Approach to Fair and Efficient Bandwidth Allocation - W. Ogryczak; Adam Wierzbicki; Marcin Milewski

13. Multicriteria Models for Fair Resource Allocation - Włodzimierz Ogryczak

14. Inequality Measures and Equitable Locations - Włodzimierz Ogryczak

15. On Multi-Criteria Approaches to Bandwidth Allocation - Włodzimierz Ogryczak; Adam Wierzbicki
Modern telecommunication networks face an increasing demand for services. Among these, an increasing number are services that can adapt to available bandwidth, and are therefore referred to as elastic trac. Nominal network design for elastic traffic becomes increasingly significant. Typical resource allocation methods are concerned with the allocation of limited resources among competing activities so as to achieve the best overall performances of the system. In the network dimensioning problem for elastic traffic, one needs to allocate bandwidth to maximize service flows and simultaneously to reach a fair treatment of all the elastic services. Thus, both the overall efficiency (throughput)...

16. Why Do New Technologies Complement Skills? Directed technical change AND WAGE INEQUALITY - Daron Acemoglu

17. Convex approximations for a class of mixed-integer recourse models - Maarten H. van der Vlerk

18. THE SIGNAL POINT OF VIEW: FROM CELLULAR AUTOMATA TO SIGNAL MACHINES - Jérôme Durand-Lose
After emphasizing on the use of discrete signals in the literature on cellular automata, we show how these signals have been considered on their own. We then present their continuous counterpart: abstract geometrical computation and signal machines. Finally we relate them to other models of computation, classical and analog.

19. Developing an efficient method . . . (Extended Abstract) - Renpo Wu; James R. Noyce; Lih-ching Chu
This paper describes an ongoing project to develop an efficient radiochemical method for sequential analyses of uranium and thorium isotopes in small samples of soils and environmental waters. Soils are first solubilized by fusing with lithium metaborate and dissolving the melt in dilute nitric acid. After reduction of any plutonium to the +3 oxidation state, uranium and thorium are extracted from the aqueous sample by bis(2-ethylhexyl)phosphoric acid (HDEHP) in toluene. They are back-extracted into 5M sulfuric acid. After decomposing residual organic material, uranium is oxidized to +6 with sodium nitrite. Thorium is microcoprecipitated with neodymium fluoride and filtered. Uranium in...

20. Natjam: Prioritizing Production Jobs in . . . (Extended Abstract) - Brian Cho, et al.
We present Natjam, a system allowing high priority production jobs and low priority research jobs to co-exist on an Apache Hadoop cluster. Natjam’s contributions include cheap task checkpointing and eviction policies for jobs and tasks. Trace-driven experiments reveal Natjam outperforms Hadoop and is very close to the ideal performance.

Página de resultados:
 

Busque un recurso