Software code optimizer and method

Information

  • Patent Grant
  • 11048488
  • Patent Number
    11,048,488
  • Date Filed
    Tuesday, August 13, 2019
    5 years ago
  • Date Issued
    Tuesday, June 29, 2021
    3 years ago
Abstract
The invention provides, in some aspects, methods of optimizing an app for execution on a client device by identifying components of the app used in such execution by a user having a designated role who accesses the app for download via a designated portal. A component can be, for example, a source code file or portion thereof, including, for example, a portion defining a widget or other user interface element. For each component, the method (i) identifies source code files on which execution of that component depends, e.g., in connection with execution of the particular app by the particular user, and (ii) generates a dependency-ordered stack of the source code files for that component. In further accord with those aspects of the invention, the method combines the dependency-ordered stacks into a single such stack and transfers the source code in an order specified by that stack to the client device for loading and execution.
Description
BACKGROUND OF THE INVENTION

The invention pertains to digital data processing and more particularly, by way of non-limiting example, to the optimization of software. The invention has application in facilitating the download and execution of so-called web apps, as well as other computer programs that download and execute in source code format.


Enterprises are increasingly turning to web apps to service customer and other end user needs. This is an opportunity made possible by the ubiquity of feature-rich browsers supporting JavaScript, CSS and other user interface (UI) standards on mobile and other devices in the hands and/or on the desktops of billions of users worldwide. Whereas software distribution was once the sole province of high-tech companies with teams of dedicated developers, these feature-rich browsers now define such a large and powerful platform that enterprises of all varieties, from high-tech to low-tech, can benefit by distributing apps to them, whether for customer service, marketing or otherwise. Browser technologies have become so versatile in fact, that enterprises often rely on them for distribution of apps within the enterprise to employees—not just to customers and others on the outside.


Unfortunately, just like conventional software applications, browser apps often include code to support capabilities that most individual users do not require or cannot use. For example, browser apps typically include software supporting end users of diverse classes, even though each individual user who runs the app only falls into only one of those classes. Likewise, the apps provide code supporting user access from a variety of portals (e.g., developer portal, support portal, etc.) even though each end user is likely to access the app from only one of them.


A consequence of excess code is that web apps are large, and their downloads are slow. While end users who run a given app for hours on end may not be bothered by this on an initial download, occasional users will be—as are those who download “once and done” apps, e.g., customer service requests.


An object of the invention is to provide improved methods and apparatus for digital data processing.


A further object is to provide such methods and apparatus is to improve the download and execution of web apps and other computer programs that download and execute in source code format.


SUMMARY OF THE INVENTION

The above objects are among those attained by the invention which provides, in some aspects, methods of optimizing an app for download to and/or execution on a client device by identifying components of the app used in such execution by a user having a designated role who accesses the app for download via a designated portal. A component can be, for example, a source code file or portion thereof, including, for example, a portion defining a widget or other user interface element.


For each component, the method (i) identifies source code files on which execution of that component depends, e.g., in connection with execution of the particular app by the particular user, and (ii) generates a dependency-ordered stack of the source code files for that component. In further accord with those aspects of the invention, the method combines the dependency-ordered stacks into a single such stack and transfers the source code in an order specified by that stack to the client device for loading and execution.


Related aspects of the invention provide optimization methods, e.g., as described above, where the step of identifying source code file dependencies and generating a dependency-ordered stack for each component includes (i) recursively iterating, in both depth and breadth, through the identified components and, in turn, through the components on which they depend, and (ii) creating a dependency stack for each component encountered during such recursive iteration if none exists.


Further related aspects of the invention provide optimization methods, e.g., as described above, where a sort (e.g., a bubble sort or otherwise) is used to combine the dependency-ordered stacks into a single dependency-ordered stack.


Yet further related aspects of the invention provide optimization methods, e.g., as described above, where combining the dependency-ordered stacks includes iteratively appending one of the dependency-ordered stacks to an intermediate stack and deleting prior entries in that intermediate stack.


Still yet other related aspects of the invention provide optimization methods, e.g., as described above, where transferring the source code to the client device includes doing so in multiple bundles, each based on the dependency order specified in the single dependency-ordered stack. Those bundles can include, according to other related aspects of the invention, a top bundle including source code that is loaded as soon as a page is visible upon execution of the app on the client digital data device; a template bundle include source code loaded before control rendering begins upon execution of the app on the client digital data device; and a bottom bundle including source code loaded at an end of an initial page load upon execution of the app on the client digital data device.


Yet still other aspects of the invention provide optimization methods, e.g., as described above, where the step of identifying components used in execution of the app includes crawling the app source code starting at an entry point and recursively descending in both depth and breadth, crawling designated components even if they will not be used in execution of the app on the client digital data device by the user, and not crawling designated components even if they will be used in execution of the app on the client digital data device by the user.


Still further related aspects of the invention provide methods, e.g., as described above, where source code files defining components are JavaScript files.


Other aspects of the invention provide methods, e.g., as described above, that include identifying, in style sheets, a set of user interface components, features of those components, and formats of those components or features, used in execution of an app on a client digital data devices by users having a plurality of different respective roles and/or portals from which they request transfer of the app for loading and execution. The method further includes identifying a subset of those components, features and formats not used in execution of the app on a client digital data device by a user having at least one of a designated role and a designated portal from which the client digital data device requests transfer of the app for loading and execution.


The method calls for transferring to the client digital data device for loading and execution thereon those style sheets files or portions thereof that define components, features and formats that are in the set, while refraining from transferring those that define components, features and formats that are in the subset. Thus, for example, if a first subset of components, features and formats are identified as not used on a first client digital data device by a first user having a first role who downloads the app from a first portal, and a second subset of components, features and formats are identified as not used on a second client digital data device by a second user having a second role who downloads the app from a second portal, the method calls for transferring to the first client digital data device for loading and execution source code files that define the set while foregoing transfer those at define the first subset and transferring to the second client digital data device for loading and execution source code files that define the set while foregoing transfer those at define the second subset.


Related aspects of the invention provide methods, e.g., as described above, that include generating and transferring to the client digital data device for loading and execution source code files that define the set but that are not in the subset, while foregoing at least one of generating and transferring those source code files that define the subset.


Still further related aspects of the invention provide methods, e.g., as described above, where source code files defining formats of the user interface components are cascading style sheets (CSS).





BRIEF DESCRIPTION OF THE DRAWINGS

A more complete understanding of the invention may be attained by reference to the drawings, in which:



FIG. 1 depicts a digital data processing system for practice of the invention, as well as a system in which the invention may be practiced;



FIG. 2 depicts operation of an optimization application in a system according to one practice of the invention;



FIG. 3 depicts operation of a crawler in a system according to one practice of the invention;



FIG. 4 depicts operation of the CSS optimizer in a system according to one practice of the invention;



FIG. 5 depicts further aspects of operation of the CSS optimizer in a system according to one practice of the invention;



FIG. 6 depicts generation of a style sheet bundle in a system according to one practice of the invention; and



FIG. 7 depicts operation of an optimizer in a system according to one practice of the invention.





DETAILED DESCRIPTION OF THE ILLUSTRATED EMBODIMENT

Architecture



FIG. 1 depicts a digital data processing system 10 for practice of the invention, as well as a system 10 in which the invention may be practiced. The system 10 includes a server digital data processor 12 that is coupled to client digital data processors 14, 16 and 18 via a network 20 comprising a combination of one or more of the Internet, a wide area network (WAN), metropolitan area network (MAN), local area network (LAN), telephone networks and/or a combination of these and other networks (wired, wireless, public, private or otherwise).


The illustrated client digital data processors 14-18 are conventional tablet computers, PDAs, mobile phones or other digital data apparatus (including, for example, desktop computers, workstations, minicomputers, and laptop computers) of the type that are commercially available in the marketplace and that are suitable for operation in the illustrated system as described herein and all as adapted in accord with the teachings hereof.


The digital data devices 14-18 each comprise central processing, memory, storage and input/output units and other constituent components (not shown) of the type conventional in the art that cooperate to execute applications 14a-18a, each of which comprises a web application of the type commercially available in the marketplace or otherwise known in the art and operative on the respective devices 14-18 for, by way of example, for purposes of presenting user interfaces on the respective devices 14-18, presenting data in connection therewith received from the server 12, user or otherwise, accepting user input with respect to those interfaces, issuing HTTP/HTTPS (collectively, “HTTP”) requests to the server 12 for those interfaces and/or for requesting and/or submitting information with respect thereto, and so forth, all as per convention in the art as adapted in accord with the teachings hereof. Those web apps can comprise HTML, JavaScript, cascading style sheets (CSS), and so forth, and they can execute within the context of a web browser (not shown), a WebKit, or otherwise—again, per convention in the art as adapted in accord with the teachings hereof.


The central processing, memory, storage and input/output units of client digital data processors 14-18 may be configured to form and/or may be supplemented by other elements of the type known in the art desirable or necessary to support applications 14a-18a, respectively, in accord with the teachings hereof, as well as to support other operations of the digital data processor 12. These can include, by way of non-limiting example, peripheral devices (such as keyboards and monitors), operating systems, and network interface cards and software, e.g., for supporting communications with server digital data processor 12 and other devices over network 20.


Although client digital data processors 14-18 are depicted and described in like manner here, it will be appreciated that this is for sake of generality and convenience: in other embodiments, these devices may differ in architecture and operation from that shown and described here and/or from each other, all consistent with the teachings hereof.


Like client digital data processors 14-18, server digital data processor 12 is a digital data processing apparatus of the type commercially available in the marketplace suitable for operation in the illustrated system as described herein, as adapted in accord with the teachings hereof. Though the server 12 is typically implemented in a server-class computer, such as a minicomputer, it may also be implemented in a desktop computer, workstation, laptop computer, tablet computer, PDA or other suitable apparatus (again, as adapted in accord with the teachings hereof).


Server digital data processor 12, too, comprises central processing, memory, storage and input/output units and other constituent components (not shown) of the type conventional in the art that are configured in accord with the teachings hereof to form rules engine 22 and rules base 24, transaction database 26, language database 28 and context registry 30, one or more of which may be absent in various embodiments of the invention.


Although only a single server digital data processor 12 is depicted and described here, it will be appreciated that other embodiments may have greater or fewer numbers of these devices.


Those other servers may differ in architecture and operation from that shown and described here and/or from each other, all consistent with the teachings hereof. Still further, although server 12 of the illustrated embodiment is depicted as being remotely disposed from the client digital data processors 14-18, in other embodiments, one or more of the client devices may be co-housed with the server.


Rules base 24 comprises a conventional rules base of the type known in the art (albeit configured in accord with the teachings hereof) for storing digitally encoded rules 25 and other application-related information in tables, database records, database objects, and so forth. Such stored rules 25 are likewise formatted and stored in the conventional manner known in the art (albeit configured in accord with the teachings hereof). Here, rules base 24 is configured and contains rules for use in business process management applications, though in other embodiments it may be configured and used for other applications. Such a rules base can be of the type described in the US patents and patent applications assigned to the assignee hereof, e.g., U.S. Pat. Nos. 5,826,250, 6,976,144, 7,665,063, 8,335,704, 7,711,919, 7,640,222, 8,250,525, US 20080208785, US 20090132232, U.S. Pat. Nos. 8,843,435, 8,479,157, 8,468,492, 8,880,487, 8,924,335, 9,189,361, US 20130231970, U.S. Pat. Nos. 9,678,719, 8,959,480, 9,270,743, US 20150127736, U.S. Pat. No. 9,658,735, US 20160098298, US 20170090685, US 20170255341, the teachings of which are incorporated by reference herein; though, a rules base that is architected and/or operated differently may be used as well or in addition, as may be another store and/or repository of applications, apps and other software suitable for use in connection herewith.


Although shown in the illustrated embodiment as part of server 12, rules base 24 (or other repository) may reside elsewhere, e.g., remote to server 12. Moreover, some embodiments may utilize multiple rules bases, e.g., an enterprise-wide rules base 24 on the server 12 and domain-specific rules bases on one or more of client devices 14-18, all by way of example. To the extent that multiple rules bases are provided in any given embodiment, they may be of like architecture and operation as one another; though, they may be disparate in these regards, as well. Utilization of multiple rules bases may be accomplished in the manner described in one or more of the above-cited incorporated-by-reference U.S. patents and patent applications, e.g., U.S. Pat. No. 8,924,335, entitled “Systems and Methods for Distributed Rules Processing,” the teachings of which are incorporated heron by reference.


Transactional database 26 comprises a conventional database of the type known in the art (albeit configured in accord with the teachings hereof) for storing corporate, personal, governmental or other data that may be any of generated, stored, retrieved and otherwise processed (hereinafter, collectively referred to as “processed”) by rules in rules base 24 and/or rules stored/executed elsewhere. The data may be financial data, customer records, personal data, run-time data related to an application, or other type of data and it may be stored in tables, database records, database objects, and so forth.


As above, some embodiments may utilize multiple transactional databases, e.g., an enterprise-wide database 26 on the server 12 and branch-office specific databases on the client devices 14-18, all by way of example. To the extent that multiple transactional databases are provided in any given embodiment, they may be of like architecture and operation as one another; though, may they be disparate in these regards, as well. Utilization of multiple transactional databases may be accomplished in the manner described in incorporated-by-reference U.S. Pat. No. 8,924,335.


Language base 28 encodes information regarding the syntax of the language (or languages) in which user interfaces generated by server 12 are presented on devices 14-18 and, more particularly, in the illustrated embodiment, by applications 14a-18a. That syntax can include one or more of grammar, spelling, usage, punctuation, and/or style. The language base 28 may comprise a language database of the variety commercially available in the marketplace—e.g., in the manner of spelling and grammar dictionaries provided with conventional word processors (which “dictionaries” often include usage-, punctuation- and/or style-related entries). Alternatively, the language syntax information may be embodied in one or more rules 25 of the rules base 24, or otherwise.


