专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

91. 发明申请

US20100242020A1 SCA-BASED SYSTEM, AND FILE PARSING METHOD AND APPLICATION GENERATION METHOD THEREOF 审中-公开
标题翻译：基于SCA的系统，以及文件分配方法及其应用生成方法
公开(公告)号：US20100242020A1
公开(公告)日：2010-09-23
申请号：US12681275
申请日：2008-05-08
申请人： Eun Seon Cho , Nam Hoon Park
发明人： Eun Seon Cho , Nam Hoon Park
IPC分类号： G06F9/44 , G06F17/30
CPC分类号： G06F8/427 , G06F8/61
摘要： The present invention relates to a software communications architecture (SCA)-based system, and a file parsing method and an application generation method thereof. In the present invention, the SCA-based system integrates parsers related to application driving into one parser to generate one integration parser, and implements a parser manager that executes an integration parser function by a common object request broker architecture (CORBA) component. Therefore, when the other manager components need information of descriptor files related to application driving, the other manager components request it from the parser manager of the corresponding information without generating a new parser, and the parser manager provides the corresponding information to the other manager components.
摘要翻译：本发明涉及一种基于软件通信架构（SCA）的系统，以及一种文件解析方法及其应用生成方法。在本发明中，基于SCA的系统将与应用驱动相关的解析器集成到一个解析器中以生成一个集成解析器，并且实现通过公共对象请求代理体系结构（CORBA）组件执行集成解析器功能的解析器管理器。因此，当其他管理器组件需要与应用程序驱动相关的描述符文件的信息时，其他管理器组件从解析器管理器请求相应信息，而不生成新的解析器，并且解析器管理器将对应的信息提供给其他管理器组件。

92. 发明申请

US20100115287A1 SYSTEM AND METHOD FOR OBFUSCATING CONSTANTS IN A COMPUTER PROGRAM 有权
标题翻译：在计算机程序中实现常数的系统和方法
公开(公告)号：US20100115287A1
公开(公告)日：2010-05-06
申请号：US12263183
申请日：2008-10-31
申请人： Pierre BETOUIN , Mathieu Ciet , Augustin J. Farrugia
发明人： Pierre BETOUIN , Mathieu Ciet , Augustin J. Farrugia
IPC分类号： G06F21/00
CPC分类号： G06F21/125 , G06F8/41 , G06F8/42 , G06F8/427 , G06F8/433 , G06F8/434
摘要： Disclosed herein are systems, computer-implemented methods, and tangible computer-readable media for obfuscating constants in a binary. The method includes generating a table of constants, allocating an array in source code, compiling the source code to a binary, transforming the table of constants to match Pcode entries in an indirection table so that each constant in the table of constants can be fetched by an entry in the indirection table. A Pcode is a data representation of a set of instructions populating the indirection table with offsets toward the table of constants storing the indirection table in the allocated array in the compiled binary. The method further includes populating the indirection table with offsets equivalent to the table of constants, and storing the indirection table in the allocated array in the compiled binary. Constants can be of any data type. Constants can be one byte each or more than one byte each. In one aspect, the method further includes splitting constants into two or more segments, treating each segment as a separate constant when transforming the table of constants, and generating a function to retrieve and reconstruct the split constants.
摘要翻译：这里公开的是系统，计算机实现的方法和用于在二进制文件中混淆常数的有形计算机可读介质。该方法包括生成常量表，在源代码中分配数组，将源代码编译为二进制，将常数表变换为匹配间接表中的Pcode条目，以使常数表中的每个常数可以由间接表中的条目。 Pcode是填充间接表的一组指令的数据表示，其具有偏向于在编译的二进制文件中分配的阵列中存储间接表的常数表的偏移。该方法还包括使用与常数表相当的偏移量来填充间接表，并将该间接表存储在编译后的二进制数组中。常量可以是任何数据类型。常量可以是一个字节，也可以是一个以上的字节。在一个方面，该方法还包括将常数分成两个或更多个段，当变换常数表时，将每个段作为单独的常数来处理，以及生成检索和重构分裂常数的函数。

93. 发明申请

