公开(公告)号：US07283533B1

公开(公告)日：2007-10-16

申请号：US09892117

申请日：2001-06-25

Applicant: Rajesh Kumar ,  David Hughes ,  Mohammed Mostafa ,  John Ellis

Inventor： Rajesh Kumar ,  David Hughes ,  Mohammed Mostafa ,  John Ellis

IPC: H04L12/28 ,  H04J3/16

CPC classification number: H04L12/66 ,  H04L65/1033 ,  H04M7/006 ,  H04M7/124

Abstract: A method for directly converting packet-based voice data of two non-compatible formats, (e.g., VoIP and VOATM), is described. A VoIP call agent sets a connection between a VoIP edge gateway and an interworking unit (IWU). The IWU allows the VoATM network to appear as a TDM network to the VoIP call agent. The VoIP call agent selects a virtual trunk group and channel identification code through the interworking unit and transmits the selection to a VoATM call agent. The IWU allows the VoIP network to appear as a TDM network to the VoATM call agent such that the VoATM call agent establishes a connection between the virtual trunk group and a VoATM network device. The IWU allows the VoATM network to appear as a TDM network to the VoIP call agent such that the VoIP call agent establishes a connection between the virtual trunk group and a VoIP network device.

Abstract translation: 描述了用于直接转换两种不兼容格式（例如，VoIP和VOATM）的基于分组的语音数据的方法。 VoIP呼叫代理设置VoIP边缘网关和互通单元（IWU）之间的连接。 IWU允许VoATM网络显示为VoIP呼叫代理的TDM网络。 VoIP呼叫代理通过互通单元选择虚拟中继线群和信道识别码，并将选择发送到VoATM呼叫代理。 IWU允许VoIP网络作为TDM网络显示给VoATM呼叫代理，使得VoATM呼叫代理建立虚拟中继组与VoATM网络设备之间的连接。 IWU允许VoATM网络显示为VoIP呼叫代理的TDM网络，使得VoIP呼叫代理建立虚拟中继组与VoIP网络设备之间的连接。

公开(公告)号：US20070136394A1

公开(公告)日：2007-06-14

申请号：US11297676

申请日：2005-12-08

Applicant: Scott Cowan ,  Kim Letkeman ,  Mohammed Mostafa

Inventor： Scott Cowan ,  Kim Letkeman ,  Mohammed Mostafa

IPC: G06F17/30

CPC classification number: G06F8/71 ,  G06F17/2288

Abstract: Embodiments of the present invention address deficiencies of the art in respect to merging artifacts in a version control system and provide a novel and non-obvious method, system and computer program product for compositing deltas when merging artifacts in a version control system. In one embodiment, a method for compositing deltas for artifacts can be provided. The method can include generating deltas for a contributor artifact of an ancestor artifact, identifying interrelated ones of the deltas and grouping the interrelated ones of the deltas into a composited set of deltas. The method further can include rendering the composited set of deltas in a hierarchical view of a compare view for a version control data processing system in a development platform.

Abstract translation: 本发明的实施例解决了在版本控制系统中合并工件方面的技术缺陷，并提供了一种新颖且不显眼的方法，系统和计算机程序产品，用于在版本控制系统中合并工件时合成三角形。 在一个实施例中，可以提供用于合成伪影的三角形的方法。 该方法可以包括生成祖先工件的贡献者工件的三角形，识别三角形中的相互关联的三角形，并将三角形中的相关联的三角形分组成三角形组合。 该方法还可以包括在开发平台中的版本控制数据处理系统的比较视图的分层视图中呈现合成的三角形组。

公开(公告)号：US20120110549A1

公开(公告)日：2012-05-03

申请号：US13154210

申请日：2011-06-06

Applicant: Steven John Earl Gutz ,  Thomas Anthony MacDougall ,  Mohammed Mostafa

Inventor： Steven John Earl Gutz ,  Thomas Anthony MacDougall ,  Mohammed Mostafa

