Abstract: A mechanism is disclosed for generating a composite email for an email conversation. The composite email includes content automatically extracted from a plurality of the emails in the email conversation, and may be generated in response to a user accessing just one of the emails in the email conversation. A mechanism is also disclosed for discovering and recovering lost emails in an email conversation. A mechanism is further disclosed for automatically moving emails from one container to another after an email has been read. These and other advantageous email generating, manipulation, and organization mechanisms are disclosed herein.

Abstract: A system is used for the creation, maintenance, and management of an overall project schedule, of individual project member schedules, and of project task assignments over a network. The system comprises three editors accessed through a web browser to perform the various tasks by members of a project. Information is passed between a web server and web browser and a database is used to maintain all information. The project manager can use a task assignment editor to assign tasks to individual project members. The project manager can use a project schedule editor to initially create the project schedule and to show the overall project schedule. After the project schedule is created, each project member can create their own member schedule using a member schedule editor, containing tasks related to the project schedule. After project members complete a task, the project member updates the member's schedule via the member schedule editor.

Abstract: A web application receives a user input with a SQL injection attack string that references a function. The application generates a corresponding statement based on the user input string, which the application sends to a database server. Upon receiving the statement, the database server executes the statement that invokes the referenced function. When invoked, the referenced function stores a value. The presence of the stored value indicates that the database server invoked the function. Storing the value indicative of the function invocation identifies a vulnerability of the web application to SQL injection attacks, since the function reference is introduced solely through user input and function invocation is not intended by the application. This provides proof of SQL injection vulnerability of the application.

Abstract: Techniques are provided for managing caches in a system with multiple caches that may contain different copies of the same data item. Specifically, techniques are provided for coordinating the write-to-disk operations performed on such data items to ensure that older versions of the data item are not written over newer versions, and to reduce the amount of processing required to recover after a failure. Various approaches are provided in which a master is used to coordinate with the multiple caches to cause a data item to be written to persistent storage. Techniques are also provided for managing checkpoints associated with the caches, where the checkpoints are used to determine the position at which to begin processing recovery logs in the event of a failure.

Abstract: Techniques are provided for ranking the entities that are identified in a document based on an estimated likelihood that a user will actually make use of the annotations. According to one disclosed approach, usage data that indicates how users interact with annotations contained in documents presented to the users is collected. Based on the usage data, weights are generated for features of a feature vector. The weights are then used to modify feature scores of entities, and the modified feature scores are used to determine how to annotate documents. Specifically, a set of entities are identified within a document. A ranking for the identified entities is determined based, at least in part, on (a) feature vector scores for each of the identified entities, and (b) the weights generated for the features of the feature vector. The document is then annotated based, at least in part, on the ranking.

Abstract: Techniques that support trail-based exploration by a user of a repository of documents are described herein. In one embodiment, trail definition data that specifies a trail is received. The trail includes an ordered series of waypoints including a trailhead, intermediate waypoints, and one or more trailends. In some embodiments, deadends may also be defined in the trial. A particular waypoint in the ordered series of waypoints is established as a current waypoint. Search terms can be received from a user to cause a search to be performed. It is then determined whether the search satisfies matching criteria associated with a waypoint that immediately follows the current waypoint in the ordered series of waypoints. If so, the user advances to the next waypoint. Otherwise, the user remains at the current waypoint. Finally, if a trailend is reached, then an action such as rewarding the user in some way may be performed.

Abstract: A method of persisting SNMP (Simple Network Management Protocol) variable values associated with SNMP object IDs for an SNMP managed network element across network element reloads comprises implementing a generic persist operation at the network element; and defining, in conjunction with the generic persist operation, at least one object ID for which a value is to be persisted.

Abstract: Techniques are described for identifying items that have recently undergone an interest burst. Items that have recently undergone an interest burst are identified by comparing how many interest-actions have been performed on the items during a current time window against how many interest-actions have been performed on the items historically. Various tests are performed to rule out candidates that are not likely to be of interest to other users. In addition, various spam detection techniques are described for reducing the possibility that the items that are listed as interest burst items are listed because of spam.

Abstract: Techniques are described herein for replacing a part of an expression in a query to a database with a virtual column. A virtual column is defined by the database to contain results of a defining expression. A part of an expression in a query is replaced with a virtual column whose defining expression is equal to the part of the expression in the query. The part of an expression in a query can be the entire expression. When an expression in a query can be replaced with more than one replacement expression involving virtual columns, the replacement expression with the least cost of query processing is selected.

Abstract: Techniques are disclosed herein to automatically learn a template that describes a common structure present in documents in a training set. The structure of the template is compared to the structure of the documents (or at least a part of each document) in the training set, one-by-one, and generalized in response to differences between the template and the document to which the template is currently being compared. If the structure of any particular document is considered too dissimilar from the structure of the template, then the template is not modified. Various generalization operators are added to the template to generalize the template. One such generalization operator is an “OR”, which indicates that only one of “n” sub-trees below the “OR” operator in the template is allowed at the corresponding position in a document.

