نتایج جستجو برای: temporary storage

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

2002
T. HIRANO

Previous studies of neuron changes during conditioning have involved either surgical and paralytic restraints (Yoshii and Ogura 1960; Kamikawa et al. 1964) or free behavior in chronic animals (Buchwald et al. 1966; Travis and Sparks 1967; Ellison et al., in press). The search for neural traces of critical changes in learning has thus been clouded by the surgical and paralytic procedures or conf...

2007
Maria Isabel d’Ávila Freitas Ariella Fornachari Ribeiro Márcia Radanovic Leticia Lessa Mansur

Working memory is a system with a limited capacity which enables the temporary storage and manipulation of the information necessary for complex cognitive tasks. Numerous studies have suggested that performance in these tasks is related to age where older adults have a lesser performance than the young. Objective: To analyze the processing functions of working memory in a listening task. Method...

2003
Vivek V. Shende Aditya K. Prasad Igor L. Markov John P. Hayes

Reversible or information-lossless circuits have applications in digital signal processing, communication, computer graphics and cryptography. They are also a fundamental requirement in the emerging field of quantum computation. We investigate the synthesis of reversible circuits that employ a minimum number of gates and contain no redundant input-output line-pairs (temporary storage channels)....

Journal: :journal of current ophthalmology 0
محمدرضا فلاح mohammad reza fallah محمدرضا گلابدار mohammad reza golabdar فیروزه رحیمی firoozeh rahimi حسن هاشمی hassan hashemi محمدعلی زارع mohammad ali zare محمدرضا منصوری mohammad reza mansouri سیدفرزاد محمدی

purpose : vitreoretinal surgery can be difficult or impossible in patients with corneal opacity. one solution for this problem is use of temporary keratoprosthesis (tkp). we report anatomical and visual outcomes of this combined surgery in our institution. methods : we retrospectively reviewed charts of patients in whom a tkp was used between 2006 and 2010 with follow-up of at least six months....

2008
Jarek Rossignac Abhishek Venkatesh

Split&Tweak subdivisions iteratively refine a polygon by inserting a vertex in the middle of each edge (Split) and then moving each vertex to an affine combination of five consecutive vertices (Tweak). Special cases include Dyn, Gregory, and Levin’s fourpoint subdivision, Lane and Riesenfeld’s cubic and quintic B-spline subdivision, Rossignac’s subdivision which produces C curves, and Maillot a...

Journal: :Expert Syst. Appl. 2015
Kivanç Onan Füsun Ülengin Bahar Sennaroglu

Disasters can lead to a high risk of casualties and structural damages. Destructive disasters, such as earthquakes, may cause a great amount of disaster waste to be controlled. Reusing and recycling materials in the debris can decrease the need for re-construction resources. These reusable or recyclable materials can be processed in temporary storage sites like the ones suggested by the United ...

1997
William L. Harrison

Our goal is to produce the same compiler as Reynolds 12] via partial evaluation. We develop a continuation semantics for a higher-order, imperative, call-by-name Algol-like language which is based on the functor category semantics of Reynolds and Oles 11], and compile programs via the rst Futumura projection. Our \compilation semantics" is non-standard in some ways (e.g., the meanings of expres...

2010
R. BELAID

In this paper we address the problem of planning a temporary storage area in a shampoo making system. Everyday, the packing service of the company, which gathers several packing lines, transmits plans of orders to produce (also called batches) to the making service. Each plan corresponds to the work that will be performed by one packing line for the next production horizon. A batch, which consi...

2011
Vikash Kumar Singh Hemant Makwana Richa Gupta

In this work, the performance of basic and strassen’s matrix multiplication algorithms are compared in terms of memory hierarchy utilization. The problem taken here is MATRIX MULTIPLICATION (Basic and Strassen’s). Strassen’s Matrix Multiplication Algorithm has time complexity of O(n) with respect to the Basic multiplication algorithm with time complexity of O(n). This slight reduction in time m...

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

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