会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • Autonomic workload classification using predictive assertion for wait queue and thread pool selection
    • 自动工作负载分类,使用等待队列和线程池选择的预测性断言
    • US20050183084A1
    • 2005-08-18
    • US10778584
    • 2004-02-13
    • Gennaro CuomoErik Daughtrey
    • Gennaro CuomoErik Daughtrey
    • G06F9/46
    • G06F9/505
    • Incoming work units (e.g., requests) in a computing workload are analyzed and classified according to predicted execution. Preferred embodiments track which instrumented wait points are encountered by the executing work units, and this information is analyzed to dynamically and autonomically create one or more recognizers to programmatically recognize similar, subsequently-received work units. When a work unit is recognized, its execution behavior is then predicted. Execution resources are then allocated to the work units in view of these predictions. The recognizers may be autonomically evaluated or tuned, thereby adjusting to changing workload characteristics. The disclosed techniques may be used advantageously in application servers, message-processing software, and so forth.
    • 计算工作负载中的传入工作单元(例如,请求)根据预测的执行情况进行分析和分类。 优选实施例跟踪执行工作单元遇到哪些仪器化等待点,并且分析该信息以动态地和自动地创建一个或多个识别器以编程地识别相似的随后接收的工作单元。 当工作单元被识别时,其执行行为被预测。 鉴于这些预测,执行资源被分配给工作单位。 可以自动评估或调整识别器,从而适应不断变化的工作负载特性。 所公开的技术可以有利地用于应用服务器,消息处理软件等。
    • 8. 发明申请
    • Mapping of a color to a treemap
    • 将颜色映射到树形图
    • US20060082592A1
    • 2006-04-20
    • US10968235
    • 2004-10-19
    • Elizabeth Black-ZiegelbeinGennaro CuomoMarc HaberkornBarton Vashaw
    • Elizabeth Black-ZiegelbeinGennaro CuomoMarc HaberkornBarton Vashaw
    • G09G5/02
    • G06T11/206
    • The inventive process comprises and improved process for displaying hierarchical information in a treemap by associating a different color with each nested treemap in a parent treemap, and generating a gradient for each color to preserve the representative value of varying shades. In general, a user divides the hierarchical information into clusters of nodes, designates a primary weight and a secondary weight for each cluster, and designates a base color for each cluster. The inventive process then divides the range of each cluster's secondary weight into bins, adjusts each cluster's base color to create a distinguishing gradient of the base color, assigns a distinguishing gradient to each bin, and draws a nested treemap for each cluster so that each nested treemap has a cluster's base color and each node in the cluster is represented by a bounding box having a distinct gradient of the cluster's base color.
    • 本发明的方法包括并改进了通过将不同颜色与母版图中的每个嵌套树图相关联并且为每种颜色生成渐变以保持不同色调的代表值来显示树状图中的层次信息的过程。 通常,用户将分层信息划分为节点簇,指定每个群集的主权重和次权重,并为每个群集指定基本颜色。 本发明的过程然后将每个聚类的次要重量的范围划分为箱体,调整每个群集的基本颜色以创建基本颜色的区别梯度,为每个仓分配一个区别梯度,并为每个群集绘制嵌套的树状图,以便每个嵌套 treemap具有集群的基本颜色,并且集群中的每个节点由具有集群基本颜色的不同梯度的边界框表示。
    • 9. 发明申请
    • Facilitating optimization of response time in computer networks
    • 促进计算机网络响应时间的优化
    • US20060085541A1
    • 2006-04-20
    • US10968015
    • 2004-10-19
    • Gennaro CuomoThomas GisselHarvey GuntherBarton Vashaw
    • Gennaro CuomoThomas GisselHarvey GuntherBarton Vashaw
    • G06F15/173
    • H04L41/0896H04L41/083H04L69/04H04L69/24
    • A system and method are disclosed for leveraging bandwidth and processor utilization to advantageously influence response time performance. The objective of such leveraging is to maximize transaction throughput (e.g., requests per second) between a pair of servers when the servers are connected through less than optimal networks and/or network connections. Such an optimization is accomplished by determining whether or not adjusting request and/or reply sizes by applying a compression factor (i.e., to facilitate compression) will have a desirable influence on response time performance. Such determination is based on decision criteria including, but are not limited to, network protocol performance, CPU utilization, bandwidth utilization, and estimates of the CPU time and network time costs of sending compressed verses uncompressed data.
    • 公开了一种用于利用带宽和处理器利用率来有利地影响响应时间性能的系统和方法。 这种杠杆化的目标是当服务器通过不太优化的网络和/或网络连接连接时,在一对服务器之间最大化事务吞吐量(例如,每秒请求)。 通过确定通过应用压缩因子(即,有利于压缩)来调整请求和/或应答大小是否对响应时间性能具有期望的影响来实现这样的优化。 这种确定基于决策标准,包括但不限于网络协议性能,CPU利用率,带宽利用率,以及发送压缩经编压缩数据的CPU时间和网络时间成本的估计。
    • 10. 发明授权
    • Location based wireless tower caching
    • 基于位置的无线塔式缓存
    • US08843160B2
    • 2014-09-23
    • US12977980
    • 2010-12-23
    • Erik J. BurckartGennaro CuomoAndrew J. IvoryVictor S. MooreAaron K. Shook
    • Erik J. BurckartGennaro CuomoAndrew J. IvoryVictor S. MooreAaron K. Shook
    • H04W24/00H04W4/02H04L29/08H04W88/08
    • H04W4/02H04L67/2842H04W88/08
    • Embodiments of the present invention provide a method, system and computer program product for wireless tower caching. In an embodiment of the invention, a method for wireless tower caching in a radio access network (RAN) can include receiving a response to a request from an end user device wirelessly coupled to a base station of the RAN, determining geographic positioning data for the response and identifying a most geographically wireless tower coupled to the RAN relative to the determined geographic positioning data (such as the closest wireless tower to the determined geographic positioning data). Thereafter, the response can be cached at a cache in a base station of the identified wireless tower. In this way, the cached content can remain relevant for a significant period of time in as much as the correlation between a likely position of the end user device and the content cached at the base station of the wireless tower at the time of use of the cached content is strong.
    • 本发明的实施例提供了一种用于无线塔式缓存的方法,系统和计算机程序产品。 在本发明的一个实施例中,用于无线电接入网络(RAN)中的无线塔式高速缓存的方法可以包括:接收来自无线耦合到RAN基站的终端用户设备的请求的响应,确定用于 响应并识别相对于所确定的地理定位数据(诸如到确定的地理定位数据的最接近的无线塔)而耦合到RAN的大多数地理无线塔。 此后,该响应可被缓存在所识别的无线塔的基站中的高速缓存上。 以这种方式,缓存的内容可以在相当长的时间内保持相关性,只要最终用户设备的可能位置与在使用无线电塔的无线塔的基站处高速缓存的内容之间的相关性 缓存的内容很强。