2890results about How to "Reduce storage" patented technology

Virtual machines of a virtual data center generate runtime instances with a software image, hardware configuration, management configuration and user / service configuration. Virtual data center resource use is monitored by reference to the management configuration of runtime instances, such as for environmental controls like power, cooling and balancing, or for policy limitations on users, software or hardware. Users or services generate runtime instances of stored virtual machines by reference to the user / service configuration, such as pricing or priority. In one example embodiment, the virtual machine software image comprises an application system preparation file that populates a read only application image common to plural virtual machines. Information unique to each virtual machine with respect to the application is maintained in the user / service configuration of the virtual machine and version information is maintained in the management configuration of the virtual machine. Updates to the application across each virtual machine are performed by updating the read only image or any of its configuration information for hardware configuration, management configuration or user / service configuration.

A speaker recognition system for authenticating a mobile device user includes an enrollment and learning software module, a voice biometric authentication software module, and a secure software application. Upon request by a user of the mobile device, the enrollment and learning software module displays text prompts to the user, receives speech utterances from the user, and produces a voice biometric print. The enrollment and training software module determines when a voice biometric print has met at least a quality threshold before storing it on the mobile device. The secure software application prompts a user requiring authentication to repeat an utterance based at least on an attribute of a selected voice biometric print, receives a corresponding utterance, requests the voice biometric authentication software module to verify the identity of the second user using the utterance, and, if the user is authenticated, imports the voice biometric print.

PCT No. PCT / EP95 / 03289 Sec. 371 Date Dec. 10, 1998 Sec. 102(e) Date Dec. 10, 1998 PCT Filed Aug. 18, 1995 PCT Pub. No. WO97 / 07472 PCT Pub. Date Feb. 27, 1997The inventive concept comprises a system platform for a synergistic, role modular work process environment. A work process object (WPO) (1001) is created, residing in a data base, and stored in a memory of the process and project management computer system (1030). All data concerning the process and project management are reported to said work process object (WPO) (1001) and said work process object (WPO) (1001) is used as a common data base. According to the inventive concept, each view must be supported by a specific workplace, represented by digital data and enforcing the rules for the specific role. A work process information model supports the dynamic definition and use of a data base object representing a work process, boch in its process and project planning modes and its execution. According to the inventive concept, one object supports simultaneously all modes delimited by dynamically moving boundaries. Workplace implementation enforces over-all rules for each role in the inventive system.

A rechargeable battery assembly comprises a rechargeable battery unit and a data and power connector plug. The battery assembly has a deployed configuration in which the battery assembly has the general form of and functions as a conventional battery format, and a recharge configuration in which the data and power connector plug is made accessible to enable said connector to be connected to a suitable receptacle on a computing or peripheral device for recharging of the battery.

A method, system and apparatus for routing data through a network based on the content or semantics of the data. Semantic routing engines route the data through the network based upon information maintained in routing tables. The routing tables used to route the content through the network are derived by aggregating information about either content consumers or content producers into ontological

A data chunking system divides data into predominantly fixed-sized chunks such that duplicate data may be identified. The data chunking system may be used to reduce the data storage and save network bandwidth by allowing storage or transmission of primarily unique data chunks. The system may also be used to increase reliability in data storage and network transmission, by allowing an error affecting a data chunk to be repaired with an identified duplicate chunk. The data chunking system chunks data by selecting a chunk of fixed size, then moving a window along the data until a match to existing data is found. As the window moves across the data, unique chunks predominantly of fixed size are formed in the data passed over. Several embodiments provide alternate methods of determining whether a selected chunk matches existing data and methods by which the window is moved through the data. To locate duplicate data, the data chunking system remembers data by computing a mathematical function of a data chunk and inserting the computed value into a hash table.

