| Patent application number | Description | Published |
|---|
| 20090037239 | Method For Improving Internet Advertising Click-Through Rates through Time-Dependent Keywords - A tool that allows internet advertisers to examine the popularity of various different keyphrases entered into a search engine over time is presented. The tool then allows the advertiser to specify a changing set of keyphrases that will be monitored and used to trigger the selection of internet advertisements. In this manner, internet advertisers can take advantage of the different keyphrases used by search engine users that tend to change over time. | 02-05-2009 |
| 20100228597 | Transferring Targeting and Marketing Information from an Online Advertisement System - An online advertising system integrates third party agents to permit the third party agents to participate in auctions to bid on a per opportunity basis. An advertising exchange module receives requests for opportunities to serve online advertisements to users. In response, an advertising exchange module applies one or more business rules to determine third party agents that qualify to serve the online advertisement. A bid gateway module generates and transmits requests for bids to the third party agents. The bid gateway module then receives bids from the third party agents in response to the requests for bids. The advertising exchange module then selects an advertisement based on the bid. The online advertisement exchange system provides a unified marketplace to permit integrator networks to bid on both ads pursuant to guaranteed contracts and ads not subject to guaranteed contracts (e.g., non-guaranteed ads). The online advertisement system further includes traffic management to allow the third parties to regulate bid requests sent from the online advertisement system. In some embodiments, the online advertising system caches bids, to efficiently implement the per opportunity auction, and transmits information, such as targeting information, to the third party agents to aid in the third party agents' formulation of bids. | 09-09-2010 |
| 20100228634 | Caching bids in an online advertisement bidding system - An online advertising system integrates third party agents to permit the third party agents to participate in auctions to bid on a per opportunity basis. An advertising exchange module receives requests for opportunities to serve online advertisements to users. In response, an advertising exchange module applies one or more business rules to determine third party agents that qualify to serve the online advertisement. A bid gateway module generates and transmits requests for bids to the third party agents. The bid gateway module then receives bids from the third party agents in response to the requests for bids. The advertising exchange module then selects an advertisement based on the bid. The online advertisement exchange system provides a unified marketplace to permit integrator networks to bid on both ads pursuant to guaranteed contracts and ads not subject to guaranteed contracts (e.g., non-guaranteed ads). The online advertisement system further includes traffic management to allow the third parties to regulate bid requests sent from the online advertisement system. In some embodiments, the online advertising system caches bids, to efficiently implement the per opportunity auction, and transmits information, such as targeting information, to the third party agents to aid in the third party agents' formulation of bids. | 09-09-2010 |
| 20100228635 | Unified Marketplace for an Online Advertisement Bidding System - An online advertising system integrates third party agents to permit the third party agents to participate in auctions to bid on a per opportunity basis. An advertising exchange module receives requests for opportunities to serve online advertisements to users. In response, an advertising exchange module applies one or more business rules to determine third party agents that qualify to serve the online advertisement. A bid gateway module generates and transmits requests for bids to the third party agents. The bid gateway module then receives bids from the third party agents in response to the requests for bids. The advertising exchange module then selects an advertisement based on the bid. The online advertisement exchange system provides a unified marketplace to permit integrator networks to bid on both ads pursuant to guaranteed contracts and ads not subject to guaranteed contracts (e.g., non-guaranteed ads). The online advertisement system further includes traffic management to allow the third parties to regulate bid requests sent from the online advertisement system. In some embodiments, the online advertising system caches bids, to efficiently implement the per opportunity auction, and transmits information, such as targeting information, to the third party agents to aid in the third party agents' formulation of bids. | 09-09-2010 |
| 20100228637 | Architecture for an Online Advertisement Bidding System - An online advertising system integrates third party agents to permit the third party agents to participate in auctions to bid on a per opportunity basis. An advertising exchange module receives requests for opportunities to serve online advertisements to users. In response, an advertising exchange module applies one or more business rules to determine third party agents that qualify to serve the online advertisement. A bid gateway module generates and transmits requests for bids to the third party agents. The bid gateway module then receives bids from the third party agents in response to the requests for bids. The advertising exchange module then selects an advertisement based on the bid. The online advertisement exchange system provides a unified marketplace to permit integrator networks to bid on both ads pursuant to guaranteed contracts and ads not subject to guaranteed contracts (e.g., non-guaranteed ads). The online advertisement system further includes traffic management to allow the third parties to regulate bid requests sent from the online advertisement system. In some embodiments, the online advertising system caches bids, to efficiently implement the per opportunity auction, and transmits information, such as targeting information, to the third party agents to aid in the third party agents' formulation of bids. | 09-09-2010 |
| 20110035259 | COST AND PARTICIPATION MODELS FOR EXCHANGE THIRD-PARTY INTEGRATION IN ONLINE ADVERTISING - A modeling system to evaluate cost-based viability of a real-time, auction-based advertising system with third-party integration includes an exchange server configured to receive advertising bids, create bid requests to third-party entities based thereon, and select a winning bid from responses to the requests. A computer, coupled with the exchange server: computes a plurality of valid paths from publishers to and from the third-party entities through the exchange server; estimates server and network costs, including fixed hardware costs and variable operational costs, amortized over a predetermined period of time, based on a number of average queries per second (QPS) transmitted at different portions of the valid paths; compares current periodic fees paid by the third-party entities to the amortized costs, to determine cost-based system viability; and determines updates, if needed, to the periodic fees based on the plurality of costs to maintain cost-based system viability. | 02-10-2011 |
| 20110208559 | Automatic Management of Networked Publisher-Subscriber Relationships - Automatic management of networked publisher-subscriber relationships in an advertising server network. The method comprises steps for constructing a directed graph representation comprising at least one publisher node (e.g. an Internet property), at least one subscriber node (e.g. an Internet advertiser), at least one intermediary node (e.g. an Internet advertising agent), and at least one edge (e.g. an advertising target predicate) wherein any one of the edges is directly associated with at least one target predicate. The directed graph representation is used in conjunction with an inverted index for retrieving a valid node list comprising only nodes having at least one target predicate that matches at least one event predicate. The event predicate (as well as any target predicate) is any arbitrarily complex Boolean expression, and is used in producing a result node list comprising only nodes that concurrently match the event predicate with an advertising target predicate and are reachable. | 08-25-2011 |
| 20110238493 | EFFICIENT AD SELECTION IN AD EXCHANGE WITH INTERMEDIARIES - A method is disclosed for optimizing ad selection in an exchange having intermediate ad-networks including: constructing an exchange graph having nodes representing publishers, advertisers, and intermediate ad-network entities, and including directed edges that represent bilateral business agreements connecting the nodes; receiving an opportunity for displaying an ad to a user that is associated with a publisher node and includes properties that are targetable by supply predicates, wherein a supply predicate is a function whose inputs include properties of the user; receiving ads that are available for display to the user associated with respective advertiser nodes and that include properties that are targetable by demand predicates, wherein a demand predicate is a function whose inputs include properties of one or more of the plurality of ads; computing a thinned graph by enforcing the supply predicates in the nodes and edges of the graph; and producing a list of ads and corresponding paths that exist through the thinned graph to the opportunity that satisfy the plurality of demand predicates. | 09-29-2011 |
| Patent application number | Description | Published |
|---|
| 20090089757 | Configurable Web Services System and a Method to Detect Defects in Software Applications - In accordance with a particular embodiment of the present invention, a method is offered that includes detecting one or more defects in a software application composed of heterogeneous languages using a configurable web services architecture. The detecting step further includes: capturing use cases associated with the software application and checking their validity; providing an automatic invocation of property monitors for model checking; and visualizing one or more defects in the software application for diagnosis. The detecting can further include transforming a heterogeneous software application into a homogeneous application. In more specific embodiments, the detecting further includes providing an automatic test generation for a presentation layer associated with the software application. The configuration associated with the software application can be a simple properties file. The detecting further includes simulating user behavior and generating drivers to test business logic from the use cases or scenarios. | 04-02-2009 |
| 20090089759 | System and Method for Providing Symbolic Execution Engine for Validating Web Applications - In accordance with a particular embodiment of the present invention, a method is offered that includes generating a symbolic string manipulation class library for one or more web applications. The manipulations are generalized into a string manipulation symbolic algebra. The method also includes performing symbolic execution for one or more web applications. Typically, a Java model checker is augmented to check for certain types of requirements or properties in performing the symbolic execution. If an error scenario exists, a solution to a set of symbolic constraints is obtained, and the solution is mapped back to a source code to obtain an error trace and a test case. In still other specific embodiments, requirements or properties are encoded through templates and checked using public domain decision procedures. The properties or requirements can relate to security validation. The symbolic execution can be customized and tuned for Java-based web applications. | 04-02-2009 |
| 20100125832 | Using Symbolic Execution to Check Global Temporal Requirements in an Application - In one embodiment, a method include accessing one or more global temporal requirements of an application specified using one or more requirement templates from a library of requirement templates, accessing a model of the application, generating one or more symbolic expressions of one or more of the global temporal requirements of the application, searching a state space of the application model with a model checker, monitoring the search of the state space for events in the state space encompassed by the symbolic expressions and modifying construction of a graph of the state space in response to occurrence of one or more events encompassed by the symbolic expressions, evaluating the symbolic expressions based on the graph of the state space to determine whether one or more of the global temporal requirements are valid, and communicating one or more results of the evaluation of the symbolic expressions for presentation to a user. | 05-20-2010 |
| 20100223599 | EFFICIENT SYMBOLIC EXECUTION OF SOFTWARE USING STATIC ANALYSIS - In one embodiment, a method includes accessing software comprising one or more inputs, one or more variables, and one or more segments of code that when executed operate on one or more of the inputs or one or more of the variables. The method includes, for every variable, determining whether the variable is relevant or irrelevant to a set of the inputs when expressed symbolically and, if the variable is relevant, instrumenting the variable and every one of the segments of code associated with the variable. A segment of code is associated with the variable if the variable affects the segment of code when executed. The method includes symbolically executing the software with every relevant variable and its associated segments of code as instrumented to test the software. | 09-02-2010 |
| 20100242029 | Environment Data Refinement Based on Static Analysis and Symbolic Execution - In particular embodiments, an environment for modular software analysis is generated for a software module under analysis. Irrelevancy analysis is performed on the software module to determine that, for each input datum to the software module, whether the input datum is relevant or irrelevant with respect to branch coverage of the module code. A default concrete value is assigned to each irrelevant input datum. A set of concrete values is calculated for each relevant input datum using symbolic execution. The environment is enhanced such that default concrete values are passed to the software module for the irrelevant input data and sets of concrete values generated using symbolic execution are passed to the software module for the relevant input data. The enhanced environment enables module analysis with as much as 100% branch coverage of the module code. | 09-23-2010 |
| 20110225568 | Providing Software Validation as a Service - In one embodiment, a method includes accessing an event-driven application input by a user, the event-driven application comprising source code, one or more use cases input by the user for the event-driven application, and one or more functional requirements input by the user for the event-driven application; parsing the use cases and the functional requirements according to the predefined syntax to construct one or more validation modules for validating the event-driven application without any modification to the source code of the event-driven application for validation purposes; formally validating the event-driven application using the validation modules without relying on assertions inserted into the source code of the event-driven application for validation purposes; and if the formal validation finds one or more defects in the event-driven application, generating output for communication to the user identifying the defects. | 09-15-2011 |
| 20110289488 | Generating Test Sets Using Intelligent Variable Selection and Test Set Compaction - In one embodiment, constructing one or more sets of variables corresponding to one or more input variables of a software module respectively; for each one of the sets of variables, computing an average branching depth that is affected by the set of variables; selecting a first one of the sets of variables that has the smallest average branching depth; assigning a first symbolic value to the input variable of the first set of variables; symbolically executing the software module to generate a first set of test cases for the first set of variables; optionally compacting the first set of test cases by removing the redundant tests that do not increase test coverage and selecting a minimal subset of the first set of test cases that cover all the covered conditional branch points; and validating the software module using the first set of test cases. | 11-24-2011 |
| 20120017117 | Solving Hybrid Constraints to Validate Specification Requirements of a Software Module - In one embodiment, a method includes analyzing one or more first numeric constraints and one or more first string constraints associated with a software module including one or more numeric variables and string variables; inferring one or more second numeric constraints applying to specific ones of the string variables; inferring one or more second string constraints applying to specific ones of the numeric variables; representing each one of the first and second numeric constraints with an equation; representing each one of the first and second string constraints with a finite state machine; and validating the software module with respect to one or more requirements associated with the software module by attempting to solve for a solution including one or more values for specific ones of the numeric and string variables that satisfies all the first and second numeric constraints, all the first and second string constraints, and all the requirements. | 01-19-2012 |
| 20120017119 | Solving Hybrid Constraints to Generate Test Cases for Validating a Software Module - In one embodiment, a method includes analyzing one or more first numeric constraints and one or more first string constraints associated with a software module including one or more numeric variables and string variables; inferring one or more second numeric constraints applying to specific ones of the string variables; inferring one or more second string constraints applying to specific ones of the numeric variables; representing each one of the first and second numeric constraints with an equation; representing each one of the first and second string constraints with a finite state machine; and testing the software module for one or more possible errors by attempting to solve for a solution including one or more values for specific ones of the numeric and string variables that satisfies all the first and second numeric constraints and all the first and second string constraints. | 01-19-2012 |
| 20120017200 | Solving Hybrid Constraints to Validate a Security Software Module for Detecting Injection Attacks - In one embodiment, a method includes analyzing one or more first numeric constraints and one or more first string constraints associated with a software module including one or more numeric variables and string variables; inferring one or more second numeric constraints applying to specific ones of the string variables; inferring one or more second string constraints applying to specific ones of the numeric variables; representing each one of the first and second numeric constraints with an equation; representing each one of the first and second string constraints with a finite state machine; and verifying whether the software module is able to detect one or more forms of injection attacks by attempting to solve for a solution including one or more values for specific ones of the numeric and string variables that satisfies all the first and second numeric constraints and all the first and second string constraints. | 01-19-2012 |
| 20120017201 | System and Method for Comparing Software Frameworks - In one embodiment, a method may include symbolically executing application code on a first framework. The method may also include creating a first model based on the symbolic execution of the first framework. The method may additionally include symbolically executing the application code on a second framework. The method may further include creating a second model based on the symbolic execution of the first framework. The method may also include determining one or more parameters associated with the first framework based on the first model. The method may additionally include determining one or more parameters associated with the second framework based on the second model. The method may also include selecting one of the first framework and the second framework as a desired framework for execution of the application code based on a comparison of the one or more parameters associated with the first framework and the one or more parameters associated with the second framework. | 01-19-2012 |
| 20120017220 | Systems and Methods for Distributing Validation Computations - In one embodiment, a method includes statically analyzing a validation toolkit environment. The method may also include, identifying a plurality of computational threads that do not share data structures with each other based on analysis of the validation toolkit environment. The method may additionally include calculating computational requirements of the computational threads. The method may further include distributing the threads among a plurality of resources such that the aggregate computational requirements of the computational threads are approximately evenly balanced among the plurality of resources. | 01-19-2012 |
| Patent application number | Description | Published |
|---|
| 20120110550 | NODE COMPUTATION INITIALIZATION TECHNIQUE FOR EFFICIENT PARALLELIZATION OF SOFTWARE ANALYSIS IN A DISTRIBUTED COMPUTING ENVIRONMENT - A method for verifying software includes determining an initialization path condition of a received software verification job, determining a termination path condition of a computing node, and initializing the execution of the received software verification job on the computing node based on the initialization path condition and the termination path condition. The initialization path condition includes a sequence of program predicates for reaching a starting state of software to be verified. The received software verification job includes an indication of a portion of the software to be verified. The termination path condition includes an indication of the last state reached during the execution of a previous software verification job on the computing node. The computing node is assigned to execute the received software verification job. | 05-03-2012 |
| 20120110580 | DYNAMIC AND INTELLIGENT PARTIAL COMPUTATION MANAGEMENT FOR EFFICIENT PARALLELIZATION OF SOFTWARE ANALYSIS IN A DISTRIBUTED COMPUTING ENVIRONMENT - A method for verifying software includes determining the result of a bounding function, and using the result of the bounding function to apply one or more policies to the execution of the received job. The bounding function evaluates the execution of a received job, the received job indicating a portion of software to be verified. The result of the bounding function is based upon the present execution of the received job, one or more historical parameters, and an evaluation of the number of idle nodes available to process other jobs. | 05-03-2012 |
| 20120110589 | TECHNIQUE FOR EFFICIENT PARALLELIZATION OF SOFTWARE ANALYSIS IN A DISTRIBUTED COMPUTING ENVIRONMENT THROUGH INTELLIGENT DYNAMIC LOAD BALANCING - A method for verifying software includes monitoring a resource queue and a job queue, determining whether the resource queue and the job queue contain entries, and if both the resource queue and the job queue contain entries, then applying a scheduling policy to select a job, selecting a worker node as a best match for the characteristics of the job among the resource queue entries, assigning the job to the worker node, assigning parameters to the worker node for a job creation policy for creating new jobs in the job queue while executing the job, and assigning parameters to the worker node for a termination policy for halting execution of the job. The resource queue indicates worker nodes available to verify a portion of code. The job queue indicates one or more jobs to be executed by a worker node. A job includes a portion of code to be verified. | 05-03-2012 |
| 20120110590 | EFFICIENT PARTIAL COMPUTATION FOR THE PARALLELIZATION OF SOFTWARE ANALYSIS IN A DISTRIBUTED COMPUTING ENVIRONMENT - An electronic device includes a memory, a processor coupled to the memory, and one or more policies stored in the memory. The policies include a resource availability policy determining whether the processor should continue evaluating the software, and a job availability policy determining whether new jobs will be created for unexplored branches. The processor is configured to receive a job to be executed, evaluate the software, select a branch to explore and store an initialization sequence of one or more unexplored branches if a branch in the software is encountered, evaluate the job availability policy, decide whether to create a job for each of the unexplored branches based on the job availability policy, evaluate the resource availability policy, and decide whether to continue evaluating the software at the branch selected to explore based on the resource availability policy. The job indicates of a portion of software to be evaluated. | 05-03-2012 |
| 20120110591 | SCHEDULING POLICY FOR EFFICIENT PARALLELIZATION OF SOFTWARE ANALYSIS IN A DISTRIBUTED COMPUTING ENVIRONMENT - A method for verifying software includes accessing a job queue, accessing a resource queue, and assigning a job from the job queue to a resource from the resource queue if an addition is made to the a job queue or to a resource queue. The job queue includes an indication of one or more jobs to be executed by a worker node, each job indicating a portion of a code to be verified. The resource queue includes an indication of a one or more worker nodes available to verify a portion of software. The resource is selected by determining the best match for the characteristics of the selected job among the resources in the resource queue. | 05-03-2012 |
| Patent application number | Description | Published |
|---|
| 20090094354 | TECHNIQUE FOR IMPLEMENTING VIRTUAL FABRIC MEMBERSHIP ASSIGNMENTS FOR DEVICES IN A STORAGE AREA NETWORK - A technique is provided for facilitating fabric membership login for an N_Port of a storage area network. A communication from a network node is received. The communication may include a portion of criteria associated with the N_Port. Using at least a portion of the portion of criteria, a virtual fabric identifier corresponding to a virtual fabric which is associated with the N_Port may be automatically identified. Fabric configuration information, which includes the virtual fabric identifier, may be automatically provided to the network node. A fabric login request from the N_Port to login to the virtual fabric may then be received. According to a specific embodiment, the communication may be transmitted from a network node to an F_Port on a Fibre Channel switch. When the N_Port received the fabric configuration information from the F_Port, the generating, using at least a portion of the received fabric configuration information, a fabric login request message may be generated by the N_Port which includes a fabric login request for the N_Port to login to the virtual fabric corresponding to the virtual fabric identifier. In at least one implementation, the N_Port and/or F_Port may be configured or designed to support trunking functionality. | 04-09-2009 |
| 20100226281 | TRUNKING WITH PORT AGGREGATION FOR FABRIC PORTS IN A FIBRE CHANNEL FABRIC AND ATTACHED DEVICES - Trunking with port aggregation for fabric ports in a Fibre Channel (FC) fabric and attached devices is described. In some examples, a method of establishing a connection between a node and the FC fabric includes: negotiating a first link between a first trunking node port in the node with a first trunking fabric port in the FC fabric; creating a trunking port channel with the first link as a first member, the trunking port channel supporting a plurality of virtual fabrics; logging in a logical interface for each of the plurality of virtual fabrics to the FC fabric over the trunking port channel; negotiating a second link between a second trunking node port in the node and a second trunking fabric port in the FC fabric; and adding the second link to the trunking port channel as a second member aggregated with the first member. | 09-09-2010 |
| 20100290472 | ACHIEVING ABOUT AN EQUAL NUMBER OF ACTIVE LINKS ACROSS CHASSIS IN A VIRTUAL PORT-CHANNEL ENVIRONMENT - Two or more network devices can automatically coordinate to aggregate ports into virtual port channels. Ports of the port channel can be automatically assigned priorities to achieve about an equal distribution of active links across the two or more network devices. | 11-18-2010 |
| 20110310729 | Maintaining balance of active links across network devices in a double-sided virtual port-channel environment - In one embodiment, a method includes configuring a first network device for operation in a first logical group with a second network device, receiving information from other network devices configured for operation in a second logical group, the information uniquely identifying each of the other network devices within the second logical group, and assigning a priority to each link connecting the first network device to the second logical group network devices. A portion of the links are selected as active links based on the link priorities and the link priorities are assigned such that a balance of active links is maintained across the second logical group network devices. An apparatus for maintaining a balance of active links across the network devices is also disclosed. | 12-22-2011 |
| Patent application number | Description | Published |
|---|
| 20080316942 | METHODS AND DEVICES FOR EXCHANGING PEER PARAMETERS BETWEEN NETWORK DEVICES - Methods and devices are provided for detecting whether peer ports interconnecting two network devices can perform a novel protocol called Exchange Peer Parameters (“EPP”). If the peer ports are so configured to perform EPP, EPP services are exchanged between the peer ports. In a first phase, information is exchanged about peer port configurations of interest. In a second phase, the results of the exchange of information are applied to hardware and/or software of the respective ports, as needed. | 12-25-2008 |
| 20090103566 | SWITCH PORT ANALYZERS - Methods and devices are provided for non-disruptive monitoring of network traffic through one or more ports of a Fibre Channel network device. Preferred embodiments of the invention are used in conjunction with the switched port analyzer (“SPAN”) and/or remote SPAN (“RSPAN”) features. SPAN mode operation allows traffic through any Fibre Channel interface of a network device to be replicated and delivered to a single port on the same network device. Ingress SPAN allows the monitoring of some or all packets that ingress a specified port or ports. Egress SPAN allows the monitoring of some or all packets that egress a specified port or ports. RSPAN allows the delivery of the replicated traffic to a port on a remote network device. Filtering may be applied, for example, to SPAN packets having selected virtual storage area network numbers. | 04-23-2009 |
| 20110141906 | TRUNKING FOR FABRIC PORTS IN FIBRE CHANNEL SWITCHES AND ATTACHED DEVICES - N_Ports and F_Ports are provided with logic allowing designation of multiple virtual interfaces on a single host bus adaptor or other Fibre Channel interface, one virtual interface for each VSAN operating on the node interface. Node ports with this additional functionality are referred to as trunking N_Ports or TN_Ports. These ports have a functional design allowing creation of the multiple virtual interfaces as appropriate for the application at hand. This port design also includes logic for communicating with a peer fabric port to initialize and modify the configuration of the virtual interfaces on the TN_Port. A corresponding functional design and communication logic is provided for fabric ports, referred to herein as trunking F_Ports or TF_Ports. | 06-16-2011 |
| Patent application number | Description | Published |
|---|
| 20090245430 | EFFICIENT PARALLEL SUB-PACKET DECODING USING MULTIPLE DECODERS - A configurable decoder within a receiver (for example, within a wireless communication device) includes numerous decoders. In one mode, the multiple decoders are used to decode different sub-packets of a packet. When one decoder completes decoding the last sub-packet assigned to it of the packet, then that decoder generates a packet done indication. A control circuit receives the packet done indications, and when all the decoders have generated packet done indications then the control circuit initiates an action. In one example, the action is the interrupting of a processor. The processor responds by reading status information from the control circuit, thereby resetting the interrupt. End-of-packet markers are usable to generate packet done indications and to generate EOP interrupts. Similarly, end-of-group markers are usable to generate group done indications and to generate EOG interrupts. The decoder block is configurable to process sub-packets of a packet using either one or multiple decoders. | 10-01-2009 |
| 20090268603 | MULTIPLE STAGE FOURIER TRANSFORM APPARATUS, PROCESSES, AND ARTICLES OF MANUFACTURE - In embodiments, a fast Fourier transform (FFT) engine includes a series of stages, each stage containing a butterfly and a data normalization device configured to scale output of the stage's butterfly. The scaling factors are adjusted, for example, periodically or on as-needed basis, so that the dynamic range of the butterflies and the buffers is increased for a given bit-width, or the bit-width of these devices is decreased for the same dynamic range. Additionally, bit-width of other buffer(s) is decreased because of the scaling of the data. | 10-29-2009 |
| 20100290512 | ESTIMATING BIT ERROR PROBABILITY (BEP) IN AN EDGE WIRELESS SYSTEM - Distribution parameter mapping determines the bit error probability (BEP) of a burst transmitted from a base station to the mobile station using a modulation and coding scheme (MCS) specified in the EDGE standard. Depending on whether the multi-bit soft decisions of the burst most resemble a Gaussian or a Rician distribution, the statistical parameters μ and σ or A and u are determined The ratio μ/σ or A/σ is mapped to an empirically determined BEP in a Gaussian or Rician lookup table, respectively. The BEPs are not influenced by the degree of code redundancy in the MCS. The BEPs for the four bursts in a radio block are then averaged, filtered and quantized according to the EDGE standard. The quantization level of the average BEP is reported to the base station so that subsequent radio blocks can be transmitted using an MCS that is appropriate for the estimated BEP. | 11-18-2010 |
| Patent application number | Description | Published |
|---|
| 20090006181 | Capturing and utilizing consumer purchase intent information - System and method for capturing and utilizing consumer purchase intent information comprise obtaining item information, from a user, in a plurality of formats from a plurality of sources, extracting keywords from the item information, organizing item information and keywords in a shopping list, and enabling a display of the shopping list to the user. | 01-01-2009 |
| 20090015374 | USER AUTHENTICATION SYSTEM AND METHOD - A system and method of, and a service that employs, user authentication each employs a bluecard created by the service and stored on a personal trusted device (PTD). The system includes the service and the bluecard. The bluecard includes a unique identifier derived from a hardware address of the PTD. The PTD and the service communicate with one another over a personal area network (PAN) during user authentication. The method includes creating the bluecard and pushing the bluecard onto the PTD using an object exchange (OBEX) protocol of the PAN. The service includes a terminal and the created bluecard. The terminal has the PAN that communicates with the PTD. The bluecard is subsequently sent to the service from the PTD for user authentication via the PAN. | 01-15-2009 |
| 20100079239 | Repurposing User Identity Tokens - An exemplary method for repurposing user identity tokens comprises receiving identification information from a user, the user having an existing user identity token and seeking to repurpose the token, obtaining a repurpose identifier associated with the user, enabling a configuration of an identification tag based on the repurpose identifier, and associating the identification tag with the identity token. | 04-01-2010 |
| 20100094701 | Virtual redeemable offers - Systems, methods, and other embodiments associated with tracking in store consumer behavior are described. One example method includes receiving a product tag data (PTD) and a personal data (PD) from a portable digital device (PDD). The PTD is associated with a scan of a product tag of a product. The example method may also include storing the PTD and the PD in a database. The example method may also include creating a virtual redeemable offer (VRO) based, at least in part, on an analysis of the PD, the PTD associated with the scan, and a product information (PI) associated with the product tag. The PI may be stored in the database and describes the product. The example method may also include providing the CRVC to the PDD. | 04-15-2010 |
| 20100205211 | System and Method for Generating a User Profile - A system and method is disclosed for generating a user profile. The method discloses: receiving a user profile request from a profile requester; identifying profile fragments with a profile mediator, from existing profiles in a profile corpus which are responsive to the user profile request; aggregating the identified profile fragments into the user profile response; and transmitting the user profile response to the profile requestor. The system discloses various means and modules for effecting the method. | 08-12-2010 |
| 20100281427 | SELECTING ONE OF PLURAL USER PROFILE PERSONAE BASED ON CONTEXT - A context relating to a service accessed in response to a request responsive to user action is determined. Based on the determined context, at least one of plural, different user profile personae is selected. The selected at least one user profile persona contains information useable during access of the service. | 11-04-2010 |
| 20120095805 | ACQUIRING CUSTOMER INSIGHT IN A RETAIL ENVIRONMENT - The present disclosure provides a computer-implemented method of acquiring customer insight information in a retail environment. The method includes receiving a product interaction from a mobile device, the product interaction comprising a product identifier corresponding to a product located in the retail environment. The method also includes determining a customer location within the retail environment based on a planned location of the product. The method also includes performing a business action based, at least in part, on the product interaction. The method also includes storing customer insight information corresponding to the product interaction to a data structure. | 04-19-2012 |
| Patent application number | Description | Published |
|---|
| 20110307464 | System And Method For Identifying Trending Targets Based On Citations - A new approach is proposed that contemplates systems and methods to identify trending objects that are targets of citations without actually conducting a search. Under the approach, a score is accumulated for each object as a function of the count of citations and influence of the citing subjects/sources/authors within a given time period starting from the timestamp of the earliest citation of the object. A threshold on the score can be predicted or predetermined, which only a certain number but not all of objects are able to exceed. The objects which scores exceed the said threshold are then identified as trending objects within its relevant categories without actually conducting a search and without having to wait for the given time period to be concluded. Finally, a list of top-ranking objects that have been identified is generated and presented to the user. | 12-15-2011 |
| 20110307465 | System and method for metadata transfer among search entities - A new approach is proposed that contemplates systems and methods to ascribe or transfer metadata from one search-related entity to another, where each entity can be one of subject or source, citation, and object or target. First, one or more complete or incomplete attributes associated with one or more of entities across source, citation and target are identified with a high degree of probable accuracy, wherein such metadata or attributes include but are not limited to, time, language, and location of the entities. The identified attributes are then ascribed or transferred from one entity where the metadata is available to other search entities. Finally, the transferred attributes can be utilized to facilitate the selection and ranking of the cited targets for the search result. | 12-15-2011 |
| 20110307466 | System and method for determining quality of cited objects in search results based on the influence of citing subjects - A new approach is proposed that contemplates systems and methods to examine and determine quality of objects cited by citations in a search result based on a citation graph that includes citing subjects, citations, and cited objects. First, influence scores of a plurality of subjects/sources that compose the citations of the objects in the search result are calculated. The quality of the objects cited by the subjects can then be determined by examining the influence scores for the subjects of the citations. Finally, the cited objects selected can be presented to a user or provided to a thirty party for further processing together with the relevant citations and citing subjects. | 12-15-2011 |
| 20110307469 | System and method for query suggestion based on real-time content stream - A new approach is proposed that contemplates systems and methods to provide query suggestions including real-time suggestion of complete query terms, which can be phrases, to a user by analyzing and indexing the real-time history/stream of content or documents in addition to the stream of queries entered. Since the real-time indexing generates a count of potential results for each term found and/or indexed in the stream, the terms found in that stream can then be used as potential query suggestions, knowing that it will be possible to provide results for those queries. | 12-15-2011 |
| 20110313986 | System and method for query temporality analysis - A new approach is proposed that contemplates systems and methods to determine temporality of a query in order to generate a search result including a list of objects that are not only based on matching of the objects to the query but also based on temporality analysis of the query. Here, the temporality of the query can be defined as the distribution over time of the objects matching the query, i.e., the chronology histogram of the query. Such distribution can be analyzed to provide a classification of the intent of the query. Classification of the intent of the query can result either in discrete classification of the query into categories, or in continuous classification of the query which may be a scalar or vector value resulting from transformations of the chronology histogram. | 12-22-2011 |
| 20110313987 | System and method for search of sources and targets based on relative expertise of the sources - A new approach is proposed that contemplates systems and methods to provide a ranking of citied objects and citing subjects identified as results of a search, where the relative expertise of subjects or sources of citations to said targets or objects is considered. The relative expertise is a function of the share of the subject's citations matching the query term or search criteria relative to the share of all subjects' citations matching the query term, weighted by the influence of the subjects. This allows the identification of “experts” on “topics” without any pre-defined categorization of topics or pre-computation of expertise. Under this novel approach, expertise can be determined on any query term in real-time. | 12-22-2011 |
| 20110313988 | System and method for search of sources and targets based on relative topicality specialization of the targets - A new approach is proposed that contemplates systems and methods to provide a ranking of subjects or objects identified as results of a search, where “topicality specialization” and “relative topicality specialization” of the objects is computed and considered. The relative topicality specialization of an object is a function of the share of citations for the object matching the query term among all citations for all objects matching the query term. The computation of the topicality specialization and the relative topicality specialization for objects allow the identification of “specialized objects” for “topics” without any pre-defined categorization of topics or pre-computation of expertise. | 12-22-2011 |
| 20110313989 | System and method for customizing search results from user's perspective - A new approach is proposed that contemplates systems and methods to generate customized subjective search results from the perspective of a user who conducts the search or any other subject entity of chosen by the user. A scored subject list is created from the user's network of sources/subjects/contacts, where each element on the list is a subject/source and the score reflects the subject's potential influence or closeness of its connection/relation with the user. Once created, the subject list is then used as a bias filter on the list of citations from search results. With such influence-weighted citation scores, objects and/or subjects from citations of subjects that have big influence on or enjoy high respect from the user will be ranked prominently in the search result presented to the user, thus biasing the search results from the user's perspective. | 12-22-2011 |
| Patent application number | Description | Published |
|---|
| 20090168703 | Apparatus and method for admitting new devices in a self-healing, self-organizing mesh network - Various embodiments provide an apparatus and method for admitting new devices in a self-healing, self-organizing mesh network. An example embodiment is configured to listen on a dynamically-determined frequency for the network management message; to send jamming messages to neighbor nodes in the wireless mesh network, if the network management message is not received; to receive the network management message from a neighbor node in response to the jamming messages; to synchronize a node timer to the received network management message; and to begin data communications with neighbor sensors using the synchronized node timer. | 07-02-2009 |
| 20090168796 | Apparatus and method for adaptive channel hopping in mesh networks - Various embodiments provide an apparatus and method for adaptive channel hopping in a mesh network. An example embodiment is configured to divide a time period into a plurality of frames; subdivide each of the plurality of frames into a plurality of slots, each of the plurality of slots providing a time segment for local data communication between nodes in a mesh network; enable a first node to dynamically assign itself a first channel for local data communication, the first node using the first channel to receive data communications destined for the first node; and communicate to other nodes of the mesh network information indicative of the first node's dynamic assignment of the first channel. | 07-02-2009 |
| 20100085903 | Apparatus and method for managing packet routing through internally-powered network devices in wireless sensor networks - Various embodiments provide an apparatus and method for managing packet routing through internally-powered network devices in wireless sensor networks. An example embodiment includes a hybrid network having an externally-powered node and an internally-powered node, the method includes configuring a role that the internally-powered node will take during an operations phase of the hybrid network, the role including whether the internally-powered node will act as a router or a non-router; demoting the internally-powered node to a non-router role if the internally-powered node is not needed for routing; and promoting the internally-powered node to a router role if the internally-powered node is needed for routing. | 04-08-2010 |
| 20100177708 | Apparatus and method for establishing data communication in a time-synchronized mesh wireless network during time synchronization failures - Various embodiments provide an apparatus and method for establishing data communication in a time-synchronized mesh wireless network during time synchronization failures. An example embodiment includes experiencing circumstances adversely affecting synchronization of data communications between wireless network nodes; transitioning to an alert mode wherein a radio of a wireless network node is activated for a longer period of time relative to a normal operating mode; sending a message to at least one neighbor node; listening for a response from the neighbor node; and establishing data communications with the neighbor node upon receiving the response. | 07-15-2010 |
| 20100316009 | Apparatus and method for ambient noise adaptation in wireless sensor networks - Various embodiments provide an apparatus and method for adapting wireless sensor network device operation to ambient RF noise. An example embodiment includes: initializing a noise threshold value to a default value; detecting an ambient RF noise level on a plurality of channels of a wireless network device; if the ambient RF noise level detected on a pre-determined number of channels is above the noise threshold value, adjusting the noise threshold value by an increment and retesting the ambient RF noise level on the plurality of channels; if the noise threshold value exceeds a pre-determined maximum noise threshold value, suspending data communications by the wireless network device; and if the ambient RF noise level detected on a pre-determined number of channels is below the noise threshold value, retaining the noise threshold value and enabling data communications by the wireless network device. | 12-16-2010 |
| Patent application number | Description | Published |
|---|
| 20090064993 | SOLAR ENERGY CONCENTRATOR - A solar concentrator having a concentrator element for collecting input light, a reflective component with a plurality of incremental steps for receiving the light and also for redirecting the light, and a waveguide including a plurality of incremental portions enabling collection and concentration of the light. | 03-12-2009 |
| 20090067784 | COMPACT OPTICS FOR CONCENTRATION, AGGREGATION AND ILLUMINATION OF LIGHT ENERGY - A solar concentrator having a concentrator element for collecting input light, a redirecting component with a plurality of incremental steps for receiving the light and also for redirecting the light, and a waveguide including a plurality of incremental portions enabling collection and concentration of the light onto a receiver. Other systems replace the receiver by a light source so system optics can provide illumination. | 03-12-2009 |
| 20100142891 | COMPACT OPTICS FOR CONCENTRATION, AGGREGATION AND ILLUMINATION OF LIGHT ENERGY - A solar concentrator having a concentrator element for collecting input light, a redirecting component with a plurality of incremental steps for receiving the light and also for redirecting the light, and a waveguide including a plurality of incremental portions enabling collection and concentration of the light onto a receiver. Other systems replace the receiver by a light source so system optics can provide illumination. | 06-10-2010 |
| 20110096426 | COMPACT OPTICS FOR CONCENTRATION AND ILLUMINATION SYSTEMS - An optical concentrator having a concentrating element for collecting input light, a redirecting element for receiving the light and also for redirecting the light, and a waveguide including a plurality of incremental portions enabling collection and concentration of the light onto a receiver. Other systems replace the receiver by a light source so the optics can provide illumination. | 04-28-2011 |
| 20110132432 | SOLAR MODULE CONSTRUCTION - Various embodiments of a solar module design are disclosed. In some embodiments, a solar module comprises an optic having a sloped waveguide profile. The optic of the solar module is directly coupled to a receiver comprising a solar cell. The receiver is also coupled to a backplane of the module. | 06-09-2011 |
| 20120099325 | REDIRECTING OPTICS FOR CONCENTRATION AND ILLUMINATION SYSTEMS - An optical system having an optical waveguide for collecting light, a receiver for receiving the light, and redirecting optics for transferring the light from the optical waveguide to the receiver. The optical system can be used for concentrating light such as in solar applications. The optical system can also be used for diffusing light in illumination applications by replacing the receiver with a light source such that the light flows in the reverse of the concentration system. | 04-26-2012 |
| Patent application number | Description | Published |
|---|
| 20090303156 | SYSTEM AND METHOD FOR LOW BANDWIDTH DISPLAY INFORMATION TRANSPORT - A digital video transmission system that operates with three different video rendering paths. A first rendering path operates by receiving display requests and rendering bit-mapped graphics in a local screen buffer. The display information in that local screen buffer is then encoded and transmitted to a remote display system that recreates the content of that local screen buffer in a video buffer of remote display system. A second rendering path operates by receiving encoded video stream requests that can be decoded by the remote display system. Such encoded video streams are sent to the remote display system with minimal addition transport encoding. The third rendering path handles encoded video streams that cannot be handled natively by the remote display system. Such video streams may be either transcoded before transmission or decoded and stored within the local screen buffer. | 12-10-2009 |
| 20100306838 | METHOD AND APPARATUS FOR COPY PROTECTING A DIGITAL ELECTRONIC DEVICE - A device and a method of authenticating an electronic device are described. The method may comprise transmitting a token value and a parameter value to the electronic device and selecting a private key within the electronic device using the parameter value. The token value may be processed with a method selected by the parameter value to generate a processed token. The processed token may be compared with an expected processed token and the electronic device may be authenticated if the processed token compares favorably with said expected processed token. | 12-02-2010 |
| 20110063315 | OPTIMIZATION OF MEMORY BANDWIDTH IN A MULTI-DISPLAY SYSTEM - Graphics display adapters for driving multiple display monitors have become very popular. Graphics display adapters that drive multiple monitors can be used to provide terminal services to multiple independent terminals or be used to provide multiple displays to a single user. Generating video signals for multiple display systems puts a heavy burden on the video memory system since multiple different video signal generators may read from associated frame buffers in a shared video memory system. In one disclosed embodiment, a plurality of video memory read triggers are provided wherein at least two of which are staggered to reduce the load on the video memory system. In response to each read trigger, display data is read from a frame buffer to an associated video signal generation circuit. Each video signal generation circuit then provides a display signal to an associated display screen in a multi-screen environment. | 03-17-2011 |
| 20110080519 | SYSTEM AND METHOD FOR EFFICIENTLY PROCESSING DIGITAL VIDEO - In a digital video processing system for processing full-motion video in computer terminal systems, two main rendering paths are created for a computer terminal system: a screen buffer path and a full-motion video path. The screen buffer path renders a desktop display from a screen buffer within the terminal system. The full-motion video path decodes a video stream and then processes the decoded video stream with a video processing pipeline to fit the video frames within a destination video window within the desktop display. The video processing pipeline performs clipping, blending, chroma resampling, resizing, and color converting of the video frames in pipelined stages with minimal memory accesses. A video adapter then combines the desktop display with the processed digital video for a final terminal display. | 04-07-2011 |
| 20120098864 | SYSTEM AND METHOD FOR DOWNSIZING VIDEO DATA FOR MEMORY BANDWIDTH OPTIMIZATION - The video output system in a computer system reads pixel information from a frame buffer to generate a video output signal. In addition, full-motion video may also be displayed in a window defined in the frame buffer. If the native resolution of the full-motion video is larger than the window defined in said frame buffer then valuable memory space and memory bandwidth is being wasted by writing said larger full-motion video in a memory system (and later reading it back) when some data from the full-motion video will be discarded. Thus, a video pre-processor is disclosed to reduce the size of the full-motion video before that full-motion video is written into a memory system. The video pre-processor will scale the full-motion video down to a size no larger than the window defined in the frame buffer. | 04-26-2012 |