Abstract: A method for changing a value displayed on a screen is provided. In response to receiving a user input indicating motion in a particular direction, changing the value independent of where the position of a cursor is on the screen. The value being changed may comprise of a series of segments, and each segment value can be changed individually. In addition, a different user input device that does not indicate motion in a particular direction may be used to change segment values and to select other segment values. Methods for automatically formatting a segmented values and calculating a base time rate based on two different frame rates are also provided.

Abstract: A method and apparatus is provided for determining related keywords to narrow a query, and/or for categorizing a query. A keyword graph connects keyword nodes to each other based on degrees of cross-reference indicating how frequently keywords associated with the nodes appear in searches. A domain node representing a category hooks to a category-matching node in the keyword graph. Based at least in part on a degree of cross-reference between another node and the category-matching node, the domain node hooks to the other node. Alternately, the domain node hooks to nodes that match user-identified keywords. At query time, the query is categorized by the domain node closest to a node matching the query. Keywords related to the category may be determined from the nodes that are hooked to the domain node. The related keywords can be used to narrow a search or expand the metadata of a document.

Abstract: A system and method is provided for recognizing a pattern in queries and using the recognized pattern to categorize queries under existing query categories. An entity text that represents a real-world object is detected in a query. The entity text is categorized into an entity category. The query is then rewritten as an annotated query by replacing the entity text with a placeholder for any entity matching the entity category. The annotated query is compared to other queries that are associated with query categories to find a query category that is frequently associated with the annotated query. The query category frequently associated with the annotated query is used to generate a rule. The rule indicates that any query matching the annotated query is likely to fit into the query category. The rule can be used to assign categories to queries or correct incorrectly categorized queries.

Abstract: Radios synchronize their timing mechanisms using a timing signal that those radios propagate from one radio to another. Radios that are close to each other transmit only during times that none of the other nearby radios is trying to receive. In one scheme, a “master” radio initiates communication while another “slave” radio responds in a pre-determined manner. The master generates and propagates an inverted timing signal to the slave, which propagates approximately the same inverted timing signal to other radios in the slave's cluster. Each radio can be in one of three different modes: “source,” “auto,” and “recipient” modes. A “source” radio generates a timing signal independently. A “recipient” radio uses a received timing signal and forwards it to other radios. An “auto” radio behaves as a “recipient” radio while a timing signal is detectable, but behaves as a “source” radio if the timing signal is lost.

Abstract: Techniques for a data definition language (DDL) statement acquiring a lock on a table in wait mode in a deadlock free manner are provided. A DDL statement specifies metadata of a table that is to be modified, whereas a data manipulation language (DML) statement specifies a table to be modified. When a DDL statement is received, a proxy statement is initiated and executed instead of first acquiring an exclusive lock on metadata of a particular table. The proxy statement is similar to a DML statement in that the proxy statement acquires a lock on the particular table. After the proxy statement has been processed, an exclusive lock on the metadata is acquired.

Abstract: A method and apparatus for intelligently routing and managing audio signals within an electronic device is disclosed. The routing is responsive to a set of logical and physical policies which are stored in data tables which can be updated as needed.

Abstract: Techniques are described herein for supporting efficient evaluation of pivot operations. In an embodiment, a pivoting query on a data table is received. The query identifies pivot columns, measure columns, and grouping columns. In response to receiving the query, a staging table that comprises new pivot columns, aggregated columns, and new grouping columns may be created. For each particular unique combination of values of the grouping columns and the pivot columns in the data table, stored values in the measure columns in the data table are aggregated for certain rows in the plurality of rows in the data table. Each row of the certain rows comprises the each particular unique combination of values of the grouping columns and the pivot columns in the data table. Results of aggregating are stored in the staging table. Data that has been populated in the staging table is transposed into a result set.

Abstract: In an embodiment, a filter chain object comprising an association of a starting set of data items and two or more filter links is created and stored in computer memory. Each of the filter links comprises a component object that associates a set operation and a membership criterion. Each of the filter links is associated with a particular filter view among a plurality of filter views. Each particular filter view comprises a graphical representation of a state of applying the membership criterion of the associated filter link to a subset of data resulting from filtering the starting set of data items according to zero or more preceding filter links.

Abstract: Techniques are described to allow a query to be registered as a persistent stored entity within the database, and to generate notifications as and when the query result changes continuously as long as the query continues to be registered with the database. According to one aspect, for a table referenced in a query, a filter condition is generated based, at least in part, on a predicate of the query. Then, the database server determines whether the filter condition is satisfied by either a before image of a row, or an after image of the row, that was modified by a transaction. If the filter condition is satisfied by either the before image or the after image, then the query is added to a first set of queries whose result sets may have been affected by the transaction. From among the first set of queries, a second set of queries that have result sets that were actually affected by the transaction is determined. Notifications are then sent based on the second set of queries.

Abstract: A closed caption tagging system provides a mechanism for inserting tags into an audio or video television broadcast stream prior to or at the time of transmission. The tags contain command and control information that the receiver translates and acts upon. The receiver receives the broadcast stream and detects and processes the tags within the broadcast stream which is stored on a storage device that resides on the receiver. Program material from the broadcast stream is played back to the viewer from the storage device. Tags indicate the start and end points of a program segment. Program segments such as commercials are automatically replaced by the receiver with new program segments that are selected based on various criteria.