86 results about "Symbolic notation" patented technology

Enhancing dynamic code. A method includes obtaining one or more first data structures defining constructs in a body of dynamic language source code. From the one or more first data structures, identifier information is extracted for one or more of the defined constructs. Knowledge about the constructs is augmented. Using the identifier information and augmented knowledge, metadata about the body of the dynamic language source code is generated. The generated metadata is represented as a symbol table. The body of dynamic language source code is visually enhanced based on the symbol table structure.

A software system that automates the use of computing systems by storing English language sentences using synonyms and symbol words to allow user access to computer resources without having to know the technical details or the specifics associated with a body of knowledge. Synonym sentences allow users to get to computer resources using different words stored in different sentences that open the same computer resource (i.e.: a document) to significantly improve a first time request for information. Sentences learned (stored) in text or SQL databases or used in a software agent sentence or search engine sentence are automatically parsed and directed to the appropriate knowledge repository to automated computer processes or to get user information without having to know any technical details required to navigate through computer systems or computer data. Multiple words or sentences can be linked together with computer resources to further automate job tasks.

An apparatus is provided which employs a system of musical notation which represents musical notes in a form of numbers, 1 to 7. The note numbers are defined to be mutually relative and are independent of any particular musical pitch or musical key. Optionally, a plurality of colors is used to identify specific chord and note numbers. Optionally, musical chord patterns are identified by numbers. Optionally, musical chord patterns are identified by colors. Optionally, key numbers are shown beneath corresponding lyric text, to provide an indication of rhythm pertaining to a musical piece defined in the system of musical notation. Optionally, note numbers are arranged on at least one horizontal line when presented for musical performance. The apparatus, and method employed in association therewith, are capable of expediting students when learning to play an instrument controlled via a keyboard, thereby improving student musical enjoyment and improvement in musical performance skill.

A knowledge map representation learning method based on structure information and text description aims at mapping entities and relationships in a triple into a low-dimensional continuous real value space. The invention aims at improving vector representation of entities in knowledge representation; The corresponding text description information of the entity is obtained from the existing knowledge base Freebase, Word2vec is used to represent each description with a word vector, Then, the description vector is represented by word addition and mean vector, and the description vector is represented by doc2vec sentence vector. Then, the word vector is used as the input of CNN text encoder to obtain the description text-based representation vector of each entity. In the joint representation, weights are used to evaluate the symbol-based representation vectors in the knowledge base, and the effects of the representation vectors based on network structure and description text on the final representation vectors of entities are analyzed, so as to achieve the fusion of structure information and text information, and improve the accuracy of knowledge map representation.

A system and method for positioning, on an electronic display, an additional musical symbol based on the location of one or more existing musical symbols can include determining one or more positional constraints on the additional musical symbol. The one or more positional constraints can include one or more preferred quantities. Each of the one or more positional constraints can be automatically defined as being either a time-based positional constraint or a space-based positional constraint. The additional symbol can be positioned in a measure of a staff at a distance away from one of the one or more existing musical symbols. The distance can be at least in part determined by at least one of the one or more preferred quantities.

The invention discloses a method for binary code vulnerability discovery on the basis of simple symbolic execution. The method comprises five steps that: firstly, binary codes are translated into an intermediate language with a static single assignment through a binary code translation component; and then, a disassembling engine is used to disassemble the binary codes, the control flow information of the binary codes is extracted, static symbolic execution is carried out in the intermediate language on the basis of the control flow information, an entrance point needs to be determined during the symbolic execution process, an input vector is converted into a symbol, and a called function is modeled. After the symbolic execution process is completed, the statement assembly of the intermediate language which depends on the input vector can be obtained, the statements of an assembly are simplified, and a vulnerability discovery confirmation report is generated after security attribute rules are used to confirm.

Creating metadata for dynamic code in a descriptive metadata language. The method includes obtaining one or more first data structures defining constructs in a body of dynamic language source code. From the one or more first data structures, identifier information is extracted for one or more of the defined constructs. Knowledge about the constructs is augmented. Metadata about the body of the dynamic language source code is provided, with the source code, in a specific metadata format, to a user.

A method and apparatus for optimizing a sequence of operations adapted for execution by a processor is disclosed to include associating with each register a symbolic expression selected from a set of possible symbolic expressions, locating an operation, if any, that is next within the sequence of operations and setting that operation to be a working operation, where the working operation has associated therewith a destination register and zero or more source registers, and processing the working operation when the working operation and any symbolic expressions of its source registers, if any, match at least one of a set of rules, where each rule specifies that the working operation must match a subset of the operation set, where each rule also specifies that the symbolic expressions, if any, of any source registers of the working operation must match a subset of the possible symbolic expressions, and where the rule also specifies a result, then posting the result as the symbolic expression of the destination register.

The invention provides a Java bytecode debugger and debugging method which are used for improving the debugging efficiency of Java software engineers, and relates to the technical field of software engineering. The Java bytecode debugger comprises a symbol library module, a cache module, a debugging module, a stack analysis module and a quote analysis module; the symbol library module is used for acquiring symbol information from a Java source code file and storing the symbol information; the cache module is used for acquiring symbol information and data information from a Java bytecode file and caching the symbol information and the data information; the debugging module is used for being connected with a virtual machine through a Keil channel, and therefore the Java bytecode file can run and be debugged on the virtual machine; the stack analysis module is used for receiving a Java stack in a memorizer of the virtual machine running to a breakpoint position and analyzing the Java stack; the quote analysis module is used for analyzing a Java quote corresponding to a Java bytecode when the virtual machine runs to the breakpoint position. The debugger and debugging method are used for debugging the Java bytecode.