US20090235238A1 CONDENSING PATTERN MATCHER GENERATION FOR INTERMEDIATE LANGUAGE PATTERNS 有权
标题翻译：用于中间语言模式的冷凝图形匹配生成
公开(公告)号：US20090235238A1
公开(公告)日：2009-09-17
申请号：US12047866
申请日：2008-03-13
申请人： Kevin A. Stoodley , Arie Tal
发明人： Kevin A. Stoodley , Arie Tal
IPC分类号： G06F9/45
CPC分类号： G06F8/427
摘要： Embodiments of the present invention address deficiencies of the art in respect to pattern matcher generation and provide a method, system and computer program product for automatic pattern matching and generation of intermediate language patterns. In one embodiment of the invention, a pattern matcher generation method can be provided. The method can include identifying input elements from intermediate language code, reducing the identified input elements from the intermediate language code to inputs of common and unique use, creating a unifiable form for each of the input elements of common and unique use, and generating a pattern matcher for each of the input elements of common and unique use in the intermediate language code using a corresponding unifiable form in place of each of the input elements of common and unique use. In particular, the generated pattern matcher can be EMTF conformant.
摘要翻译：本发明的实施例解决了与图案匹配器生成有关的技术缺陷，并且提供了用于自动模式匹配和中间语言模式生成的方法，系统和计算机程序产品。在本发明的一个实施例中，可以提供模式匹配器生成方法。该方法可以包括从中间语言代码识别输入元素，将所识别的输入元素从中间语言代码减少到公共和独特使用的输入，为共同和独特使用的每个输入元素创建一个可统一的形式，以及生成模式使用相应的可统一形式代替共同和独特使用的每个输入元素的中间语言代码中的每个输入元素的共同和唯一使用的匹配器。特别地，生成的模式匹配器可以是符合EMTF的。

94. 发明授权

US07577633B2 Self learning event parser 有权
标题翻译：自学习事件解析器
公开(公告)号：US07577633B2
公开(公告)日：2009-08-18
申请号：US11633627
申请日：2006-12-05
申请人： Sanjeev Shankar , Chris Thiessen , Michael Corke , Chris Gordon , Andrew Selkirk , Alan Lefort
发明人： Sanjeev Shankar , Chris Thiessen , Michael Corke , Chris Gordon , Andrew Selkirk , Alan Lefort
IPC分类号： G06F17/00 , G06N5/02
CPC分类号： G06F8/427
摘要： An adaptive parser capable of automatically reordering expressions such that more commonly matched expressions are tested earlier than less commonly matched expressions; by reordering the expressions in this manner, less frequently matched expressions are less frequently tested, or may not be tested at all, thereby lowering the overall number of tests and increasing the amount of data that can be parsed in a given time period.
摘要翻译：一种能够自动重新排序表达式的自适应解析器，使得比较少匹配的表达式更早地测试更常见的匹配表达式; 通过以这种方式重新排序表达式，较不频繁地测试较少频繁匹配的表达式，或者可能根本不进行测试，从而降低测试的总数并增加在给定时间段内可以解析的数据量。

95. 发明申请

US20090178031A1 Method and System for presenting and analyzing software source code through intermediate representation 失效
标题翻译：通过中间表示来呈现和分析软件源代码的方法和系统
公开(公告)号：US20090178031A1
公开(公告)日：2009-07-09
申请号：US11971904
申请日：2008-01-09
申请人： KAN ZHAO
发明人： KAN ZHAO
IPC分类号： G06F9/45
CPC分类号： G06F8/427
摘要： The present invention provides a method and system for producing intermediate representation of source code listings with possibly mixed syntaxes to assist software development applications in presenting and analyzing the source code listings through reading the intermediate representation. A source code processor calls Application Programming Interfaces (APIs) to preserve source code information, which includes intermediate representation data sets and is preferably stored in a file-based repository. The source code processor is of a compiler, a preprocessor, a parser, or a comment document processor. The data sets capture lexical, syntax and semantic information of source code construct elements, and comprise of location, processor identification, construct category, and attribute data. A software development environment through a source code search engine is able to present source code construct elements, outlines, and symbol references from software packages over a plurality of distributed servers in a network such as the Internet.
摘要翻译：本发明提供了一种用于产生具有可能混合语法的源代码列表的中间表示的方法和系统，以通过读取中间表示来帮助软件开发应用呈现和分析源代码列表。源代码处理器调用应用编程接口（API）来保留源代码信息，其中包括中间表示数据集，并且优选地存储在基于文件的存储库中。源代码处理器是编译器，预处理器，解析器或注释文档处理器。数据集捕获源代码构造元素的词汇，语法和语义信息，包括位置，处理器识别，构造类别和属性数据。通过源代码搜索引擎的软件开发环境能够通过诸如因特网的网络中的多个分布式服务器从软件包呈现源代码构造元素，轮廓和符号引用。

