5475 results about "Programming language" patented technology

A computer readable storage medium has executable instructions to perform an automated analysis of program instructions. The automated analysis includes at least two analyses selected from an automated analysis of injection vulnerabilities, an automated analysis of potential repetitive attacks, an automated analysis of sensitive information, and an automated analysis of specific HTTP attributes. Protective instructions are inserted into the program instructions. The protective instructions are utilized to detect and respond to attacks during execution of the program instructions.

A subscriber characterization system is presented in which the subscriber's selections are monitored, including monitoring of the time duration programming is watched, the volume at which the programming is listened to, and any available information regarding the type of programming, including category and sub-category of the programming. The characterization system can extract textual information related to the programming from closed captioning data, electronic program guides, or other text sources associated with the programming. The extracted information is used to form program characteristics vectors. The programming characteristics vectors can be used in combination with the subscriber selection data to form a subscriber profile. Heuristic rules indicating the relationships between programming choices and demographics can be applied to generate additional probabilistic information regarding demographics and programming and product interests.

The present invention relates to a method and apparatus for explicit filtering in ambiguous text entry. The invention provides embodiments including various explicit text entry methodologies, such as 2-key and long pressing. The invention also provides means for matching words in a database using build around methodology, stem locking methodology, word completion methodology, and n-gram searches.

The user is allowed to automatically generate a program by using a visual programming method and a system adopting the method for automatically generating a program wherein an object selection means 8 is used for selecting a behavioral graphical object defining the behavior of a load connected thereto, a behavior selection means 9 is used for selecting the type of the behavior of the behavioral graphical object, a relevant object selection means 10 is used for selecting relevant graphical objects related to the behavior of the behavioral graphical object and a behavioral rule setting means 11 is used for setting behavioral rules of the behavioral graphical object whereas a behavioral characteristic selection unit 3509 is used for selecting a behavior of a behavioral graphical object selected by using a behavioral object selection unit 3508, behavioral condition setting unit 3510 is used for setting conditions for the behavior of the behavioral graphical object and a relevant object selection unit 3511 is used for defining a relation.

Systems and processes for unified language modeling are provided. In accordance with one example, a method includes, at an electronic device with one or more processors and memory, receiving a character of a sequence of characters and determining a current character context based on the received character of the sequence of characters and a previous character context. The method further includes determining a current word representation based on the current character context and determining a current word context based on the current word representation and a previous word context. The method further includes determining a next word representation based on the current word context and providing the next word representation.

A system and method for representing, storing and retrieving real-world knowledge on a computer or network of computers is disclosed. Knowledge is broken down into permanent atomic “facts” which can be stored in a standard relational database and processed very efficiently. It also provides for the efficient querying of a knowledge base, efficient inference of new knowledge and translation into and out of natural language. Queries can also be processed with full natural language explanations of where the answers came from. The method can also be used in a distributed fashion enabling the system to be a large network of computers and the technology can be integrated into a web browser adding to the browser's functionality.

A method for suggesting transliteration for user inputs, comprising: receiving an original user input composed of alpha-numeric characters; identifying the possibility of transliterating the input; determining at least one potential transliteration by performing at least one of the following (1) replacing a sequence of characters in the original input to a possible sequence of Arabic characters (2) determining the probabilities of the potential transliterated alternatives to the user input; and electing the most likely transliteration according to some predetermined criteria (3) verifying the suggested output against a validation repository, the validation repository having a large corpus of Arabic words.

A universal plug and play (UPnP) device makes itself known through a set of processes—discovery, description, control, eventing, and presentation. Following discovery of a UPnP device, an entity can learn more about the device and its capabilities by retrieving the device's description. The description includes vendor-specific manufacturer information like the model name and number, serial number, manufacturer name, URLs to vendor-specific Web sites, etc. The description also includes a list of any embedded devices or services, as well as URLs for control, eventing, and presentation. The description is written by a vendor, and is usually based on a device template produced by a UPnP forum working committee. The template is derived from a template language that is used to define elements to describe the device and any services supported by the device. The template language is written using an XML-based syntax that organizes and structures the elements.

The present application is directed towards systems and methods for dynamically creating a substitution template from a conditional pattern template to transform code objects from a source installation to a target installation. Variable tokens in a pattern template may be dynamically replaced with corresponding values from a source object, and conditional statements of the pattern template analyzed and dynamically applied to build a substitution template for creating a replacement object for the source object.

A device for generating metadata for a programming event receives data corresponding to a programming event that includes descriptive information and timing information. The device analyzes the data to determine goodness of fit scores for the programming event corresponding to categories of a classification hierarchy. The device then stores metadata for the programming event that includes goodness of fit scores, time data and descriptive data. The stored goodness of fit scores may be a representative subset of all goodness of fit scores for the programming event. Also disclosed are processes performed in a device for generating metadata for programming events. Also disclosed is metadata encoded in a computer readable medium. The metadata includes a programming event identifier, descriptive data describing the programming event, time data enabling determination of a start time and duration of the programming event, and goodness of fit scores for the programming event that are associated with categories of the classification hierarchy.

