公开(公告)号：US20060174345A1

公开(公告)日：2006-08-03

申请号：US11291511

申请日：2005-11-30

申请人： Michael Flanagan ,  Peter Duthie ,  Peter Bisroev ,  Teewoon Tan ,  Darren Williams ,  Robert Barrie ,  Stephen Gould

发明人： Michael Flanagan ,  Peter Duthie ,  Peter Bisroev ,  Teewoon Tan ,  Darren Williams ,  Robert Barrie ,  Stephen Gould

IPC分类号： G06F12/14

CPC分类号： G06F21/554 ,  G06F21/56 ,  G06F21/562 ,  G06F21/564 ,  G06Q10/107 ,  H04L51/12 ,  H04L63/1416 ,  H04L63/1441 ,  H04L63/145

摘要： A data classification system identifies and processes malicious data that may be present in a received data stream. The system includes at least two stages, and a data flow module. The data flow module derives, from an input data stream, a first processed data stream that is transmitted to the first processing stage. The first processing stage derives, from the first processed data stream, a second processed data stream that is transmitted to the second processing stage. The first and second processing stages optionally derive meta data from the data they receive.

摘要翻译： 数据分类系统识别并处理可能存在于接收的数据流中的恶意数据。 该系统至少包括两个阶段，以及数据流模块。 数据流模块从输入数据流中导出发送到第一处理级的第一处理数据流。 第一处理阶段从第一处理数据流导出发送到第二处理阶段的第二处理数据流。 第一和第二处理阶段可选地从它们接收的数据中导出元数据。

公开(公告)号：US20060085389A1

公开(公告)日：2006-04-20

申请号：US11213622

申请日：2005-08-26

申请人： Michael Flanagan ,  Darren Williams ,  Stephen Gould ,  Robert Barrie ,  Teewoon Tan

发明人： Michael Flanagan ,  Darren Williams ,  Stephen Gould ,  Robert Barrie ,  Teewoon Tan

IPC分类号： G06F17/30 ,  G06F7/00

CPC分类号： G06F16/90344 ,  H04L63/1416 ,  H04L63/145

摘要： A method and apparatus for transforming regular expressions into a less resource intensive representation is disclosed. The method and apparatus converts a collection of regular expressions into a multi-level representation in which the memory requirements of the lowest level representation is reduced when compared with a conventional finite state automaton representation. The method and apparatus converts a collection of regular expressions into a collection of segments and a higher level representation in a way that retains the semantics of the original set of regular expressions. This transformation is performed through the use of an intermediate form. The resulting representation and collection admit an implementation which avoids the potentially costly memory requirements of a traditional implementation of the original expressions.

摘要翻译： 公开了一种用于将正则表达式转换为较少资源密集型表示的方法和装置。 该方法和装置将正则表达式的集合转换为与常规有限状态自动机表示相比最低级表示的存储器要求减小的多级表示。 该方法和装置以保持原始正则表达式集的语义的方式将正则表达式的集合转换为段的集合和较高级表示。 这种转换是通过使用中间形式进行的。 所得到的表示和集合承认了一种实现，其避免了原始表达式的传统实现的潜在昂贵的存储器需求。

公开(公告)号：US20050035784A1

公开(公告)日：2005-02-17

申请号：US10850978

申请日：2004-05-21

申请人： Stephen Gould ,  Ernest Peltzer ,  Robert Barrie ,  Michael Flanagan ,  Darren Williams

发明人： Stephen Gould ,  Ernest Peltzer ,  Robert Barrie ,  Michael Flanagan ,  Darren Williams

IPC分类号： G06F20060101 ,  G06F7/38 ,  G06F9/44 ,  G06F17/50 ,  H01L20060101

CPC分类号： G06F9/4498

摘要： A programmable finite state machine (FSM) includes, in part, a first address calculation logic block, a first lookup table, a second address calculation logic block, and a second lookup table. The first address calculation logic block generates an address for the first lookup table based on the received input symbol and the current state. The data stored in first look-up table at the generated address is used by the second address calculation logic block to compute an address for the second lookup table. Data stored in the second lookup table is the next state to which the FSM transitions. The programmable FSMs uses redundant information of the transition table to compress these transitions and thus requires a smaller memory while maintaining a high data throughput. The data in the first and second lookup tables are coded and supplied by a compiler. The FSM operation may optionally be pipelined.

摘要翻译： 可编程有限状态机（FSM）部分地包括第一地址计算逻辑块，第一查找表，第二地址计算逻辑块和第二查找表。 第一地址计算逻辑块基于接收到的输入符号和当前状态生成第一查找表的地址。 存储在生成地址的第一查找表中的数据由第二地址计算逻辑块用于计算第二查找表的地址。 存储在第二查找表中的数据是FSM转换到的下一个状态。 可编程FSM使用过渡表的冗余信息来压缩这些转换，因此需要较小的存储器，同时保持较高的数据吞吐量。 第一和第二查找表中的数据由编译器编码和提供。 FSM操作可以可选地被流水线化。

