Abstract:
We describe a method for efficiently hashing multiple messages of different lengths. Such computations occur in various scenarios, and one of them is when an operating system checks the integrity of its components during boot time. These tasks can gain performance by parallelizing the computations and using SIMD architectures. For such scenarios, we compare the performance of a new 4-buffers SHA-256 S-HASH implementation, to that of the standard serial hashing. Our results are measured on the 2nd Generation Intel^{?} Core^{TM} Processor, and demonstrate SHA-256 processing at effectively ~5.2 Cycles per Byte, when hashing from any of the three cache levels, or from the system memory. This represents speedup by a factor of 3.42x compared to OpenSSL (1.0.1), and by 2.25x compared to the recent and faster n-SMS method. For hashing from a disk, we show an effective rate of ~6.73 Cycles/Byte, which is almost 3 times faster than OpenSSL (1.0.1) under the same conditions. These results indicate that for some usage models, SHA-256 is significantly faster than commonly perceived.

Abstract:
The laurel tree was first appraised as a decorative plant because of its persistent, glossy and agreeably nuanced leaves , as well as by its small yellow flowers grouped in panicles of an attractive aspect. This paper followed the effect of radistim on striking roots at the cuttings of Laurus nobilis, observing a considerably increase of the rate of striking roots as well as an enhancement of the quality of the rooting process proved through the number of roots per cutting. The stimulation of the laurel tree cuttings root striking with the aid of the bio-stimulators of the radistim 2 type ensures a superior vegetation potential for the newly formed plants. The work method elaborated at the glass houses complex of Oradea, may contribute to the extension of the laurel tree as a culture in Romania.

Abstract:
Let be an arbitrary nonempty set and a lattice of subsets of such that , . ( ) denotes the algebra generated by , and ( ) denotes those nonnegative, finite, finitely additive measures on ( ). In addition, ( ) denotes the subset of ( ) which consists of the nontrivial zero-one valued measures. The paper gives detailed analysis of products of lattices, their associated Wallman spaces, and products of a variety of measures. 1. Introduction It is well known that given two measurable spaces and measures on them, we can obtain the product measurable space and the product measure on that space. The purpose of this paper is to give detailed analysis of product lattices and their associated Wallman spaces and to investigate how certain lattice properties carry over to the product lattices. In addition, we proceed from a measure theoretic point of view. We note that some of the material presented here has been developed from a filter approach by Kost, but the measure approach lends to a generalization of measures and to an easier treatment of topological style lattice properties. 2. Background and Notations In this section we introduce the notation and terminology that will be used throughout the paper. All is fairly standard, and we include it for the reader’s convenience. Let be an arbitrary nonempty set and a lattice of subsets of such that , . A lattice is a partially ordered set any two elements ( ) of which have both and . denotes the algebra generated by ; is the algebra generated by ; is the lattice of all countable intersections of sets from ; is the lattice of arbitrary intersections of sets from ; is the smallest class closed under countable intersections and unions which contains . 2.1. Lattice Terminology The lattice is called: -lattice if is closed under countable intersections; complement generated if implies , , (where prime denotes the complement); disjunctive if for and such that there exists with and ; separating (or ) if and implies there exists such that , ; if for and there exist such that , , and ; normal if for any with there exist with , , and ; compact if for any collection of sets of with , there exists a finite subcollection with empty intersection; countably compact if for any countable collection of sets of with , there exists a finite subcollection with empty intersection. 2.2. Measure Terminology denotes those nonnegative, finite, finitely additive measures on . A measure is called: -smooth on if for all sequences of sets of with , ; -smooth on if for all sequences of sets of with , , that is, countably additive. -regular if for

Abstract:
There are two types of decisions: given the estimated state of affairs, one decidesto change oneself in a certain way (that is best suited for the given conditions); given whatone is, one decides to change the state of affairs in a certain way (that is best suited for whatone wants for oneself). Jaynes' approach to decision theory accounts only for the first type ofdecisions, the case when one is just an observer of the external world and the decisiondoesn't change the world. However, many decisions involve the wish to transform theexternal environment. To account for this we need to add an additional step in Jaynes'proposed algorithm.

Abstract:
The question of whether the US critical care system is ready to handle various types of disasters is mentioned periodically [1]. Intensivists do not usually receive in-depth instruction in disaster medicine, even though they have increasing roles in managing hospital resources. The practice of limiting the training of critical care physicians to geographically described intensive care units (ICUs) only is questionable.At Montefiore Medical Center, our academic service has organized a number of missions and fielded functional specialized units for situations from earthquakes and burns disasters to mass military mobilization during the Gulf War [2,3]. Since disaster situations provide large experience in syndrome medicine (such as crush and blast injuries, inhalation burns, and toxicological threats), the state of the art in critical care response has been described elsewhere [4]. Critical care is clearly both flexible and interdisciplinary, and it adapts to many environments [5].Over the past 15 years, there has been increased collaboration between intensivists from countries that see a large number of suicide bombing attacks, as well as with intensivists in the US uniformed services who are increasingly involved in disaster response, ranging from joint exercises to mixed field teams. Yet our preparedness, as a specialty, for a major terrorist incident remains limited.Such an incident occurred on 11 September 2001 in New York City. Our team was notified during morning ICU rounds that the World Trade Center was under attack. An Incident Command Center was immediately established for the control of communication and authority. All ICU personnel at home were contacted and asked to report in for a staff meeting. The directors of critical care, emergency, and operating rooms immediately triaged all monitored beds and identified that 35 Level 1 ICU beds and 25 recovery room beds were available, in addition to the emergency room and operating room resources. No surgical cas

Abstract:
Let X be an arbitrary nonempty set and ￠ ’ a lattice of subsets of X such that ,X ￠ ￠ ’. ° ’ ( ￠ ’) is the algebra generated by ￠ ’ and ￠ 3( ￠ ’) denotes those nonnegative, finite, finitely additive measures on ° ’ ( ￠ ’). I( ￠ ’) denotes the subset of ￠ 3( ￠ ’) of nontrivial zero-one valued measures. Associated with ￠ I( ￠ ’) (or I ( ￠ ’)) are the outer measures ￠ € 2 and ￠ € 3 considered in detail. In addition, measurability conditions and regularity conditions are investigated and specific characteristics are given for ° ’ ￠ € 3, the set of ￠ € 3-measurable sets. Notions of strongly -smooth and vaguely regular measures are also discussed. Relationships between regularity, -smoothness and measurability are investigated for zero-one valued measures and certain results are extended to the case of a pair of lattices ￠ ’1, ￠ ’2 where ￠ ’1 ￠ ￠ ’2.

Abstract:
In this paper, we investigate M( ￠ ’) in case ￠ ’ is a normal lattice of subsets of X and we extend the results to ￠ ’1, ￠ ’2-lattices of subsets of X, such that ￠ ’1 ￠ ￠ ’2 and ￠ ’1 separates ￠ ’2. We define the outer measures ￠ € 2 and ￠ € 3 which prove very useful in proving some of the above results.

Abstract:
Let X be an arbitrary set and ￠ ’ a lattice of subsets of X such that ,X ￠ ￠ ’. ° ’ ( ￠ ’) is the algebra generated by ￠ ’ and I( ￠ ’) consists of all zero-one valued finitely additive measures on ° ’ ( ￠ ’). Various subsets of and I( ￠ ’) are considered and certain lattices are investigated as well as the topology of closed sets generated by them. The lattices are investigated for normality, regularity, repleteness and completeness. The topologies are similarly discussed for various properties such as T2 and Lindel f.