Abstract: A harmonic protection method for a capacitor bank uses a harmonic protection apparatus, which includes a CPU unit, a current and voltage sampling unit, and a protection device. The CPU unit obtains effective value I1 of fundamental wave current of the capacitor bank, and effective value In of the n-th harmonic wave current of the capacitor bank, where n is harmonic order and ranges from 2 to ?, and calculates the true effective value I of current of the capacitor bank by I = I 1 2 + ? n = 2 ? ? k n ? I n 2 provided that kn=rn/r1, kn is the n-th harmonic coefficient, rn is power consumption equivalent resistance of the capacitor bank for the n-th harmonic, r1 is power consumption equivalent resistance of the capacitor bank at a fundamental frequency. When I?1.3 IN, the CPU unit controls the protecting device to disconnect the capacitor bank, provided that IN is a threshold current of the capacitor bank.

Abstract: An image is displayed from a transparent display according to a first signal. Light passing through the display is received, and a second signal is generated from the received light. A third signal is generated from the first signal and the second signal by eliminating data in the second signal corresponding to the image.

Abstract: Methods, systems, and computer programs are provided for failover responses to configuration node failures in SVC clusters. An SVC cluster manages a plurality of storage devices and includes a plurality of SVCs interconnected via a network, each SVC acting as a separate node. A storage device event log is saved, with an original configuration node. An entry is made in the storage device event log each time the original configuration node receives storage device events and setting the entry to a negative value indicating a storage device event has not been handled. The entry is set to a positive value indicating the storage device event has been handled after the original configuration node notifies respective subscribed clients about those of the storage device events the original configuration node receives. A new configuration node is activated in response to configuration node failures.

Abstract: Methods, systems, and computer programs are provided for failover responses to configuration node failures in SVC clusters. An SVC cluster manages a plurality of storage devices and includes a plurality of SVCs interconnected via a network, each SVC acting as a separate node. A storage device event log is saved, with an original configuration node. An entry is made in the storage device event log each time the original configuration node receives storage device events and setting the entry to a negative value indicating a storage device event has not been handled. The entry is set to a positive value indicating the storage device event has been handled after the original configuration node notifies respective subscribed clients about those of the storage device events the original configuration node receives. A new configuration node is activated in response to configuration node failures.

Abstract: Methods, systems, and computer programs are provided for failover responses to configuration node failures in SVC clusters. An SVC cluster manages a plurality of storage devices and includes a plurality of SVCs interconnected via a network, each SVC acting as a separate node. A storage device event log is saved, with an original configuration node. An entry is made in the storage device event log each time the original configuration node receives storage device events and setting the entry to a negative value indicating a storage device event has not been handled. The entry is set to a positive value indicating the storage device event has been handled after the original configuration node notifies respective subscribed clients about those of the storage device events the original configuration node receives. A new configuration node is activated in response to configuration node failures.

Abstract: A harmonic protection method for a capacitor bank uses a harmonic protection apparatus, which includes a CPU unit, a current and voltage sampling unit, and a protection device. The CPU unit obtains effective value I1 of fundamental wave current of the capacitor bank, and effective value In of the n-th harmonic wave current of the capacitor bank, where n is harmonic order and ranges from 2 to ?, and calculates the true effective value I of current of the capacitor bank by I = I 1 2 + ? n = 2 ? ? k n ? I n 2 provided that kn=rn/r1, kn is the n-th harmonic coefficient , rn is power consumption equivalent resistance of the capacitor bank for the n-th harmonic, r1 is power consumption equivalent resistance of the capacitor bank at a fundamental frequency. When I?1.3 IN, the CPU unit controls the protecting device to disconnect the capacitor bank, provided that IN is a threshold current of the capacitor bank.

Abstract: Methods, systems, and computer programs are provided for failover responses to configuration node failures in SVC clusters. An SVC cluster manages a plurality of storage devices and includes a plurality of SVCs interconnected via a network, each SVC acting as a separate node. A storage device event log is saved, with an original configuration node. An entry is made in the storage device event log each time the original configuration node receives storage device events and setting the entry to a negative value indicating a storage device event has not been handled. The entry is set to a positive value indicating the storage device event has been handled after the original configuration node notifies respective subscribed clients about those of the storage device events the original configuration node receives. A new configuration node is activated in response to configuration node failures.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for determining a resource's reachability score. In one aspect, a method includes identifying one or more secondary resources reachable through one or more links of a primary resource wherein the secondary resources are within a number of hops from the primary resource; determining an aggregate score for the primary resource based on respective scores of the secondary resources wherein each one of the respective scores is calculated based on prior user interactions with a respective secondary resource; and providing the aggregate score as an input signal to a resource ranking process for the primary resource when the primary resource is represented as a search result responsive to a query.

Abstract: Methods, systems, and computer programs are provided for failover responses to configuration node failures in SVC clusters. An SVC cluster manages a plurality of storage devices and includes a plurality of SVCs interconnected via a network, each SVC acting as a separate node. A new configuration node is activated in response to configuration node failures. The new configuration node retrieves client subscription information about events occurring in storage devices managed by the SVC cluster from the storage devices. In response to events occurring in the storage device managed by the SVC cluster, the new configuration node obtains storage device event information from a storage device event monitoring unit. The new configuration node sends storage device events to clients who have subscribed to this information according to subscription information obtained. The storage device is not installed in the original configuration node.

