83 results about "Handle" patented technology

The invention discloses a Direct3D rendering model compatible method based on a dynamic template pool, which comprises the following steps: establishing three types of mapping tables between D3D and Vulkan when compiling DXVK, constructing resource metadata, and creating a core, extended and temporary three-level template pool according to the mapping tables after starting; when the D3D application creates resources, metadata is initialized, parameters are verified, physical memories are allocated and grouped, resource groups are pre-verified, a batch binding command is generated, memory binding is completed, and the metadata is updated; when a resource view is created, a template is matched from a template pool, a handle is generated after instantiation, a resource handle is associated, and a descriptor is bound; when a rendering state is set and a rendering instruction is executed, the rendering state and the rendering instruction are respectively converted into a Vulkan related state and a Vulkan related instruction through a mapping table, a handle is bound after a PSO cache is inquired, a command buffer area is submitted to a GPU queue to execute drawing, and compatible operation of the D3D application on a platform supporting a Vulkan operating system is realized under the condition that the GPU does not support VKKHRmaintence5 and VKKHRmaintence6 extension.

The invention relates to the technical field of message pushing, in particular to an SaaS (Software as a Service) intelligent concurrent pushing system which comprises a tenant flow monitoring module, a resource binding module, a lock-free object writing module, a handle layout construction module and a cache prefetching delivery module. According to the method, the high-frequency business object is identified by monitoring the flow characteristics of the tenants, and the complete Slab page is dynamically applied and bound to the thread exclusive local allocation buffer area, so that physical isolation of bottom layer resources is realized to eliminate global lock competition and context switching overhead in a multi-thread environment; lock-free memory writing is executed based on a privatized pointer, the object construction efficiency is greatly improved, a compact storage structure in which a bitmap is adjacent to a connection handle is constructed, a hardware cache prefetching mechanism is triggered by utilizing bitmap reading, connection data is loaded to a CPU cache line in advance, and the connection data is stored in the cache line. And the cache miss rate is reduced and the concurrent delivery performance of massive messages is remarkably improved by utilizing a memory locality principle.

The invention relates to a visual component management method and system based on support of multi-user collaboration, and belongs to the technical field of computer software collaborative design. Wherein multi-party editing requests are received and verified through a cooperative access mechanism, structured component data are constructed by using a component modeling model, concurrent control and a difference buffer are adopted to coordinate parallel modification, write conflicts are identified and processed based on a conflict detection algorithm, and traceable management of component versions is realized through a snapshot generation model. According to the method, efficient, consistent and conflict-controllable unified management of the visual components in a multi-person online cooperation scene is realized, and the cooperation efficiency of component development and the system reliability are effectively improved.

This invention relates to the field of software detection technology, specifically disclosing a knowledge graph-based intelligent detection method and system for software backdoors. The method involves intercepting system kernel events and reading the object handle table to generate a time-series interaction log. Based on this log, a time-series knowledge graph is constructed, forming an interconnected network composed of process nodes, token nodes, and relationships such as handle holding, token replication, and memory writes. Newly added process nodes with process creation timestamps are further extracted as target process nodes, and the nominal parent process node is located based on its parent process identifier. Subsequently, a lineage consistency check is performed around the target process node, and cross-chain constraint analysis is conducted using the nominal parent process node, anonymous process nodes, token nodes, and memory write relationships. When contradictions arise in handle permissions, token inheritance, and write timing, and the lineage forgery index exceeds a preset threshold, the target process node is determined to be a parent process deceiving a backdoor process, and a threat interception command is output.

The application relates to an intelligent password key management method and device based on an SKF standard, and belongs to the technical field of computers.The method comprises the following steps: receiving a first interface calling request for a first management interface, including information of a target operation based on a first intelligent password key; if the operation is a device layer operation, calling an SKF standard interface corresponding to the target operation to execute the target operation; if the operation is an application layer operation, calling an SKF standard interface to generate an application handle, storing the application handle into a memory, and calling an SKF standard interface corresponding to the target operation to execute the target operation; and if the operation is a container layer operation, calling an SKF standard interface to generate an application handle and a container handle, storing the application handle and the container handle into a memory, and calling an SKF standard interface corresponding to the target operation to execute the target operation.The application executes the target operation through an encapsulated interface, reduces the development difficulty, improves the development convenience and the development efficiency, and improves the stability of a program and the safety of a memory.

