Abstract: A method for searching related terms first calculates a direct relationship between every two of a plurality of query terms to obtain a direct related matrix, and calculates a related score between every two of the query terms to obtain a related score matrix. The method further calculates an indirect relationship between every two of the query terms according to the direct relationship and the related score, and determines indirect terms of each query term according to the indirect relationship between every two of the query terms.

Abstract: A method for filtering noise in an image filters noise pixels in a discrepant block between a current image and a background image firstly, and further filter each small block whose area is less than a preset value from the discrepant block. The method further calculates a total area of each big block whose area is greater than or equal to the preset value from the discrepant block, and adds the current image to a background list of the current image if the total area is less than another preset value.

Abstract: A method for merging separated pixel blocks into an integral image of an object is provided. The method performs binary image processing on an obtained image to obtain a binary image, finds pixel blocks in the binary image whose area is greater than a first preset value, and stores a position and a size of each found pixel block in a data structure. The method further merges two pixel blocks in the data structure if a distance between the two pixel blocks is less than a second preset value, so as to generate the integral image of the object.

Abstract: A method for accessing attribute data of virtual machines using a control computer. The method generates a control command for accessing the virtual machines of a host computer, determines a command type of the control command, obtains attribute data of a first type of the virtual machines from a database of the control computer if the command type is a first type and the control command is a data query command. The method transmits the control command to a virtual machine manager of the host computer if the command type is a second type, and receives attribute data of a second type of the virtual machines returned from the virtual machine manager of the host computer.

Abstract: In a method for managing power of host computers using a control computer, the method generates a power management command, groups virtual machines installed in the host computers at a first time if the power management command is a first type, to obtain a first group of the virtual machines. The method further relocates the virtual machines in the host computers based on the first group of the virtual machines, and closes idle host computers. Closed host computers are powered on if the power management command is the second type, all the virtual machines at a second time are grouped, to obtain a second group of the virtual machines. The virtual machines are relocated into each host computer based on the second group of the virtual machines.

Abstract: A method for storing node information of a Huffman tree. The method creates an index of each node in the Huffman tree using a breadth first search (BFS) algorithm. The method further reads each node of the Huffman tree beginning from a root node according to a sequence of the index of each node, and stores node information of each node into an array of the Huffman tree.

Abstract: A remote computer and method monitors a resource utilization rate of a cloud server of a datacenter. The remote computer obtains a resource utilization rate of each of virtual machines installed in the cloud server. The remote computer calculates the resource utilization rate of the cloud server according to the resource utilization rate of each of the virtual machines. The remote computer transfers one or more virtual machines from the cloud server to other cloud servers until the resource utilization rate of the cloud server is equal to or less than the predetermined resource utilization rate.

Abstract: An interpersonal relationships analysis method and system obtains an album comprising a plurality of photos, and recognize faces in each of the plurality of photos. The method and system further selects one of the recognized faces, matches the selected face with portraits stored in a person management database, so as to obtain basic information of a person with the selected face from the person management database. The method and system then analyzes an interpersonal relationship of the person with the selected face according to the album, and shows the interpersonal relationship of the person with the selected face.

Abstract: A method for storing node information of a Huffman tree. The method creates an index of each node in the Huffman tree using a breadth first search (BFS) algorithm. The method further reads each node of the Huffman tree beginning from a root node according to a sequence of the index of each node, and stores node information of each node into an array of the Huffman tree.

Abstract: A method for filtering noise in an image filters noise pixels in a discrepant block between a current image and a background image firstly, and further filter each small block whose area is less than a preset value from the discrepant block. The method further calculates a total area of each big block whose area is greater than or equal to the preset value from the discrepant block, and adds the current image to a background list of the current image if the total area is less than another preset value.

Abstract: A method for filtering noise in an image filters noise pixels in a discrepant block between a current image and a background image firstly, and further filter each small block whose area is less than a preset value from the discrepant block. The method further calculates a total area of each big block whose area is greater than or equal to the preset value from the discrepant block, and adds the current image to a background list of the current image if the total area is less than another preset value.

Abstract: A method for searching related terms first calculates a direct relationship between every two of a plurality of query terms to obtain a direct related matrix, and calculates a related score between every two of the query terms to obtain a related score matrix. The method further calculates an indirect relationship between every two of the query terms according to the direct relationship and the related score, and determines indirect terms of each query term according to the indirect relationship between every two of the query terms.

Abstract: A method for performing file search using a control computer receives an initial query expression from a client computer, divides the initial query expression into one or more keywords, determines related terms corresponding to each keyword, merges the keywords and the related terms to obtain an updated query expression, and generates search results according to the updated query expression. The method further calculates relevance scores among a plurality of documents in the search results and the updated query expression, ranks the documents in the search results according to the relevance scores, and displays the documents in the search results with the ranked order.

Abstract: A method for seeking a file position of a file first seeks an estimated file position corresponding to a specified time point in the file, and adjusts the estimated file position according to a preset estimation formula. The method further determines the estimated file position is an accurate file position of the specified time point in the file until a difference between the estimated file position and the specified time point is less than a preset value.

Abstract: A method for encoding images receives a specified type of an image request from a terminal device, obtains encoded images from a storage device of the server directly upon the condition that the image request has been processed. The method further adds a task into a coder of the server to process the image request upon the condition that the image request has not been processed, encodes captured images by the coder according to the image request, stores the encoded images and the corresponding specified type of the image request in the storage device, and outputs the encoded images to the terminal device.

Abstract: A method for protecting electronic keys sets a plurality of hash functions, divides an electronic key into a plurality of key segments, creates a data storage structure for each of the key segments, and calculates a hash address for each of the key segments of the electronic key using each of the hash functions. The method further obtains a plurality of hash addresses of the plurality of key segments corresponding to the plurality of hash functions, stores information of the data storage structure of each key segment in a hash table according to the hash address of the key segment corresponding to one of the hash functions.

Abstract: A method for parsing a text file defines a tree pattern and a plurality of character string patterns. A tree structure corresponding to the text file is determined according to the tree pattern, and the desired data are retrieved from the text file according to the character string patterns. The retrieved desired data are output into a storage system.

Abstract: A method for seeking a file position of a file first seeks an estimated file position corresponding to a specified time point in the file, and adjusts the estimated file position according to a preset estimation formula. The method further determines the estimated file position is an accurate file position of the specified time point in the file until a difference between the estimated file position and the specified time point is less than a preset value.

Abstract: A method for storing node information of a Huffman tree. The method creates an index of each node in the Huffman tree using a breadth first search (BFS) algorithm. The method further reads each node of the Huffman tree beginning from a root node according to a sequence of the index of each node, and stores node information of each node into an array of the Huffman tree.

Abstract: A method for improving display speed of decoding video bit streams obtains the video bit streams from a storage system of a computer by a decoder, and decodes the video bit streams in a display block of a memory of the computer to obtain decoded images by the decoder. The method further selects an image from the decoded images by the decoder, and updates a reference image stored in a buffer block of the memory with the selected image.