Context registry 30 is a store that includes information related to the respective contexts or circumstances in which the requested user interfaces (e.g., web pages) are and/or will be communicated to and executed on the respective client devices 14-18. That context or circumstance can include, by way of non-limiting example, user “properties” or business attributes (e.g., access requirements, disability settings, market segment, behavioral segment, age, locale, and so forth), client device 14-18 properties (e.g., processor speed, display size, keyboard capabilities, locale, and so forth), communication channel properties (e.g., the speed and type of connection between server 12 and the respective client devices 14-18) and portal properties (e.g., download file size limits, quality-of-service requirements and so forth). That context or circumstance can further include, by way of non-limiting example, the language, country and/or other locale settings and preferences of the user of a device on which the web page is to be displayed. Still other variations in the possible range of values stored in the context registry 30 are possible.


Illustrated digital data processor 12 also includes rules engine 22 of the type conventionally known in the art (albeit configured in accord with the teachings hereof) for use in processing rules from a rules base in order to process data, e.g., in (and/or for storage to) a transactional database in view of a language base and/or context registry or other data sources described above, for example, in connection with events signaled to and/or detected by the engine. In the illustrated embodiment, the rules engine is of the type used for business process management applications, though in other embodiments it may be of the type used for other applications. Preferred such rules engines are of the type described in the aforementioned incorporated-by-reference U.S. Pat. No. 5,826,250, entitled “Rules Bases and Methods of Access Thereof” and U.S. Pat. No. 7,640,222, entitled “Rules Base Systems and Methods with Circumstance Translation” and/or U.S. Pat. No. 8,250,525, entitled “Proactive Performance Management For Multi-User Enterprise Software Systems,” the teachings too of which are incorporated by reference herein-all as adapted in accord with the teachings hereof.


The rules engine 22 may be implemented in a single software program or module, or a combination of multiple software modules/programs. Moreover, it may comprise programming instructions, scripts, rules (e.g., rules stored in rules base 24) and/or a combination of thereof. And, even though the rules engine 22 of the illustrated embodiment is depicted as executing on just server digital data processor 12, in other embodiments, the engine may execute on or across multiple digital data processors (e.g., 12, 14, 16 and 18). Executing the engine 22 over multiple digital data processors may be accomplished in the manner described in incorporated-by-reference U.S. Pat. No. 8,924,335, by way of non-limiting example.


Described below is a method of operating system 10 and, particularly, server 12 and still more particularly, by way of example, rules engine 22, to optimize instantiations of a model app 42 for download from that device 12, rules base 24 and/or engine 22 to one or more client devices 14-18 for execution thereon, e.g., as a web app 14a-18a. This may be, for example, at the request of a user of one of those devices issued via a web browser executing thereon or otherwise; conversely, such download may be effected sans user request, e.g., upon boot-up of a respective one of the devices 14-18 or otherwise—all as per convention in the art as adapted in accord with the teachings hereof.


As used here, to “optimize” the app 42 means to reduce the footprint of JavaScript code and/or cascading style sheets (CSS) that make up the app 42 as downloaded vis-à-vis instantiations thereof to the requesting device 14-18, e.g., based on the nature of that device, the access requirements (i.e., “role”) of the user of that device making the request and/or on behalf of whom the request is made, and the portal (i.e., the web site or web address) to the which download request was made and/or from which the request is fulfilled. The app 42 is occasionally referred to herein as an app “model” because it includes rules and style sheets for all combinations of portals, requesting devices and user roles.


In the illustrated embodiment, that method is carried out by an optimization application 32 alone and/or in cooperation with other functionality of the server 12 and/or client devices 14-18, as evident in the discussion below. Application 32 of the illustrated embodiment is implemented in rules that are stored in rules base 24 and executed by rules engine 22 upon invocation. However, other embodiments may vary in this regard. Thus, for example, application 32 may be embodied in other software formats, sourced from other repositories and executed other than on a rules engine.


Likewise, in the illustrated embodiment, model apps which are instantiated for download to requesting devices 14-18 (e.g., model app 42 mentioned above and discussed below) are sourced from rules base 24. In such an embodiment, the app 42 is represented by a set of rules (e.g., from the rules base 24) that combine to define the app's functions and features when executed, e.g., as an app 14a-18a within a browser or otherwise the requesting device. In other embodiments, the app 42 may be represented in other software formats and executed according within browsers or otherwise on the respective devices 14-18.


Optimization Application


Referring to FIG. 2, in step 200, the optimization application 32 is invoked in real-time mode or batch mode by rules engine 22 or other functionality executing on server 12. Real-time mode refers to invocation in real-time response to a request by a client device 14-18 for download of an instantiation of app 42 to be executed on that device. Batch mode refers to invocation of the application 32 in advance of such a request—e.g., as where the application 32 is invoked to generate instantiations of the app 42 that are expected to meet possible future such requests. Invocation of the application 32, whether implemented in rules or otherwise in real-time mode or in batch mode, is within the ken of those skilled in the art in view of the teachings hereof.


In step 202, an application crawler 44 that forms part of optimization application 32 parses and/or otherwise crawls the source code of app 42, that is, the rules or other source code instructions (hereinafter, collectively, “source code rules” or, simply, “rules”) comprising app 42 to identify source code files or portions thereof, including user interface components—all, collectively, referred to herein as “components”—for use with an instantiation of app 42 (i) for download from a designated portal, (ii) for execution on a designated (requesting) device 14-18, and/or (iii) by a user having a designated role or, put another way, for use with an instantiation of app 42 for download and execution in connection with a specific combination of portal, device and/or user role. In the illustrated embodiment, the source code 42 is JavaScript and related programming instructions/declarations, e.g., embedded scripting languages, style sheets, and the like, all as within the ken of those skilled in the art in view of the teachings hereof. In other embodiments, the source code files may include other source code programming languages, instead or in addition.


The crawler 44 generates, in step 202, a report 46 referred to in the drawings as a “crawler usage report”; although, it need not be a report in the conventional sense of a human-readable document but, rather, may comprise any memorialization of identified components, e.g., in binary, XML, or otherwise, as is within the ken of those skilled in the art in view of the teachings hereof. The report can be stored in a dedicated file, as part of a database or otherwise, on server 12 or otherwise. Operation of the crawler 44 may be further appreciated in connection with FIG. 3 and the discussion thereof below.


In addition to the foregoing, the crawler usage report 46 is supplemented to include, for each listed component, names or identities of one or more JavaScript (“JS”) files that implement (i.e., contain code defining) the component—or, put another way, the JS files on which the component depends. In addition, the report 46 can identify user interface features implemented by those files—or, put another way, the JS files on which those features depend. The crawler usage report 46 can, moreover, be supplemented to indicate when each JS file is preferably loaded. For example, such load order can be designated as “top,” “template” or “bottom” bundle (as described further below).


The foregoing component-to-file and feature-to-file dependencies and bundle designations can be added to the report 46 automatically by the application crawler 44 and/or with the assistance of an administrator, software engineer or other human agent. Alternatively, or in addition, the crawler 44 can rely on a file or other listing of such dependencies and/or load order for purposes of supplementing the report 46.


As used above and elsewhere herein, a portal designation can be with respect to a specific portal address (or portion of such address) from which the instantiation is to be downloaded (or, as used synonymously therewith herein, to which a request for download is made), or with respect to a role served by such portal (e.g., a portal that serves production code vs test code, etc.), and so forth, as is within the ken of those skilled in the art in view of the teachings hereof. Likewise, above and elsewhere a device designation can be with respect to a specific device address (e.g., as specified by MAC address, or other unique identifier) or device type (e.g., as specified by operating system, browser or webkit type, processor class, memory or other storage capacity, display type/size, data communication speed and type, and so forth), or otherwise, as is within the ken of those skilled in the art in view of the teachings hereof. Furthermore, above and elsewhere a user role designation can be with respect to a specific role, e.g., end user, developer, administrator and so forth, as reflected in an active directory, user name requirement codes or otherwise, as is within the ken of those skilled in the art in view of the teachings hereof. In some embodiments, the user role designation/identification can extend to a level of granularity of individual users in which case the designation/identification can be by user name, ID or other unique identifier.


In step 206, a JavaScript optimizer 48 that forms part of optimization application 32 generates for the components identified in Step 202 and reflected in the report 46 (i.e., the components identified as being for use with an instantiation of app 42 for download and execution in connection with a specific combination of portal, device and/or user role) a dependency-ordered stack of source code files containing the components so identified. In step 208, the JavaScript optimizer combines the dependency-ordered stacks generated in step 206 into a single dependency-ordered stack. In step 210, the JavaScript optimizer 48 prepares for transfer to and loading on a requesting client device 14-18 (and, particularly, for example, within the environment of a browser or webkit of such device) the source code files identified in the dependency-ordered stack generated in step 208. The optimizer 48 prepares for such transfer in an order that is based on the dependency order specified in that stack. In embodiments, in which the steps 200-210 are executed in real-time mode, the optimizer 48 can, alone or in cooperation with other elements of server 12, proceed with transfer of those files in that order, via HTML stream or otherwise, as is within the ken of those skilled in the art in view of the teachings hereof. Where, on the other hand, steps 200-210 are executed in batch mode the optimizer can delay such transfer until such a corresponding request is received. Operation of the optimizer 48 as per steps 206-210 may be further appreciated in connection with FIG. 7 and the discussion thereof below.


In some embodiments, the optimizer 48 transfers (or prepares for transfer) the source code files to the requesting client 14-18 in multiple bundles, including (i) a top bundle 50 comprising source code loaded as soon as page is visible upon execution of the app on the client digital data device by the user, (ii) a template bundle 52 comprising source code loaded before control rendering begins upon execution of the app on the client digital data device by the user, and (iii) a bottom bundle 54 comprising source code loaded at an end of an initial page load upon execution of the app on the client digital data device by the user. In each instance, the bundles are transferred in accord with the dependency order specified in the single dependency-ordered stack. In other embodiments, the JavaScript optimizer 48 may transfer the source code files in greater, fewer and/or different bundles. The segregation of files into such bundles and their transfer to the client devices 14-18 is within the ken of those skilled in the art in view of the teachings hereof.


As discussed above, in step 202, the application crawler 44 can parse/crawl rules comprising app 42 to identify components for use with an instantiation of app 42 for download and execution in connection with a specific combination of portal, device and/or user role. In step 202 of some embodiments, the crawler 42 can, alternatively or in addition, identify the cascading style sheets (hereinafter, simply, “style sheets”) used by the app 42, a set of user interface components, features of those user interface components, and formats of those user interface components or features—all, collectively, referred to herein as a set of “style features”—for use with instantiations of app 42 downloaded from a plurality of different portals for execution on a plurality of different (requesting) devices 14-18, and/or by a plurality of users having different role. The crawler can, furthermore, identify a subset of those style features that are not for use with an instantiation of app 42 (i) for download from a designated portal, (ii) for execution of a designated (requesting) device 14-18, and/or (iii) by a user having a designated role or, put another way, that are not for use with an instantiation of app 42 for download and execution in connection with a specific combination of portal, device and/or user role. In embodiments where step 202 includes identifying style features, step 202 can include generating the report 46 to include such style features as fall within the aforesaid set, along with those that fall in the aforesaid subset.


Moreover, in such embodiments, a CSS optimizer 56 that forms part of optimization application 32 can, in step 212, prepare for transfer to and loading and execution on the client device 14-18 (and, particularly, for example, the browser of such a device) files that define style sheets that are in the aforesaid set but that are not in the aforesaid subset. In embodiments in which the steps 200-202 and 212 are executed in real-time mode, the optimizer 56 can, alone or in cooperation with other elements of server 12, proceed with the file transfer via HTML stream or otherwise, as is within the ken of those skilled in the art in view of the teachings hereof. Where, on the other hand, those steps are executed in batch mode the optimizer can delay such transfer until such a corresponding request is received.


Operation of the CSS optimizer 56 may be further appreciated in connection with FIGS. 4-5 and the discussion thereof below.


Application Crawler



FIG. 3 depicts operation of an application crawler 44 according to one practice of the invention. As noted above, the crawler parses/crawls a set of rules defining an app model 42 to identify components used in execution of an instantiation of that model for a specific combination of portal, device and/or user role.


In step 300, the crawler 44 discerns the portal in connection with which the components of app 42 are to be identified. In real-time mode, the crawler 44 can determine the portal of a just-received request from the identity of a function or page from which it (the crawler 44) is invoked, from the identity of a server 12 upon which the crawler 44 is executing, or as otherwise within the ken of those skilled in the art in view of the teachings hereof. In batch mode, the portal associated with a possible future request can be passed as a parameter to the crawler 44, e.g., by the rules engine 22 or other functionality executing on server 12 that iterates through portal/device/user-role combinations for purposes of generating such instantiations in advance, or otherwise, as is within the ken of those skilled in the art in view of the teachings hereof.


In step 302, the crawler 44 discerns the user role (or “access group”) in connection with which the components of app 42 are to be identified. In real-time mode, the crawler 44 can determine the role/access group of a user from a cookie maintained on that user's device, from a parameter passed by a function or page from which the crawler 44 is invoked, or as otherwise within the ken of those skilled in the art in view of the teachings hereof. The crawler 44 can likewise determine the role/access group associated with at possible future request, i.e., in batch mode, from a parameter passed by the functionality that iterates through portal/device/user-role combinations, or otherwise, as is within the ken of those skilled in the art in view of the teachings hereof.


In step 304, the crawler 44 discerns the device in connection with which the components of app 42 are to be identified. In real-time mode, the crawler 44 can determine the role/access group of a user by querying the browser, webkit or other functionality executing on the user device 14-18 from which the download request was initiated, from a parameter passed by a function or page from which the crawler 44 is invoked, or as otherwise within the ken of those skilled in the art in view of the teachings hereof. The crawler 44 can likewise determine the device associated with at possible future request, i.e., in batch mode, from a parameter passed by the functionality that iterates through portal/device/user-role combinations, or otherwise, as is within the ken of those skilled in the art in view of the teachings hereof.


Although FIG. 3 illustrates determination by crawler 44 of each of the portal, user role and device for purposes of identifying components used in execution of an instantiation of app model 42, other embodiments may use only one or two of those determinants—e.g., user role and portal, by way of non-limiting example—and, hence, in the discussion that follows they are connected by the grammatical conjunction “and/or.”


In step 306, the crawler 44 recursively iterates, in both depth and breadth, through rules contained in app model 42 beginning at the execution entry point for the specified combination of portal, device and/or user role. In the illustrated embodiment, the crawler 44 iterates through the rules on a file-by-file basis, as reflected by the source code files depicted as elements 48 in the drawing. As used here, “entry point” (or “app root”) refers to the programming instruction and, more generally, the component at which execution of the instantiated app will begin, upon user request or otherwise, following download. The identification of that entry point, as typically, based on requirements associated with one or more of the designated portal, user role and/or device, is within the ken of those skilled in the art in view of the teachings hereof.


