公开(公告)号：US20110297369A1

公开(公告)日：2011-12-08

申请号：US13121630

申请日：2009-09-30

Applicant: Krishnan Kumaran ,  Jingbo Wang ,  Stefan Hussenoeder ,  Dominique Gillard ,  Guy F. Medema ,  Fred W. Schroeder ,  Robert L. Brovey ,  Pavel Dimitrov

Inventor： Krishnan Kumaran ,  Jingbo Wang ,  Stefan Hussenoeder ,  Dominique Gillard ,  Guy F. Medema ,  Fred W. Schroeder ,  Robert L. Brovey ,  Pavel Dimitrov

IPC: E21B49/00 ,  E21B43/00 ,  G06F19/00

CPC classification number: G01V1/288 ,  G01V1/301 ,  G01V2210/63 ,  G01V2210/64 ,  G01V2210/665

Abstract: Method for identifying geologic features from geophysical or attribute data using windowed principal component (or independent component) analysis. Subtle features are made identifiable in partial or residual data volumes. The residual data volumes (24) are created by (36) eliminating data not captured by the most prominent principal components (14). The partial data volumes are created by (35) projecting the data on to selected principal components. The method is suitable for identifying physical features indicative of hydrocarbon potential.

Abstract translation: 使用窗口主成分（或独立分量）分析从地球物理或属性数据中识别地质特征的方法。 部分或残留数据量可以识别细微的特征。 剩余数据量（24）由（36）创建，消除未被最突出的主要组件（14）捕获的数据。 部分数据量由（35）将数据投影到选定的主要组件上创建。 该方法适用于识别指示烃潜力的物理特征。

公开(公告)号：US07283745B2

公开(公告)日：2007-10-16

申请号：US10403579

申请日：2003-03-31

Applicant: Krishnan Kumaran ,  Timothy O. Murphy ,  Nachi K. Nithi ,  Carl Jeremy Nuzman ,  Gaylord W. Richards

Inventor： Krishnan Kumaran ,  Timothy O. Murphy ,  Nachi K. Nithi ,  Carl Jeremy Nuzman ,  Gaylord W. Richards

IPC: H04J14/00

CPC classification number: H04Q11/0005 ,  H04Q2011/0052

Abstract: Techniques and systems for design of optical switch arrays so as to minimize power requirements are described. A design system includes a computer system hosting a design program. The design program receives parameters for the switch array, including a number N of outputs required, and either a maximum number L of stages allowed or maximum and average power requirements allowed. If power requirements are used as parameters, the design program uses N and the power requirements to compute the value of L. The design program then constructs a minimum power sequence of L switches or N switches, whichever is less. If N is less than L+1, N outputs are present and the array is complete. If N is greater than L+1, the design program then adds switches one at a time to the minimum power switch path of the array, until the array provides N outputs.

Abstract translation: 描述了用于设计光开关阵列以便最小化功率需求的技术和系统。 设计系统包括托管设计程序的计算机系统。 设计程序接收交换机阵列的参数，包括需要的输出N个输出，允许的最大数量的L级或允许的最大级数和允许的平均功率要求。 如果使用功率要求作为参数，则设计程序使用N和功率要求来计算L的值。然后，设计程序构建L个开关或N个开关的最小功率序列，以较小者为准。 如果N小于L + 1，则存在N个输出，并且阵列完成。 如果N大于L + 1，则设计程序然后将开关一次一个地添加到阵列的最小功率开关路径，直到阵列提供N个输出。

公开(公告)号：US07283552B2

公开(公告)日：2007-10-16

申请号：US10426389

申请日：2003-04-30

Applicant: Krishnan Kumaran ,  Kevin Ross ,  Iraj Saniee ,  Indra Widjaja

Inventor： Krishnan Kumaran ,  Kevin Ross ,  Iraj Saniee ,  Indra Widjaja

IPC: H04B7/212 ,  H04L12/43

CPC classification number: H04Q11/0062 ,  H04Q2011/0033 ,  H04Q2011/0064 ,  H04Q2011/0086

Abstract: A method for scheduling data bursts from origin to destination nodes of a communication system involves selecting a yet-unscheduled, feasible node pair for scheduling of a burst therebetween; selecting a timeslot from a finite timeslot sequence; scheduling the burst for the selected timeslot; and repeating the preceding steps to exhaustion of unscheduled demand or of feasible node pairs. The feasibility of a node pair is conditioned on the avoidance of collisions with already-scheduled bursts, taking the various origin-to-destination propagation delays into account.

Abstract translation: 调度数据突发从一个通信系统的起点到目标节点的方法包括选择一个尚未排程的可行的节点对来调度其间的一个突发; 从有限时隙序列中选择一个时隙; 调度所选时隙的突发; 并重复前述步骤以耗尽未预定的需求或可行的节点对。 节点对的可行性在于避免与已经计划的突发的冲突，考虑到各种起始到目的地的传播延迟。

公开(公告)号：US07158804B2

公开(公告)日：2007-01-02

申请号：US10305614

申请日：2002-11-27

Applicant: Krishnan Kumaran ,  Lijun Qian

Inventor： Krishnan Kumaran ,  Lijun Qian

IPC: H04B7/00

