Abstract: A computerized method for multi-level data resolution based upon searches of the hierarchically organized elements comprises receiving a database query directed towards returning information from one or more locations within a hierarchically organized data structure. The method can also comprise generating a summary of the information that conforms with the query and a first filter condition. Additionally, the method can comprise receiving a request for a detailed view of the information in the summary. Upon receiving the request the method can include generating a detailed accounting of the information that conforms with the query and a second filter condition. Additionally, the second filter condition can be different from the first filter condition.

Abstract: A server computer system receives a database query comprising multiple query fields. At least one of the query fields is directed towards information stored within a first hierarchal tree, and another of the query fields is directed towards information stored within a separate, second hierarchal tree. The server computer system can then access one or more files containing the first hierarchal tree and the second hierarchal tree. After accessing the hierarchal trees, the server computer system can identify a first group of query fields that are contained within the first hierarchal tree and a second group of query fields that are not contained within the first hierarchal tree. The first group of query fields and the second group of query fields are selected from the multiple query fields and the at least one of the query fields is within the first group of query fields.

Abstract: A computerized method for efficiently storing data entries within a database can comprise identifying a particular number of records within a hierarchical tree, which records can comprise fields. The method can also comprise writing to storage at least a portion of the fields of the hierarchical tree in a flat file order that is directly related to the order of records in the hierarchical tree. Writing to storage at least a portion of the fields of the hierarchical tree can comprise disregarding a plurality of fields that contains a particular value so that the disregarded plurality of fields do not exist in storage. Additionally, the method can comprise reading the tree so that when encountering a field not found in storage the field is designated for that record as containing the particular value.

Abstract: A server computer system can receive a database query comprising a request to return a calculated result based upon information stored in multiple entries within the hierarchically organized data structure. The server computer system accesses an ordered flat file database that comprises information stored within the hierarchically organized data structure. The information can include information associating each entry within the ordered flat file database with the entry's relative position within the hierarchically organized data structure. The server computer system can identify a first branch within the hierarchically organized data structure by reading the ordered flat file database progressively. The computer server system can then push one or more data entries upward within the first branch. Additionally, the computer system can identify a second branch within the hierarchically organized data structure by continuing to read the ordered flat file database progressively.

Abstract: A server computer system can receive a database query directed towards returning information from one or more locations within a hierarchically organized data structure. A user identification can be associated with a particular entry within the hierarchically organized data structure. The system can then access an ordered flat file database that comprises the information stored within the hierarchically organized data structure. The stored information can include information associating each entry within the hierarchically organized data structure with the entry's relative position within the hierarchically organized data structure. The system can also return a query response that excludes particular information based upon a permission attribute applied to sequential entries within the ordered flat file database.

Abstract: An intrusion detection system comprises a pair of optical lenses arranged a predetermined distance apart and having overlapping fields of view within an area to be monitored to form a common field of view; at least one light-sensitive device responsive to light from each of the optical lenses; a range detector responsive to signals from the light-sensitive device and operable to determine a range to an object within the common field of view; and a range discriminator for setting at least one range gate to sense objects within the common field of view at predetermined ranges and for ignoring objects outside of the predetermined ranges.

Abstract: Monovinylarene-conjugated diene copolymer compositions that comprise at least one erucamide and at least one stearamide or behenamide exhibit reduced blocking.

Abstract: We disclose a monovinylarene/conjugated diene block copolymer, comprising: (i) a random (conjugated dienex/monovinylareney)m block, wherein x is about 2.5 wt % to about 10 wt %, y is from about 90 wt % to about 97.5 wt %, and x+y is about 97.5 wt % to 100 wt %; and (ii) a (conjugated diene)n block; wherein n is from about 20 wt % to about 30 wt %, m is from about 70 wt % to about 80 wt %, and m+n is from about 90 wt % to 100 wt %. We also disclose a method of forming the block copolymer and a method for fabricating an article from the block copolymer. The block copolymer typically exhibits a Tg at least about 10° C. less than the Tg of a reference polymer differing only in that x is about 0 wt % and y is about 100 wt %.