| Patent application number | Description | Published |
|---|
| 20100132028 | METHOD FOR IMPLEMENTING SECURITY-RELATED PROCESSING ON PACKET AND NETWORK SECURITY DEVICE - Embodiments of the present invention provide method for implementing security-related processing on packet and a network security device. Through establishing a relationship between stream attribute information of an initial packet of a stream and security-related processing information implemented on the initial packet, when a succeeding packet of the stream is received, the previously stored relationship is acquired according to stream attribute information of the succeeding packet, the security-related processing is implemented on the succeeding packet according to the security-related processing information in the relationship. Therefore, according to the method for implementing security-related processing on packet and the network security device provided by the present invention, the process of searching for security information entries for succeeding packets of a stream is not required, the security-related processing procedure of the packet is thus accelerated, and the packet processing efficiency is improved. | 05-27-2010 |
| 20100195647 | METHOD AND APPARATUS FOR PACKET PROCESSING - The present invention discloses a packet processing apparatus and method. The packet processing apparatus is applied to an L4˜L7 network device, including a plurality of interface processing units and a plurality of service processing units, the interface processing units are connected with the service processing units through a first connection unit; and each of the interface processing units is adapted to select, after receiving a packet from outside, a service processing unit from all the service processing units and transmit the packet to the selected service processing unit; and each of the service processing units is adapted to perform service processing to the packet after receiving the packet. The present invention improves packet processing capability and reliability of the L4˜L7 network device. | 08-05-2010 |
| 20100306466 | METHOD FOR IMPROVING DISK AVAILABILITY AND DISK ARRAY CONTROLLER - The present invention discloses a method for improving disk availability and a disk array controller. The method includes: determining, when detecting that part of tracks of a disk in a disk array is damaged, a first master data storage space in a damaged track; selecting an idle first backup data storage space from at least one back data storage space, establishing a corresponding relation between an address of a strip contained in the first master data storage space and an address of a strip contained in the first backup data storage space; and receiving an instruction for accessing the strip contained in the first master data storage space, finding the strip contained in the first backup data storage space according to an address of the strip in the instruction and the corresponding relation, and accessing the strip contained in the first backup data storage space. | 12-02-2010 |
| 20100322239 | METHOD AND AN APPARATUS FOR PROCESSING PACKETS - The present invention discloses a packet processing method, which applies to a high-performance and scalable flow processing system architecture. The service board performs security processing for packets received from external devices by using the firewall function before sending them to the main CPU; similarly, the service board also performs security processing for packets sent from the main CPU by using the firewall function before the main CPU sends them to external devices. The methods of the present invention utilize high performance and good scalability of the new architecture. In a network with heavy and high-speed traffic, the service board performs security processing for packets by using the firewall function and then transmits the valid packets to the main CPU. Thus, the main CPU is protected by the firewall function against attack packets. | 12-23-2010 |
| 20110153584 | METHOD, SYSTEM, AND ENGINE DISPATCH FOR CONTENT SEARCH - The present invention discloses a method, system, and engine dispatch unit for content search, wherein the engine dispatch unit connects to at least a processor and two search engines, obtains objects from the processor(s), and selects search engines to perform content search according to the load of each search engine; the selected search engines perform content search for the objects according to preset matching rules. Solutions of the present invention can effectively improve content search performance. | 06-23-2011 |
| 20110249674 | APPARATUS AND METHOD FOR PROCESSING PACKET - The present invention provides an apparatus and method for processing a packet. An interface processing module selects one from all service processing modules as a service processing module for processing a packet; if the service processing module needs to perform tunnel processing for the packet, the service processing module transmits the packet after performing the tunnel processing; if another service processing module needs to perform tunnel processing for the packet, the service processing module transmits the packet to a service processing module needing to perform tunnel processing for the packet. According to the present invention, the packet can be processed uniformly by the service processing module, so it is not unnecessary to store session states in the service processing modules, and also not unnecessary to perform synchronization between the service processing modules, which greatly decreases complexity of processing the packet and saves system bandwidth. | 10-13-2011 |
| 20130265877 | MULTIPLE PATH LOAD DISTRIBUTION FOR HOST COMMUNICATION WITH A TAPE STORAGE DEVICE - A multiple port host communicates with multiple tape drives by requesting information associated with a particular tape. Information of availability status of a plurality of host ports is provided. Traversing all host initiator ports finds a host port with no or the least traffic load for a tape reservation request. A host port's traffic load calculation uses instant and the updated historical traffic as primary and secondary factors. Every host port's traffic load is updated for every read/write command, and is used for path selection of reservation requests. The instant load is relatively sensitive but will be zero under light load. The historical load is aware of the light load though it is not sensitive enough when a burst I/O occurs. With the traffic load calculated from instant and historical loads, the distribution of tape tasks is spread evenly among host initiator ports under light load and burst I/O scenarios. | 10-10-2013 |
| 20130268693 | MULTIPLE PATH LOAD DISTRIBUTION FOR HOST COMMUNICATION WITH A TAPE STORAGE DRIVE - A method for a multiple port host to communicate with multiple tape drives is provided by requesting information associated with a particular tape. Information is provided that is indicative of availability status of a plurality of host ports. It is determined if there is a traffic load or a reservation load on an active host port. The active host port is reserved if there is not a traffic load or a reservation load on the active host port. Another method receives input indicative of read/write information from at least one tape drive at a host bus adapter. A host port count is increased, and a size of the read/write information is increased until the read/write information is not accepted by the host bus adapter. The host port count is decreased, and the size of the read/write information is decreased until the read/write information is accepted. | 10-10-2013 |
| 20140258579 | MULTIPLE PATH LOAD DISTRIBUTION FOR HOST COMMUNICATION WITH A TAPE STORAGE DEVICE - A multiple port host communicates with multiple tape drives by requesting information associated with a particular tape. Information of availability status of a plurality of host ports is provided. Traversing all host initiator ports finds a host port with no or the least traffic load for a tape reservation request. A host port's traffic load calculation uses instant and the updated historical traffic as primary and secondary factors. Every host port's traffic load is updated for every read/write command, and is used for path selection of reservation requests. The instant load is relatively sensitive but will be zero under light load. The historical load is aware of the light load though it is not sensitive enough when a burst I/O occurs. With the traffic load calculated from instant and historical loads, the distribution of tape tasks is spread evenly among host initiator ports under light load and burst I/O scenarios. | 09-11-2014 |
| 20150293423 | ELECTROPHORETIC DISPLAY DEVICE AND METHOD FOR MANUFACTURING THE SAME - Embodiments of the present invention relates to an electrophoretic display (EPD) device and a method for manufacturing the EPD device. The EPD device includes an electrophoretic substrate and a drive substrate arranged opposite to each other and a plurality of microcups disposed between the electrophoretic substrate and the drive substrate, each microcup includes a cup body for defining an accommodating space; a thickness of the cup body on one side of the microcup closer to the electrophoretic substrate is less than a thickness of the cup body on one side of the microcup closer to the drive substrate; and a cup surface of the microcup is a cambered surface which is away from a vertical central axis of the microcup and concave towards the cup body. | 10-15-2015 |
| 20150300897 | SENSOR DEVICE AND RESIDUAL STRESS DETECTION SYSTEM EMPLOYING SAME - A sensor device, comprising two symmetrically disposed sonolucent wedges ( | 10-22-2015 |
| 20160025325 | COSMETIC MIRROR - Embodiments of the present invention provide a cosmetic mirror, relating to the technical field of electronic equipment. The cosmetic mirror comprises a mirror surface part and a lighting part, wherein the mirror surface of the mirror surface part and the light-emitting surface of the lighting part are positioned on the same side; and the lighting part is a surface light source formed by an organic light-emitting diode panel. By adopting the cosmetic mirror with such a structure, the thickness of the light source in the cosmetic mirror can be reduced, and the quality of the light source can be improved. | 01-28-2016 |
| 20160033452 | Fixed Value Residual Stress Test Block And Manufacturing And Preservation Method Thereof - A fixed value residual stress test block, comprising a main body ( | 02-04-2016 |
| Patent application number | Description | Published |
|---|
| 20090150153 | GRAPHEME-TO-PHONEME CONVERSION USING ACOUSTIC DATA - Described is the use of acoustic data to improve grapheme-to-phoneme conversion for speech recognition, such as to more accurately recognize spoken names in a voice-dialing system. A joint model of acoustics and graphonemes (acoustic data, phonemes sequences, grapheme sequences and an alignment between phoneme sequences and grapheme sequences) is described, as is retraining by maximum likelihood training and discriminative training in adapting graphoneme model parameters using acoustic data. Also described is the unsupervised collection of grapheme labels for received acoustic data, thereby automatically obtaining a substantial number of actual samples that may be used in retraining. Speech input that does not meet a confidence threshold may be filtered out so as to not be used by the retrained model. | 06-11-2009 |
| 20090248422 | INTRA-LANGUAGE STATISTICAL MACHINE TRANSLATION - Training data may be provided, the training data including pairs of source phrases and target phrases. The pairs may be used to train an intra-language statistical machine translation model, where the intra-language statistical machine translation model, when given an input phrase of text in the human language, can compute probabilities of semantic equivalence of the input phrase to possible translations of the input phrase in the human language. The statistical machine translation model may be used to translate between queries and listings. The queries may be text strings in the human language submitted to a search engine. The listing strings may be text strings of formal names of real world entities that are to be searched by the search engine to find matches for the query strings. | 10-01-2009 |
| 20090327260 | CONSTRUCTING A CLASSIFIER FOR CLASSIFYING QUERIES - To construct a classifier, a data structure correlating queries to items identified by the queries is received, where the data structure contains initial labeled queries that have been labeled with respect to predetermined classes, and unlabeled queries that have not been labeled with respect to the predetermined classes. The data structure is used to label at least some of the unlabeled queries with respect to the predetermined classes. Queries in the data structure that have been labeled with respect to the predetermined classes are used as training data to train the classifier. | 12-31-2009 |
| 20100076765 | STRUCTURED MODELS OF REPITITION FOR SPEECH RECOGNITION - Described is a technology by which a structured model of repetition is used to determine the words spoken by a user, and/or a corresponding database entry, based in part on a prior utterance. For a repeated utterance, a joint probability analysis is performed on (at least some of) the corresponding word sequences as recognized by one or more recognizers) and associated acoustic data. For example, a generative probabilistic model, or a maximum entropy model may be used in the analysis. The second utterance may be a repetition of the first utterance using the exact words, or another structural transformation thereof relative to the first utterance, such as an extension that adds one or more words, a truncation that removes one or more words, or a whole or partial spelling of one or more words. | 03-25-2010 |
| 20100268725 | ACQUISITION OF SEMANTIC CLASS LEXICONS FOR QUERY TAGGING - A user's search experience may be enhanced by providing additional content based upon an understanding of the user's intent. Query tagging, the assigning of semantic labels to terms within a query, is one technique that may be utilized to determine the context of a user's search query. Accordingly, as provided herein, a query tagging model may be updated using one or more stratified lexicons. A list data structure (e.g., lists of phrases obtained from web pages) and seed distribution data (e.g., pre-labeled probability data) may be used by a graph learning technique to obtain an expanded set of phrases and their respective probabilities of corresponding with particular lexicons (e.g., semantic class lexicons). The expanded set of phrases may be used to group phrases into stratified lexicons. The stratified lexicons may be used as features for updating and/or executing the query tagging model. | 10-21-2010 |
| 20100312782 | PRESENTING SEARCH RESULTS ACCORDING TO QUERY DOMAINS - A query may be applied against search engines that respectively return a set of search results relating to various items discovered in the searched data sets. However, presenting numerous and varied search results may be difficult on mobile devices with small displays and limited computational resources. Instead, search results may be associated with search domains representing various information types (e.g., contacts, public figures, places, projects, movies, music, and books) and presented by grouping search results with associated query domains, e.g., in a tabbed user interface. The query may be received through an input device associated with a particular input domain, and may be transitioned to the query domain of a particular search engine (e.g., by recognizing phonemes of a voice query using an acoustic model; matching phonemes with query terms according to a pronunciation model; and generating a recognition result according to a vocabulary of an n-gram language model.) | 12-09-2010 |
| 20100318531 | SMOOTHING CLICKTHROUGH DATA FOR WEB SEARCH RANKING - Described is a technology for using clickthrough data (e.g., based on data of a query log) in learning a ranking model that may be used in online ranking of search results. Clickthrough data, which is typically sparse (because many documents are often not clicked or rarely clicked), is processed/smoothed into smoothed clickthrough streams. The processing includes determining similar queries for a document with incomplete (insufficient) clickthrough data to provide expanded clickthrough data for that document, and/or by estimating at least one clickthrough feature for a document when that document has missing (e.g., no) clickthrough data. Similar queries may be determined by random walk clustering and/or session-based query analysis. Features extracted from the clickthrough streams may be used to provide a ranking model which may then be used in online ranking of documents that are located with respect to a query. | 12-16-2010 |
| 20110125791 | QUERY CLASSIFICATION USING SEARCH RESULT TAG RATIOS - Techniques are described herein for classifying a search query with respect to query intent using search result tag ratios. A tag is a character or a combination of characters (e.g., one or more words) that indicates a property of a document, such as a topic of the document, a type of entity (i.e., subject matter) the document references, etc. A search result tag ratio is defined as a fraction (e.g., a proportion, a percentage, etc.) of the documents in a search result that includes a respective tag. A search query may be classified based on back-off ratios, which are tag ratios of search queries that are related to the search query to be classified. Tag ratios may be pre-computed (i.e., calculated before the corresponding search queries are received from users). | 05-26-2011 |
| 20110161260 | USER-DRIVEN INDEX SELECTION - Techniques for index building are described. Clickcounts of respective training URLs may indicate a number of times that corresponding training URLs were clicked in search engine results. A machine learning algorithm implemented on a computer computes a trained model that is then stored. The clickcounts and respective URLs are passed to the machine learning algorithm to train the model to predict probabilities based on feature vectors of URLs. An index of web pages is built for a set of URLs that identify the web pages. Feature vectors for the URLs are computed. Probabilities of the web pages of the URLs being searched in the future by users may be computed by processing the feature vectors with the trained model. The probabilities may be used to determine which of the URLs to include in the index. | 06-30-2011 |
| 20110251844 | GRAPHEME-TO-PHONEME CONVERSION USING ACOUSTIC DATA - Described is the use of acoustic data to improve grapheme-to-phoneme conversion for speech recognition, such as to more accurately recognize spoken names in a voice-dialing system. A joint model of acoustics and graphonemes (acoustic data, phonemes sequences, grapheme sequences and an alignment between phoneme sequences and grapheme sequences) is described, as is retraining by maximum likelihood training and discriminative training in adapting graphoneme model parameters using acoustic data. Also described is the unsupervised collection of grapheme labels for received acoustic data, thereby automatically obtaining a substantial number of actual samples that may be used in retraining. Speech input that does not meet a confidence threshold may be filtered out so as to not be used by the retrained model. | 10-13-2011 |
| 20110270815 | EXTRACTING STRUCTURED DATA FROM WEB QUERIES - Described is processing a web query into structured data, such as for use in formulating a database query. A classifier and segmental conditional random field (CRF) model classify and segment a query into labeled segments used to obtain the structured data. The structured data includes a class, an intent set corresponding to data sought by the query, and an attribute set corresponding to an attribute name and attribute value representing each modifier in the query. The structured data may be converted into a query language (e.g., SQL) query to query the structured data source; e.g., the class may be used to select a database, the attribute set used to find one or more columns and a row in the database, and the intent set matched to a column, whose row data is the result being sought. A web search engine may return the database query as part of its results. | 11-03-2011 |
| 20110307479 | Automatic Extraction of Structured Web Content - Described is extracting structured information from web pages for use in directly answering queries with data items from the structured data. Users' post-search browsing behaviors (search trails) are treated as implicit labels as to the relevance between web content and user queries, and are used to determine wrappers for extracting structured information. In one implementation, a system identifies websites from web search logs, builds wrappers from users' search trails, filters out bad wrappers (from inconsistent user clicks), and combines structured information from different web sites, e.g., for each query. | 12-15-2011 |
| 20110314003 | TEMPLATE CONCATENATION FOR CAPTURING MULTIPLE CONCEPTS IN A VOICE QUERY - Architecture that provides the capability to identify which parts (terms and phrases) of a voice query have been covered by predefined phrase templates, and then to concatenate matching phrase templates into a new paraphrased query. A match-drop-continue algorithm is disclosed that progressively masks out the portions (phrases, terms) of the query matched to the phrase templates. Ultimately, the matched phrase templates are accumulated and organized together dynamically into a rephrased version of the original voice query. A user interface is provided that allows the user to confirm/summarize the multiple concepts in a progressive manner. | 12-22-2011 |
| 20120158703 | SEARCH LEXICON EXPANSION - One or more techniques and/or systems are disclosed for creating an expanded or improved lexicon for use in search-based semantic tagging. A set of first documents can be identified using a set of first lexicon elements as queries, and one or more first document patterns can be extracted from the set of first documents. The document patterns can be used to find one or more second documents in a query log that comprise the document patterns, which are associated with query terms used to return the second documents. The query terms for the second documents can be extracted and used to expand the lexicon. Elements within the lexicon may be weighted based upon relevance to different query domains, for example. | 06-21-2012 |
| 20120323967 | Spelling Using a Fuzzy Pattern Search - A multimedia system configured to receive user input in the form of a spelled character sequence is provided. In one implementation, a spell mode is initiated, and a user spells a character sequence. The multimedia system performs spelling recognition and recognizes a sequence of character representations having a possible ambiguity resulting from any user and/or system errors. The sequence of character representations with the possible ambiguity yields multiple search keys. The multimedia system performs a fuzzy pattern search by scoring each target item from a finite dataset of target items based on the multiple search keys. One or more relevant items are ranked and presented to the user for selection, each relevant item being a target item that exceeds a relevancy threshold. The user selects the indented character sequence from the one or more relevant items. | 12-20-2012 |
| Patent application number | Description | Published |
|---|
| 20110291146 | DRY FLUX BONDING DEVICE AND METHOD - Methods of forming devices, including LED devices, are described. The devices may include fluorinated compound layers. The methods described may utilize a plasma treatment to form the fluorinated compound layers. The methods described may operate to produce an intermetallic layer that bonds two substrates such as semiconductor wafers together in a relatively efficient and inexpensive manner. | 12-01-2011 |
| 20130119419 | MAGNETICALLY ADJUSTING COLOR-CONVERTING MATERIALS WITHIN A MATRIX AND ASSOCIATED DEVICES, SYSTEMS, AND METHODS - Magnetically adjusting color-converting particles within a matrix and associated devices, systems, and methods are disclosed herein. A magnetic-adjustment process can include applying a magnetic field to a mixture including a non-solid matrix and a plurality of color-converting particles (e.g. magnetically anisotropic color-converting particles). The magnetic field can cause the plurality of color-converting particles to move into a generally non-random alignment (e.g., a generally non-random magnetic alignment and/or a generally non-random shape alignment) within the non-solid matrix. The non-solid matrix then can be solidified to form a solid matrix. A magnetic-adjustment process can be performed in conjunction with testing and/or product binning of solid-state radiation transducer devices. For example, a position, direction, strength, or duration of a magnetic field used to perform a magnetic-adjustment process can be controlled according to optical output collected from a solid-state radiation transducer device. Measuring the optical output and performing the magnetic-adjustment process can be at least partially concurrent. | 05-16-2013 |
| 20130119527 | SEMICONDUCTOR DIE ASSEMBLIES WITH ENHANCED THERMAL MANAGEMENT, SEMICONDUCTOR DEVICES INCLUDING SAME AND RELATED METHODS - A semiconductor die assembly comprises a plurality of semiconductor dice in a stack. Another semiconductor die is adjacent to the stack and has a region, which may comprise a relatively higher power density region, extends peripherally beyond the stack. Conductive elements extend between and electrically interconnect integrated circuits of semiconductor dice in the stack and of the other semiconductor die. Thermal pillars are interposed between semiconductor dice of the stack, and a heat dissipation structure, such as a lid, is in contact with an uppermost die of the stack and the high power density region of the other semiconductor die. Other die assemblies, semiconductor devices and methods of managing heat transfer within a semiconductor die assembly are also disclosed. | 05-16-2013 |
| 20130119528 | STACKED SEMICONDUCTOR DIE ASSEMBLIES WITH MULTIPLE THERMAL PATHS AND ASSOCIATED SYSTEMS AND METHODS - Stacked semiconductor die assemblies with multiple thermal paths and associated systems and methods are disclosed herein. In one embodiment, a semiconductor die assembly can include a plurality of first semiconductor dies arranged in a stack and a second semiconductor die carrying the first semiconductor dies. The second semiconductor die can include a peripheral portion that extends laterally outward beyond at least one side of the first semiconductor dies. The semiconductor die assembly can further include a thermal transfer feature at the peripheral portion of the second semiconductor die. The first semiconductor dies can define a first thermal path, and the thermal transfer feature can define a second thermal path separate from the first semiconductor dies. | 05-16-2013 |
| 20130299868 | DRY FLUX BONDING DEVICE AND METHOD - Methods of forming devices, including LED devices, are described. The devices may include fluorinated compound layers. The methods described may utilize a plasma treatment to form the fluorinated compound layers. The methods described may operate to produce an intermetallic layer that bonds two substrates such as semiconductor wafers together in a relatively efficient and inexpensive manner. | 11-14-2013 |
| 20140147989 | TEMPORARY ADHESIVES INCLUDING A FILLER MATERIAL AND RELATED METHODS - Temporary adhesives include a thermoplastic polymer comprising from about 30% by weight to about 80% by weight of the temporary adhesive, a solvent comprising from about 20% by weight to about 70% by weight of the temporary adhesive, and a filler material comprising from about 0.2% to about 5% by weight of the temporary adhesive. Methods of processing a semiconductor device wafer include bonding the semiconductor device wafer to a surface of a carrier substrate using a temporary adhesive including a filler material comprising from about 0.2% to about 5% by weight of the temporary adhesive, thinning the semiconductor device wafer, and, while the temporary adhesive remains on the surface of the carrier substrate proximate a peripheral edge thereof, subjecting the thinned semiconductor device wafer to one or more back side processing operations. Methods of forming a thinned semiconductor wafer include using such a temporary adhesive. | 05-29-2014 |
| 20140367844 | UNDERFILL-ACCOMMODATING HEAT SPREADERS AND RELATED SEMICONDUCTOR DEVICE ASSEMBLIES AND METHODS - Heat spreaders for dissipating heat from semiconductor devices comprise a contact surface located within a recess on an underside of the heat spreader, the contact surface being configured to physically and thermally attach to a semiconductor device, and a trench extending into the heat spreader adjacent to the contact surface sized and configured to receive underfill material extending from the semiconductor device into the trench. Related semiconductor device assemblies may include these heat spreader and methods may include physically and thermally attaching these heat spreaders to semiconductor devices such that underfill material extends from a semiconductor device into the trench. | 12-18-2014 |
| 20150348956 | STACKED SEMICONDUCTOR DIE ASSEMBLIES WITH MULTIPLE THERMAL PATHS AND ASSOCIATED SYSTEMS AND METHODS - Stacked semiconductor die assemblies with multiple thermal paths and associated systems and methods are disclosed herein. In one embodiment, a semiconductor die assembly can include a plurality of first semiconductor dies arranged in a stack and a second semiconductor die carrying the first semiconductor dies. The second semiconductor die can include a peripheral portion that extends laterally outward beyond at least one side of the first semiconductor dies. The semiconductor die assembly can further include a thermal transfer feature at the peripheral portion of the second semiconductor die. The first semiconductor dies can define a first thermal path, and the thermal transfer feature can define a second thermal path separate from the first semiconductor dies. | 12-03-2015 |
| Patent application number | Description | Published |
|---|
| 20120155460 | ON IP FRAGMENTATION IN GTP TUNNEL - The present invention relates to a method for improving IP fragmentation and transmission of user payload between a User Equipment, UE | 06-21-2012 |
| 20130122912 | Selective Radio Bearer - This disclosure relates to a source mobility management node and a method in a source mobility management node for handling a mobility procedure moving a wireless terminal to a target system comprising a target mobility management node, the source mobility management node being configured to be operatively comprised in a cellular system. The method comprises the actions of: sending, to the target mobility management node, a communications message the communications message comprising an information element indicating that there is no active Radio Access Bearer, RAB, or Packet Flow Context, PFC, associated with a bearer context for the wireless terminal. | 05-16-2013 |
| 20130279464 | IP FRAGMENTATION IN GTP TUNNEL - The present invention relates to a method for improving IP fragmentation and transmission of user payload between a User Equipment, UE ( | 10-24-2013 |
| 20140068025 | Method and Node For Automatically Exchanging Network Service Provider Information - A method is provided for automatically exchanging network service provider information between two sets of network service providers. The method comprises configuring at least one address of a proxy function of a second set of network service providers for a proxy function of a first set of network service providers; sending network service provider information of the first set of network service providers to the proxy function of the second set of network service providers with the at least one address of the proxy function of the second set of network service providers; and receiving network service provider information of the second set of network service providers from the proxy function of the second set of network service providers. The network service provider information includes information for addressing the network service provider and ID of service provided by the network service provider. | 03-06-2014 |
| 20140112151 | 3RD GENERATION DIRECT TUNNEL (3GDT) OPTIMIZATION - Example embodiments presented herein are directed towards a system, and corresponding method, for determining 3rd Generation Direct Tunnel (3GDT) usage based on the payload usage of a user. | 04-24-2014 |
| 20140128081 | SGSN-MME CENTRIC HANDOVER - Some example embodiments presented herein may be directed towards a core network node, and corresponding method, for determining a modification and/or utilization of radio resources. The core network node may be in a Radio Network. Some example embodiments may comprise receiving, in the core network node, a notification for a radio resource modification and/or utilization for a User Equipment (UE) based on at least one handover criterion. Some example embodiments may further comprise establishing and/or modifying the radio resource based on the at least one handover criterion. | 05-08-2014 |
| 20140160936 | IMPLEMENTATION OF PACKET DATA SERVICE IN A MOBILE COMMUNICATION NETWORK - A method for transferring a data packet associated with a service from a packet data network to a mobile communication network, be characterized by comprising steps of: forming a message by adding either a service identifier (SI) for identifying the service or an indicator for indicating that the data packet is associated with the SI to the data packet, the SI corresponding to a session identifier for the data packet; and sending the message from the packet data network to the mobile communication network. | 06-12-2014 |
| 20150069844 | POWER STORAGE MODULE AND POWER STORAGE DEVICE - A power storage module and a power storage device are disclosed. The power storage module and the power storage device include a DC/AC converter, a first power storage element, a second power storage element and at least one DC/DC converter. The first power storage element is coupled to the DC side of the DC/AC converter to form a first power storage branch. The second power storage element is coupled to the DC side of the DC/AC converter to form a second power storage branch. The DC/DC converter is disposed on the first power storage branch or the second power storage branch. | 03-12-2015 |
| Patent application number | Description | Published |
|---|
| 20130124538 | Structured Search Queries Based on Social-Graph Information - In particular embodiments, a method includes receiving an unstructured text query, identifying nodes and edges from a social graph that correspond to n-grams in the text query, and then generating structured queries that include references to the identified nodes and edges. | 05-16-2013 |
| 20130191372 | Personalized Structured Search Queries for Online Social Networks - In particular embodiments, a method includes receiving an text query, identifying nodes and edges from a social graph that correspond to character strings from the text query, and then generating recommended queries that include references to the identified nodes and edges. | 07-25-2013 |
| 20130191416 | Detecting Social Graph Elements for Structured Search Queries - In particular embodiments, a method includes receiving an unstructured text query, parsing the text query to identify n-grams; determining a score that the n-grams correspond to particular nodes and edges from a social graph, identifying those nodes and edges with a score greater than a threshold score, and then generating structured queries that include references to the identified nodes and edges. | 07-25-2013 |
| 20140136564 | Grammar Model for Structured Search Queries - In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving an unstructured text query, identifying nodes and edges that correspond to n-grams of the text query, accessing a context-free grammar model, identifying grammars having query tokens that correspond to the identified nodes and edges, determining a score for each identified grammar, and then generating structured queries based on the identified grammars based on strings generated by the grammars. | 05-15-2014 |
| 20140222807 | Structured Search Queries Based on Social-Graph Information - In particular embodiments, a method includes receiving an unstructured text query, identifying nodes and edges from a social graph that correspond to n-grams in the text query, and then generating structured queries that include references to the identified nodes and edges. | 08-07-2014 |
| 20140222835 | Detecting Social Graph Elements for Structured Search Queries - In particular embodiments, a method includes receiving an unstructured text query, parsing the text query to identify n-grams; determining a score that the n-grams correspond to particular nodes and edges from a social graph, identifying those nodes and edges with a score greater than a threshold score, and then generating structured queries that include references to the identified nodes and edges. | 08-07-2014 |
| 20140222854 | Personalized Structured Search Queries for Online Social Networks - In particular embodiments, a method includes receiving an text query, identifying nodes and edges from a social graph that correspond to character strings from the text query, and then generating recommended queries that include references to the identified nodes and edges. | 08-07-2014 |
| 20140337371 | Filtering Suggested Structured Queries on Online Social Networks - In one embodiment, a method includes accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, receiving from a user an unstructured text query, generating a set of structured queries based on the text query, calculating a quality score based on the text query and the structured query for each structured query in the set, and filtering the set to remove each structured query having a quality score less than a threshold score. | 11-13-2014 |
| 20150286643 | Blending Search Results on Online Social Networks - In one embodiment, a method includes receiving from a first user of an online social network a search query input including one or more n-grams; generating a number of query commands based on the search query input; and searching one or more verticals to identify one or more objects stored by the vertical that match the query commands. Each vertical stores one or more objects associated with the online social network. The method also includes generating a number of search-result modules. Each search-result module corresponds to a query command of the number of query commands. Each search-result module includes references to one or more of the identified objects matching the query command corresponding to the search-result module. The method also includes scoring the search-result modules; and sending each search-result module having a score greater than a threshold score to the first user for display. | 10-08-2015 |
| 20150293931 | GRAMMAR MODEL FOR STRUCTURED SEARCH QUERIES - In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving an unstructured text query, identifying nodes and edges that correspond to n-grams of the text query, accessing a context-free grammar model, identifying grammars having query tokens that correspond to the identified nodes and edges, determining a score for each identified grammar, and then generating structured queries based on the identified grammars based on strings generated by the grammars. | 10-15-2015 |
| 20160041982 | Conditioned Search Ranking Models on Online Social Networks - In one embodiment, a method includes a computing system receiving a query from a first user, which can be parsed to identify i conditions associated with the query. The system may then identify one or more search results substantially matching the i conditions. Each search result may be associated with a feature vector of j features. The system may then access a conditioned ranking model that comprises j scoring functions for each i condition. The j scoring functions may correspond to j features of the feature vectors. A score for each search result may be calculated based on the i conditions and the j features. The system may then receive a selection of one of the search results from the first user, and in response modify one or more of the j scoring functions of the conditioned ranking model based on the selection. | 02-11-2016 |
| 20160048527 | FILTERING SUGGESTED STRUCTURED QUERIES ON ONLINE SOCIAL NETWORKS - In one embodiment, a method includes receiving an text query inputted by a first user from a client device of the first user, generating a set of structured queries based on the text query, each structured query in the set corresponding to a grammar of a context-free grammar model, wherein each structured query is based on a natural-language string generated by a grammar of the context-free grammar model and comprises one or more tokens, wherein one or more of the tokens of each structured query correspond to one or more objects associated with the online social network, respectively, filtering the set to remove one or more structured queries from the set, each removed structured query having a quality score less than a threshold quality score, and sending one or more of the structured queries from the post-filtered set to the client device of the first user for display. | 02-18-2016 |
| 20160063093 | Keyword Search Queries on Online Social Networks - In one embodiment, a method includes receiving from a client system of a first user an unstructured text query. The method includes parsing the text query to identify one or more n-grams. At least one of the n-grams is an ambiguous n-gram. The method includes searching a plurality of keyword generators to identify one or more keyword suggestions matching the ambiguous n-gram. The method further includes calculating a keyword score for each identified keyword suggestions and generating one or more suggested queries including one or more n-grams identified from the text query. The one or more identified keyword suggestions having a keyword score greater than a threshold keyword score. The method includes sending one or more of the suggested queries to the client system of the first user for display. | 03-03-2016 |
| 20160063115 | Blending by Query Classification on Online Social Networks - In one embodiment, a method includes receiving a search query from a first user and identifying one or more second nodes that match the search query. The method includes determining one or more search intents of the search query. Search intent may be based on one or more topics associated with the identified nodes and one or more node-types of the identified nodes. The method includes generating one or more search results corresponding to the search query, the search-results being generated based on the determined search intents. The method includes sending a search-results page to the client system of the first user for display. The search-results page may include one or more of the generated search results. | 03-03-2016 |
| 20160078096 | Filtering Structured Search Queries Based on Privacy Settings - In particular embodiments, a method includes receiving an unstructured text query, identifying nodes and edges from a social graph that correspond to n-grams in the text query, generating structured queries that include references to the identified nodes and edges, receiving a selection of a structured query, identifying target nodes that correspond to the structured query, and then generating search results that include target nodes with privacy settings where the nodes and edges along the path connecting the target node and the querying user are all visible to the user. | 03-17-2016 |
| Patent application number | Description | Published |
|---|
| 20140279891 | REPLICATION GROUP PARTITIONING - Methods and systems for replication group partitioning include analyzing historical workload data for a plurality of data elements to generate one or more transaction patterns and generating a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal. | 09-18-2014 |
| 20140279892 | REPLICATION GROUP PARTITIONING - Systems for replication group partitioning include a workload profiling module configured to analyze historical workload data for a plurality of data elements to identify and categorize one or more transaction patterns; and a recommendation module configured to generate a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal. | 09-18-2014 |
| 20140372374 | DIFFERENCE DETERMINATION IN A DATABASE ENVIRONMENT - Techniques are disclosed to determine differences between a source table and a target table in a database environment, as being persistent or transient. A first set of differences between the source table and the target table is determined at a first point in time. A second set of differences between the source table and the target table is determined at a second point in time subsequent to the first point in time. At least one of a set of persistent differences and a set of transient differences is determined. The set of persistent differences includes a set intersection of the first and second sets of differences, the set intersection being filtered based on matching non-key values of the differences. The set of transient differences includes a relative complement of the second set of differences in the first set of differences. | 12-18-2014 |
| 20150081637 | DIFFERENCE DETERMINATION IN A DATABASE ENVIRONMENT - Techniques are disclosed to determine differences between a source table and a target table in a database environment, as being persistent or transient. A first set of differences between the source table and the target table is determined at a first point in time. A second set of differences between the source table and the target table is determined at a second point in time subsequent to the first point in time. At least one of a set of persistent differences and a set of transient differences is determined. The set of persistent differences includes a set intersection of the first and second sets of differences, the set intersection being filtered based on matching non-key values of the differences. The set of transient differences includes a relative complement of the second set of differences in the first set of differences. | 03-19-2015 |
| 20160037692 | SHIELD TO IMPROVE ELECTROMAGNETIC INTERFERENCE (EMI) SUPPRESSION CAPABILITY - An apparatus is described for suppressing EMI emissions in an electrical device. In one example, the apparatus includes absorbing material surrounding at least a portion of an electrical component and electrically conductive material configured to contact at least one side of the absorbing material. | 02-04-2016 |