公开(公告)号：US20050028114A1

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

申请号：US10850979

申请日：2004-05-21

申请人： Stephen Gould ,  Robert Barrie ,  Michael Flanagan ,  Darren Williams

发明人： Stephen Gould ,  Robert Barrie ,  Michael Flanagan ,  Darren Williams

IPC分类号： G06F20060101 ,  G06F7/38 ,  G06F9/44 ,  G06F17/50 ,  H01L20060101

CPC分类号： G06F9/4498

摘要： The states associated with a programmable state machine are reordered to compress the storage of transitions which define the state machine. To reorder the states, a score is computed and assigned to each of the states. Next, the states are sorted according to their computed scores. In some embodiments, to compute the score for each current state based on the received input symbol, the number of times that the input symbol causes transition to similar states is added. The sum of the scores in each row of the table is representative of the score for the associated current state associated with that row. The states are sorted according to their score and a new state transition table is generated in accordance with the reordered states.

摘要翻译： 与可编程状态机相关联的状态被重新排序以压缩定义状态机的转换的存储。 要重新排序状态，计算得分并分配给每个状态。 接下来，根据它们的计算分数对状态进行排序。 在一些实施例中，为了基于接收到的输入符号来计算每个当前状态的得分，输入符号引起转变到类似状态的次数被增加。 表中每行的分数之和表示与该行相关联的当前状态的分数。 状态根据其分数进行排序，并根据重新排列的状态生成新的状态转换表。

公开(公告)号：US07411418B2

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

申请号：US10850979

申请日：2004-05-21

申请人： Stephen Gould ,  Robert Matthew Barrie ,  Michael Flanagan ,  Darren Williams

发明人： Stephen Gould ,  Robert Matthew Barrie ,  Michael Flanagan ,  Darren Williams

IPC分类号： G06F7/38 ,  H03K19/173

CPC分类号： G06F9/4498

摘要： The states associated with a programmable state machine are reordered to compress the storage of transitions which define the state machine. To reorder the states, a score is computed and assigned to each of the states. Next, the states are sorted according to their computed scores. In some embodiments, to compute the score for each current state based on the received input symbol, the number of times that the input symbol causes transition to similar states is added. The sum of the scores in each row of the table is representative of the score for the associated current state associated with that row. The states are sorted according to their score and a new state transition table is generated in accordance with the reordered states.

摘要翻译： 与可编程状态机相关联的状态被重新排序以压缩定义状态机的转换的存储。 要重新排序状态，计算得分并分配给每个状态。 接下来，根据它们的计算分数对状态进行排序。 在一些实施例中，为了基于接收到的输入符号来计算每个当前状态的得分，输入符号导致转变到类似状态的次数被增加。 表中每行的分数之和表示与该行相关联的当前状态的分数。 状态根据其分数进行排序，并根据重新排列的状态生成新的状态转换表。

公开(公告)号：US07180328B2

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

申请号：US10850978

申请日：2004-05-21

申请人： Stephen Gould ,  Ernest Peltzer ,  Robert Matthew Barrie ,  Michael Flanagan ,  Darren Williams

发明人： Stephen Gould ,  Ernest Peltzer ,  Robert Matthew Barrie ,  Michael Flanagan ,  Darren Williams

IPC分类号： H03K19/173 ,  G06F7/38

CPC分类号： G06F9/4498

摘要： A programmable finite state machine (FSM) includes, in part, a first address calculation logic block, a first lookup table, a second address calculation logic block, and a second lookup table. The first address calculation logic block generates an address for the first lookup table based on the received input symbol and the current state. The data stored in first look-up table at the generated address is used by the second address calculation logic block to compute an address for the second lookup table. Data stored in the second lookup table is the next state to which the FSM transitions. The programmable FSMs uses redundant information of the transition table to compress these transitions and thus requires a smaller memory while maintaining a high data throughput. The data in the first and second lookup tables are coded and supplied by a compiler. The FSM operation may optionally be pipelined.

摘要翻译： 可编程有限状态机（FSM）部分地包括第一地址计算逻辑块，第一查找表，第二地址计算逻辑块和第二查找表。 第一地址计算逻辑块基于接收到的输入符号和当前状态生成第一查找表的地址。 存储在生成地址的第一查找表中的数据由第二地址计算逻辑块用于计算第二查找表的地址。 存储在第二查找表中的数据是FSM转换到的下一个状态。 可编程FSM使用过渡表的冗余信息来压缩这些转换，因此需要较小的存储器，同时保持较高的数据吞吐量。 第一和第二查找表中的数据由编译器编码和提供。 FSM操作可以可选地被流水线化。

公开(公告)号：US20080119752A1

公开(公告)日：2008-05-22

