Abstract: One purpose of the present disclosure is to provide a fluid discharging system which is capable of stably supplying fluid to a discharging device while suppressing an increase in an installation space and cost. A fluid discharging system 10 includes a discharging device 30 configured to discharge fluid, a pump 20 configured to supply the fluid stored in a reservoir 22 to the discharging device 30, a supply line 40 connecting the discharging device 30 with the pump 20 to allow the fluid to pass therethrough, and a buffer tank 50, disposed at an intermediate location of the supply line 40, and configured to suck and discharge the fluid. The fluid discharging system 10 is capable of continuing supply of the fluid to the discharging device 30 by discharging the fluid from the buffer tank 50 to the supply line 40, while limiting the supply of the fluid from the pump 20 to the discharging device 30.

Abstract: A computer-implemented method for improving performance of data processing with nullable schema information by using a data processing framework is presented. The method includes reading, by the processor, data from one or more blocks forming a column, where the data is stored in a database including the one or more blocks and determining, by the processor, whether any row in each block of the one or more blocks includes null data. The computer-implemented method further includes executing, by the data processing framework, optimized code if the block does not include null data and executing, by the data processing framework, non-optimized code if the block includes null data.

Abstract: A computer-implemented scaling method, an apparatus, and a computer program product for detecting whether a performance of a system reaches a target performance are provided. The method includes scaling a layered software environment, including scaling a first layer software environment in the layered software environment in response to the performance of the system not reaching the target performance and scaling a second layer software environment that is above the first layer software environment in the layered software environment in response to the performance of the system not reaching the target performance despite the first layer software environment being scaled. The method also includes scaling hardware resources used for executing the layered software environment in the system in response to the performance of the system not reaching the target performance before scaling of the first layer software environment or after scaling of the second layer software environment.

Abstract: A computer-implemented scaling method, an apparatus, and a computer program product for detecting whether a performance of a system reaches a target performance are provided. The method includes scaling a layered software environment, including scaling a first layer software environment in the layered software environment in response to the performance of the system not reaching the target performance and scaling a second layer software environment that is above the first layer software environment in the layered software environment in response to the performance of the system not reaching the target performance despite the first layer software environment being scaled. The method also includes scaling hardware resources used for executing the layered software environment in the system in response to the performance of the system not reaching the target performance before scaling of the first layer software environment or after scaling of the second layer software environment.

Abstract: A device compresses a mapping table in a flash translation layer of a SSD. The mapping table includes mappings between Logical Page Numbers (LPNs) and Physical Page Numbers (PPNs). A base PPN table stores at least one entry including a base PPN common to multiple LPNs. A PPN offset table stores an offset for each mapping. A set of hash functions are duplicated for each entry in the base PPN table. A bit extension unit adds bits to the respective offset in the PPN offset table to provide an extended offset bit. A hash calculator calculates a hash value using the base PPN and one of the hash functions corresponding to the base PPN. An exclusive OR unit outputs a new PNN for each of different LPNs, including the multiple LPNs, by applying an exclusive OR operation to the hash value and the extended offset bit.

Abstract: A computer-implemented method is presented for caching content. The method includes storing content received from a data stream, employing a cache array and a retrieval data structure to process the content, determining, by the processor, if the content is popular content which appears frequently, a position in the cache array holding a strong reference to the content, determining, by the processor, if the content is unpopular content which appears infrequently, an arbitrary position in the cache array holding a strong reference to the unpopular content, the retrieval data structure holding a weak reference to the content, and issuing cached content to a cache data storage device accessed by a user interface of a computing device communicating with the data processing system.

Abstract: A device compresses a mapping table in a flash translation layer of a SSD. The mapping table includes mappings between Logical Page Numbers (LPNs) and Physical Page Numbers (PPNs). A base PPN table stores at least one entry including a base PPN common to multiple LPNs. A PPN offset table stores an offset for each mapping. A set of hash functions are duplicated for each entry in the base PPN table. A bit extension unit adds bits to the respective offset in the PPN offset table to provide an extended offset bit. A hash calculator calculates a hash value using the base PPN and one of the hash functions corresponding to the base PPN. An exclusive OR unit outputs a new PNN for each of different LPNs, including the multiple LPNs, by applying an exclusive OR operation to the hash value and the extended offset bit.

Abstract: A computer-implemented method is presented for caching content. The method includes storing content received from a data stream, employing a cache array and a retrieval data structure to process the content, determining, by the processor, if the content is popular content which appears frequently, a position in the cache array holding a strong reference to the content, determining, by the processor, if the content is unpopular content which appears infrequently, an arbitrary position in the cache array holding a strong reference to the unpopular content, the retrieval data structure holding a weak reference to the content, and issuing cached content to a cache data storage device accessed by a user interface of a computing device communicating with the data processing system.

Abstract: A computer-implemented method is presented for caching content. The method includes storing content received from a data stream, employing a cache array and a retrieval data structure to process the content, determining, by the processor, if the content is popular content which appears frequently, a position in the cache array holding a strong reference to the content, determining, by the processor, if the content is unpopular content which appears infrequently, an arbitrary position in the cache array holding a strong reference to the unpopular content, the retrieval data structure holding a weak reference to the content, and issuing cached content to a cache data storage device accessed by a user interface of a computing device communicating with the data processing system.