The application provides a remote isolated browser implementation method and device based on kernel redirection and mapping, equipment and medium, the method comprises the following steps: in the process that the navigation component of Chromium kernel executes navigation check, it is judged whether the current request belongs to the business needing to be isolated, if yes, the original uniform resource locator URL is saved to the custom data structure, and the target address of the request is modified to the preconfigured remote stream server address; when the renderer completes navigation and triggers navigation submission callback, the original URL saved in the custom data structure is extracted from the navigation handle; the virtual URL setting interface of navigation entry is called, and the URL displayed in the address bar of the browser is forced to be set to the original URL, so that the hijacking effect of loading remote stream content while displaying the original address is realized; doubts of users are eliminated, and users do not need to adapt to a new interaction mode.

The invention provides a parasitic parameter extraction method and system for Socket interface multi-task coordination, and belongs to the technical field of parasitic parameter extraction. The method comprises the following steps: acquiring and analyzing an initial configuration file, and creating a read-write lock mechanism of a process pool and a global task coordination table; establishing non-blocking transmission control protocol monitoring, and mapping a Socket connection handle established by the sub-process and the host process to a global task coordination table; executing parasitic parameter extraction by utilizing the screened sub-processes, and generating a parasitic parameter result data packet after the extraction is completed; and performing Hash abstract verification, and if the Hash abstract verification is passed, marking the task corresponding to the parasitic parameter result data packet as completion and recording the extracted parasitic parameter. According to the method, a traditional file synchronization mechanism is replaced based on non-blocking Socket communication and an event-driven model, so that the inter-process communication efficiency is remarkably improved; and by adopting read-write lock hierarchical control and atomic operation, the utilization rate of hardware resources is effectively improved.

This invention discloses a real-time multi-task deployment method, apparatus, electronic device, and storage medium, relating to the field of computer technology. The real-time multi-task deployment method is used on a Linux operating system and includes: acquiring a preset number of tasks to be run; acquiring the same number of database thread pool handles as the number of tasks, wherein the Linux operating system and the server have pre-established several TCP connections, and the database thread pool handles point to idle TCP connections; branching the current main process into the same number of child processes as the number of tasks, so that each child process is used to run one task, and allocating a database thread pool handle to each child process; and attaching the branched child processes and their corresponding database thread pool handles to the Linux operating system for execution. This invention enables second-level multi-task execution with high task processing efficiency.

Systems and methods for providing a file system with object versioning support are provided. Rather than adding object records for each version of an object to a chapter database, in one example, the chapter database may be limited to a single object record for a given object including: (i) a name of the object; (ii) an object file handle containing information regarding a file containing data of a current version of multiple versions of the object; and (iii) a version table file handle containing information regarding a file containing a version table. In this manner, enumeration of objects associated with a given chapter may be performed more efficiently and prior versions of objects may be maintained separately within the version table without causing disproportionate growth of object records and without increasing the search depth with objects that are not referenced by the search at issue.

This application discloses a method and apparatus for parsing JSON nodes. The parsing method includes: defining an array containing multiple elements; parsing JSON data to determine a JSON handle; comparing the JSON handle with the first preset number of elements in the array to obtain a comparison result; if the comparison is successful, retrieving target JSON node information from the JSON handle based on the information described by the last element in the array; determining whether the target JSON node information was successfully retrieved; and if the target JSON node information was successfully retrieved, calling the corresponding application programming interface (API) to complete the parsing function based on the target JSON node information. This application improves the accuracy of calling the API and reduces the error rate during parsing.

The application discloses a kind of methods for realizing Java Applet automation operation, comprising the following steps: step one: write a UDP Server, define interface element object structure, structure contains the handle that element holds, on the location of interface, element type data;Step two: write Java Plugin by Java Accessibility API, this Java Plugin is mainly loaded by JVM when starting;Step three: write Native Java Bridge, for JVM, operating system, and automation program communication, through HOOK technology mounts global mouse event, when mouse moves to specified Java Applet, call Plugin, and Java interface element object instance is reflected;Step four: construct UDP Client in Native Java Bridge, when Java interface element object is reflected, it is serialized into the same data type agreed with UDP Server, and is sent to UDP Server by UDP Client;The application realizes the automation operation of system developed with Java Applet technology, builds overall automatic platform, so that each system can be automatically connected, instead of traditional manual operation.

The application discloses a kind of digital teaching material format dynamic reconstruction and structured processing method, it is related to data processing technical field, the method of the present application includes: response mouse movement, constructs translation transformation matrix and renders interactive handle to source node side;Click handle locks source node, extracts identifier and attribute and is encapsulated as lock state data packet;Drag start from abstract syntax tree and extract structured slice data packet;Drag calculates longitudinal space ratio to judge insertion drop point in middle, calls interface and verifies structure legality and dynamically displays auxiliary line;Response placement event creates atomic transaction, executes position mapping and format dynamic recalculation, completes business data lossless insertion;Finally, outline directory tree in side bar is synchronized, and smooth scrolling viewport is to final target drop point.The present application effectively prevents data loss and typesetting collapse when complex nested document is dragged and reorganized, realizes multi-column component adaptive isometric width scaling, and precise linkage of global view interface.

