Objective To determine the attitudes of Egyptian patients regarding their participation in research and with the collection, storage and future use of blood samples for research purposes. Design Cross-sectional survey. Study population Adult Egyptian patients (n=600) at rural and urban hospitals and clinics. Results Less than half of the study population (44.3%) felt that informed consent forms should provide research participants the option to have their blood samples stored for future research. Of these participants, 39.9% thought that consent forms (...) should include the option that future research be restricted to the illness being studied. A slight majority (66.2%) would donate their samples for future genetic research. Respondents were more favourable towards having their blood samples exported to other Arab countries (62.0%) compared with countries in Europe (41.8%, p<0.001) and to the USA (37.2%, p<0.001). Conclusions This study shows that many individuals do not favour the donation of a blood sample for future research. Of those who do approve of such future research, many favour a consent model that includes an option restricting the future research to the illness being studied. Also, many Egyptians were hesitant to have their blood samples donated for genetic research or exported out of the Arab region to the USA and European countries. Further qualitative research should be performed to determine the underlying reasons for many of our results. (shrink)

In 1990, J. L. Krivine introduced the notion of storage operator to simulate “call by value” in the “call by name” strategy. J. L. Krivine has showed that, using Gödel translation of classical into intuitionistic logic, one can find a simple type for the storage operators in AF2 type system. This paper studies the ∀-positive types and the Gödel transformations of TTR type system. We generalize by using syntactical methods Krivine's theorem about these types and for these transformations. (...) We give a proof of this result in the case of the type of recursive integers. (shrink)

In 1990, J. L. Krivine introduced the notion of storage operator to simulate, for Church integers, the “call by value” in a context of a “call by name” strategy. In the present paper we define for every λ-term S which realizes the successor function on Church integers the notion of S-storage operator. We prove that every storage operator is an S-storage operator. But the converse is not always true.

How has the storage of information shaped human cognition? We bring together current advances in cognitive science, the neurobiology of memory, and archaeology to explore how storage of information affects consciousness. These fields strongly suggest that the increase in storage of information in the environment – which we call exosomatic storage of information – may have led to changes in human consciousness and human neurophysiology over time. To bring these findings together conceptually, we develop what we (...) call a dialectical model of the relationship between storage of information and the development of human consciousness. Using the system of dialectic philosophy, we put forward that (a) environmental changes, consciousness, and neurophysiology develop together, (b) these changes were irreversible, (c) quantitative increases in exosomatic storage of information may have led to qualitative changes in human consciousness and neurophysiology, (d) these changes in turn affected how we see ourselves. Indeed, our capacity to store information exosomatically distinguishes us from other animals, and may be a key attribute of our self-awareness and therefore self-consciousness. Because metaphors are central to human thought and can help structure scientific inquiry, we illustrate our model using a metaphor of drops of silver on the back of a glass, eventually making a mirror—where successive quantitative change leads to an irreversible qualitative development in human consciousness. The dialectic model can offer new insights into the co-evolution of material culture and human beings through its broader philosophical foundations and explanatory power. (shrink)

Storage operators have been introduced by J. L. Krivine in [5] they are closed λ-terms which, for a data type, allow one to simulate a "call by value" while using the "call by name" strategy. In this paper, we introduce the directed λ-calculus and show that it has the usual properties of the ordinary λ-calculus. With this calculus we get an equivalent--and simple--definition of the storage operators that allows to show some of their properties: $\bullet$ the stability of (...) the set of storage operators under the β-equivalence (Theorem 5.1.1); $\bullet$ the undecidability (and semidecidability) of the problem "is a closed λ-term t a storage operator for a finite set of closed normal λ-terms?" (Theorems 5.2.2 and 5.2.3); $\bullet$ the existence of storage operators for every finite set of closed normal λ-terms (Theorem 5.4.3); $\bullet$ the computation time of the "storage operation" (Theorem 5.5.2). (shrink)

The storage operators were introduced by J.L. Krivine ([6]); they are closed λ-terms which, for some fixed data type (the integers for example), allow to simulate “call by value” while using “call by name”. J.L. Krivine showed that such operators can be typed, in the type system, using Gödel's translation from classical to intuitionistic logic ([8]).This paper studies the existence of storage operators which give a normal form as result (strong storage operators) for recursive and iterative representation (...) of data in λ-calculus. We obtain the following result:We can find typed strong storage operators for the recursive representations of data type, but that is not the case for the iterative representations of an infinite data type.We give the proof of this result in the case of integers. (shrink)

Why do some invertebrates store so much carotenoids in their tissues? Storage of carotenoids may not simply be passive and dependent on their environmental availability, as storage variation exists at various taxonomic scales, including among individuals within species. While the strong antioxidant and sometimes immune-stimulating properties of carotenoids may be beneficial enough to cause the evolution of features improving their assimilation and storage, they may also have fitness downsides explaining why massive carotenoid storage is not universal. (...) Here, the functional and ecological implications of carotenoid storage for the evolution of invertebrate innate immune defenses are examined, especially in crustaceans, which massively store carotenoids for unclear reasons. Three testable hypotheses about the role of carotenoid storage in immunological (resistance and tolerance) and life-history strategies (with a focus on aging) are proposed, which may ultimately explain the storage of large amounts of these pigments in a context of host–pathogen interactions. (shrink)