One embodiment of the present invention sets forth a method for generating one or more tests for testing a command provided by a command line interface. The command is specified in a pre-determined meta-language. The meta-language is then converted in the tokenized post-fix notation, which is processed to generate a direct acyclic graph (DAG) that represents the different permutations of the command. By traversing the DAG from a root node to a leaf node, a test can be generated. The test is then executed within the command line interface, and the result analyzed to determine whether the command line interface is operating correctly.

The invention relates to a virtual keyboard design scheme for inputting Chinese characters by brain waves. In the scheme, a virtual keyboard consisting of 42 buttons (six rows * seven columns) is constructed on a computer screen; the upper half part of each key of the keyboard is marked with a character representing a name of the key; the lower half part of each key is provided with a small window with a pixel of 30*30, which is used for carrying out visual stimulation; first to fourth rows of buttons are marked with initial consonants and vowels in a binary syllabification input method; first five number keys in a fifth row represent positions of candidate Chinese characters; the back and forth page turning of candidate characters/words is realized by key names of '->' and '-<'; and a sixth row of buttons has the main function of realizing selection of the first to fifth rows of buttons. In the using process of a user, the selection of each binary syllabification character needs to be completed by two steps, i.e. a first step of selecting a certain button on the sixth row so as to select the row in which the binary syllabification character is positioned and a second step of selecting the binary syllabification character in the selected row and repeating.

Methods, systems, and devices for semantic parsing. In an example embodiment, a method for semantic parsing can include steps, operations, or instructions such as obtaining a data pair for learning, the data pair comprising logical form data and natural utterance data; acquiring grammar for targeted logical forms among the logical form data of the data pair; modeling data comprising other available prior knowledge utilizing WFSA (Weighted Finite State Automata); combining with the targeted logical forms with the data modeled comprising the other available prior knowledge to form a background; and exploiting the background on the data pair. Note that we do not “learn” the background, but “learn” the background-RNN (Recurrent Neural Network).

A new method of written music using a color coded keyboard to show the player which octave on the keyboard to use, which note in the octave to play and the finger of the hand used to play the note. The phrasing of the melody and chord progressions are indicated by the spacing of the notes in the tablature.

A printed document manager manages printed documents and is separate from Document Management Systems (DMSs) that manage electronic soft copy documents. One or more DMSs are registered with a postmark server. A client computing device executes a postmark client, detects a print event for a specified document, and queries a postmark server to determine whether the print event for the specified document should include a graphical postmark. In response, the postmark server queries one or more of the registered DMSs to determine whether the specified document matches a document in any of the repositories of the registered DMS(s). When the specified document to be printed matches a document in a registered DMS, the postmark server authorizes the postmark client to add the graphical postmark in a print stream corresponding to the print event for the specified document.

The invention discloses a method for mapping a logical device name to a drive letter, and mainly relates to the field of progress safety protection and file screening. The method comprises the following steps of: adopting symbolic link names as parameters, using a function, i.e. Initialize Object attributes, to carry out initialization to obtain OBJECT_ATTRIBUTES corresponding to the symbolic link names, and extracting the corresponding drive letter from the symbolic link names; using a function, i.e. Zw Open Symbolic Link Object, to adopt the OBJECT_ATTRIBUTES as parameters, to obtain a handle of the corresponding object; and inquiring the handle by using a function, i.e. Zw Query Symbolic Link Object, so as to obtain the logical device name corresponding to the symbolic link name, and preserving the corresponding relation between the logical device name and the drive letter. The method establishes the corresponding relation between the logical device name and the drive letter, thus being convenient for users.

The invention relates to a musical notation fingering rapid annotation method and system. The musical notation fingering rapid annotation method comprises the following steps: S1: converting music score information to be played into music score data of a MusicXML format; S2: parsing the music score MusicXML data to generate the fingering annotation position of each note, wherein the fingering annotation positions are positioned above note heads, and are not coincided with a musical notation; S3: generating a fingering position sequence of all notes of each voice part; and S4: inputting fingering annotation symbols corresponding to the nodes into corresponding fingering position sequences, and displaying the fingering annotation symbols at the fingering annotation positions. The musical notation fingering rapid annotation method and system have the advantages of accurate annotation positions, high annotation efficiency, high speed, easiness in modification and the like, are suitable fordifferent playing ways, and have a wide application prospect.

The invention discloses a pictographic character encryption method. The method comprises the following steps: S1, carrying out secret key transition on a stroke table before Chinese character encryption, and selecting any other symbols to realize corresponding in random order; and S2: corresponding 31 strokes in the strokes table to English letters in order, and using O in a combination manner not individually, and so on. The method is also applicable to Korean, Japanese and other pictographic characters or other shaped symbols, and encrypted use of the shaped characters can be realized by defining strokes and the order of the strokes as the base and providing random and abundant secret key choices; the definition of the strokes and the order of the strokes is needed by the method; and the secret key can be can be transition on the stroke by a random character. The pictographic character encryption method is based on the structural formation and the writing specification of Chinese characters, and can be applied to most of the shaped characters.