Patents by Inventor Francesco Maria Carteri
Francesco Maria Carteri 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: 8549514Abstract: A solution for distributing software products in a data processing system is disclosed. A set of models of each software product is to be distributed (for example, of the UML type) is provided; each model includes an indication of relationships among a plurality of available logical items (representing functions provided by the software product, such as use cases) and a plurality of available distribution artifacts (used to distribute the software product). A set of logical items is then selected among the available ones. The process continues by identifying a set of distribution artifacts required to implement the selected logical items (among the available distribution artifacts); the required distribution artifacts are identified according to the corresponding relationships in the models. A software package is built including the required distribution artifacts. The software package is then distributed to a set of data processing entities of the system (i.e.Type: GrantFiled: March 14, 2008Date of Patent: October 1, 2013Assignee: International Business Machines CorporationInventors: Francesco Maria Carteri, Alessandro Donatelli, Claudio Marinelli, Luigi Pichetti
-
Patent number: 8490023Abstract: A solution for navigating UML diagrams (200) is proposed. For this purpose, a graphical interface is implemented for defining multiple navigation paths (NAVk) along corresponding sequences of diagrams (DIA11-DIA55). The definition of those navigation paths is stored into a dedicated file (without modifying the definition of the diagrams). A home bar for invoking the navigation paths is then added to the graphical representation of the diagrams. Once a reader has selected a specific navigation path, its first diagram (DIA11; DIA15) is retrieved and displayed. At the same time, a navigation bar for moving throughout the sequence is dynamically generated and added to the graphical representation of each diagram that is traversed.Type: GrantFiled: April 4, 2008Date of Patent: July 16, 2013Assignee: International Business Machines CorporationInventors: Francesco Maria Carteri, Alessandro Donatelli, Claudio Marinelli, Luigi Pichetti
-
Patent number: 8458663Abstract: Methods, computer program products and systems for determining whether to perform a static code analysis of a software product. In one embodiment of the method, the method for determining whether to perform a static code analysis depends on a number of variables including a developer's knowledge of the software product in question; a developer's knowledge of the language in which the software product is written: and the amount of time the developer has actually worked with the product. The individual and collective experience of members of a software development team may be determined to decide whether static code analysis needs to be performed on software written by the team.Type: GrantFiled: February 16, 2009Date of Patent: June 4, 2013Assignee: International Business Machines CorporationInventors: Francesco Maria Carteri, Filomena Ferrara, Roberto Menghini
-
Patent number: 8271982Abstract: A mechanism is provided for rescheduling jobs for execution by a computing system. The computing system receives job related data associated with a plurality of jobs to be executed by the computing system, time constraint data, and maximum time shift values associated with the time constraint data. The computing system determines that a start time for execution of a first job of the plurality of jobs should be rescheduled. The computing system receives workload statistics. The computing system determines based on the workload statistics, a first start time for the first job. The computing system compares the time constraint data with the first start time to determine if the first start time is in conflict with the time constraint data. The computing system stores the first start time.Type: GrantFiled: May 8, 2008Date of Patent: September 18, 2012Assignee: International Business Machines CorporationInventors: Francesco Maria Carteri, Filomena Floriana Ferrara, Scot MacLellan
-
Patent number: 8271934Abstract: A solution is proposed for developing software applications on a data processing system. A corresponding method starts with the step of providing an analysis model of a software application (such as based on a use case diagram); the analysis model represents the software application with stereotypes (i.e., use cases) each one representing a requirement of the software application. The method continues by estimating an optimum number of features of the software application (each one representing a function of the software application); the optimum number of features is estimated according to the analysis model. The stereotypes are then organized in packages; each package includes a set of logically correlated stereotypes, which expose a corresponding feature. A number of the packages are determined according to the optimum number of features and used to implement the software application.Type: GrantFiled: June 13, 2008Date of Patent: September 18, 2012Assignee: International Business Machines CorporationInventors: Francesco Maria Carteri, Alessandro Donatelli, Rosario Gangemi, Antonio Perrone, Luigi Pichetti
-
Publication number: 20090282411Abstract: A scheduling method and system. The method includes receiving, by a computing system, job related data associated with a plurality of jobs to be executed by said computing system, time constraint data, and maximum time shift values associated with the time constraint data. The computing system determines that a start time for execution of a first job of the plurality of jobs should be rescheduled. The computing system receives workload statistics. The computing system determines based on the workload statistics, a first start time for the first job. The computing system compares the time constraint data with the first start time to determine if the first start time is in conflict with the time constraint data. The computing system stores the first start time.Type: ApplicationFiled: May 8, 2008Publication date: November 12, 2009Inventors: Francesco Maria Carteri, Filomena Floriana Ferrara, Scot MacLellan
-
Publication number: 20090210854Abstract: Methods, computer program products and systems for determining whether to perform a static code analysis of a software product. In one embodiment of the method, the method for determining whether to perform a static code analysis depends on a number of variables including a developer's knowledge of the software product in question; a developer's knowledge of the language in which the software product is written: and the amount of time the developer has actually worked with the product. The individual and collective experience of members of a software development team may be determined to decide whether static code analysis needs to be performed on software written by the team.Type: ApplicationFiled: February 16, 2009Publication date: August 20, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Francesco Maria Carteri, Filomena Ferrara, Roberto Menghini
-
Publication number: 20090158286Abstract: A solution for scheduling execution of jobs in a data processing system is disclosed. One method for implementing such a solution may start by providing a scheduling structure for scheduling the execution of jobs. Such a scheduling structure may include a workflow plan defining a flow of execution for planned jobs and/or a workflow model defining static policies for execution of modeled jobs. A set of rules for updating the scheduling structure is provided. The method may continue by updating the scheduling structure according to the rules, such as by adding or removing jobs for rules evaluated to be true. The execution of the jobs may then be scheduled according to the updated scheduling structure. A corresponding system and computer program product are also disclosed.Type: ApplicationFiled: November 4, 2008Publication date: June 18, 2009Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Francesco Maria Carteri, Filomena Ferrara, Scot MacLellan
-
Publication number: 20080313599Abstract: A solution is proposed for developing software applications on a data processing system. A corresponding method (A1-A6) starts with the step of providing (A1) an analysis model of a software application (such as based on a use case diagram); the analysis model represents the software application with stereotypes (i.e., use cases) each one representing a requirement of the software application. The method continues by estimating (A2-A3) an optimum number of features of the software application (each one representing a function of the software application); the optimum number of features is estimated according to the analysis model. The stereotypes are then organized (A4-A5) in packages; each package includes a set of logically correlated stereotypes, which expose a corresponding feature. A number of the packages is determined according to the optimum number of features. It is now possible to implement (A6) the software application according to the packages.Type: ApplicationFiled: June 13, 2008Publication date: December 18, 2008Applicant: International Business Machines CorporationInventors: Francesco Maria Carteri, Alessandro Donatelli, Rosario Gangemi, Antonio Perrone, Luigi Pichetti
-
Publication number: 20080229303Abstract: A solution for distributing software products in a data processing system is disclosed. A set of models of each software product is to be distributed (for example, of the UML type) is provided; each model includes an indication of relationships among a plurality of available logical items (representing functions provided by the software product, such as use cases) and a plurality of available distribution artifacts (used to distribute the software product). A set of logical items is then selected among the available ones. The process continues by identifying a set of distribution artifacts required to implement the selected logical items (among the available distribution artifacts); the required distribution artifacts are identified according to the corresponding relationships in the models. A software package is built including the required distribution artifacts. The software package is then distributed to a set of data processing entities of the system (i.e.Type: ApplicationFiled: March 14, 2008Publication date: September 18, 2008Inventors: Francesco Maria Carteri, Alessandro Donatelli, Claudio Marinelli, Luigi Pichetti
-
Publication number: 20080229253Abstract: A solution for navigating UML diagrams (200) is proposed. For this purpose, a graphical interface is implemented for defining multiple navigation paths (NAVk) along corresponding sequences of diagrams (DIA11-DIA55). The definition of those navigation paths is stored into a dedicated file (without modifying the definition of the diagrams). A home bar for invoking the navigation paths is then added to the graphical representation of the diagrams. Once a reader has selected a specific navigation path, its first diagram (DIA11; DIA15) is retrieved and displayed. At the same time, a navigation bar for moving throughout the sequence is dynamically generated and added to the graphical representation of each diagram that is traversed.Type: ApplicationFiled: April 4, 2008Publication date: September 18, 2008Applicant: International Business Machines CorporationInventors: Francesco Maria Carteri, Alessandro Donatelli, Claudio Marinelli, Luigi Pichetti
-
Publication number: 20070245314Abstract: A solution (200) for collecting inventory information relating to complex resources is proposed. For this purpose, a data mover (285) interfaces with a common collector engine (210). The data mover registers (A3) itself as a listener for a selected resource class on behalf of every exploiter (265). The collector engine solves (A4) the correlations involving the selected resource class, as indicated in predefined discovery directories (235). Providers (225) adapted to discover inventory information about the correlated resource classes are periodically invoked (A5-A9), according to a scheduling plan defined in the same discovery directives. As soon as the providers for all the correlated resource classes have completed the discovery of the corresponding information (A10), the data mover is notified accordingly (A11). In response thereto, the data mover transfers (A13-A15) the discovered (delta) inventory information to the exploiter.Type: ApplicationFiled: February 22, 2007Publication date: October 18, 2007Inventors: Francesco Maria Carteri, Alessandro Donatelli, Alberto Giammaria, Luigi Pichetti, Jonathan Mark Wagner