A referenceless self-clocking (n,k) bar code word allows conveyance of information without the need of any start and/or stop code pattern or other reference; a code word pattern is repeated at least in part without space therebetween according to a given n,k coding convention so that any k pair of adjacent data code elements sensed by any sensing means according to the n,k coding convention will consist of n units (e.g., bar code modules), thus allowing the data code elements of the code word to be decoded most accurately without any reference pattern. One application of this coding is on round or cylindrical objects like coins, casino chips and the like, and this coding is also well suited for linear or other coding applications wanting to convey coded information without the use of a start/stop code or reference pattern using n,k coding. This coding may or mayn't include error control, for example, as disclosed herein.

Remote Procedure Call (RPC) is implemented using XML-based message encoding wherein elements in the message corresponding to arguments of the RPC are associated with element type indicators selected from a defined set. The type indicators may allow the message itself to identify structural aspects of the message, particularly useful in the context of array elements, but useful for other types of elements as well.

Disclosed is a system, method, and program for generating trace statements to a log file. A log method in a program, such as a Java program, including an identifier parameter is processed. The program includes multiple instances of the log method to trace the execution of the program during debugging operations. A determination is made as to whether a variable indicates that log methods called with the identifier parameter should be processed. The class and method from which the log method was called is determined if the variable indicates that log methods called with the identifier parameter should be processed. Information on the identifier parameter and determined class and method are written to the log file.

Systems and methods are provided for deleting viewed portions of recorded programs. In one embodiment, a media guidance application may provide a list of recorded programs, where each recorded program in the list includes an indication of an amount of time that the recorded program has been viewed. From the list, a user may flag the viewed portions of one or more recorded programs for deletion. In some embodiments, the media guidance application may provide a delete prompt in response to a user command to pause or stop playback of a recorded program. The delete prompt may provide the user who is viewing the recorded program with the ability to choose to delete the portion of the program viewed thus far. For example, the delete prompt may prompt the user to delete a portion of the recorded program that starts at the beginning of the program and ends at substantially the position that the user stopped or paused the recorded program.

A method, apparatus, and article of manufacture for optimizing database queries using automatic summary tables. Query execution plans derived from an automatic summary table can be used to generate results for the query if a comparison of the query requirements with an automatic summary table definition determines that the automatic summary table overlaps the query, and if an optimization process determines that using the summary table will lower the cost of the query. The optimization process involves enumerating a plurality of query execution plans for the query, wherein the query execution plans enumerated include those that access combinations of query and summary tables. Each such query execution plan is assigned a cost representing an estimation of its execution characteristics, and the least costly query execution plan is selected for the query.

A system and method authenticates a person requesting a service by soliciting an account identification from the person, using an automatic funds transfer protocol and the account identification to make a deposit in the account, entering a unique code in a field of the protocol that is retrievable from the account after the deposit is made, soliciting from the person, after the deposit has been made, the code entered into the field of the protocol, and matching the code returned by the person with the code entered into the field to make the deposit, a successful match authenticating the person. Transactions are also triggered by conditions in monitored accounts.

A method of dynamically reconfiguring a generic class mobile application in a mobile device for a specific use within that general class comprises: downloading an adaptable framework of the generic class mobile application onto the mobile device; triggering communication between a server and the mobile device, said communication directing the server to reconfigure at least one of content, presentation and function of the generic mobile application, therein creating a specific use of the generic class mobile application.

Architectural support for generation isolation is provided through trapping of intergenerational pointer stores. Identification of pointer stores as intergenerational is performed by a store barrier responsive to an intergenerational pointer store trap matrix that is programmably encoded with store target object and store pointer data generation pairs to be trapped. The write barrier and intergenerational pointer store trap matrix provide a programmably-flexible definition of generation pairs to be trapped, affording a garbage collector implementer with support for a wide variety of generational garbage collection methods, including remembered set-based methods, card-marking type methods, write barrier based copying collector methods, etc., as well as combinations thereof and combinations including train algorithm type methods to managing mature portions of a generationally collected memory space. Pointer specific store instruction replacement allows implementations in accordance with this invention to provide an exact barrier to not only pointer stores, but to the specific intergenerational pointer stores of interest to a particular garbage collection method or combination of methods.

A composable software bundle is created by retrieving a semantic representation of a set of software modules. A functional representation of a set of operations is retrieved. Each operation in the set of operations is to be performed on the set of software modules during at least one virtual image life-cycle phase in a set of virtual image life-cycle phases. A set of artifacts including a set of executable instructions associated with the set of operations is identified. The semantic representation, the functional representation, and the set of artifacts, are stored in a composable software bundle.