A method and system tracks objects using a surveillance database storing events acquired by a set of sensors and sequences of images acquired by a set of cameras. Sequences of temporally and spatially adjacent events sensed by the set of sensors are linked to form a set of tracklets and stored in the database. Each tracklet has endpoints being either a track-start, track-join, tracklet-merge or tracklet-end node. A subset of sensors is selected, and a subset of tracklets associated with the subset of sensors is identified. A single starting tracklet is selected. All sequences of tracklets temporally and spatially adjacent to the starting tracklet are aggregated to construct a tracklet graph. The track-join nodes and the track-split nodes are disambiguated and eliminated from the track graph to determine a track of the object in the environment.

A spanning storage interface facilitates the use of cloud storage services by storage clients and may perform data deduplication. The spanning storage interface may include local storage for caching data from storage clients. A disaster recovery application includes at least first and second spanning storage interfaces at first and second network locations. The second spanning storage interface is provided for at least disaster recovery operations. The second spanning storage interface includes second local storage for improving data access performance. A copy of the local cache of the first spanning storage interface is transferred to the second local storage while the first network location is operating. In the event of a disaster affecting the first network location, the second spanning storage interface can provide data access to the first network location's data with improved performance from using the copy of local cache in the second local storage.

A method, system and apparatus for routing data through a network based on the content or semantics of the data. Semantic routing engines route the data through the network based upon information maintained in routing tables. The routing tables used to route the content through the network are derived by aggregating information about either content consumers or content producers into ontological.

The defacto standard for text entry on standard telephone keypads, such as fixed phones, cell phones, fax machines, and the like is a multi-tap method where one of several letters associated to a input means is selected by pressing the input means a number of times equal to the position of the desired letter in the ordering of letters associated to the input means. Typically, for the standard alphabetic ordering, a large number of presses are required to obtain any given letter. The present invention uses prefix information to dynamically reorder the choices so that the average number of input means manipulations is reduced. This method is applicable to any language composed of strings of symbols for which the probability of any given symbol appearing in a string at a given position is correlated with the probability of another symbol appearing in the string. Using adapted data compression techniques, the amount of information which needs to be stored for excellent results on any given language can be kept small.

A method for inserting a digital signature into digital data is provided. The digital data has bits and the method includes the steps of: assigning predetermined bits of the digital data for receiving the digital signature; signing the digital data excluding the predetermined bits resulting in the digital signature; and inserting the digital signature into the predetermined bits of the digital data for subsequent authentication of the digital data. Also provided is a method for authenticating digital data having the embedded digital signature in the predetermined bits of the digital data including the steps of: extracting the digital signature from the predetermined bits; decrypting the digital signature from the digital data resulting in a first hash; applying a known one-way hashing function used by an encoder of the digital data to the digital data excluding the predetermined bits resulting in a second hash; and comparing the first hash to the second hash wherein if the first hash matches the second hash the digital data is authentic. In a preferred version of the methods of the present invention, the method further includes the step of inserting associated data into the digital data prior to the signing step such that the digital signature authenticates both the associated data as well as the digital data. Preferably, the associated data is inserted into the bits of the digital data excluding the predetermined bits.

A spanning storage interface facilitates the use of cloud storage services by storage clients. The spanning storage interface presents one or more data interfaces to storage clients at a network location, such as file, object, data backup, archival, and storage block based interfaces. The data interfaces allows storage clients to store and retrieve data using non-cloud based protocols. The spanning storage interface may perform data deduplication on data received from storage clients. The spanning storage interface may transfer the deduplicated version of the data to the cloud storage service. The spanning storage interface may include local storage for storing a copy or all or a portion of the data from storage clients. The local storage may be used as a local cache of frequently accessed data, which may be stored data in its deduplicated form.

A system and method is proposed for progressively quantizing channel state information for application in a MIMO (multiple input multiple output) communication system. A method includes computing an estimate of a communications channel between a subscriber unit and a base station, quantizing the estimate with a first codebook, thereby producing a first quantized estimate, quantizing an (n−1)-th quantized estimate with an n-th codebook, thereby producing an n-th quantized estimate, where n is an integer value ranging from 2 to R, R is a total number of quantizations of the estimate, wherein the n-th codebook is a localized codebook. The method also includes incrementing n, repeating the quantizing an (n−1)-th quantized estimate until n=R, and transmitting information based on the R quantized estimates to the base station.

