会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 36. 发明授权
    • System and method for multi-channel communication queuing using routing and escalation rules
    • 使用路由和升级规则进行多通道通信排队的系统和方法
    • US07308093B2
    • 2007-12-11
    • US11515604
    • 2006-09-05
    • Anil Kumar AnnadataWai Hong PakRohit Bedi
    • Anil Kumar AnnadataWai Hong PakRohit Bedi
    • H04M3/00
    • H04M3/523
    • A system, apparatus, and method for routing work items to agents, wherein the work items can be of one of two or more different communication media types from one of two or more different communication channels. A queuing engine includes a list of routes and each route is associated with one or more properties. The list of routes can further include information related to one or more escalation rules for each route; the type of communication media available along the route for handling one or more of the work items; whether the route is active; the priority of the route; whether work items can be handled real-time; the service level for work items handled on the route; and the number of work items that can be assigned to the route. The queuing engine determines various properties required to handle each work item, such as the communication media type, agent language and skill level, and the category and recipient of the work item, and assigns each work item to one of the one or more agents based on one or more of the properties. When the queuing engine determines that a work item has been waiting a predetermined amount of time to be assigned to an agent, the queuing engine can escalate the search for an agent to handle the work item based on the escalation rules. The queuing engine can also substitute values for variables in the routing and escalation rules, thereby reducing the number of rules that must be entered to achieve the same routing capability.
    • 一种用于将工作项路由到代理路由的系统,装置和方法,其中所述工作项可以是来自两个或更多个不同通信信道中的一个的两个或多个不同的通信媒体类型中的一个。 排队引擎包括路由列表,每个路由与一个或多个属性相关联。 路线列表还可以包括与每个路线的一个或多个升级规则有关的信息; 沿着路线可用于处理一个或多个工作项目的通信媒体的类型; 路线是否活跃; 路由的优先级; 是否可以实时处理工作项目; 路线上处理的工作项目的服务水平; 以及可以分配给路由的工作项的数量。 排队引擎确定处理每个工作项目所需的各种属性,例如通信媒体类型,代理语言和技能级别以及工作项目的类别和收件人,并将每个工作项目分配给一个或多个代理程序中的一个 在一个或多个属性上。 当排队引擎确定工作项目已经等待预定时间量被分配给代理时,排队引擎可以基于升级规则升级搜索代理以处理工作项目。 排队引擎还可以在路由和升级规则中替换变量的值,从而减少必须输入的规则数量以实现相同的路由功能。
    • 38. 发明授权
    • Method and system for tracking and exchanging incremental changes to hierarchical objects
    • 用于跟踪和交换层次化对象的增量更改的方法和系统
    • US07287249B2
    • 2007-10-23
    • US10299211
    • 2002-11-18
    • Mark S. CoyleJeffrey Michael FischerMin LuShuang HuangAlexander S. Warshavsky
    • Mark S. CoyleJeffrey Michael FischerMin LuShuang HuangAlexander S. Warshavsky
    • G06F9/44
    • G06F17/30348G06F17/30607Y10S707/99953
    • Techniques to track and publish changes to object instances. For an “outbound process” to publish object instances, a list of object instances is initially received. For each received object instance, a determination is made whether or not the object instance has changed since its last publication. For each changed object instance, a delta snapshot is generated and includes data indicative of changes between the current and last published versions of the object instance. Delta snapshots for all changed object instances are then published. For an “inbound process” to receive object instances, the published delta snapshots are initially received. For each received delta snapshot, the corresponding object instance is retrieved and updated with the changes included in the delta snapshot. A new snapshot is also generated for each updated object instance such that the received changes are not published, and unpublished changes made locally are noted for subsequent publication.
    • 跟踪和发布对象实例更改的技术。 对于发布对象实例的“出站进程”,最初收到对象实例的列表。 对于每个接收的对象实例,确定对象实例自上次发布以来是否已更改。 对于每个更改的对象实例,生成增量快照,并包括指示对象实例的当前和最后发布版本之间的更改的数据。 然后发布所有更改的对象实例的Delta快照。 对于接收对象实例的“入站进程”,最初收到发布的增量快照。 对于每个接收的增量快照,将使用增量快照中包含的更改来检索和更新相应的对象实例。 还为每个更新的对象实例生成一个新的快照,以便接收到的更改不会被发布,并且本地注释的未发布的更改被注明用于后续发布。
    • 39. 发明申请
    • Detecting and processing cache hits for queries with aggregates
    • 检测和处理具有聚合的查询的缓存命中
    • US20070208690A1
    • 2007-09-06
    • US10186344
    • 2002-06-27
    • Donovan SchneiderEdward SuenKazi Zaman
    • Donovan SchneiderEdward SuenKazi Zaman
    • G06F17/30
    • G06F17/30483Y10S707/99932Y10S707/99933Y10S707/99934Y10S707/99935Y10S707/99936
    • Techniques to improve query caching performance by efficiently selecting queries stored in a cache for evaluation and increasing the cache hit rate by allowing for inexact matches. A list of candidate queries stored in the cache that potentially could be used to answer a new query is first determined. This list may include all cached queries, cached queries containing exact matches for select list items, or cached queries containing exact and/or inexact matches. Each of at least one candidate query is then evaluated to determine whether or not there is a cache hit, which indicates that the candidate query could be used to answer the new query. The evaluation is performed using a set of rules that allows for inexact matches of aggregates, if any, in the new query. A query plan is generated for the new query based on a specific candidate query with a cache hit.
    • 通过有效地选择存储在缓存中的查询来进行评估来提高查询缓存性能的技术,通过允许不精确的匹配来提高缓存命中率。 首先确定存储在缓存中的潜在可能用于回答新查询的候选查询的列表。 此列表可能包括所有缓存的查询,包含精选列表项的精确匹配的缓存查询,或包含精确和/或不精确匹配的缓存查询。 然后评估至少一个候选查询中的每一个以确定是否存在高速缓存命中,其指示候选查询可以用于回答新查询。 评估是使用一组规则执行的,这些规则允许在新查询中聚合的不精确匹配(如果有)。 基于具有高速缓存命中的特定候选查询,为新查询生成查询计划。
    • 40. 发明申请
    • Method and system for scheduling activities
    • 调度活动的方法和系统
    • US20070208604A1
    • 2007-09-06
    • US10112913
    • 2002-03-28
    • Atul PurohitHarish BansalJun WangPraveen KrishnanChristopher Nash
    • Atul PurohitHarish BansalJun WangPraveen KrishnanChristopher Nash
    • G06F15/02
    • G06Q10/109G06Q10/06375G06Q10/1095
    • Techniques to schedule activities. In one method, a request to book an appointment for an activity in a particular schedule is initially received. In response, time slots available in the schedule for booking the activity are determined, and a set (all or a subset) of the time slots is provided as possible appointment choices. The time slots in the set are temporarily locked. A next set of time slots or more time slots may be requested (if the time slots provided are not acceptable or desirable), in which case additional time slots may be provided. Thereafter, a selection for one of the time slots is received. In response, the activity is booked in the selected time slot and previously locked time slots are released. The locked time slots may also be released if no selection is received after a particular amount of time.
    • 安排活动的技巧 在一种方法中,初始接收到针对特定时间表中的活动预约的请求。 作为响应,确定用于预订活动的时间表中可用的时隙,并且提供时隙的集合(全部或一个子集)作为可能的约会选择。 集合中的时隙被暂时锁定。 可以请求下一组时隙或更多时隙(如果所提供的时隙不可接受或期望),在这种情况下可以提供额外的时隙。 此后,接收对时隙之一的选择。 作为响应,活动在所选择的时隙中预订,并且先前锁定的时隙被释放。 如果在特定时间量之后没有接收到选择,锁定的时隙也可以被释放。