Patents by Inventor Dikran S. Meliksetian
Dikran S. Meliksetian has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 7483890Abstract: A tagging tree that defines a hierarchical output data structure and relational database query operations that retrieve the data to be included in each hierarchical section is accepted and processed. A query optimizer analyzes the tagging tree to determine database query operations that can be combined into a single query command. An outer-union query command is generated to allow efficient combination of multiple query commands, some of which are predicates to others. The tagging tree is modified to replace the database queries that were combined into the outer-union query to extract data from the results set produced by the outer-union query as opposed to submitting queries to the database manager. The optimized queries can be reused an arbitrary number of times to leverage the optimizing resources that were used in their creation.Type: GrantFiled: January 17, 2007Date of Patent: January 27, 2009Assignee: International Business Machines CorporationInventors: Nianjun Zhou, George Andrei Mihaila, Dikran S. Meliksetian, Sriram Padmanabhan
-
Patent number: 7454469Abstract: A framework for creating instant messaging Bots that autonomously operate within an instant messaging sessions to respond to requests from other user(s) or Bot(s). Bot operation is defined by a state machine with one or more states that are described in XML documents. These XML documents abide by the grammar of a Bot Transition Definition Language (BTDL) that is defined in an XML schema. A Bot developer creates a state transition diagram via a Graphical User Interface. The state transition diagram defines states, transitions between states, and conditions for each of those state transitions and methods to be performed upon each state transition. An XML document that conforms to BTDL format is created from the state transition definition diagram. Both stateful and stateless Bots are defined using XML documents abiding to a BTDL format. A runtime environment implements the Bots, accepts runtime inputs and generates responses.Type: GrantFiled: December 22, 2003Date of Patent: November 18, 2008Assignee: International Business Machines CorporationInventors: Nianjun Zhou, Chen Shu, Dikran S. Meliksetian
-
Publication number: 20080243629Abstract: An apparatus, system, and method are disclosed for logically packaging and delivering a service offering. A set of service implementation artifacts, a service ordering process, and a service provisioning process are selected and configured to implement a service offering. A requirements specification for the set of service implementation artifacts is defined. Logical associations between parameters are defined such that a change of a parameter for a first component triggers a change for a parameter of a second component. Beneficially, such an apparatus, system, and method accelerates the self-service ordering and deployment of service offerings.Type: ApplicationFiled: March 26, 2007Publication date: October 2, 2008Applicant: INTERNATIONAL BUSINESS MACHINESInventors: Sandra Sheu Chang, Dikran S. Meliksetian, Peng Ye
-
Patent number: 7409634Abstract: The system for end-to-end content publishing using XML with an object dependency graph is based on the following two design principles: First, separation of content and style: Information stored in the content management system is independent on how it is going to be presented. The presentation style is encapsulated elsewhere and can be used to customize the look and feel based on the end-user preferences as well as the delivery methods and devices. Second, reusability of information content: By encapsulating common information in fragments and subfragments and making these fragments insertable in other fragments, thereby avoid scattering and duplication of information. This enables a user to restrict the edit operations to a limited number of relevant fragments, to affect global changes. In addition, the present invention provides data consistency and data integrity in the content management.Type: GrantFiled: July 26, 2006Date of Patent: August 5, 2008Assignee: International Business Machines CorporationInventors: Peter E. Davis, Sara Elo Dean, Dikran S. Meliksetian, Jeffrey Milton, Louis Weitzman, Nianjun Zhou
-
Publication number: 20080178147Abstract: An apparatus, system, and method are disclosed for profiling and reusing software development assets. The apparatus includes an asset repository that stores assets, and functional and performance descriptions corresponding to each asset. The apparatus further includes a service planning module configured to interpret functional requirement(s) for a target application, and at least one service quality element corresponding to the functional requirement(s). The target application may be an internet-based application, and the functional requirements may be functions performed by software elements. The apparatus further includes a deployment module configured to compare the functional requirements with the stored assets to generate a solution plan. The solution plan may be a group of assets configured to perform the functional requirement(s) for the target application.Type: ApplicationFiled: January 22, 2007Publication date: July 24, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Dikran S. Meliksetian, Noshir Cavas Wadia, Matthew Yang Wang
-
Publication number: 20080172408Abstract: A system and method of converting a recursive XML document into a relational schema comprises providing a recursive XML document; parsing an external mapping script specifying a mapping from the recursive XML document to a relational table format; building a recursive shredding tree based on the external mapping script and the relational table format; and shredding the mapped recursive XML document into a relational table. The system and method further comprise detecting whether any of a XML schema and a DTD document is recursive, wherein the detecting comprises building a directed graph comprising element names; corresponding elements names as nodes in the directed graph; forming arcs from every element parent node to every element child node of the element parent node; and checking for cycles in the directed graph. The system and method further comprise identifying all recursive cursor nodes and a recursive degree corresponding to the recursive shredding tree.Type: ApplicationFiled: March 25, 2008Publication date: July 17, 2008Applicant: International Business Machines CorporationInventors: Dikran S. Meliksetian, George A. Mihaila, Sriram K. Padmanabhan, Nianjun Zhou
-
Publication number: 20080147723Abstract: A method and system that allows efficient shredding of large instances of hierarchical data structures into relational data structures. Large instances of hierarchical data structures, which are able to be larger than the random access storage of a computer used to shred them into relational data structures, are incrementally shredded into a temporary storage. When the amount of data shredded into the temporary storage reaches or exceeds a predetermined commit count, the data in the temporary storage is transferred to a relational data structure maintained by a relational database manager. A Document Type Description annotation is provided to allow the end user to specify execution order for SQL commands and to specify commit count values.Type: ApplicationFiled: February 20, 2008Publication date: June 19, 2008Applicant: International Business Machines Corp.Inventors: DIKRAN S. MELIKSETIAN, George Andrel Mihaila, Nianjun Zhou
-
Publication number: 20080140386Abstract: A method for autonomic computing using a relational grammar represented in a mark-up language. In response to a system input change, the autonomic relational grammar and the autonomic system input is parsed to form an autonomic derivation tree representing autonomic system tokens, categories, attributes and relationships. An action is taken as defined by the relational grammar according to the input changes sensed.Type: ApplicationFiled: December 5, 2007Publication date: June 12, 2008Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Dikran S. Meliksetian, Louis M. Weitzman
-
Patent number: 7363317Abstract: A method and system that allows efficient shredding of large instances of hierarchical data structures into relational data structures. Large instances of hierarchical data structures, which are able to be larger than the random access storage of a computer used to shred them into relational data structures, are incrementally shredded into a temporary storage. When the amount of data shredded into the temporary storage reaches or exceeds a predetermined commit count, the data in the temporary storage is transferred to a relational data structure maintained by a relational database manager. A Document Type Description annotation is provided to allow the end user to specify execution order for SQL commands and to specify commit count values.Type: GrantFiled: February 15, 2005Date of Patent: April 22, 2008Assignee: International Business Machines CorporationInventors: Dikran S. Meliksetian, George Andrei Mihaila, Nianjun Zhou
-
Patent number: 7284012Abstract: A system selects a plurality of attributes common to objects being compared and defines at least one value space for each selected attribute. Each selected attribute can have a value space that is different from a value space of the same attribute associated with a different object. The system defines an ordering system for each value space including selecting whether the value space consists of non-ordered values, partially ordered values, or fully ordered values. An objective function is defined for each ordering system and the objective function maps a pair of values of a value space to a number value. The system normalizes each objective function and defines a mapping from the plurality of objective functions to a first general objective function.Type: GrantFiled: January 24, 2003Date of Patent: October 16, 2007Assignee: International Business Machines CorporationInventors: Dikran S. Meliksetian, Nianjun Zhou
-
Patent number: 7219102Abstract: Tagging trees are generated and used to facilitate transforming data from relational databases into hierarchical formats, such as in XML documents. Tagging trees contain both XML hierarchical structure information as well a query information that is needed to access different data sources, e.g., databases, to retrieve the information to be placed in the hierarchical structure. A designer optionally creates a mapping script that specifies the transformation from relational databases to the hierarchical format. A tagging tree is created by either parsing that mapping script or by other means. A runtime environment then processes the tagging tree by a depth first traversal. The runtime environment is able to be configured to output a hierarchical data object, such as an XML document, or pipelined to control, for example, SAX processing.Type: GrantFiled: February 26, 2004Date of Patent: May 15, 2007Assignee: International Business Machines CorporationInventors: Nianjun Zhou, George Andrei Mihaila, Dikran S. Meliksetian, Sriram Padmanabhan
-
Patent number: 7185024Abstract: A tagging tree that defines a hierarchical output data structure and relational database query operations that retrieve the data to be included in each hierarchical section is accepted and processed. A query optimizer analyzes the tagging tree to determine database query operations that can be combined into a single query command. An outer-union query command is generated to allow efficient combination of multiple query commands, some of which are predicates to others. The tagging tree is modified to replace the database queries that were combined into the outer-union query to extract data from the results set produced by the outer-union query as opposed to submitting queries to the database manager. The optimized queries can be reused an arbitrary number of times to leverage the optimizing resources that were used in their creation.Type: GrantFiled: December 22, 2003Date of Patent: February 27, 2007Assignee: International Business Machines CorporationInventors: Nianjun Zhou, George Andrei Mihaila, Dikran S. Meliksetian, Sriram Padmanabhan
-
Patent number: 7076728Abstract: The system for end-to-end content publishing using XML with an object dependency graph is based on the following two design principles: First, separation of content and style: Information stored in the content management system is independent on how it is going to be presented. The presentation style is encapsulated elsewhere and can be used to customize the look and feel based on the end-user preferences as well as the delivery methods and devices. Second, reusability of information content: By encapsulating common information in fragments and subfragments and making these fragments insertable in other fragments, thereby avoid scattering and duplication of information. This enables a user to restrict the edit operations to a limited number of relevant fragments, to affect global changes. In addition, the present invention provides data consistency and data integrity in the content management.Type: GrantFiled: December 22, 2000Date of Patent: July 11, 2006Assignee: International Business Machines CorporationInventors: Peter E. Davis, Sara Elo Dean, Dikran S. Meliksetian, Jeffrey Milton, Louis Weitzman, Nianjun Zhou
-
Publication number: 20040220954Abstract: A system, method and computer readable medium for translating data in a hierarchical data structure to a relational data structure is disclosed. The method on an information processing system includes reading a hierarchical data abiding to a hierarchical data structure for holding data and traversing the hierarchical data structure using a tree traversal algorithm. The method further includes generating, in accordance with an external mapping script, a mapping for translating data from the hierarchical data structure to a relational data structure. The method further includes reading a hierarchical data structure including data and translating the data of the hierarchical data structure to the relational data structure using the mapping and using a depth-first traversal algorithm.Type: ApplicationFiled: April 29, 2003Publication date: November 4, 2004Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Nianjun Zhou, George A. Mihaila, Sriram Padmanabhan, Dikran S. Meliksetian, Arun P. Govindarajulu, Jessica Wu
-
Publication number: 20040205064Abstract: An entropy based adaptive search method for searching a database or other repository system or modality whereby an Attribute of an object is presented as a question to a user. The Attributes are presented according to their adjusted entropy values. The user provides an attribute value to the attribute by the act of selecting one question from the questionnaire to begin with. Each time the user selects a question and answers it, a new list of attributes and a new questionnaire is derived based on previous activity. When a threshold number of results has been reached the results are displayed to the user.Type: ApplicationFiled: April 11, 2003Publication date: October 14, 2004Inventors: Nianjun Zhou, Dikran S. Meliksetian, Chen Shu
-
Publication number: 20040148312Abstract: A system, method and computer readable medium for comparing objects is disclosed. A method includes selecting a plurality of attributes common to objects being compared and defining at least one value space. A value space is defined for each attribute of the plurality of attributes selected. The method further includes defining a plurality of ordering systems. An ordering system is defined for each value space of the at least one value space. An objective function is defined for each ordering system of the plurality of ordering systems and wherein an objective function maps a pair of values of a value space to a number value. The method further includes normalizing each objective function of the plurality of objective functions and defining a mapping from the plurality of objective functions to a first objective function.Type: ApplicationFiled: January 24, 2003Publication date: July 29, 2004Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Dikran S. Meliksetian, Nianjun Zhou
-
Publication number: 20020152244Abstract: A method on an information processing unit performing steps for creating a user interface (UI) to assemble a document that conforms to a particular document type definition. The method hides the specific syntax of document type definitions such as DTDs and schemas from the user. The method begins with a selection from a user for a document type or an existing document. Once the document type is selected or determined from the existing document the document type definitions are retrieved. The document type definitions include one or more elements. The method parses the elements which are subsequently mapped to one or more interface controls such as icons, pull-down menus, buttons, selection boxes, progress indicators, on-off checkmarks, scroll bars, windows, window edges for resizing the window, toggle buttons, forms, and UI widgets. UI can be GUIs or interactive voice response systems.Type: ApplicationFiled: December 22, 2000Publication date: October 17, 2002Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Sara Elo Dean, Dikran S. Meliksetian, Louis Weitzman
-
Publication number: 20020133516Abstract: The system for end-to-end content publishing using XML with an object dependency graph is based on the following two design principles: First, separation of content and style: Information stored in the content management system is independent on how it is going to be presented. The presentation style is encapsulated elsewhere and can be used to customize the look and feel based on the end-user preferences as well as the delivery methods and devices. Second, reusability of information content: By encapsulating common information in fragments and subfragments and making these fragments insertable in other fragments, thereby avoid scattering and duplication of information. This enables a user to restrict the edit operations to a limited number of relevant fragments, to affect global changes. In addition, the present invention provides data consistency and data integrity in the content management.Type: ApplicationFiled: December 22, 2000Publication date: September 19, 2002Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Peter E. Davis, Sara Elo Dean, Dikran S. Meliksetian, Jeffrey Milton, Louis Weitzman, Nianjun Zhou