The invention brings forward a streamlined acceleration system of an FPGA-based depth convolution neural network. The streamlined acceleration system is mainly formed by an input data distribution control module, an output data distribution control module, a convolution calculating sequence serialization realizing module, a convolution calculating module, a pooling calculating sequence serialization realizing module, a pooling calculating module, and a convolution calculating result distribution control module. Moreover, the streamlined acceleration system comprises an internal system cascade interface. Through the streamlined acceleration system designed by the invention, highly efficient parallel streamlined realization can be conducted on an FPGA, problems of resource waste and effective calculation delays caused by filling operations during calculation are effectively solved, the power consumption of the system is effectively reduced, and the operation processing speed is greatly increased.

The invention discloses a JPEG2000 self-adapting rate control system and a method based on pre-assignment of code rate, mainly solving the problem of large calculation amount and large memory size of JPEG2000 encoding method. The code block of the original image after pretreatment, wavelet transformation and quantification is output by two lines, one line directly enters the bit plane and MQ coder; for the other line, the entropy of each code block is estimated by the entropy estimate module, sent to the code rate assignment module to assign code rate, and the code rate of each code block is feed back to the bit plane and MQ coder through the encoding depth control module, after the code blocks are encoded by the bit plane, further feed back to the encoding depth control module to determine the output code stream of each encoded code block, and the output code stream is under optimal interception and code stream organization to output the ultimate code stream. At the same time, the invention can change the threshold value of the encoding depth control coefficient as required, to flexibly control the encoding depth in order to improve the image compression quality. The invention has the advantages of low complexity and easiness for hardware implementation, and is suitable for various JPEG2000 image real-time compression systems.

Methods, apparatuses and systems directed to a distributed data repository system including a plurality of symmetric data repository nodes. In certain embodiments of the present invention, the distributed data repository system is message-centric operative to store message payloads transmitted from client nodes. In certain embodiments, the distributed data repository system is BLOB-centric, maintaining binary data objects and indexes of attribute values that map to the binary data objects. Of course, the present invention can be utilized to store a great variety of digital data contained in message payloads. According to certain embodiments of the present invention, the attribute indexes are fully replicated across all data repository nodes, while the message payloads (e.g., data objects or other content) are exchanged across data repository nodes as needed to fulfill client queries. In this manner, each data repository node in the distributed system can fulfill any client request, while reducing the storage and memory requirements for each data repository node. The reduced storage and computational requirements enable each distributed data repository node to be hosted by an inexpensive hardware platform and, therefore, allow for the deployment of large numbers of distributed data repository nodes to achieve a distributed data repository system featuring high availability and reliability. In certain embodiments, each distributed data repository node is further equipped to act as an instant messaging (or other one-way messaging) server to allow client nodes to establish instant messaging connections with the data repository nodes in the distributed system.

The invention relates to a video monitoring device and a tracking and recording method based on a linkage camera. The monitoring device comprises a linkage camera device and a computer, wherein the linkage camera comprises a first camera arranged on a first movement control platform and a second camera arranged on a second movement control platform, and the second movement control platform is fixedly connected with the first camera to follow the first camera to synchronously move; and the computer is connected with the two cameras through a data communication interface and the two movement control platforms, controls the first camera to track and position a target entering a monitored area, controls the second camera to align the target and to capture the close-up details of the tracked target, and achieves video monitoring and intelligent recording of the target. The device not only can track and record a movement process of the target in the monitored area and the close-up details of the target, but also can normally work on a mobile carrier, track and record the target which enters the monitored area and keeps stationary for a long time, save memory space and reduce hardware cost.

