88 results about "Goal programming" patented technology

A non-volatile memory device and programming process is described that compensates for coupling effects on threshold gate voltages of adjacent floating gate or non-conductive floating node memory cells by adjusting the threshold voltage level programmed in view of the data being programmed on a following programming cycle into adjacent memory cells, so that the coupling effect results in the desired target threshold voltages for the cells. In one embodiment of the present invention, memory cell coupling is compensated for by adjusting programming level of one or more memory cells of a first page a memory array to a higher or lower threshold verify target voltage given the data / programming level to be written to directly adjacent memory cells of a second page, so that coupling between the directly adjacent memory cells of the first and second pages brings the memory cells of first page to their final target programming level.

A method for operating non-volatile memory having boost structures. The boost structures are provided for individual NAND strings and can be individually controlled to assist in programming, verifying and reading processes. The boost structures can be commonly boosted and individually discharged, in part, based on a target programming state or verify level. The boost structures assists in programming so that the programming and pass voltage on a word line can be reduced, thereby reducing side effects such as program disturb. During verifying, all storage elements on a word line can be verified concurrently. The boost structure can also assist during reading. In one approach, the NAND string has dual source-side select gates between which the boost structure contacts the substrate at a source / drain region, and a boost voltage is provided to the boost structure via a source-side of the NAND string.

A non-volatile memory having boost structures. Boost structures are provided for individual NAND strings and can be individually controlled to assist in programming, verifying and reading processes. The boost structures can be commonly boosted and individually discharged, in part, based on a target programming state or verify level. The boost structures assists in programming so that the programming and pass voltage on a word line can be reduced, thereby reducing side effects such as program disturb. During verifying, all storage elements on a word line can be verified concurrently. The boost structure can also assist during reading. In one approach, the NAND string has dual source-side select gates between which the boost structure contacts the substrate at a source / drain region, and a boost voltage is provided to the boost structure via a source-side of the NAND string.

The invention discloses a method for achieving industrial robot off-line programming based on three-dimensional modeling software. The principle of the method is that a three-dimensional modeling software application programming interface (API) which is suitable for COM or object linking and embedding (OLE) and the like is used in the three-dimensional modeling software environment, model and space matrix data in the three-dimensional modeling software are obtained, a robot virtual body model and a mathematical model are built, and a virtual robot motion control system is realized; discretization from a curve to a point is conducted through obtained space line data, and therefore a motion trail of a robot is generated, actual robot operation is simulated; and an industrial robot controller operational procedure generating module is built, an actual controller executable file is generated and lead out so as to be operated in an actual robot controller, and industrial robot off-line programming can be achieved. The method can achieve off-line programming operation rapidly and generate optimal gesture of corresponding points automatically, time for generating training data is short, and a space curve trail can be achieved conveniently and rapidly, wherein a basis of the space curve trail is difficult to find in reality to conduct teaching.

Embodiments of the methods and apparatus for automatic cross language program code translation are provided. One or more characters of a source programming language code are tokenized to generate a list of tokens. Thereafter, the list of tokens is parsed to generate a grammatical data structure comprising one or more data nodes. The grammatical data structure may be an abstract syntax tree. The one or more data nodes of the grammatical data structure are processed to generate a document object model comprising one or more portable data nodes. Subsequently, the one or more portable data nodes in the document object model are analyzed to generate one or more characters of a target programming language code.

A set non-volatile storage elements are subjected to a programming process in order to store a set of data. During the programming process, one or more verification operations are performed to determine whether the non-volatile storage elements have reached their target condition to store the appropriate data. Decisions about whether to continue programming or whether the programming is successful are made based on whether overlapping groups of the non-volatile storage elements have less than a threshold number of non-volatile storage elements that are not properly programmed.

