会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明申请
    • SYSTEM AND METHOD IN A DATA TABLE FOR CREATING RECURSIVE SCALABLE TEMPLATE INSTANCES
    • 用于创建可追溯的可调模式实验的数据表中的系统和方法
    • WO2004092977A2
    • 2004-10-28
    • PCT/EP2004/003048
    • 2004-02-27
    • INTERNATIONAL BUSINESS MACHINES CORPORATIONCOMPAGNIE IBM FRANCEAUREGLIA, Jean-JacquesBAUCHOT, Frederic
    • AUREGLIA, Jean-JacquesBAUCHOT, Frederic
    • G06F17/24
    • G06F17/246
    • The present invention is directed to a method, system and program, in a multi-dimensional electronic data table comprising a plurality of data, for creating one or plurality of recursive scalable template instances; a recursive scalable template instance comprising a variable number of contiguous recursive element instances ordered and aligned along a first data table dimension and structured according to a recursive scalable template; a recursive element instance being defined as comprising one or a plurality of scalable template instances; a scalable template instance comprising a variable number of elements structured according to a scalable template; an element being defined as a range of data; a range of data comprising one or a plurality of data; a recursive scalable template comprising a recursive element comprising one or a plurality of scalable templates. The method comprises for each recursive scalable template instance to create, the steps of: • Selecting a recursive scalable template; • Defining a location for creating a recursive scalable template instance; • Creating at the defined location one or a plurality of contiguous recursive element instances ordered and aligned along a first data table dimension; each recursive element instance having a variable size along said first data table dimension and a same size along a second data table dimension; • Structuring each recursive element instance according to the recursive element defined for the recursive scalable template; • Aligning each scalable template instance of each recursive element instance along said first data table dimension; • Aligning within each recursive element instance, each scalable template instance along said second data table dimension.
    • 本发明涉及一种用于创建一个或多个递归可伸缩模板实​​例的包括多个数据的多维电子数据表中的方法,系统和程序; 递归可伸缩模板实​​例,包括沿着第一数据表维度排序和对齐的可变数量的连续递归元素实例,并且根据递归可缩放模板进行结构化; 定义为包括一个或多个可缩放模板实例的递归元素实例; 可扩展的模板实例,包括根据可缩放模板构造的可变数量的元素; 一个元素被定义为数据范围; 包括一个或多个数据的数据范围; 包括包括一个或多个可缩放模板的递归元素的递归可伸缩模板。 该方法包括为每个递归可伸缩模板实​​例创建,步骤如下: 选择递归可缩放模板; 。 定义创建递归可伸缩模板实​​例的位置; 。 在定义的位置创建沿着第一数据表维度排列和对齐的一个或多个连续的递归元素实例; 每个递归元素实例沿着所述第一数据表维度具有可变大小,并且沿着第二数据表维度具有相同的大小; 。 根据为递归可缩放模板定义的递归元素构建每个递归元素实例; 。 将每个递归元素实例的每个可缩放模板实例沿所述第一数据表维度对齐; 。 在每个递归元素实例内对齐沿着所述第二数据表维度的每个可缩放模板实例。
    • 4. 发明申请
    • SYSTEM AND METHOD IN A DATA TABLE FOR EXPORTING AND IMPORTING RECURSIVE SCALABLE TEMPLATES
    • 用于出口和进口可追溯标定模板的数据表中的系统和方法
    • WO2004092976A2
    • 2004-10-28
    • PCT/EP2004/003035
    • 2004-02-27
    • INTERNATIONAL BUSINESS MACHINES CORPORATIONCOMPAGNIE IBM FRAMCEAUREGLIA, Jean-JacquesBAUCHOT, Frederic
    • AUREGLIA, Jean-JacquesBAUCHOT, Frederic
    • G06F17/24
    • G06F17/246
    • The present invention is directed to a method, system and program for exporting, from a source electronic data table comprising a plurality of objects having parent-child relationships to a destination electronic data table, one or several of objects with their filiation. The method for use in a computer comprises the steps of : defining objects and associating with each object one or a plurality of parent objects or one or a plurality of child objects or both; associating with each object a unique object reference (OR) equal to a prime number; determining for each object whether said object is associated with at least a child object or not : if said object is not associated with at least one child object, defining a filiation reference (FR) equal to 1; if said object is associated with at least one child object, defining a filiation reference (FR) equal to the product of two terms : a first term, equal to the product of each object reference (OR) associated with each child object of said object: a second term equal to the least common multiplier (LCM) of the filiation references of the child objects associated with said object : receiving an export command for exporting one or a plurality of selected objects with associated child objects; associating with each object, a selected children variable (SC) for determining whether or not said object belongs to the set of child objects associated with selected objects, said selected children variable being equal to : a first Boolean value if the least common multiplier (LCM) of the filiation references of the one or plurality of selected objects is a multiple of the own object reference: a second Boolean value if the least common multiplier (LCM) of the filiation references of the one or plurality of selected objects is not a multiple of the own object reference: exporting to the destination data table, the selected objects and the objects with a selected children variable (SC) equal to said first Boolean value.
    • 本发明涉及一种用于从包括具有父子关系的多个对象的源电子数据表导出到目的地电子数据表的方法,系统和程序,其中一个或几个具有其归档的对象。 在计算机中使用的方法包括以下步骤:定义对象并且与每个对象相关联一个或多个父对象或一个或多个子对象或两者; 与每个对象关联等于素数的唯一对象引用(OR); 确定每个对象是否所述对象与至少一个子对象相关联:如果所述对象不与至少一个子对象相关联,则定义等于1的子化参考(FR); 如果所述对象与至少一个子对象相关联,则定义等于两个项的乘积的子化参考(FR):第一项,等于与所述对象的每个子对象相关联的每个对象引用(OR)的乘积 :等于与所述对象相关联的子对象的归档引用的最小公用乘数(LCM)的第二项:接收用于将一个或多个所选对象与相关联的子对象一起导出的导出命令; 与每个对象相关联的所选择的子变量(SC),用于确定所述对象是否属于与所选对象相关联的一组子对象,所述选择的子变量等于:如果最小公倍数(LCM)为第一布尔值 )所述一个或多个所选择的对象的所述提取引用的倍数是所述自身对象引用的倍数:如果所述一个或多个所选对象的所述归档引用的最小公用乘数(LCM)不是多个,则所述第二布尔值 的自己的对象引用:导出到目标数据表,所选对象和具有等于所述第一布尔值的所选子变量(SC)的对象。
    • 6. 发明申请
    • SYSTEM AND METHOD FOR INTEGRATING PROJECTS EVENTS WITH PERSONAL CALENDAR AND SCHEDULING CLIENTS
    • 与个人日历和调度客户集成项目活动的系统和方法
    • WO2004066171A1
    • 2004-08-05
    • PCT/EP2003/015035
    • 2003-12-30
    • INTERNATIONAL BUSINESS MACHINES CORPORATIONCOMPAGNIE IBM FRANCE
    • ESTRADA, AntonioHILL, Charles, R.SHALABI, Sami, M.
    • G06F17/60
    • G06Q10/109G06Q10/063118G06Q10/06313G06Q10/06314Y10S707/99945Y10S707/99948
    • A system for integrating project events with personal calendar and scheduling clients, includes a first server including a place database having a member profiles database and an events database; a place server, and an email transport facility including an email application; a client including a calendar and scheduling program; the member profiles database being responsive to member input for storing member subscriptions to the calendar and scheduling program; the place server responsive to said email transport facility receiving a create, update, or delete event from a member of the place database for creating in the events database a project event; the place server responsive to a create, update, or delete event for determining from the member profiles database those members subscribing to each of a plurality of calendar and scheduling programs; said place server further for sending to each member subscribing to a calendar and scheduling program an email notification of the project event personalized to the calendar and scheduling program to which the member has subscribed.
    • 用于将项目事件与个人日历和调度客户端集成的系统包括包括具有成员简档数据库和事件数据库的位置数据库的第一服务器; 地点服务器和包括电子邮件应用的电子邮件传输设施; 包括日历和日程安排程序的客户端; 所述成员简档数据库响应于成员输入来存储对所述日历和调度程序的成员订阅; 所述地点服务器响应于所述电子邮件传输设施从所述地点数据库的成员接收创建,更新或删除事件,以在所述事件数据库中创建项目事件; 所述地点服务器响应于创建,更新或删除事件,以从所述成员简档数据库确定订阅多个日历和调度程序中的每一个的所述成员; 所述地点服务器进一步发送给订阅日历的每个成员和调度程序,该项目事件的电子邮件通知被个性化到该成员已订阅的日历和调度程序。
    • 8. 发明申请
    • SYSTEM AND METHOD FOR CONDUCTING ADAPTIVE SEARCH USING A PEER-TO-PEER NETWORK
    • 使用对等网络进行自适应搜索的系统和方法
    • WO2004046960A1
    • 2004-06-03
    • PCT/EP2003/012052
    • 2003-10-16
    • INTERNATIONAL BUSINESS MACHINES CORPORATIONCOMPAGNIE IBM FRANCE
    • KRAFT, Reiner
    • G06F17/30
    • G06F17/30206G06Q30/0611G06Q30/0633Y10S707/99939
    • A distributed comparison shopping system is based on a decentralized, distributed architecture utilizing a peer-to-peer network. The system creates an active marketplace with real-time price comparisons, with the peer-to-peer nodes coordinating connectivity with other peers and building a dynamic network. Each message includes a fixed component and an adaptive update component. The adaptive update component contains search criteria and search status fields that are selectively modified as the message travels through the peer-peer network. A node that receives a message will interpret the search criteria and apply those criteria to a local search result. The node then either forwards the unmodified or the modified message to other nodes in its neighborhood, or, alternatively, requests an authorization to modify the message prior to rebroadcasting, from the source node.
    • 分布式比较购物系统基于利用对等网络的分散式分布式架构。 该系统通过实时价格比较创建一个活跃的市场,对等节点协调与其他同伴的连接并构建动态网络。 每个消息包括固定组件和自适应更新组件。 自适应更新组件包含随着消息传播通过对等网络而有选择地修改的搜索条件和搜索状态字段。 接收消息的节点将解释搜索条件并将这些标准应用于本地搜索结果。 然后,节点将未修改的消息或修改的消息转发到其邻域中的其他节点,或者替代地,从源节点请求在重新广播之前修改消息的授权。
    • 10. 发明申请
    • METHOD AND SYSTEMS FOR OPTIMIZING ADSL CONNECTIONS IN DSL ACCESS MULTIPLEXOR
    • 用于在DSL接入多路复用器中优化ADSL连接的方法和系统
    • WO2003081942A1
    • 2003-10-02
    • PCT/EP2003/003248
    • 2003-03-10
    • INTERNATIONAL BUSINESS MACHINES CORPORATIONCOMPAGNIE IBM FRANCEELEFTHERIOU, Evangelos, S.OELCER, SedatABDELILAH, YoussefDAVIS, Gordon, TaylorDERBY, Jeff, H.HWANG, DongmingWARE, MalcolmYE, Hua
    • ELEFTHERIOU, Evangelos, S.OELCER, SedatABDELILAH, YoussefDAVIS, Gordon, TaylorDERBY, Jeff, H.HWANG, DongmingWARE, MalcolmYE, Hua
    • H04Q11/00
    • H04Q11/00H04M11/062H04Q2213/13003H04Q2213/13039H04Q2213/1308H04Q2213/13099H04Q2213/13199H04Q2213/13332
    • A method and systems for optimizing Asymmetric Digital Subscriber Line (ADSL) connections in DSL Access Multiplexor (DSLAM) that marries benefits of G.dmt and G.lite standards, using a flexible method implemented on a programmable Digital Signal Processor (DSP) and a Network Processor (NP) is disclosed. It provides a means to support full G.dmt rates for any of the attached users as long as less than half the users are actively moving data through the DSLAM, but by only using half the digital signal processing hardware and half the power consumption for the line drivers. The invention allows doubling the number of,ADSL ports available over a conventional scheme given about 20% more power is under 50% with only half the respective connections, all those G.dmt rates possible on their exceeds 50%, gradually active G.lite rates based on either based on a tiered tariff structure, until ultimately, when the utilization reaches 100%, all subscribers will be forced back to a maximum rate afforded by G.lite. Only as utilization drops back off, will active subscribers be brought back up to G.dmt's maximum transmission rates. Once the utilization drops below 50% again, then all active subscribers will be able to utilize G.dmt's maximum transmission rates. budget. When the utilization subscribers active on their users experience the maximum wire. However, when utilization subscribers start to experience a fixed policy or one that is based on a tiered tariff structure, until ultimately, when the utilization reaches 100%, all subscribers will be forced back to a maximum rate afforded by G.lite. Only as utilization drops back off, will active subscribers be brought back up to G.dmt's maximum transmission rates. Once the utilization drops below 50% again, then all active subscribers will be able to utilize G.dmt's maximum transmission rates.
    • 一种用于优化DSL访问多路复用器(DSLAM)中的非对称数字用户线路(ADSL)连接的方法和系统,其使用G.dmt和G.lite标准的优点,使用在可编程数字信号处理器(DSP)和 网络处理器(NP)被公开。 只要不到一半的用户通过DSLAM主动移动数据,但只能使用一半的数字信号处理硬件和一半的功耗来提供支持所有连接用户的全部G.dmt速率的方法 线路驱动程序。 本发明允许将常规方案的ADSL端口数量增加一倍,因为大约20%的功率在50%以下,而仅有一半的相应连接,所有这些G.dmt速率可能超过50%,逐渐活跃的G.lite 价格基于分层关税结构,直到最终使用率达到100%时,所有用户将被迫恢复到由G.lite提供的最高价格。 只有在利用率下降的情况下,活跃用户才能恢复到G.dmt的最大传输速率。 一旦使用率再次下降到50%以下,那么所有活跃用户将能够利用G.dmt的最大传输速率。 预算。 当用户在其用户上活跃时,体验到最大的线路。 然而,当利用者开始体验固定的政策或基于分级关税结构的政策时,直到最终使用率达到100%时,所有用户将被迫恢复到由G.lite提供的最高利率。 只有在利用率下降的情况下,活跃用户才能恢复到G.dmt的最大传输速率。 一旦使用率再次下降到50%以下,那么所有活跃用户将能够利用G.dmt的最大传输速率。