CPC classification number: H04W28/14 ,  H04B1/71072 ,  H04W52/288 ,  H04W72/1226

Abstract: Mobiles are sorted by using a first metric and one or more of the sorted mobiles are selected. A second metric is determined using the selected sorted mobiles, and mobiles are selected to transmit during a time period based on the second metric. Multiple embodiments are disclosed using these steps and exact or approximate solutions as to which mobiles should transmit may be determined. By way of example, the first metric may be a weighted marginal rate and the second metric may be an objective function. An uplink proportional fair technique is presented in which, for example, either a single “strong” mobile or a group of “weak” mobiles may be selected to transmit during a single time period. In addition, techniques are presented for determining uplink scheduling when there is partial orthogonality in Walsh codes, modeled by an orthogonality factor, assigned to mobiles. Techniques are also presented for optimal uplink scheduling for uplink mobile transmissions in a single cell with successive interference cancellation.

Abstract translation: 通过使用第一度量来排序移动台，并且选择一个或多个分类移动台。 使用所选择的排序的移动台确定第二度量，并且基于第二度量来选择移动站在一段时间段期间进行发送。 使用这些步骤公开了多个实施例，并且可以确定哪些移动台应该发送的确切或近似解决方案。 作为示例，第一度量可以是加权边际率，并且第二度量可以是目标函数。 提出了一种上行比例公平技术，其中例如，可以在单个时间段期间选择单个“强”移动台或一组“弱”移动台进行发送。 此外，当在由分配给移动台的正交因子建模的沃尔什码中存在部分正交性时，呈现用于确定上行链路调度的技术。 还提出了用于具有连续干扰消除的单个小区中的上行链路移动传输的最佳上行链路调度的技术。

公开(公告)号：US06687363B1

公开(公告)日：2004-02-03

申请号：US09517658

申请日：2000-03-03

Applicant: Murali Aravamudan ,  Krishnan Kumaran ,  Kajamalai Gopalaswamy Ramakrishnan ,  Aravind Srinivasan

Inventor： Murali Aravamudan ,  Krishnan Kumaran ,  Kajamalai Gopalaswamy Ramakrishnan ,  Aravind Srinivasan

IPC: H04M700

CPC classification number: H04Q3/66 ,  H04M7/006

Abstract: A method is disclosed for designing a signaling network of call coordinators (CCs) for internet telephony. The new method can be used to design a CC network of arbitrary size that satisfies, with high probability, limitations on the maximum number of sockets per CC and on the maximum number of hops between an arbitrary pair of switches in the network. According to the disclosed method, the network of CCs is treated initially as a collection of isolated points, one point for each CC. Then, links are added between pairs of CCs, excluding pairs lying within the same switch. The links are added randomly, but with a particular probability p, which may be different for different pairs. Thus, whether a given link is added depends, in effect, upon the outcome of a loaded coin toss in which the probability of a positive outcome is p.

Abstract translation: 公开了一种用于设计用于互联网电话的呼叫协调器（CC）的信令网络的方法。 该新方法可用于设计任意大小的CC网络，其高概率地限制每CC的最大插座数以及网络中任意一对交换机之间的最大跳数。 根据所公开的方法，CC的网络最初被视为孤立点的集合，每个CC是一个点。 然后，在成对的CC之间添加链路，不包括位于同一交换机内的对。 链接是随机添加的，但具有特定概率p，对于不同的对可能是不同的。 因此，给定的链接是否被添加取决于实际上是一个加载的硬币的结果，其中肯定结果的概率是p。

公开(公告)号：US6125280A

公开(公告)日：2000-09-26

申请号：US44661

申请日：1998-03-19

Applicant: Sudheer A. Grandhi ,  Joe Huang ,  Colin L. Kahn ,  Krishnan Kumaran ,  Bulin B. Zhang

Inventor： Sudheer A. Grandhi ,  Joe Huang ,  Colin L. Kahn ,  Krishnan Kumaran ,  Bulin B. Zhang

IPC: H04B7/26 ,  H04W16/18 ,  H04W24/02 ,  H04Q7/20

CPC classification number: H04W24/02 ,  H04W16/18

Abstract: In a cellular system, a new cell measures signal strengths of different channels being used by existing cells. The new cell generates a list of candidate channels corresponding to the channels with the greatest signal strength and transmits the list to the mobile switching center (MSC) of the cellular system. The MSC determines which of the candidate channels correspond to beacons in existing cells and transmits configuration information to the new cell for those corresponding existing cells. In this way, the new cell automatically receives configuration information on its neighbor cells. If the MSC determines that the number of candidate channels that are beacons is too small, the MSC will ask the new cell to transmit additional candidate channels (i.e., those having even lower signal strength).

Abstract translation: 在蜂窝系统中，新小区测量现有小区正在使用的不同信道的信号强度。 新小区产生与具有最大信号强度的信道相对应的候选信道的列表，并将该列表发送到蜂窝系统的移动交换中心（MSC）。 MSC确定哪些候选信道对应于现有小区中的信标，并将配置信息发送到新小区，用于那些相应的现有小区。 这样，新的小区自动接收其邻居小区的配置信息。 如果MSC确定信标的候选信道的数量太小，则MSC将要求新小区发送附加的候选信道（即具有甚至更低信号强度的信道）。