A method and apparatus for producer graph oriented programming and execution. According to one aspect of the invention, a runtime is provided that interprets producer dependency declarations for methods. The producer dependency declarations identify at run time a set of zero or more producers, where a producer is a runtime instantiatable construct that includes at least an instance and a method associated with that instance. The runtime automatically generates and executes, responsive to receiving a designation of a producer of interest whose method has a producer dependency declaration, a producer graph. The producer graph initially includes the producer of interest and is generated, from the producer of interest to source producers, through instantiation of producers based on the producer dependency declarations of the methods of the producers already in the producer graph. The runtime sequences the execution of the producers in the producer graph as indicated by the producer graph.

A method and a circuit system for checking an m out of n code are provided. The method uses a code checker, to which at least one code reducer is assigned, a reduction of the code word width to in each case half being carried out using the at least one code reducer until a 1 out of x (x=n/2, n/4, n/8 . . . ) code or another code which is not reducible further in this way is provided, each step of the code reducer additionally being connected to different bits of a counter, the 1 out of x code or the code which is not further reducible being checked and additionally the signal pairs of each step being checked.

An operation determination processing section of a center extracts words included in the utterance of a driver and an operator, reads an attribute associated with each word from a synonym and related word in which an attribute is stored so as to be associated with each word, reads a domain of a candidate or the like for the task associated with the attribute from the synonym and related word in which domains of a candidate for a task associated with the read attribute or domains of a task to be actually performed are stored, totals the domains read for each word for words included in the utterance of the driver or the like, and estimates those related to a domain with a highest total score as the candidate for the task and the task to be actually performed. In this manner, it is possible to estimate the task with high accuracy.

A device is equipped with the ability to non-persistently display a data on its display in bar code form on demand, to enable another system to acquire the data by reading the bar code.

An apparatus and method for generating an octal code for identifying cells in a mobile communication system. In the octal code generating apparatus, a binary code generator generates a binary code with a predetermined minimum Hamming distance. A column permutator permutes the order of columns of the binary code in a predetermined interleaving method. A 3-bit combiner generates a plurality of codewords using the column-permuted binary code as a generator matrix and groups the bits of each of the codewords by threes. An octal code generator converts the 3-bit grouped binary codewords to octal code sequences.

An optimization problem models the dynamic placement of applications on servers under two types of simultaneous resource requirements, those that are dependent on the loads placed on the applications and those that are independent. The demand (load) for applications changes over time and the goal is to satisfy all the demand while changing the solution (assignment of applications to servers) as little as possible.

In an embodiment, a data processing method comprises, in a computer executing a supervisor program: the supervisor program establishing a plurality of different memory access permissions comprising any combination of read, write, and execute permissions for one or more different regions of memory of a first domain; setting the memory access permissions of a first set of the regions of memory to execute only; in response to a request from a process to read or write a particular region of memory in the first set, performing one or more responsive actions that prevent the process from reading or modifying one or more instructions or one or more embedded immediate values of the particular region of memory. Embodiments provide selective access to executable memory.

A method to perform I/O (Input/Output) operations in a data processing unit running an interpretative based program in an Interpretive Machine (IM). One example on an interpretative based program running in an IM is a Java based program. An I/O class for passing data into the interpretative based program and out of a the interpretative based program is defined. An object representing an instance of this I/O class is created. The I/O class includes a first member function called an Applet function for handling I/O operations when the IM is running as an Applet coupled to a Web browser. The Applet function has its own procedures and data variables for performing I/O operations. The I/O class includes a second member function called and Application function for handling I/O operations when the IM is running as an Application not coupled to a Web browser. The Application function has its own procedures and variables for performing I/O operations. A check is made to determine whether the interpretative based program is being executed with or without a browser. When the interpretative based program is being executed with a browser, the Applet function performs I/O operations and when the interpretive based program is being executed without a browser, the Application function performs the I/O operations. In accordance with another embodiment of the present invention, a computer readable medium is disclosed corresponding to the above method.

A workflow code generator for generating executable code for multi-channel and/or multi-modal applications. The code generator may include a parser for reading application input files and creating internal representations of declarative statements within the input files. The code generator may further include a model analyzer, which processes the internal model to detect errors, perform optimization, and prepare for outputting the result. The code generator uses a symbol or mapping table for storing references to resources that have been used by the input application. The code generator assigns code fragments to object patterns, resolves data object references by referring to mapping table, and traverses the objects and emits code assigned to the objects.

Facilitating translation of data between object oriented programs and database storage tables. A method includes receiving user input from a user. The user input includes a plurality of parts. Each part includes a specification of a source (such as a type source), optionally a filter, and a projection. Each projection assigns values to table columns. Based on the plurality of parts received, the method includes generating one or more views. The one or more views describe relationships between model extents and database tables.

In one embodiment, systems and methods are provided for incremental journaling. In one embodiment, order-independent operations are journaled incrementally for the same storage location. In one embodiment, partially ordered operations are journaled incrementally for the same storage location. In one embodiment, order-independent operations and partially ordered operations are journaled incrementally for the same storage location. In one embodiment, incremental journaling is used to update data that represents accounting, ctime, and parity.