The application discloses a Direct3D 12 resource management method based on a virtual general layout, and after VKD3D is initialized when VK_KHR_unified_image_layouts is not supported, a mapping matrix of a D3D12 resource state, a virtual general layout, a Vulkan physical layout and a pre-compiled conversion path library are constructed by traversing a Vulkan image format, when a D3D application creates a D3D12 resource, parameters are parsed to divide a sub-resource, a resource handle containing a physical layout pool and a sub-resource view array is created, binding of a Vulkan image and memory is completed, when a resource state is set, a resource handle is inquired, the virtual general layout and the Vulkan physical layout are compared in sequence, redundant requests with no change in semantics and layout are filtered to obtain a resource conversion request, the resource conversion request is combined to generate a batch memory barrier instruction, and the batch memory barrier instruction is pre-submitted to a kernel, and execution is completed by a GPU idle time window.

The invention provides a method for detecting the utilization rate of a software baseband buffer area, which comprises the following steps of: applying for a shared memory by using an associated handle while applying for a buffer area memory, storing important information related to the buffer area by the shared memory, and updating in real time during the running of a software baseband program; starting another program to use a related handle to open the shared memory, reading data in the shared memory, and checking the use condition of the memory buffer area and whether the buffer area overflows in real time, the use condition of the circular buffer area can be checked according to the handle in the configuration file, the use method is more flexible, and the use efficiency is improved. And the buffer area utilization rate observation tool does not influence the running software baseband thread, the main program of the tool runs in another process, and the use condition and important data of the software baseband buffer area can be analyzed and checked in real time under the condition that the real-time processing speed of the software baseband is not influenced.

The present application relates to the field of handle lock control system, and specifically discloses a handle lock user operation data processing method and system, which identifies key events in the operation process in the handle lock control system, records the time stamp, and extracts the associated sensor detection parameters. On this basis, the method can collect sensor detection parameter data within a set time period before and after the key event time stamp, generate a context summary containing these data, and finally store the time stamp and context summary in a structured manner. The scheme of the present application innovates the traditional log mechanism of passively recording original data stream into a recording strategy centered on key events with context summary. This strategy ensures the time continuity of the operation log and the integrity of the key information even in an environment with mechanical abnormalities, thereby providing a basis for accurately judging user intent and efficiently diagnosing faults.

The invention discloses a cross-architecture container mirror image compatibility verification method, which comprises the following steps of: receiving a container mirror image, analyzing an executable entity in the container mirror image, and constructing program representation data containing a control flow diagram and a symbol table; according to the method, by tracking the life cycle of a resource handle carrying state information in a program calling graph, a source architecture RSTG capable of describing program and kernel interaction logic is analyzed and constructed, an abstract resource state is used as a node, and system calling causing state change is used as an edge; performing mapping comparison on the source architecture RSTG and a preset target architecture RSTG rule set so as to identify an illegal state migration sequence in the target architecture and form an incompatible point set; and tracing the incompatible points, associating the incompatible points to specific code positions, and generating a report. According to the method, the compatibility verification is improved from stateless instruction comparison to stateful logic examination height, hidden compatibility defects can be found, and the verification depth and accuracy are remarkably improved.

The invention relates to the field of distributed storage, and particularly discloses a separated memory pooling method based on a self-adaptive redundancy strategy, which comprises the following steps: when a central coordinator receives a memory application request of a client, analyzing a delay constraint parameter and a cost constraint parameter contained in the request, dynamically selecting an optimal redundancy strategy through a multi-dimensional quantitative scoring model in combination with a node health score calculated based on a dynamic weighting factor, a fault probability predicted value, a network topology and a bandwidth utilization rate, and generating a composite global memory handle; and when the node fails or the strategy is switched, the coordinator pushes the new storage position and the strategy information to the client in real time through a handle hot update mechanism. According to the method, the data availability and the access continuity of the separated memory pool system in a multi-type fault scene can be remarkably improved, and meanwhile, dynamic balance among performance, cost and reliability is realized.