IPC: G06F9/44

CPC classification number: G06F11/3604 ,  G06F8/75

Abstract: An illustrative embodiment of a computer-implemented process for detecting code breakage using source code change history receives a point in time within an identified range of time to form a selected time, receives a set of source files associated with the a selected time, receives a set of history files associated with the received set of source files and initializes a workspace in a sandbox using the set of source files and the set of history files. The computer-implemented process incrementally executes the received set of source files from the selected time forward, determines whether a code break occurs and responsive to a determination that the code break occurs, presents a list of files. The computer-implemented process receives an identified file from the list of files to form a suspect file, and receives a correction for the suspect file.

Abstract translation: 用于使用源代码改变历史检测代码破坏的计算机实现的过程的说明性实施例接收在所识别的时间范围内的时间点以形成所选择的时间，接收与所选择的时间相关联的一组源文件， 与所接收的源文件集相关联的历史文件集，并使用源文件集和历史文件集在沙盒中初始化工作空间。 计算机实现的过程从所选择的时间向前递增地执行所接收的源文件集合，确定是否发生代码中断并响应于发生代码中断的确定，呈现文件列表。 计算机实现的过程从文件列表接收识别的文件以形成可疑文件，并且接收可疑文件的修正。

公开(公告)号：US20060117075A1

公开(公告)日：2006-06-01

申请号：US11000744

申请日：2004-12-01

Applicant: Scott Cowan ,  Mohammed Mostafa ,  Frederic Plante

Inventor： Scott Cowan ,  Mohammed Mostafa ,  Frederic Plante

IPC: G06F17/30

CPC classification number: G06F17/2211 ,  G06F8/71 ,  G06F17/2288

Abstract: A method of merging a plurality of different versions of an electronic document during a software development process can include identifying the plurality of different versions of the electronic document. The electronic document can have a defined structure. The method further can include determining a plurality of deltas between the different versions and determining relationships, between individual ones of the plurality of deltas according to the defined structure of the electronic document. One or more of the plurality of deltas can be selectively accepted in a merged electronic document according to the determined relationships.

Abstract translation: 在软件开发过程中合并电子文档的多个不同版本的方法可以包括识别电子文档的多个不同版本。 电子文档可以具有定义的结构。 该方法还可以包括根据电子文档的定义的结构来确定不同版本之间的多个三角形并确定多个三角形中的各个之间的关系。 可以根据确定的关系在合并的电子文档中选择性地接受多个三角形中的一个或多个。

公开(公告)号：US20070143680A1

公开(公告)日：2007-06-21

申请号：US11313903

申请日：2005-12-21

Applicant: Scott Cowan ,  Kim Letkeman ,  Mohammed Mostafa ,  Frederic Plante ,  Vishwanath Ramaswamy

Inventor： Scott Cowan ,  Kim Letkeman ,  Mohammed Mostafa ,  Frederic Plante ,  Vishwanath Ramaswamy

IPC: G06F3/00

CPC classification number: G06F8/71 ,  G06F3/048 ,  G06F8/34 ,  G06F17/2288 ,  G06F17/241 ,  G06F17/30309 ,  G06Q10/107 ,  Y10S707/99952 ,  Y10S707/99954 ,  Y10S715/971

Abstract: Embodiments of the present invention address deficiencies of the art in respect to comparing artifacts and provide a novel and non-obvious method, system and computer program product for multi-contextual navigation of deltas in a hierarchy. In one embodiment of the invention, a method for multi-contextual navigation can include rendering objects for an artifact utilizing a default contextual view of the objects, selecting an object in the default contextual view and directing an inward navigation to a different object in the default contextual view. Notably, responsive to the directing of the inward navigation to the different object, a different contextual view can be provided for at least a portion of the objects defined by the different object.

