Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Jain, San Jose
Ajay Jain, San Jose, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20080209505 | Policy-based physical security system for restricting access to computer resources and data flow through network equipment - Embodiments are directed to systems and methods for integration and normalization of physical security data, states and events to and from disparate physical security systems to maintain in real-time rules based policy state information to enforce physical security policies uniformly across network and information technology (IT) systems. Moreover it pertains specifically to such apparatus for providing an integration platform, methods and processes for normalizing data from physical security systems, to maintain physical security states, mapping to network access and either directly affecting the network equipment through standard programming commands or providing interfaces for network equipment and IT applications to query and determine physical security access states thus enforcing rules in real-time based on security systems data and events. | 08-28-2008 |
| 20080209506 | Physical access control and security monitoring system utilizing a normalized data format - Embodiments disclose a system and method for the integration of data and events to and from physical access control and security monitoring systems that is normalized to standardized definition for enforcement of standardized rules, created through a visual policy editor, affecting persistence, propagation of data and generation of alerts and notifications for physical security, network and IT systems. Data from disparate physical security systems is normalized for visual rule creation by rule object shapes representing normalized security systems, data and processes. A rules-based policy engine enforces security policies and generates actionable events. The overall system provides an integration platform, methods and processes for normalizing data from physical security systems, representation of physical security systems, data and processes for visual creation of rules using defined stencil objects, generating formatted rules, and enforcing these rules in real-time on security systems data and events. | 08-28-2008 |
Alpa Jain, San Jose, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100306166 | AUTOMATIC FACT VALIDATION - The disclosed embodiments fulfill searches and determine the validity of a large set of noisy facts and rank the set of facts according to a validity score. Embodiments construct a fact graph by linking together facts that share a common relation structure and entity or instance of an argument. Facts are re-ranked and validated using link analysis processes which propagate weight (validity/authority) through the fact graph. The resulting weights for each fact are potentially combined with other scores (such as from fact extraction algorithms) in order to come up with a final ranking of the facts. | 12-02-2010 |
| 20110093452 | AUTOMATIC COMPARATIVE ANALYSIS - Web search engines are often presented with user queries that involve comparisons of real-world entities. Thus far, this interaction has typically been captured by users submitting appropriately designed keyword queries for which they are presented a list of relevant documents. Embodiments explicitly allow for a comparative analysis of entities to improve the search experience. | 04-21-2011 |
| 20110161311 | SEARCH SUGGESTION CLUSTERING AND PRESENTATION - Disclosed are methods and apparatus for clustering and presenting search suggestions. A segment of text is obtained via a search query section of a user interface, the segment of text being a portion of a search query. A set of suggestions is obtained, each suggestion in the set of suggestions being a suggested search query relating to the segment of text. Two or more groups of suggestions are generated, each of the two or more groups of suggestions including a different subset of the set of suggestions. The two or more groups of suggestions are provided such that each of the two or more groups of suggestions is displayed in a separate partition of a search assistance segment of the user interface. | 06-30-2011 |
| 20110231387 | ENGAGING CONTENT PROVISION - A model is created and from seed trivia facts will create a database of pruned and ranked trivia facts and associated trigger terms. Search, email, or other information provider systems are configured to detect usage of the trigger terms and provide relevant trivia facts in response to the usage. | 09-22-2011 |
| 20120036148 | SOCIALIZING VIA SEARCH - Implementations of methods, apparatuses, or systems are disclosed to facilitate search related communications. | 02-09-2012 |
| 20120143875 | METHOD AND SYSTEM FOR DISCOVERING DYNAMIC RELATIONS AMONG ENTITIES - Method, system, and programs for detecting dynamic relationship and discovering dynamic events. Data from a first data source is first received. At least one dynamic relation candidate is identified and each dynamic relation candidate involves multiple entities. The at least one dynamic relation candidate is identified based on temporal properties with respect to the entities exhibited in the data from the first data source. Dynamic relations are then extracted by corroborating the temporal properties of the entities involved in the at least one dynamic relation candidate with that of the same entities exhibited in data from a second data source. Then, a dynamic event that gives rise to the dynamic relations among different entities is detected. | 06-07-2012 |
| 20120191745 | Synthesized Suggestions for Web-Search Queries - Data-mining software receives a user query as an input and segments the user query into a number of units. The data-mining software then drops terms from a unit using a Conditional Random Field (CRF) model that combines a number of features. At least one of the features is derived from query logs and at least one of the features is derived from web documents. The data-mining software then generates one or more candidate queries by adding terms to the unit. The added terms result from a hybrid method that utilizes query sessions and a web corpus. The data-mining software also scores each candidate query on well-formedness of the candidate query, utility, and relevance to the user query. Then the data-mining software stores the scored candidate queries in a database for subsequent display in a graphical user interface for a search engine. | 07-26-2012 |
| 20120246097 | Apparatus and Methods for Analyzing and Using Short Messages from Commercial Accounts - Disclosed are methods and apparatus for analyzing and using online short messages from promoting entity accounts (e.g., business or non-profit accounts). In one embodiment, a method of analyzing and using messages sent for a plurality of promoting entity accounts is disclosed. A plurality of models for classifying a plurality of messages based on a plurality of message features are obtained for each message. Each message is sent via a computer network between a selected one of the promoting entity accounts and one or more subscribing users that subscribe to receive messages from such selected promoting entity account, and each model is trained to identify whether a message belongs to a particular class based on a lexicon that was generated for such particular class and a training set of messages that belong to the particular class and message that do not belong to the particular class. A new message is classified based on the models and retaining classification information regarding the new message in a database that is accessible by a user so as to review the classification information on a computer display. | 09-27-2012 |
| 20120296927 | SYSTEM AND METHOD FOR CONTEXTUALIZING QUERY INSTRUCTIONS USING USER'S RECENT SEARCH HISTORY - Disclosed is a system and method for providing search suggestions to a user based on the user's previously entered search queries. A computing device stores a global set of search suggestions. The computing device receives over a network from a user computer operated by a user one or more alphanumeric characters forming a portion of a search query. The computing device determines a search suggestion to the portion of the search query from the global set of search suggestions based on a search history of the user, the search history of the user comprising a plurality of search queries entered by the user within a predetermined period of time. The computing device transmits to the user computer the search suggestion for display by the user computer. | 11-22-2012 |
Ashit Jain, San Jose, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20120084607 | FACILITATING LARGE-SCALE TESTING USING VIRTUALIZATION TECHNOLOGY IN A MULTI-TENANT DATABASE ENVIRONMENT - A system and method for testing in a database system. In one embodiment, a method includes receiving an indication of one or more changes to a software application, wherein each change corresponds to a different version of the software application. The method further includes generating one or more virtual machines for a version of the software application in response to the indication, wherein the one or more virtual machines test the version of the software application. | 04-05-2012 |
Ashit Kumar Jain, San Jose, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20110083122 | METHOD AND SYSTEM FOR MASSIVE LARGE SCALE TEST INFRASTRUCTURE - An automated system is provided to support massive scale grid of machines in a rapid, multi-developer coding environment. The system has virtual testing environments that are created from template machines, supporting various software versions for various code branches. The grid is built by having a small subset of template machines (e.g. with Oracle 9g, 10g, and application server installations), images of the template machines, virtual machine instances created by applying one or more of the image templates, which then are used by the virtual testing environment. Upon receipt of code changes, changes are checked-out, compiled, tested on various test feeds on a virtual testing environment, which is destroyed and re-created after every test run. Any software version upgrades or bug fixes need to be applied only to the template machines. The number of virtual machines associated with any particular template machine is dynamically configurable to provision for optimal use of testing machines. | 04-07-2011 |
Jaideep Jain, San Jose, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090132062 | APPARATUS AND METHODS FOR PRECOMPILING PROGRAM SEQUENCES FOR WAFER PROCESSING - Disclosed are apparatus and methods for embodiments for efficiently and flexibly controlling hardware devices in a semiconductor processing system are provided for use in a distributed control arrangement. In general, the distributed arrangement includes at least one upper-level controller that is configurable with a computer program sequence of instructions for controlling one or more hardware devices of a processing tool. The hardware devices are controlled through one or more lower-level controllers. Prior to execution of the program sequence of the upper-level controller, at least one instruction of this program is pre-compiled so as to translate the instruction for execution by a selected lower-level controller and to add an at least one interlock check to such pre-compiled instruction and make the translated instruction accessible to at least one lower-level controller. The interlock check specifies one or more condition(s) for the selected lower-level controller to execute the pre-compiled instruction. Any number of instructions of the upper-level controller may be translated for use by any number of selected lower-level controllers, where some of the translated instructions include one or more interlock checks. | 05-21-2009 |
Jawahar Jain, San Jose, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20080243746 | Compact Decision Diagrams - In one embodiment, a method includes determining an initial projected size of a BDD representing data for storage. The projected size corresponds to an initial projected number of decision nodes composing the BDD. The method includes determining an initial node structure for the decision nodes of the BDD according to the initial projected size of the BDD. The initial node structure includes for each decision node a variable identifier (ID), a 1-edge pointer, and a 0-edge pointer each represented by a minimum number of bits accommodating the initial projected number of decision nodes composing the BDD. | 10-02-2008 |
| 20080243907 | Efficient Indexing Using Compact Decision Diagrams - In one embodiment, a method includes accessing an inverted index of a searchable set of objects including key words. The inverted index includes multiple lists each corresponding to a particular key word and identifying a particular subset of the objects including the particular key word. The method includes generating a binary decision diagram (BDD) for each of one or more of the lists. The BDD corresponds to the particular key word of the list, and each decision node of the BDD represents an object in the searchable set of objects including the particular key word of the list. The method includes storing each of one or more of the lists as its BDD. Storage of the BDD facilitates more efficient storage of the inverted index. | 10-02-2008 |
| 20090171928 | Ranking Nodes for Session-Based Queries - In one embodiment, a method includes accessing a model of a set of nodes including a session node and multiple linked nodes linked to the session node. The linked nodes include parent nodes and child nodes. A parent node links one or more child nodes to the session node, and a child node has one or more parent nodes linking the child node to the session node. The method includes generating a probability distribution for the set of nodes that distributes probabilities to all linked nodes within a predetermined number of links from the session node. Each child node receives from each of its parent nodes a predetermined fraction of a probability distributed to the parent node, and the parent node uniformly distributes to each of its child nodes the predetermined fraction of the probability distributed to the parent node. | 07-02-2009 |
Lalit Jain, San Jose, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20120030258 | Effective Dating for Entity Attributes and Relationships - A method for tracking modifications to tables or relationships. In one embodiment, the method includes updating a first value stored in a first field of a record in a table in response to a database system receiving a first structured query language (SQL) statement from a customer relationship management (CRM) application. A first record is inserted into a history table in response to the first SQL statement, wherein the first record comprises a foreign key field that stores a copy of the primary key of the record, a field that stores a copy of the first value after it is updated, a field that stores a name of the first field, and a first date field. The first date field stores either the date when the first SQL statement was received by the database system, the date of the day that immediately follows the date when the first SQL statement was received by the database system, or a date that was entered into a field of a user interface. | 02-02-2012 |
Namit Jain, San Jose, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20110137963 | PERFORMING AN ACTION IN RESPONSE TO A FILE SYSTEM EVENT - A method and apparatus for performing an action in response to a file system event is provided. According to one aspect, sets of “event listeners” are associated with a file hierarchy and/or the nodes thereof. Each event listener contains a set of “event handlers.” Each event handler corresponds to a separate type of event that may occur relative to the file hierarchy's nodes. When an event is going to occur relative to the hierarchy or a node thereof, all event listeners that are associated with that hierarchy/node are inspected to determine whether those event listeners contain any event handlers that correspond to the event's type. Those event handlers that correspond to the event's type are placed in an ordered list of event handlers to be invoked. As the event handlers in the list are invoked, programmatic mechanisms that correspond to those event handlers are executed to perform customized user-specified actions. | 06-09-2011 |
Naveen K. Jain, San Jose, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20120076140 | Method and Apparatus for Improving Packet Processing Performance Using Multiple Contexts - A network processing device having multiple processing engines capable of providing multi-context parallel processing is disclosed. The device includes a receiver and a packet processor, wherein the receiver is capable of receiving packets at a predefined packet flow rate. The packet processor, in one embodiment, includes multiple processing engines, wherein each processing engine is further configured to include multiple context processing components. The context processing components are used to provide multi-context parallel processing to increase throughput. | 03-29-2012 |
Pankaj Jain, San Jose, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20130093787 | METHOD AND APPARATUS FOR GROUPING AND DE-OVERLAPPING ITEMS IN A USER INTERFACE - An approach is provided for grouping and de-overlapping items in a user interface. A display manager determines one or more items for rendering in a user interface. The display manager then causes, at least in part, a determination of one or more rendering locations for one or more representations of the one or more items based, at least in part, on location information associated with the one or more items. The display manager further causes, at least in part, a grouping, a de-overlapping, or a combination thereof of the one or more representations based, at least in part, on an overlapping of the one or more rendering locations. The display manager also causes, at least in part, a rendering of the one or more representations in the user interface based, at least in part, on the grouping, the de-overlapping, or a combination thereof. | 04-18-2013 |
Praveen Jain, San Jose, CA US
| 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 |
| 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 |
Reshu Jain, San Jose, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20120198269 | METHOD AND APPARATUS FOR APPLICATION RECOVERY IN A FILE SYSTEM - Embodiments of the invention relate to block layout and block allocation in a file system to support transparency of application processing. At least one copy of an application is replicated in a write affinity region of a secondary server, and at least one copy of the application is replicated in a wide striping region across a cluster file system. When the application is subject to failure, application processing is transferred from the failure location to the write affinity copy. At the same time, the failed application is rebuilt using the wide striping replication of the application. Once the application is rebuilt, processing may return to the failed location employing the rebuilt application. | 08-02-2012 |
| 20120284558 | APPLICATION RECOVERY IN A FILE SYSTEM - Embodiments of the invention relate to block layout and block allocation in a file system to support transparency of application processing. At least one copy of an application is replicated in a write affinity region of a secondary server, and at least one copy of the application is replicated in a wide striping region across a cluster file system. When the application is subject to failure, application processing is transferred from the failure location to the write affinity copy. At the same time, the failed application is rebuilt using the wide striping replication of the application. Once the application is rebuilt, processing may return to the failed location employing the rebuilt application. | 11-08-2012 |
Uttam Jain, San Jose, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20090030877 | THREE-PHASE SINGLE-PASS EFFICIENT PROCESSING OF XQUERY UPDATE - A system and method is provided for processing XQuery Updates on an Extensible Markup Language (XML) document. The XQuery Updates are processed in three phases. The first phase includes creating a pending update list (PUL) including all update operations to be performed on nodes in a fragment of the Extensible Markup Language (XML) document. The second phase includes sorting the PUL. The third phase includes applying the sorted PUL to each node in the XML fragment during a single traversal of the XML fragment. | 01-29-2009 |
Vipul K. Jain, San Jose, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20120246458 | POWER OPTIMIZATION ON A THIN CLIENT DEVICE - Power allocated to a plurality of external ports of a thin client device is optimized based on power available to the thin client device that interoperates with a host device. A determination is made as to available power for the thin client device. Operational states of a plurality of external ports of the thin client device are configured based on the available power and operational settings for the thin client device. These operational settings could be user or administrator configured, pre-configured into the thin client device, or a combination thereof. | 09-27-2012 |