| Patent application number | Description | Published |
|---|
| 20080205761 | Radical Set Determination For HMM Based East Asian Character Recognition - Exemplary techniques are described for selecting radical sets for use in probabilistic East Asian character recognition algorithms. An exemplary technique includes applying a decomposition rule to each East Asian character of the set to generate a progressive splitting graph where the progressive splitting graph comprises radicals as nodes, formulating an optimization problem to find an optimal set of radicals to represent the set of East Asian characters using maximum likelihood and minimum description length and solving the optimization problem for the optimal set of radicals. Another exemplary technique includes selecting an optimal set of radicals by using a general function that characterizes a radical with respect to other East Asian characters and a complex function that characterizes complexity of a radical. | 08-28-2008 |
| 20080208819 | GUI BASED WEB SEARCH - An exemplary computer implemented graphics-based Web search system includes a search input control and a results presentation control where the search input control is configured to receive user input to establish a relationship between a query and one or more information tags associated with search results provided by a search engine in response to the query and wherein the results presentation control is configured to re-order the search results in response to the relationship. Such a system allows a user to define and refine search intent and enhance the user's search experience. Various other exemplary systems, methods, devices, etc. are also disclosed. | 08-28-2008 |
| 20080208840 | Diverse Topic Phrase Extraction - Systems and methods for implementing diverse topic phrase extraction are disclosed. According to one implementation, multiple word candidate phrases are extracted from a corpus and weighed. One or more documents are re-weighed to identify less obvious candidate topics using latent semantic analysis (LSA). Phrase diversification is then used to remove redundancy and select informative and distinct topic phrases. | 08-28-2008 |
| 20080208841 | CLICK-THROUGH LOG MINING - Click-through log mining is described. Raw search click-through log data is processed to generate ordered query keywords, utilizing an algorithm to expand user-submitted keywords to include high frequency user queries, managing the keywords for a keyword expansion file, analyzing the algorithm performance on a bidding criteria, and identifying related phrases with similar page-click behaviors for advertisements. | 08-28-2008 |
| 20080215565 | SEARCHING HETEROGENEOUS INTERRELATED ENTITIES - Systems and methods for searching heterogeneous interrelated entities for a heterogeneous entities search query are disclosed herein. A user may enter the heterogeneous entities search query. The search retrieves and returns multiple types of heterogeneous entities. The retrieved heterogeneous interrelated entities are searched in a unified matrix that represents relationships between one or more heterogeneous entities. The retrieved heterogeneous interrelated entities may have one or more entity types. The set of retrieved interrelated entities may also be ranked based on the similarity between each entity and the search query. Feedback may also be incorporated into the system to improve search accuracy. | 09-04-2008 |
| 20080215574 | Efficient Retrieval Algorithm by Query Term Discrimination - An exemplary method for use in information retrieval includes, for each of a plurality of terms, selecting a predetermined number of top scoring documents for the term to form a corresponding document set for the term; receiving a plurality of terms, optionally as a query; ranking the plurality of terms for importance based at least in part on the document sets for the plurality of terms where the ranking comprises using an inverse document frequency algorithm; selecting a number of ranked terms based on importance where each selected, ranked term comprises its corresponding document set wherein each document in a respective document set comprises a document identification number; forming a union set based on the document sets associated with the selected number of ranked terms; and, for a document identification number in the union set, scanning a document set corresponding to an unselected term for a matching document identification number. Various other exemplary systems, methods, devices, etc. are also disclosed. | 09-04-2008 |
| 20080215997 | WEBPAGE BLOCK TRACKING GADGET - An exemplary web browser system includes a selection module for selecting a webpage block and recording information about a selected webpage block; a tracking module for tracking changes to a selected webpage block based at least in part on the recorded information for that webpage block; and a display module for displaying a selected webpage block wherein the tracking module updates the display module as to changes to the selected webpage block. Various other exemplary systems, methods, devices are also disclosed. | 09-04-2008 |
| 20080219556 | Radical-Based HMM Modeling for Handwritten East Asian Characters - Exemplary methods, systems, and computer-readable media for developing, training and/or using models for online handwriting recognition of characters are described. An exemplary method for building a trainable radical-based HMM for use in character recognition includes defining radical nodes, where a radical node represents a structural element of an character, and defining connection nodes, where a connection node represents a spatial relationship between two or more radicals. Such a method may include determining a number of paths in the radical-based HMM using subsequence direction histogram vector (SDHV) clustering and determining a number of states in the radical-based HMM using curvature scale space-based (CSS) corner detection. | 09-11-2008 |
| 20080249762 | CATEGORIZATION OF DOCUMENTS USING PART-OF-SPEECH SMOOTHING - A method and system is provided for classifying documents based on the subjectivity of the content of the documents using a part-of-speech analysis to help account for unseen words. A classification system trains a classifier using the parts of speech of training documents so that the classifier can classify unseen words based on the part of speech of the unseen word. The classification system then trains a part-of-speech model using the parts of speech of the n-grams of training data and labels of the training documents, and trains a term model using the term unigrams and labels. To classify a target document, the classification system applies the part-of-speech model to the part-of-speech n-grams of the target document and the term model to term n-grams of the target document. | 10-09-2008 |
| 20080249764 | Smart Sentiment Classifier for Product Reviews - A sentiment classifier is described. In one implementation, a system applies both full text and complex feature analyses to sentences of a product review. Each analysis is weighted prior to linear combination into a final sentiment prediction. A full text model and a complex features model can be trained separately offline to support online full text analysis and complex features analysis. Complex features include opinion indicators, negation patterns, sentiment-specific sections of the product review, user ratings, sequence of text chunks, and sentence types and lengths. A Conditional Random Field (CRF) framework provides enhanced sentiment classification for each segment of a complex sentence to enhance sentiment prediction. | 10-09-2008 |
| 20080256444 | Internet Visualization System and Related User Interfaces - Systems and methods are described for an Internet visualization system and related user interfaces. In one implementation, the system analyzes Internet search logs to determine most popular search queries across the world at a current time. A user interface displays a keyword of each of the most popular queries in a single visual display that relates each query to a geographical location of greatest popularity. The system can also filter queries according to demographics. In one implementation the user interface provides a 3-dimensional Internet visualization that adopts an ocean or seascape theme. The ocean floor displays a map of the world, and query bubbles rise from geographical locations on the map. The size and duration of each query bubble denotes the relative popularity of a given query. | 10-16-2008 |
| 20080281834 | Block tracking mechanism for web personalization - Described is a technology by which blocks of web pages may be selected, such as for building a user-personalized web page containing selected blocks. A selection mechanism, such as a browser toolbar add-on, provides a user interface for selecting blocks, and records information about selected blocks. A block tracking mechanism (e.g., a daemon program) uses the information to locate selected blocks of the web pages, including when the web page containing the block is updated with respect to content and/or layout. The block tracking mechanism may update a local gadget that when invoked, such as by browsing to a particular web page, which shows updated versions of the block on a personalized web page. Blocks may be efficiently located by processing trees representing web pages into reduced trees, and then by performing a minimum distance mapping algorithm on the reduced trees. | 11-13-2008 |
| 20080288348 | Ranking online advertisements using retailer and product reputations - A method for ranking online advertisements using retailer reputation and product reputation. In one implementation, a query may be received. Advertisements may be selected by determining a level of relevance between the query and each advertisement and selecting the advertisements with a level of relevance above a pre-determined level of relevance. A predicted reputation for a retailer and a predicted reputation for a product may be retrieved for each of the selected advertisements. The selected advertisements may then be ranked based on the predicted reputation for the retailer and the predicted reputation of the product. The ranking of the selected advertisements may be accomplished by calculating a ranking score for each selected advertisement based on the retailer predicted reputation and the product predicted reputation. The selected advertisements may then be displayed according to the ranking. | 11-20-2008 |
| 20080288481 | Ranking online advertisement using product and seller reputation - Described is a technology by which online advertisements for returning with a query response are ranked according to reputation. The reputation may correspond to a product or service and/or seller reputation. In one example, a set of relevant advertisement items are located and ranked using reputation data as a factor. For example, for each item, a ranking value is based on a mathematical combination of a product reputation score, a seller reputation score and a relevance score, with the items ranked by their computed values. The scores may be weighted differently. The reputation data may be mined from a review source, such as customer reviews available on the web. In one example implementation, a 3-gram model that considers terms in the review along with the two terms proceeding each term is used to analyze the reviews to determine whether each review is positive or negative with respect to the reputation. | 11-20-2008 |
| 20080288483 | Efficient retrieval algorithm by query term discrimination - Described is an efficient retrieval mechanism that quickly locates documents (e.g., corresponding to online advertisements) based on query term discrimination. A topmost subset (e.g., two) of search terms is selected according to their ranked importance, e.g., as ranked by inverted document frequency. The topmost terms are then used to narrow the number of rows of an inverted query index that are searched to find document identifiers and associated scores, such as computed offline by a BM25 algorithm. For example, for each document identifier of each important term, a fast search within each of the narrowed subset of rows (that also contain that document identifier) may be performed by comparing document identifiers to jump a pointer within each other row, followed by a binary search to locate a particular document. The scores of the set of particular documents may then be used to rank their relative importance for returning as results. | 11-20-2008 |
| 20080288491 | User segment suggestion for online advertising - Described is a behavioral targeting technology for online advertising, by which an original attribute is uniformly expanded. Users that meet an original attribute are aggregated into a mid-result used to determine similarity relative to candidate attribute types. The most similar candidate attributes are selected for the expanded attribute. A URL/URL pattern suggestion technology is provided, with similarity computed from users/URLs visited by the users. URLs are separated into URL tree nodes, for calculating the number of users who have visited each URL and the number of users who have visited the URL on a sub-tree whose root is the node. URL/URL patterns are output based on similarity. Domains are also suggested based on user-visits. Similarities between pairs of domains may be computed (e.g., offline), with an output for a given domain provided in based on its similarity with each other domain. | 11-20-2008 |
| 20080294778 | Network connection manager - Described herein is technology for, among other things, facilitating network communications. It involves various techniques for facilitating network communications by creating virtual named channels which allow applications and thereby users to communicate over a wide variety of networks interfaces without requiring specific knowledge or programming corresponding to the underlying network. Thus, the technology may provide a uniform interface to handle network connections on different types of computing devices and over different types of networks. | 11-27-2008 |
| 20080300971 | ADVERTISEMENT APPROVAL BASED ON TRAINING DATA - A system for determining whether to approve a target document (e.g., advertisement) is provided. The system trains a classifier using tuples of words from appropriate documents and tuples of words from inappropriate documents. To approve a target document, the system identifies tuples of words of the target document. The system then applies the classifier to the identified tuples to classify the document as being appropriate or inappropriate. If the document is classified as appropriate, the system automatically approves the document. | 12-04-2008 |
| 20080301080 | METHOD FOR RULE COMPLIANCE SITUATION CHECKING AND RELATED CHECKING SYSTEM - A method for rule compliance situation checking is provided. The method in one aspect, includes the steps of: a) building a rule model for predefined rules and building a business operational model for business processes; b) normalizing vocabularies in the rule model and the business operational model; c) checking whether the rule model is satisfied by the business operational model; and d) outputting a report on checking results. The present invention also provides a corresponding system for rule compliance checking. The rule compliance checking of the present invention allows users to perform fast and effective automatic checking of rule compliance, avoid interference of man-made factors in checking process to a great extent and thus guarantee veracity of checking results. | 12-04-2008 |
| 20080301117 | KEYWORD USAGE SCORE BASED ON FREQUENCY IMPULSE AND FREQUENCY WEIGHT - A method and system for assessing keyword usage based on frequency of usage of the keywords during various periods is provided. A keyword usage measurement system is provided with the frequency of keywords during various periods. The measurement system then calculates a recent usage score for a keyword by combining a frequency impulse score for the keyword with a frequency weight for the keyword. The frequency impulse score for a keyword indicates whether a recent change in the frequency of the keyword has occurred. The frequency weight for a keyword indicates a recent measure of the frequency of the keyword. | 12-04-2008 |
| 20080306979 | EDITING, CREATING, AND VERIFYING REORGANIZATION OF FLOWCHART, AND TRANSFORMING BETWEEN FLOWCHART AND TREE DIAGRAM - Provides methods for transforming a flowchart to an equivalent tree diagram, methods for transforming an equivalent tree diagram to a flowchart, methods for verifying reorganization of a flowchart, methods for editing a flowchart, methods for creating a flowchart and a flowchart editor. A flowchart includes one or more logic structures and one or more processing activities in said one or more logic structures. The method for transforming a flowchart to an equivalent tree diagram comprises: traversing said flowchart; transforming said one or more logic structures in said flowchart to one or more branching nodes in said tree diagram; and transforming one or more processing activities in said logic structures of said flowchart to one or more leaf nodes below corresponding branching nodes in said tree diagram. Further, edition of a flowchart and verification of reorganization of a flowchart are performed by utilizing an equivalent tree diagram. | 12-11-2008 |
| 20080307096 | Using a remote handheld device as a local device - A data connection can be established between a handheld device (e.g., a mobile phone or smartphone) and a computerized second device. For example, an action associated with a keyboard scancode can be mapped to a key on the keypad of the handheld device. A key press on a keypad of the handheld device can be translated into key press data. The key press data can be sent to the second device over the data connection, causing the action to be executed on the second device. | 12-11-2008 |
| 20080307349 | Sharing a computer display across a network - Detailed herein is a technology which, among other things, allows a source computer to display image data on a destination computer's display. In one approach to the technology, a method of sharing a monitor across a network is described. This method involves retrieving graphics information from a display driver on the source computer. This graphics information is compressed, and transmitted from the source computer to the destination computer. The compressed graphics information is then decompressed, and displayed on the destination display attached to the destination computer. | 12-11-2008 |
| 20080312899 | Software feature modeling and recognition - Described is a technology by which software program feature usage is located within a sequence of commands collected during program usage sessions. For example, feature generally corresponds to a series of commands, such as copy and paste. A visual modeling component is controlled via drag-and-drop operations to describe a feature model, which is then compiled by a compiler into a finite state machine. Noise models may be used to exclude any command in the sequence that is irrelevant to the feature usage. A recognition process uses the finite state machine to locate program feature usage within the sequence of recorded commands by matching command sub-sequences corresponding to the feature model via the state machine. An analyzer may then use the located matches to provide an analysis report on feature usage. | 12-18-2008 |
| 20080313149 | Analyzing software usage with instrumentation data - Described is a technology by which software instrumentation data collected from user program sessions are analyzed to output an analysis report or the like via example methods and an architecture configured for efficient operation. A client component queries a service for analysis related information. To process the query, the service works with a data manager, and via a high dimensional analysis component may use information processed from the software instrumentation data, such as in the form of one or more inverted indexes and/or raw value files. The service may include a usage analysis component, a feature recognition component that locates features from command sequences, a user recognition component and/or a program reliability component. One or more counterpart components at the client may generate analysis reports or the like based on the query results. The client also may maintain user libraries and feature libraries to facilitate analyses. | 12-18-2008 |
| 20080313180 | IDENTIFICATION OF TOPICS FOR ONLINE DISCUSSIONS BASED ON LANGUAGE PATTERNS - A topic identification system identifies topics of online discussions by iteratively identifying topic words or keywords of the online discussions and identifying language patterns associated with those keywords. The topic identification system starts out with an initial set of keywords and identifies language patterns that each include a keyword. The topic identification system then uses the identified language patterns to identify additional keywords of the online discussion that match the patterns. The topic identification system then again identifies language patterns using the keywords including the newly identified keywords. The topic identification system may repeat the process of identifying language patterns and keywords until a termination criterion is satisfied. | 12-18-2008 |
| 20080313184 | Multidimensional analysis tool for high dimensional data - Described is a technology by which high dimensional data may be efficiently analyzed, including by filtering, grouping, aggregating and/or sorting operations to provide an analysis result. For efficiency in the analysis, an inverted index may be built (e.g., as part of filtering), and/or a hash structure (e.g., as part of grouping). Analysis parameters specify dimensions, on which union and/or intersection operations are performed to provide a final dataset. The analysis tool provides a user interface for inputting analysis parameters and outputting information corresponding to an analysis result. The analysis tool may sort the information corresponding to the analysis result, e.g., to output the topmost or bottommost results. | 12-18-2008 |
| 20080313211 | Data Relationship Visualizer - Data having express or implied relationships may be displayed by selecting a starting entity in a data structure, building a relationship tree, and building and optimizing a relationship matrix based on the relationship tree. The optimized relationship matrix may be used to layout and render a graphical image that positions various elements with respect to the starting entity based on the relationships. The distance matrix may be optimized by creating a first distance matrix based on the relationship tree, developing a dissimilarity matrix based on expressed or implied relationships, and multiplying the dissimilarity matrix by a weighting factor to determine a distance matrix that may be optimized by multi-dimensional scaling. An optimized weighting factor may be determined and used to select an optimized distance matrix. | 12-18-2008 |
| 20080313213 | Efficient data infrastructure for high dimensional data analysis - Described is a technology by which high dimensional source data corresponding to rows of records with identifiers, and columns comprising dimensions of data values, are processed into a file model for efficient access. An inverted index corresponding to any dimension is built by mapping data from raw dimension values to mapped values based on mapping entries in a dimension table. The record identifiers are arranged into subgroups based on their mapped value; a count and/or an offset may be maintained for locating each of the subgroups. The raw values for a dimension are maintained within a raw value file. For sparse data, the raw value file may be compressed, e.g., by excluding nulls and associating a record identifier with each non-null. A data manager provides access to data in the data files, such as by offering various functions, using caching for efficiency. | 12-18-2008 |
| 20080313507 | Software reliability analysis using alerts, asserts and user interface controls - Described is a technology by which software instrumentation data collected during software program usage sessions is analyzed to identify potential problems with software program usage, such as based on frequency of problem occurrence during the usage sessions. Reliability metrics may be calculated from the information. Failure data additionally collected during the usage sessions may be accessed to derive details that correspond to the potential problems. In one example, the information may be analyzed to determine which alerts and/or asserts occurred most often, and/or to determine a relationship between user interface control operations (e.g., clicks and usage of commands) and alerts or asserts. | 12-18-2008 |
| 20080313617 | Analyzing software users with instrumentation data and user group modeling and analysis - Described is a technology by which software instrumentation data collected from user program sessions are analyzed, including by determining program usage metrics and/or command usage metrics. Information representative of the program usage metrics and/or the command usage metrics is output, such as in the form of a report. The software instrumentation data may be further analyzed, such as to determine at least one usage trend over time, and to determine user groups. For example, a usage subset of sessions that meet specified session usage criteria based on a set of session data may be located, along with a subset of users based on users whose sessions meet specified user criteria. The usage and user subsets may be combined via Boolean logic to produce a result set. | 12-18-2008 |
| 20080313633 | Software feature usage analysis and reporting - Described is a technology for analyzing usage of a software program's features. Software instrumentation data is during actual user program usage sessions. The collected data is then processed to determine various feature usage counts and other information, cross-feature usage (e.g., among users who use a feature, how many use another feature or program), and characteristics of feature users, e.g., how long, how much, how often and how extensive feature users use a program. Session analysis may be performed to provide information about the number of sessions in which a set of features occur. Feature usage trends over time may also be determined via analysis. A user interface is described for facilitating selection of one or more features to analyze, for facilitating selection of a group of users, and/or for outputting results corresponding to the analysis. | 12-18-2008 |
| 20080320500 | Remote human interface device in an aggregate computer system - Described is a technology by which a human interface device (e.g., a keyboard or mouse) physically coupled to a first computing machine controls a second computing machine in an aggregated computer system. When the first computing machine enters a device producer state with respect to the human interface device, the first machine routes the human interface device data to the second computing machine. The second computing machine receives the human interface device data, and simulates a physical connection of the human interface device to the second computing machine by providing the human interface device data to a virtual device driver loaded on the second computing machine. The virtual device driver may be registered with a virtual bus driver to receive the data. | 12-25-2008 |
| 20080320501 | Aggregate personal computer system - Described is an aggregate computer system that operates by sharing devices of networked computing machines. A consumer machine uses a real device of a producer machine as a virtual device, by coupling the real driver of the real device over the network to a virtual driver of the consumer machine. Each machine may include an aggregate device manager that manages the virtual devices, and/or an aggregate connection manager that processes communications received over at least two different types of networks. Each machine may include a virtual bus and virtual bus driver that simulates a physical connection of a remote device to that machine via a bus. Upon receiving a request to plug-in a virtual device, the consumer machines queries for information of the device, and loads a virtual driver based on the device information when received. The consumer machine may query by sending plug-and-play events to the virtual bus. | 12-25-2008 |
| 20090002392 | Integrated platform for user input of digital ink - Described is a technology that provides an integrated platform for users to use different kinds of digital ink (e.g., handwritten characters, sketched shapes, handwritten formulas) when interacting with computer programs. The platform interprets the user's digital ink input and outputs one or more associated items into an application program. The output items can be customized for different application programs. In one aspect, the platform includes an ink panel having different operating modes for receiving digital ink, and a recognition service that recognizes different types of digital ink. The recognition service may include a unified recognizer that recognizes different types of digital ink, e.g., characters and shapes. Another recognizer may be included such as an equation recognizer. If the recognition result is text while in a non-text mode, the text may be used in a keyword search to locate items; otherwise, the recognition result may be used without keyword searching. | 01-01-2009 |
| 20090003658 | Digital ink-based search - Described is searching directly based on digital ink input to provide a result set of one or more items. Digital ink input (e.g., a handwritten character, sketched shape, gesture, drawing picture) is provided to a search engine and interpreted thereby, with a search result (or results) returned. Different kinds of digital ink can be used as search input without changing modes. The search engine includes a unified digital ink recognizer that recognizes digital ink as a character or another type of digital ink. When the recognition result is a character, the character may be used in a keyword search to find one or more corresponding non-character items, e.g., from a data store. When the recognition result is a non-character item, the non-character item is provided as the result, without keyword searching. The search result may appear as one or more item representations, such as in a user interface result panel. | 01-01-2009 |
| 20090003703 | Unifield digital ink recognition - Described is a unified digital ink recognizer that recognizes various different types of digital ink data, such as handwritten character data and custom data, e.g., sketched shapes, handwritten gestures, and/or drawn pictures, without further participation by a user such as recognition mode selection or parameter input. For a custom item, the output may be a Unicode value from a private use area of Unicode. Building the unified digital ink recognizer may include defining the data set to be recognized, extracting features of training samples corresponding to the dataset items to build a recognizer model, evaluating the recognizer model using testing data, and modifying the recognizer model using tuning data. The extracted features may be processed into feature data for a multi-dimensional nearest neighbor recognizer approach; the extracted features for the samples of each class is calculated and combined into the feature set for this class in the resulting recognizer model. | 01-01-2009 |
| 20090003705 | Feature Design for HMM Based Eastern Asian Character Recognition - An exemplary method for online character recognition of East Asian characters includes acquiring time sequential, online ink data for a handwritten East Asian character, conditioning the ink data to produce conditioned ink data where the conditioned ink data includes information as to writing sequence of the handwritten East Asian character and extracting features from the conditioned ink data where the features include a tangent feature, a curvature feature, a local length feature, a connection point feature and an imaginary stroke feature. Such a method may determine neighborhoods for ink data and extract features for each neighborhood. An exemplary Hidden Markov Model based character recognition system may use various exemplary methods for training and character recognition. | 01-01-2009 |
| 20090003706 | Combining online and offline recognizers in a handwriting recognition system - Described is a technology by which online recognition of handwritten input data is combined with offline recognition and processing to obtain a combined recognition result. In general, the combination improves overall recognition accuracy. In one aspect, online and offline recognition is separately performed to obtain online and offline character-level recognition scores for candidates (hypotheses). A statistical analysis-based combination algorithm, an AdaBoost algorithm, and/or a neural network-based combination may determine a combination function to combine the scores to produce a result set of one or more results. Online and offline radical-level recognition may be performed. For example, a HMM recognizer may generate online radical scores used to build a radical graph, which is then rescored using the offline radical recognition scores. Paths in the rescored graph are then searched to provide the combined recognition result, e.g., corresponding to the path with the highest score. | 01-01-2009 |
| 20090006045 | FORECASTING TIME-DEPENDENT SEARCH QUERIES - Techniques for analyzing and modeling the frequency of queries are provided by a query analysis system. A query analysis system analyzes frequencies of a query over time to determine whether the query is time-dependent or time-independent. The query analysis system forecasts the frequency of time-dependent queries based on their periodicities. The query analysis system forecasts the frequency of time-independent queries based on causal relationships with other queries. To forecast the frequency of time-independent queries, the query analysis system analyzes the frequency of a query over time to identify significant increases in the frequency, which are referred to as “query events” or “events.” The query analysis system forecasts frequencies of time-independent queries based on queries with events that tend to causally precede events of the query to be forecasted. | 01-01-2009 |
| 20090006284 | FORECASTING TIME-INDEPENDENT SEARCH QUERIES - Techniques for analyzing and modeling the frequency of queries are provided by a query analysis system. A query analysis system analyzes frequencies of a query over time to determine whether the query is time-dependent or time-independent. The query analysis system forecasts the frequency of time-dependent queries based on their periodicities. The query analysis system forecasts the frequency of time-independent queries based on causal relationships with other queries. To forecast the frequency of time-independent queries, the query analysis system analyzes the frequency of a query over time to identify significant increases in the frequency, which are referred to as “query events” or “events.” The query analysis system forecasts frequencies of time-independent queries based on queries with events that tend to causally precede events of the query to be forecasted. | 01-01-2009 |
| 20090006294 | IDENTIFICATION OF EVENTS OF SEARCH QUERIES - Techniques for analyzing and modeling the frequency of queries are provided by a query analysis system. A query analysis system analyzes frequencies of a query over time to determine whether the query is time-dependent or time-independent. The query analysis system forecasts the frequency of time-dependent queries based on their periodicities. The query analysis system forecasts the frequency of time-independent queries based on causal relationships with other queries. To forecast the frequency of time-independent queries, the query analysis system analyzes the frequency of a query over time to identify significant increases in the frequency, which are referred to as “query events” or “events.” The query analysis system forecasts frequencies of time-independent queries based on queries with events that tend to causally precede events of the query to be forecasted. | 01-01-2009 |
| 20090006312 | DETERMINATION OF TIME DEPENDENCY OF SEARCH QUERIES - Techniques for analyzing and modeling the frequency of queries are provided by a query analysis system. A query analysis system analyzes frequencies of a query over time to determine whether the query is time-dependent or time-independent. The query analysis system forecasts the frequency of time-dependent queries based on their periodicities. The query analysis system forecasts the frequency of time-independent queries based on causal relationships with other queries. To forecast the frequency of time-independent queries, the query analysis system analyzes the frequency of a query over time to identify significant increases in the frequency, which are referred to as “query events” or “events.” The query analysis system forecasts frequencies of time-independent queries based on queries with events that tend to causally precede events of the query to be forecasted. | 01-01-2009 |
| 20090006313 | FORECASTING SEARCH QUERIES BASED ON TIME DEPENDENCIES - Techniques for analyzing and modeling the frequency of queries are provided by a query analysis system. A query analysis system analyzes frequencies of a query over time to determine whether the query is time-dependent or time-independent. The query analysis system forecasts the frequency of time-dependent queries based on their periodicities. The query analysis system forecasts the frequency of time-independent queries based on causal relationships with other queries. To forecast the frequency of time-independent queries, the query analysis system analyzes the frequency of a query over time to identify significant increases in the frequency, which are referred to as “query events” or “events.” The query analysis system forecasts frequencies of time-independent queries based on queries with events that tend to causally precede events of the query to be forecasted. | 01-01-2009 |
| 20090006326 | REPRESENTING QUERIES AND DETERMINING SIMILARITY BASED ON AN ARIMA MODEL - Representing queries and determining similarity of queries based on an autoregressive integrated moving average (“ARIMA”) model is provided. A query analysis system represents each query by its ARIMA coefficients. The query analysis system may estimate the frequency information for a desired past or future interval based on frequency information for some initial intervals. The query analysis system may also determine the similarity of a pair of queries based on the similarity of their ARIMA coefficients. The query analysis system may use various metrics, such as a correlation metric, to determine the similarity of the ARIMA coefficients. | 01-01-2009 |
| 20090006365 | IDENTIFICATION OF SIMILAR QUERIES BASED ON OVERALL AND PARTIAL SIMILARITY OF TIME SERIES - Techniques for identifying similar queries based on their overall similarity and partial similarity of time series of frequencies of the queries are provided. To identify queries that are similar to a target query, the query analysis system generates, for each query, an overall similarity score for that query and the target query based on the time series of the query and the target query. The query analysis system also generates, for each query, partial similarity scores for the query and the target query based on various time sub-series of the overall time series of the queries. The query analysis system then identifies queries as being similar to the target query based on the overall similarity scores and the partial similarity scores of the queries. | 01-01-2009 |
| 20090006883 | Software error report analysis - Described herein is technology for, among other things, accessing error report information. It involves various techniques and tools for analyzing and interrelating failure data contained in error reports and thereby facilitating developers to more easily and quickly solve programming bugs. Numerous parameters may also be specified for selecting and searching error reports. Several reliability metrics are provided to better track software reliability situations. The reliability metrics facilitate the tracking of the overall situation of failures that happen in the real word by providing metrics based on error reports (e.g., failure occurrence trends, failure distributions across different languages). | 01-01-2009 |
| 20090007271 | Identifying attributes of aggregated data - A method for identifying a portion of aggregated software security data is described. The method includes accessing aggregated data associated with software vulnerabilities retrieved from a plurality of on-line sources. The method further includes searching a portion of the aggregated data for an exact match to a particular attribute of the data and searching the portion of the aggregated data for one or more partial matches associated with the particular attribute. The method also includes associating the portion of the data with the particular attribute based on the exact match of one or more of the partial matches. | 01-01-2009 |
| 20090007272 | Identifying data associated with security issue attributes - A method for identifying data related to a software security issue is provided. The method includes accessing a software security issue and determining one or more attributes associated with the software security issue. The method also includes accessing aggregated software security data retrieved from a plurality of on-line sources and searching the aggregated software security data for the attributes associated with the security issue. The method further includes associating a portion of the aggregated data with the security issue based on matching the attributes associated with the security issue with contents of the portion of the aggregated data. | 01-01-2009 |
| 20090012829 | DYNAMICALLY ASSEMBLING BUSINESS PROCESS MODELS - Apparatus and methods for dynamically assembling a business process model. An apparatus is configured in a company terminal connected with a network, and has a model building unit for building a business process model for the company, characterized in that the apparatus further includes: a retrieving unit for retrieving to obtain the business process model of other company from the network, and an assembling unit for assembling the business process model of the company with that of the other company to obtain an integrated business process model. | 01-08-2009 |
| 20090016614 | GLOBAL LOCALIZATION BY FAST IMAGE MATCHING - An efficient technique is provided for determining a portion of a document corresponding to a captured image. Areas of a document in which the pattern is at least partially obscured are identified. A reference pixel in the image is selected, and an offset between the pixel and the pattern is determined. A pixel-by-pixel comparison is then made of the image with the document such that the reference pixel is only compared with locations in the document that are both within the identified areas and have the determined offset from the pattern. The comparison with the highest correspondence between the image pixels and the electronic document then identifies the position of the reference pixel relative to the electronic document. | 01-15-2009 |
| 20090016629 | Method of Performing Fast Compression and Decompression for Image - The present invention relates to an image compression and decompression method, in particular in the areas of computer image processing and data compression. The currently, the process speed for which JPEG (Joint Photographic Experts Group, a compression standard) is applied, it's not all too satisfactory. One aspect of the present invention is simplify compression process based on particular features of an image, thus achieve the aim of accelerate the processing speed. Apply the process described in the present invention, the processing speed for JPEG compression/decompression would rise, without suffers quality reduction compare to current JPEG compression/decompression method. | 01-15-2009 |
| 20090027241 | Fast error-correcting of embedded interaction codes - A fast decoding technique for decoding a position of a bit in a pattern provided on a media surface that can generate large amounts of solution candidates quickly by switching or flipping bits and utilizing a recursion scheme. The fast decoding technique may be employed to simultaneously decode multiple dimensions of a pattern on the media surface. | 01-29-2009 |
| 20090027351 | FINGER ID BASED ACTIONS IN INTERACTIVE USER INTERFACE - A system and method for using biometric images is disclosed. In an embodiment, a plurality of biometric images belonging to an individual are scanned and associated with one or more functions. The user can cause different biometric images to be scanned so that different functions within the user interface can be actuated. Thus, a biometric sensor can be used to provide additional functionality as compared to system where a single biometric image is used to provide access. | 01-29-2009 |
| 20090037003 | Real-time operating optimized method of multi-input and multi-output continuous manufacturing procedure - A real-time operating optimized method of multi-input and multi-output continuous manufacture procedure includes steps as follows: first, using plurality of pivotal operation conditions in the manufacture procedure as optimized variables, and using the technical target associating with the pivotal operation conditions as the objective function, then, calculating on line the grades vector between pivotal operation conditions and the technical target at current time according to historical data of pivotal operation conditions and the technical target, using correlation integral method or other methods, at last, using this grades vector to define the adjustment direction of the operation conditions. When the grades vector is positive or negative, the pivotal operation conditions should be adjusted in order to change the grades vector to zero. | 02-05-2009 |
| 20090063461 | USER QUERY MINING FOR ADVERTISING MATCHING - Systems and methods to determine relevant keywords from a user's search query sessions are disclosed. The described method includes identifying search session logs of a user, segmenting the search session logs into one or more search sessions. After the segmentation, the search sessions are analyzed to compose a list of semantically relevant keyword sets including at least a first keyword set and a second keyword set. The described method further includes determining a semantic relevance between the first and second keyword sets according to the frequency at which the first and second keyword sets are reported in the query results and displaying one or more semantically high relevant keyword sets after being filtered by a threshold. | 03-05-2009 |
| 20090067743 | PREPROCESSING FOR INFORMATION PATTERN ANALYSIS - Pre-processing techniques for processing an image to improve the distinctiveness of an information pattern captured in the image before the information pattern is analyzed in a decoding process. The brightness of an image first is normalized by dividing the image into blocks of areas, such as pixels. A brightness distribution value then is determined for each area of the image by fitting the brightness of its surrounding blocks using bilinear interpolation and extrapolation, and a normalized brightness value for each area can then be obtained by dividing the original brightness value by the brightness distribution value. Next, masks are created to distinguish the information pattern from content captured in the image. The masks may be generated based upon contrast differences between the brightness of pixels representing the information pattern, the brightness of pixels representing content, and the brightness of pixels representing the background of the writing medium. | 03-12-2009 |
| 20090110308 | DECODING AND ERROR CORRECTION IN 2-D ARRAYS - A system and process for determining the location of a captured image from a larger image is described. A non-repeating sequence may be folded into a non-repealing array in which the array is unique for every sub window of a given size. The image of the sub window may be captured and its location determined within the non-repeating array. | 04-30-2009 |
| 20090119573 | GLOBAL METADATA EMBEDDING AND DECODING - In accordance with embodiments of the invention, global metadata, such as a document identifier, which may be a globally unique identifier, is embedded into an embedded interactive code document by combining a first m-array and a plurality of copies of the first m-array to generate a combined m-array with encoded global metadata such that respective start positions (x | 05-07-2009 |
| 20090132530 | WEB CONTENT MINING OF PAIR-BASED DATA - Described herein is technology for, among other things, mining pair-based data on the web. The technology involves an online pair-based data mining system as well as an offline SVM training system. By subjecting a pair-based input data to the systems, one may grow a pool of pair-based data which share characteristics of the pair-based input data in more efficient manner. | 05-21-2009 |
| 20090193047 | CONTRUCTING WEB QUERY HIERARCHIES FROM CLICK-THROUGH DATA - The claimed subject matter is directed to constructing query hierarchies in response to a query request. To construct a query hierarchy, a list of related candidate queries is generated in response to the received query request. The list of related candidate queries is generated by determining the relative coverage of information shared by the candidate queries and the query request. Relationships between the submitted query request and the candidate queries in the list are determined based upon the extent of relative coverage of information shared by the candidate queries and the query request. A query hierarchy is then constructed to reflect the determined relationships between the query request and the candidate queries. | 07-30-2009 |
| 20090218404 | CAMERA BASED CODE READING - Techniques for providing camera based code reading are disclosed. In some aspects, a camera-readable code is generated which may be read by a code reading device. The code reading device may capture an image of the code, process the image, and decode the code. The code includes symbols arranged to form a pattern. According to one or more embodiments, an image with the code is cropped to remove extraneous information. The code image is manipulated by exact binary segmentation to remove background information from the code. The code is oriented to a grid using an interval value defined between the symbols. The symbols are decoded by comparing unique aspects of the symbols using a statistical analysis. The decoded symbols may be converted to a message for a user or be used for other purposes. | 09-03-2009 |
| 20090222321 | PREDICTION OF FUTURE POPULARITY OF QUERY TERMS - Disclosed is a system and method that allows a computer system the ability to predict what query terms in a search will be popular. The system creates a unified model that determines the future popularity of a query term over a period of time in the future. The unified model averages the results of three different prediction models to obtain a prediction of the future popularity of a query term. The prediction from the unified model is compared against a threshold value of popularity over a time period. When the predicted popularity of the query exceeds the threshold the term is stored. In some embodiments the period that the term exceeds the threshold may also be stored. | 09-03-2009 |
| 20090233166 | LITHIUM-ION BATTERY WITH MEDIUM AND SMALL CAPACITY AND HIGH OUTPUT - A lithium-ion battery with medium and small capacity and high output, comprises a shell, a cell core and electrolyte located in the shell; the said cell core obtained by winding anode sheets, cathode sheets and separators between the anode sheets and cathode sheets, the said anode sheets coated with anode active material, the said cathode sheets coated with cathode active material; the said anode active material includes LiMn | 09-17-2009 |
| 20090265268 | METHOD AND SYSTEM FOR MATCH MAKING IN VIRTUAL CURRENCY EXCHANGE - A method, system and computer program product are disclosed for matching virtual currency exchange requests. The method comprises the step of creating a virtual currency exchange network comprised of a set of nodes and a set of edges connecting the nodes together. Each of the nodes represents a virtual currency type, each of the edges represents a virtual currency exchange request, and one of the edges represents a current virtual currency exchange request. A plurality of paths are identified in the network as potentially fulfilling the current virtual currency exchange request. Each of these paths is comprised of at least two edges of the network, and each of the paths represents one way to fulfill the current virtual currency exchange request. One of those paths is selected, using a defined set of criteria, as an optimal path for fulfilling said current virtual currency exchange request. | 10-22-2009 |
| 20090276840 | UNIFIED ACCESS CONTROL SYSTEM AND METHOD FOR COMPOSED SERVICES IN A DISTRIBUTED ENVIRONMENT - A system, a computer device implemented method, and a computer readable article of manufacture for executing a computer implemented method for a unified access control for a plurality of composed services in a distributed computing environment without requiring repeated input of security certification. The method includes the steps of: acquiring a first role of a user in a first composed service; sending an invoking request by a processing unit of the first composed service to a second composed service; receiving the first role of the user in the first composed service and predefined role-role mapping relationships, and determining a second role of the user in the second composed service by a role determining component; and then sending the determined role in the second composed service by a role sending component to the second composed service, thereby providing unified access without requiring repeated input of security certification. | 11-05-2009 |
| 20090293124 | Intrinsically Safe Remote Data Monitoring System and Monitoring Method Thereof - This invention refers to an intrinsically safe remote data monitoring system and a monitoring method for remote data monitoring by using such system. The monitoring system comprises a process control computer that monitors or controls the controlled process, a remote monitoring computer that remotely monitors the process control computer, a signal collecting device physically connected, without through network, with the process control computer, for acquiring data from the process control computer, a local monitoring computer ( | 11-26-2009 |
| 20090299831 | ADVERTISER MONETIZATION MODELING - Embodiments of the claimed subject matter provide a method and system for modeling advertiser monetization. The claimed subject matter provides a method and system from which an advertisement may be evaluated according to various metrics to determine a quality relative to other advertisements. The relative quality considers the content of the advertisement, the performance of the advertisement and the history of the advertiser's bidding behavior. | 12-03-2009 |
| 20090299855 | PREDICTING KEYWORD MONETIZATION - Embodiments of the claimed subject matter provide a method and system for predicting bidding keyword monetization. The claimed subject matter provides a method and system with which the value of a keyword for the purpose of relevant online advertisement may be evaluated according to various metrics to determine a bidding landscape for use in advertising campaigns. The value of the keyword considers certain attributes related to the monetization of the keyword. | 12-03-2009 |
| 20090299967 | USER ADVERTISEMENT CLICK BEHAVIOR MODELING - Described herein is technology for, among other things, mining similar user clusters based on user advertisement click behaviors. The technology involves methods and systems for mining similar user clusters based on log data available on an online advertising platform. By building a user linkage representation based on one or more attributes from the log data, the similar user clusters can be harvested in more efficient manner. | 12-03-2009 |
| 20090327320 | CLUSTERING AGGREGATOR FOR RSS FEEDS - A method for merging really simple syndication (RSS) feeds. Stories containing one or more terms may be merged into one or more clusters based on one or more links between the stories. A cluster frequency with which the terms occur in each cluster may be determined. A diameter for each cluster may be determined. A cluster that is most similar to one of the clusters may be determined based on the cluster frequency. The most similar cluster with the one of the clusters may be determined based on each diameter, and each cluster frequency. | 12-31-2009 |
| 20100039066 | ADVANCED INDUCTIVE CHARGING PAD FOR PORTABLE DEVICES - Systems and methodologies for efficient inductive charging of electronic devices are provided herein. A charging device as described herein can utilize a sensor-integrated resonating circuit with automatic frequency control to provide low-cost inductive charging functionality for electronic devices. As further described herein, a device to be charged can be equipped with a power receiver operable to receive power from the charging device via electromagnetic induction. The power receiver can additionally be utilized for initiation of charging such that charging for a device commences upon its associated power receiver being brought within range of an inductive charging surface at the charging device. Further, a charging device as described herein can have an inductive charging surface as well as a non-charging surface for providing other services such as information display. A charging device can integrate with an external information source to obtain items to be displayed at a non-charging surface thereon. | 02-18-2010 |
| 20100097390 | Methods And Devices For Processing A Raster Image - A raster image process method and device, for solving an issue existed in the current technique that it is unable to distinguish between the white color filled in a raster image when constructing the raster image and the white color in an image object of a page description filled in the raster image afterwards. The method includes: the raster image is constructed and the white color is filled in the raster image; a process of changing a color for the white color in an image object described in a page is carried out, and the image object is filled into the raster image. Thereby the white color filled in the raster image when constructing the raster image and the white color in an image object of a page description filled in the raster image afterwards can be distinguished. | 04-22-2010 |
| 20100124360 | METHOD AND APPARATUS FOR RECORDING EVENTS IN VIRTUAL WORLDS - A method and an apparatus for recording an event in a virtual world. The method includes acquiring camera view regions of avatars joining the event; identifying one or more key avatars and/or key objects based on information about the targets in the camera view regions of the avatars; setting one or more recorders for the identified one or more key avatars and/or key objects for recording the event such that the one or more key avatars and/or key objects are located in the camera view regions of the one or more recorders. The apparatus includes devices configured to perform the steps of the method. | 05-20-2010 |
| 20100138767 | Multi-Panel User Interface - A user interface and techniques for presenting content in a panel-based layout are described. The user interface has one or more demarcation bars to define multiple panels on a screen area. Different subject matter (e.g., data, content, programs, etc.) may be placed in the various panels. A bar navigation element facilitates navigation of the bar(s) among preset positions. With the bar navigation element, a user can intuitively resize the panels using just a single actuation (e.g., a single click of a mouse, or a stylus tap). The panels remain in their original orientation and relative positioning, and remain visible in the user interface so that the user can track their location. | 06-03-2010 |
| 20100169605 | ARBITRARY PRECISION FLOATING NUMBER PROCESSING - Techniques for providing arbitrary precision floating number (APFN) processing are disclosed. In some aspects, an APFN store may be used to store a large number (i.e., an APFN) having many significant digits, which in turn may enable a high degree of precision in mathematical operations. An APFN module may be used to create and define the APFN store. The APFN module may enable a user to define a precision (significant digits) for the large number that corresponds to the size of an array of bytes in the APFN store that are allocated for storing the large number. In further aspects, the APFN store may be used to store additional intermediary data and a resultant. | 07-01-2010 |
| 20100190433 | RELAY DEVICE AND WIRELESS COMMUNICATION METHOD THEREOF - The invention provides a relay device and a wireless communication method thereof. The A wireless communication method for a relay device includes the following steps: receiving a first signal destined for a second communication device from a first communication device; decoding the received first signal and determining whether a decoding result is correct; generating a first decoding response signal indicating whether the decoding result of the first signal is correct; and sending the first decoding response signal to the first communication device and the second communication device. | 07-29-2010 |
| 20100191693 | Segmenting Sequential Data with a Finite State Machine - Described is a technology in which a finite state machine-based method segments original sequential data into high level units. Segments with similar sub-sequences are treated as the same unit. In general, the finite state machine indentifies sub-sequences in the sequential data that have similar tree-like microstructures. One described finite state machine operates by entering a path state when an input is a path command corresponding to a non-leaf node; the state machine remains in the path state until another command comprises an action command corresponding to a leaf node, whereby it outputs an action unit, or until the other command comprises a path command that is not the parent or the sibling of a next command, whereby a browsing unit is output. Also described is aggregating sub-sequences of a same unit to produce an access structure corresponding to the unit. | 07-29-2010 |
| 20100191753 | Extracting Patterns from Sequential Data - Described is a technology in which sequential data, such as application program command sequences, are processed into patterns, such as for use in analyzing program usage. In one aspect, sequential data may be first transformed via state machines that remove repeated data, group similar data into sub-sequences, and/or remove noisy data. The transformed data is then segmented into units. A pattern extraction mechanism extracts patterns from the units into a pattern set, by calculating a stability score (e.g., a mutual information score) between succeeding units, selecting the pair of units having the most stability (e.g., the highest score), and adding corresponding information for that pair into the pattern set. Pattern extraction is iteratively repeated until a stopping criterion is met, e.g., the pattern set reaches a defined size, or when the stability score is smaller than a pre-set threshold. | 07-29-2010 |
| 20100191793 | Symbolic Computation Using Tree-Structured Mathematical Expressions - A method for performing symbolic computations on a mathematical expression. The mathematical expression may be converted to a tree structure having one or more parent nodes and one or more child nodes. Each parent node may be a mathematical operation. Each child node may be a mathematical expression on which the mathematical operation is performed in a specified order. Each child node may be in a hierarchical relationship to one of the parent nodes. The parent nodes, the child nodes or both may be manipulated to perform a first symbolic computation on the mathematical expression. | 07-29-2010 |
| 20100205120 | PLATFORM FOR LEARNING BASED RECOGNITION RESEARCH - A method for researching and developing a recognition model in a computing environment, including gathering one or more data samples from one or more users in the computing environment into a training data set used for creating the recognition model, receiving one or more training parameters defining a feature extraction algorithm configured to analyze one or more features of the training data set, a classifier algorithm configured to associate the features to a template set, a selection of a subset of the training data set, a type of the data samples, or combinations thereof, creating the recognition model based on the training parameters, and evaluating the recognition model. | 08-12-2010 |
| 20100223574 | Multi-Screen User Interface - A user interface and techniques for presenting content in a multiple virtual screens are described. The user interface has one or more multiple virtual screen to define separate and distinct portions of content data. Overview, related content information may be placed in the various multiple virtual screens. Navigation buttons facilitate movement from display of content information in one virtual screen to the display of content information in another virtual screen. With the bar navigation element, a user can intuitively move among the multiple virtual screens using just a single actuation (e.g., a single click of a mouse, or a stylus tap). The multiple virtual screens remain in their original orientation and relative positioning, and remain visible in the user interface so that the user can track their location. | 09-02-2010 |
| 20100231595 | LARGE SCALE DATA VISUALIZATION WITH INTERACTIVE CHART - This disclosure describes a user interface and techniques for an interactive graphical representation of large scale data on a display. The disclosure describes how large scale data may be viewed using multiple linked charts. In one implementation, a user interface comprises an overview chart. The user may use chart controller(s) to designate one or more portions of the overview chart viewable in subsequent charts. The user may navigate between the overview chart and the subsequent charts using the chart controller(s). | 09-16-2010 |
| 20100250740 | METHOD AND APPARATUS FOR TRANSFERRING CONTEXT INFORMATION ON WEB SERVER - A method for transferring context information on a web server that contains a context pool. The method includes: in response to the web server receiving a message, obtaining context information from the message, generating a unique identifier according to a thread for processing the message, associating the context information with the generated unique identifier, and storing the context information and the associated unique identifier in context pool of web server correlatively. In response to a web server obtaining the context information, generating an identifier according to a thread that is executed currently in the web server, and extracting context information for which an associated unique identifier is matched with the generated identifier from the context pool. | 09-30-2010 |
| 20100254372 | SYSTEM AND METHOD FOR ENHANCING IMS CENTRALIZED SERVICES - A system and method of providing an enhanced service in a telecommunications network. The system includes a telecommunications network utilizing a circuit switched and packet switched access capability. The system also includes a sending User Equipment (UE) originating a call to a receiving UE. The sending UE sends an indicator informing the network to wait for further call information before proceeding with a call request towards the receiving UE. The system also includes a control node for routing calls within the network. The control node combines the call information received from the sending UE with call routing information of the call for connecting the call with the receiving UE to form a call request to the receiving UE. Upon receiving the call request message by the receiving UE, the call is connected and a media path is established between the receiving UE and the sending UE. | 10-07-2010 |
| 20100286954 | METHOD FOR DETERMINING LIGHTNING HAZARD DISTRIBUTION OF POWER NETWORK - A method for determining a lightning hazard distribution of a power network, includes: deriving a shielding failure lightning hazard distribution of the power network and a back flashover lightning hazard distribution of the power network from the number of ground lightning in each grid and ranges of hazardous currents, and deriving a historical lightning hazard distribution of the power network from a lightning faults database of the power network and the grids; and determining the lightning hazard distribution of the power network by integrating the shielding failure lightning hazard distribution of the power network, the back flashover lightning hazard distribution of the power network and the historical lightning hazard distribution of the power network. | 11-11-2010 |
| 20110153866 | Method And Apparatuses For Maintaining Service Continuity To A Centralization And Continuity Application Server - A method and apparatus for maintaining service continuity for User Equipment accessing an IP Multimedia Subsystem communication network. A routing identifier is established that identifies a Service Centralization and Continuity Application Server allocated to the User Equipment. The routing identifier is sent to the between the User Equipment and the Service Centralization and Continuity Application Server, a handover message is sent from the User Equipment via a Circuit Switched access network. The handover message includes the routing identifier, and is then forwarded to the identified Service Centralization and Continuity Application Server. This allows the same Service Centralization and Continuity Application Server to be used after the handover as was used before the handover, thereby providing service continuity. | 06-23-2011 |
