公开(公告)号：US09577785B2

公开(公告)日：2017-02-21

申请号：US14813354

申请日：2015-07-30

申请人： Vencore Labs, Inc.

发明人： Joseph C. Liberti ,  Nicholas Chang

IPC分类号： H04B1/00 ,  H04B15/00 ,  H04K3/00

CPC分类号： H04K3/224

摘要： Provided are processes for suppressing jamming signals that may include use of a signal processing circuit. A signal processing circuit can be configured to obtain a jamming signal and a feedback signal, process the jamming signal and the feedback signal to determine a cancellation signal for use in suppressing the jamming signal, and output the cancellation signal to a radio-frequency transmitter. The signal processing circuit may be further configured to obtain a transmission signal, determine a jamming channel from the jamming signal and a feedback channel from the feedback signal, and combine the transmission channel, jamming channel, and feedback channel to determine a transfer function, where the transfer function is configured to determine the cancellation signal.

摘要翻译： 提供了用于抑制可能包括使用信号处理电路的干扰信号的处理。 信号处理电路可以被配置为获得干扰信号和反馈信号，处理干扰信号和反馈信号以确定用于抑制干扰信号的抵消信号，并将抵消信号输出到射频发射机。 信号处理电路还可以被配置为获得发送信号，从干扰信号确定干扰信道和来自反馈信号的反馈信道，并且组合传输信道，干扰信道和反馈信道以确定传递函数，其中 传递函数被配置为确定取消信号。

公开(公告)号：US20160323313A1

公开(公告)日：2016-11-03

申请号：US14291974

申请日：2014-05-30

申请人： TT GOVERNMENT SOLUTIONS, INC.

发明人： Sanjai NARAIN ,  Dana CHEE

IPC分类号： H04L29/06

CPC分类号： H04L63/1475 ,  H04L63/029 ,  H04L63/18

摘要： There is set forth herein in on embodiment a method wherein configurations are changed. In one embodiment, configurations are changed in such a way that end-to-end requirements continue to be satisfied, the change is at minimum cost, and that at least one variable from a critical set of variables is changed.

摘要翻译： 这里在实施例中阐述了其中配置被改变的方法。 在一个实施例中，配置被改变为使得端到端的要求继续得到满足，改变是以最小成本，并且来自一组关键变量集合的至少一个变量被改变。

公开(公告)号：US08973129B2

公开(公告)日：2015-03-03

申请号：US12872569

申请日：2010-08-31

申请人： Eric van den Berg ,  Tao Zhang

发明人： Eric van den Berg ,  Tao Zhang

IPC分类号： G06F21/00 ,  H04L9/32 ,  H04L29/06 ,  H04W4/20 ,  H04W12/04 ,  H04W4/04

CPC分类号： H04L63/1425 ,  H04L9/3268 ,  H04L63/20 ,  H04L67/12 ,  H04W4/046 ,  H04W4/20 ,  H04W4/46 ,  H04W12/04 ,  H04W12/12

摘要： In a vehicle communication network, some vehicles may be used by attackers to send false information to other vehicles which may jeopardize the safety of other vehicles. Vehicles should be able to detect malicious communications activities and to mitigate the impact of malicious vehicles by evicting (eliminating) suspected malicious vehicles from the system. Evicting a vehicle is to ignore the messages sent from the vehicle for a specified time period. Voting and sacrifice principles are combined using a mathematical model based on the “Mafia Game”. The Mafia Game model focuses on the relative size of the group of attackers within a neighborhood necessary to dominate the entire network in the neighborhood (i.e., to eventually evict all the innocent vehicles).