96. 发明授权

US07555755B2 System and method for navigating data 有权
标题翻译：用于导航数据的系统和方法
公开(公告)号：US07555755B2
公开(公告)日：2009-06-30
申请号：US10357284
申请日：2003-02-03
申请人： John Fairweather
发明人： John Fairweather
IPC分类号： G06F3/00 , G06F9/44 , G06F9/46 , G06F13/00
CPC分类号： G06K13/0825 , G06F8/427 , G06F9/4493 , Y10S707/913 , Y10S707/966 , Y10S707/99931 , Y10S707/99933 , Y10S707/99942
摘要： The present invention provides a dynamic hyperlinking architecture that permits a user to enable/disable hyperlink domains that are automatically applied to every bit of textual data present in the system or displayed to the user. The present invention includes synchronous and asynchronous, inter-thread function calls, including support for function overrides in a threaded scope dependent manner. The present invention also supports broadcast (multiple call) call configurations and run-time examination of function registries. In the preferred embodiment, the system comprises a threaded environment, threaded type dependant symbolic functions and a hyperlinking system uses both the threaded environment and symbolic functions to dynamically create links to data and functions that are displayed and/or executed responsive to user selection of a link.
摘要翻译：本发明提供一种动态超链接体系结构，其允许用户启用/禁用自动应用于系统中存在的或显示给用户的文本数据的每一位的超链接域。本发明包括同步和异步的线程间函数调用，包括以线程范围依赖的方式支持功能覆盖。本发明还支持功能注册表的广播（多呼叫）呼叫配置和运行时检查。在优选实施例中，系统包括线程环境，线程类型相关符号功能，超链接系统使用线程环境和符号函数来动态地创建链接到响应于用户选择的数据和/或执行的数据和/ 链接。

97. 发明授权

US07398463B2 High performance freeze-dried dynamic web page generation 有权
公开(公告)号：US07398463B2
公开(公告)日：2008-07-08
申请号：US10203037
申请日：2001-02-03
申请人： Keith Bernstein , Robert Kieffer
发明人： Keith Bernstein , Robert Kieffer
IPC分类号： G06F17/00
CPC分类号： G06F17/30896 , G06F8/427 , G06F17/21 , G06F17/2247 , G06F17/3089 , G06F17/30893 , G06F17/30902 , H04L67/1097
摘要： Dynamic web page generation is optimized by reducing the processing overhead required to parse the web page HTML code for tokens and insert dynamic content. Using the invention, an HTML file for a dynamic web page need be read and parsed only once throughout the life of the server. A software object parses the HTML, decomposes the page into constituent pieces and saves them to data structures as byte streams, which are cached, along with the software object, rendering multiple disk accesses unnecessary when the page is reconstituted. For subsequent requests, the dynamic page is created from the cached version, which is shareable across users and across requests. The optimization reduces server resource usage for dynamic page generation to near zero. The invention is also applicable to other documents combining static and dynamic content that require composition tools for editing.

98. 发明申请

US20080127056A1 Generation of managed assemblies for networks 有权
标题翻译：生成网络的托管程序集
公开(公告)号：US20080127056A1
公开(公告)日：2008-05-29
申请号：US11502145
申请日：2006-08-09
申请人： Punit Java , Stephan Schueerholz , Pranish Kumar , Jered D. Aasheim , Jason Whitehorn , Cory Hendrixson , Robert Houser
发明人： Punit Java , Stephan Schueerholz , Pranish Kumar , Jered D. Aasheim , Jason Whitehorn , Cory Hendrixson , Robert Houser
IPC分类号： G06F9/44
CPC分类号： G06F8/427 , G06F8/30 , H04L29/06
摘要： A network toolset enables developers to automatically generate a C header file and underlying signal software, as well as automatically generate a managed code assembly from a network description. The managed code assembly can be generated in a binary format and may include sufficient metadata to support extended functionalities for a network. The managed code assembly can be relatively easily integrated with an existing image (e.g., machine code for a network device) without any compilation required. A software development kit can also be generated to help programmers manage the generated assemblies.
摘要翻译：网络工具集使开发人员能够自动生成C头文件和底层信号软件，以及从网络描述自动生成托管代码组合。托管代码组件可以以二进制格式生成，并且可以包括足够的元数据以支持网络的扩展功能。托管代码组件可以相对容易地与现有图像（例如，用于网络设备的机器代码）集成，而不需要任何编译。还可以生成软件开发工具包来帮助程序员管理生成的程序集。

