会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 23. 发明授权
    • Method and system for planning and installing communication networks
    • 规划和安装通信网络的方法和系统
    • US5515367A
    • 1996-05-07
    • US130350
    • 1993-10-01
    • Louis A. Cox, Jr.Yuping QiuGeorge E. TeganLu Lu
    • Louis A. Cox, Jr.Yuping QiuGeorge E. TeganLu Lu
    • H04L12/24H04Q3/00H04Q11/04H04L12/43H04L12/46
    • H04Q3/0083H04L41/145H04L41/22H04Q3/002H04J2203/0057H04L41/0823H04L41/0826
    • A method is disclosed for use in cooperation with a computer having memory in a Synchronous Optical Network (SONET) for generating an optimized transition plan for the placement of Self-Healing Rings (SHR) and the routing of point-to-point demand in accordance with projected customer demand over a selected multi-period time interval. By determining the number of nodes within a SONET, the demand therebetween over selected time interval as well as the discounted add-drop cost for a plurality of selected Add-Drop Multiplexers (ADMs), a set of logical rings as well as a set of physical rings and detailed routing information may be obtained and graphically illustrated. Logical rings may be determined by optimizing discounted fixed and interconnection costs for the plurality of ADMs in accordance with a selected mixed integer program to generate a corresponding electrical signal for receipt by the computer memory. Thereafter, the placement of physical self-healing rings, the cash flow out and optimal traffic routing may be determined in accordance with a second selected mixed integer program whereupon a second electrical signal may be generated corresponding thereto. Utilizing a heuristic approach, where the number of nodes under study is high, logical rings may be determined through an iterative process of randomly generating new proposed rings or, in the alternative, randomly expanding existing proposed rings until all demand has been satisfied.
    • 公开了一种用于与在同步光网络(SONET)中具有存储器的计算机配合使用的方法,用于产生用于放置自愈环(SHR)的优化过渡计划以及根据点对点需求的路由 预计客户需求超过选定的多周期时间间隔。 通过确定SONET内的节点数量,在所选择的时间间隔之间的需求以及多个选择的分插复用器(ADM)的折扣加成成本,一组逻辑环以及一组 物理环和详细路由信息可以获得并以图形方式示出。 可以通过根据所选择的混合整数程序来优化多个ADM的折扣固定和互连成本来确定逻辑环,以产生相应的电信号以供计算机存储器接收。 此后,可以根据第二选择的混合整数程序确定物理自愈环的放置,现金流出和最佳交通路由,从而可以相应地产生第二电信号。 利用启发式方法,其中正在研究的节点数量高,可以通过随机生成新的提议环的迭代过程来确定逻辑环,或者替代地,随机扩展现有的建议环,直到满足所有需求。
    • 27. 发明授权
    • Method and system for translating an optimization problem for use in