The invention provides a vehicle license plate recognition method based on a video. According to the vehicle license plate recognition method based on the video, moving vehicles are detected and separated out with the vehicle video which is obtained through actual photographing by means of a camera serving as input, the accurate position of a vehicle license plate area is determined by conducting vertical edge extraction on a target vehicle image obtained after pre-processing, a vehicle license plate image is separated out, color correction, binaryzation and inclination correction are conducted on a vehicle license plate image, each character in the positioned vehicle license plate area is separated to serve as an independent character, feature extraction is conducted one each character, obtained feature vectors are classified through a classifier which is well trained in advance, a classification result serves as a preliminary recognition result, secondary recognition is conducted on the stained vehicle license plate characters according to a template matching algorithm imitating the visual characteristics of human eyes, and then a final vehicle license plate recognition result is obtained. The vehicle license plate recognition method based on the video has the advantages that hardware cost is reduced, the management efficiency of an intelligent transportation system is improved, the anti-jamming performance and the robustness are high, the recognition efficiency is high, and the recognition speed is high.

The storage system of the present invention has a simple configuration and ensures redundancy of the system. The primary storage control device and the first secondary storage control device are connected by a synchronous read method, and the primary storage control device and the second secondary storage control device are connected by an asynchronous read method. The primary storage control device sets a management number in the update data and saves a journal data. The primary storage control device associates the management number with the update data and transmits them to the first secondary storage control device. The first secondary storage control device writes the update data to the first secondary volume, associates the management number with the storage destination address of the update data and stores them in the maintenance table. If the primary storage control device stops, the first secondary storage control device becomes anew a primary storage control device. The first secondary storage control device is connected to the second secondary storage control device by an asynchronous read method.

The invention discloses a time series data storage method and apparatus, a time series data query method, apparatus and system, and an electronic device. The time series data storage method comprises the steps of acquiring to-be-stored time series data as original time series data, wherein attributes of the original time series data include a data identifier attribute, a time attribute and a data value attribute; performing statistics processing on the original time series data with the same data identifiers and the time in a preset time interval according to at least one preset time interval, forming a time series data statistics value of at least one time granularity based on the same data identifiers, and storing the original time series data and the time series data statistics values of all the time granularities in a distributed database. By adopting the method, the data storage amount can be effectively reduced, so that the effects of saving storage space and increasing data query speed are achieved; and the time series data is stored in the distributed database, so that the extensibility of the storage space can be effectively improved.

The invention provides a power weight quantification-based nerve network forward operation hardware structure comprising the following elements: an input buffer memory module used for caching input data and nerve network power weight transferred to a chip from a global memory, wherein the nerve network power weight comprises a convolution core and a full-connecting matrix; a computing module used for carrying out convolution and full-connecting matrix vector multiplying operation based on power weight quantification; an output buffer memory module used for caching the convolution and full-connecting matrix vector multiplying operational result obtained by the computing module; a control module used for carrying out data transfer and operational resource scheduling for the input buffer memory module, the computing module and the output buffer memory module. The power weight quantification-based nerve network forward operation hardware structure can effectively reduce the nerve network memory space, and can effectively reduce nerve network operational expenses, thus obviously improving the application space of the nerve network calculating system on the terminal equipment.

The invention discloses a high-speed signal acquisition, storage and playback device based on FPGA. The device is composed of a signal conditioning circuit, a high-speed A / D conversion circuit, an FPGA processing unit, an SDRAM, a NAND FLASH storage array, a USB 2.0 communication unit and upper computer software. In an acquisition mode, after being processed by the signal conditioning circuit, an analog signal is converted into a digital signal by the high-speed A / D conversion circuit, and the FPGA processing unit caches the digital signal, carries out lossless compression by using an LZW algorithm and then writes into the NAND FLASH storage array. In the signal playback mode, the FPGA reads data from the NAND FLASH, the USB 2.0 communication unit sends the data to the upper computer, and the upper computer software receives and analyzes the data.

The invention relates to a floor mopping robot and a cleaning path programming method. The cleaning path programming method comprises the following steps: establishing a plane coordinate system with the initial position of the floor mopping robot being a coordinate origin; establishing a blank map, the initial size of which is fixed but can be expanded, in the plane coordinate system, and dividingthe blank map into a plurality of areas, the size of each area being fixed; after the floor mopping robot receives a cleaning instruction, carrying out cleaning along a guide path, and in the cleaning process, if the robot encounters a wall, continuing to clean along the guide path after cleaning along the wall; if the robot encounters an obstacle, continuing to clean along the guide path after cleaning along the edge of the obstacle; and in the cleaning process, mapping the actually cleaned area and the established blank map to update a map. The floor mopping robot and the cleaning path programming method can enter an efficient cleaning mode directly at the beginning of cleaning, and then, update the map in the cleaning process, thereby preventing most of the repeated work, reducing cleaning repetition rate and improving cleaning coverage rate.

