Abstract: The invention provides a preparation method of high-content Ganoderma lucidum ?-glucan and an efficient and rapid detection method thereof. The preparation method comprises ethanol-trypsin pretreatment of Ganoderma lucidum fruiting body in combination with ultrasonic-assisted alkaline hydrothermal extraction of ?-glucan from Ganoderma lucidum, and purifying ?-glucan by DEAE Sephadex A-25 Sephadex column chromatography using NAOH solution as a mobile phase, to obtain high purity (?90%) of Ganoderma lucidum ?-glucan. The detection method comprises placing the extracted ?-glucan in an autoclave and performing hydrolysis with ?-(1,3)-exo-glucanase and ?-glucosidase, and detecting and analyzing the content of the prepared ?-glucan by high pressure-acid enzymatic hydrolysis-HPLC method, using glucose as a standard. The preparation method of ?-glucan has high extraction ratio.

Abstract: Methods and systems are disclosed for traversing a graph database. The graph database may be used for search for information for a variety of applications, a web search and dictionary look-ups for voice recognitions for examples. Issues on quickly traversing a graph in the graph database with highly connected entities (nodes) may be addressed by generating a subgraph upon a graph traversal for an entity and traversing the subgraph in subsequent occurrences of looking up the entity. The methods and systems are disclosed for updating the entity of the subgraph with a newer version of data of the corresponding entity of the graph when the data in the entity of the subgraph and the data in the graph are distinct. The differences of versions of data may be identified based on an availability status of data for versions of data and timestamps of last updates to data in the entity of the graph.

Abstract: Systems and methods to obtain a text-based representation of a machine learning (ML) graph identifying one or more transforms usable to prepare data for ML training. The systems and methods can determine computer-executable instructions based on the text-based representation of the ML graph, where the computer-executable instructions can include instructions associated with the one or more transforms to prepare data for ML training. Additionally, the systems and methods can process the computer-executable instructions to generate ML training data based on at least the one or more transforms.

Abstract: The technology described herein allows an interactive program to leverage a knowledge graph to maximize the likelihood of successfully understanding the user's query and at the same time minimize the number of turns taken to understand the user. A goal of the technology described herein is to formulate response queries that have a probability of completing the user's requested task accurately while issuing the fewest number of response queries to the user before determining the intended task. In order to accomplish this, the technology combines a reinforced learning mechanism with a knowledge-graph simulation score to determine the optimal response query.

Abstract: Methods and systems are disclosed for traversing a graph database. The graph database may be used for search for information for a variety of applications, a web search and dictionary look-ups for voice recognitions for examples. Issues on quickly traversing a graph in the graph database with highly connected entities (nodes) may be addressed by generating a subgraph upon a graph traversal for an entity and traversing the subgraph in subsequent occurrences of looking up the entity. The methods and systems are disclosed for updating the entity of the subgraph with a newer version of data of the corresponding entity of the graph when the data in the entity of the subgraph and the data in the graph are distinct. The differences of versions of data may be identified based on an availability status of data for versions of data and timestamps of last updates to data in the entity of the graph.

Abstract: A method, system and computer program product for remote direct memory access (RDMA) optimized producer-consumer message processing in a messaging hub is provided. The method includes initializing a shared memory region in memory of a host server hosting operation of a messaging hub. The initialization provides for a control portion and one or more data portions, the control portion storing an index to an available one of the data portions. The method also includes transmitting to a message producer an address of the shared memory region and receiving a message in one of the data portions of the shared memory region from the message producer by way of an RDMA write operation on a network interface of the host server. Finally, the method includes retrieving the message from the one of the data portions and processing the message in the messaging hub in response to the receipt of the message.

Abstract: The technology described herein allows an interactive program to leverage a knowledge graph to maximize the likelihood of successfully understanding the user's query and at the same time minimize the number of turns taken to understand the user. A goal of the technology described herein is to formulate response queries that have a probability of completing the user's requested task accurately while issuing the fewest number of response queries to the user before determining the intended task. In order to accomplish this, the technology combines a reinforced learning mechanism with a knowledge-graph simulation score to determine the optimal response query.

Abstract: A method, system and computer program product for remote direct memory access (RDMA) optimized producer-consumer message processing in a messaging hub is provided. The method includes initializing a shared memory region in memory of a host server hosting operation of a messaging hub. The initialization provides for a control portion and one or more data portions, the control portion storing an index to an available one of the data portions. The method also includes transmitting to a message producer an address of the shared memory region and receiving a message in one of the data portions of the shared memory region from the message producer by way of an RDMA write operation on a network interface of the host server. Finally, the method includes retrieving the message from the one of the data portions and processing the message in the messaging hub in response to the receipt of the message.

Abstract: A method, system and computer program product for remote direct memory access (RDMA) optimized producer-consumer message processing in a messaging hub is provided. The method includes initializing a shared memory region in memory of a host server hosting operation of a messaging hub. The initialization provides for a control portion and one or more data portions, the control portion storing an index to an available one of the data portions. The method also includes transmitting to a message producer an address of the shared memory region and receiving a message in one of the data portions of the shared memory region from the message producer by way of an RDMA write operation on a network interface of the host server. Finally, the method includes retrieving the message from the one of the data portions and processing the message in the messaging hub in response to the receipt of the message.

Abstract: A method, system and computer program product for remote direct memory access (RDMA) optimized producer-consumer message processing in a messaging hub is provided. The method includes initializing a shared memory region in memory of a host server hosting operation of a messaging hub. The initialization provides for a control portion and one or more data portions, the control portion storing an index to an available one of the data portions. The method also includes transmitting to a message producer an address of the shared memory region and receiving a message in one of the data portions of the shared memory region from the message producer by way of an RDMA write operation on a network interface of the host server. Finally, the method includes retrieving the message from the one of the data portions and processing the message in the messaging hub in response to the receipt of the message.

