Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

107 results about "Primitive operation" patented technology

Primitive operations. In addition to the operations that IBM® Rational® Rhapsody® automatically generates, you can define your own operations for objects. Each operation has a name and return type, and might include arguments. User‑defined operations are called primitive operations in Rational Rhapsody.

Neural Network Processing Element Incorporating Compute And Local Memory Elements

A novel and useful neural network (NN) processing core adapted to implement artificial neural networks (ANNs) and incorporating processing circuits having compute and local memory elements. The NN processor is constructed from self-contained computational units organized in a hierarchical architecture. The homogeneity enables simpler management and control of similar computational units, aggregated in multiple levels of hierarchy. Computational units are designed with minimal overhead as possible, where additional features and capabilities are aggregated at higher levels in the hierarchy. On-chip memory provides storage for content inherently required for basic operation at a particular hierarchy and is coupled with the computational resources in an optimal ratio. Lean control provides just enough signaling to manage only the operations required at a particular hierarchical level. Dynamic resource assignment agility is provided which can be adjusted as required depending on resource availability and capacity of the device.
Owner:HAILO TECH LTD

Method for analyzing similarity of character string under Web environment

The invention discloses a method for analyzing the similarity of character strings under a Web environment, comprising the following steps of: firstly, defining basic operation cost; pretreating the character strings to identify first characters thereof and remove the characters without real meaning; building distance matrix to realize the optimization of an edit distance by building a match index; then judging an abbreviated word, firstly judging whether the two character strings has an abbreviation relationship, if the abbreviation relationship is ensured, the distance is optimized; wherein, the abbreviation relationship is determined by two factors: (1) judging whether the two character strings has the similarity; and (2) judging whether the first characters of the two character strings have been matched; and after that optimizing the distance of the abbreviated word, wherein, the optimization is realized by reducing the cost for decreasing continuously inserted characters and continuously cancelled characters. The method for analyzing the similarity of the character strings can well treat the situations such as omission, abbreviation and character disorder which are usually in Web, has higher application, and under a Wed unknown environment has higher matching precision.
Owner:NORTHEASTERN UNIV

Selective operating system patching/updating

An application typically runs on top of an operating system. Some computing device have the ability to reboot and load a different operating system whenever an application or set of applications is run. If an old application requires an old operating system version, it is possible to load that OS instead. Every application can have its own version of the operating system. Only new applications or a small set of applications need to use the new OS—all the old applications may run their own older version of the OS. Patches or software updates can be applied only for particular applications. Other applications that need the same base OS but don't need the patch can skip using the patch. It is possible to determine what version the application is and selectively apply the patch based on the version of the application.
Owner:NINTENDO CO LTD

Large-scale graph data processing method based on k<2>-tree and multi-valued decision diagram

The invention discloses a large-scale graph data processing method based on a k<2>-tree and a Multi-valued Decision Diagram (MDD). The method comprises the following steps: 1, performing n-bit encoding on a peak of a graph according to the rule of the k<2>-tree, FORMULA, k being greater than or equal to 2; 2, encoding an edge according to a peak code; 3, constructing an MDD structure according to an edge code to obtain a k<2>-MDD structure which corresponds to an oriented graph and contains n variables, wherein the k<2>-MDD structure has the nature of the MDD and is applicable to the simplification rule of the MDD; 4, performing the following basic operation of the graph on the obtained k<2>-MDD structure through logic operation of a symbol decision diagram: edge inquiry, outside adjacent inquiry and calculation of an out degree of the peak, inside adjacent inquiry and calculation of an in degree of the peak, as well as adding and deletion of an edge, and the like. According to the method, the MDD is used for storing graph data, so that isomorphic sub trees in the k<2>-tree are combined, the number of nodes is reduced, and the structure is more compact; the basic operation of the graph is converted into the logic operation, so that the operation is simpler.
Owner:GUILIN UNIV OF ELECTRONIC TECH

System and methods for handling verification errors

Systems, apparatus and methods for handling verification violations are disclosed. In one aspect, a method stores a list of fix information in addition to geometric shapes for each layer during verification, such as design rule checking For each primitive operation step performed during verification, two tasks are performed. First, if the primitive operation is a dimensional checking operation (i.e., width, spacing or enclosure), then for each violation, the first task creates fix information containing violation edge pairs and adds the created fix information to the fix information list on the output layer. Second, for all operations and after the output shapes on the output layer are generated, a second task passes the fix information on input layers which overlap any output shape of the output layer to the output layer's fix information list. Finally, fix guides for the final violation results are generated and drawn based on the final fix information list.
Owner:SYNOPSYS INC
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products