efficient resource allocation
    • 用于翻译优化问题以用于高效资源分配的方法和系统
    • US5649113A
    • 1997-07-15
    • US321950
    • 1994-10-12
    • Jianhua ZhuYuping Qiu
    • Jianhua ZhuYuping Qiu
    • G06Q10/06G06F17/60
    • G06Q10/06G06Q10/0631
    • An improved method and system for translating an optimization problem for use in efficient resource allocation. The improved method of the present invention includes the step of generating an index link record for each of the index variables in the optimization problem so as to eliminate the need for a symbol table and a plurality of temporary data records. The method also includes the step of linking the index link records of the index variables requiring expansion in a reverse order of the order listed in the optimization problem so as to reduce the number of traversals performed during expansion processing. The index link records have a pointer for identifying the next index variable requiring expansion.
    • 一种改进的方法和系统,用于翻译优化问题以用于有效的资源分配。 本发明的改进方法包括在优化问题中为每个索引变量生成索引链接记录的步骤,以消除对符号表和多个临时数据记录的需要。 该方法还包括以优化问题中列出的顺序的相反顺序链接需要扩展的索引变量的索引链接记录的步骤,以减少在扩展处理期间执行的遍历次数。 索引链接记录具有用于标识需要扩展的下一个索引变量的指针。
    • 29. 发明授权
    • Method and system for designing least cost local access networks
    • 用于设计最低成本的本地接入网络的方法和系统
    • US5508999A
    • 1996-04-16
    • US131045
    • 1993-10-01
    • Louis A. Cox, Jr.Yuping QiuGeorge E. TeganXiaorong Sun
    • Louis A. Cox, Jr.Yuping QiuGeorge E. TeganXiaorong Sun
    • H04L12/24H04Q3/00H04Q11/04H04L12/28
    • H04L41/22H04L41/0826H04L41/145H04Q3/002H04Q3/0083H04J2203/0057H04L41/0823
    • A method and system is provided for use in cooperation with a computer having a memory for generating an optimized transition plan for the placement and interconnection of carrier hubs in a local access network having a plurality of Central Offices (COs), Serving Wire Centers (SWCs) and Point-of-Presence (POP) exchange carriers such that calls may be routed at least cost. In operation, the total number and location of existing SWCs within the network must be determined along with the total switched and special access demand. Thereafter, known tariff rates for selected channel terminals, transport channels and multiplexers must be determined along with the total number of DS3 lines from each SWC to its corresponding POP. By expressing determined network demand as selected mixed-integer program decision variables and determining a corresponding set of logical constraints consistent with these decision variables, the optimized placement of hubs within the local access network may be determined. In addition, the corresponding location and type of channel terminals, transport channels and multiplexers may be implemented all accordance with the mixed-integer program and an electrical signal corresponding thereto may be generated for receipt by the computer memory. This information may thereafter be retrieved from computer memory and graphically displayed on a user-friendly interface.
    • 提供了一种与具有存储器的计算机配合使用的方法和系统,所述存储器用于生成用于在具有多个中心局(CO),服务线中心(SWC)的本地接入网络中的载波集线器的放置和互连的优化转换计划 )和点对点(POP)交换运营商,使得呼叫可以以至少成本路由。 在运营中,网络中现有的SWC的总数和位置必须与总的交换和特殊访问需求一起确定。 此后,必须确定所选频道终端,运输频道和多路复用器的已知电费率,以及每个SWC到其相应POP的DS3线路总数。 通过将确定的网络需求表示为选定的混合整数程序决策变量并确定与这些决策变量一致的对应的一组逻辑约束,可以确定集线器在本地接入网络内的优化布局。 此外,可以根据混合整数程序来实现信道终端,传输信道和多路复用器的相应位置和类型,并且可以生成与之对应的电信号以供计算机存储器接收。 此后可以从计算机存储器检索该信息,并以图形方式显示在用户友好界面上。
    • 30. 发明授权
    • Method and system for optimized logistics planning
    • 优化物流规划方法与系统
    • US5450317A
    • 1995-09-12
    • US158128
    • 1993-11-24
    • Lu LuYuping QiuLouis A. Cox, Jr.
    • Lu LuYuping QiuLouis A. Cox, Jr.
    • G06Q10/06G06Q10/08G06Q30/02G06F15/20G06G7/418
    • G06Q10/06G06Q10/06314G06Q10/06315G06Q10/06316G06Q10/087G06Q30/0202
    • An improved logistics planning method and system for recommending optimal order quantities and timing, choice of vendor locations and storage locations, and transportation modes, for individual items and for product families. The system is designed for use in cooperation with the computer having memory and incorporates item, customer, supplier, and routing information databases. In operation, the item, customer and supplier databases are accessed in order to provide customer and warehouse demand forecasts. The routing and customer databases are similarly accessed to provide transportation cost forecasts necessary to determine optimized routing modes for selected items, customers and suppliers. The demand and transportation costs are processed in accordance with a dynamic programming model to determine stock and non-stock order/shipment solutions for the selected items and customers, including optimized supplier and routing selection, order timing and quantity.
    • 改进的物流计划方法和系统,用于为个别物品和产品系列推荐最佳订单数量和时间,供应商位置和仓储位置的选择以及运输方式。 该系统设计用于与具有存储器的计算机配合使用,并结合了项目,客户,供应商和路由信息数据库。 在操作中,访问项目,客户和供应商数据库,以提供客户和仓库需求预测。 类似地访问路由和客户数据库,以提供确定所选项目,客户和供应商的优化路由模式所必需的运输成本预测。 根据动态规划模型处理需求和运输成本,以确定所选项目和客户的库存和非库存订单/运输解决方案,包括优化的供应商和路由选择,订单时间和数量。