This invention provides an isolation architecture, a method and system for managing waveform display script objects. The isolation architecture includes: an internal object layer, comprising an internal object factory for creating internal objects corresponding to script commands; a handle mapping layer, comprising a handle allocation module and a bidirectional mapping module, wherein the handle allocation module allocates integer handles to internal objects, and the bidirectional mapping module maintains the bidirectional mapping relationship between integer handles and internal object pointers; and a script interface layer, comprising a custom command set adapted to script syntax specifications, wherein the parameters and return values ​​of each command in the custom command set conform to the basic script data types and do not contain internal object pointer information, and the script interface layer returns integer handles as return values ​​to the script. This solution, by designing a handle mapping mechanism across interpreter boundaries, achieves a clear separation between the script environment and internal object management, improving system security, performance, and maintainability.

The present application relates to the technical field of message pushing, in particular to a SaaS intelligent concurrent pushing system, which comprises a tenant traffic monitoring module, a resource binding module, a lock-free object writing module, a handle layout construction module and a cache prefetch delivery module.In the present application, high-frequency business objects are identified by monitoring tenant traffic characteristics, complete Slab pages are dynamically applied and bound to thread-specific local allocation buffers, physical isolation of underlying resources is realized to eliminate global lock competition and context switching overhead in a multi-thread environment, lock-free memory writing is performed based on a private pointer to greatly improve object construction efficiency, a compact storage structure is constructed in which a bitmap is adjacent to a connection handle, a hardware cache prefetch mechanism is triggered by bitmap reading, connection data is loaded into a CPU cache line in advance, and the cache miss rate is reduced and the performance of mass message concurrent delivery is significantly improved by using the memory locality principle.

The invention discloses a chip verification method and device, and relates to the technical field of integrated circuit design verification. The method comprises the following steps: determining an environment data class and an environment configuration class in a current verification environment; determining a reference algorithm class corresponding to the environment configuration class from algorithm classes of a pre-constructed transaction-level algorithm library according to the environment configuration class, and instantiating the reference algorithm class to obtain a reference model; constructing a reference model system comprising a reference model based on a common interface of a reference algorithm class and an object handle declared by the common interface; obtaining an environment data class and an environment configuration class through a model input agent of the reference model system, determining input of a reference model and a to-be-tested design, and obtaining final reference output of the reference model system and final test output of the to-be-tested design; and comparing the final reference output with the final test output to verify the chip. According to the embodiment, cross-level verification multiplexing can be realized, and the reusability and transportability of the reference model are improved.

A first instance is caused to execute software code to perform a first portion of a workflow in response to receipt of a workflow request, and performance of the first portion results in submission of an operation request to an entity. A resume workflow request is received from the entity, where the resume workflow request includes a handle to a snapshot that corresponds to a state of execution of the software code and a response to the operation request to the entity. Using the handle to the snapshot and the response to the operation request, a second instance is caused to execute the software code from the first state to perform a second portion of the workflow. A workflow result is received from an instance that executes a last portion of the workflow, and the workflow is provided result in response to the workflow request.

The invention discloses a Direct3D 12 descriptor compatible method based on address homologous mapping, which comprises the following steps of: when VKEXTpush descriptor is not supported, initializing core components such as first associated information, various mapping tables, layout fingerprint hash tables and the like, and requesting a kernel to create a double-space virtual descriptor heap of CPU (Central Processing Unit) and GPU (Graphics Processing Unit) address homologous mapping; when a D3D12 descriptor heap is created by application, mapping descriptor types by VKD3D, verifying the step length of a handle of the virtual descriptor heap, and applying for a virtual descriptor heap partition; when creating a root signature, converting a root parameter into a Vulkan pipeline layout, generating a layout fingerprint, and multiplexing or newly creating a descriptor set sub-pool; when the root parameters are bound, analyzing different types of root parameters to generate a descriptor push packet; when drawing and scheduling are executed, a descriptor set is obtained or distributed from the sub-pool, the descriptor set is updated and translated into a Vulkan command, and the Vulkan command is submitted to a GPU to complete rendering.

Systems and methods for managing flow configurable event-driven microservices are disclosed. A system provides, for each function in sequence of steps corresponding to transaction flow associated with model of event-driven microservices, an address of associated memory space using route name. The system connects each function with another function in memory space and / or different application instances with automatic service discovery. The system transports, for event-driven microservices, an input and / or output comprising message and / or an event comprising object corresponding to payload, in an event envelope, based on a configuration file / a configuration file-like handle. Additionally, the system executes a sequence of steps connecting each function in sequential mode or parallel mode, based on a configuration file / a configuration file-like handle. The system performs data mapping between transaction data states (‘stateful data model’) in a transaction and input / output of each function that is connected in two or more steps in single transaction.