申请号：US11681163

申请日：2007-03-01

申请人： Michael Flanagan

发明人： Michael Flanagan

IPC分类号： A61B5/083

CPC分类号： A61B5/4866 ,  A61B5/0833 ,  A61B5/0836

摘要： According to the present invention in a first aspect, there is provided an apparatus for determining the type of fuel burnt by a user, the apparatus comprising an oxygen sensor and a carbon dioxide sensor, and wherein the oxygen sensor and the carbon dioxide sensor are operable to establish the type of fuel burnt by a user of the apparatus.

摘要翻译： 根据本发明的第一方面，提供了一种用于确定用户燃烧的燃料类型的装置，该装置包括氧传感器和二氧化碳传感器，并且其中氧传感器和二氧化碳传感器可操作 以建立由装置的使用者燃烧的燃料的类型。

公开(公告)号：US07194020B1

公开(公告)日：2007-03-20

申请号：US09591560

申请日：2000-06-09

申请人： Emad N. Farag ,  Michael Flanagan

发明人： Emad N. Farag ,  Michael Flanagan

IPC分类号： H04B1/00

CPC分类号： H04W52/028 ,  Y02D70/00

摘要： A method for detecting packet data transmission following an inactive period of a transmitter. The method includes using a dynamic acquisition search window which grows from an initial width (determined by the size of the corresponding standard search window prior to entering the inactive period) up to a maximum width (for example, the width of a full cell) in correspondence with the length of time that the transmitter is in the inactive state. The method is particularly directed to a mobile transmitter having active and inactive periods. The method according to the present invention is also useful relative to streaming data, such as voice, including a plurality of multipath components.

摘要翻译： 一种用于在发射机的非活动时段之后检测分组数据传输的方法。 该方法包括使用动态采集搜索窗口，其从初始宽度（由进入非活动时段之前的对应标准搜索窗口的大小确定）直到最大宽度（例如，全小区的宽度）在 与发射机处于非活动状态的时间长度的对应关系。 该方法特别涉及具有活动和非活动时段的移动发射机。 根据本发明的方法对于包括多个多路径分量的诸如语音的流数据也是有用的。

公开(公告)号：US20060174728A1

公开(公告)日：2006-08-10

申请号：US11055302

申请日：2005-02-09

申请人： Michael Flanagan

发明人： Michael Flanagan

IPC分类号： B67B7/46 ,  B67B7/00 ,  B67B7/18 ,  B67B7/14

CPC分类号： B67B7/18

摘要： The invention provides a novel, easy to use, hand-operated apparatus for effortlessly loosening the threaded lid of ajar or bottle having a screw-on lid and readily accommodates jars or bottles of different sizes. One form of the invention includes a base having a jar supporting surface, a generally vertically extending guide column connected to the base and a carriage assembly connected to the guide for movement relative to the guide between a first raised position and a second lowered position. Novel features of the invention include the provision of a helical drive screw which drives a jar lid engaging assembly and a novel safety clutch mechanism which prevents the exertion of excessive force on the jar being opened.

摘要翻译： 本发明提供了一种新颖的，易于使用的手动操作的装置，用于轻松松开具有螺旋盖的一个或多个瓶子的螺纹盖，并容易地容纳不同尺寸的罐或瓶。 本发明的一种形式包括具有罐支撑表面的基座，连接到基座的大致垂直延伸的引导柱和连接到引导件的托架组件，用于相对于引导件在第一升高位置和第二降低位置之间移动。 本发明的新颖特征包括提供驱动罐盖接合组件的螺旋驱动螺杆和新颖的安全离合器机构，其防止在打开的罐上施加过大的力。

公开(公告)号：US20060269576A1

公开(公告)日：2006-11-30

申请号：US11140457

申请日：2005-05-27

申请人： Peter Moldt ,  Ove Pedersen ,  Klaus Theobald ,  Michael Flanagan

发明人： Peter Moldt ,  Ove Pedersen ,  Klaus Theobald ,  Michael Flanagan

IPC分类号： A61K39/35 ,  A61K39/36

CPC分类号： A61K39/35 ,  A61K39/36 ,  A61K2039/54

摘要： Methods and compositions are disclosed for the reduction of immune responses to an exogenous allergen. The reduction is obtained by pre-treatment or pre-conditioning, without injection, of a subject with the allergen so as to reduce immune responses in the subject upon additional exposure to the allergen. The invention is advantageously used in a variety of contexts, including seasonal allergies wherein pre-treatment or pre-conditioning is performed before the onset of the seasonal allergy.

摘要翻译： 公开了减少对外源性变应原的免疫应答的方法和组合物。 通过预处理或预处理而不注射受试者与变应原来获得还原，以便在额外暴露于变应原时降低受试者的免疫应答。 本发明有利地用于各种情况，包括在季节性变态反应发作之前进行预处理或预处理的季节性过敏。