Abstract: An appropriate user interface corresponding to a use state of an apparatus is provided. An imaging system includes an imaging apparatus and an information processing apparatus. The imaging apparatus has a control related to an imaging operation performed based on an operation input performed in the information processing apparatus by connecting to the information processing apparatus by using wireless communication. The information processing apparatus performs a control for switching a display state of a display screen related to an imaging operation of the imaging apparatus, based on a connection number of imaging apparatuses and information processing apparatuses connected by using wireless communication.

Abstract: A semiconductor device includes a base body, a stacked body on the base body and a first columnar part. The base body includes a substrate, a first insulating film on the substrate, a first conductive film on the first insulating film, and a first semiconductor part on the first conductive film. The stacked body includes conductive layers and insulating layers stacked alternately in a stacking direction. The first columnar part is provided inside the stacked body and the first semiconductor part. The first columnar part includes a semiconductor body and a memory film between the semiconductor body and conductive layers. The semiconductor body extends in the stacking direction. The first columnar part has a first diameter and a second diameter in a first direction crossing the stacking direction. The first diameter inside the first semiconductor part is larger than the second diameter inside the stacked body.

Abstract: Methods and systems for managing data redundancy include registering certified commands, input files, output files, and arguments in an execution history list after execution of said certified commands. An existing output file is provided in response to execution of a first certified command that matches an entry in the execution history list. A file is deleted if the file is reproducible from another file using a second certified command. The deleted file is registered in a reproducible file list. The deleted file is reproduced upon request using the second certified command.

Abstract: A first record group and a second record group having a tree structure are merge-sorted. The first record group and the second record group are acquired, and depth information indicative of the hierarchical depth of the tree structure is attached as metadata to key information on each node of each record included in the acquired first record group and second record group. The depth information is compared in preference to the key information to perform merge sort sequentially.

Abstract: Methods and systems for refactoring a problem include refactoring an original problem having a dimension that cannot be broken into an integer number of portions, each portion having a number of problem elements equal to a size of a systolic array, into a new problem having a dimension that can be broken into an integer number of portions, each portion having a number of problem elements equal to the size of the systolic array. The new problem is solved with the systolic array. The systolic array has a size defined by an integer number of processing elements and is configured to solve portions of problems having a number of problem elements equal to the number of processing elements.

Abstract: A computer-implemented method is provided for refreshing cells in a Non-Volatile Memory (NVM)-based neuromorphic circuit wherein synapses are each composed of a respective cell pair formed from a respective Gp cell and a respective Gm cell of the cells. The method includes randomly selecting multiple neurons and reading a conductance of any of the synapses connected to the multiple neurons. The method further includes selecting any of the synapses connected to the selected multiple neurons for which the Gm conductance has reached a maximum conductance. The method also includes resetting the Gp cell and Gm cell of the selected synapses, and setting, at most, one of the Gp cell and Gm cell of each of the selected synapses to recover an effective total weight of each of the selected synapses.

Abstract: A computer-implemented method is provided for refreshing cells in a Non-Volatile Memory (NVM)-based neuromorphic circuit wherein synapses are each composed of a respective cell pair formed from a respective Gp cell and a respective Gm cell of the cells. The method includes randomly selecting multiple neurons and reading a conductance of any of the synapses connected to the multiple neurons. The method further includes selecting any of the synapses connected to the selected multiple neurons for which the Gm conductance has reached a maximum conductance. The method also includes resetting the Gp cell and Gm cell of the selected synapses, and setting, at most, one of the Gp cell and Gm cell of each of the selected synapses to recover an effective total weight of each of the selected synapses.