Methods, systems, and computer-readable storage media for receiving, from a database client, an asynchronous lookup request including a key representative of a query and, in response, returning a value handle including a value promise, receiving, from the database client, a get request based on the value promise, determining that a query result corresponding to the key is unavailable in a results cache and that the key is in an unlocked state, and in response, returning a null pointer and a first key lock status to the first database client, receiving, from the database client, a key, value pair including the key and a value, the value comprising the query result, and storing the key, value pair in the results cache.

This invention relates to a method and system for caching data within a USBKey, belonging to the field of USBKey interaction technology. The method includes the following steps: the server identifies the inserted USBKey device and generates a device object for the USBKey device; the client obtains a handle to the device object from the server and requests USBKey data operations from the server using the device object handle and a data file identifier; the server determines whether the corresponding data is sensitive based on the device object handle and the data file identifier, and if not sensitive, performs the corresponding operation. The method and system provided by this invention reduce the amount of data interaction between the upper layer and the USBKey, improving efficiency while protecting sensitive information.

This invention discloses a file operation method and file operating system for distributed file systems. One embodiment of the file operation method includes: in response to the startup of a target business process, loading a dynamically linked library configured based on the LD_PRELOAD mechanism, and obtaining a globally unique process access identifier allocated by the user-space distributed file system server cluster; intercepting system calls related to glibc library files, allocating a unique file descriptor within the process in user space to replace the Linux kernel allocation logic, concatenating the process access identifier and the file descriptor to generate a globally unique file handle, and calling the server cluster interface to complete the file operation; and notifying the server cluster to release access resources when the process exits. This invention relates to the field of distributed storage technology, solves the performance bottleneck problem of existing user-space file systems, effectively eliminates kernel redundancy overhead, and enables an order-of-magnitude improvement in the read and write performance of distributed file systems.

The application relates to the technical field of big data, and provides a cold and hot data processing method and device, electronic equipment and a storage medium, the method comprises the following steps: receiving an access request of a cold and hot data table, and acquiring a first file handle; cold and hot data in a first storage space corresponding to the first file handle is classified to obtain cold data; the cold data is migrated to a second storage space, and a first file handle of the cold data is updated to a second file handle of the second storage space; when a processing request of the cold and hot data table is detected, a processing operation instruction of the processing request is acquired; and the cold and hot data table is processed based on the processing operation instruction. According to the application, the cold data of the first storage space is migrated to the second storage space, the storage logic of the cold and hot data is not changed, programs written before data migration can still run after data migration, and the processing efficiency of the cold and hot data is improved.

This invention discloses a modular integration method, system, storage medium, and device for device tree files, belonging to the field of embedded system technology. The method includes: adding slot identifiers to the board device tree source file, synchronously updating the path references of the node(“path”) and the node handle reference of &nodeName; merging the board intermediate files with slot identifiers into the baseboard device tree source file; deduplicating child nodes with the same name after merging; resolving relative path references to absolute path strings; and finally cleaning up nodes with marked attributes. This invention realizes the process from board file preprocessing to final file generation, supports multi-board, multi-slot scenarios, automatically handles path references, node handle references, node deduplication, and marked node cleanup, significantly improving the generation efficiency and accuracy of device tree configuration.

A data processing system implements techniques for operating and recovering databases that includes a plurality of replicas. The plurality of replicas includes a primary replica, a secondary replica, and a delta replica. The primary replica handles read and write operations, the secondary replica is a backup of the primary replica capable of read-only operations. The delta replica comprising a copy of the transactional log information of the primary replica but not the data. The system detects a failure of the primary and secondary replicas. The system instantiates a recovery workflow using the delta replica that includes initializing a second secondary replica; causing the second secondary replica to download backup data that represents a state of the primary replica prior to failure of the primary replica; updating the secondary replica using the backup data; and promoting the secondary replica to the primary replica.

This invention provides a method, apparatus, device, and storage medium for script function performance analysis. The method includes: when a script function is detected to be called, creating a corresponding script event handle based on the function information of the script function, moving the script event handle into a test event pool, generating a first handle, and recording the time when the script event handle is moved into the test event pool; when a script function is detected to return, removing the corresponding script event handle from the test event pool based on the first handle, and recording the time when the script event handle is removed from the test event pool; and determining the time consumption of the script function based on the time when the script event handle is moved into and removed from the test event pool. This invention can locate the performance consumption of script functions during game runtime and avoids developers needing to manually mark each function in a large script file, saving manpower and material resources for performance testing and improving testing efficiency.