Storage and Commodity Markets is primarily a work of economic theory, concerned with how the capability to store a surplus affects the prices and production of commodities. Its focus on the behaviour, over time, of aggregate stockpiles provides insights into such questions as how much a country should store out of its current supply of food considering the uncertainty in future harvests. Related topics covered include whether storage or international trade is a more effective buffer and whether stockpiles (...) are more useful in raw or processed form. Several chapters are devoted to analysing such government programmes as price bands, buffer stocks, and strategic reserves. This material is in the domain of applied welfare analysis with public finance. Because the theory presented is sufficiently general, it should be of interest to macroeconomists studying aggregate inventories or savings and to those in operations research studying inventory and pricing policies of large firms. (shrink)

In 1990, J.L. Krivine introduced the notion of storage operator to simulate 'call by value' in the 'call by name' strategy. J.L. Krivine has shown that, using Gödel translation of classical into intuitionitic logic, we can find a simple type for the storage operators in AF2 type system. This paper studies the $forall$-positive types (the universal second order quantifier appears positively in these types), and the Gödel transformations (a generalization of classical Gödel translation) of TTR type system. We (...) generalize, by using syntaxical methods, the J.L. Krivine's Theorem about these types and for these transformations. We give a proof of this result in the case of the type of recursive integers. (shrink)

Antonio Ramos Díaz has recently given an extensive critique of what I have called the “storage problem” for materialism about the human mind. I respond to Díaz, showing that his critique fails. First, I rehearse the storage problem, explaining what claims it does and does not involve. I then consider Díaz’s “strong” and “weak” interpretations of my argument, explaining why I do not subscribe to the strong version, which misinterprets my position, especially concerning the meaning of the term (...) “concrete.” His weak version of my argument is closer to what I intend, but Díaz’s own unpacking of this interpretation also commits me to claims I do not, for very good reasons, accept. Díaz does not, in the end, show the storage problem to be—as he thinks—an unsound way of arguing for dualism. Getting concepts into a purely material human intellect still looks like the metaphysical equivalent of fitting a square peg into a round hole. (shrink)

Clahsen's claim that output forms of productive processes are never listed in the lexicon is a consequence of the rule/list fallacy, empirically incorrect, and not necessary for the hypothesis that the human language faculty has a dual structure, that is, a lexicon and a set of rules.

This paper is about a support information management system for a wind power producer having an energy storage system and participating in a day-ahead electricity market. Energy storage can play not only a leading role in mitigation of the effect of uncertainty faced by a WP producer, but also allow for conversion of wind energy into electric energy to be stored and then released at favourable hours. This storage provides capability for arbitrage, allowing an increase on profit (...) of a WP producer, but must be supported by a convenient problem formulation. The formulation proposed for the support information management system is based on an approach of stochasticity written as a mixed integer linear programming problem. WP and market prices are considered as stochastic processes represented by a set of scenarios. The charging/discharging of the ESS are considered dependent on scenarios of market prices and on scenarios of WP. The effectiveness of the proposed formulation is tested by comparison of case studies using data from the Iberian Electricity Market. The comparison is in favour of the proposed consideration of stochasticity. (shrink)

Miller (1956) summarized evidence that people can remember about seven chunks in short-term memory (STM) tasks. However, that number was meant more as a rough estimate and a rhetorical device than as a real capacity limit. Others have since suggested that there is a more precise capacity limit, but that it is only three to five chunks. The present target article brings together a wide variety of data on capacity limits suggesting that the smaller capacity limit is real. Capacity limits (...) will be useful in analyses of information processing only if the boundary conditions for observing them can be carefully described. Four basic conditions in which chunks can be identified and capacity limits can accordingly be observed are: (1) when information overload limits chunks to individual stimulus items, (2) when other steps are taken specifically to block the recoding of stimulus items into larger chunks, (3) in performance discontinuities caused by the capacity limit, and (4) in various indirect effects of the capacity limit. Under these conditions, rehearsal and long-term memory cannot be used to combine stimulus items into chunks of an unknown size; nor can storage mechanisms that are not capacity-limited, such as sensory memory, allow the capacity-limited storage mechanism to be refilled during recall. A single, central capacity limit averaging about four chunks is implicated along with other, noncapacity-limited sources. The pure STM capacity limit expressed in chunks is distinguished from compound STM limits obtained when the number of separately held chunks is unclear. Reasons why pure capacity estimates fall within a narrow range are discussed and a capacity limit for the focus of attention is proposed. Key Words: attention; enumeration; information chunks; memory capacity; processing capacity; processing channels; serial recall; short-term memory; storage capacity; verbal recall; working memory capacity. (shrink)

