Abstract: A centrifugal blower includes a centrifugal fan having a fan wheel that is configured to rotate about a rotational axis. The centrifugal blower includes a blower housing having a first side panel, a second side panel, and a wall extending about the rotational axis and between the first and second side panels. The centrifugal blower also includes a cutoff plate that is configured to extend about the rotational axis, where the cutoff plate includes a first end with a flange having a camber geometry and a second end that is configured to overlap with the wall such that an amount of overlap between the second end and the wall is adjustable to adjust a position of the flange relative to the fan wheel. The centrifugal blower further includes an exhaust port defined by the first side panel, the second side panel, the wall, and the flange.

Abstract: A centrifugal blower includes a centrifugal fan having a fan wheel, the fan wheel has a rotational axis and blades extending radially outwardly from the fan wheel, a blower housing including a first panel and a second panel disposed on opposite sides of the centrifugal fan and extending transverse to the rotational axis of the fan wheel, and further including a wall extending about the rotational axis and between the first panel and the second panel, where the wall includes a flange having a cross-sectional camber geometry, an intake passage extending through the first panel and facilitating fluid flow into the fan wheel, and an outlet of the housing facilitating fluid flow out of the housing, the outlet formed by the first panel, the second panel, and the wall, where the flange extends outwardly from the outlet.

Abstract: Techniques for scheduling search queries in a computing environment are disclosed. A search query scheduling system associates a first set of queries with a first skew tolerance, the first set of queries scheduled to be performed during a first period, where the first skew tolerance is based on a duration of the first period. The search query scheduling system reschedules a first subset of search queries included in the first set of queries by skewing the first subset of search queries over a first portion of the first period based on the first skew tolerance.

Abstract: Embodiments are disclosed for a prefetching method that may include copying, in response to a search query, a first bucket from a remote storage to a cache. The first bucket may include first data associated with the search query. The method may further include identifying a first file type associated with a first file in the first bucket. The first file may be associated with a usage status. The method may further include accessing, based on the search query, a second bucket from the remote storage. The second bucket may include second data associated with the search query. The method may further include identifying a second file in the second bucket having the first file type, and copying, in response to the usage status indicating that the first file was used in processing the search query, the second file from the remote storage to the cache.

Abstract: Embodiments are disclosed for performing cache aware searching. In response to a search query, a first bucket and a second bucket in remote storage for processing the search query. A determination is made that a first file in the first bucket is present in a cache when the search query is received. In response to the search query, a search is performed using the first file based on the determination that the first file is present in the cache when the search query is received, and the search is performed using a second file from the second bucket once the second file is stored in the cache.

Abstract: Embodiments are disclosed for a prefetching method that may include copying, in response to a search query, a first bucket from a remote storage to a cache. The first bucket may include first data associated with the search query. The method may further include identifying a first file type associated with a first file in the first bucket. The first file may be associated with a usage status. The method may further include accessing, based on the search query, a second bucket from the remote storage. The second bucket may include second data associated with the search query. The method may further include identifying a second file in the second bucket having the first file type, and copying, in response to the usage status indicating that the first file was used in processing the search query, the second file from the remote storage to the cache.

Abstract: Embodiments are disclosed for performing cache aware searching. In response to a search query, a first bucket and a second bucket in remote storage for processing the search query. A determination is made that a first file in the first bucket is present in a cache when the search query is received. In response to the search query, a search is performed using the first file based on the determination that the first file is present in the cache when the search query is received, and the search is performed using a second file from the second bucket once the second file is stored in the cache.

Abstract: Techniques for scheduling search queries in a computing environment are disclosed. A search query scheduling system associates a first set of queries with a first skew tolerance, the first set of queries scheduled to be performed during a first period, where the first skew tolerance is based on a duration of the first period. The search query scheduling system reschedules a first subset of search queries included in the first set of queries by skewing the first subset of search queries over a first portion of the first period based on the first skew tolerance.

Abstract: Embodiments are disclosed for a prefetching method that may include copying, in response to a search query, a first bucket from a remote storage to a cache. The first bucket may include first data associated with the search query. The method may further include identifying a first file type associated with a first file in the first bucket. The first file may be associated with a usage status. The method may further include accessing, based on the search query, a second bucket from the remote storage. The second bucket may include second data associated with the search query. The method may further include identifying a second file in the second bucket having the first file type, and copying, in response to the usage status indicating that the first file was used in processing the search query, the second file from the remote storage to the cache.