An apparatus and method for universal programming language conversion between two different sequential programming languages, e.g., sequential procedural and sequential object oriented programming languages. In particular, conversion is between a source program in a first programming language and a target program in a second programming language. Initially, the source program in the first programming language is parsed using a parsing interface specific to the first programming language. All syntax from the parsed source program is then stripped or removed. Classes in a framework are instantiated to capture semantics of the parsed source program independent of syntax and execution model of the sequential programming languages. The classes are C++ classes representing fundamental core constructs of all sequential programming languages. A semantic representation of the parsed source program without any syntax is produced. The semantic representation is received at a printer interface specific to the second programming language and syntax of the target program in the second programming language is added. This same process can be used for either high-level conversion or compilation depending on whether the target programming language is high level or low level, respectively.

The invention relates to an industrial robot offline programming system that includes text edit and code conversion module that realizes G code digital control program converting to INFORMII code working program by my MOTOMAN robot to generate full MOTOMAN robot working file and realizes offline programming, visual verifying module that verifies and simulates the moving track by 3D image method. Communicating and telecontrol module realize communication between the processed file and MOTOMAN robot and download and upload program and telecontrol.

A method, system and program product for transforming a source code in one language into one or more target modules in one or more languages is provided. The method includes selecting one or more target programming languages suitable for transforming each source module of a source code into one or more target modules written in one or more target programming languages. The method further includes parsing the source code and looking up for a source function in the source code an equivalent target function in a target programming language, such that execution of the equivalent target function in the target programming language is optimized. The method further includes writing out in the target programming language the equivalent target function corresponding to the source function, such that each source module is transformed into one or more target modules whose execution in the one or more target programming languages is optimized.

Embodiments of the methods and apparatus for automatic cross language program code translation are provided. One or more characters of a source programming language code are tokenized to generate a list of tokens. Thereafter, the list of tokens is parsed to generate a grammatical data structure comprising one or more data nodes. The grammatical data structure may be an abstract syntax tree. The one or more data nodes of the grammatical data structure are processed to generate a document object model comprising one or more portable data nodes. Subsequently, the one or more portable data nodes in the document object model are analyzed to generate one or more characters of a target programming language code.

A goal programming based hypersonic flight vehicle re-entry trajectory online optimization method comprises the steps of giving a kinetic model of hypersonic flight vehicle re-entry process, including height, latitude, longitude, course angle and trajectory angle kinetic equations; calculating a re-entry corridor within a speed-height plane, setting an attack angle alpha as a segmented linear function and using two speed values V1and V2 as a segmentation points to obtain the attack angle alpha; respectively designing a longitudinal trajectory and a transverse trajectory. The goal programming based hypersonic flight vehicle re-entry trajectory online optimization method is applicable to online trajectory generation of the hypersonic flight vehicle re-entry process, is feasible and effective for solving the problem of the re-entry trajectory optimization under the condition that a terminal point position is known, can generate a feasible trajectory within short time, meets quick and real-time trajectory optimization, can further make the obtained trajectory to meet all constraint conditions within a certain error accuracy range and ensures trajectory feasibility.

A programming editor and creator allows users with minimal knowledge of a computer language syntax to generate computer source code using a structured rather than freeform process. A predefined command sentence is provided representing at least a portion of a programming command, and includes words, which may be defined as constant or enterable words. Enterable words may be required or optional, and correspond to entry components. Each word may be defined according to word types, including list words, variable list words, variable words, mathematical words, condition words or Boolean words. Enterable words may include repeatable words which may be inserted multiple times within a command to create conditional statements, mathematical equations and string concatenations. Input values are provided for the entry components. The predefined command sentence with the input values is converted to a completed command sentence corresponding to the programming command, which is translated to a target programming language.

An apparatus and method for universal programming language conversion between two different sequential programming languages, e.g., sequential procedural and sequential object oriented programming languages. In particular, conversion is between a source program in a first programming language and a target program in a second programming language. Initially, the source program in the first programming language is parsed using a parsing interface specific to the first programming language. All syntax from the parsed source program is then stripped or removed. Classes in a framework are instantiated to capture semantics of the parsed source program independent of syntax and execution model of the sequential programming languages. The classes are C++ classes representing fundamental core constructs of all sequential programming languages. A semantic representation of the parsed source program without any syntax is produced. The semantic representation is received at a printer interface specific to the second programming language and syntax of the target program in the second programming language is added. This same process can be used for either high-level conversion or compilation depending on whether the target programming language is high level or low level, respectively.

