7 results about "Modular decomposition" patented technology

The application relates to a parallelized fault tree minimal cut set solving method based on bit set minimal cut set representation, and relates to the field of fault tree analysis. In order to solve the problems of redundant cut set data representation, insufficient parallelization degree, low calculation and storage efficiency and difficulty in supporting efficient solving of large-scale complex systems in the prior art, the method generates a standardized equivalent logical structure concise form fault tree by structurally simplifying and modularly decomposing a fault tree model; an intermediate event and a module solving queue are established according to a topological relationship; a multi-core parallel computing environment is established, a bit set is used to represent a cut set and a two-dimensional data array is formed; a bit-by-bit or broadcast operation is performed for an and gate, and row splicing and merging are performed for an or gate, so that parallel calculation of logical gate outputs is realized; and then non-minimal cut sets are screened out through parallel simplification, and a top event minimal cut set result is output. The application is suitable for fault tree analysis and fast solving of minimal cut sets of complex systems such as nuclear power, aerospace, chemical industry and rail transit.

The invention discloses a tourism service integration platform based on dynamic bidding and intelligent matching and an implementation method, and belongs to the technical field of online tourism service and electronic commerce. According to the platform, through cooperation of a user terminal, a service provider terminal, a cloud server and an integrated operation management background, precise analysis and modular decomposition of user requirements are realized by adopting a mixed natural language processing technology, and bidirectional dynamic bidding matching is realized in combination with a reinforcement learning driven multi-objective optimization algorithm; and a block chain intelligent contract and an Internet of Things monitoring technology are deeply fused, so that intelligent analysis, modular decomposition and bidirectional dynamic bidding matching of tourism demands are converted into full-link service monitoring and automatic settlement. According to the system, the technical bottlenecks of a traditional tourism platform in the aspects of demand understanding, resource configuration, customization flexibility and service performance transparency are effectively solved, and tourism service integration which is highly personalized, efficient in resource configuration and credible in the whole process is realized.

The application provides a modular decomposition method for a Transformer neural network model, modular training is performed on a randomly initialized model, and structured decomposition is implemented by applying a mask after the modular training, so that flexible on-demand reuse is realized; specifically comprising the following steps: S1, modular training; given a neural network model, firstly, randomly initialize all parameters of the model; a neuron recognizer is included, which is used to identify neurons related to a specific function; S2, structured decomposition; the modular training model is subjected to modular decomposition; S3, on-demand reuse; on-demand reuse is realized by structurally removing neurons, and memory and computing overheads are minimized. The application can realize structured decomposition of a Transformer structure model and flexible on-demand reuse of functions, and has high expandability.

The invention discloses a parallel fault tree minimum cut set solving method based on bit set minimum cut set representation, and relates to the field of fault tree analysis. In order to solve the problems that in the prior art, cut set data representation is redundant, the parallelization degree is insufficient, the calculation and storage efficiency is low, and efficient solving of a large-scale complex system is difficult to support, the method comprises the steps that structural simplification and modular decomposition are conducted on a fault tree model, and a standardized fault tree with an equivalent logic structure and a concise form is generated; establishing an intermediate event and module solving queue according to the topological relation; a multi-core parallel computing environment is established, a bit set mode is adopted to represent a cut set, and a two-dimensional data array is formed; executing bitwise OR broadcast operation for the AND gate, executing row splicing and merging for the OR gate, and realizing parallel calculation of logic gate output; non-minimum cut sets are screened out through parallel simplification, and a top event minimum cut set result is output. The method is suitable for fault tree analysis and minimum cut set rapid solution work of complex systems such as nuclear power, aerospace, chemical engineering, rail transit and the like.

The invention relates to the technical field of life cycle evaluation, and discloses a photovoltaic supply chain LCA model modular deconstruction and precise traceability reconstruction method, which comprises the steps that an LCA model deconstruction engine disassembles a background model into standardized process modules; the supply chain network mapping module converts the data into an attribute directed topological graph; the traceability engine constructs a material source tree through reverse search, and instantiated nodes are generated by fusing actual measurement data of suppliers; and dynamically assembling the foreground and background separated technical matrix and the environment intervention matrix, solving a scale vector, calculating an environment influence score, and executing hotspot analysis. According to the invention, by establishing the material source tree reconstruction model based on the graph theory logic, dynamic decoupling and high-precision recombination of general background data and enterprise live-action data are realized, and the technical problems of difficulty in upstream data traceability and rough evaluation granularity in a photovoltaic complex industrial chain are solved; and the accuracy and the visualization level of environmental impact evaluation are improved.

This invention belongs to the field of software automated refactoring technology, specifically involving a method and system for detecting concern overload odors using topic modeling and mining, and for searching refactoring solutions using genetic algorithms. The method includes: parsing and preprocessing the source code of a microservice system to obtain a code dependency matrix for quality assessment; using topic modeling techniques to mine concerns in the system and detect concern overload odors, while converting overloaded services into a set of refactoring units; and using a multi-objective genetic algorithm to search a list of refactoring solutions and using Euclidean distance to select the optimal refactoring solution. This invention discovers microservices with concern overload odors by mining semantic topics in the software system and provides a modular decomposition and refactoring method for overloaded services, thereby helping architects quickly discover and refactor concern overload odors within the system, improving the efficiency of software maintenance and evolution.

The invention discloses a partial differential equation set solving method and system based on a coupling matrix and a medium, and relates to the technical field of nuclear reactor numerical calculation. A global Jacobian matrix and a local Jacobian matrix are divided into clear sub-matrix blocks according to physical field variables and degrees of freedom thereof, and a coupling matrix is combined to explicitly describe an interaction relationship between physical fields, so that modular decomposition of computational logic is realized; the calculation program of each sub-matrix block can be independently configured and developed and corresponds to the self-action of a specific physical field or the coupling action with other fields; when a physical field is newly added, a developer only needs to focus on a sub-matrix block calculation program of the physical field and define an interaction relationship with other fields by updating a coupling matrix, so that function extension can be realized without touching or reconstructing assembly logic and codes of other existing physical fields; the coupling degree between codes is reduced, calculation modules of different physical fields can be combined and reused, and the development period is shortened.