Such recursive iteration can be effected by executing the following steps, beginning at the entry point: (i) iterating (or stepping) through each instruction (or “rule,” as used herein synonymously therewith) of source code in a component and (ii) identifying each further component (if any) that instruction references which further component is available and suitable for execution in view of the designated combination of portal, user role and/or device—and, repeating those steps (i) and (ii), in turn (i.e., recursively), for each such referenced component. As each component available and suitable for execution in view of the designated combination of portal, user role and device is identified through this iterative recursion, the crawler 44 stores the component's name or other identification to report 46. Such instruction-by-instruction iteration can be effected through a line-by-line examination of the source code. Alternatively, it can be effected using information in a source code model that represents each source code file, e.g., with metadata that includes component dependencies (as defined by an administrator, software engineer, automated analysis or otherwise). A benefit of this latter approach is avoidance of line-by-line parsing of the source code concurrently with execution of optimization application 32.


In addition to identifying component dependencies during recursive iteration of the app model 42, the crawler 44 also identifies user interface features that depend on the examined source code files. For example, a source code file may be marked (in the aforesaid source code model) with metadata indicating that file is used for a button component that is formatted (i.e., displayed) as a text link. Another file may be marked by such metadata that indicates the same button component is formatted as an image. By storing those file-based UI feature dependencies, e.g., to report 46, the crawler 44 makes possible the building of bundles that avoid inclusion of unnecessary source code, as discussed further below.


In some embodiments, in step 306, the crawler 44 recursively iterates through all rules that are available and suitable for execution for the designated combination of portal, user role and/or device, as described above. In other embodiments, the crawler 44 skips (i.e., does not perform aforesaid steps (i) and (ii)) on components that are marked as “blacklisted”, e.g., as indicated by the black triangle superimposed over one of the files 48 in the drawing. A listing of files to be skipped in this regard can be reflected in a store (not shown) associated with the crawler 44, the engine 32, the server 12 or otherwise, as per convention in the art as adapted in accord with the teachings hereof. Such components can be identified in such a store by file name, line range, rule name or id, and/or via other convention within the ken of those skilled in the art as adapted in accord with the teachings hereof. As a consequence, components on which blacklisted ones depend (e.g., components that are themselves specified within a blacklisted component and that, therefore, are necessary for the blacklisted component to execute) will not be identified as necessary for execution—unless those depended-upon components are crawled during processing of other, non-blacklisted components of the app 42.


Conversely, in other embodiments, the crawler 44 can, in step 308, recursively iterate through all rules that make up components that are “whitelisted,” e.g., regardless of whether those components are available and suitable for execution in view of the designated combination of portal, user role and/or device. As above, such whitelisted components can be identified in such a store by file name, line range, rule name or id, and/or via other convention within the ken of those skilled in the art as adapted in accord with the teachings hereof.


Application crawler 44 stores to the usage report 46 a report of rules and, more generally, components used in execution of an instantiation of app model 42 for the specific combination of portal, device and/or user role. It can supplement that with dependencies and load-order pertaining to each component, as discussed above.


CSS Optimizer



FIGS. 4-5 depict operation of the CSS optimizer 56 according to one practice of the invention in regard to building optimization representations from the usage report 46. FIG. 4 depicts the first part of that process resulting in identification of CSS generation elements required for an instantiation of model app 42 for a specific combination of portal, device and/or user role. FIG. 5 depicts the second part of that process, resulting in a listing of a subset of CSS style feature-related files not necessary for that particular instantiation, which subset is defined with respect to the set of all CSS style feature-related files used by the app 42 independent of portal, device and user role.


In step 400, the optimizer 56 maps (i) cascading style sheets (CSS) for buttons, check boxes and other user interface widgets (collectively, referred to here as “generation elements” or “Gen El”) used in the model 42 as a whole to (ii) components identified as used in execution of an instantiation of the model 42 for a specific combination of portal, device and/or user role. The components are reflected in the crawler usage report 46, which is generated as discussed above in connection with FIGS. 2-3. The CSS for generation elements is reflected in a map 58, which is generated from an application rule 24 that describes the complete set of CSS Generated Elements and formats that may be used by an application model 42. In the illustrated embodiment, the mapping by the optimizer in step 400, that is, the mapping of CSS generation elements to components is 1 to m, where m is an integer greater than or equal to one.


The mapping of generation elements to components or other values, as reflected in step 400 and elsewhere herein, is within the ken of those skilled in the art in view of the teachings hereof. Such mappings can be reflected in tables, arrays, linked lists or otherwise, whether stored in binary, text or otherwise, as is within the ken of those skilled in the art in view of the teachings hereof.


In step 402, the optimizer 56 maps each CSS generation element used in the model 42 as a whole to a Boolean value (e.g., true or false) reflecting whether that element appears in the mapping generated in step 400. Put another way, the optimizer 56 in step 402 assigns each CSS Gen El used in model 42 as a whole a value of true or false, depending on whether that CSS Gen El is used in a component that appears in the usage report 46. In addition to assigning a value of false to each CSS Gen El not used in a component in that report 46, the optimizer assigns a value of false to each generation element that is blacklisted, e.g., as reflected in the store referred to above in connection with step 306 or otherwise. See step 404. By this mechanism, embodiments can prevent the download of CSS generation elements that have been deprecated.


Although Boolean values are mentioned above and elsewhere herein, it will be appreciated that other values may be used instead or in addition. Moreover, it will be appreciated that in lieu of mapping CSS Gen El to Boolean (or other) values, alternative techniques within the ken of those skilled in the art for reflecting the same information may be used instead or in addition.


In step 406, the optimizer 56 stores the resultant mapping of CSS generation elements—i.e., the mapping of CSS Gen El to true or false values reflecting whether (or not) those elements are used by components in the report 46 or, regardless, whether they have been deprecated or otherwise blacklisted—as a so-called component usage map 60. As noted above, this can be represented in tables, arrays, linked lists or otherwise; moreover, it can be stored internal to the optimizer 56, the engine 22, the server 12 or otherwise. In embodiments operating in real-time mode, it can be stored to the requesting client device 14-18, in addition or instead.


In step 408, the optimizer 56 maps each CSS generation element identified in step 400 as used by a component in the usage report to one or more formats available to that element. This allows the comparison of formats that are possibly used (i.e., as defined in the “Skin” rule mentioned above) with the formats that crawler had seen as being used, skipping the generation of CSS for any Formats that aren't used.


As used above and throughout, a “format” is a collection of CSS styles that are used together to provide a particular look (e.g., a “bold button” definition that calls for boldface text and a rounded rectangle outline with a 2 px border). In the illustrated embodiment, the mapping by the optimizer in step 408 of CSS to Gen El to formats is 1 to m, where m is an integer greater than or equal to one.


In step 410, the optimizer 56 supplements the mapping generated in step 408 to include synonyms of the formats generated by that prior step. Such synonyms can be obtained from definition files (not shown here), entered by an administrator or otherwise. Additional formats required for a given implementation, e.g., formats for standard fonts and colors used by a given enterprise, website or otherwise, can likewise be added in step 412.


In step 414, the optimizer 56 stores the resultant mapping of CSS generation elements—i.e., the mapping of CSS Gen El to formats, their synonyms and required formats—as a so-called format usage map 62. As noted above, this can be represented in tables, arrays, linked lists or otherwise; moreover, it can be stored internal to the optimizer 56, the engine 22, the server 12 or otherwise. In embodiments operating in real-time mode, it can be stored to the requesting client device 14-18, in addition or instead.



FIG. 5 depicts further operation of the CSS optimizer 56 according to one practice of the invention; here, in regard to generating a listing 64 of the subset of CSS style feature-related files not necessary for instantiation of the model app 42 for given combination of portal, device and/or user role.


The listing is generated from the crawler usage report 46 and the usage maps 60, 62. Significantly, it is also generated from a base listing 66 of the set of files containing CSS source code associated with model app 42 for all combinations of portal, device and user role. That base listing is referred to, here, as the pzBase. The listing 66 may be generated automatically, e.g., by a integrated development environment, or by an administrator or other person, and/or by a combination of the foregoing, and it may be a text file, binary or otherwise, all as is within the ken or those skilled in the art in view of the teachings hereof.


In step 500, the optimizer 56 stores to the file containing listing 64 (which file may be a text file, binary or otherwise, as is within the ken of those skilled in the art in view of the teachings hereof) the names or other identifiers of files listed in the pzBase file 66 which are blacklisted, e.g., as reflected in the store discussed above in connection with step 306.


In step 502, the optimizer 56 stores to the file containing listing 64 the names or other identifiers of files listed in the pzBase file 66 which contain CSS generation elements that are not necessary for instantiation of the model app 42 for a given combination of portal, device and/or user role, e.g., as evident from the report 46 and/or maps 60 and 62.


In step 504, the optimizer 56 stores to the file containing listing 64 the names or other identifiers of files listed in the pzBase file 66 which reflect formats that are not used for CSS generation elements for instantiation of the model app 42 for a given combination of portal, device and/or user role, e.g., as evident from the report 46 and/or maps 60 and 62.


In step 506, the optimizer 56 stores to the file containing listing 64 the names or other identifiers of files listed in the pzBase file 66 which are associated with user interface components that are not necessary for instantiation of the model app 42 for a given combination of portal, device and/or user role, e.g., as evident from the report 46 and/or maps 60 and 62.


In step 508, the optimizer 56 stores to the file containing listing 64 the names or other identifiers of files listed in the pzBase file 66 which contain CSS generation elements and user interface components that are not necessary for instantiation of the model app 42 for a given combination of portal, device and/or user role, e.g., as evident from the report 46 and/or maps 60 and 62.


In step 510, the optimizer 56 stores to the file containing listing 64 the names or other identifiers of files listed in the pzBase field 66 associated with user interface components for which formats are not necessary for instantiation of the model app 42 for a given combination of portal, device and/or user role, e.g., as evident from the report 46 and/or maps 60 and 62.


In step 510, the optimizer 56 stores to the file containing listing 64 the names or other identifiers of files listed in the pzBase file 66 associated with user interface components for which features are not necessary for instantiation of the model app 42 for a given combination of portal, device and/or user role, e.g., as evident from the report 46 and/or maps 60 and 62.


Steps 500-512 can be run in parallel, in serial and/or in any order or combination in order to generate the listing 64, which may be internal to the optimizer 56, the engine 22, the server 12 or otherwise. In embodiments operating in real-time mode, it can be stored to the requesting client device 14-18, in addition or instead.



FIG. 6 depicts generation of a style sheet bundle 600 (“CSS Bundle” or “static content”), i.e., a collection of style feature-related files, for instantiation of the model app 42 for given specific combination of portal, device and/or user role. In the illustrated embodiment, this is done in three phases: a first phase 602 that includes selected files from the pzBase listing in file 66; a second phase 604 that includes selected CSS generation elements; and a third phase 606 that includes additional files selected from the pzBase listing 66. Other embodiments may utilize a greater or lesser number of phases.


In phase 602, the optimizer 56 prepares for download to the requesting device as part of the CSS Bundle 600 the set of files in base listing 66 (FIG. 4) that are not in the listing 64 of the subset of files not necessary for instantiation of the model app 42 for a specific portal, device and/or user role combination. In some embodiments, the set can be the entirety of the files in base listing 66; however, in the illustrated embodiment, it is just those files that are designated for initial download. Typically, these are file associated with style sheets corresponding to JavaScript that will be loaded as soon as a page (or other screen) of the instantiation of app 42 begins execution on the requesting client device.


In phase 604, the optimizer 56 iterates over CSS generation elements contained in store 58 (FIG. 4), skipping over any listed in listing 64 and/or marked in format usage map 62 as unused for the specific portal, device, and/or user role combination. For each used (i.e., not skipped) generation element, the optimizer 56 iterates over each format potentially used by that element (e.g., as reflected in store 58 or otherwise) skipping over any formats listed in listing 64 and/or marked in component usage map 60 as unused for the specific portal, device, and/or user role combination. For each used (i.e., not skipped) format, the optimizer generates a cascading style sheet (or entry) for that format and prepares it for download as part of the CSS Bundle 600.


In phase 606, the optimizer 56 prepares for download to the requesting device as part of the CSS Bundle 600 remaining files in the set of in base listing 66 (FIG. 4) that are not in the listing 64 of the subset of files not necessary for instantiation of the model app 42 for a specific portal, device and/or user role combination. In the set comprises those in listing 66 that are designated for final download. Typically, these are file associated with style sheets loaded at the ends of a page (or other screen) of the instantiation of app 42 after it begins execution on the target client device.


In embodiments operating in real-time mode, the bundle 600 can be downloaded to a target client device 14-18 at the time of its request and in connection with the download of JavaScript files to those devices. In embodiments operating in batch mode, the CSS bundle can be generated for download at a later time, or its generation and download can be deferred until corresponding requests are received, or otherwise, all as is within the ken of those skilled in the art in view of the teachings hereof.



FIG. 7 depicts generation of JavaScript source code files for download and execution in connection with a specific combination of portal, device and/or user role as discussed above in connection with steps 206-210; here, shown as steps 700-710.


As shown in the drawing, the crawler usage report 46 provides an input to the illustrated processing sequence. That report 46 contains, as evident in the discussion above, a list of components used/unused in an instantiation of model 42 for download to the specific portal, device and/or user role. In addition, for each component that is marked as used, the report 46 includes a listing of features of that component, with each of them marked as used/unused, as well.


For each component in the report 46 marked as used by the specific portal/device/user-role combination, the JS optimizer 48 performs the recursive step(s) below and illustrated in the drawing:

    • Step 700: Create a “stack” of JS file dependencies for the component and store it for further processing. For each JS file in that stack, the JS optimizer 48 performs the step(s) of:
      • Step 702: Create a “stack” of JS file dependencies for the component and store it for further processing. For each JS file in that stack, the JS optimizer 48 performs the step(s) of:
        • Create a “stack” of JS file dependencies for the component and store it for further processing.
          • Etc.


The depth-and-breadth recursive descent stops when one of the recursive processing steps 700, 702, etc.:

    • (a) results in an empty dependency list (leaf node),
    • (b) results in a “cycle,” that is, uncovers a dependency already represented in an existing stack.


Stacks built as a result of recursive processing steps 700, 702, etc., can be illustrated by the following example, which assumes that the report contains records identifying user interface components U1 through U3 and JavaScript components A through I as used for a specific portal/device/user-role combination, with the following dependencies (where “→” means “depends on”), including a circular dependency, reflected above, to wit, A→B→C→A . . . (etc.):


User Interface (U)I Components:

    • U1→A
    • U2→D
    • U3→A and G


JavaScript Files:

    • A→B
    • B→C
    • D→E
    • E→F
    • G→H and I
    • C→A (circular)


As a result of the processing in steps 700, 702, etc., a stack is built for each JavaScript component or JS file encountered in the report 46. Specifically, when a component or JS file is encountered, a dependency stack is created for that component file (if one doesn't exist). Then, its dependencies are opened in the order they appear (which can cause creation of that component/file dependency stack, etc.). Then, as the recursion is “unwound”, the “child” dependencies are read and pushed onto the “dependent's” stack.


In the illustrated embodiment, UI components themselves are not placed in a stack; only the JS components they are dependent upon are. Moreover, UI components do not depend upon other UI components; they are only dependent on JS components. However, in the illustrated embodiment JS components can be dependent upon other JS components and therefore can create circular references, e.g., as illustrated below.


For the specific example above, the annotations below show the order of the stacks being created, added to, etc. Further explanation is provided parenthetically.


U1 triggers a stack for A and subsequently B and C, as follows:

    • Stack for A: B, (get stack B→C, A) stop at repeat, result: B, C
    • Stack for B: C, (get stack C→A, B) stop at repeat, result: C, A
    • Stack for C: A, (get stack A, stack A is in progress, so retrieve what it has, namely B), result: A, B


U2 triggers a stack for D and subsequently E, as follows:

    • Stack for D: E (get stack E→F), result: E, F
    • Stack for E: F (leaf)


U3 triggers for stack A (already done previously) and a stack G, as follows:

    • Stack for A: B, C
    • Stack for G: H (leaf), I (leaf)


As a result of the foregoing, the following stacks are built:

    • Stack for U1: A, (get stack A→B, C), result: A, B, C
    • Stack for U2: D, (get stack D→E, F), result: D, E, F
    • Stack for U3 A (get stack A→B, C), G (get stack G→H, I), result: A, B, C, G, H, I


Combining U1, U2 and U3 dependency stacks produces the following:

    • U1: A, B, C
    • Add U2: A, B, C, D, E, F
    • Add U3: custom character D, E, F, A, B, C, G, H, I


The final contents of the new (combined) stack can be read as file needing to be loaded in reverse order. In the example, this means load I, then load H, then G, etc. This also means C will be loaded before B which will be loaded before A, as the dependency indicates. These data representations also allow the optimizer 48 to note that a cyclic dependency remains (A needs to be loaded before C and C needs to be loaded before B which loads before A) indicating work that needs to be resolved in the code, e.g., by generating a warning message to an administrator or other. As a consequence, the optimizer 48 is able to generate a single dependency stack (reverse order—which is the desired load order). In this example, that would be

    • I, H, G, C, B, A, F, E, D


In step 710, the JavaScript optimizer 48 prepares for transfer to and loading on a requesting client device 14-18 the source code files identified in the dependency-ordered stack generated in step 708. The optimizer 48 prepares for such transfer in an order that is based on the dependency order specified in that stack. In embodiments, in which the steps 700-710 are executed in real-time mode, the optimizer 48 can, alone or in cooperation with other elements of server 12, proceed with transfer of those files in that order, via HTML stream or otherwise, as is within the ken of those skilled in the art in view of the teachings hereof. Where, on the other hand, steps 700-710 are executed in batch mode the optimizer can delay such transfer until such a corresponding request is received. In either case, the transfer of files can be effected in a conventional manner known in the art, e.g., via a compiler (e.g., GCC) or otherwise.


CONCLUSION

Described herein are systems and methods meeting the objects set forth above among others. It will be appreciated that the illustrated embodiments are merely examples of the invention and that other embodiments varying therefrom fall within the scope of the invention. Thus, for example, although in the illustrated embodiments, the illustrative app 42 comprises rules from rules base 24, in other embodiments it may comprise software of other varieties from other repositories. This is likewise true of optimization application 32. And, while the illustrated embodiment is designed to process JavaScript file source code, other embodiments may process source code in other languages. Other aspects of the invention provide methods, e.g., as described above, for identifying for download to a requesting client device a set of user interface components, features of those components, and formats of those components or features, used in execution of an app on a client digital data devices by users having a plurality different respective roles and/or portals from which they request transfer of the app for loading and execution.

Claims
  • 1. A method of optimizing an app for any of download to and execution on a client digital data device, comprising (A) identifying a plurality of components used in execution of the app on the client digital data device by a user of that device having at least one of a designated role and a designated portal via which the client digital data device requests transfer of the app, where said components comprise any of source code files or portions thereof, including user interface components, and where said role is an access group,(B) for each component identified in Step (A): identifying source code files on which execution of that component in connection with execution of the app by the user depends, and generating for that component a dependency-ordered stack of the source code files so identified,(C) combining the dependency-ordered stacks generated in step (B) into a single dependency-ordered stack,(D) transferring to the client digital data device for loading and execution thereon the source code files identified in the single dependency-ordered stack, where the source code files are transferred based on a dependency order specified in the single dependency-ordered stack.
  • 2. The method of claim 1, wherein step (B) comprises recursively iterating, in both depth and breadth, through the components identified in step (A) and, in turn, through the components on which they depend, creating a dependency stack for each component encountered during such recursive iteration if none exists.
  • 3. The method of claim 1, wherein step (C) comprises using a bubble sort to combine the dependency-ordered stacks generated in step (B) into a single dependency-ordered stack.
  • 4. The method of claim 2, wherein step (C) comprises iteratively appending one of the dependency-ordered stacks generated in step (B) to an intermediate stack and deleting prior entries in that intermediate stack.
  • 5. The method of claim 1, wherein step (D) comprises transferring the source code files to the client digital data device in multiple bundles, where the source code files transferred in each bundle is based on the dependency order specified in the single dependency-ordered stack.
  • 6. The method of claim 3, wherein the multiple bundle includes at least two of (i) a top bundle comprising source code loaded as soon as page is visible upon execution of the app on the client digital data device by the user,(ii) a template bundle comprising source code loaded before control rendering begins upon execution of the app on the client digital data device by the user, and(iii) a bottom bundle comprising source code loaded at an end of an initial page load upon execution of the app on the client digital data device by the user.
  • 7. The method of claim 1, wherein step (A) comprises crawling the app source code starting at an entry point and recursively descending in both depth and breadth to identify the components used in execution of an app on the client digital data device by the user.
  • 8. The method of claim 7, wherein step (A) includes (i) crawling designated components even if they will not be used in execution of the app on the client digital data device by the user, and(ii) not crawling designated components even if they will be used in execution of the app on the client digital data device by the user.
  • 9. A method of optimizing an app for any of download to and execution on a client digital data device, comprising (A) identifying, in style sheets, a set of (i) user interface components,(ii) features of those user interface components, and(iii) formats of those user interface components or features, used in execution of the app on client digital data devices by users having a plurality of different respective roles and/or portals from which they request transfer of the app for loading and execution,(B) identifying a subset of said user interface components, features and formats that are not used in execution of the app on the client digital data device by a user having at least one of a designated role and a designated portal from which the client digital data device requests transfer of the app for loading and execution,(C) transferring to the client digital data device for loading and execution thereon those style sheets files that define the set but that are not in the subset.
  • 10. The method of claim 9, comprising generating and transferring to the client digital data device for loading and execution thereon those source code files that define the set but that are not in the subset, while foregoing at least one of generating and transferring those source code files that define the subset.
  • 11. The method of claim 10, wherein source code files defining formats of the user interface components comprise cascading style sheets (CSS).
  • 12. A method of optimizing an app for execution on client digital data devices, comprising (A) identifying, in source code files, a set of (i) user interface components,(ii) features of those user interface components, and(iii) formats of those user interface components or features, used in execution of the app on the client digital data devices by users having a plurality of different respective roles and/or portals from which they request transfer of the app for loading and execution,(B) identifying a first subset of said user interface components, features and formats that are not used in execution of the app on a client digital data device by a user having at least one of a first designated role and a first designated portal from which a first client digital data device requests transfer of the app for loading and execution,(C) identifying a second subset of said user interface components, features and formats that are not used in execution of the app on the client digital data device by the user having at least one of a second designated role and a second designated portal from which a second client digital data device requests transfer of the app for loading and execution,(D) transferring to the first client digital data device for loading and execution thereon source code files that define the set but that are not in the first subset of said user interface components, features and formats, and(E) transferring to the second client digital data device for loading and execution thereon those source code files that define the set but that are not in the second subset of said user interface components, features and formats.
  • 13. The method of claim 12, comprising generating and transferring to the first client digital data device for loading and execution thereon those source code files that define the set but that are not in the first subset, while foregoing at least one of generating and transferring to the first client digital data device for loading and execution thereon those source code files that define the first subset, andgenerating and transferring to the second client digital data device for loading and execution thereon those source code files that define the set but that are not in the second subset, while foregoing at least one of generating and transferring to the second client digital data device for loading and execution thereon those source code files that define the second subset.
  • 14. The method of claim 10, wherein source code files defining formats of the user interface components comprise cascading style sheets (CSS).
  • 15. A method of optimizing an app for any of download to and execution on a client digital data device, comprising (A) identifying a plurality of components used in execution of the app on the client digital data device by a user of that device having at least one of a designated role and a designated portal from which the client digital data device requests transfer of the app for loading and execution, where the components comprise source code files or portions thereof, including user interface components,(B) for each component identified in Step (A), identifying source code files on which execution of that component in connection with execution of the app by the user depends, and generating for that component a dependency-ordered stack of the source code files so identified,(C) combining the dependency-ordered stacks generated in step (B) into a single dependency-ordered stack,(D) identifying a set of said user interface components, features of those user interface components, and formats of those user interface components or features used in execution of the app on client digital data devices by users having a plurality different respective roles and portals from which the respective client digital data devices request transfer of the app for loading and execution,(E) identifying a subset of said user interface components, features and formats not used in execution of the app on the client digital data device by the user having at least one of a designated role and a designated portal from which the client digital data device requests transfer of the app for loading and execution,(F) transferring to the client digital data device for loading and execution thereon those source code files that define the set but that are not in the subset.
Parent Case Info

This application claims the benefit of priority of U.S. Patent Application Ser. No. 62/718,809, filed Aug. 14, 2018, entitled Software Code Optimizer, the teachings of which are incorporated by reference herein.

US Referenced Citations (700)
Number Name Date Kind
4047059 Rosenthal Sep 1977 A
4344142 Diehr, II et al. Aug 1982 A
4602168 Single Jul 1986 A
4607232 Gill, Jr. Aug 1986 A
4659944 Miller, Sr. et al. Apr 1987 A
4701130 Whitney et al. Oct 1987 A
4866634 Reboh et al. Sep 1989 A
4884217 Skeirik et al. Nov 1989 A
4895518 Arnold et al. Jan 1990 A
4930071 Tou et al. May 1990 A
4953106 Gansner et al. Aug 1990 A
5062060 Kolnick Oct 1991 A
5077491 Heck et al. Dec 1991 A
5093794 Howie et al. Mar 1992 A
5119465 Jack et al. Jun 1992 A
5129043 Yue Jul 1992 A
5136184 Deevy Aug 1992 A
5136523 Landers Aug 1992 A
5140671 Hayes et al. Aug 1992 A
5193056 Boes Mar 1993 A
5199068 Cox Mar 1993 A
5204939 Yamazaki et al. Apr 1993 A
5228116 Harris et al. Jul 1993 A
5259766 Sack et al. Nov 1993 A
5262941 Saladin et al. Nov 1993 A
5267175 Hooper Nov 1993 A
5267865 Lee et al. Dec 1993 A
5270920 Pearse et al. Dec 1993 A
5276359 Chiang Jan 1994 A
5276885 Milnes et al. Jan 1994 A
5291394 Chapman Mar 1994 A
5291583 Bapat Mar 1994 A
5295256 Bapat Mar 1994 A
5297279 Bannon et al. Mar 1994 A
5301270 Steinberg et al. Apr 1994 A
5310349 Daniels et al. May 1994 A
5311422 Loftin et al. May 1994 A
5326270 Ostby et al. Jul 1994 A
5333254 Robertson Jul 1994 A
5337407 Bates et al. Aug 1994 A
5339390 Robertson et al. Aug 1994 A
5374932 Wyschogrod et al. Dec 1994 A
5379366 Noyes Jan 1995 A
5379387 Carlstedt Jan 1995 A
5381332 Wood Jan 1995 A
5386559 Eisenberg et al. Jan 1995 A
5395243 Lubin et al. Mar 1995 A
5412756 Bauman et al. May 1995 A
5421011 Camillone et al. May 1995 A
5421730 Lasker, III et al. Jun 1995 A
5446397 Yotsuyanagi Aug 1995 A
5446885 Moore et al. Aug 1995 A
5450480 Man et al. Sep 1995 A
5463682 Fisher et al. Oct 1995 A
5473732 Chang Dec 1995 A
5477170 Yotsuyanagi Dec 1995 A
5481647 Brody et al. Jan 1996 A
5499293 Behram et al. Mar 1996 A
5504879 Eisenberg et al. Apr 1996 A
5512849 Wong Apr 1996 A
5519618 Kastner et al. May 1996 A
5537590 Amado Jul 1996 A
5542024 Balint et al. Jul 1996 A
5542078 Martel et al. Jul 1996 A
5548506 Srinivasan Aug 1996 A
5561740 Barrett et al. Oct 1996 A
5579223 Raman Nov 1996 A
5579486 Oprescu et al. Nov 1996 A
5586311 Davies et al. Dec 1996 A
5596752 Knudsen et al. Jan 1997 A
5597312 Bloom et al. Jan 1997 A
5608789 Fisher et al. Mar 1997 A
5611076 Durflinger et al. Mar 1997 A
5627979 Chang et al. May 1997 A
5630127 Moore et al. May 1997 A
5649192 Stucky Jul 1997 A
5655118 Heindel et al. Aug 1997 A
5664206 Murow et al. Sep 1997 A
5675753 Hansen et al. Oct 1997 A
5678039 Hinks et al. Oct 1997 A
5689663 Williams Nov 1997 A
5715450 Ambrose et al. Feb 1998 A
5732192 Malin et al. Mar 1998 A
5754740 Fukuoka et al. May 1998 A
5761063 Jannette et al. Jun 1998 A
5761673 Bookman et al. Jun 1998 A
5765140 Knudson et al. Jun 1998 A
5768480 Crawford, Jr. et al. Jun 1998 A
5788504 Rice et al. Aug 1998 A
5795155 Morrel-Samuels Aug 1998 A
5809212 Shasha Sep 1998 A
5815415 Bentley et al. Sep 1998 A
5819243 Rich et al. Oct 1998 A
5819257 Monge et al. Oct 1998 A
5822780 Schutzman Oct 1998 A
5825260 Ludwig et al. Oct 1998 A
5826077 Blakeley et al. Oct 1998 A
5826239 Du et al. Oct 1998 A
5826250 Trefler Oct 1998 A
5826252 Wolters, Jr. et al. Oct 1998 A
5829983 Koyama et al. Nov 1998 A
5831607 Brooks Nov 1998 A
5832483 Barker Nov 1998 A
5841435 Dauerer et al. Nov 1998 A
5841673 Kobayashi et al. Nov 1998 A
5864865 Lakis Jan 1999 A
5873096 Lim et al. Feb 1999 A
5875334 Chow et al. Feb 1999 A
5875441 Nakatsuyama Feb 1999 A
5880614 Zinke et al. Mar 1999 A
5880742 Rao et al. Mar 1999 A
5886546 Hwang Mar 1999 A
5890146 Wavish et al. Mar 1999 A
5890166 Eisenberg et al. Mar 1999 A
5892512 Donnelly et al. Apr 1999 A
5907490 Oliver May 1999 A
5907837 Ferrel et al. May 1999 A
5909213 Martin Jun 1999 A
5910748 Reffay et al. Jun 1999 A
5911138 Li et al. Jun 1999 A
5918222 Fukui et al. Jun 1999 A
5920717 Noda Jul 1999 A
5930795 Chen et al. Jul 1999 A
5945852 Kosiec Aug 1999 A
5974441 Rogers et al. Oct 1999 A
5974443 Jeske Oct 1999 A
5978566 Plank et al. Nov 1999 A
5983267 Shklar et al. Nov 1999 A
5983369 Bakoglu et al. Nov 1999 A
5987415 Breese et al. Nov 1999 A
5990742 Suzuki Nov 1999 A
5995948 Whitford et al. Nov 1999 A
5995958 Xu Nov 1999 A
6008673 Glass et al. Dec 1999 A
6008808 Almeida et al. Dec 1999 A
6012098 Bayeh et al. Jan 2000 A
6020768 Lim Feb 2000 A
6023704 Gerard et al. Feb 2000 A
6023714 Hill et al. Feb 2000 A
6023717 Argyroudis Feb 2000 A
6028457 Tihanyi Feb 2000 A
6037890 Glass et al. Mar 2000 A
6044373 Gladney et al. Mar 2000 A
6044466 Anand et al. Mar 2000 A
6078982 Du et al. Jun 2000 A
6085188 Bachmann et al. Jul 2000 A
6085198 Skinner et al. Jul 2000 A
6091226 Amano Jul 2000 A
6092036 Hamann Jul 2000 A
6092083 Brodersen et al. Jul 2000 A
6094652 Faisal Jul 2000 A
6098172 Coss et al. Aug 2000 A
6105035 Monge et al. Aug 2000 A
6108004 Medl Aug 2000 A
6122632 Botts et al. Sep 2000 A
6125363 Buzzeo et al. Sep 2000 A
6130679 Chen et al. Oct 2000 A
6137797 Bass et al. Oct 2000 A
6144997 Lamming et al. Nov 2000 A
6151595 Pirolli et al. Nov 2000 A
6151624 Teare et al. Nov 2000 A
6154738 Call Nov 2000 A
6167441 Himmel Dec 2000 A
6177932 Galdes et al. Jan 2001 B1
6185516 Hardin et al. Feb 2001 B1
6185534 Breese et al. Feb 2001 B1
6192371 Schultz Feb 2001 B1
6194919 Park Feb 2001 B1
6212502 Ball et al. Apr 2001 B1
6216135 Brodersen et al. Apr 2001 B1
6233332 Anderson et al. May 2001 B1
6233617 Rothwein et al. May 2001 B1
6240417 Eastwick et al. May 2001 B1
6243713 Nelson et al. Jun 2001 B1
6246320 Monroe Jun 2001 B1
6275073 Tokuhiro Aug 2001 B1
6275790 Yamamoto et al. Aug 2001 B1
6281896 Alimpich et al. Aug 2001 B1
6282547 Hirsch Aug 2001 B1
6300947 Kanevsky Oct 2001 B1
6304259 DeStefano Oct 2001 B1
6308163 Du et al. Oct 2001 B1
6310951 Wineberg et al. Oct 2001 B1
6311324 Smith et al. Oct 2001 B1
6313834 Lau et al. Nov 2001 B1
6314415 Mukherjee Nov 2001 B1
6321273 Schofield Nov 2001 B1
6324693 Brodersen et al. Nov 2001 B1
6330554 Altschuler et al. Dec 2001 B1
6338074 Poindexter et al. Jan 2002 B1
6341277 Coden et al. Jan 2002 B1
6341293 Hennessey Jan 2002 B1
6344862 Williams et al. Feb 2002 B1
6349238 Gabbita et al. Feb 2002 B1
6351734 Lautzenheiser et al. Feb 2002 B1
6356286 Lawrence Mar 2002 B1
6356897 Gusack Mar 2002 B1
6359633 Balasubramaniam et al. Mar 2002 B1
6366299 Lanning et al. Apr 2002 B1
6369819 Pitkow et al. Apr 2002 B1
6370537 Gilbert et al. Apr 2002 B1
6380910 Moustakas et al. Apr 2002 B1
6380947 Stead Apr 2002 B1
6381738 Choi et al. Apr 2002 B1
6389460 Stewart et al. May 2002 B1
6389510 Chen et al. May 2002 B1
6393605 Loomans May 2002 B1
6396885 Ding et al. May 2002 B1
6405211 Sokol et al. Jun 2002 B1
6405251 Bullard et al. Jun 2002 B1
6415259 Wolfinger et al. Jul 2002 B1
6415283 Conklin Jul 2002 B1
6418448 Sarkar Jul 2002 B1
6421571 Spriggs et al. Jul 2002 B1
6426723 Smith et al. Jul 2002 B1
6429870 Chen et al. Aug 2002 B1
6430571 Doan et al. Aug 2002 B1
6430574 Stead Aug 2002 B1
6437799 Shinomi Aug 2002 B1
6446065 Nishioka et al. Sep 2002 B1
6446089 Brodersen et al. Sep 2002 B1
6446200 Ball et al. Sep 2002 B1
6446256 Hyman et al. Sep 2002 B1
6448964 Isaacs et al. Sep 2002 B1
6453038 McFarlane et al. Sep 2002 B1
6463346 Flockhart et al. Oct 2002 B1
6463440 Hind et al. Oct 2002 B1
6469715 Carter et al. Oct 2002 B1
6469716 Carter et al. Oct 2002 B1
6473467 Wallace et al. Oct 2002 B1
6473748 Archer Oct 2002 B1
6493331 Walton et al. Dec 2002 B1
6493399 Xia et al. Dec 2002 B1
6493731 Jones et al. Dec 2002 B1
6493754 Rosborough et al. Dec 2002 B1
6496812 Campaigne et al. Dec 2002 B1
6496833 Goldberg et al. Dec 2002 B1
6502239 Zgarba et al. Dec 2002 B2
6509898 Chi et al. Jan 2003 B2
6513018 Culhane Jan 2003 B1
6526440 Bharat Feb 2003 B1
6526457 Birze Feb 2003 B1
6529217 Maguire, III et al. Mar 2003 B1
6529899 Kraft et al. Mar 2003 B1
6529900 Patterson et al. Mar 2003 B1
6530079 Choi et al. Mar 2003 B1
6532474 Iwamoto et al. Mar 2003 B2
6539374 Jung Mar 2003 B2
6542912 Meltzer et al. Apr 2003 B2
6546381 Subramanian et al. Apr 2003 B1
6546406 DeRose et al. Apr 2003 B1
6549904 Ortega et al. Apr 2003 B1
6556226 Gould et al. Apr 2003 B2
6556983 Altschuler et al. Apr 2003 B1
6556985 Karch Apr 2003 B1
6559864 Olin May 2003 B1
6560592 Reid et al. May 2003 B1
6560649 Mullen et al. May 2003 B1
6567419 Yarlagadda May 2003 B1
6571222 Matsumoto et al. May 2003 B1
6577769 Kenyon et al. Jun 2003 B1
6583800 Ridgley et al. Jun 2003 B1
6584464 Warthen Jun 2003 B1
6584569 Reshef et al. Jun 2003 B2
6594662 Sieffert et al. Jul 2003 B1
6597381 Eskridge et al. Jul 2003 B1
6597775 Lawyer et al. Jul 2003 B2
6598043 Baclawski Jul 2003 B1
6606613 Altschuler et al. Aug 2003 B1
6625657 Bullard Sep 2003 B1
6629138 Lambert et al. Sep 2003 B1
6636850 Lepien Oct 2003 B2
6636901 Sudhakaran et al. Oct 2003 B2
6643638 Xu Nov 2003 B1
6643652 Helgeson et al. Nov 2003 B2
6661889 Flockhart et al. Dec 2003 B1
6661908 Suchard et al. Dec 2003 B1
6678679 Bradford Jan 2004 B1
6678773 Marietta et al. Jan 2004 B2
6678882 Hurley et al. Jan 2004 B1
6684261 Orton et al. Jan 2004 B1
6690788 Bauer et al. Feb 2004 B1
6691067 Ding et al. Feb 2004 B1
6691230 Bardon Feb 2004 B1
6701314 Conover et al. Mar 2004 B1
6711565 Subramaniam et al. Mar 2004 B1
6721747 Lipkin Apr 2004 B2
6728702 Subramaniam et al. Apr 2004 B1
6728852 Stoutamire Apr 2004 B1
6732095 Warshavsky et al. May 2004 B1
6732111 Brodersen et al. May 2004 B2
6748422 Morin et al. Jun 2004 B2
6750858 Rosenstein Jun 2004 B1
6751663 Farrell et al. Jun 2004 B1
6754475 Harrison et al. Jun 2004 B1
6756994 Tlaskal Jun 2004 B1
6763351 Subramaniam et al. Jul 2004 B1
6771706 Ling et al. Aug 2004 B2
6772148 Baclawski Aug 2004 B2
6772350 Belani et al. Aug 2004 B1
6778971 Altschuler et al. Aug 2004 B1
6782091 Dunning, III Aug 2004 B1
6785341 Walton et al. Aug 2004 B2
6788114 Krenzke et al. Sep 2004 B1
6792420 Stephen Chen et al. Sep 2004 B2
RE38633 Srinivasan Oct 2004 E
6804330 Jones et al. Oct 2004 B1
6807632 Carpentier et al. Oct 2004 B1
6810429 Walsh et al. Oct 2004 B1
6820082 Cook et al. Nov 2004 B1
6829655 Huang et al. Dec 2004 B1
6831668 Cras et al. Dec 2004 B2
6836275 Arquie et al. Dec 2004 B1
6839682 Blume et al. Jan 2005 B1
6847982 Parker et al. Jan 2005 B2
6851089 Erickson et al. Feb 2005 B1
6856575 Jones Feb 2005 B2
6856992 Britton et al. Feb 2005 B2
6859787 Fisher et al. Feb 2005 B2
6865546 Song Mar 2005 B1
6865566 Serrano-Morales et al. Mar 2005 B2
6865575 Smith et al. Mar 2005 B1
6867789 Allen et al. Mar 2005 B1
6918222 Lat et al. Jul 2005 B2
6920615 Campbell et al. Jul 2005 B1
6925457 Britton et al. Aug 2005 B2
6925609 Lucke Aug 2005 B1
6927728 Vook et al. Aug 2005 B2
6934702 Faybishenko et al. Aug 2005 B2
6940917 Menon et al. Sep 2005 B2
6944644 Gideon Sep 2005 B2
6954737 Kalantar et al. Oct 2005 B2
6956845 Baker et al. Oct 2005 B2
6959432 Crocker Oct 2005 B2
6961725 Yuan et al. Nov 2005 B2
6965889 Serrano-Morales et al. Nov 2005 B2
6966033 Gasser et al. Nov 2005 B1
6976144 Trefler et al. Dec 2005 B1
6978719 Sebata et al. Dec 2005 B2
6985912 Mullins et al. Jan 2006 B2
6991153 Silverbrook et al. Jan 2006 B2
7020869 Abrari et al. Mar 2006 B2
7020882 Lewallen Mar 2006 B1
7028225 Maso et al. Apr 2006 B2
7031901 Abu El Ata Apr 2006 B2
7035808 Ford Apr 2006 B1
7058367 Luo et al. Jun 2006 B1
7058637 Britton et al. Jun 2006 B2
7064766 Beda et al. Jun 2006 B2
7073177 Foote et al. Jul 2006 B2
7076558 Dunn Jul 2006 B1
7089193 Newbold Aug 2006 B2
7103173 Rodenbusch et al. Sep 2006 B2
7124145 Surasinghe Oct 2006 B2
7139999 Bowman-Amuah Nov 2006 B2
7143116 Okitsu et al. Nov 2006 B2
7171145 Takeuchi et al. Jan 2007 B2
7171415 Kan et al. Jan 2007 B2
7174514 Subramaniam et al. Feb 2007 B2
7178109 Hewson et al. Feb 2007 B2
7194380 Barrow et al. Mar 2007 B2
7194690 Guillermo et al. Mar 2007 B2
7289793 Norwood et al. Oct 2007 B2
RE39918 Slemmer Nov 2007 E
7302417 Iyer Nov 2007 B2
7318020 Kim Jan 2008 B1
7318066 Kaufman et al. Jan 2008 B2
7334039 Majkut et al. Feb 2008 B1
7343295 Pomerance Mar 2008 B2
7353229 Vilcauskas, Jr. et al. Apr 2008 B2
7353254 Kusuda Apr 2008 B2
7398391 Carpentier et al. Jul 2008 B2
7406475 Dorne et al. Jul 2008 B2
7412388 Dalal et al. Aug 2008 B2
7415731 Carpentier et al. Aug 2008 B2
7505827 Boddy et al. Mar 2009 B1
7526481 Cusson et al. Apr 2009 B1
7536294 Stanz et al. May 2009 B1
7555645 Vissapragada Jun 2009 B2
7574494 Mayemick et al. Aug 2009 B1
7596504 Hughes et al. Sep 2009 B2
7603625 Guillermo et al. Oct 2009 B2
7640222 Trefler Dec 2009 B2
7647417 Taneja Jan 2010 B1
7665063 Trefler et al. Feb 2010 B1
7685013 Gendler Mar 2010 B2
7689447 Aboujaoude et al. Mar 2010 B1
7711919 Trefler et al. May 2010 B2
7779395 Chotin et al. Aug 2010 B1
7783596 Smolen et al. Aug 2010 B2
7787609 Flockhart et al. Aug 2010 B1
7791559 Piasecki Sep 2010 B2
7818506 Shepstone et al. Oct 2010 B1
7844594 Holt et al. Nov 2010 B1
7870244 Chong et al. Jan 2011 B2
7889896 Roehrig et al. Feb 2011 B2
7937690 Casey May 2011 B2
7971180 Kreamer et al. Jun 2011 B2
7974714 Hoffberg Jul 2011 B2
7983895 McEntee et al. Jul 2011 B2
8001519 Conallen et al. Aug 2011 B2
8037329 Leech et al. Oct 2011 B2
8073802 Trefler Dec 2011 B2
8250525 Khatutsky Aug 2012 B2
8335704 Trefler et al. Dec 2012 B2
8386960 Eismann et al. Feb 2013 B1
8468492 Frenkel Jun 2013 B1
8479157 Trefler et al. Jul 2013 B2
8516193 Clinton et al. Aug 2013 B1
8739044 Varadarajan May 2014 B1
8744999 Clarke et al. Jun 2014 B2
8843435 Trefler et al. Sep 2014 B1
8850362 Khoshnevisan et al. Sep 2014 B1
8863008 Chan et al. Oct 2014 B2
8880487 Clinton et al. Nov 2014 B1
8903933 Bellini, III et al. Dec 2014 B1
8924335 Trefler et al. Dec 2014 B1
8959480 Trefler et al. Feb 2015 B2
9026733 Clinton et al. May 2015 B1
9189361 Khatutsky Nov 2015 B2
9195936 Chase Nov 2015 B1
9253129 Bassemir et al. Feb 2016 B2
9270743 Frenkel Feb 2016 B2
9495340 Powell et al. Nov 2016 B2
9658735 Trefler et al. May 2017 B2
9678719 Frenkel Jun 2017 B1
20010013799 Wang Aug 2001 A1
20010035777 Wang et al. Nov 2001 A1
20010047355 Anwar Nov 2001 A1
20010049682 Vincent et al. Dec 2001 A1
20010052108 Bowman-Amuah Dec 2001 A1
20010054064 Kannan Dec 2001 A1
20020010855 Reshef et al. Jan 2002 A1
20020013804 Gideon Jan 2002 A1
20020029161 Brodersen et al. Mar 2002 A1
20020042831 Capone et al. Apr 2002 A1
20020049603 Mehra et al. Apr 2002 A1
20020049715 Serrano-Morales et al. Apr 2002 A1
20020049788 Lipkin et al. Apr 2002 A1
20020054152 Palaniappan et al. May 2002 A1
20020059566 Delcambre et al. May 2002 A1
20020065912 Catchpole et al. May 2002 A1
20020070972 Windl et al. Jun 2002 A1
20020073337 Ioele et al. Jun 2002 A1
20020083063 Egolf Jun 2002 A1
20020091677 Sridhar Jul 2002 A1
20020091678 Miller et al. Jul 2002 A1
20020091710 Dunham et al. Jul 2002 A1
20020091835 Lentini et al. Jul 2002 A1
20020093537 Bocioned et al. Jul 2002 A1
20020107684 Gao Aug 2002 A1
20020118688 Jagannathan Aug 2002 A1
20020120598 Shadmon et al. Aug 2002 A1
20020120627 Mankoff Aug 2002 A1
20020120762 Cheng et al. Aug 2002 A1
20020133502 Rosenthal et al. Sep 2002 A1
20020177232 Melker et al. Nov 2002 A1
20020178232 Ferguson Nov 2002 A1
20020181692 Flockhart et al. Dec 2002 A1
20020184610 Chong et al. Dec 2002 A1
20020186826 Hsu et al. Dec 2002 A1
20020198935 Crandall, Sr. et al. Dec 2002 A1
20030001894 Boykin et al. Jan 2003 A1
20030004934 Qian Jan 2003 A1
20030004951 Chokshi Jan 2003 A1
20030009239 Lombardo et al. Jan 2003 A1
20030014399 Hansen et al. Jan 2003 A1
20030037076 Bravery Feb 2003 A1
20030037145 Fagan Feb 2003 A1
20030050834 Caplan Mar 2003 A1
20030050927 Hussam Mar 2003 A1
20030050929 Bookman et al. Mar 2003 A1
20030061209 Raboczi et al. Mar 2003 A1
20030065544 Elzinga et al. Apr 2003 A1
20030066031 Laane Apr 2003 A1
20030074352 Raboczi et al. Apr 2003 A1
20030074369 Schuetze et al. Apr 2003 A1
20030084401 Abel et al. May 2003 A1
20030093279 Malah et al. May 2003 A1
20030098991 Laverty et al. May 2003 A1
20030109951 Hsiung et al. Jun 2003 A1
20030115281 McHenry et al. Jun 2003 A1
20030135358 Lissauer et al. Jul 2003 A1
20030152212 Burok et al. Aug 2003 A1
20030154380 Richmond et al. Aug 2003 A1
20030191626 Al-Onaizan et al. Oct 2003 A1
20030198337 Lenard Oct 2003 A1
20030200254 Wei Oct 2003 A1
20030200371 Abujbara Oct 2003 A1
20030202617 Casper Oct 2003 A1
20030222680 Jaussi Dec 2003 A1
20030229529 Mui et al. Dec 2003 A1
20030229544 Veres et al. Dec 2003 A1
20040003043 Rajamony et al. Jan 2004 A1
20040021686 Barberis Feb 2004 A1
20040024603 Mahoney et al. Feb 2004 A1
20040034651 Gupta et al. Feb 2004 A1
20040049479 Dome et al. Mar 2004 A1
20040049509 Keller et al. Mar 2004 A1
20040049580 Boyd et al. Mar 2004 A1
20040054610 Amstutz et al. Mar 2004 A1
20040064552 Chong et al. Apr 2004 A1
20040068517 Scott Apr 2004 A1
20040088199 Childress et al. May 2004 A1
20040103014 Teegan et al. May 2004 A1
20040117759 Rippert, Jr. et al. Jun 2004 A1
20040122652 Andrews et al. Jun 2004 A1
20040133416 Fukuoka et al. Jul 2004 A1
20040133876 Sproule Jul 2004 A1
20040139021 Reed et al. Jul 2004 A1
20040145607 Alderson Jul 2004 A1
20040147138 Vaartstra Jul 2004 A1
20040148152 Horikawa Jul 2004 A1
20040148586 Gilboa Jul 2004 A1
20040162812 Lane et al. Aug 2004 A1
20040162822 Papanyan et al. Aug 2004 A1
20040167765 Abu El Ata Aug 2004 A1
20040205672 Bates et al. Oct 2004 A1
20040220792 Gallanis et al. Nov 2004 A1
20040236566 Simske Nov 2004 A1
20040243587 Nuyens et al. Dec 2004 A1
20040268221 Wang Dec 2004 A1
20040268299 Lei et al. Dec 2004 A1
20050027563 Fackler et al. Feb 2005 A1
20050027871 Bradley et al. Feb 2005 A1
20050039191 Hewson et al. Feb 2005 A1
20050044198 Okitsu et al. Feb 2005 A1
20050050000 Kwok et al. Mar 2005 A1
20050055330 Britton et al. Mar 2005 A1
20050059566 Brown et al. Mar 2005 A1
20050060372 DeBettencourt et al. Mar 2005 A1
20050071211 Flockhart et al. Mar 2005 A1
20050096959 Kumar et al. May 2005 A1
20050104628 Tanzawa et al. May 2005 A1
20050125683 Matsuyama et al. Jun 2005 A1
20050132048 Kogan et al. Jun 2005 A1
20050138162 Byrnes Jun 2005 A1
20050144023 Aboujaoude et al. Jun 2005 A1
20050165823 Ondrusek et al. Jul 2005 A1
20050198021 Wilcox et al. Sep 2005 A1
20050216235 Butt et al. Sep 2005 A1
20050222889 Lai et al. Oct 2005 A1
20050228875 Monitzer et al. Oct 2005 A1
20050234882 Bennett et al. Oct 2005 A1
20050267770 Banavar et al. Dec 2005 A1
20050288920 Green et al. Dec 2005 A1
20060004845 Kristiansen et al. Jan 2006 A1
20060015388 Flockhart et al. Jan 2006 A1
20060020783 Fisher Jan 2006 A1
20060041861 Trefler et al. Feb 2006 A1
20060053125 Scott Mar 2006 A1
20060063138 Loff et al. Mar 2006 A1
20060064486 Baron et al. Mar 2006 A1
20060064667 Freitas Mar 2006 A1
20060075360 Bixler Apr 2006 A1
20060080082 Ravindra et al. Apr 2006 A1
20060080401 Gill et al. Apr 2006 A1
20060092467 Dumitrescu et al. May 2006 A1
20060100847 McEntee et al. May 2006 A1
20060101386 Gerken et al. May 2006 A1
20060101393 Gerken et al. May 2006 A1
20060106846 Schulz et al. May 2006 A1
20060139312 Sinclair et al. Jun 2006 A1
20060149751 Jade et al. Jul 2006 A1
20060167655 Barrow et al. Jul 2006 A1
20060173724 Trefler et al. Aug 2006 A1
20060173871 Taniguchi et al. Aug 2006 A1
20060206303 Kohlmeier et al. Sep 2006 A1
20060206305 Kimura et al. Sep 2006 A1
20060209085 Wong et al. Sep 2006 A1
20060218166 Myers et al. Sep 2006 A1
20060271559 Stavrakos et al. Nov 2006 A1
20060271920 Abouelsaadat Nov 2006 A1
20060288348 Kawamoto et al. Dec 2006 A1
20070005623 Self et al. Jan 2007 A1
20070010991 Lei et al. Jan 2007 A1
20070028225 Whittaker et al. Feb 2007 A1
20070038765 Dunn Feb 2007 A1
20070055938 Herring et al. Mar 2007 A1
20070061789 Kaneko et al. Mar 2007 A1
20070094199 Deshpande et al. Apr 2007 A1
20070100782 Reed et al. May 2007 A1
20070118497 Katoh May 2007 A1
20070130130 Chan et al. Jun 2007 A1
20070136068 Horvitz Jun 2007 A1
20070143163 Weiss et al. Jun 2007 A1
20070143851 Nicodemus et al. Jun 2007 A1
20070203756 Sears et al. Aug 2007 A1
20070208553 Hastings et al. Sep 2007 A1
20070226031 Manson et al. Sep 2007 A1
20070233902 Trefler et al. Oct 2007 A1
20070239646 Trefler Oct 2007 A1
20070245300 Chan et al. Oct 2007 A1
20070260584 Marti et al. Nov 2007 A1
20070294644 Yost Dec 2007 A1
20080002823 Fama et al. Jan 2008 A1
20080046462 Kaufman et al. Feb 2008 A1
20080077384 Agapi et al. Mar 2008 A1
20080085502 Allen et al. Apr 2008 A1
20080109467 Brookins et al. May 2008 A1
20080120593 Keren et al. May 2008 A1
20080134088 Tse et al. Jun 2008 A1
20080163253 Massmann et al. Jul 2008 A1
20080184230 Leech et al. Jul 2008 A1
20080189679 Rodriguez et al. Aug 2008 A1
20080195377 Kato et al. Aug 2008 A1
20080196003 Gerken et al. Aug 2008 A1
20080208785 Trefler et al. Aug 2008 A1
20080216055 Khatutsky Sep 2008 A1
20080216060 Vargas Sep 2008 A1
20080263510 Nerome et al. Oct 2008 A1
20080297482 Weiss Dec 2008 A1
20090007084 Conallen et al. Jan 2009 A1
20090018998 Patten, Jr. et al. Jan 2009 A1
20090075634 Sinclair et al. Mar 2009 A1
20090083697 Zhang et al. Mar 2009 A1
20090094588 Chipman Apr 2009 A1
20090132232 Trefler May 2009 A1
20090132996 Eldridge et al. May 2009 A1
20090138844 Halberstadt et al. May 2009 A1
20090150541 Georgis Jun 2009 A1
20090158213 Ryu Jun 2009 A1
20090158407 Nicodemus et al. Jun 2009 A1
20090164494 Dodin Jun 2009 A1
20090171938 Levin et al. Jul 2009 A1
20090199123 Albertson et al. Aug 2009 A1
20090228786 Danton et al. Sep 2009 A1
20090271708 Peters et al. Oct 2009 A1
20090276206 Fitzpatrick et al. Nov 2009 A1
20090282384 Keppler Nov 2009 A1
20090319948 Stannard et al. Dec 2009 A1
20100011338 Lewis Jan 2010 A1
20100083135 Zawacki et al. Apr 2010 A1
20100088266 Trefler Apr 2010 A1
20100107137 Trefler et al. Apr 2010 A1
20100149109 Elias Jun 2010 A1
20100169863 Adams Jul 2010 A1
20100217737 Shama Aug 2010 A1
20110016422 Miyazawa et al. Jan 2011 A1
20110066486 Bassin et al. Mar 2011 A1
20110072373 Yuki Mar 2011 A1
20110148791 Luu Jun 2011 A1
20110214067 Tanaka Sep 2011 A1
20110239113 Hung et al. Sep 2011 A1
20110252305 Tschani et al. Oct 2011 A1
20110264251 Copello et al. Oct 2011 A1
20120041921 Canaday et al. Feb 2012 A1
20120050530 Raman et al. Mar 2012 A1
20120102420 Fukahori Apr 2012 A1
20120198367 Bornheimer et al. Aug 2012 A1
20120272186 Kraut Oct 2012 A1
20120290939 Yu et al. Nov 2012 A1
20120293558 Dilts Nov 2012 A1
20120306773 Yeung Dec 2012 A1
20130007267 Khatutsky Jan 2013 A1
20130031455 Griffiths et al. Jan 2013 A1
20130047165 Goetz et al. Feb 2013 A1
20130067392 Leonard et al. Mar 2013 A1
20130120319 Givon May 2013 A1
20130120434 Kim May 2013 A1
20130135294 An May 2013 A1
20130159904 Kelappan et al. Jun 2013 A1
20130167245 Birtwhistle et al. Jun 2013 A1
20130179816 Seo et al. Jul 2013 A1
20130231970 Trefler et al. Sep 2013 A1
20130254833 Nicodemus et al. Sep 2013 A1
20130262842 Chiba Oct 2013 A1
20130290249 Merriman et al. Oct 2013 A1
20130335339 Maunder Dec 2013 A1
20140019400 Trefler et al. Jan 2014 A1
20140082539 Tjissen Mar 2014 A1
20140089819 Andler et al. Mar 2014 A1
20140125577 Hoang et al. May 2014 A1
20140137019 Paulsen et al. May 2014 A1
20140258860 Subramanian Sep 2014 A1
20140277164 Ramsay et al. Sep 2014 A1
20140313135 Pisters et al. Oct 2014 A1
20140325410 Jung et al. Oct 2014 A1
20150058772 Bator et al. Feb 2015 A1
20150074606 Melen Mar 2015 A1
20150089406 Trefler et al. Mar 2015 A1
20150127736 Frenkel May 2015 A1
20150220315 Chiba Aug 2015 A1
20160041961 Romney Feb 2016 A1
20160062963 Umapathy Mar 2016 A1
20160070560 Chase Mar 2016 A1
20160085809 de Castro Alves et al. Mar 2016 A1
20160098298 Trefler et al. Apr 2016 A1
20160105370 Mellor et al. Apr 2016 A1
20170013073 Mendez et al. Jan 2017 A1
20170083311 Adams Mar 2017 A1
20170090685 Lockwood et al. Mar 2017 A1
20170109032 MeLinand et al. Apr 2017 A1
20170242582 Yaremko Aug 2017 A1
20170255341 Trefler et al. Sep 2017 A1
20170351425 Dangelo et al. Dec 2017 A1
20170357703 Theimer et al. Dec 2017 A1
20180011678 Shipper et al. Jan 2018 A1
20180024901 Tankersley et al. Jan 2018 A1
20180067580 Bonnery et al. Mar 2018 A1
Foreign Referenced Citations (102)
Number Date Country
19911098 Dec 1999 DE
0549208 Jun 1993 EP
1163604 Dec 2001 EP
1183636 Mar 2002 EP
1196882 Apr 2002 EP
1203310 May 2002 EP
1208482 May 2002 EP
1212668 Jun 2002 EP
1240592 Sep 2002 EP
1277102 Jan 2003 EP
1277119 Jan 2003 EP
1277120 Jan 2003 EP
1277153 Jan 2003 EP
1277155 Jan 2003 EP
1277329 Jan 2003 EP
1374083 Jan 2004 EP
1382030 Jan 2004 EP
1386241 Feb 2004 EP
1393172 Mar 2004 EP
1393188 Mar 2004 EP
1402336 Mar 2004 EP
1407384 Apr 2004 EP
1430396 Jun 2004 EP
1438649 Jul 2004 EP
1438654 Jul 2004 EP
1438672 Jul 2004 EP
1483685 Dec 2004 EP
1490747 Dec 2004 EP
1490809 Dec 2004 EP
1492232 Dec 2004 EP
1782183 May 2007 EP
1830312 Sep 2007 EP
1840803 Oct 2007 EP
2115581 Nov 2009 EP
2555157 Apr 2018 GB
9838564 Sep 1998 WO
9840807 Sep 1998 WO
9905632 Feb 1999 WO
9945465 Sep 1999 WO
9950784 Oct 1999 WO
0033187 Jun 2000 WO
0033217 Jun 2000 WO
0033226 Jun 2000 WO
0033235 Jun 2000 WO
0033238 Jun 2000 WO
0052553 Sep 2000 WO
0052603 Sep 2000 WO
0067194 Nov 2000 WO
0140958 Jun 2001 WO
0175610 Oct 2001 WO
0175614 Oct 2001 WO
0175747 Oct 2001 WO
0175748 Oct 2001 WO
0176206 Oct 2001 WO
0177787 Oct 2001 WO
0179994 Oct 2001 WO
0219131 Mar 2002 WO
0221254 Mar 2002 WO
2002019131 Mar 2002 WO
0244947 Jun 2002 WO
02056249 Jul 2002 WO
02080006 Oct 2002 WO
02080015 Oct 2002 WO
02082300 Oct 2002 WO
02084925 Oct 2002 WO
02088869 Nov 2002 WO
02091346 Nov 2002 WO
02101517 Dec 2002 WO
02103576 Dec 2002 WO
03021393 Mar 2003 WO
03029923 Apr 2003 WO
03029955 Apr 2003 WO
03030005 Apr 2003 WO
03030013 Apr 2003 WO
03030014 Apr 2003 WO
03058504 Jul 2003 WO
03069500 Aug 2003 WO
03071380 Aug 2003 WO
03071388 Aug 2003 WO
03073319 Sep 2003 WO
03077139 Sep 2003 WO
03085503 Oct 2003 WO
03085580 Oct 2003 WO
2004001613 Dec 2003 WO
2004003684 Jan 2004 WO
2004003766 Jan 2004 WO
2004003885 Jan 2004 WO
2004046882 Jun 2004 WO
2004061815 Jul 2004 WO
2004086197 Oct 2004 WO
2004086198 Oct 2004 WO
2004095207 Nov 2004 WO
2004095208 Nov 2004 WO
2004114147 Dec 2004 WO
2005001627 Jan 2005 WO
2005003888 Jan 2005 WO
2005010645 Feb 2005 WO
2005117549 Dec 2005 WO
2006081536 Aug 2006 WO
2007033922 Mar 2007 WO
2008109441 Sep 2008 WO
2009097384 Aug 2009 WO
Non-Patent Literature Citations (134)
Entry
DeMichiel, L.G., et al., Polyglot: Extensions to Relational Databases for Sharable Types and Functions in a Multi-Language Environment, Proc. Ninth Int. Conf. on Data Engineering, IEEE, pp. 651-660, Apr. 1993.
Devarakonda et al., Predictability of process resource usage: A measurement-based study on UNIX. IEEE Transactions on Software Engineering. 1989;15(12)1579-1586.
Communication for European Patent Application No. 05755530.2, dated Sep. 6, 2007 (2 pages).
European Search Report for Application No. 0575553 0.2, dated Mar. 26, 2012 (3 Pages).
European Office Action dated Aug. 31, 2012 for Application No. 05755530.2 (4 Pages).
Communication for European Patent Application No. 07250844.3 enclosing European Search Report, dated Jul. 11, 2007 (6 pages).
Communication for European Patent Application No. 07250844.3, dated Mar. 28, 2008 ( 1 page).
European Office Action dated Jul. 9, 2012 for Application No. 07250844.3 (8 Pages).
Communication for European Patent Application No. 07250848.4, dated Aug. 13, 2007 (EESR enclosed) (6 pages).
Communication for European Patent Application No. 07250848.4, dated May 29, 2008 (1 page).
Communication for European Patent Application No. 0873 1127.0, dated Oct. 13, 2009 (2 pages).
Extended European Search Report dated Oct. 29, 2012 for Application No. 08731127.0 (8 Pages).
Extended European Search Report for Application No. 151893 85.6, dated Dec. 17, 2015 (8 pages).
Fayad, M.E, et al., Object-oriented application frameworks. Communications of the ACM, Oct. 1997, vol. 40, issue 10, pp. 32-38, http://dl.acm.org/citation.cfmid=262798.
Francisco, S., et al. Rule-Based Web Page Generation, Proceedings of the 2nd Workshop on Adaptive Hypertext and Hypermedia, Hypertext98, Jun. 20-24, 1998, 9 pages.
Gajos et al. SUPPLE: Automatically Generating User Interfaces. IUI 2004, 8 pages.
Hague, Darren, Universal Worklist with SAP Netweaver Portal. Galileo Press, 2008, pp. 11-31. http://www.sap-hefte.de/download/dateien/14611146leseprobe.pdf.
International Search Report and Written Opinion for Application No. PCT/GB2004/000677, dated Aug. 2, 2004 (15 pages).
International Search Report for Application No. PCT/US2004/020783, dated Nov. 8, 2005 (2 pages).
International Preliminary Report on Patentability for Application No. PCT/US2004/020783, dated Feb. 13, 2006 (6 pages).
International Search Report for PCT/US05/018599, dated May 15, 2007 (1 page).
[NoAuthorListed] XPath Tutorial, Mar. 18, 2005, 7 pages (Year:2005).
Summons to Attend Oral Proceedings pursuant to rule 115( 1) EPC, issued May 2, 2018 for Application No. 0873 1127.0 (8 pages).
U.S. Appl. No. 08/666,165, filed Jun. 19, 1996, Rules Bases and Methods of Access Thereof.
U.S. Appl. No. 10/430,693, filed May 6, 2003, Methods and Apparatus for Digital Data Processing With Mutable Inheritance.
U.S. Appl. No. 10/547,014, filed Aug. 25, 2005, Classification Using Probability Estimate Re-Sampling.
U.S. Appl. No. 10/639,735, filed Aug. 12, 2003, ProcessNiewer Interface.
U.S. Appl. No. 10/854,017, filed May 26, 2004, Integration of Declarative Rule-Based Processing With Procedural Programming.
U.S. Appl. No. 11/046,211, filed Jan. 28, 2005, Methods and Apparatus for Work Management and Routing.
U.S. Appl. No. 11/203,513, filed Aug. 12, 2005, Methods and Apparatus for Digital Data Processing With Mutable Inheritance.
U.S. Appl. No. 11/368,360, filed Mar. 3, 2006, Rules Base Systems and Methods With Circumstance Translation.
U.S. Appl. No. 11/396,415, filed Mar. 30, 2006, User Interface Methods and Apparatus for Rules Processing.
Kuhn, H.W., The Hungarian Method for the Assignment Problem, Naval Research Logistics Quarterly, 2 (1955), pp. 83-97.
Kuno, H.A., and E.A. Rundensteiner, Augmented Inherited MultiIndex Structure for Maintenance of Materialized Path Query Views, Proc. Sixth Int. Workshop on Research Issues in Data Engineering, pp. 128-137, Feb. 1996.
LaRue, J., Leveraging Integration and Workflow. Integrated Solutions, Accounting Today, SourceMedia, Aug. 2006, pp. 18-19.
Lippert, Eric, Fabulous Adventures in Coding: Metaprogrannning, Toast and the Future of Development Tools, Microsoft.com Blog, MSDN Home, published Mar. 4, 2004, 6 pgs.
Mandal, et al., Integrating existing scientific workflow systems: The kepler/pegasus example. USC Information Sciences Institute, 2007, 8 pages.
Manghi, Paolo, et. al., Hybrid Applications Over XML: Integrating the Procedural and Declarative Approaches, 2002 ACM, pp. 1-6. Retrieved Mar. 22, 2007.
Markiewicz, M.E., et al., Object oriented framework development ACM, 2001, 13 pages, http://dl.acm.org/citation.cfmid37277I.
Markowitz, V.M., and A. Shoshani, Object Queries over Relational Databases: Language, Implementation, and Applications, IEEE Xplore, pp. 71-80, Apr. 1993.
Marmel, Elaine, Microsoft Office Project 2007 Bible, ISBN 0470009926, Wiley Publishing, Inc., 2007, 961 pages.
Maryanski, F., et al., The Data Model Compiler a Tool for Generating Object-Oriented Database Systems, 1986 Int. Workshop on Object-Oriented Database Systems, IEEE, 73-84 (1986).
McConnell, Steven C., Brooks Law Repealed, IEEE Software, pp. 6-9, Nov./Dec. 1999.
Mecca, G., et al., Cut and Paste, ACM, pp. 1-25 and Appendix I-IV (Jun. 1999). Retrieved Mar. 22, 2007.
Mitchell, T.M., Machine Learning, Chapter 3, 1997, McGraw-Hill, pp. 52-80.
Mitchell, T.M., Machine Learning, Chapter 6, 1997, McGraw-Hill, pp. 154-200.
Morizet-Mahoudeaux, P., A Hierarchy of Network-Based Knowledge Systems, IEEE Trans. on Systems, Man, and Cybernetics, vol. 21(5), pp. 1184-1191, Sep./Oct. 1991.
Pientka, B., et al., Progrannning with proofs and explicit contexts. International Symposium on Principles and Practice of Declarative Progrannning, ACM, 2008, pp. 163-173, http://delivery.acm.org/1O.II45/1390000/1389469/pI63-pientka.pdf.
Reinersten, Don, Is It Always a Bad Idea to Add Resources to a Late Project, Oct. 30, 2000. Electronic Design. vol. 48, Issue 22, p. 70.
Riccuiti, M., Oracle 8.0 on the way with objects: upgrade will also build in multidimensional engine. Info World. Sep. 25, 1995;17(39):16.
Richner, T., et al., Recovering high-level views of object-oriented applications from static and dynamic information. IEEE, 1999, 10 pages, http://ieeexplore.ieee.org/stamp/stamp.jsptp= arnumber=F792487.
Salvini, S., and M.H. Williams, Knowledge Management for Expert Systems, IEEE Colloquium on Knowledge Engineering, 3 pages, May 1990.
Schiefelbein, Mark, A Backbase Ajax Front-end for J2EE Applications, Internet Article, dev2dev http://dev2dev.bea.com/Ipt/a/433 , Aug. 29, 2005, 16 pages.
Sellis, T., et al., Coupling Production Systems and Database Systems: A Homogeneous Approach, IEEE Trans. on Knowledge and Data Engineering, vol. 5(2), pp. 240-256, Apr. 1993.
Shyy Y.M., and S.Y.W. Su, Refinement Preservation for Rule Selection in Active Object-Oriented Database Systems, Proc. Fourth Intl. Workshop on Research Issues in Data Engineering, pp. 115-123, Feb. 1994.
Singh, G., et al., Workflow task clustering for best effort systems with pegasus, Pegasus, 2008, 8 pages.
Smedley, T.J. et al., “Expanding the Utility of Spreadsheets Through the Integration of Visual Programming and User Interface Objects,” School of Computer Science, Technical University of Nova Scotia, ACM, 1996; pp. 148-155.
Srinivasan, V., et al., Object persistence in object-oriented applications. IBM Systems Journal, 1997, vol. 36, issue 1, pp. 66-87, http://ieeexplore.ieee.org/stamp/stamp.jsptp= arnumber-5387186.
Stonebraker, M., The Integration of Rule Systems and Database Systems, IEEE Trans. on Knowledge and Data Engineering, vol. 4(5), pp. 415-423, Oct. 1992.
Sun, et al., “Supporting Inheritance in Relational Database Systems,” IEEE, pp. 511-518, Jun. 1992.
Thuraisingham, “From Rules to Frames and Frames to Rules,” AI Expert, pp. 31-39, Oct. 1989.
Vranes, S., et al., Integrating Multiple Paradigms within the Blackboard Framework, IEEE Transactions on Software Engineering, vol. 21, No. 3, Mar. 1995, pp. 244-262.
Yang, Bibo; Geunes, Joseph; OBrien, William J.; ResourceConstrained Project Scheduling: Past Work and New Directions, Apr. 2001, 28 pages, Research Report 2001-2006, Department of Industrial and Systems Engineering, University of Florida.
U.S. Appl. No. 15/613,439, filed Jun. 5, 2017, Connecting Graphical Shapes Using Gestures.
U.S. Appl. No. 15/206,956, filed Jul. 11, 2016, Selective Sharing for Collaborative Application Usage.
U.S. Appl. No. 11/681,269, filed Mar. 2, 2007, Proactive Performance Management for Multi-User Enterprise Software Systems.
U.S. Appl. No. 12/035,682, filed Feb. 22, 2008, User Interface Methods and Apparatus for Rules Processing.
U.S. Appl. No. 12/174,624, filed Jul. 16, 2008, Methods and Apparatus for Implementing Multilingual Software Applications.
U.S. Appl. No. 12/381,523, filed Mar. 12, 2009, Techniques for Dynamic Data Processing.
U.S. Appl. No. 12/386,959, filed Apr. 24, 2009, Method and Apparatus for Integrated Work Management.
U.S. Appl. No. 12/590,454, filed Nov. 6, 2009, Techniques for Content-Based Caching in a Computer System.
U.S. Appl. No. 12/619,215, filed Nov. 16, 2009, Rules Base Systems and Methods With Circumstance Translation.
U.S. Appl. No. 12/649,095, filed Dec. 29, 2009, Methods and Apparatus for Integration of Declarative Rule-Based Processing With Procedural Programming in a Digital Data-Processing Evironment.
U.S. Appl. No. 12/798,161, filed Mar. 30, 2010, System and Method for Creation and Modification of Software Applications.
U.S. Appl. No. 13/031,097, filed Feb. 18, 2011, Systems and Methods for Distributed Rules Processing.
U.S. Appl. No. 13/031,109, filed Feb. 18, 2011, Rule-Based User Interface Conformance Methods.
U.S. Appl. No. 13/341,411, filed Dec. 30, 2011, System and Method for Updating or Modifying an Application Without Manual Coding.
U.S. Appl. No. 13/536,079, filed Jun. 28, 2012, Proactive Performance Management for Multi-User Enterprise Software Systems.
U.S. Appl. No. 13/718,255, filed Dec. 18, 2012, Methods and Apparatus for Work Management and Routing.
U.S. Appl. No. 13/892,956, filed May 13, 2013, Content-Based Caching Using a Content Identifier at a Point in Time.
U.S. Appl. No. 13/897,763, filed May 20, 2013, System and Software for Creation and Modification of Software.
U.S. Appl. No. 13/907,287, filed May 31, 2013, Methods and Apparatus for Integration of Declarative Rule-Based Processing With Procedural Programming in a Digital Data-Processing Environment.
U.S. Appl. No. 14/469,208, filed Aug. 26, 2014, Techniques for Dynamic Data Processing.
U.S. Appl. No. 14/527,348, filed Oct. 29, 2014, Systems and Methods for Distributed Rules Processing.
U.S. Appl. No. 14/558,084, filed Dec. 2, 2014, Methods and Apparatus for User Interface Optimization.
U.S. Appl. No. 14/597,207, filed Jan. 14, 2015, Methods and Apparatus for Integrated Work Management.
U.S. Appl. No. 14/928,085, filed Oct. 30, 2015, System and Method for Updating or Modifying an Application Without Manual Coding. International Preliminary Report on Patentability for PCT/US2005/018599, dated Jun. 5, 2007 (10 pages).
International Search Report Written Opinion for PCT/US06/03160, dated Jul. 21, 2008 (16 pages).
International Preliminary Report on Patentability for PCT /US06/03160, dated Apr. 9, 2009 (14 pages).
International Search Report for PCT/US013/55503, dated Jul. 28, 2008 ( 1 page).
International Preliminary Report on Patentability for PCT/US2008/055503, dated Sep. 17, 2009 (4 pages).
International Search Report Written Opinion for PCT/US09/32341, dated Mar. 11, 2009 (14 pages).
International Preliminary Report on Patentability for PCT/US2009/032341, dated Aug. 12, 2010 (8 pages).
Johnson et al., Sharing and resuing rules—a feature comparison of five expert system shells. IEEE Expert, IEEE Services Center, New York, NY, vol. 9, No. 3, Jun. 1, 1994, pp. 3-17.
Jones et al., A user-centered approach to functions in excel. International Conference on Functional Programming, Uppsala, Jun. 30, 2003, pp. 1-12.
Kim, W, Object-Oriented Databases: Definition and Research Directions, IEEE Trans. on Knowledge and Data Engineering, vol. 2(3) pp. 327-341, Sep. 1990.
XPath Tutorial, Mar. 18, 2005, 7 pages (Year: 2005).
Eisenstein, et al., Adaptation in Automated User-Interface Design.IUI, 2000, pp. 74-81.
Simpson, Alan, et al., Access 97 for Windows 95/NT, 1997 Sybex,16 pages, USPTO STIC-EIC 2100/2400.
Ceri, S., et al., WIDE—A distributed architecture for workflow management. Proceedings. Seventh International Workshop on Research Issues in Data Engineering, IEEE, 1997, pp. 76-79, 1997.
Deelman, E., et al., Workflows and e-science: An overview of workflow system features and capabilities. Future Generation Computer Systems, May 2009, vol. 25, issue 5, pp. 528-540.
Kappel, G., et al., TriGSflow active object-oriented workflow management.Proceedings of the 28th Annual Hawaii International Conference on System Sciences. 1995, pp. 727-736.
Manolescu, D.A., et al., Dynamic object model and adaptive workflow. Proceedings of Metadata and Active Object-Model Pattern Mining Workshop co-located with OOPSLA, 1999, vol. 99, 19 pages.
Schulze, W., Fitting the workflow management facility into the object management architecture. Business Object Design and Implementation II. Springer London, 1998, pp. 109-117.
Surjanto, B., XML content management based on object-relational database technology. Proceedings of the First International Conference on Web Information Systems Engineering, IEEE, 2000, Jun. 19-21, 2000, vol. 1, pp. 70-79.
[No Author Listed] About the Integrated Work Manager (IWM).Pegasystems, Inc., Apr. 30, 2009, 3 pages, http://pdn-dev/DevNet/PRPCv5/KB/TMP9ad0lzumf.asp.
[No Author Listed] FreeBSD Project. “EDQUOTA(8)” in Free BSD System Managers Manual. FreeBSD 8.2 Jun. 6, 1993. pp. 1-2.Retrieved from freebsd.org on Oct. 27, 2011.
[No Author Listed] How SmartForms for Fair Blaze Advisor works,Fair Issac White Paper, http://www.FAIRISAAC.COM/, Oct. 31, 2005, 8 pages (website no longer active).
[No Author Listed] How to Configure and Customize the Universal Worklist. SAP Netweaver 04 and SAP Enterprise Portal 6.0. SAP AG. Version 1, May 2004, 65 pages. http://www.erpgenie.com/sap/netweaver/ep/Configuring%20the%20UWL.pdf.
[No Author Listed] How to configure the IWM/IAC gateway.Pegasystems, Inc., Apr. 30, 2009, 4 paegs, http://pdn-dev/DevNet/PRPCv5/KB/TMP9cf8fzurq4.asp.
[No Author Listed] How to install the Integrated Work Manager (IWM). Pegasystems, Inc., Apr. 30, 2009, 6 pages, http://pdn-dev/Dev N et/PRPCv5/KB/TMP9br 1 ezurp8 .asp.
[No Author Listed] HP Integrated Lights-Out 2, User Guide, Part No. 394326-004, HP, Aug. 2006, 189 pages.
[No Author Listed] Integrating with External Systems, PegaRULES Process Commander 5.2. Process Commander 5.2 reference. Pegasystems Inc, Cambridge, MA, 2006, 103 pages http:/ /pdn.pega.corn/ProductSupport/Products/PegaRULESProcessCommander/documents/PRPCN5/502/iwes/PRPC52_integrating_with_Extemal_Systems.pdf.
[No Author Listed] IP Prior Art Database, Options when returning work items in workflow management systems. IBM, IPCOM000027980D, 2004, 3 pages.
[No Author Listed] IP Prior Art Database, Staff Queries and Assignments in Workflow Systems. IBM, IPCOM000142382D, 2006, 4 pages.
[No Author Listed] IP Prior Art Database, Using work items to manage user interactions with adaptive business services. IBM TDB, IPCOM000015953D, 2003, 4 pages.
[No Author Listed] Localizing an Application, PegaRULES Process Commander. Process Commander 4.2 reference. Pegasystems Inc., Cambdrige, MA, 2006, 92 pages http://pdn.pega.com/DevNet/PRPCv4/TechnologyPapers/documents/Localization0402.pdf.
[No Author Listed] Oracle Universal Work Queue: Implementation Guide. Release IIi for Windows NT. Oracle Corporation. Jul. 2001, 136 pages. http://docs.oracle.com/cd/A85964_01/acrobat/eul 15ug.pdf.
[No Author Listed] Solaris 9 resource manager software. A technical white paper. Sun Microsystems, Inc., Palo Alto CA, 2002, 37 pages. XP-002291080. Retrieved Aug. 3, 2004 from http://wwws.sun.corn/software/whitepapers/solaris9/srm.pdf.
Bertino, E., and P. Foscoli, Index Organizations for Object-Oriented Database Systems, IEEE Trans. on Knowledge and Data Engineering, 7(2): 193-209 (Apr. 1995).
Bierbaum, A., et al., VR juggler: A virtual platform for virtual reality application development. Proceedings of the Virtual Reality 2001 Conference, IEEE, 2001, 8 pages, http://ieeexplore.ieee.org/stamp/stamp.j sptp=Stamumber-913 77 4.
Breiman, L., Bagging predictors, Machine Learning, vol. 24, No. 2, Aug. 31, 1996, pp. 123-140, Kluwer Academic Publishers, Netherlands.
Brusilovsky, P., and De Bra, P., Editors, “Second Workshop on Adaptive Hypertext and Hypermedia Proceedings,” Jun. 20-24, 1998. Ninth ACM Conference on Hypertext and Hypermedia, Hypertext98. pp. 1-2.
Burleson, D., Adding behaviors to relational databases, DBMS, 8(10): 68(5) (Sep. 1995).
Busse, Ralph et al., Declarative and Procedural Object Oriented Views, IEEE, 1998, pp. 570-578, retrieved Mar. 22, 2007.
Buyya et al., Economic Models for Resource Management and Scheduling in Grid Computing, Concurrency and Computation: Practice and Experience, 2002, vol. 14, pp. 1507-1542. Chan, T.W., and W. Hwang, Towards Integrating Logic, Object, Frame, and Production, Proc. Fourth Int. Conf. on Software Engineering and Knowledge Engineering, IEEE, pp. 463-469, Jun. 1992.
Cheng, Cheng-Chung; Smith, Stephen F.; A Constraint Satisfaction Approach to Makespan Scheduling, ATPS 1996 Proceedings, pp. 45-52 (1996).
Cheng, C.C. and Smith, Applying Constraint Satisfaction Techniques to Job Shop Scheduling, Annals of Operations Research, 70: 327-357 (1997).
Cochrane, Roberta et al., Integrating Triggers and Declarative Constraints in SQL Database Systems, pp. 567-578, Proceedings of the 22nd VLDB Conference Mumbai (Bombay), India, 1996, retrieved Mar. 22, 2007.
Damerau, F.J., Problems and some solutions in customization of natural language database front ends. ACM Transactions on Information Systems, vol. 3, No. 2, Apr. 1, 1985, pp. 165-184.
Danforth, S., Integrating Object and Relational Technologies, Proc. Sixteenth Annual Int. Computer Software and Applications Conf., IEEE Comput. Soc. Press, pp. 225-226, Sep. 1992 (Abstract).
Deelman, E., et al., Pegasus: A framework for mapping complex scientific workflows onto distributed systems, submitted to Scientific Programming, Jan. 2005. Pre journal publication article, 22 pages.
Deelman, E., et al., Pegasus: A framework for mapping complex scientific workflows onto distributed systems. Scientific Programming, 13, pp. 219-237, 2005.
Europoean Search Report for Application No. 19191686.5-1224/3611616, dated Jan. 22, 2020 (8 pages).
Related Publications (1)
Number Date Country
20200057617 A1 Feb 2020 US
Provisional Applications (1)
Number Date Country
62718809 Aug 2018 US