Abstract translation: 本发明的实施例解决了本领域在比较伪像方面的缺陷，并且提供了一种用于层次结构中三角形的多上下文导航的新颖且非显而易见的方法，系统和计算机程序产品。 在本发明的一个实施例中，用于多上下文导航的方法可以包括使用对象的默认上下文视图为工件渲染对象，在默认上下文视图中选择对象，并将内向导航指向默认的不同对象 语境视图。 值得注意的是，响应于向内导航到不同对象的引导，可以为由不同对象定义的对象的至少一部分提供不同的上下文视图。

公开(公告)号：US09727436B2

公开(公告)日：2017-08-08

申请号：US11968351

申请日：2008-01-02

Applicant: Mohammed Mostafa

Inventor： Mohammed Mostafa

IPC: G06F9/44 ,  G06F11/30 ,  G06F11/34 ,  G06F9/455 ,  G06F11/36

CPC classification number: G06F11/3089 ,  G06F9/45504 ,  G06F11/301 ,  G06F11/3037 ,  G06F11/3409 ,  G06F11/3419 ,  G06F11/3438 ,  G06F11/3466 ,  G06F11/3476 ,  G06F11/3612 ,  G06F2201/815 ,  G06F2201/865 ,  G06F2201/88

Abstract: The present invention discloses a solution for adding a profiling agent to a virtual machine (VM), which permits unit test programs to access information relating to memory and performance from runtime data areas of the VM. Operations permitted by the agent can include starting/stopping VM monitor, getting objects from the heap, retrieving an invocation count, determining a size of an instantiated object, getting a current thread time, and the like. Memory and performance information gathered during a test can be stored for later analysis under a test version identifier. A comparison engine can create reports that use the stored performance and memory data, which can help developers compare memory/performance deltas among different unit versions. In one embodiment, the VM can be a JAVA VIRTUAL MACHINE (JVM) and the unit test programs can be JUNIT programs.

公开(公告)号：US08751542B2

公开(公告)日：2014-06-10

申请号：US13168537

申请日：2011-06-24

Applicant: Mohammed Mostafa ,  Graham A. Watts

Inventor： Mohammed Mostafa ,  Graham A. Watts

IPC: G06F17/30

CPC classification number: G06F17/30324 ,  G06T9/00

Abstract: The present disclosure includes techniques for storing indexed values that may increase computing performance. In one example, a method includes receiving a request to store an input value in a data structure. The method also includes determining the input value is not represented by an index value of the first group of index values, generating an index value that represents the input value, and determining the generated index value is not included in the first group of representations. The method also includes generating a second group of index values wherein a first size of index values of the first group is different than a second size of index values of the second group. The method also includes modifying a storage capacity of the data structure to store the index values of the second group of the second size and storing the second group of index values in the data structure.

Abstract translation: 本公开包括用于存储可以增加计算性能的索引值的技术。 在一个示例中，一种方法包括接收在数据结构中存储输入值的请求。 该方法还包括确定输入值不由第一组索引值的索引值表示，生成表示输入值的索引值，并且确定所生成的索引值不包括在第一组表示中。 该方法还包括生成第二组索引值，其中第一组的索引值的第一大小不同于第二组的索引值的第二大小。 该方法还包括修改数据结构的存储容量以存储第二大小的第二组的索引值，并将第二组索引值存储在数据结构中。

公开(公告)号：US20120327097A1

公开(公告)日：2012-12-27

申请号：US13168537

申请日：2011-06-24

Applicant: Mohammed Mostafa ,  Graham A. Watts

Inventor： Mohammed Mostafa ,  Graham A. Watts

IPC: G06T9/00

CPC classification number: G06F17/30324 ,  G06T9/00

Abstract: The present disclosure includes techniques for storing indexed values that may increase computing performance. In one example, a method includes receiving a request to store an input value in a data structure. The method also includes determining the input value is not represented by an index value of the first group of index values, generating an index value that represents the input value, and determining the generated index value is not included in the first group of representations. The method also includes generating a second group of index values wherein a first size of index values of the first group is different than a second size of index values of the second group. The method also includes modifying a storage capacity of the data structure to store the index values of the second group of the second size and storing the second group of index values in the data structure.

