51st week of 2017 patent applcation highlights part 46 |
Patent application number | Title | Published |
20170364446 | COMPRESSION AND CACHING FOR LOGICAL-TO-PHYSICAL STORAGE ADDRESS MAPPING TABLES - A storage device that maps logical addresses to physical addresses includes a memory that stores machine instructions and a processor coupled to the memory that executes the machine instructions to store a compressed mapping table in the memory. The compressed mapping table correlates logical addresses to locations in a storage. The storage device also stores a bundle of uncompressed mapping table entries starting at a first location in a cache and maps a first logical address associated with the uncompressed mapping table entry to the first location. | 2017-12-21 |
20170364447 | READ CACHE MANAGEMENT - Implementations disclosed herein provide for a storage system including an on-disk read cache and a variety of read cache management techniques. According to one implementation, a storage device controller time-sequentially reads a series of non-contiguous data blocks storing a data sequence in a read cache of a magnetic disk, the data sequence identified by a requested sequence of logical block addresses (LBAs). The controller determines that read requests for the data sequence satisfy at least one predetermined access frequency criterion and, responsive to the determination, the controller re-writes data of the data sequence to a series of contiguous data blocks in the read cache. | 2017-12-21 |
20170364448 | SELECTIVE SPACE RECLAMATION OF DATA STORAGE MEMORY EMPLOYING HEAT AND RELOCATION METRICS - Space of a data storage memory of a data storage memory system is reclaimed by determining heat metrics of data stored in the data storage memory; determining relocation metrics related to relocation of the data within the data storage memory; determining utility metrics of the data relating the heat metrics to the relocation metrics for the data; and making the data whose utility metric fails a utility metric threshold, available for space reclamation. | 2017-12-21 |
20170364449 | PROCESS RUNNING METHOD AND APPARATUS - A process running method and apparatus is disclosed. The method is: selecting a code page from a candidate process, storing only a code page of the candidate process into a swap partition, and releasing memory space occupied by the code page; updating a physical address that is of the code page and that is stored into a page entry; and when it is determined that the candidate process to which the code page belongs needs to be run, if the code page needs to be executed, directly executing the code page in the swap partition. | 2017-12-21 |
20170364450 | IMMUTABLE DATASTORE FOR LOW-LATENCY READING AND WRITING OF LARGE DATA SETS - Provided is a process including: receiving a write command requesting that a document associated with the write command be stored in an immutable data structure that prevents an attacker attempting to modify the document from concealing that the document was modified after storing the document in the data structure; forming a tamper-evident, immutable directed acyclic graph having the document in one or more nodes of the graph; and storing the directed acyclic graph. | 2017-12-21 |
20170364451 | OPERATING SYSTEM INTEGRATED APPLICATION ISOLATION - A system, method, and apparatus for operating system integrated application isolation. A snapshot manager creates a snapshot table including one or more pointers to a file system storage. Then an application is installed on an operating system and mapped to a snapshot table. The snapshot manager receives a request by the application to access a memory block. The snapshot manager determines whether the application has permission to access the memory block. Responsive to a determination that the application has permission to access the memory block, the snapshot manager permits access to the memory block. | 2017-12-21 |
20170364452 | TIMELY RANDOMIZED MEMORY PROTECTION - In a system executing a program, a method comprises detecting one or more input/output calls associated with the program and re-randomizing memory associated with the program in response to the one or more input/output calls. A related system is also described. | 2017-12-21 |
20170364453 | Loading control method and system storage device - A loading control method and system for a storage device are disclosed. The method comprises: judging whether a storage controller is valid through a first bus, and judging whether a storage controller is valid through a first bus, and acquiring a key of the storage controller if a positive judgement is made; judging whether the key is valid, commanding the storage controller to turn on a power supply of a storage device if a positive judgement is made; and loading the storage device through a second bus. According to the method, storage devices based on windows and android are allowed to be loaded after the storage device verification is successful, and by means of the method, data security of a user can be effectively protected, which provides reliable and effective protection for future private cloud service data. | 2017-12-21 |
20170364454 | METHOD, APPARATUS, AND COMPUTER PROGRAM STORED IN COMPUTER READABLE MEDIUM FOR READING BLOCK IN DATABASE SYSTEM - Provided is a method for reading a block in a database system. Provided is a method for reading data recorded in a persistent storage medium by a first node among a plurality of nodes, including: receiving a reading request for a plurality of blocks among blocks recorded in the persistent storage medium; determining respective master nodes of the plurality of blocks; querying, of the master nodes of the plurality of respective blocks, whether a lock for reading the data recorded in each of the plurality of blocks is required; skipping an operation of obtaining the lock and reading the data, with respect to at least some blocks of which the lock is not required among the plurality of blocks, based on the query result; and reading the data after obtaining the lock with respect to at least some blocks of which the lock is required among the plurality of blocks, based on the query result. | 2017-12-21 |
20170364455 | PROTECTION KEY MANAGEMENT AND PREFIXING IN VIRTUAL ADDRESS SPACE LEGACY EMULATION SYSTEM - A system is described to provide protection key access control in a system whose operating system and processor were not designed to provide a protection key memory access control mechanism. Such a system can be applied to an emulator or to enable a system that executes native applications to be interoperable with a legacy system that employs protection key memory access control. | 2017-12-21 |
20170364456 | METHOD AND DEVICE FOR STORAGE MANAGEMENT - Embodiments of the present disclosure provide a method and device for storage management. The method comprises receiving at a storage management device a configuration request for a storage space managed by the storage management device, the configuration request indicating a capacity of the storage space and a target size of a chunk in the storage space; and based on the capacity and the target size, dividing the storage space into a metadata region storing a chunk status indicator indicating whether the chunk is assigned with data and a data region including the chunk with the target size. Embodiments of the present disclosure also provide a corresponding device. | 2017-12-21 |
20170364457 | Methods and Apparatus for Dynamically Selecting an Instruction Set - Methods and apparatus for dynamic instruction set selection for producing an output parameter based on one or more available input parameters are presented. In an example method, a device selects, from different candidate instruction sets that are each configured to produce a same output parameter, an instruction set that requires one or more input parameters that are each available at the device. In addition, in the example method, the device obtains the output parameter by executing the selected instruction set using the input parameters required by that instruction set. In some examples where more than one candidate instruction sets could be selected based on the available input parameters, the device may select the highest-ranking instruction set for execution. | 2017-12-21 |
20170364458 | HDMI Extender with Bidirectional Power Over Twisted Pair - Disclosed are various embodiments of transmit and receive connectivity devices that include signal processing circuitry, an HDMI port, and a multi-position multi-contact port. The signal processing circuitry can transmit and receive signals over the multi-position multi-contact port. The signals can include a first signal corresponding to a first frequency and a second signal corresponding to a second frequency. A power and ground can be send over a cable attached to the multi-position multi-contact port. | 2017-12-21 |
20170364459 | COHERENT CONTROLLER - A system includes a bus, at least one processor coupled to the bus, and a storage device coupled to the bus. The storage device includes storage class memory, a buffer; and a controller. The controller is configured to receive an instruction to provide data to the bus. Responsive to receiving the instruction to provide data to the bus, the controller is configured to retrieve data from the storage class memory, update the buffer to represent the data retrieved from the storage class memory, and output, at the bus, an indication that data responsive to the instruction to provide data to the bus is available at the buffer. The at least one processor is configured to refrain from modifying local data corresponding to the instruction to provide data to the bus after the controller receives the instruction to provide data to the bus and before the controller outputs the indication. | 2017-12-21 |
20170364460 | SCALABLE, PARAMETERIZABLE, AND SCRIPT-GENERATABLE BUFFER MANAGER ARCHITECTURE - A buffer manager is generated by executing a script with respect to a buffer architecture template and a configuration file specifying parameters for the buffer such as, for example, number of memory banks, width of memory banks, depth of memory banks, and client bridge FIFO depth. The script converts the buffer architecture template into a hardware description language (HDL) description of a buffer manager having the parameters. Client bridges accumulate requests for memory banks in FIFO that is provided to a buffer manager upon the client bridge being granted arbitration. Accesses of memory banks may be performed one at a time in consecutive clock cycles in a pipelined manner. Client bridges and the buffer manager may operate in different clock domains. The clock frequency of the buffer manager may be increased or decreased according to requests from client devices. | 2017-12-21 |
20170364461 | TRANSFERRING DATA BETWEEN MEMORY SYSTEM AND BUFFER OF A MASTER DEVICE - A master device has a buffer for storing data transferred from, or to be transferred to, a memory system. Control circuitry issues from time to time a group of one or more transactions to request transfer of a block of data between the memory system and the buffer. Hardware or software mechanism can be provided to detect at least one memory load parameter indicating how heavily loaded the memory system is, and a group size of the block of data transferred per group can be varied based on the memory load parameter. By adapting the size of the block of data transferred per group based on memory system load, a better balance between energy efficiency and quality of service can be achieved. | 2017-12-21 |
20170364462 | REAL-TIME EMBEDDED SYSTEM - A real-time operating system (OS) for an embedded system may be configured for asynchronous handling of input and output (I/O) operations. When application code is executing, the OS may be configured to register I/O interrupts and queue I/O operations. When no application code is executing, the OS may be configured to call appropriate interrupt handlers. As result, the OS may maintain the real-time execution that may be required of applications on an embedded system while providing the flexibility and scalability offered by an operating system. | 2017-12-21 |
20170364463 | UNIVERSAL SERIAL BUS MANAGEMENT - According to an example of managing a universal serial bus (“USB”), a device connected to a USB hub controller is sensed and a USB information scheme from the device is fetched. A power requirement of the device is determined through the USB information scheme, and a total power consumption of a plurality of devices connected to the USB hub controller is calculated. USB information scheme data to display to a user and a data display arrangement are determined, and a monitor scalar is instructed to display the USB information scheme in the determined data display arrangement. Power to the device is distributed based on the total power consumption of all devices connected to the hub controller and a user setting. | 2017-12-21 |
20170364464 | METHOD FOR OPERATING AN AUTOMATION DEVICE - An automation device has a main module and an interchangeable connection module in which a fieldbus port of the automation device is located. The automation device is characterized in that the interchangeable connection module contains a non-volatile memory which can be read out by the main module of the automation device. A method for operating the automation device includes the steps of connecting a main module of the automation device with a connection module, reading the non-volatile memory of the connection module, detecting any incompatibilities between the main module and the connection module, and placing the automation device in operation if no incompatibilities are detected. | 2017-12-21 |
20170364465 | TECHNIQUES FOR ESTABLISHING AN EXTERNAL INTERFACE AND A NETWORK INTERFACE WITHIN A CONNECTOR - A technique for establishing a network interface and an external interface in a connector is disclosed. A personal computer (PC) includes a device controller for controlling data transmission with a peripheral device and a network device, and a receptacle including multiple pins for connecting data channels of the device controller to the peripheral device through the external interface and the network device through the network interface. The PC further includes a crossbar switch for switching the data channels to establish the external interface and the network interface in the receptacle. The external interface complies with the USB standards, and the network interface complies with the Ethernet standards. | 2017-12-21 |
20170364466 | WIRED TEXTILE CONTROL AND POWER SUPPLY BETWEEN MOBILE DEVICES AND SMART TEXTILES - A wired textile control and power supply system as a connection interface between a smart telephone ( | 2017-12-21 |
20170364467 | INPUT/OUTPUT CARD FOR USE IN STORAGE DEVICE AND STORAGE DEVICE - Implementations of the subject matter described herein provide an input/output (I/O) card for storage device and a storage device. The I/O card and the disk drive for the storage device have the same form factor and comply with the same protocol, to enable the I/O card and the disk drive can be arranged at the same end of the storage device. | 2017-12-21 |
20170364468 | Configuration Distribution - A method of provisioning cards in a rack mount system, by selecting a desired configuration file from a library of configuration files, and copying the configuration file into a memory device. The memory device is inserted into the rack mount system and powered up. Whereupon the configuration file automatically and without any further user intervention provisions a card of the rack mount system. | 2017-12-21 |
20170364469 | LOW-PINCOUNT HIGH-BANDWIDTH MEMORY AND MEMORY BUS - A memory subsystem is provided, including a memory controller integrated circuit (IC), a memory bus and a memory IC, all which use fewer signals than common DDR type memory of the same peak bandwidth. Using no more than 22 switching signals, the subsystem can transfer data over 3000 Megabytes/second across the bus interconnecting the ICs. Signal count reduction is attained by time-multiplexing address/control commands onto at least some of the same signals used for data transfer. A single bus signal is used to initiate bus operation, and once in operation the single signal can transfer addressing and control information to the memory IC concurrent with data transfer via a serial protocol based on 16 bit samples of this single bus signal. Bus bandwidth can be scaled by adding additional data and data strobe IO signals. These additional data bus signals might be used only for data and data mask transport. The physical layout of one version of the memory IC dispatches switching signal terminals adjacent to one short edge of the memory die to minimize the die area overhead for controller IC memory interface circuitry when used in a stacked die multi-chip package with said memory controller IC. The memory IC interface signal placement and signal count minimize signal length and circuitry for the memory bus signals. | 2017-12-21 |
20170364470 | Systems and Methods for Accessing Vehicle Communications Bus Information for an Application Processor - A vehicle interface system comprises a vehicle interface processor, a processor data interconnect system, a vehicle communications bus electrical connection system, vehicle interface software, and an application data collection process running on the application processor using spare cycles not used by the application primary process. The application data collection process communicates with the vehicle interface software using the processor data interconnect system. | 2017-12-21 |
20170364471 | DISPLAY APPARATUS, SIGNAL TRANSMITTER, AND DATA TRANSMITTING METHOD - A signal transmitter of the invention is coupled to a plurality of signal receivers by a bus, and is configured to transmit display data through the bus for displaying a line. The signal transmitter includes a first data sequence and a second data sequence. The first data sequence has an electronic characteristic of a first value and is transmitted to a first signal receiver of the signal receivers, and the second data sequence has the electronic characteristic of a second value to a second signal receiver of the signal receivers. Wherein, a first signal transmission path from the signal transmitter to the first signal receiver is shorter than a second signal transmission path from the signal transmitter to the second signal receiver, and the first value is larger than the second value. | 2017-12-21 |
20170364472 | SENSORS GLOBAL BUS - Systems, methods and apparatus are described that offer improved performance of a sensor bus. A first command is transmitted to devices coupled to a serial bus operated in a first mode in accordance with a first protocol to cause the serial bus to be operated in a second mode. After communicating in accordance with a second protocol while the serial bus is operated in the second mode, a second command is transmitted to the plurality of devices in accordance with the first protocol to terminate the second mode. In the second mode, extra symbols inserted into a sequence of symbols transmitted on the serial bus prevent the occurrence of an unintended signaling state on the serial bus. Pulses transmitted on a wire of the serial bus in the second mode may have their duration limited such that a filter of a second device suppresses the limited-duration pulses. | 2017-12-21 |
20170364473 | PROGRAM COUNTER ALIGNMENT ACROSS A RECONFIGURABLE HUM FABRIC - Techniques are disclosed for circuit synchronization. Information is obtained on logical distances between circuits on a semiconductor chip. A plurality of clusters is determined within the chip circuits, where a cluster within the plurality of clusters is synchronized to a tic cycle boundary. A tic cycle count separation is evaluated across the clusters using the information on the logical distances. A plurality of counter initializations is calculated where the counter initializations compensate for the tic cycle count separation across the clusters. A plurality of counters is initialized, with a counter from the plurality of counters being associated with each cluster from the plurality of clusters, where the counters are distributed across the clusters, and where the initializing is based on the counter initializations that were calculated. The plurality of counters is started to coordinate calculation across the plurality of clusters. Reset, debug, and calculation stoppage are provided through the plurality of counters. | 2017-12-21 |
20170364474 | DEVICES FOR TIME DIVISION MULTIPLEXING OF STATE MACHINE ENGINE SIGNALS - A device includes a plurality of blocks. Each block of the plurality of blocks includes a plurality of rows. Each row of the plurality of rows includes a plurality of configurable elements and a routing line, whereby each configurable element of the plurality of configurable elements includes a data analysis element comprising a plurality of memory cells, wherein the data analysis element is configured to analyze at least a portion of a data stream and to output a result of the analysis. Each configurable element of the plurality of configurable elements also includes a multiplexer configured to transmit the result to the routing line. | 2017-12-21 |
20170364475 | CPU AND MULTI-CPU SYSTEM MANAGEMENT METHOD - The present disclosure provides a multi-CPU system, where the multi-CPU system includes: at least two Quick-Path Interconnect QPI domains, a first node controller NC group, and a second node controller NC group; according to a CPU route configuration, there is at least one CPU that can access a CPU in another QPI domain by using the first NC group; and there is at least one CPU that can access a CPU in another QPI domain by using the second NC group. According to this topology, hot swap of an NC can be implemented while the system is relatively slightly affected. | 2017-12-21 |
20170364476 | INSTRUCTION AND LOGIC FOR PERFORMING A DOT-PRODUCT OPERATION - Method, apparatus, and program means for performing a dot-product operation. In one embodiment, an apparatus includes execution resources to execute a first instruction. In response to the first instruction, said execution resources store to a storage location a result value equal to a dot-product of at least two operands. | 2017-12-21 |
20170364477 | INFORMATION PROCESSING APPARATUS, ISING DEVICE, AND INFORMATION PROCESSING APPARATUS CONTROL METHOD - Arithmetic circuits calculate d−1 energy values (h | 2017-12-21 |
20170364478 | SIMILARITY MEASUREMENT METHOD AND DEVICE - A similarity measurement method includes: obtaining a directional relationship between nodes in a network, and determining a transition matrix; calculating a constraint matrix according to the transition matrix and an obtained attenuation factor; constructing a system of linear equations, where a coefficient matrix of the system of linear equations is the constraint matrix, and a variable of the system of linear equations is a correction vector; solving the system of linear equations by means of iteration by using a Jacobi method, and determining the correction vector; and calculating similarities between the nodes according to the transition matrix, the attenuation factor, and a diagonal correction matrix that is generated according to the correction vector. In the method, the correction vector is determined by using the Jacobi method, and further the similarities between the nodes may be calculated. | 2017-12-21 |
20170364479 | SIGNAL PROCESSING METHOD AND DEVICE - A method for processing an audio signal, including: sound is converted to an analog audio input signal and converted into a digital audio signal; a windowed time domain signal is obtained and then a twiddled signal is obtained; the twiddled signal is pre-rotated and then an FFT is performed; an in-place fixed rotate compensation is performed on the FFT signal and then an post-rotated is performed; a quantized signal is obtained and then wrote into a bitstream for transmitting or storing. | 2017-12-21 |
20170364480 | DECONSTRUCTING AND RENDERING OF WEB PAGE INTO NATIVE APPLICATION EXPERIENCE - A lack of available responsive options for existing web sites and/or pages, and the wide spectrum under which they fall presents a challenge for a satisfying mobile user experience (UX) with a hosted collaboration service. Templates used to create a site and/or page may each have capabilities and features which “cross-over” into other templates. Deconstructing and rendering a web page into a native application experience at a mobile client may highlight a template's functionality to enhance the UX. For example, a server side application programming interface (API) may be provided for the mobile UX, a type of a page to be rendered may be determined, the page may be deconstructed into pieces, and the deconstructed pieces may be provided to rebuild the page at the mobile client natively. The page may be rendered on the mobile client with added elements based on the deconstructed pieces to enhance the mobile UX. | 2017-12-21 |
20170364481 | DIGITAL CARD MANAGEMENT - Techniques are described for managing the generation, style, and/or distribution of digital contact cards. An organization may access a card management platform and upload style information for digital contact card(s). Style information may include an arrangement and/or layout of the card(s), an organization name and/or logo to be included on the card(s), the font, color, size, or other characteristics of the text on the card(s), and so forth. A user may access the platform to request the distribution of a digital contact card to recipient(s). In response to the request, the platform may generate a digital contact card for the user based on the previously specified style information, and distribute card(s) to the specified recipient(s). Techniques are also described for determining positions of various mobile devices (and associated users) in a room or other area, and presenting received contact card information in a user interface according to the determined positions. | 2017-12-21 |
20170364482 | GENERATING A VISUAL LAYOUT TREE BASED ON A NAMED POINT WITHIN A VISUAL DESCRIPTION NODE - A layout engine generates a visual layout tree for a visual description tree of a document whose content is to be rendered in one or more display areas. A visual description tree describes the content of a document along with formatting and logical arrangement the content. Visual description nodes of a visual description tree represent the organization of the constituent elements a document hierarchically. A visual layout tree defines the layout of a document within one or more display areas. Visual layout nodes of a visual layout tree represent the layout of the content of a document hierarchically. The layout engine receives as input a visual description tree and generates the corresponding visual layout tree. A rendering engine then inputs the visual layout tree and generates a graphics buffer containing the pixels representing the layout of the document as defined by the visual layout tree. | 2017-12-21 |
20170364483 | GENERATING VISUAL LAYOUT NODES TO FILL A DISPLAY AREA BASED ON AN ANCHOR POINT - A layout engine generates a visual layout tree for a visual description tree of a document whose content is to be rendered in one or more display areas. A visual description tree describes the content of a document along with formatting and logical arrangement the content. Visual description nodes of a visual description tree represent the organization of the constituent elements a document hierarchically. A visual layout tree defines the layout of a document within one or more display areas. Visual layout nodes of a visual layout tree represent the layout of the content of a document hierarchically. The layout engine receives as input a visual description tree and generates the corresponding visual layout tree. A rendering engine then inputs the visual layout tree and generates a graphics buffer containing the pixels representing the layout of the document as defined by the visual layout tree. | 2017-12-21 |
20170364484 | ENHANCED TEXT METADATA SYSTEM AND METHODS FOR USING THE SAME - Apparatuses and methods for enhanced text metadata systems are described herein. In a non-limiting embodiment, a camera on an electronic device may be activated in response to receiving a signal indicating a message is being inputted by a user. While receiving the message, a camera may capture an image of the user. This image may be analyzed to determine an emotion the user is feeling when inputting the message. Once an emotion of the user is determined, the message will be altered to reflect the emotion the user is feeling. | 2017-12-21 |
20170364485 | Transformation Of Marked-Up Content Into A File Format That Enables Automated Browser Based Pagination - A method and a file format transformation system (FFTS) for transforming marked-up content in a first file format (FFF) to a second file format (SFF) that enables automated browser based pagination are provided. The FFTS reflows marked-up content of the FFF into a continuous page. The FFTS generates and appends tags to spaces and block elements identified in the reflown marked-up content of the FFF. For each space and block element, the FFTS determines and tags line breaks in the reflown marked-up content. For each line break, the FFTS identifies, tags, and positions anchored floats and footnotes on a current page based on space availability. The FFTS positions page breaks in the continuous page based on a configurable page height and the line breaks. The FFTS groups the marked-up content, inserts pagination elements and renders the grouped marked-up content in the SFF based on a selected level of reversibility. | 2017-12-21 |
20170364486 | Precise Encoding and Direct Keyboard Entry of Chinese as Extension of Pinyin - Encoding Chinese in one(linear code)-to-one(character or word) correspondence systematically has been a century old challenge. Based on the official standards for Pinyin and writing order of characters, that all Chinese users are familiar with, this invention comprises: (1) encoding all characters and words of a predetermined set or dictionary into distinct codes in electronic system like computer; (2) retrieving character or word by decoding user's keyboard input, and then entering the corresponding character or word into the system. Denoted inside [ ], the proposed Pinyin+X coding format is [Pinyin+X]=[Pinyin]+[3-Stroke]+[Extra], where [3-Stroke] consists of three consonant letters coding for the first, second, and last stroke of the writing form of character or word, and [Extra] is system-generated consonant letter(s) to ensure the uniqueness of the entire [Pinyin+X] code. Pinyin+X keyboard entry process for Chinese can therefore be designed to be direct that every keystroke counts and none is extra. | 2017-12-21 |
20170364487 | METHOD OF GENERATING HIERARCHICAL DATA STRUCTURE - There is disclosed a computer-implemented method for generating a hierarchical data structure. The computer-implemented method can be executable at a server. The computer implemented method comprises: identifying a plurality of data elements to be searched, the plurality of data elements having a set of descriptors, each descriptor within the set of descriptors being associated with a data type being different from data types of other descriptors within the set of descriptors; defining the hierarchical data structure, having a first level and a second level. | 2017-12-21 |
20170364488 | ADDING VISUAL DESCRIPTION NODES TO A VISUAL DESCRIPTION TREE DURING LAYOUT - A layout engine generates a visual layout tree for a visual description tree of a document whose content is to be rendered in one or more display areas. A visual description tree describes the content of a document along with formatting and logical arrangement the content. Visual description nodes of a visual description tree represent the organization of the constituent elements a document hierarchically. A visual layout tree defines the layout of a document within one or more display areas. Visual layout nodes of a visual layout tree represent the layout of the content of a document hierarchically. The layout engine receives as input a visual description tree and generates the corresponding visual layout tree. A rendering engine then inputs the visual layout tree and generates a graphics buffer containing the pixels representing the layout of the document as defined by the visual layout tree. | 2017-12-21 |
20170364489 | LINKING VISUAL LAYOUT NODES OF A VISUAL LAYOUT TREE USING POSITIONING POINTERS - A layout engine generates a visual layout tree for a visual description tree of a document whose content is to be rendered in one or more display areas. A visual description tree describes the content of a document along with formatting and logical arrangement the content. Visual description nodes of a visual description tree represent the organization of the constituent elements a document hierarchically. A visual layout tree defines the layout of a document within one or more display areas. Visual layout nodes of a visual layout tree represent the layout of the content of a document hierarchically. The layout engine receives as input a visual description tree and generates the corresponding visual layout tree. A rendering engine then inputs the visual layout tree and generates a graphics buffer containing the pixels representing the layout of the document as defined by the visual layout tree. | 2017-12-21 |
20170364490 | GENERATING A VISUAL DESCRIPTION TREE BASED ON A LAYOUT INTERRUPTION RECORD - A layout engine generates a visual layout tree for a visual description tree of a document whose content is to be rendered in one or more display areas. A visual description tree describes the content of a document along with formatting and logical arrangement the content. Visual description nodes of a visual description tree represent the organization of the constituent elements a document hierarchically. A visual layout tree defines the layout of a document within one or more display areas. Visual layout nodes of a visual layout tree represent the layout of the content of a document hierarchically. The layout engine receives as input a visual description tree and generates the corresponding visual layout tree. A rendering engine then inputs the visual layout tree and generates a graphics buffer containing the pixels representing the layout of the document as defined by the visual layout tree. | 2017-12-21 |
20170364491 | LAYOUT ENGINE - A layout engine generates a visual layout tree for a visual description tree of a document whose content is to be rendered in one or more display areas. A visual description tree describes the content of a document along with formatting and logical arrangement the content. Visual description nodes of a visual description tree represent the organization of the constituent elements a document hierarchically. A visual layout tree defines the layout of a document within one or more display areas. Visual layout nodes of a visual layout tree represent the layout of the content of a document hierarchically. The layout engine receives as input a visual description tree and generates the corresponding visual layout tree. A rendering engine then inputs the visual layout tree and generates a graphics buffer containing the pixels representing the layout of the document as defined by the visual layout tree. | 2017-12-21 |
20170364492 | WEB CONTENT ENRICHMENT BASED ON MATCHING IMAGES TO TEXT - A web content enrichment system can match an image to text of web content. When the text of web content includes a snippet, the image matched to the text enriches the snippet to enhance results of a search engine. When the text of web content includes text contained in a webpage, the image matched to this text enriches the webpage to enhance user perception and understanding of the webpage. The process of matching images to text involves extracting features of a plurality of images and features of a plurality of text documents, calculating scores of the images based on the extracted features, and selecting one image per text document based on the scores using a machine-learning algorithm. The result of the matching can be provided to a web content module for storing, incorporating into the result lists of the search engine, or delivery to a user. | 2017-12-21 |
20170364493 | EFFICIENT EVENT DELEGATION IN BROWSER SCRIPTS - Event handlers associated with markup language documents represented in a web browser are identified efficiently in response to an event. The markup language document is represented as a hierarchical structure comprising nodes and edges. Nodes are associated with node types, each node type defining how descendants of the node respond to events. The markup language document provides mappings of sets of node types to sets of handlers. In response to an event associated with a node, the types of nodes encountered in a path connecting the node with the root node are identified. Handler sets of the node types encountered in the path connecting a node with the root node are used to determine the handlers to be executed in response to the event. Data is associated with nodes to allow handler code to distinguish between nodes of the same node type. | 2017-12-21 |
20170364494 | SYSTEM AND METHOD FOR DYNAMIC IMAGERY LINK SYNCHRONIZATION AND SIMULATING RENDERING AND BEHAVIOR OF CONTENT ACROSS A MULTI-CLIENT PLATFORM - The present invention generally relates to systems and methods for simulation of web based content. Specifically, the systems and methods described herein are configured to provide simulation of the rendering and behavior of web (e.g., HTML) documents within multiple client, browser and device platforms. Although the principles can be generally used, the invention is particularly aimed towards simulating emails within different email clients and devices. Embodiments of the present invention further generally relate to synchronization of links with dynamic imagery provided to a remote computing device. Specifically, these embodiments of the invention relate to a web-based system and method for synchronizing URLs and other hyperlinks to dynamic imagery provided to a remote computing device by a server or other content providing device. | 2017-12-21 |
20170364495 | PROPAGATION OF CHANGES IN MASTER CONTENT TO VARIANT CONTENT - A method for propagating changes from master content to variant content includes receiving, from a user interface, a modified master text composition that incorporates changes to a master text composition. Each of the master text composition, the modified master text composition, and a variant text composition assigned to the master text composition are divided into text units. A correspondence model is constructed that includes mappings between the text units of the master text composition, the text units of the modified master text composition, and the text units of the variant text composition. Proposed changes to the variant text composition are determined that correspond to the changes to the master text composition based on the mappings. At least one of the proposed changes is integrated into the variant text composition. | 2017-12-21 |
20170364496 | VISUALIZATION INTERFACE FOR INFORMATION OBJECT SYSTEM - Disclosed are various embodiments for presenting an interface for visualizing information objects. A user interface is generated on a client computing device. Then a collaboration server may be queried for an information object to be rendered within the user interface on behalf of a user in response to a request to render the information object. Subsequently, form data may be retrieved from the information object received from the collaboration server. Then the information object may be rendered within the user interface based at least in part on the form data of the information object. | 2017-12-21 |
20170364497 | DIGITAL DOCUMENT CHANGE CONFLICT RESOLUTION - A first set of changes to a first version of a digital document, as compared to a baseline version of the document, can be detected. The first set of changes can include a first change to a page of the document in the first version of the document, as compared to the baseline version of the document. Also, a second set of changes to a second version of a document, as compared to the baseline version of the document, can be detected. The second set of changes can include a second change to the page of the document in the second version of the document, as compared to the baseline version of the document. A conflict between the first change and the second change can be detected, and the conflict can be resolved by receiving user input or applying conflict resolution rule(s) to choose between the first and second changes. | 2017-12-21 |
20170364498 | REGISTRY DRIVEN INTEROPERABILITY AND EXCHANGE OF DOCUMENTS - The present invention relates to systems and methods for registry driven transformation of a document exchanged between businesses or applications. More particularly, it relates to systems and protocols for using one or more commonly accessible registries to transform electronic commerce documents among dissimilar interfaces, preferably XML documents. Particular aspects of the present invention are described in the claims, specification and drawings. | 2017-12-21 |
20170364499 | CONCEALMENT OF CONTENT IN A SHARED DOCUMENT - A first set of concealment attributes is received from a first user. The first set of user concealment attributes are associated with a document. A first set of document concealment attributes is received from the user. The first set of document concealment attributes are associated with the document. The document, based on the first set of concealment attributes and the first set of document concealment attributes, is stored. | 2017-12-21 |
20170364500 | FORMS PROCESSING METHOD - A forms processing method involves accessing an individual scanned form, analyzing the individual form, based upon the analysis, selecting a proper forms-scanning template, loading multiple field-specific dictionaries linked to individual fields in the selected forms-scanning template, analyzing, text content, on a field by field basis using the field-specific dictionary linked to each respective field, for misspellings or improper entries, or for missing content, attempting to identify whether a closest fit between the particular content and contents of the field-specific dictionary linked to that field exists and, if the closest fit exists, automatically replacing the particular content with an entry from the field-specific dictionary linked to that field corresponding to the closest fit, or if there is no closest fit or the particular content is absent, providing an indication of an error to an operator, and storing, a correction as a new entry within the field-specific dictionary linked to that field. | 2017-12-21 |
20170364501 | METHOD AND APPARATUS FOR WORD DETECTION IN APPLICATION PROGRAM - Embodiments of the present invention provide a method and an apparatus for word detection in an application program. The method includes extracting a resource file from a multilingual application program installation package and converting the resource file into a text file. The method further includes disassembling the text file according to a language version to acquire a corresponding language text file; invoking a language detection tool according to the language version; and checking the language text file by using the language detection tool to identify questionable character information. The apparatus for word detection includes a file processing module, configured to extract a resource file from a multilingual application program installation package, and convert the resource file into a text file; and a disassembling module, configured to disassemble the text file according to a language version to acquire a corresponding language text file. The apparatus further includes a tool invoking module, configured to invoke a language detection tool according to the language version; and a text detection module, configured to check the language text file by using the language detection tool to identify questionable character information. Word detection efficiency in an application program can be improved by adopting the present disclosure. | 2017-12-21 |
20170364502 | A Method For Suggesting Candidate Words As Replacements For An Input String Received At An Electronic Device - Provided is a computer implemented method for suggesting one or more candidate words from a list of words based on an input string received at an electronic device. Preferably, the list of words comprises an ordered list of words. The method comprises a first step of providing an array in memory for receiving edit distance values between initial substrings of the input string and initial substrings of each word in a set of some or all of the words in the list of words. The method includes applying an edit distance algorithm comparing a selected word to a received input string in order to obtain the aforementioned edit distance values. The selected word may comprise an empty string of no characters. The method includes determining for one or more words of the set of words a number of characters K by which it overlaps with a prefix of a previously considered word and retaining edit distance values in said memory array for said word being considered using some or all of the edit distance values for the K prefix characters of the previously considered word. From the edit distance values, it is possible to identify one or more candidate words from the word list as a replacement for the received input string in a fast and efficient manner. | 2017-12-21 |
20170364503 | MULTI-STAGE RECOGNITION OF NAMED ENTITIES IN NATURAL LANGUAGE TEXT BASED ON MORPHOLOGICAL AND SEMANTIC FEATURES - Systems and methods for multi-stage recognition of named entities based on morphological and semantic features of natural language texts. An example method comprises: performing a lexico-morphological analysis of a natural language text comprising a plurality of tokens, each token comprising at least one natural language word; determining, based on the lexico-morphological analysis, one or more lexical meanings and grammatical meanings associated with each token of the plurality of tokens; for each token the plurality of tokens, evaluating one or more classifier functions using the lexical and grammatical meanings associated with the tokens, wherein a value of each classifier function is indicative of a degree of association of the token with a category of named entities; performing a syntactico-semantic analysis of at least part of the natural language text to produce a plurality of semantic structures representing the part of the natural language text; and interpreting the semantic structures using a set of production rules to determine, for one or more tokens comprised by the part of the natural language text, a degree of association of the token with a category of named entities. | 2017-12-21 |
20170364504 | METHOD AND SYSTEM FOR DATA PROCESSING FOR REAL-TIME TEXT ANALYSIS - The disclosed embodiments illustrate methods data processing for real-time text analysis. The method includes receiving text content from a plurality of user-computing devices, wherein the text content comprises at least a current text segment and a previous text segment. The method further includes extracting one or more first features from the current text segment, wherein at least a first feature of the one or more first features corresponds to a difference between timestamps associated with each of the current text segment and the previous text segment. The method further includes categorizing the current text segment into a predetermined category of one or more predetermined categories, based on at least the one or more first features, automatically by utilizing a classifier. Further, the method includes predicting a likelihood of evolution of an attribute in the text content, based on the predetermined category associated with the current text segment. | 2017-12-21 |
20170364505 | SYSTEMS AND METHODS FOR BUILDING STATE SPECIFIC MULTI-TURN CONTEXTUAL LANGUAGE UNDERSTANDING SYSTEMS - Systems and methods for building a dialog-state specific multi-turn contextual language understanding system are provided. More specifically, the systems and methods infer or are configured to infer a state-specific schema and/or state-specific rules from a formed single-shot language understanding model and/or a single-shot rule set. As such, the systems and methods only require the information necessary to form a single-shot language understanding model and/or a single-shot rule set from a builder to form or build the dialog-state specific multi-turn contextual language understanding system. Accordingly, the systems and methods for building a dialog-state specific multi-turn contextual language understanding system reduce the expertise, time, and resources necessary to build a dialog-state specific multi-turn contextual language understanding system for an application when compared to systems and methods that require further input from the builder than necessary to build a single-shot language understanding system. | 2017-12-21 |
20170364506 | SYSTEM AND METHOD FOR GENERATING PHRASE BASED CATEGORIES OF INTERACTIONS - In some embodiments, a system and method for generating phrase based categories of interactions may include obtaining a base category, the base category including one or more phrases. A base trend for the base category may be generated based on a frequency of appearance of at least one of the one or more phrases in a set of recorded interactions; a candidate phrase may be obtained and a candidate trend may be generated for the candidate phrase based on a frequency of appearance of the candidate phrase in the set of recorded interactions; a correlation level may be determined by relating the candidate trend to the base trend; and, if the correlation level is greater than a threshold level then the candidate phrase may be included the in the base category. | 2017-12-21 |
20170364507 | Extracting Veiled Meaning in Natural Language Content - Mechanisms for identifying hidden meaning in a portion of natural language content are provided. A primary portion of natural language content is received and a secondary portion of natural language content is identified that references the natural language content. The secondary portion of natural language content is analyzed to identify indications of meaning directed to elements of the primary portion of natural language content. A probabilistic model is generated based on the secondary portion of natural language content modeling a probability of hidden meaning in the primary portion of natural language content. A hidden meaning statement data structure is generated for the primary portion of natural language content based on the probabilistic model. | 2017-12-21 |
20170364508 | CULTURALLY-AWARE COGNITIVE SYSTEM FOR HUMAN INTERACTIONS - A mapping is constructed between a node of a cultural hierarchy and a node of an organizational hierarchy. The cultural hierarchy is a data structure representing an arrangement of characteristics of different social levels relative to one another in a culture. The organizational hierarchy is a data structure representing an arrangement of characteristics of different roles of people relative to one another in a group. A set of cultural attributes is constructed to represent a persona of a human user according to mapping. Using a cultural attribute, an adjustment rule is selected from a library. A machine output is modified according to the adjustment rule. The machine output is in response to a dialog between a data processing system and human user in a machine-human interaction. The adjusted output is transformed and presented as a response to the human user in the machine-human interaction. | 2017-12-21 |
20170364509 | CONFIGURATION THAT PROVIDES AN AUGMENTED VIDEO REMOTE LANGUAGE INTERPRETATION/TRANSLATION SESSION - A computer implemented language interpretation/translation platform is provided. The computer implemented language interpretation/translation platform comprises a processor that establishes a video remote interpretation session between a mobile device associated with a user and a computing device associated with a language interpreter/translator, receives data corresponding to a context of the video remote interpretation session from the mobile device, and augments the video remote interpretation session with one or more features that are distinct from a language interpretation service. | 2017-12-21 |
20170364510 | METHOD AND DEVICE FOR PROCESSING A MULTI-LANGUAGE TEXT - Embodiments of the present disclosure provide a method and apparatus for processing a multi-language text. According to embodiments of the present disclosure, the multi-language text including contents in a plurality of languages may be encoded with a Unicode. The method further comprises splitting the multi-language text into a plurality of parts based on the Unicode of the multi-language text, contents of the plurality of parts having different languages. In addition, the multi-language text may also be processed based on the plurality of parts. | 2017-12-21 |
20170364511 | METHOD AND APPARATUS FOR AGGREGATING WITH INFORMATION GENERALIZATION - Methods, apparatuses, and computer program products are described herein that are configured to perform aggregation of phrase specifications. In some example embodiments, a method is provided that comprises identifying two or more generalized phrase specifications. In some example embodiments, the two or more generalized phrase specifications contain at least one aggregatable constituent. The method of this embodiment may also include generating an aggregated phrase specification from the two or more generalized phrase specifications. In some example embodiments, the aggregated phrase specification comprises a combined noun phrase generated from the aggregatable constituents and one or more additional constituents based on a determined level of generalization. | 2017-12-21 |
20170364512 | ELECTRONIC DEVICE FOR PROVIDING TRANSLATION SERVICE AND METHOD THEREOF - An electronic device and method for providing a translations service are disclosed. The electronic device for providing a translation service includes an input unit comprising input circuitry configured to receive input text of a first language, a processor configured to divide the input text into a main segment and a sub-segment and to generate output text of a second language by selecting translation candidate text corresponding to the input text from translation candidate text of the second language, based on a meaning of text included in the sub-segment, and an output unit comprising output circuitry configured to output the output text. | 2017-12-21 |
20170364513 | DOCUMENT MANAGEMENT SERVER, DOCUMENT MANAGEMENT DEVICE, DOCUMENT MANAGEMENT SYSTEM, NON-TRANSITORY COMPUTER READABLE MEDIUM STORING DOCUMENT MANAGEMENT PROGRAM, AND DOCUMENT MANAGEMENT METHOD - Disclosed is a document management server including a storing unit that stores document information, a generating unit that generates connection information for accessing the document information stored in the storing unit, a transmitting unit that transmits the connection information generated by the generating unit to a document management device, wherein the connection information transmitted by the transmitting unit is substituted with the document information stored in the document management device. | 2017-12-21 |
20170364514 | VISUALIZING RELATIONSHIPS BETWEEN DATA ELEMENTS - In general, a specification of multiple contexts that are related according to a hierarchy is received. Relationships are determined among three or more metadata objects, and at least some of the metadata objects are grouped into one or more respective groups. Each of at least some of the groups is based on a selected one of the contexts and is represented by a node in a diagram. Relationships among the nodes are determined based on the relationships among the metadata objects in the groups represented by the nodes, and a visual representation is generated of the diagram including the nodes and the relationships among the nodes. | 2017-12-21 |
20170364515 | MOBILE DEVICE CAPABLE OF OFFLINE AND ONLINE SYNCHRONOUS IMAGE IDENTIFYING, AN IMAGE IDENTIFYING SYSTEM, AND A STORAGE MEDIUM FOR THE SAME - A mobile device capable of offline and online synchronous image identifying is disclosed. The mobile device includes an image capturing unit, a processor, and a display monitor. The image capturing unit retrieves frames of a recognition target. The processor determines whether the mobile device is operatively connected to Internet. Also, the processor sends the frames to a recognition server via the Internet, and performs offline image recognition to the frames and displays the result of the offline image recognition on the display monitor when the mobile device is connected to the Internet, and receives a result of an online image recognition performed synchronously to the frames by the recognition server and displays the result of the online image recognition on the display monitor when the result of the online image recognition has a recognition value higher than a recognition value of the result of the offline image recognition. | 2017-12-21 |
20170364516 | LINGUISTIC MODEL SELECTION FOR ADAPTIVE AUTOMATIC SPEECH RECOGNITION - The present disclosure describes dynamically adjusting linguistic models for automatic speech recognition based on biometric information to produce a more reliable speech recognition experience. Embodiments include receiving a speech signal, receiving a biometric signal from a biometric sensor implemented at least partially in hardware, determining a linguistic model based on the biometric signal, and processing the speech signal for speech recognition using the linguistic model based on the biometric signal. | 2017-12-21 |
20170364517 | HASH VALUE GENERATION THROUGH PROJECTION VECTOR SPLIT - A system may include an access engine to access an input vector as well as a projection matrix. The projection matrix may include a number of rows equal to a number of hash values to generate from the input vector multiplied by the square root of an inverted sparsity parameter specifying a ratio of the hash universe size from which the hash values are generated to the number of hash values to generate. The projection matrix may include a number of columns equal to the dimensionality of the input vector. The system may also include a hash computation engine to determine a projection vector from the projection matrix and the input vector, split the projection vector into a number of sub-vectors equal to the number of hash values to generate, and generate a hash value from each of the sub-vectors. | 2017-12-21 |
20170364518 | LINKING ONTOLOGIES TO EXPAND SUPPORTED LANGUAGE - A computer-implemented method, system using at least one computing device, and computer program product are disclosed for linking an ontology provided by a content service with a word expansion ontology. The content service ontology is referred to as a category ontology and the word expansion ontology is referred to herein as a lexical ontology. A user may provide an input such as an input command to an application. The input command is processed by a natural language processing engine to derive the user's intent and to extract relevant entities embodied in the command. The NLP engine may create a composite concept set containing multiple permutations of the concepts (entities extracted) and provide the composite concept set to a concept mapper. The concept mapper applies searches an ontology map and applies one or more scoring operations to determine a best match between the composite concept set and at least one category provided by the category ontology. The content service is searched using the category and the results are displayed to the user. | 2017-12-21 |
20170364519 | Automated Answer Scoring Based on Combination of Informativity and Specificity Metrics - A mechanism is provided in a computing device configured with instructions executing on a processor of the computing device to implement a question answering system for answer scoring based on a specificity score. The question answering system, executing on the processor of the computing device and configured with a question answering machine learning model, generates a set of candidate answers for a user-generated input question. For each given candidate answer in the set of candidate answers, a specificity scorer of the question answering system determines a specificity value of each term in the given candidate answer based on a position of the term in a taxonomy data structure and determines a specificity score of the given candidate answer based on the specificity value of the terms in the given candidate answer. The question answering system, determines a confidence score for each candidate answer within the set of candidate answers based on its specificity score. The question answering system ranks the set of candidate answers according to confidence score to form a ranked set of candidate answers and returns the ranked set of candidate answers. | 2017-12-21 |
20170364520 | APPROXIMATE TEMPLATE MATCHING FOR NATURAL LANGUAGE QUERIES - Systems and methods provide a media guidance application that recognizes a plurality of natural language search queries for identifying a set of search results. For example, a user may want to determine when the Yankees are playing their next baseball game. The user may structure their query in multiple ways, such as, “When are the Yankees playing?” “What time is the Yankees game?” “When is the next Yankees baseball game?” The user would expect the same result, a description of when the Yankees are playing, regardless of how the query is structured. The systems and methods enable a user to use a plurality of search queries when searching for items or information to get desired results. | 2017-12-21 |
20170364521 | SUGGESTING CANDIDATE PROFILES SIMILAR TO A REFERENCE PROFILE - Techniques for identifying and presenting member profiles similar to a source member profile are described. With some embodiments, a general recommendation engine is used to extract features from member profiles, and then store the extracted features, including any computed, derived or retrieved profile features, in an enhanced member profile. In real-time, the general recommendation engine processes client requests to identify member profiles similar to a source member profile by comparing select profile features stored in the enhanced member profile with corresponding profile features of the source member profile, where the comparison results in several similarity sub-scores that are then combined in accordance with directives set forth in a configuration file. Finally, the member profiles with the highest similarity scores corresponding with the user-selected member profile are selected, and in some instances, presented to a user. | 2017-12-21 |
20170364522 | Real-Time Search Tuning - Embodiments are directed to dynamically tuning search result rankings to control how the search results are presented in a user interface and to dynamically updating search result rankings based on tuning inputs. In one scenario, a computer system receives search results with associated search result attributes. The search results are displayed within a user interface according to each search result's determined ranking. The computer system then receives a tuning input at the user interface. The tuning input indicates that a search result ranking model is to be adjusted for various specified search result attributes. Moreover, the search result ranking model determines how each search result is ranked. The computer system then dynamically updates the displayed search results as the search result ranking model is tuned for the specified search result attributes. The dynamic updating includes repositioning, adding and removing search results according to the determined ranking for each search result. | 2017-12-21 |
20170364523 | METHOD AND SYSTEM FOR GENERATING PHONETICALLY SIMILAR MASKED DATA - A method and system is provided for generating a group of phonetically similar masked data. The present application provides a method and system for generating a group of phonetically similar masked data; comprises preprocessing of input dataset values comprising a list of fictitious data values to be used as masked data; determining a plurality of groups of phonetically similar data values present in the dataset list; and deriving metaphone for each input data value to be masked; generating a first numeric code from derived metaphone value of input data value to be masked; selecting one group of phonetically similar data values out of the plurality of groups of phonetically similar data values based on the generated first numeric code; and generating a second numeric code from input data value for selecting a masked value from a plurality of fictitious data group. | 2017-12-21 |
20170364524 | ENRICHED LOCATION TRAIL FOR TASK COMPLETION AND MEMORY RECALL - In non-limiting examples of the present disclosure, systems, methods and devices for providing enriched location trail recall are presented. Location coordinates for a plurality of locations comprising a location trail may be received. The location trail may be enriched with user information and world knowledge. A request for a location-based recommendation may also be received. The request may be analyzed with a language-based model for ranking user intent and one or more constraints of the request may be evaluated. The one or more constraints may be evaluated against the enriched location trail data and a plurality of results for task completion may be filtered and ranked. The ranking may incorporate the enriched content for the location trail in categorizing the plurality of results. | 2017-12-21 |
20170364525 | EFFICIENT SNAPSHOT MANAGEMENT IN A LARGE CAPACITY DISK ENVIRONMENT - A method, computer program product and/or system saves an original logical block in a file system and generates a first heatmap reflecting access operations on the original logical block. After taking of a file system snapshot, and receiving information that the original logical block is going to be revised, a second heatmap is generated, reflecting predicted access operations on the revised logical block. The second heatmap is based, at least in part, on the first heatmap. Selecting a physical storage location for the revised logical block is based on the second heatmap. | 2017-12-21 |
20170364526 | Systems and Methods for Remote Replay of User Interaction with a Webpage - A system and method for replaying a user's interaction with a webpage by requesting playback of user interaction data from a replay server, receiving a media asset from the replay server to allow playback the requested user interaction data, the media asset being pre-fetched for use by a proxy application, periodically requesting and receiving the user interaction data from the replay server, recreating an interaction visualization from the user interaction data, and playing back said interaction visualization based on data received from the replay server. | 2017-12-21 |
20170364527 | SYSTEM AND METHOD CONFIGURED TO EXECUTE DATA MODEL TRANSFORMATIONS ON DATA FOR CLOUD BASED APPLICATIONS - A method and a system to expose a common data model in a wider range of data model specific views by using a meta-data store, a load balancer, model router, and model transformer are provided. | 2017-12-21 |
20170364528 | SYSTEM, METHOD, AND RECORDING MEDIUM FOR RECYCLE BIN MANAGEMENT BASED ON COGNITIVE FACTORS - A recycle bin management method, system, and non-transitory computer readable medium, include a cognitive detection circuit configured to detect a cognitive state and a cognitive characteristic of a user at a time when the user is performing a first deletion of a file to a recycle bin and a file tagging circuit configured to tag the file with a cognitive indicator based on the cognitive state and cognitive characteristic of the user, the cognitive indicator altering a visual display of the file in the recycle bin to indicate the cognitive state and the cognitive characteristic of the user before the user performs a second deletion to delete the file from the recycle bin. | 2017-12-21 |
20170364529 | SELECTIVE COMPRESSION OF UNSTRUCTURED DATA - A method for selectively compressing unstructured data includes preparing, at a host system, a data blob made up of unstructured data, for storage on a storage system. The method encodes a first portion of the data blob with a first color and a second portion of the data blob with a second color. The first color indicates that the associated portion should remain uncompressed, while the second color indicates that the associated portion should be compressed. The method transmits the encoded data blob to a storage virtualization layer associated with the storage system. In response, the storage virtualization layer stores the first portion in an uncompressed format, and compresses the second portion and stores the second portion in a compressed format. A corresponding system and computer program product are also disclosed herein. | 2017-12-21 |
20170364530 | SELECTIVE DEDUPLICATION - Methods and apparatuses for performing selective deduplication in a storage system are introduced here. Techniques are provided for determining a probability of deduplication for a data object based on a characteristic of the data object and performing a deduplication operation on the data object in the storage system prior to the data object being stored in persistent storage of the storage system if the probability of deduplication for the data object has a specified relationship to a specified threshold. | 2017-12-21 |
20170364531 | IMAGE SHARING METHOD AND APPARATUS, AND TERMINAL DEVICE - An image sharing method and a terminal device is provided. The image sharing method of the present invention includes: obtaining an image selected from a gallery by a user, and using the image as a to-be-shared image, where a quantity of the to-be-shared images is greater than a single-time maximum shareable-photo quantity allowed by a target sharing platform; and performing synthesis processing on at least two images of the to-be-shared images to obtain a processed to-be-shared image, where a quantity of the processed to-be-shared images is less than or equal to the single-time maximum shareable-photo quantity allowed by the target sharing platform. | 2017-12-21 |
20170364532 | SYSTEMS AND METHODS FOR AUTOMATICALLY DISSEMINATING CONTENT BASED ON CONTEXTUAL INFORMATION - A content-dissemination system distributes, publishes, or makes available a content item to one or more target entities based on contextual information associated with the content item. When a user creates a new content item or the system detects a new content item for a local user, the system determines contextual information for the content item, and uses this contextual and previous historical contextual information to generate a set of structured names for the content item. The system also determines security and privacy policies for disseminating the content item from the determined contextual information and the historical contextual information. The system associates the set of structured names and the security and privacy policies with the content item, and can disseminate the content item to one or more target entities based on these structured names, the security and privacy policies, and the requirements and capabilities of the recipients. | 2017-12-21 |
20170364533 | IMAGE PROCESSING APPARATUS, CONTROL METHOD OF IMAGE PROCESSING APPARATUS, AND PROGRAM - It is an object to reduce a troublesomeness required to export/import an address book (destination table) between image processing apparatuses. For this purpose, at the time of import request of destination data for import, an import instruction to a group destination table is made. A group destination table ID which coincides with a destination table ID obtained from the destination data for import is retrieved. The group destination table associated with the group destination table ID is specified as a group destination table of an import destination side. The destination data obtained from the destination data for import is imported as destination data into the specified group destination table (group destination table DB). | 2017-12-21 |
20170364534 | PLATFORM, SYSTEM, PROCESS FOR DISTRIBUTED GRAPH DATABASES AND COMPUTING - Systems for distributed graph data management that use graph structures to model data and respond to different types of queries. Systems that provide analytic tools and machine learning based on graph structures. Systems for distributed graph data management that provide packaged solutions for different application areas. | 2017-12-21 |
20170364535 | USER INTERFACE FOR SEARCH METHOD AND SYSTEM - A user interface for searching records in a database is provided. Each record contains information regarding one or more categories. The user interface receives search criteria of one or more categories and provides search results comprising exact and/or non-exact matching records. A non-exact matching record has a relevance value representing the relevance of the record to the search query, the non-exact matching records being displayed in an ordering based on the relevance values. The user interface provides slider tools for receiving changes in a weight value or search criterion of an associated category. A new ordering of the non-exact matching records is displayed in real-time based on the new received weight values or search criterion. The user interface may also provide a mapping tool, a search-result selection function, and/or one or more drill down tools. The user interface may provide any tool or function alone or in any combination. | 2017-12-21 |
20170364536 | IMAGE PROCESSING AND MATCHING - A configured machine performs image matching and retrieval of natural images that may depict logos. The machine generates and uses color-localized spatial masks, which may be computationally less expensive than spatial verification techniques. Key points are detected within images that form a reference database of images. Local masks are defined by the machine around each key point based on the scale and orientation of the key point. To utilize color information presented in logo images, ordered color histograms may be extracted by the machine from locally masked regions of each image. A cascaded index may then be constructed for both visual descriptors and color histograms. For faster matching, the cascaded index maps the visual descriptors and color histograms to a list of relevant or similar images. This list may then be ranked to generate relevant matches for an input query image. | 2017-12-21 |
20170364537 | IMAGE-AIDED DATA COLLECTION AND RETRIEVAL - The disclosed invention includes a method and a system for performing image-aided data collection and retrieval, where the data collection and retrieval is related to one or more persons, or subjects or objects associated with one or more persons. The data collection and retrieval is performed with the help of one or more images that contain one or more objects of interest and at least some annotation data related to at least one object of interest. The data collection and retrieval involves: image and annotation collection, image analysis and searching for similar images, data searching and processing, results aggregation and presentation, and optionally collection of feedback. | 2017-12-21 |
20170364538 | LOADING COLLABORATIVE DATASETS INTO DATA STORES FOR QUERIES VIA DISTRIBUTED COMPUTER NETWORKS - Various embodiments relate generally to data science and data analysis, computer software and systems, and wired and wireless network communications to provide an interface between repositories of disparate datasets and computing machine-based entities that seek access to the datasets, and, more specifically, to a computing and data storage platform that facilitates consolidation of one or more datasets, whereby a collaborative data layer and associated logic facilitate, for example, efficient access to, and implementation of, collaborative datasets. In some examples, a system may include an atomized workflow loader configured to receive an atomized dataset to load into a data store, and to determine resource requirements data to describe at least one resource requirement. The atomized workflow loader may be further configured to select a data store type based on a resource requirement, and perform a load operation of the atomized dataset as a function of the data store type. | 2017-12-21 |
20170364539 | PLATFORM MANAGEMENT OF INTEGRATED ACCESS OF PUBLIC AND PRIVATELY-ACCESSIBLE DATASETS UTILIZING FEDERATED QUERY GENERATION AND QUERY SCHEMA REWRITING OPTIMIZATION - Various techniques are described for platform management of integrated access of public and privately-accessible datasets utilizing federated query generation and query schema rewriting optimization, including receiving at a dataset access platform a query formatted according to a first data schema, generating a copy of the query, saving the query and the copy to a datastore, parsing the copy of the query in the first schema using an inference engine, determining whether the query comprises data associated with an access control condition associated with accessing the dataset, the access control condition being configured to indicate whether the query is permitted to access the dataset, and rewriting, using a proxy server, the copy of the query in a second schema by converting the copy of the query into a triple associated with the query and another triple associated with the access control condition. | 2017-12-21 |
20170364540 | NORMALIZED SEARCHABLE CLOUD LAYER - An example system for indexing heterogeneous resources includes a data module that invokes one or more APIs, and responsive to the invoked one or more APIs, receives a first set of attributes of one or more cloud resources of a first subset of the set of cloud resources and a second set of attributes of one or more cloud resources of a second subset of the set of cloud resources. The system also includes a normalization module that for at least one attribute of the first and second sets of attributes, searches a database for a normalized attribute corresponding to the respective one attribute, normalizes based on the uniform schema the respective attribute, and places the normalized attribute in a data structure. The system further includes an indexing module that indexes the normalized attributes in the data structure. | 2017-12-21 |
20170364541 | METHOD AND APPARATUS FOR TABLE AGING IN A NETWORK SWITCH - Embodiments of the present invention relate to a centralized table aging module that efficiently and flexibly utilizes an embedded memory resource, and that enables and facilitates separate network controllers. The centralized table aging module performs aging of tables in parallel using the embedded memory resource. The table aging module performs an age marking process and an age refreshing process. The memory resource includes age mark memory and age mask memory. Age marking is applied to the age mark memory. The age mask memory provides per-entry control granularity regarding the aging of table entries. | 2017-12-21 |
20170364542 | SENSOR MODULE REGISTRATION AND CONFIGURATION - In an approach for providing a framework to register a sensor module and manifest the capability the sensor module supports, a processor receives a first module registration request, wherein the first module registration request includes a sensor module and metadata. A processor determines that the first module registration request is compatible with a second module registration request by comparing data stored in a module database associated with the second module registration request to data within the first module registration request. A processor updates the module database with the metadata of the first module registration request. A processor generates a module delegate, wherein the module delegate provides data access and interaction interfaces based on the metadata. A processor generates a custom configuration component. | 2017-12-21 |
20170364543 | PROVIDING A DISTRIBUTED TRANSACTION INFORMATION STORAGE SERVICE - Techniques are described for providing a storage service that stores information about large numbers of transactions in a persistent manner, such as with a high degree of reliability, availability and scalability based at least in part on use of a distributed computing and storage system. In some situations, the transaction information storage service stores various information about transactions that each include at least one monetary payment (e.g., a micro-payment) between financial accounts of two or more of numerous users having accounts with one or more entities. The transaction information storage service may be provided by or otherwise affiliated with a merchant, and customers of the merchant may purchase usage of the storage service for programs executed by or otherwise affiliated with the customers, with the storage service available to remote executing programs via a defined API of the storage service, such as a Web services-based API. | 2017-12-21 |
20170364544 | CROSS-MEDIA STORAGE COORDINATION - Methods and a media system and storage system for cross-media storage coordination include but are not limited to storing a first data version of specified content based on a particular media format: storing at least a second data version of related content based on a different media format: providing a cross-reference between the first data version and the at least second data version to enable coordinated management by a designated user and/or an approved device for search and possible retrieval of the first data version and/or the at least second data version: and implementing communication access by one or more parties and/or the designated user via a communication type that is correlated with the first data version and/or the at least second data version. | 2017-12-21 |
20170364545 | SYSTEMS AND METHODS FOR IMPLEMENTING A MULTI-HOST RECORD LOCK MECHANISM - A method includes determining, by a processor, whether a program check condition exists. The method further includes determining, by the processor, whether a lock descriptor of a lock in a file lock table satisfies an unlocking condition. The method further includes releasing, by the processor, the lock by setting the lock descriptor's host identifier as zero. The method further includes determining, by the processor, whether any lock in the file lock table satisfies a lock conflict condition. The method further includes determining, by the processor, whether the file lock table includes any lock descriptor that satisfies a locking condition. The method further includes creating, by the processor, a new lock using the lock descriptor that satisfies the locking condition. | 2017-12-21 |