A method and system for air carrier contract management and optimization is disclosed. In particular, the present invention receives and tracks client travel data and air carrier contract data, analyzes this data and configures the data structure to be used in a goal programming algorithm to determine an optimum travel carrier solution.

An RFID tag is associated with an implantable lead, its sensing or therapy delivery electrode, or a patient, for identifying the MRI compatibility of the implantable lead and / or the presence of a bandstop filter and its attendant characteristics. An RFID-enabled AIMD external telemetry programmer transmits an electromagnetic signal to establish a communication link with the RFID tag.

The invention discloses an offline programming based planning method for a polishing track of a workpiece clamped by a robot. A robot model is guided into three-dimensional modeling software, and constraints are set for a clamp and the workpiece and a robot tool parameter is set; a user coordinate system pose parameter of the robot is set; the optimal pose of each position on the polishing track is calculated, a polishing curve is discretized into interpolate points of an appointed number, and at the same time the normal vector and the tangent vector of each interpolate point are calculated; and a polishing track point planning algorithm is a planning algorithm of the track for the robot to clamp the workpiece for machining, and the pose of a robot tool coordinate system is obtained, converted into an order format stipulated by a controller, and then guided out to an execution mechanism for execution. By means of the method, the robot can be used only by finely adjusting the position manually, and the teaching difficulty is reduced. In the method, the algorithm of the robot to clamp the workpiece for machining is provided, and the problem of robot offline track planning under the condition that a robot terminal pose point and an actual movement terminal are not consistent is solved.

A method of programming a non-volatile memory device includes; defining a set of verification voltages, setting a maximum verification voltage among verification voltages that are less than or equal to a first target programming voltage to be a target verification voltage, calculating a number of extra pulses based on the target verification voltage and the first target programming voltage, verifying whether a threshold voltage of the memory cell is equal to or greater than the target verification voltage by applying an incremental step pulse program (ISPP) pulse to the memory cell and then applying at least one verification voltage in the set of verification voltages to the memory cell, and further applying the ISPP pulse to the memory cell a number of times equal to the number of extra pulses when the threshold voltage is verified to be equal to or greater than the target verification voltage.

Embodiments of the invention may provide methods and / or systems for converting a source application to a platform-independent application. Source programming language code of the source application may be translated to target programming language code of the platform-independent application. The source programming language code may comprise Connected Limited Device Configuration (CLDC) code, and the platform-independent programming language may be independent of one or more device platforms. Further, one or more source resources associated with the source application may be converted to one or more target resources.

A method of electrically programming a memory cell includes: applying at least one electrical programming pulse to the memory cell; verifying the reaching of a target programming state by the memory cell; and repeating the acts of applying and verifying until the reaching of a target programming state by the memory cell is assessed. After the reaching of a target programming state by the memory cells is assessed, at least one further electrical programming pulse is applied thereto, and the memory cell is verified at least one more time after applying the further programming pulse. In case, as a result of said further verifying, the reaching of the target programming state by the memory cell is not assessed, the method provides for applying a still further programming pulse to the memory cell.

In method of programming a nonvolatile memory device including a plurality of multi-level cells that store multi-bit data according to example embodiments, a least significant bit (LSB) program operation is performed to program LSBs of the multi-bit data in the plurality of multi-level cells. A most significant bit (MSB) program operation is performed to program MSBs of the multi-bit data in the plurality of multi-level cells. To perform the MSB program, an MSB pre-program operation is performed on first multi-level cells, from among the plurality of multi-level cells, that are to be programmed to a highest target program state among a plurality of target program states, and an MSB main program operation is performed to program the plurality of multi-level cells to the plurality of target program states corresponding to the multi-bit data.

