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:
In the paper is shown that, by using the circuit theory which operates with lumped parameters, it is possible to derive mathematical models of a high power salient pole synchronous machine (SPSM), that can take into account the basic processes of the machine. It offers results regarding the electromagnetic and mechanical stresses for a given practical application. The quantitative determinations were performed on an 8000 kW synchronous motor. The results of quantitative determinations are of essential interest in the designing stage, for dynamic characteristics and parameters derivation and for constructive solutions to be chosen.

Abstract:
We review the analytical methods of solving the stochastic equations for barrier-type dynamical behavior in plasma systems. The path-integral approach is examined as a particularly efficient method of determination of the statistical properties.

Abstract:
We propose a new phenomenology of the generation of internal transport barriers, based on the exact periodic solution of the Flierl-Petvishvili equation. We examine the stability of this solution and compare the late stages of the flow with the ensemble of vortices.

Abstract:
We describe a real-time video retrieval framework based on short text input in which weakly labelled training samples from the web are obtained, after the query is known. Concept discovery methods in such a setting train hundreds of detectors at test time and apply them to every frame in the video database. Hence, they are not practical for use in a text based video retrieval setting. We show that an efficient visual representation for a new query can be constructed on-line that enables matching against the test set in real-time. We evaluate a few combinations of encoding, pooling, and matching schemes that are efficient and find that such a system can be built with surprisingly simple and well-known components. We are not only able to construct and apply query models in real-time, but with the help of a re-ranking scheme, we also outperform state-of-the-art methods by a significant margin.

Abstract:
To identify the location of objects of a particular class, a passive computer vision system generally processes all the regions in an image to finally output few regions. However, we can use structure in the scene to search for objects without processing the entire image. We propose a search technique that sequentially processes image regions such that the regions that are more likely to correspond to the query class object are explored earlier. We frame the problem as a Markov decision process and use an imitation learning algorithm to learn a search strategy. Since structure in the scene is essential for search, we work with indoor scene images as they contain both unary scene context information and object-object context in the scene. We perform experiments on the NYU-depth v2 dataset and show that the unary scene context features alone can achieve a significantly high average precision while processing only 20-25\% of the regions for classes like bed and sofa. By considering object-object context along with the scene context features, the performance is further improved for classes like counter, lamp, pillow and sofa.

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:
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