ABSTRACTThis article critiques contemporary applications of the computational metaphor, popular among Silicon Valley technologists, that views individuals and culture through the lens of computer and information systems. Taken literally, this metaphor has become entrenched as a quasi-religious ideology that obscures the moral and political-economic gatekeeping power of technology elites. Through an examination of algorithmic processing applications and life-logging devices, the authors highlight the inequitable consequences of the tendency, in popular media and marketing rhetoric, to collapse the distinctions between processing and (...) judgment, storage and memory. Such distinctions are necessary for an ethical development of more equitable digital environments. (shrink)

[Newspaper opinion] To give carbon storage sites the greatest chance of success, it makes sense to develop them in places where the geology has been thoroughly explored and where there is lots of relevant expertise. This would imply pumping carbon into underground storage sites in northern Europe, the Middle East and the US, where companies have spent centuries looking for and extracting fossil fuels. On the other hand, it might be important to develop storage sites in economies (...) where the current and future demand for carbon capture and storage is greatest. The regions with the best prospects are not often those with the greatest expected need. [Open access]. (shrink)

Commentators expressed a wide variety of views on whether there is a basic capacity limit of 3 to 5 chunks and, among those who believe in it, about why it occurs. In this response, I conclude that the capacity limit is real and that the concept is strengthened by additional evidence offered by a number of commentators. I consider various arguments why the limit occurs and try to organize these arguments into a conceptual framework or “metatheory” of storage capacity (...) limits meant to be useful in future research to settle the issue. I suggest that principles of memory representation determine what parts of the representation will be most prominent but that limits of attention (or of a memory store that includes only items that have been most recently attended) determine the 3- to 5-chunk capacity limit. (shrink)

The never ending growth of digital information and the availability of low-cost storage facilities and networks capacity is leading users towards moving their data to remote storage resources. Since users’ data often holds identity-related information, several privacy issues arise when data can be stored in untrusted domains. In addition digital identity management is becoming extremely complicated due to the identity replicas proliferation necessary to get authentication in different domains. GMail and Amazon Web Services, for instance, are two examples (...) of online services adopted by million of users throughout the world which hold huge amounts of sensitive users data. State-of-the-art encryption tools for large-scale distributed infrastructures allow users to encrypt content locally before storing it on a remote untrusted repository. This approach can experience performance drawbacks, when very large data-sets must be encrypted/decrypted on a single machine. The proposed approach extends the existing solutions by providing two additional features: (1) the encryption can also be delegated to a pool of remote trusted computing resources, and (2) the definition of the encryption context which drives the tool to select the best strategy to process the data. The performance benchmarks are based on the results of tests carried out both on a local workstation and on the Grid INFN Laboratory for Dissemination Activities (GILDA) testbed. (shrink)

Cooper storage is a widespread technique for associating sentences with their meanings, used in diverse linguistic and computational linguistic traditions. This paper encodes the data structures and operations of cooper storage in the simply typed linear \-calculus, revealing the rich categorical structure of a graded applicative functor. In the case of finite cooper storage, which corresponds to ideas in current transformational approaches to syntax, the semantic interpretation function can be given as a linear homomorphism acting on a (...) regular set of trees, and thus generation can be done in polynomial time. (shrink)

We introduce reference structures — a basic mathematical model of a data organization capable of storing and utilizing information about its addresses. A propositional labeled modal language is used as a specification and programming language for reference structures; the satisfiability algorithm for modal language gives a method of building and optimizing reference structures satisfying a given formula. Corresponding labeled modal logics are presented, supplied with cut free axiomatizations, completeness and decidability theorems are proved. Initialization of typed variables in some programming (...) languages is presented as an example of a reference structure building. (shrink)

In 1990, J.L. Krivine introduced the notion of storage operator to simulate, in $lambda$-calculus, the 'call by value' in a context of a 'call by name'. J.L. Krivine has shown that, using Gödel translation from classical into intuitionistic logic, we can find a simple type for storage operators in AF2 type system. In this present paper, we give a general type for storage operators in a slight extension of AF2. We give at the end (without proof) a (...) generalization of this result to other types. (shrink)

Storage operators are λ-terms which simulate call-by-value in call-by-name for a given set of terms. Krivine's storage operator theorem shows that any term of type ¬D → ¬D*, where D* is the Gödel translation of D, is a storage operator for the terms of type D when D is a data-type or a formula with only positive second order quantifiers. We prove that a new semantical version of Krivine's theorem is valid for every types. This also gives (...) a simpler proof of Krivine's theorem using the properties of data-types. (shrink)

We describe here a simple method in order to obtain programs from proofs in second-order classical logic. Then we extend to classical logic the results about storage operators proved by Krivine for intuitionistic logic. This work generalizes previous results of Parigot.