Patent application number | Description | Published |
20100017262 | PREDICTING SELECTION RATES OF A DOCUMENT USING CLICK-BASED TRANSLATION DICTIONARIES - The subject matter disclosed herein relates to predicting selection rates of web-based documents in response to a search query. | 01-21-2010 |
20110131157 | SYSTEM AND METHOD FOR PREDICTING CONTEXT-DEPENDENT TERM IMPORTANCE OF SEARCH QUERIES - An improved system and method for identifying context-dependent term importance of queries is provided. A query term importance model is learned using supervised learning of context-dependent term importance for queries and is then applied for advertisement prediction using term importance weights of query terms as query features. For instance, a query term importance model for query rewriting may predict rewritten queries that match a query with term importance weights assigned as query features. Or a query term importance model for advertisement prediction may predict relevant advertisements for a query with term importance weights assigned as query features. In an embodiment, a sponsored advertisement selection engine selects sponsored advertisements scored by a query term importance engine that applies a query term importance model using term importance weights as query features and inverse document frequency weights as advertisement features to assign a relevance score. | 06-02-2011 |
20110131205 | SYSTEM AND METHOD TO IDENTIFY CONTEXT-DEPENDENT TERM IMPORTANCE OF QUERIES FOR PREDICTING RELEVANT SEARCH ADVERTISEMENTS - An improved system and method for identifying context-dependent term importance of queries is provided. A query term importance model is learned using supervised learning of context-dependent term importance for queries and is then applied for advertisement prediction using term importance weights of query terms as query features. For instance, a query term importance model for query rewriting may predict rewritten queries that match a query with term importance weights assigned as query features. Or a query term importance model for advertisement prediction may predict relevant advertisements for a query with term importance weights assigned as query features. In an embodiment, a sponsored advertisement selection engine selects sponsored advertisements scored by a query term importance engine that applies a query term importance model using term importance weights as query features and inverse document frequency weights as advertisement features to assign a relevance score. | 06-02-2011 |
20110270672 | Ad Relevance In Sponsored Search - Techniques for improving advertisement relevance for sponsored search advertising. The method includes steps for processing a click history data structure containing at least a plurality of query-advertisement pairs, populating a first translation table containing a co-occurrence count field, populating a second translation table containing an expected clicks field, and calculating a click propensity score for an advertisement using the click history data structure, the first translation table (for determining overall click likelihood across all historical traffic), and using the second translation table (for removing biases present in the first translation table). Other method steps calculate a second click propensity score for a second advertisement, then ranking the first advertisement relative to the second advertisement for comparing a click propensity score to a threshold for filtering low quality ad candidates from a plurality of ad candidates, and then ranking advertisements for optimizing placement of ads on a sponsored search display page. | 11-03-2011 |
Patent application number | Description | Published |
20100034089 | Content Caching in the Radio Access Network (RAN) - A system and method to intercept traffic at standard interface points as defined by Cellular/Wireless networks (GSM/GPRS, 3G/UMTS/HSDPA/HSUPA, CDMA, WIMAX, LTE), emulate the respective protocols on either side of the interception point, extract user/application payloads within the intercepted packets, perform optimizations, and re-encapsulate with the same protocol, and deliver the content transparently is disclosed. The optimizations include but are not limited to Content Caching, prediction & pre-fetching of frequently used content, performance of content-aware transport optimizations (TCP, UDP, RTP etc.) for reducing back-haul bandwidth, and improvement of user experience. An additional embodiment of the current invention includes injecting opportunistic content (location based, profile based or advertisement content) based on the information derived while monitoring control plane protocols. | 02-11-2010 |
20100034218 | Cross-layer Pipelining Optimizations for Reduced Roundtrips and Improving Quality of Experience - Methods for pipelining, piggybacking, and transporting cross layer parameters through a network to reduce round-trip times are disclosed. Application activation, such as accessing a web-site through the internet, currently uses several protocols, including DNS Name resolution, establishing a TCP connection, sending HTTP Request and getting HTTP-Response that contains the web-page data, before the data from the web-site can be displayed to the user. Such operations take several round-trips through the transit network and are of the order of 100 to 200 milliseconds in the wireless access network in the best case. A method of generating a multi-part message to reduce these round trip is disclosed, as well as a proxy device which minimizes client side round trips while utilizing standard messaging in the wireline network. The invention includes client side user parameter gathering when specifying the application first (pre-fix), or specifying the application last (post-fix). | 02-11-2010 |
20100195602 | Application, Usage & Radio Link Aware Transport Network Scheduler - A packet scheduling method and apparatus with the knowledge of application behavior, anticipated usage/behavior based on the type of content, and underlying transport conditions during the time of delivery, is disclosed. This type of scheduling is applicable to a content server or a transit network device in wireless (e.g., 3G, WIMAX, LTE, WIFI) or wire-line networks. Methods for identifying or estimating rendering times of multi-media objects, segmenting a large media content, and automatically pausing or delaying delivery are disclosed. The scheduling reduces transit network bandwidth wastage, and facilitates optimal sharing of network resources such as in a wireless network. | 08-05-2010 |
20100261509 | Vibration Modulation Applications and Techniques in Mobile devices - Methods and applications for modulating the vibration mode of cellular handsets using patterned sequences are disclosed. This modulation allows additional information to be conveyed, thereby communicating messages in a variety of domains before the user responds to the vibration alert. This modulation may cause different patterns of vibration to convey additional information such as the importance of the call, identity of the caller, and other such information. The invention further extends vibration modulation to additional gaming and music & entertainment applications, such as rhythm synchronization, dance/step synchronization in a group, aerobic and other physical exercise related applications. | 10-14-2010 |
20110116460 | BURST PACKET SCHEDULER FOR IMPROVED RAN EFFICIENCY IN UMTS/HSPA NETWORKS - A method of generating optimal packet workload for achieving a balance between maximizing cell throughput and fairness across multiple users in UMTS/HSPA Network is disclosed. The packet scheduler of the current invention enhances the performance of other schedulers, such as Proportionally Fair Scheduler in NodeB and RNC in UMTS/HSPA Networks by monitoring recent RAN bandwidth to each mobile device, and increasing buffer occupancy of high rate data-flows in the RAN devices. The scheduler uses the desired performance goals of maximum cell throughput and fairness at various network congestion levels, and controls egress burst rate while delivering packets to the RAN (Radio Access Network). | 05-19-2011 |
20120099533 | Content Caching in the Radio Access Network (RAN) - A system and method to intercept traffic at standard interface points as defined by Cellular/Wireless networks (GSM/GPRS, 3G/UMTS/HSDPA/HSUPA, CDMA, WIMAX, LTE), emulate the respective protocols on either side of the interception point, extract user/application payloads within the intercepted packets, perform optimizations, and re-encapsulate with the same protocol, and deliver the content transparently is disclosed. The optimizations include but are not limited to Content Caching, prediction & pre-fetching of frequently used content, performance of content-aware transport optimizations (TCP, UDP, RTP etc.) for reducing back-haul bandwidth, and improvement of user experience. An additional embodiment of the current invention includes injecting opportunistic content (location based, profile based or advertisement content) based on the information derived while monitoring control plane protocols. | 04-26-2012 |
20140056137 | Content Caching In The Radio Access Network (RAN) - A system and method to intercept traffic at standard interface points as defined by Cellular/Wireless networks (GSM/GPRS, 3G/UMTS/HSDPA/HSUPA, CDMA, WIMAX, LTE), emulate the respective protocols on either side of the interception point, extract user/application payloads within the intercepted packets, perform optimizations, and re-encapsulate with the same protocol, and deliver the content transparently is disclosed. The optimizations include but are not limited to Content Caching, prediction & pre-fetching of frequently used content, performance of content-aware transport optimizations (TCP, UDP, RTP etc.) for reducing back-haul bandwidth, and improvement of user experience. An additional embodiment of the current invention includes injecting opportunistic content (location based, profile based or advertisement content) based on the information derived while monitoring control plane protocols. | 02-27-2014 |
Patent application number | Description | Published |
20110137634 | CANONICALIZED VERSIONS OF REUSE CANDIDATES IN GRAPHICAL STATE DIAGRAMS - Exemplary embodiments provide techniques for replacing a portion of a state diagram with a generalized, canonical version of the portion. The canonicalized version mimics the structure or semantics (or both) of the portion of the state diagram, although the canonicalized version need not be a perfect match for the structure or semantics of the portion. Exemplary embodiments further provide techniques for identifying a portion of a state diagram for reuse, and generating a canonicalized version of the portion. | 06-09-2011 |
20110219350 | STAGE EVALUATION OF A STATE MACHINE - The present invention provides a method and system for stage evaluation of a state machine model. Two types of transitions are used: first-stage transitions and second-stage transitions for a two-stage evaluation. In one embodiment, top-down processing and bottom-up processing may be combined using a two-stage evaluation. First-stage transitions are used with top-down processing while second-stage transitions are used with bottom-up processing. Certain conditions are used to determine if a switch from one type of stage processing to another type of stage processing is needed. | 09-08-2011 |
20110296435 | MESSAGE-BASED MODELING - A system and method may generate executable block diagrams in which at least some of the blocks run in accordance with message-based execution semantics. A message may include an input data payload that does not change over time, and the message may persist for only a determined time interval during execution of block diagram. A message-based execution engine may control execution of message-based blocks in which a source block may generate a message at a particular point in time, the message may be sent to one or more destination blocks triggering execution of those blocks, and the message may be destroyed on or after a determined time interval. Other execution domains, such as a time-based or state-based execution domain, may be provided, and the system may implement a hybrid execution model. A verification engine may provide one or more tools for evaluating and verifying operation of message-based blocks. The verification engine may support one or more verification blocks that may be added to the block diagram and associated with the diagram's message-based blocks. The verification blocks may capture and present messages exchanged among the message-based blocks. The verification blocks may also specify an expected interaction of messages, and determine whether the actual messages are equivalent to the expected interaction. If not, the verification block may perform one or more predefined actions, such as suspending further execution of the block diagram. | 12-01-2011 |
20120101971 | STAGE EVALUATON OF A STATE MACHINE - The present invention provides a method and system for stage evaluation of a state machine model. Two types of transitions are used: first-stage transitions and second-stage transitions for a two-stage evaluation. In one embodiment, top-down processing and bottom-up processing may be combined using a two-stage evaluation. First-stage transitions are used with top-down processing while second-stage transitions are used with bottom-up processing. Certain conditions are used to determine if a switch from one type of stage processing to another type of stage processing is needed. | 04-26-2012 |
20120215508 | GRAPHICAL FUNCTIONS - A method, system and computer program product to define and utilize functions graphically is provided which may be used in the simulation of finite state machines. The functions may combine mathematical, logical, non-linear and comparative operations. The graphical elements of the function may be hidden for ease of display of various portions of a model. | 08-23-2012 |
Patent application number | Description | Published |
20090006067 | STAGE EVALUATION OF A STATE MACHINE - The present invention provides a method a system for facilitating enhanced processing of state diagrams in a state diagram environment. The method may include top-down processing a current state in a state diagram environment; determining whether processing of the current state results in an exception event; and passing the exception event to a superstate that includes the current state when it is determined that the current state results in an exception event. The superstate may be made the current state and it may be determined whether the current state can handle the exception event. When it is determined that the current state cannot handle the exception event, it may be determined whether the current state has a second superstate that includes the current state. An error event may be output from the state diagram environment when it is determined that the current state does not have a second superstate. | 01-01-2009 |
20090007079 | CALLING AN ENTITY OF A GRAPHICAL MODEL WITH A NON-GRAPHICAL ENTITY AND CALLING A NON-GRAPHICAL ENTITY OF A GRAPHICAL MODEL WITH A GRAPHICAL ENTITY - The present invention provides a graphical model in a computing environment, where the graphical model includes at least a caller entity. A call command associated with the caller entity is executed, where the call command includes at least a partial name of the callee entity. The at least one callee entity may be identified based on the partial name of the at least one callee entity provided in the call command. The at least one callee entity may then be called. | 01-01-2009 |
20090013307 | MULTI-RATE HIERARCHICAL STATE DIAGRAMS - Systems and methods are provided for a scheme and mechanism for performing static analysis of a sample time aware state diagram model to compute and propagate multiple samples rates associated with the state diagram model. A graphical intermediate representation of the state diagram model, such as a directed graph or control flow graph, is used to determine how the multiple sample rates are propagated via elements of the state diagram model. The graph provides a static representation of the control of flow, including alternative and/or conditional flow paths, of the state diagram model. The present invention determines the propagation of sample rates via analysis and traversal of the intermediate representation. By using the techniques of the present invention, a state diagram model may provide multiple sample rate outputs, such as by function calls and output signals to a graphical model, such as a model representing a dynamic system. | 01-08-2009 |
20090132993 | MODE-SWITCHED VARIABLE SIGNAL ATTRIBUTES IN BLOCK DIAGRAMS - A programming element is provided that defines model attributes in response to mode change events in a graphical modeling environment. Such definition may involve any signal attribute such as dimensions, data types, complexity and sample times. Events that trigger definition of model attributes may be explicit signaling events generated by other elements, elements within the block diagram programming environment, and elements external from the environment. Implicit events may also trigger definition of model attributes, such as a change of attribute in an input signal. | 05-21-2009 |
20120291003 | SYSTEM AND METHOD FOR CREATING AND USING GRAPHICAL OBJECT INSTANCES IN A STATECHART ENVIRONMENT - A method of providing multi-instantiable state templates to a statechart environment is discussed. The method includes the step of providing a graphical definition of an independent state machine object belonging to a statechart. The method further includes the step of instantiating a first instance and a second instance of the independent state machine object in the statechart. The method additionally includes the steps of starting execution of the first instance of the independent state machine object and then stopping execution of the first instance of the state machine object. Additionally, the method includes the step of starting the execution of the second instance of the independent state machine object in the state diagram. | 11-15-2012 |
20130042257 | MODE-SWITCHED VARIABLE SIGNAL ATTRIBUTES IN BLOCK DIAGRAMS - A programming element is provided that defines model attributes in response to mode change events in a graphical modeling environment. Such definition may involve any signal attribute such as dimensions, data types, complexity and sample times. Events that trigger definition of model attributes may be explicit signaling events generated by other elements, elements within the block diagram programming environment, and elements external from the environment. Implicit events may also trigger definition of model attributes, such as a change of attribute in an input signal. | 02-14-2013 |
20140351788 | RENAMING INSTANCES OF AN ENTITY IN A CODING ENVIRONMENT - Exemplary embodiments provide computer-implemented methods, computer-readable media, and systems for changing the identifier associated with an entity, such as a variable or function, in a portion of code. During editing, a reference may be maintained that identifies the location of each instance of the entity in the code. When the identifier associated with one instance of the entity is changed, the change in the identifier may be propagated throughout the code to change each instance of the identifier in the code. The identifier may be changed without interrupting the workflow of the user and without the need to change to a separate refactoring mode. In some embodiments, a syntactical analysis may be performed and some or all instances of the identifier may be changed based on one or more rules. | 11-27-2014 |
Patent application number | Description | Published |
20130212054 | GENERATING A STATE DIAGRAM - A computing device may include a memory to store data that describes a state machine model that includes destination states and source states. The source states may be associated with conditions upon which the state machine model is to transition from a corresponding source state to one of the destination states. The device may also include a processor configured to generate data to describe a state diagram from the data that describes the state machine model. The state diagram may include the graphical symbols and lines. Each of the graphical symbols may represent one of the source states or one of the destination states. The lines may represent transitions and include one or more vertical lines to represent transitions to one of the destination states from more than one of the source states. The graphical symbol may represent the one of the destination states is not adjacent to the graphical symbols to represent the more than one of the source states. The processor may arrange graphical symbols in a first row, arrange lines, and arrange vertical lines in a second row that does not overlap with the first row. | 08-15-2013 |
20130290925 | UNIFIED STATE TRANSITION TABLE DESCRIBING A STATE MACHINE MODEL - A computer-readable memory device may include instructions to store data describing a state machine model including source states and destination states. The device may also include instructions to store, for each of the source states, a condition field identifying a condition upon which, when satisfied, the state machine model transitions from the source state to one of the destination states. The device may also include instructions to store, for each of source states, a destination field identifying the one of the destination states. Each of at least two of the source states may identify an identical destination state in the corresponding destination field. Each of at least two of the source states may identify an identical condition in the corresponding condition field. | 10-31-2013 |
20150020080 | MESSAGE-BASED MODELING - A system and method may generate executable models having message sending objects and message receiving objects. A message may include a fixed data payload, and the message may persist for only a determined time interval of a total execution or simulation time of model. Message queues may be established for the messages, and the queues may have attributes. The model may include a state-based portion having states and transitions. States may be configured to generate and send messages, and to receive and process messages. In addition, transitions may be guarded by particular messages. The system and method also may generate standalone code, such as source code, for the model. The standalone code may include code that establishes a message passing service to support the sending and receiving of messages. | 01-15-2015 |
Patent application number | Description | Published |
20120159422 | TEST MANAGEMENT DOMAIN ASSET DISCOVERY AND ANALYSIS - Embodiments of the present invention provide a method, system and computer program product for automated discovery and analysis of test management domain assets. A method for automated discovery of test management domain assets includes crawling different, remotely disposed repositories of test management artifacts and locating test management artifacts in the different, remotely disposed repositories of test management artifacts. The method also includes selecting for each located test management artifact an analyzer configured to process test management artifacts of a type consistent with a type of the located test management artifact. The method yet further includes directing the selected analyzer to parse the located test management artifact into data and to store the data into a unified repository. Finally, the unified repository can be queried to produce a result based upon test management artifact data stored in the unified repository, though the test management artifact data had been located in the different, remotely disposed repositories of test management artifacts | 06-21-2012 |
20120216171 | TEST MANAGEMENT DOMAIN ASSET DISCOVERY AND ANALYSIS - Embodiments of the present invention provide a method, system and computer program product for automated discovery and analysis of test management domain assets. A method for automated discovery of test management domain assets includes crawling different, remotely disposed repositories of test management artifacts and locating test management artifacts in the different, remotely disposed repositories of test management artifacts. The method also includes selecting for each located test management artifact an analyzer configured to process test management artifacts of a type consistent with a type of the located test management artifact. Finally, the unified repository can be queried to produce a result based upon test management artifact data stored in the unified repository, though the test management artifact data had been located in the different, remotely disposed repositories of test management artifacts. | 08-23-2012 |