Abstract: A computer-implemented method is presented for caching content. The method includes storing content received from a data stream, employing a cache array and a retrieval data structure to process the content, determining, by the processor, if the content is popular content which appears frequently, a position in the cache array holding a strong reference to the content, determining, by the processor, if the content is unpopular content which appears infrequently, an arbitrary position in the cache array holding a strong reference to the unpopular content, the retrieval data structure holding a weak reference to the content, and issuing cached content to a cache data storage device accessed by a user interface of a computing device communicating with the data processing system.

Abstract: A method transforms a monolithic application into microservices. The method groups application classes and methods into clusters, each corresponding to a respective microservice. The method determines a number of function calls to and from each clustered class and method. The method presents processing options for at least the one of the clustered classes and the methods that has a maximum value for the number of functions calls. The options include: create a new cluster with the at least of the classes and the methods; merge the at least one of the classes and the methods into a different cluster; duplicate the at least one of the classes and the methods into clusters having caller or callee classes or methods; and remain the at least one of the classes and the methods. The method processes the at least one of the classes and the methods based on the user selected option.

Abstract: A computer-implemented method for improving performance of data processing with nullable schema information by using a data processing framework is presented. The method includes reading, by the processor, data from one or more blocks forming a column, where the data is stored in a database including the one or more blocks and determining, by the processor, whether any row in each block of the one or more blocks includes null data. The computer-implemented method further includes executing, by the data processing framework, optimized code if the block does not include null data and executing, by the data processing framework, non-optimized code if the block includes null data.

Abstract: A detection device includes a transceiver and a detector. The transceiver causes an ultrasonic sensor used in a vehicle to alternately transmit a first transmission wave having a first amplitude level and a second transmission wave having a second amplitude level that is larger than the first amplitude level. The transceiver receives, from the ultrasonic sensor, a first received signal of the first transmission wave and a second received signal of the second transmission wave. The detector detects an obstacle based on the first received signal or the second received signal having a reception level larger than a predetermined threshold. The detector detects the obstacle based on the second received signal that does not include a second road surface reflected wave out of the second received signal.

Abstract: Described herein are hash table structures and system and methods for creating and storing data in the hash table structures. Hash tables and input buffers associated with same are configured in several arrangements, including multi-level hash tables and nested multi-level hash tables. The hash table structures described herein are well suited for being configured in the memory blocks of field-programmable gate arrays.

Abstract: A method transforms a monolithic application into microservices. The method groups application classes and methods into clusters, each corresponding to a respective microservice. The method determines a number of function calls to and from each clustered class and method. The method presents processing options for at least the one of the clustered classes and the methods that has a maximum value for the number of functions calls. The options include: create a new cluster with the at least of the classes and the methods; merge the at least one of the classes and the methods into a different cluster; duplicate the at least one of the classes and the methods into clusters having caller or callee classes or methods; and remain the at least one of the classes and the methods. The method processes the at least one of the classes and the methods based on the user selected option.

Abstract: A computer-implemented scaling method, an apparatus, and a computer program product for detecting whether a performance of a system reaches a target performance are provided. The method includes scaling a layered software environment, including scaling a first layer software environment in the layered software environment in response to the performance of the system not reaching the target performance and scaling a second layer software environment that is above the first layer software environment in the layered software environment in response to the performance of the system not reaching the target performance despite the first layer software environment being scaled. The method also includes scaling hardware resources used for executing the layered software environment in the system in response to the performance of the system not reaching the target performance before scaling of the first layer software environment or after scaling of the second layer software environment.

Abstract: A computer-implemented scaling method, an apparatus, and a computer program product for detecting whether a performance of a system reaches a target performance are provided. The method includes scaling a layered software environment, including scaling a first layer software environment in the layered software environment in response to the performance of the system not reaching the target performance and scaling a second layer software environment that is above the first layer software environment in the layered software environment in response to the performance of the system not reaching the target performance despite the first layer software environment being scaled. The method also includes scaling hardware resources used for executing the layered software environment in the system in response to the performance of the system not reaching the target performance before scaling of the first layer software environment or after scaling of the second layer software environment.

Abstract: A method, a computer system, and/or a computer program product are disclosed. One computer-implemented method for building a hash table includes dividing a hash table into plural blocks; and dividing each block into plural sub-blocks. A certain sub-block uses a first pattern of association between a key and a location for storing the key. Another sub-block which belongs to the same block having the certain sub-block uses a second pattern which is different from the first pattern. The method may further include building a hash table by using memory blocks in a Field Programmable Gate Array.

Abstract: A method for producing a dust-resistant sliding member, the method including a step of preparing a resin composition containing 0.5 to 5.0 parts by mass of a specific lubricant that is liquid at 25° C., 0.1 to 30 parts by mass of an inorganic filler, 1.0 to 20 parts by mass of a specific modified olefin-based polymer, and 0.01 to 5.0 parts by mass of an alkylene glycol-based polymer having a primary or secondary amino group, per 100 parts by mass of a polyacetal copolymer containing oxyalkylene units in a ratio of 0.4 to 0.9 mol % relative to all of the structural units; and a step of molding the resin composition into a prescribed shape.

Abstract: A method for producing a dust-resistant sliding member, the method including a step of preparing a resin composition containing 0.5 to 5.0 parts by mass of a lubricant that is liquid at 25° C. and is composed of at least one material selected from the group consisting of ethylene/?-olefin copolymers, poly-?-olefins and silicones, and 0.1 to 30 parts by mass of an inorganic filler, per 100 parts by mass of a polyacetal resin, and a step of molding the resin composition into a prescribed shape.