Abstract: A computer-implemented method is provided for refreshing cells in a Non-Volatile Memory (NVM)-based neuromorphic circuit wherein synapses are each composed of a respective cell pair formed from a respective Gp cell and a respective Gm cell of the cells. The method includes randomly selecting multiple neurons and reading a Gp conductance and a Gm conductance of any of the synapses connected to the multiple neurons. The method further includes selecting any of the synapses connected to the selected multiple neurons for which any of the Gp conductance or the Gm conductance have reached a maximum conductance. The method also includes resetting the Gp cell and Gm cell of the selected synapses, and setting, at most, one of the Gp cell and Gm cell of each of the selected synapses to recover an effective total weight of each of the selected synapses.

Abstract: A first record group and a second record group having a tree structure are merge-sorted. The first record group and the second record group are acquired, and depth information indicative of the hierarchical depth of the tree structure is attached as metadata to key information on each node of each record included in the acquired first record group and second record group. The depth information is compared in preference to the key information to perform merge sort sequentially.

Abstract: A first record group and a second record group having a tree structure are merge-sorted. The first record group and the second record group are acquired, and depth information indicative of the hierarchical depth of the tree structure is attached as metadata to key information on each node of each record included in the acquired first record group and second record group. The depth information is compared in preference to the key information to perform merge sort sequentially.

Abstract: A first record group and a second record group having a tree structure are merge-sorted. The first record group and the second record group are acquired, and depth information indicative of the hierarchical depth of the tree structure is attached as metadata to key information on each node of each record included in the acquired first record group and second record group. The depth information is compared in preference to the key information to perform merge sort sequentially.

Abstract: Methods and systems for refactoring a problem include refactoring an original problem having a dimension that cannot be broken into an integer number of portions, each portion having a number of problem elements equal to a size of a systolic array, into a new problem having a dimension that can be broken into an integer number of portions, each portion having a number of problem elements equal to the size of the systolic array. The new problem is solved with the systolic array. The systolic array has a size defined by an integer number of processing elements and is configured to solve portions of problems having a number of problem elements equal to the number of processing elements.

Abstract: A first record group and a second record group having a tree structure are merge-sorted. The first record group and the second record group are acquired, and depth information indicative of the hierarchical depth of the tree structure is attached as metadata to key information on each node of each record included in the acquired first record group and second record group. The depth information is compared in preference to the key information to perform merge sort sequentially.

Abstract: Methods and systems for managing data redundancy include registering certified commands, input files, output files, and arguments in an execution history list after execution of said certified commands. An existing output file is provided in response to execution of a first certified command that matches an entry in the execution history list. A file is deleted if the file is reproducible from another file using a second certified command. The deleted file is registered in a reproducible file list. The deleted file is reproduced upon request using the second certified command.

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 first record group and a second record group having a tree structure are merge-sorted. The first record group and the second record group are acquired, and depth information indicative of the hierarchical depth of the tree structure is attached as metadata to key information on each node of each record included in the acquired first record group and second record group. The depth information is compared in preference to the key information to perform merge sort sequentially.

Abstract: An image forming apparatus capable of making image quality more stable than in the prior art. An electrostatic latent image is formed on the surface of a photosensitive member based on an image signal. A developing device develops the electrostatic latent image on the photosensitive member by toner to thereby form a patch image. An optical sensor detects the density of the patch image. A toner charge amount is calculated from the density detected by the optical sensor, and a change in the toner charge amount is predicted based on a plurality of results of the calculation of the toner charge amount. The image forming apparatus generates a ?LUT for use in correcting the relationship between the image signal and the density based on the predicted change in the toner charge amount.

Abstract: A method for executing native code in a distributed Java Virtual Machine (JVM) is disclosed herein. The method may include receiving, in a first thread executing in a remote execution container, a first native code-generated call, such as a Java Native Interface (JNI) call, to a second thread, the first call including a first array write request. The first call may be stored in an instruction cache and bundled with a second native code-generated call and sent to the second thread. The calls are unbundled and executed in the second thread. An opaque handle to an array returned by the second call is bundled with corresponding array data and returned to the first thread. The array data of the bundle is stored in a data cache and retrieved in response to requests for the array data addressed to the second thread. A corresponding computer program product is also disclosed.

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.