The invention provides a duplicated data deleting method applicable to cloud backup, which mainly comprises there levels of duplicated data deletion. In the first level, duplicated files are primarily deleted according to the modification time and the backup time of the files; in the second level, global file-based duplicated data is deleted; and in the third level, local block-based duplicated data is deleted. The duplicated data deleting method is progressive level by level, achieves excellent balance between data compression ration and duplicated date searching cost and has high ratio of the data compression ration to the searching cost; a large number of duplicated data is deleted within short time, the transmission and the storage of backup data are reduced, and the problems of overlarge backup window and high storage cost in a cloud backup system are solved.

A multi-dimensional blockchain protocol designed to self-fork into multiple chains, scale infinitely, achieve zero cost transactions, sub-second finality and open new markets for sharders, blobbers, developers, and content publishers, while managing a low inflation rate.

The invention discloses a distributed data storage system and method based on a blockchain. The method comprises: inputting a data content into a data storage module by a data inputting module, and using a hash algorithm to calculate an extract of the data content to store on the blockchain; receiving the data content by the data storage module, retrieving the extract corresponding to the data content, and storing the data content that is consistent with the extract; and when data querying is carried out, finding a stored queried data content by the data storage module, retrieving an extract corresponding to the data content, and returning the queried data content that is consistent with the corresponding extract to a querying node. According to the system and method, the blockchain is used in the information storage system, a Root-privilege administrator does not exist, no one can arbitrarily modify an information content without being detected, and reliable management and secure sharing of information are realized; and the blockchain is not directly used to store the data content, only the extract obtained by calculating by using the hash algorithm is stored, the amount of storage on the blockchain is reduced, low efficiency of the blockchain is avoided, and the practicality is improved.

An apparatus and method are disclosed for maintaining free buffer information for a network switch. A first Random Access Memory (RAM), located on the network switch, functions to store values that indicate whether or not free buffers, located in a second RAM, are available for storing received data frames. An input logic is provided for placing values in the first RAM to indicate which free buffers are available for storing the data frames. When free buffers are required to store data frames, the output logic searches the first RAM and locates values that indicate available free buffers in the second RAM. The output logic then generates buffer pointers that address the locations of the free buffers in the second RAM. The buffer pointers that are generated are stored in a small capacity queue on the network switch to provide immediate availability to free buffers.

The invention belongs to the technical filed of security inspection and relates to a vertical mechanical microwave scanning active imaging personnel security inspection system. By means of creative design and through adoption of a pair of horizontal detection arrays which are separately arranged in parallel on two sides or the front side and the back side of an inspected person in a vertical mode, vertical scanning imaging for the inspected person is conducted. Each detection array is in a shape of a straight array or a bow shape with two inwards folded heads or an arc shape or the like. Compared with an existing adopted vertical detection array active imaging personnel security inspection system, the vertical mechanical microwave scanning active imaging personnel security inspection system has the advantages that the number of transmit-receive components of the detection arrays can be reduced greatly and a system structure is simplified. Not only is convenience brought to storage, transportation, installation and usage but also system cost can be reduced.

The present invention provides a method and apparatus for data compression that includes representing each sub-pixel of each pixel with a pointer corresponding to an attribute of the sub-pixel, the attribute being a floating point binary number. An overall attribute of each pixel is then determined. The determining of the overall attribute of each tile may include any one of assigning the attribute of the sub-pixels to the overall attribute of the pixel when the sub-pixels are represented by an identical pointer, and resolving the overall attribute of the tile by the attributes of the sub-pixels when the sub-pixels are represented by non-identical pointers of the pixel.