会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method for realtime scaling of the vehicle routing problem
    • 实时缩放车辆路线问题的方法
    • US07756631B2
    • 2010-07-13
    • US11513875
    • 2006-08-31
    • Marcos D. ChaviraHamid KarimiCarolyn B. Boettcher
    • Marcos D. ChaviraHamid KarimiCarolyn B. Boettcher
    • G05D1/00
    • G01C21/00
    • An absolutely optimal routing or a quasi-optimal routing is computed for a first plurality of resources m to be routed to a second plurality of resource destinations n, depending on a count of m and n. Three different algorithms are used. For the case where the count is m≦6 and n≦8, a first algorithm is used to arrive at an absolutely optimal routing. An example of the first algorithm is Depth First Branch and Bound Search. For a second count, where the value of the count is more numerous than the first count, m is greater than six, but equal to, or less than or equal to fifty, 6 50, and n>100. An example of this third algorithm is Swarming.
    • 根据m和n的计数,针对待路由到第二多个资源目的地n的第一多个资源m计算绝对最佳路由或准最优路由。 使用三种不同的算法。 对于计数为m≦̸ 6和n≦̸ 8的情况,第一种算法用于获得绝对最优路由。 第一种算法的一个例子是深度优先分支和绑定搜索。 对于第二计数,其中计数的值比第一计数多,m大于6,但等于或小于或等于五十,六,六,五,并且n大于8, 但小于或等于百分之八十,第二种算法用于计算准最优路由。 第二种算法的一个例子是Local Search。 对于计数超过上述计数的第三计数,第三种算法用于计算准最优路由。 通常,第三种算法适用于m> 50且n> 100。 第三种算法的一个例子是Swarming。
    • 3. 发明申请
    • Automatically configuring a neighbor set for a base station
    • 自动配置基站的邻居集
    • US20070213086A1
    • 2007-09-13
    • US11371637
    • 2006-03-09
    • Holger ClaussenLester HoHamid KarimiLouis Samuel
    • Holger ClaussenLester HoHamid KarimiLouis Samuel
    • H04B7/00
    • H04W16/18
    • An automated technique for configuring a neighbor set for a base station (32) includes initializing the neighbor set based upon reported measurements from a mobile station (22). In a disclosed example, a newly installed base station (32) transmits a cell information list to a mobile station (22) requesting measurement reports regarding a plurality of candidate base station identifiers. Based upon the reported measurements, a determination is made regarding which of the base stations should be included in the neighbor set for the base station (32). A disclosed example includes the capability of automatically initializing the neighbor set and automatically updating the set. Disclosed examples include utilizing information from a plurality of mobile stations.
    • 用于配置用于基站(32)的邻居集合的自动化技术包括基于来自移动站(22)的报告的测量来初始化邻居集合。 在公开的示例中,新安装的基站(32)向移动台(22)发送小区信息列表,请求关于多个候选基站标识符的测量报告。 基于所报告的测量,确定关于哪些基站应包括在用于基站(32)的相邻集合中。 所公开的示例包括自动初始化邻居集合并自动更新该集合的能力。 公开的示例包括利用来自多个移动站的信息。
    • 4. 发明申请
    • Controlling base station router device definition codes
    • 控制基站路由器设备定义码
    • US20070213066A1
    • 2007-09-13
    • US11371636
    • 2006-03-09
    • Holger ClaussenLester Wee HoHamid KarimiLouis Samuel
    • Holger ClaussenLester Wee HoHamid KarimiLouis Samuel
    • H04Q7/20
    • H04W8/26H04W16/16
    • A wireless communication system (20) allows for using base station router devices (30, 32) for in building communications using a mobile station (22). Automatically configuring a definition code such as primary scrambling codes or pseudo random noise offsets of the base station router devices (30, 32) facilitates minimizing or avoiding false handovers between a macrocell base station (24) and one of the base station router devices (30, 32). In a disclosed example, a controller (26) such as a radio network controller communicates with at least one of the base station router devices (30, 32) for automatically changing a definition code used by such a device to avoid correspondence between definition codes within a selected range.
    • 无线通信系统(20)允许使用基站路由器设备(30,32)来建立使用移动站(22)的通信。 自动配置诸如基站路由器设备(30,32)的主扰码或伪随机噪声偏移的定义代码有助于最小化或避免宏蜂窝基站(24)与基站路由器设备(30)之一之间的错误切换 ,32)。 在公开的示例中,诸如无线电网络控制器的控制器(26)与基站路由器设备(30,32)中的至少一个通信,用于自动地改变由这样的设备使用的定义码,以避免在此之内的定义码之间的对应 一个选定的范围。
    • 5. 发明申请
    • Decoding method and apparatus
    • 解码方法和装置
    • US20050031053A1
    • 2005-02-10
    • US10637788
    • 2003-08-08
    • Holger ClaussenHamid Karimi
    • Holger ClaussenHamid Karimi
    • H03M13/29H03M13/39H03M13/45H04L1/00H04L27/06
    • H03M13/3905H03M13/2957H03M13/658
    • A method of decoding is provided comprising processing iterations. In each processing iteration, there is a first Max-Log-MAP decoding operation giving rise to a systematic error due to the Max-Log approximation, and a first weighting operation to weight extrinsic information from the first decoding operation to be applied as a priori information to the second Max-Log-MAP decoding operation. This is followed by a second Max-Log-MAP decoding operation, also giving rise to a systematic error due to the Max-Log approximation, and a second weighting operation to weight extrinsic information from the second decoding to be applied as a priori information to the first Max-Log-MAP decoding of the next iteration. The weights are applied to compensate for the systematic error due to the Max-Log approximation made in the last Max-Log-MAP decoding operation.
    • 提供一种解码方法,包括处理迭代。 在每个处理迭代中,存在由于Max-Log近似而引起系统误差的第一Max-Log-MAP解码操作,以及用于对来自第一解码操作的外在信息加权作为先验加权的第一加权操作 信息到第二次Max-Log-MAP解码操作。 之后是第二次Max-Log-MAP解码操作,也由于Max-Log近似而引起系统误差,以及第二加权操作,用于将来自第二解码的外在信息加权作为先验信息应用于 第一次Max-Log-MAP解码的下一次迭代。 应用权重来补偿由于在最后的Max-Log-MAP解码操作中进行的Max-Log近似而导致的系统误差。