摘要翻译： 在车辆通信网络中，一些车辆可能被攻击者用来向其他车辆发送可能危及其他车辆安全的虚假信息。 车辆应该能够通过从系统中排除（消除）可疑的恶意车辆来检测恶意通信活动并减轻恶意车辆的影响。 驱逐车辆是忽略从车辆发送的指定时间段的消息。 使用基于“黑手党游戏”的数学模型组合投票和牺牲原则。 “黑手党游戏”模式侧重于在邻近地区（即最终驱逐所有无辜车辆）所必需的邻里内的攻击者群体的相对规模。

公开(公告)号：US08805770B2

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

申请号：US13112462

申请日：2011-05-20

申请人： Sanjai Narain ,  Gary Levin

发明人： Sanjai Narain ,  Gary Levin

IPC分类号： G06F17/11 ,  G06Q10/04 ,  G06Q10/06 ,  H04L12/24

CPC分类号： G06Q10/04 ,  G06F17/11 ,  G06N5/00 ,  G06Q10/0631 ,  H04L41/14 ,  H04L41/145 ,  H04L41/50

摘要： A method for solving the reconfiguration planning problem transforms the requirement that an invariant is always preserved into a constraint on the times at which the configuration parameters change. The method then solves this constraint to obtain the required reconfiguration plan. When this constraint is strengthened with a synthesis constraint, it is ensured that any final configuration that is computed is also reachable. An extension of the method allows parameters to take on multiple intermediate values.

摘要翻译： 解决重构规划问题的方法将不变量总是保留在配置参数变化时间的约束条件下。 该方法然后解决此约束以获得所需的重新配置计划。 当使用合成约束强化此约束时，确保计算出的任何最终配置也可以达到。 该方法的扩展允许参数承担多个中间值。

公开(公告)号：US08725902B2

公开(公告)日：2014-05-13

申请号：US13532376

申请日：2012-06-25

申请人： Sanjai Narain ,  Konstantine Arkoudas

发明人： Sanjai Narain ,  Konstantine Arkoudas

IPC分类号： G06F15/173

CPC分类号： H04L41/0826 ,  H04L41/0813 ,  H04L41/145

摘要： Changing a network configuration to restore compliance to one requirement may invalidate the network compliance with another requirement. A method changes a configuration to restore compliance to all requirements at minimum cost. The requirements are a hybrid of symbolic, arithmetic and bit-vector constraints, so traditional optimization techniques such as linear programming, that work only for purely arithmetic constraints, do not apply. The requirements are represented as SMT (satisfiability-modulo-theory) constraints on configuration variables, and then a weighted Max-SAT solver is used to compute the optimal configuration changes in order to minimize the cost.

摘要翻译： 更改网络配置以恢复符合一项要求可能会使网络符合另一项要求。 一种方法会更改配置，以最小的成本恢复所有要求的合规性。 要求是符号，算术和位向量约束的混合，所以传统的优化技术，如线性规划，仅适用于纯算术约束，不适用。 这些要求表示为配置变量的SMT（可满足性 - 模理论）约束，然后使用加权Max-SAT求解器来计算最优配置变化，以最小化成本。

公开(公告)号：US08522085B2

公开(公告)日：2013-08-27

申请号：US12694806

申请日：2010-01-27

申请人： Hiralal Agrawal ,  Clifford Behrens ,  Balakrishnan Dasarathy

发明人： Hiralal Agrawal ,  Clifford Behrens ,  Balakrishnan Dasarathy

IPC分类号： G06F11/00

CPC分类号： G06F11/0751 ,  G06F11/0706 ,  G06N99/005

摘要： A computer-enabled method of learning the behavior of a program. A processor can execute a target program during a learning interval while varying a plurality of stimuli provided to the target program so as to produce a multiplicity of different sequences of events which differ in combinations of types of events in respective sequences, orders in which the types of events occur in respective sequences, or in the combinations and in the orders in which the types of events occur. The multiplicity of event sequences can be recorded, and a second program can be executed by a processor to: determine a plurality of clusters based on similarities between the event sequences in their entirety; and determine a plurality of signatures corresponding to the plurality of clusters. Each signature can be the longest common subsequence of all sequences in the respective cluster and thus representative of the cluster. In such method, each of the plurality of signatures can be a benchmark representative of acceptable behavior of the target program.