99. 发明申请

US20080072216A1 Method and device for ANBF string pattern matching and parsing 审中-公开
标题翻译： ANBF字符串模式匹配和解析的方法和设备
公开(公告)号：US20080072216A1
公开(公告)日：2008-03-20
申请号：US11905199
申请日：2007-09-28
申请人： Baohua Zhao , Zhiwei Jin , Yugui Qu , Hao Zhou , Shuo Wang , Qiyue Li , Chao Lv , Ye Tian
发明人： Baohua Zhao , Zhiwei Jin , Yugui Qu , Hao Zhou , Shuo Wang , Qiyue Li , Chao Lv , Ye Tian
IPC分类号： G06F9/45
CPC分类号： G06F8/427
摘要： A method and an apparatus for string pattern matching and parsing based on ABNF syntax. The method includes: defining an instruction set suitable for describing a string pattern rule; designing a compiler capable of translating the protocol rule described in ABNF syntax into a protocol rule described with the instruction set and an object code; designing a hardware parser according to the characteristics of the instruction set, the parser comprising a module implemented by a special hardware for supporting the corresponding instruction, thereby realizing string pattern matching and parsing.
摘要翻译：一种基于ABNF语法的字符串模式匹配和解析的方法和装置。该方法包括：定义适合于描述字符串模式规则的指令集; 设计一种能够将ABNF语法中描述的协议规则转换为用指令集和目标代码描述的协议规则的编译器; 根据指令集的特性设计硬件解析器，解析器包括由用于支持相应指令的专用硬件实现的模块，从而实现字符串模式匹配和解析。

100. 发明申请

US20080072215A1 Parser for signomial and geometric programs 审中-公开
标题翻译：点阵和几何程序的解析器
公开(公告)号：US20080072215A1
公开(公告)日：2008-03-20
申请号：US11986253
申请日：2007-11-19
申请人： Stephen Boyd , Xiling Shen , Mar Hershenson , Lieven Vandenberghe , Cesar Crusius , Dave Colleran , Sunderarjan Mohan
发明人： Stephen Boyd , Xiling Shen , Mar Hershenson , Lieven Vandenberghe , Cesar Crusius , Dave Colleran , Sunderarjan Mohan
IPC分类号： G06F9/44
CPC分类号： G06F17/11 , G06F8/427
摘要： A method and apparatus for parsing signomial and geometric programs, referred to herein as “the Parser”. Signomial and Geometric programming is a unique class of mathematical problems that is useful in the study of optimization problems. The Parser is a program designed to recognize and parse both signomial and geometric programs such that they may be accepted and solved by signomial and geometric program solvers. The Parser accepts an optimization problem from a user in the form of algebraic expressions. The Parser can then identify the problem as a signomial program and can further determine if it reduces to a geometric program. If either a signomial or geometric program exists, the Parser converts the algebraic expressions to a compact numeric format that can be accepted by a computer-aided solver. In the case of a geometric program, the solver may find a global solution to the optimization problem. However, in the case of signomial program, the solver may only find a local solution. The solution found by the solver is routed back to the Parser which reports it in a user-readable format.
摘要翻译：用于解析符号和几何程序的方法和装置，这里称为“解析器”。符号和几何编程是一类独特的数学问题，在优化问题的研究中是有用的。解析器是一种旨在识别和解析符号和几何程序的程序，使得它们可以被符号和几何程序解算器接受和解决。解析器以代数表达式的形式接受用户的优化问题。然后，解析器可以将问题识别为签名程序，并且可以进一步确定它是否减少到几何程序。如果存在符号或几何程序，则Parser将代数表达式转换为可由计算机辅助求解器接受的紧凑数字格式。在几何程序的情况下，求解器可以找到优化问题的全局解。然而，在签名程序的情况下，求解器只能找到本地解决方案。解决方案找到的解决方案被路由回到以用户可读格式报告的解析器。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式