Abstract: A method, system and computer program product for remote direct memory access (RDMA) optimized producer-consumer message processing in a messaging hub is provided. The method includes initializing a shared memory region in memory of a host server hosting operation of a messaging hub. The initialization provides for a control portion and one or more data portions, the control portion storing an index to an available one of the data portions. The method also includes transmitting to a message producer an address of the shared memory region and receiving a message in one of the data portions of the shared memory region from the message producer by way of an RDMA write operation on a network interface of the host server. Finally, the method includes retrieving the message from the one of the data portions and processing the message in the messaging hub in response to the receipt of the message.

Abstract: A method, system and computer program product for remote direct memory access (RDMA) optimized producer-consumer message processing in a messaging hub is provided. The method includes initializing a shared memory region in memory of a host server hosting operation of a messaging hub. The initialization provides for a control portion and one or more data portions, the control portion storing an index to an available one of the data portions. The method also includes transmitting to a message producer an address of the shared memory region and receiving a message in one of the data portions of the shared memory region from the message producer by way of an RDMA write operation on a network interface of the host server. Finally, the method includes retrieving the message from the one of the data portions and processing the message in the messaging hub in response to the receipt of the message.

Abstract: A server and/or a client stores a metadata hash map that includes one or more entries associated with keys for data records stored in a cache on a server, wherein the data records comprise Java Virtual Machine (JVM) artifacts or monitoring information. Each of the entries stores metadata for a corresponding data record, wherein the metadata comprises a server-side remote pointer that references the corresponding data record stored in the cache, as well as a version identifier for the key. A selected data record is accessed using a provided key by: (1) identifying potentially matching entries in the metadata hash map using the provided key; (2) accessing data records stored in the cache using the server-side remote pointers from the potentially matching entries; and (3) determining whether the accessed data records match the selected data record using the provided key and the version identifiers from the potentially matching entries.

Abstract: Managing buffers in a hybrid system, in one aspect, may comprise selecting a first buffer management method from a plurality of buffer management methods; capturing statistics associated with access to the buffer in the hybrid system running under the initial buffer management method; analyzing the captured statistics; identifying a second buffer management method based on the analyzed captured statistics; determining whether the second buffer management method is more optimal than the first buffer management method; in response to determining that the second buffer management method is more optimal than the first buffer management method, invoking the second buffer management method; and repeating the capturing, the analyzing, the identifying and the determining.

Abstract: Managing buffers in a hybrid system, in one aspect, may comprise selecting a first buffer management method from a plurality of buffer management methods; capturing statistics associated with access to the buffer in the hybrid system running under the initial buffer management method; analyzing the captured statistics; identifying a second buffer management method based on the analyzed captured statistics; determining whether the second buffer management method is more optimal than the first buffer management method; in response to determining that the second buffer management method is more optimal than the first buffer management method, invoking the second buffer management method; and repeating the capturing, the analyzing, the identifying and the determining.

Abstract: A method, system and computer program product for remote direct memory access (RDMA) optimized producer-consumer message processing in a messaging hub is provided. The method includes initializing a shared memory region in memory of a host server hosting operation of a messaging hub. The initialization provides for a control portion and one or more data portions, the control portion storing an index to an available one of the data portions. The method also includes transmitting to a message producer an address of the shared memory region and receiving a message in one of the data portions of the shared memory region from the message producer by way of an RDMA write operation on a network interface of the host server. Finally, the method includes retrieving the message from the one of the data portions and processing the message in the messaging hub in response to the receipt of the message.

Abstract: A method, system and computer program product for remote direct memory access (RDMA) optimized producer-consumer message processing in a messaging hub is provided. The method includes initializing a shared memory region in memory of a host server hosting operation of a messaging hub. The initialization provides for a control portion and one or more data portions, the control portion storing an index to an available one of the data portions. The method also includes transmitting to a message producer an address of the shared memory region and receiving a message in one of the data portions of the shared memory region from the message producer by way of an RDMA write operation on a network interface of the host server. Finally, the method includes retrieving the message from the one of the data portions and processing the message in the messaging hub in response to the receipt of the message.

Abstract: A natural language business system and method is developed to understand the underlying meaning of a person's speech, such as during a transaction with the business system. The system includes a speech recognition engine, and action classification engine, and a control module. The control module causes the system to execute an inventive method wherein the speech recognition and action classification models may be recursively optimized on an unisolated performance metric that is pertinent to the overall performance of the natural language business system, as opposed to the isolated model-specific criteria previously employed.

Abstract: Detecting localizable native methods may include statically analyzing a native binary file of a native method. For each function call invoked in the native binary, it is checked whether resources accessed through the function call is locally available or not. If all resources accessed though the native method is locally available, the method is annotated as localizable.

Abstract: A server and/or a client stores a metadata hash map that includes one or more entries associated with keys for data records stored in a cache on a server, wherein the data records comprise Java Virtual Machine (JVM) artifacts or monitoring information. Each of the entries stores metadata for a corresponding data record, wherein the metadata comprises a server-side remote pointer that references the corresponding data record stored in the cache, as well as a version identifier for the key. A selected data record is accessed using a provided key by: (1) identifying potentially matching entries in the metadata hash map using the provided key; (2) accessing data records stored in the cache using the server-side remote pointers from the potentially matching entries; and (3) determining whether the accessed data records match the selected data record using the provided key and the version identifiers from the potentially matching entries.