摘要翻译： 一种学习计算机行为的计算机启用方法。 处理器可以在学习间隔期间执行目标程序，同时改变提供给目标程序的多个刺激，以便产生多个不同的事件序列，这些事件序列在各个序列中的事件类型不同，其中类型 的事件发生在各自的序列中，或发生在组合和事件类型的顺序中。 可以记录多个事件序列，并且可以由处理器执行第二程序，以便：根据整个事件序列之间的相似性来确定多个集群; 并且确定与所述多个聚类相对应的多个签名。 每个签名可以是相应集群中所有序列的最长公共子序列，从而代表集群。 在这种方法中，多个签名中的每一个可以是表示目标程序的可接受行为的基准。

公开(公告)号：US08990566B2

公开(公告)日：2015-03-24

申请号：US13775926

申请日：2013-02-25

申请人： TT Government Solutions, Inc.

发明人： Giovanni Di Crescenzo

IPC分类号： H04L29/06 ,  G06F21/60

CPC分类号： H04L63/045 ,  G06F21/602 ,  H04L9/3013 ,  H04L63/062 ,  H04L2209/42 ,  H04L2209/50

摘要： A method and system for providing privacy in a publish-subscribe protocol is provided. A server receives from a third party a topic-based key associated with a tree structure having a pseudonym of a topic as a root and at least one client as a leaf. The server encrypts a key associated with a conditional oblivious transfer protocol using the topic-based key. The server encrypts an item with the key associated with the conditional oblivious transfer protocol. The server transmits the encrypted key and the encrypted item to a plurality of clients. The encrypted item is decryptable by the at least one client with the key associated with the conditional oblivious transfer protocol when the key associated with the conditional oblivious transfer protocol is decryptable with an interest-based key associated with a tree structure having a pseudonym of an interest as a root and the at least one client as a leaf.

摘要翻译： 提供了一种用于在发布 - 订阅协议中提供隐私的方法和系统。 服务器从第三方接收与具有作为根的主题的假名的树结构相关联的基于主题的密钥和作为叶的至少一个客户端。 服务器使用基于主题的密钥加密与条件遗忘传输协议相关联的密钥。 服务器使用与条件遗忘传输协议相关联的密钥加密项目。 服务器将加密的密钥和加密的项目发送到多个客户端。 当与条件遗忘传输协议相关联的密钥可与具有感兴趣的假名的树结构相关联的基于兴趣的密钥可解密时，加密的项目可由至少一个客户端具有与条件遗忘传输协议相关联的密钥解密 作为一个根，至少一个客户端作为叶。

公开(公告)号：US20140209798A1

公开(公告)日：2014-07-31

申请号：US14166975

申请日：2014-01-29

申请人： TT GOVERNMENT SOLUTIONS, INC.

发明人： Ted K. WOODWARD ,  Paul TOLIVER ,  Ibrahim T. OZDUR

IPC分类号： G01J1/02 ,  G01J1/42 ,  G01J1/04

CPC分类号： G02B6/04

摘要： Multimode light detectors are provided, which combine a plurality of measurements of light to detect information, using a mode transformation device. The light may be light from one or more objects, and the mode transformation device may be configured to transform the light into many single mode light beams. Each measurement of the light may be a measurement of a corresponding single mode light beam. The multimode detectors may include one or more optical receivers, configured to mix one or more single mode light beams with one or more local oscillators, respectively. Methods are provided for detecting information of objects, including obtaining light from the objects, transforming the light into multiple single mode light beams, and collecting (and/or combining) measurements of the single mode light beams.