Abstract translation: 本公开包括用于存储可以增加计算性能的索引值的技术。 在一个示例中，一种方法包括接收在数据结构中存储输入值的请求。 该方法还包括确定输入值不由第一组索引值的索引值表示，生成表示输入值的索引值，并且确定所生成的索引值不包括在第一组表示中。 该方法还包括生成第二组索引值，其中第一组的索引值的第一大小不同于第二组的索引值的第二大小。 该方法还包括修改数据结构的存储容量以存储第二大小的第二组的索引值，并将第二组索引值存储在数据结构中。

公开(公告)号：US09342493B2

公开(公告)日：2016-05-17

申请号：US13368029

申请日：2012-02-07

Applicant: Thomas A. MacDougall ,  Mohammed Mostafa

Inventor： Thomas A. MacDougall ,  Mohammed Mostafa

IPC: G06F17/00 ,  G06F17/24

CPC classification number: G06F17/24 ,  G06F17/241

Abstract: An example method includes receiving a first input indicating user activity at a first position in a document in a document editing application. The document editing application is navigable among different partial views of the document. The document editing application displays a frame element that indicates a position of a presently displayed partial view of the document is with reference to an entirety of the document. The method further includes displaying, in response to the first input indicating user activity, a first marker, in or proximate to the frame element, indicating where the first position of user activity is located with reference to the entirety of the document.

Abstract translation: 示例性方法包括在文档编辑应用中的文档的第一位置处接收指示用户活动的第一输入。 文档编辑应用程序可以在文档的不同部分视图之间导航。 文档编辑应用程序显示一个帧元素，该帧元素指示文档的当前显示的部分视图的位置是参考文档的整体。 所述方法还包括：响应于指示用户活动的第一输入，在参考所述文档的全部的情况下，显示在所述帧元素中或其附近的第一标记，指示用户活动的第一位置在哪里所在的位置。

公开(公告)号：US08793673B2

公开(公告)日：2014-07-29

申请号：US12917677

申请日：2010-11-02

Applicant: Steven J. Gutz ,  Mohammed Mostafa ,  Joshua P. Tessier

Inventor： Steven J. Gutz ,  Mohammed Mostafa ,  Joshua P. Tessier

IPC: G06F9/44

CPC classification number: G06F8/433

Abstract: An illustrative embodiment provides a computer-implemented process for algorithm complexity identification through inter-procedural data flow analysis receives a call graph to form a set of received nodes in a static analysis framework, identifies a parent node in the set of received nodes to form an identified parent, traverses the call graph from the identified parent node to a node to identify a function within the node to form an identified function. Each identified function is analyzed to form a complexity value in a set of complexity values. Responsive to a determination that node analysis is complete, and responsive to a determination that path analysis is complete, determines whether path analysis for the identified parent is complete. Responsive to a determination that path analysis for the identified parent is complete, sum the complexity values in the set of complexity values for the identified parent and return the complexity value for the identified parent to a requester.

Abstract translation: 说明性实施例提供了一种用于算法复杂度识别的计算机实现的过程，其通过程序间数据流分析接收呼叫图，以在静态分析框架中形成一组接收到的节点，识别所接收节点集合中的父节点，以形成 识别的父节点，从所识别的父节点遍历呼叫图形到节点以识别节点内的功能以形成识别的功能。 分析每个识别的功能以在一组复杂度值中形成复杂度值。 响应于确定节点分析完成，并且响应于路径分析完成的确定，确定所识别的父节点的路径分析是否完整。 响应于确定所识别的父项的路径分析是否完整，将所识别的父代的复杂度值集合中的复杂度值求和，并将所识别的父节点的复杂度值返回给请求者。