Abstract: Disclosed in the present invention is a coordinated scheduling method which includes that: a base station establishes the correspondences between sub-bands and spatial information, and communicates the correspondences between sub-bands and spatial information with the base station of a cooperative cell (301); said base station implements coordinated scheduling with the base station of said cooperative cell according to the correspondences between sub-bands and spatial information (302). The present invention implements that less scheduling information is transmitted via an X2 interface, and thus promotes the application of the CBF solution in an actual system.

Abstract: Methods, systems, and computer programs are provided for failover responses to configuration node failures in SVC clusters. An SVC cluster manages a plurality of storage devices and includes a plurality of SVCs interconnected via a network, each SVC acting as a separate node. A new configuration node is activated in response to configuration node failures. The new configuration node retrieves client subscription information about events occurring in storage devices managed by the SVC cluster from the storage devices. In response to events occurring in the storage device managed by the SVC cluster, the new configuration node obtains storage device event information from a storage device event monitoring unit. The new configuration node sends storage device events to clients who have subscribed to this information according to subscription information obtained. The storage device is not installed in the original configuration node.

Abstract: Arrangements and methods for providing for the efficient implementation of ranked keyword searches on graph-structured data. Since it is difficult to directly build indexes for general schemaless graphs, conventional techniques highly rely on graph traversal in running time. The previous lack of more knowledge about graphs also resulted in great difficulties in applying pruning techniques. To address these problems, there is introduced herein a new scoring function while the block is used as an intermediate access level; the result is an opportunity to create sophisticated indexes for keyword search. Also proposed herein is a cost-balanced expansion algorithm to conduct a backward search, which provides a good theoretical guarantee in terms of the search cost.

Abstract: Methods and apparatus generate an index for use in a document retrieval system where the index is organized by type and keyword. Redundancy in the index is reduced by organizing type entries in a hierarchy of internal and leaf nodes. Determining whether to generate an inverted list for a type is based on the position of the type in the hierarchy; generally inverted lists are generated only for types corresponding to leaf nodes. Redundancy is further reduced by re-using inverted lists generated for keywords for types when there is an overlap between keywords and types. Search performance using the document retrieval index is improved by adding entries corresponding to combinations of keywords and types. The intersections of inverted lists associated with the keywords and types comprising the combinations are determined and added to the index for use in search operations.

Abstract: There is provided a method for determining reachability between any two nodes within a graph. The inventive method utilizes a dual-labeling scheme. Initially, a spanning tree is defined for a group of nodes within a graph. Each node in the spanning tree is assigned a unique interval-based label, that describes its dependency from an ancestor node. Non-tree labels are then assigned to each node in the spanning tree that is connected to another node in the spanning tree by a non-tree link. From these labels, reachability of any two nodes in the spanning tree is determined by using only the interval-based labels and the non-tree labels.

Abstract: Methylene substituted aromatic compounds can be oxidized using t-butyl hydroperoxide and microwave radiation. In particular, xylenes give primarily phthalic acids, while toluene gives benzoic acid. Other methylene substituted aromatic compounds where the methylene group is not part of a methyl group give ketones, rather than acids. For example, fluorene gives fluorenone. The process avoids the need for the presence of metals such as in catalysts or in oxidizing agents, and can be carried out using water rather than an organic solvent. Thus the process can conform with the ideals of green chemistry.

Abstract: Arrangements and methods for providing for the efficient implementation of ranked keyword searches on graph-structured data. Since it is difficult to directly build indexes for general schemaless graphs, conventional techniques highly rely on graph traversal in running time. The previous lack of more knowledge about graphs also resulted in great difficulties in applying pruning techniques. To address these problems, there is introduced herein a new scoring function while the block is used as an intermediate access level; the result is an opportunity to create sophisticated indexes for keyword search. Also proposed herein is a cost-balanced expansion algorithm to conduct a backward search, which provides a good theoretical guarantee in terms of the search cost.

Abstract: The invention relates to a method for using portable electronic equipment, which comprises a digital camera or can be used with a digital camera, to scan a surface containing text and/or drawings or sketches. According to the method, a digital photograph, which comprises the surface to be scanned, is taken with the digital camera of the electronic device. The text and/or drawings or sketches of the surface to be scanned are transferred to a digital image file, maintaining both their own and their mutual spatial arrangement. The effects that appear during the creation of the photograph comprising the surface to be scanned and that have a detrimental effect on the image, for example geometric distortion, lack of focus, blurring, shadows and/or light reflection effects, digital noise, lack of contrast and/or colorimetric shift, are removed or compensated.

Abstract: There is provided a method for determining reachability between any two nodes within a graph. The inventive method utilizes a dual-labeling scheme. Initially, a spanning tree is defined for a group of nodes within a graph. Each node in the spanning tree is assigned a unique interval-based label, that describes its dependency from an ancestor node. Non-tree labels are then assigned to each node in the spanning tree that is connected to another node in the spanning tree by a non-tree link. From these labels, reachability of any two nodes in the spanning tree is determined by using only the interval-based labels and the non-tree labels.

Abstract: A method which identifies different types of substructures within a graph and encodes them using techniques suitable to the characteristics of each of them. The method is embodied by an efficient two-phase algorithm, where the first phase identifies and encodes strongly connected components as well as tree substructures, and the second phase encodes the remaining reachability relationships by compressing dense rectangular submatrices in the transitive closure matrix.