-
1.发明申请Methods and systems of testing software, and methods and systems of modeling user behavior 有权测试软件的方法和系统，以及用户行为建模的方法和系统公开(公告)号：US20050268287A1
公开(公告)日：2005-12-01
申请号：US11188606
申请日：2005-07-25
CPC分类号： G06F11/3688
摘要： Methods and systems of testing software and modeling user actions are described. In some embodiments, multiple different algorithms are provided for operating on a software model. The software model describes behavior associated with software that is to be tested. Different sets of algorithms can be selected for operating on the software model to produce a sequence of test actions that are to be used to test the software. The algorithms can be mixed and matched to achieve a desired testing result. In some embodiments, the different algorithms comprise deterministic algorithms, random algorithms, and various types of algorithms therebetween. In one embodiment, the software model comprises a state graph having nodes that represent state, and links between the nodes that represent actions. The different algorithms that are available for selection can have different graph traversal characteristics such that the state graph can be traversed in different manners. For example, algorithms that are more local in their traversals can be teamed with algorithms that are more global in their traversals, thus covering a wider area of the state space with good local coverage in some areas.
摘要翻译： 描述测试软件和建模用户动作的方法和系统。 在一些实施例中，提供了用于在软件模型上操作的多种不同的算法。 软件模型描述与要测试的软件相关的行为。 可以选择不同的算法集来在软件模型上操作以产生用于测试软件的测试动作序列。 可以混合和匹配算法以实现所需的测试结果。 在一些实施例中，不同的算法包括确定性算法，随机算法以及它们之间的各种类型的算法。 在一个实施例中，软件模型包括具有表示状态的节点和表示动作的节点之间的链接的状态图。 可用于选择的不同算法可以具有不同的图遍历特性，使得可以以不同的方式遍历状态图。 例如，在遍历中更本地化的算法可以与在遍历中更全局化的算法相结合，从而在某些区域覆盖了更广泛的状态空间区域，具有良好的本地覆盖。
-
2.发明申请公开(公告)号：US20050273767A1
公开(公告)日：2005-12-08
申请号：US11188618
申请日：2005-07-25
CPC分类号： G06F11/3688
摘要： Methods and systems of testing software and modeling user actions are described. In some embodiments, multiple different algorithms are provided for operating on a software model. The software model describes behavior associated with software that is to be tested. Different sets of algorithms can be selected for operating on the software model to produce a sequence of test actions that are to be used to test the software. The algorithms can be mixed and matched to achieve a desired testing result. In some embodiments, the different algorithms comprise deterministic algorithms, random algorithms, and various types of algorithms therebetween. In one embodiment, the software model comprises a state graph having nodes that represent state, and links between the nodes that represent actions. The different algorithms that are available for selection can have different graph traversal characteristics such that the state graph can be traversed in different manners. For example, algorithms that are more local in their traversals can be teamed with algorithms that are more global in their traversals, thus covering a wider area of the state space with good local coverage in some areas.
-
公开(公告)号：US20190332615A1
公开(公告)日：2019-10-31
申请号：US16509360
申请日：2019-07-11
申请人： Dimitris Achlioptas
发明人： Dimitris Achlioptas
IPC分类号： G06F16/29 , G06F16/487 , H04L12/58 , G06F16/245 , H04L29/08 , H04W4/029 , G06F16/48
摘要： The present innovation provides a method of establishing a connection between two individuals using an interpersonal spacetime interaction system, including enabling a first user to specify a spacetime event and to provide annotations for the spacetime event, maintaining a spacetime database comprising data objects, each data object corresponding to a spacetime event, querying a spacetime database, using a query that includes at least a specification of a desired spacetime event, said query being initiated by a second user, retrieving information from those data objects in the spacetime database whose corresponding spacetime events are proximate to the desired spacetime event, and providing the retrieved information to the second user.
-
公开(公告)号：US09158774B2
公开(公告)日：2015-10-13
申请号：US13063304
申请日：2009-09-14
申请人： Dimitris Achlioptas
发明人： Dimitris Achlioptas
CPC分类号： G06F17/30241 , G06F17/30041 , G06F17/30044 , G06F17/30424 , H04L51/14 , H04L51/38 , H04L67/18 , H04L67/22 , H04L67/24 , H04L67/306 , H04W4/02 , H04W4/029
摘要： The present innovation provides a method of establishing a connection between two individuals using an interpersonal spacetime interaction system, including enabling a first user to specify a spacetime event and to provide annotations for the spacetime event, maintaining a spacetime database comprising data objects, each data object corresponding to a spacetime event, querying a spacetime database, using a query that includes at least a specification of a desired spacetime event, said query being initiated by a second user, retrieving information from those data objects in the spacetime database whose corresponding spacetime events are proximate to the desired spacetime event, and providing the retrieved information to the second user.
摘要翻译： 本发明提供了一种使用人际时空交互系统建立两个人之间的连接的方法，包括使得第一用户能够指定时空事件并为时空事件提供注释，维护包括数据对象的时空数据库，每个数据对象 对应于时空事件，查询时空数据库，使用至少包括期望的时空事件的指定的查询，所述查询由第二用户发起，从时间数据库中的对应的时空事件是的那些数据对象检索信息 接近期望的时空事件，并且将检索到的信息提供给第二用户。
-
5.发明申请公开(公告)号：US20100149966A1
公开(公告)日：2010-06-17
申请号：US12708677
申请日：2010-02-19
申请人： Dimitris Achlioptas , Sean B. House
发明人： Dimitris Achlioptas , Sean B. House
CPC分类号： H04L67/1008 , H04L45/745 , H04L67/1002 , H04L67/1023 , H04L67/14
摘要： The invention relates to an architecture that facilitates load balancing among a plurality of hosts and preserve session affinity to a given host. An incoming stream of data packets that include packet sessions is input to one or more forwarding mechanisms for forwarding to one or more hosts. The forwarders generate a routing function that takes into consideration host availability, and distributes session packets according to the routing function. A session is distributed to the same host to preserve session affinity. When host availability changes, a new routing function is generated, such that any new session is routed according to the new routing function and existing sessions are routed according to the old routing function. When the old routing function becomes irrelevant, it is phased out. An optimization utilizes a maximally backward compatible hash function to minimize the differences between the old and new routing functions.
摘要翻译： 本发明涉及一种便于多个主机之间的负载平衡并保持对给定主机的会话亲和性的架构。 包括数据包会话的数据包的输入流被输入到一个或多个转发机制以转发到一个或多个主机。 转发器产生考虑主机可用性的路由功能，并根据路由功能分配会话数据包。 会话分发给同一主机以保持会话亲和性。 当主机可用性发生变化时，会生成新的路由功能，以便根据新路由功能路由所有新会话，并根据旧路由功能路由现有会话。 当旧的路由功能变得无关时，它被淘汰。 优化利用最大向后兼容的散列函数来最小化旧路由功能和新路由功能之间的差异。
-
公开(公告)号：US07668957B2
公开(公告)日：2010-02-23
申请号：US10882020
申请日：2004-06-30
IPC分类号： G06F15/16 , G06F15/173
CPC分类号： G06Q10/107 , G06Q30/02
摘要： The present invention provides a unique system and method that facilitates reducing network traffic between a plurality of servers located on a social-based network. The system and method involve identifying a plurality of vertices or service users on the network with respect to their server or network locations. The vertices' contacts or connections can be located or determined as well. In order to minimize communication traffic, the vertices and their connections with respect to their respective server locations can be analyzed to determine whether at least a subset of nodes should be moved or relocated to another server to facilitate mitigating network traffic while balancing user load among the various servers or parts of the network. Thus, an underlying social network can be effectively partitioned. In addition, the network can be parsed into a collection of nested layers, whereby each successively less dense layer can be partitioned with respect to the previous (partitioned) more dense layer.
摘要翻译： 本发明提供了一种有助于减少位于社交网络上的多个服务器之间的网络流量的唯一系统和方法。 该系统和方法包括相对于其服务器或网络位置来识别网络上的多个顶点或服务用户。 顶点的触点或连接也可以定位或确定。 为了最小化通信流量，可以分析顶点及其相对于它们各自的服务器位置的连接，以确定是否应该将至少一个节点的子集移动或重新定位到另一个服务器以便于减轻网络流量，同时平衡用户负载 各种服务器或网络的部分。 因此，潜在的社会网络可以被有效地分割。 此外，网络可以被解析成嵌套层的集合，由此可以相对于先前的（分割的）更致密的层来分隔每个连续的较低致密层。
-
公开(公告)号：US20070011109A1
公开(公告)日：2007-01-11
申请号：US11159626
申请日：2005-06-23
申请人： Andrew Wilson , Eric Horvitz , Dimitris Achlioptas
发明人： Andrew Wilson , Eric Horvitz , Dimitris Achlioptas
IPC分类号： G06F17/00
CPC分类号： G06Q90/00
摘要： Immortal information storage is leveraged to provide an interactive means to retrieve information associated with a physical artifact. The information persists for a substantial portion of the life of the artifact. This allows users to interact with an artifact that symbolically represents an entity, where the entity can be an organic and/or non-organic entity. A physical artifact that symbolically represents a person, animal, or a structure can be utilized. The storage system can contain easy to discover information about building a decoder or providing power and interpreting the information stored therein. A personalized interaction model can also be utilized to facilitate in providing an interactive model that responds to user queries in a fashion characteristic of the entity. Access to the immortalized information can be controlled by identity of entity seeking access, the amount of time that has passed, or events that have occurred. Power for facilitating retrieval of the information can be from thermal, induction, acoustical, and/or light-based sources. A separate User Interface (UI)/Reader can also be employed to inductively provide power to interact with the immortal information and to provide an interface for the user.
摘要翻译： 不朽的信息存储被用来提供一种交互式的方法来检索与物理工件相关联的信息。 这些信息在人造物的大部分时间里仍然存在。 这允许用户与符号表示实体的工件交互，其中实体可以是有机和/或非有机实体。 可以利用象征性地代表人，动物或结构的物理工件。 存储系统可以容易地发现关于构建解码器或提供电力并解释存储在其中的信息的信息。 还可以利用个性化交互模型来促进提供以实体的时尚特征响应用户查询的交互模型。 访问永生化信息可以通过寻求访问的实体的身份，已经过去的时间量或发生的事件来控制。 用于促进信息检索的功能可以来自热，感应，声学和/或光源。 还可以使用单独的用户界面（UI）/阅读器来感应地提供与不朽信息交互的能力并为用户提供接口。
-
公开(公告)号：US09367850B2
公开(公告)日：2016-06-14
申请号：US12347237
申请日：2008-12-31
申请人： Dimitris Achlioptas
发明人： Dimitris Achlioptas
CPC分类号： G06Q30/02
摘要： The present invention provides for systems and methods that facilitate conveying user information between and among users effectively to thereby create a collaborative filtering environment with maintained user privacy. More specifically, the present invention allows user-profile building to occur coincident with user-browsing, for example. This can be accomplished in part by incorporating an input component on the user interface used for browsing and/or searching. A user who has opted-in to construct a personal profile makes declarations regarding his relationship with at least a portion of the information being currently viewed. The declarations are annotated to the user's profile. At the user's discretion, the user's profile can be disseminated to others in whole or in part such that other people can make use of the user's expertise, experience or opinions. In addition, the user profiles can be machine-readable and searchable.
摘要翻译： 本发明提供了有助于有效地在用户之间和之间传送用户信息从而创建具有维护的用户隐私的协作过滤环境的系统和方法。 更具体地，例如，本发明允许用户简档构建与用户浏览重合。 这可以部分地通过在用于浏览和/或搜索的用户界面上结合输入组件来实现。 已选择加入个人资料的用户将声明与他正在查看的信息的至少一部分的关系。 声明注释到用户的配置文件。 用户可以自由地将用户的个人资料全部或部分传播给他人，以便其他人能够利用用户的专业知识，经验或意见。 此外，用户配置文件可以是机器可读和可搜索的。
-
9.发明授权公开(公告)号：US08335798B2
公开(公告)日：2012-12-18
申请号：US11257429
申请日：2005-10-24
申请人： Dimitris Achlioptas
发明人： Dimitris Achlioptas
IPC分类号： G06F17/30
CPC分类号： G06F17/30867 , Y10S707/99933
摘要： Systems and methods are provided that enable searches of social networks by acting as a “compass” that assists users in navigating the social network. Individual user participation is not required in response to queries from other users. The systems and methods offer navigational assistance or information as opposed to a traditional search which returns requested information, thus currently acceptable social mechanisms for arbitrating trust can be exploited. As a result, users do not make their personal information publicly searchable, while at the same time, they are protected from potential misrepresentations of facts.
摘要翻译： 提供了系统和方法，其可以通过作为帮助用户导航社交网络的指南针来搜索社交网络。 响应来自其他用户的查询，不需要个人用户参与。 系统和方法提供导航帮助或信息，而不是返回请求信息的传统搜索，因此可以利用可接受的仲裁信任的社会机制。 因此，用户不能将他们的个人信息公开搜索，同时保护他们免受事实潜在的错误陈述。
-
公开(公告)号：US07693050B2
公开(公告)日：2010-04-06
申请号：US11106080
申请日：2005-04-14
申请人： Dimitris Achlioptas , Sean B House
发明人： Dimitris Achlioptas , Sean B House
IPC分类号： H04L12/26
CPC分类号： H04L67/1008 , H04L45/745 , H04L67/1002 , H04L67/1023 , H04L67/14
摘要： The invention relates to an architecture that facilitates load balancing among a plurality of hosts and preserve session affinity to a given host. An incoming stream of data packets that include packet sessions is input to one or more forwarding mechanisms for forwarding to one or more hosts. The forwarders generate a routing function that takes into consideration host availability, and distributes session packets according to the routing function. A session is distributed to the same host to preserve session affinity. When host availability changes, a new routing function is generated, such that any new session is routed according to the new routing function and existing sessions are routed according to the old routing function. When the old routing function becomes irrelevant, it is phased out. An optimization utilizes a maximally backward compatible hash function to minimize the differences between the old and new routing functions.
摘要翻译： 本发明涉及一种便于多个主机之间的负载平衡并保持对给定主机的会话亲和性的架构。 包括数据包会话的数据包的输入流被输入到一个或多个转发机制以转发到一个或多个主机。 转发器产生考虑主机可用性的路由功能，并根据路由功能分配会话数据包。 会话分发给同一主机以保持会话亲和性。 当主机可用性发生变化时，会生成新的路由功能，以便根据新路由功能路由所有新会话，并根据旧路由功能路由现有会话。 当旧的路由功能变得无关时，它被淘汰。 优化利用最大向后兼容的散列函数来最小化旧路由功能和新路由功能之间的差异。
-
-
-
-
-
-
-
-
-
搜索结果
38 条记录 (耗时 0.029 秒)