摘要翻译： 提供多模光检测器，其使用模式转换装置组合多个光测量以检测信息。 光可以是来自一个或多个物体的光，并且模式变换装置可以被配置为将光转换成许多单模光束。 光的每次测量可以是对应的单模光束的测量。 多模式检测器可以包括一个或多个光接收器，其被配置为分别将一个或多个单模光束与一个或多个本地振荡器混合。 提供了用于检测物体的信息的方法，包括从物体获得光，将光转换成多个单模光束，以及收集（和/或组合）单模光束的测量。

公开(公告)号：US08787190B2

公开(公告)日：2014-07-22

申请号：US13287376

申请日：2011-11-02

申请人： Stuart Wagner ,  James Giacopelli

发明人： Stuart Wagner ,  James Giacopelli

IPC分类号： H04W24/00

CPC分类号： H04L43/0852 ,  H04L43/0882

摘要： A system, a network node, a router, a method and a program used to determine a bottleneck bandwidth on a multi-hop path between a source and destination node is presented. The method comprises receiving probe packets by a first hop node in the multi-hop path, measuring a bandwidth on a link between the first hop node and a next hop node in the multi-hop path, generating a bandwidth discovery packet including the measured bandwidth, transmitting the BDP to the next hop node, relaying the probe packets to the next hop node, and determining if the next hop node is a last-hop node on the multi-hop path. A last hop node records the measured bandwidth from the BDP, adjusts the delay between the probe packets based upon the bandwidth and relaying the probe packets to the destination node. The destination node determines the bottleneck bandwidth based on the delay between the probe packets.

摘要翻译： 提出了一种用于确定源节点和目的节点之间的多跳路径上的瓶颈带宽的系统，网络节点，路由器，方法和程序。 该方法包括：通过多跳路径中的第一跳节点接收探测分组，测量多跳路径中的第一跳节点与下一跳节点之间的链路上的带宽，生成包含测量带宽的带宽发现分组 将所述BDP发送到下一跳节点，将所述探测分组中继到下一跳节点，以及确定所述下一跳节点是否是所述多跳路径上的最后一跳节点。 最后一跳节点记录来自BDP的测量带宽，根据带宽调整探测报文之间的延迟，并将探测报文中继到目的节点。 目的节点根据探测报文之间的延迟确定瓶颈带宽。

公开(公告)号：US20140337917A1

公开(公告)日：2014-11-13

申请号：US14444475

申请日：2014-07-28

申请人： TT GOVERNMENT SOLUTIONS, INC.

发明人： Sanjai Narain ,  Gary Levin

IPC分类号： H04L29/06

CPC分类号： H04L63/20 ,  G06F7/60 ,  G06F11/00 ,  G06F13/00 ,  G06F13/362 ,  G06F17/00 ,  G06F21/604 ,  G06F21/62 ,  G06F21/6209 ,  G06F21/6218 ,  G06F2221/2113 ,  H04L29/06823 ,  H04L63/10

摘要： A system and method is provided for verifying an access-control policy against a particular constraint for a multi-step operation. In disclosed embodiments, the method includes expressing the access-control policy as a first quantifier-free form (QFF) constraint and identifying the particular constraint as a second QFF constraint. The method also includes identifying an operation vector and providing copies of the operation vector associated with steps in the multi-step operation. The method also includes determining a third QFF constraint using the first QFF constraint, the second QFF constraint, and the copies of the operation vector. The method also includes solving the third QFF constraint to determine a solution and outputting a result of the solving.

摘要翻译： 提供了一种用于根据多步骤操作的特定约束来验证访问控制策略的系统和方法。 在所公开的实施例中，该方法包括将访问控制策略表示为第一无量词自由形式（QFF）约束并且将特定约束识别为第二QFF约束。 该方法还包括识别操作向量并提供与多步操作中的步骤相关联的操作向量的副本。 该方法还包括使用第一QFF约束，第二QFF约束和操作矢量的副本来确定第三QFF约束。 该方法还包括解决第三个QFF约束以确定解并输出求解的结果。