A method for fabricating a non-volatile memory having boost structures. Boost structures are provided for individual NAND strings and can be individually controlled to assist in programming, verifying and reading processes. The boost structures can be commonly boosted and individually discharged, in part, based on a target programming state or verify level. The boost structures assists in programming so that the programming and pass voltage on a word line can be reduced, thereby reducing side effects such as program disturb. During verifying, all storage elements on a word line can be verified concurrently. The boost structure can also assist during reading. In one approach, the NAND string has dual source-side select gates between which the boost structure contacts the substrate at a source / drain region, and a boost voltage is provided to the boost structure via a source-side of the NAND string.

An embodiment of the invention discloses an application creation method. The method comprises the steps of receiving an application creation request; generating an HTML interactive page according to the application creation request, wherein the HTML interactive page contains data operation interface information and is written by adopting a target programming language; sending the data operation interface information to a server, thereby enabling the server to generate an application call interface according to the data operation interface information, wherein the application call interface is written by adopting the target programming language; and when a client obtains the application call interface and calls the application call interface successfully, creating an application. The invention furthermore provides the client, the server and an application creation system. The application can be created in the client and the server only by adopting the target programming language, and additional work is not generated due to different programming languages, so that the manpower input is reduced and the development resources are saved.

The invention provides an automatic code generating method and an automatic code generating device for loading a dynamic link library. The device comprises an extracting rule editing module, a function prototype and constant definition extracting module, a code template and parameter transformation rule editing module and an object code generating module, wherein the extracting rule editing module is used for defining an extracting rule for an extracting module; the function prototype and constant definition extracting module is used for extracting a function prototype and constant definition list from a header file according to the defined extracting rule; the code template and parameter transformation rule editing module is used for editing a code template and parameter transformation rule; and the object code generating module is used for selecting a corresponding code template and parameter transformation rule according to an object code language and a filling mode, and is used for transforming function prototype and constant definition into object programming language codes. By the scheme, loading codes are generated automatically, demands on developers are reduced, and the developers do not need to concern dynamic loading and static loading specific implementing methods of the DLL (dynamic link library) under optional programming languages, and do not need to be familiar with corresponding relations of parameter types under different languages.

The invention discloses a robot off-line programming system, and belongs to the technical field of robots. The robot off-line programming system comprises a data storage unit, a track planning unit, a track verifying unit and a coding unit, wherein the data storage unit is used for storing programming data; the track planning unit is used for processing a preset first three-dimensional model associated with a workpiece to be processed and programming data to obtain pose information of a second three-dimensional model associated with a robot, and then processing the pose information so as to obtain first track information of a practical processing track of the robot; the track verifying unit is used for verifying the first track information according to the programming data; the coding unit is used for performing coding with the programming information according to the verified first track information so as to form an updating program which can be recognized by the corresponding robot and transmitting the updating program to the corresponding robot to perform program updating. The technical scheme adopted by the robot off-line programming system has the benefits that the programming is simple, convenient and rapid, the programming is also accurate and stable, can guarantee the normal operation of robot equipment, and is free from the influence of an off-line programming process, and the whole off-line programming process is low in cost and easy to realize.

In certain aspects, the invention is directed to a method for visual programming in an environment having a set of user-invocable function representations, a data processing system for implementing the method and a computer program product with computer-usable program code for implementing the method. The method includes:maintaining a user interface from which a user may access any function representation in the set of user-invocable function representations;receiving a new function representation that is omitted from the set of user-invocable function representations; andstoring the new function representation in the set of user-invocable function representations so that the new function representation may be accessed from the user interface.

A method of electrically programming a memory cell includes: applying at least one electrical programming pulse to the memory cell; verifying the reaching of a target programming state by the memory cell; and repeating the acts of applying and verifying until the reaching of a target programming state by the memory cell is assessed. After the reaching of a target programming state by the memory cells is assessed, at least one further electrical programming pulse is applied thereto, and the memory cell is verified at least one more time after applying the further programming pulse. In case, as a result of said further verifying, the reaching of the target programming state by the memory cell is not assessed, the method provides for applying a still further programming pulse to the memory cell.