会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Controlling communication between whitespace devices
    • 控制空白设备之间的通信
    • US09008710B2
    • 2015-04-14
    • US13523528
    • 2012-06-14
    • Malolan ChetlurHarish GanapathyShivkumar KalyanaramanMukundan Madhavan
    • Malolan ChetlurHarish GanapathyShivkumar KalyanaramanMukundan Madhavan
    • H04B7/00H04W16/14
    • H04W16/14
    • Methods, apparatuses, and computer program products for controlling communication between whitespace devices are provided. Embodiments include identifying, by a base-station array controller, a user whitespace device within a coverage area of a base-station array, wherein the base-station array includes a plurality of base-station whitespace devices of varying power consumption profiles; identifying for each base-station whitespace device, by the base-station array controller, transmission channels available to the base-station whitespace device; selecting from the plurality of base-station whitespace devices, by the base-station array controller, a base-station whitespace device based on the power consumption profiles and the identified available transmission channels corresponding to the plurality of base-station whitespace devices; and instructing, by the base-station array controller, the selected base-station whitespace device to communicate with the identified user whitespace device on one of the identified available transmission channels.
    • 提供了用于控制空白设备之间的通信的方法,设备和计算机程序产品。 实施例包括由基站阵列控制器识别基站阵列的覆盖区域内的用户空白设备,其中所述基站阵列包括具有变化的功耗简档的多个基站空白设备; 基站阵列控制器识别每个基站空白设备对基站空白设备可用的传输信道; 由基站阵列控制器从多个基站空白设备中选择一个基站空白设备,该基站空白设备基于与多个基站空白设备相对应的功耗简档和所识别的可用传输信道; 并且由所述基站阵列控制器指示所选择的基站空白设备在所识别的可用传输信道之一上与所识别的用户空白设备进行通信。
    • 6. 发明授权
    • Social network relationship mapping
    • 社交网络关系映射
    • US08977979B2
    • 2015-03-10
    • US12960726
    • 2010-12-06
    • Swaminathan BalasubramanianJohn H. Handy-BosmaBrian M. O'ConnellKeith R. Walker
    • Swaminathan BalasubramanianJohn H. Handy-BosmaBrian M. O'ConnellKeith R. Walker
    • G06F3/048H04L29/08G06F17/30G06F3/0482
    • H04L67/24G06F3/0482G06F17/30572
    • Methods, systems, and computer program products are provided for social network relationship mapping. In an embodiment, a method is disclosed that includes identifying one or more terms within content displayed to a user; for each identified term: transmitting the identified term to one or more social networking servers supporting a social networking application, in response to transmitting the identified term to the social networking servers, receiving from the social networking servers a list of people that correspond with the identified term, directing a display device to display the list of people that correspond with the identified term, and in response to user input, adding an identification of a person from the list of people to a mapping clipboard; directing the display device to display a relationship graph that indicates how people identified in the mapping clipboard are connected to each other in the social networking application.
    • 提供了社会网络关系映射的方法,系统和计算机程序产品。 在一个实施例中,公开了一种方法,其包括识别显示给用户的内容内的一个或多个术语; 对于每个识别的术语:响应于将所识别的术语发送到社交网络服务器,将所识别的术语传送到支持社交网络应用的一个或多个社交网络服务器,从社交网络服务器接收与所识别的对应的人的列表 指示显示设备显示与所识别的术语相对应的人的列表,并且响应于用户输入,将人的标识从人员列表添加到映射剪贴板; 指示显示设备显示关系图,其指示在社交网络应用中如何在映射剪贴板中识别的人彼此连接。
    • 9. 发明授权
    • Synchronizing compute node time bases in a parallel computer
    • 在并行计算机中同步计算节点时基
    • US08943350B2
    • 2015-01-27
    • US13693894
    • 2012-12-04
    • International Business Machines Corporation
    • Dong ChenDaniel A. FarajThomas M. GoodingPhilip Heidelberger
    • G06F1/12
    • G06F1/12H04L12/413
    • Synchronizing time bases in a parallel computer that includes compute nodes organized for data communications in a tree network, where one compute node is designated as a root, and, for each compute node: calculating data transmission latency from the root to the compute node; configuring a thread as a pulse waiter; initializing a wakeup unit; and performing a local barrier operation; upon each node completing the local barrier operation, entering, by all compute nodes, a global barrier operation; upon all nodes entering the global barrier operation, sending, to all the compute nodes, a pulse signal; and for each compute node upon receiving the pulse signal: waking, by the wakeup unit, the pulse waiter; setting a time base for the compute node equal to the data transmission latency between the root node and the compute node; and exiting the global barrier operation.
    • 在并行计算机中同步时基,其包括为树网络中的数据通信而组织的计算节点,其中一个计算节点被指定为根,并且对于每个计算节点,计算从根到计算节点的数据传输等待时间; 将线程配置为脉冲服务员; 初始化唤醒单元; 并执行局部屏障操作; 在每个节点完成局部屏障操作时,由所有计算节点进入全局屏障操作; 在所有节点进入全局屏障操作之后,向所有计算节点发送脉冲信号; 并且对于每个计算节点在接收到脉冲信号时:由唤醒单元唤醒脉冲服务员; 为计算节点设置等于根节点和计算节点之间的数据传输延迟的时基; 并退出全球屏障操作。