Abstract: Embodiments are disclosed for performing cache aware searching. In response to a search query, a first bucket and a second bucket in remote storage for processing the search query. A determination is made that a first file in the first bucket is present in a cache when the search query is received. In response to the search query, a search is performed using the first file based on the determination that the first file is present in the cache when the search query is received, and the search is performed using a second file from the second bucket once the second file is stored in the cache.

Abstract: Embodiments are disclosed for a prefetching method that may include copying, in response to a search query, a first bucket from a remote storage to a cache. The first bucket may include first data associated with the search query. The method may further include identifying a first file type associated with a first file in the first bucket. The first file may be associated with a usage status. The method may further include accessing, based on the search query, a second bucket from the remote storage. The second bucket may include second data associated with the search query. The method may further include identifying a second file in the second bucket having the first file type, and copying, in response to the usage status indicating that the first file was used in processing the search query, the second file from the remote storage to the cache.

Abstract: Embodiments are disclosed for performing cache aware searching. In response to a search query, a first bucket and a second bucket in remote storage for processing the search query. A determination is made that a first file in the first bucket is present in a cache when the search query is received. In response to the search query, a search is performed using the first file based on the determination that the first file is present in the cache when the search query is received, and the search is performed using a second file from the second bucket once the second file is stored in the cache.

Abstract: Systems and methods in accordance with the present invention provide for an implementation of the XQuery standard, and such an implementation will be referred to herein as an XQuery (XML Query language) implementation. An XQuery implementation can be based on a token stream representation, which allows large XML documents to be processed without having to first read the entire document. An XQuery implementation can also utilize a streaming XQuery engine. A set of algorithms and a set of rewrite rules can be used for the implementation. Given a query, a set of rules can be applied to that query to transform the query into another query. Some of these rules allow the resulting query to be streamable. In other words, a query that would otherwise require an XML document to be read into memory can now be transformed into a query that can work on an XML stream. The type system of the XQuery language can be based on XML Schema, and the basic types of XML Schema can have derived types.

Abstract: The invention provides systems and methods for implementation of a computer language type system by augmenting finite state automata algorithms to accommodate symbols having both subtype relationships and nested types. To make the classical automata algorithms work for type system with subtypes, finite state automata for a data type is augmented by additional transitions that include secondary symbols, wherein secondary symbols are subtypes of symbols of alphabet of finite state automata. A data type when compared to another data type must compare both names and the contents.

Abstract: Systems and methods in accordance with the present invention provide for an implementation of the XQuery standard, and such an implementation will be referred to herein as an XQuery (XML Query language) implementation. An XQuery implementation can be based on a token stream representation, which allows large XML documents to be processed without having to first read the entire document. An XQuery implementation can also utilize a streaming XQuery engine. A set of algorithms and a set of rewrite rules can be used for the implementation. Given a query, a set of rules can be applied to that query to transform the query into another query. Some of these rules allow the resulting query to be streamable. In other words, a query that would otherwise require an XML document to be read into memory can now be transformed into a query that can work on an XML stream. The type system of the XQuery language can be based on XML Schema, and the basic types of XML Schema can have derived types.

Abstract: A human engineer using a computer system can maintain numerous software services and packages installed on a number of servers through a single master server and a computer network. Each software service and package is represented in a package and service template datastore 120 in templatized form. The installation template includes placeholder data which represents server-specific information used to install the computer software. The placeholder is included in program modules, configuration data files, and/or installation scripts. To install the computer software on the selected server computer, a master server retrieves server-specific information for the selected server, substitutes the retrieved server-specific data for the placeholder data to form server-specific installation data, and transports the server-specific installation data to the selected server for execution.

Abstract: A human engineer using a computer system can maintain numerous software services and packages installed on a number of servers through a single master server and a computer network. Each software service and package is represented in a package and service template datastore in a templatized form in which server-specific information is represented by placeholder data. To install a service or package on a destination server computer, data specific to the destination server is substituted for the corresponding placeholder data in program modules, configuration data files, and installation scripts and the program modules, configuration data files, and installation scripts are transported to the destination server where the installation scripts are executed.

Abstract: A library of C++ classes for use in writing data visualization programs. The library embodies a general design principle for class libraries: that the classes are partitioned into entity classes and functionality classes. Entity classes in the library specify properties of areas in a display and the functionality classes specify functionalities which the areas may have, for example, being responsive to the mouse or the keyboard or being capable of executing drawing commands. The classes are narrowly defined, and when the C++ programmer specifies a class for an object, he or she can give the object exactly the desired properties by selecting from among the area classes and the functionality classes. Because properties are acquired by inheritance, code generated using the libraries is shorter and faster than code generated using conventional class libraries.