نتایج جستجو برای: binary mapped historical memory management

تعداد نتایج: 1333173  

2004
Peter Achten

In this paper we show how application-users can interactively experiment with Object I/O applications of arbitrary size in order to find its temporary, conditional, or invariant properties. The goal is to gain confidence in the quality of the application, and to seek properties that can be proven correct perhaps using formal proof tools.

The article analyses the research carried out during the last 5 years, which is dedicated not only to a historical theme in Pushkin’s works, but also historicism as a phenomenon of A.S. Pushkin’s creative mind. In contrast with traditionally considered aspects of Pushkin’s historicism, the author analyses the genesis of Pushkin’s perception of history. The events imprint...

Journal: :مدیریت اطلاعات سلامت 0
فرحناز صدوقی دانشیار، مدیریت اطلاعات بهداشتی درمانی، دانشگاه علوم پزشکی تهران، تهران، ایران فربد عبادی فرد آذر دانشیار، مدیریت اطلاعات بهداشتی درمانی، دانشگاه علوم پزشکی تهران، تهران، ایران مریم احمدی استادیار، مدیریت اطلاعات بهداشتی درمانی، دانشگاه علوم پزشکی تهران، تهران، ایران. زکیه پیری استادیار، مدیریت اطلاعات بهداشتی درمانی، دانشگاه علوم پزشکی تبریز، تبریز، ایران

introduction: organizational memory (om) is a tool for implementation of knowledge management. the objective of this study was designing an om for medical records (mr) departments. methods: this descriptive study was carried out in 2007. the study population consisted of all employees in five teaching hospitals in tabriz. process and required knowledge identification was performed through quest...

1996
Jesús Carretero Felix Pérez Pedro de Miguel Francisco García L. Alonso

This paper gives an overview of the I/O data mapping mechanisms of ParFiSys. Grouped management and parallelization are presented as relevant features. I/O data mapping mechanisms of ParFiSys, including all levels of the hierarchy, are described in this paper.

2007
Mircea R. Stan Wayne P. Burleson

Capacitances for the I/O tend to be several orders of magnitude larger than for the internal circuit. Decreasing the number of transitions at the I/O will then translate into large savings in power dissipation for the entire circuit. A way of decreasing the number of transitions at the I/O at the expense of slightly increasing the number of internal transitions is to use coding. We propose a me...

2005
Michael Mesnier Matthew Wachs Gregory Ganger

Relative fitness modeling is a new approach for predicting the performance and resource utilization of a workload when running on a particular storage device. In contrast with conventional device models, which expect deviceindependent workload characteristics as input, a relative fitness model makes predictions based on characteristics measured on a specific other device. As such, relative fitn...

1997
Chandra Tan Donald W. Bouldin Peyman H. Dehkordi

Arranging I/O in a matrix array over the core circuitry of an IC generally provides 5{ 10 times more I/O than the traditional method of restricting pads to the periphery. This approach also minimizes overall die size. This method was pioneered by IBM over thirty years ago and has recently become attractive for new designs requiring several hundred I/O. In this paper we describe the development ...

Journal: :Bibliosphere 2017

2001
Peter Jamieson Angelos Bilas

Clusters of high-end workstations and PCs are currently used in many application domains to perform large-scale computations or as scalable servers for I/O bound tasks. Although clusters have many advantages, their applicability in new areas and especially in areas of commercial applications has been limited. One of the main reasons for this is the fact that clusters do not provide a single sys...

2015
Pau Riba Josep Lladós Alicia Fornés Anjan Dutta

Graph-based representations are experiencing a growing usage in visual recognition and retrieval due to their representational power in front of classical appearance-based representations in terms of feature vectors. Retrieving a query graph from a large dataset of graphs has the drawback of the high computational complexity required to compare the query and the target graphs. The most importan...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید