-
公开(公告)号：US08266598B2
公开(公告)日：2012-09-11
申请号：US12115435
申请日：2008-05-05
IPC分类号： G06F9/44
CPC分类号： G06F11/3608 , G06F9/44589
摘要： Bounding resource consumption of code using abstract interpretation includes a static analysis to estimate a code's resource consumption in terms of units of resources utilized at any point during execution, expressed as a function of its scalar inputs. An instrumentation mechanism and an abstract interpretation mechanism are employed to compute bounds on the code resource consumption. The instrumentation mechanism includes incorporating one or more counter variables in the source code to count the number of loop iterations and recursive procedure call invocations. The abstract interpretation mechanism includes computing invariants on the instrumented counter variables and scalar program variables to obtain bounds on the number of loop iterations and recursive procedure call invocations, which are then composed together to obtain resource bounds for the entire program.
摘要翻译： 使用抽象解释来限制代码的资源消耗包括静态分析，以执行期间的任何时间点使用的资源单位来估计代码的资源消耗，以其标量输入的函数表示。 采用仪器机制和抽象解释机制来计算代码资源消耗的边界。 仪器机制包括在源代码中并入一个或多个计数器变量以对循环迭代次数和递归过程调用调用进行计数。 抽象解释机制包括在仪表化计数器变量和标量程序变量上计算不变量，以获得循环迭代次数和递归过程调用调用的边界，然后将它们组合在一起以获得整个程序的资源范围。
-
2.发明申请Calculating Resource Bounds Of Programs Manipulating Recursive Data Structures And Collections 有权计算处理递归数据结构和集合的程序的资源边界公开(公告)号：US20100088684A1
公开(公告)日：2010-04-08
申请号：US12247034
申请日：2008-10-07
IPC分类号： G06F9/45
CPC分类号： G06F8/452 , G06F9/44589 , G06F11/3644
摘要： Bounding resource consumption of code that processes recursive data structures and collections includes making use of quantitative functions (based on user input) that are associated with a tuple of data-structures and whose semantics is specified by describing the effect of various data-structure methods on the relevant quantitative functions. Counter variables are incorporated into source code to count loop iterations (and number of recursive procedure call invocations). Relevant quantitative functions are incorporated into the source code to allow computation of invariants (and hence bounds) on the incorporated counter variables in terms of the quantitative functions.
摘要翻译： 处理递归数据结构和集合的代码的边界资源消耗包括利用与数据结构的元组相关联的定量函数（基于用户输入），并且通过描述各种数据结构方法对其语义的影响来指定其语义 相关定量功能。 计数器变量被并入到源代码中以对循环迭代进行计数（和递归过程调用调用的次数）。 相关的定量函数被并入到源代码中，以允许根据定量函数计算所引入的计数器变量上的不变量（和因此的边界）。
-
3.发明授权Calculating resource bounds of programs manipulating recursive data structures and collections 有权计算操纵递归数据结构和集合的程序的资源边界公开(公告)号：US08397221B2
公开(公告)日：2013-03-12
申请号：US12247034
申请日：2008-10-07
CPC分类号： G06F8/452 , G06F9/44589 , G06F11/3644
摘要： Bounding resource consumption of code that processes recursive data structures and collections includes making use of quantitative functions (based on user input) that are associated with a tuple of data-structures and whose semantics is specified by describing the effect of various data-structure methods on the relevant quantitative functions. Counter variables are incorporated into source code to count loop iterations (and number of recursive procedure call invocations). Relevant quantitative functions are incorporated into the source code to allow computation of invariants (and hence bounds) on the incorporated counter variables in terms of the quantitative functions.
摘要翻译： 处理递归数据结构和集合的代码的边界资源消耗包括利用与数据结构的元组相关联的定量函数（基于用户输入），并且通过描述各种数据结构方法对其语义的影响来指定其语义 相关定量功能。 计数器变量被并入到源代码中以对循环迭代进行计数（和递归过程调用调用的次数）。 相关的定量函数被并入到源代码中，以允许根据定量函数计算所引入的计数器变量上的不变量（和因此的边界）。
-
公开(公告)号：US20090276763A1
公开(公告)日：2009-11-05
申请号：US12115435
申请日：2008-05-05
IPC分类号： G06F9/44
CPC分类号： G06F11/3608 , G06F9/44589
摘要： Bounding resource consumption of code using abstract interpretation includes a static analysis to estimate a code's resource consumption in terms of units of resources utilized at any point during execution, expressed as a function of its scalar inputs. An instrumentation mechanism and an abstract interpretation mechanism are employed to compute bounds on the code resource consumption. The instrumentation mechanism includes incorporating one or more counter variables in the source code to count the number of loop iterations and recursive procedure call invocations. The abstract interpretation mechanism includes computing invariants on the instrumented counter variables and scalar program variables to obtain bounds on the number of loop iterations and recursive procedure call invocations, which are then composed together to obtain resource bounds for the entire program.
摘要翻译： 使用抽象解释来限制代码的资源消耗包括静态分析，以执行期间的任何时间点使用的资源单位来估计代码的资源消耗，以其标量输入的函数表示。 采用仪器机制和抽象解释机制来计算代码资源消耗的边界。 仪器机制包括在源代码中并入一个或多个计数器变量以对循环迭代次数和递归过程调用调用进行计数。 抽象解释机制包括在仪表化计数器变量和标量程序变量上计算不变量，以获得循环迭代次数和递归过程调用调用的界限，然后将其组合在一起以获得整个程序的资源限制。
-
公开(公告)号：US20090319608A1
公开(公告)日：2009-12-24
申请号：US12143891
申请日：2008-06-23
CPC分类号： G06Q10/06
摘要： An automated task centered collaboration technique is described that significantly lowers the technological entry barrier for the development and deployment of a broad class of collaborative applications, which are termed Task Centered Collaboration (TCC) applications. TCC applications facilitate the processing of a large number of work items, or tasks, by people working independently or in small, synchronously collaborating groups. The technique also provides a mechanism for the study of computer mediated communication and human-computer interactions for this class of applications. The technique creates an abstraction applicable to the broad class of TCC applications, which enables the factoring out of significant portions of the application into a common infrastructure. It provides a programming model that enables a developer to focus on the User Interface and logic associated with operations on a single task, without being exposed to issues such as security, authentication, binding users to activities, synchronization, concurrency and persisting data.
摘要翻译： 描述了一种自动化的以任务为中心的协作技术，显着降低了开发和部署广泛类型的协作应用程序的技术进入障碍，这些协作应用程序称为任务集中协作（TCC）应用程序。 TCC应用促进了独立工作人员或小型，同步协作小组处理大量工作项目或任务。 该技术还提供了一种用于研究这类应用的计算机介入通信和人机交互的机制。 该技术创建了适用于广泛类型的TCC应用程序的抽象，这使得将应用程序的重要部分分解成一个共同的基础架构。 它提供了一种编程模型，使开发人员能够专注于与单个任务上的操作相关联的用户界面和逻辑，而不会面临诸如安全性，身份验证，将用户绑定到活动，同步，并发和持久数据等问题。
-
公开(公告)号：US20100088546A1
公开(公告)日：2010-04-08
申请号：US12245581
申请日：2008-10-03
申请人： Trishul Chilimbi , Krishna Kumar Mehra , Benjamin Robert Liblit , Aditya V. Nori , Kapil Vaswani
发明人： Trishul Chilimbi , Krishna Kumar Mehra , Benjamin Robert Liblit , Aditya V. Nori , Kapil Vaswani
IPC分类号： G06F11/36
CPC分类号： G06F11/366
摘要： The method executes the application and if there are no errors from the execution of the application, the method ends. If errors exist, the errors are collected from the execution of the application in an error report. Labeled application paths are created by adding a unique label to individual application paths where the application paths are individual loops and individual functions in the application. An analysis is created of the labeled application paths by executing the application with the labeled paths, reviewing the error report for data related to the labels and if an error is sufficiently related to application paths with labels, storing the path that created the errors in a report. If an error is not sufficient related to the application path with labels, the method is repeated by the creating the analysis again by substituting additional application paths for the application paths.
摘要翻译： 该方法执行应用程序，如果应用程序的执行没有错误，则该方法结束。 如果存在错误，则会在错误报告中从应用程序的执行中收集错误。 标签的应用程序路径是通过向单个应用程序路径添加唯一标签创建的，其中应用程序路径是单个循环和应用程序中的单个功能。 通过使用标记的路径执行应用程序来创建标记的应用程序路径的分析，查看与标签相关的数据的错误报告，并且如果错误与具有标签的应用程序路径充分相关，则将创建错误的路径存储在 报告。 如果与标签的应用程序路径相关的错误不足，则通过将其他应用程序路径替换为应用程序路径，再次创建分析来重复该方法。
-
7.发明申请MOBILE PHONE BASED MOBILE CUSTOMER RELATIONSHIP LOYALTY METHODOLOGY AND SERVICING SYSTEM WITH INSTANT ANALYTICS FEATURES THEREOF 审中-公开基于移动电话的移动客户关系LOYALTY方法和维护系统及其具有即时分析特征公开(公告)号：US20120010931A1
公开(公告)日：2012-01-12
申请号：US13257630
申请日：2010-03-17
IPC分类号： G06Q30/00
CPC分类号： G06Q10/107 , G06Q20/322 , G06Q30/02 , G06Q30/0214 , G06Q30/0226
摘要： A mobile phone based mobile customer relationship and loyalty servicing system and method thereof which involves media such as SMS, e-mail, instant messenger or a notification to a mobile application or website as well to identify and communicate with the customer in a customer friendly manner. It includes a unique code based operation and special feature of instant analytics for the customer, points/voucher validation and redemption, incentivized referral program, integrated campaigns and the like right at the POS terminal at client outlet enabling real time integration, analytics and communication. The system involving Mobile phones/like mobile operative devices of the end users/customers, at least one client component at the retail/sales outlets and a server component comprising an MCRLP main server system for operative connection to said one client component for customer relationship and loyalty servicing. The Customer interacts with the system and his behavior is modeled.
摘要翻译： 一种基于移动电话的移动客户关系和忠诚度服务系统及其方法，其涉及诸如SMS，电子邮件，即时通讯或向移动应用或网站的通知等媒体，以及以客户友好的方式识别和与客户进行通信 。 它包括独特的基于代码的操作和客户即时分析的特殊功能，点/凭证验证和兑换，激励转介程序，集成的活动等，在客户端的POS终端实现实时集成，分析和通信。 包括终端用户/客户的移动电话/类似移动操作设备的系统，零售/销售点的至少一个客户端组件和包括用于与所述一个客户端组件进行客户关系的操作连接的MCRLP主服务器系统的服务器组件，以及 忠诚度服务。 客户与系统进行交互，并对其行为进行建模。
-
公开(公告)号：US20090327809A1
公开(公告)日：2009-12-31
申请号：US12146611
申请日：2008-06-26
申请人： Joseph M. Joy , Gopal R. Srinivasa , Kanika Nema , Sriram Rajamani , Krishna Kumar Mehra , Vipindeep Vangala
发明人： Joseph M. Joy , Gopal R. Srinivasa , Kanika Nema , Sriram Rajamani , Krishna Kumar Mehra , Vipindeep Vangala
IPC分类号： G06F11/00
CPC分类号： G06F11/366 , G06F11/3636
摘要： During software development, both before and after release, information may be collected and stored that may provide insight to developers as a generalized service. For example, data from past debugging sessions, source code in various repositories, bug repositories, discussion groups, and various documents may provide relevant information for software developers to fix current problems when this information is coherently matched with the problem. Using various sources, a system may mine the stored data to give the current developer information related to past code development, and reveal why the code changed throughout previous development. Using sophisticated analyses to identify similar code patterns across multiple large software projects, discovering patterns in normal and abnormal uses of particular software interfaces, and employing other mining techniques, a developer may find domain-specific information to facilitate ongoing software development.
摘要翻译： 在软件开发过程中，在发布之前和之后，可以收集和存储信息，这些信息可以作为广义服务为开发人员提供洞察。 例如，来自过去调试会话的数据，各种存储库中的源代码，错误库，讨论组和各种文档可能为软件开发人员提供相关信息，以便在此信息与问题相一致地匹配时修复当前问题。 使用各种来源，系统可以挖掘存储的数据，以提供与过去代码开发相关的当前开发者信息，并且揭示为什么代码在以前的开发过程中改变。 使用复杂的分析来确定多个大型软件项目中的类似代码模式，发现特定软件界面的正常和异常使用中的模式以及采用其他挖掘技术，开发人员可能会发现特定于域的信息来促进正在进行的软件开发。
-
公开(公告)号：US08065565B2
公开(公告)日：2011-11-22
申请号：US12245581
申请日：2008-10-03
申请人： Trishul Chilimbi , Krishna Kumar Mehra , Benjamin Robert Liblit , Aditya V. Nori , Kapil Vaswani
发明人： Trishul Chilimbi , Krishna Kumar Mehra , Benjamin Robert Liblit , Aditya V. Nori , Kapil Vaswani
IPC分类号： G06F11/00
CPC分类号： G06F11/366
摘要： The method executes the application and if there are no errors from the execution of the application, the method ends. If errors exist, the errors are collected from the execution of the application in an error report. Labeled application paths are created by adding a unique label to individual application paths where the application paths are individual loops and individual functions in the application. An analysis is created of the labeled application paths by executing the application with the labeled paths, reviewing the error report for data related to the labels and if an error is sufficiently related to application paths with labels, storing the path that created the errors in a report. If an error is not sufficient related to the application path with labels, the method is repeated by the creating the analysis again by substituting additional application paths for the application paths.
摘要翻译： 该方法执行应用程序，如果应用程序的执行没有错误，则该方法结束。 如果存在错误，则会在错误报告中从应用程序的执行中收集错误。 标签的应用程序路径是通过向单个应用程序路径添加唯一标签创建的，其中应用程序路径是单个循环和应用程序中的单个功能。 通过使用标记的路径执行应用程序来创建标记的应用程序路径的分析，查看与标签相关的数据的错误报告，并且如果错误与具有标签的应用程序路径充分相关，则将创建错误的路径存储在 报告。 如果与标签的应用程序路径相关的错误不足，则通过将其他应用程序路径替换为应用程序路径，再次创建分析来重复该方法。
-
-
-
-
-
-
-
-
搜索结果
9 条记录 (耗时 0.018 秒)
