Abstract: Disclosed herein a method and apparatus for providing a comment interface to encourage writing high-quality comments. The method includes: acquiring comment history information of a comment user who wants to enter a comment, based on user information of the comment user, determining a gaze effect of gazing the comment of the comment user among preset gaze effects based on the comment history information, and providing a comment interface including the determined gaze effect to the comment user.

Abstract: The present disclosure relates to a method and system for verifying end-to-end data integrity during big data transfer, and includes transferring, with a source node, at least one data set to a sink node; verifying, with the sink node, integrity of at least one object comprised in the data set based on a data and layer-aware Bloom filter (DLBF); verifying, with the sink node, integrity of at least one file comprised in the data set based on a two-phase Bloom filter (TPBF); and verifying, by the sink node, integrity of the data set based on the integrity verification of the object and the file, and can be applied to other embodiments.

Abstract: The electronic device for improving the inference performance of a pre-trained language model according to an exemplary embodiment of the present invention includes a processor for sequentially passing input data through a plurality of transformer layers of the pre-trained language model and obtaining output data, wherein the processor calculates a probability distribution for prediction results received from each transformer layer in each of a plurality of middle layers connected to each rear end of the plurality of transformer layers, and measures a confidence level of the prediction results based on an entropy value calculated by using the probability distribution, and wherein when a confidence level less than a predefined value is measured in a predefined number of consecutive middle layers among the plurality of middle layers, the processor outputs a prediction result of the first middle layer as the output data by taking the last first middle layer among the consecutive middle layers as an exit.

Abstract: Present disclosure is directed to an electronic device for providing real-time emotional feedback to a user's writing, the electronic device may include a display for displaying a first interface for displaying text information and a second interface for displaying emotion information, and a processor to transmit a first text to a classification server in real-time upon receiving a user input for entering the first text on the first interface, receive a first emotion information about at least one emotion of a virtual audience corresponding to the first text and a generation probability of the at least one emotion through a model. The model is included in the classification server and trained to identify emotions of a virtual audience corresponding to text.

Abstract: The present invention relates to a method and apparatus for checking mental health using contents, and may include collecting text data, which is content uploaded to at least one service server providing a social network service, by an electronic apparatus, performing preprocessing by which the electronic apparatus removes obsolete text from the text data and converts the extracted meaningful text to lowercase letters, performing, by the electronic apparatus, labeling of preprocessed meaningful text, performing, by the electronic apparatus, word embedding for the labeled meaningful text, and checking the mental health status of a user who has uploaded the text data by applying the word embedding result to a deep learning algorithm by the electronic apparatus, and it is possible to apply to other exemplary embodiments.

Abstract: Provided is a method and system for preventing transfer errors of big data, including dividing entire data to be transmitted by a first device into a plurality of pieces of entity data and allocating a resource to first entity data among the plurality of pieces of entity data, applying, by the first device, the first entity data to a filter to query for the first entity data, transmitting, by the first device, the first entity data to a second device based on a result of the query for the first entity data, and upon receiving a sync request for the first entity data from the second device, releasing, by the first device, the resource allocated to the first entity data.

Abstract: Provided are a method and apparatus for providing a location-based service (LBS) in a dynamic road network, which include, according to an LBS request signal received from at least one user terminal, generating a query object based on location information of the user terminal; searching for at least one data object located within a threshold radius based on the user terminal; generating a cluster including at least one query object based on at least one node; comparing distances between boundary query objects and an inner query object based on the generated cluster and calculating a nearest neighbor for each query object; and identifying the data object associated with the calculated nearest neighbor.

Abstract: The present invention relates to an apparatus and a method for managing a buffer having three states on the basis of a flash memory and, more specifically, to an apparatus and a method for improving the performance of a database management system (DBMS) on the basis of the flash memory and a use life span of a storage device by reducing a writing operation for a flash memory device in which the writing operation is very slow in comparison with a reading operation, through an efficient buffer managing method and a new index node split policy. To this end, the buffer management device having three states on the basis of the flash memory according to an embodiment of the present invention comprises: a buffer memory unit; a list management unit; a buffer memory management unit; and a log buffer unit.

Abstract: The present invention is directed to a method of calculating the results of a moving k-nearest query and safe exit locations in a road network, and more particularly to a method and apparatus that receive a request from a client terminal and provide the results of a k-nearest query, a safe zone and safe exit locations together. In the present invention, a query is processed in a server, a request for a query from a querying user and the location information of the querying user are received from an LBS, the location information of the querying user is anonymized and then the query request is transferred to the server, and query results corresponding to the anonymized location information of the querying user are received from the server and then transferred to the querying user, thereby protecting the location information of the querying user.

Abstract: The present invention relates to a method for a page-level address mapping based on flash memory and a system thereof. A method for a page-level address mapping based on a flash memory according to an embodiment of the present invention includes the steps of: receiving a write operation from a file system; generating condensed mapping information using a size of data information of the write operation and a start logical address of sequentially allocated logical addresses of the write operation; and storing the condensed mapping information as a first mapping table in a memory of a flash translation.

Abstract: The present invention relates to a method of computing the result of a moving range query and the locations of safe exits in a road network and, more particularly, to a method and apparatus that receive a range query request from a moving client terminal and that provide a range query result, a safe region in which the range query result is maintained, and the locations of safe exits. The present invention provides a method in which a server provides a first query processing result and information about a safe region that provides a range query result identical to the first query result, thereby minimizing communication between a server and a client terminal when the client terminal is located in the safe region.

Abstract: The present invention is directed to a method of calculating the results of a moving k-nearest query and safe exit locations in a road network, and more particularly to a method and apparatus that receive a request from a client terminal and provide the results of a k-nearest query, a safe zone and safe exit locations together. In the present invention, a query is processed in a server, a request for a query from a querying user and the location information of the querying user are received from an LBS, the location information of the querying user is anonymized and then the query request is transferred to the server, and query results corresponding to the anonymized location information of the querying user are received from the server and then transferred to the querying user, thereby protecting the location information of the querying user.

Abstract: The present invention relates to an apparatus and a method for managing a buffer having three states on the basis of a flash memory and, more specifically, to an apparatus and a method for improving the performance of a database management system (DBMS) on the basis of the flash memory and a use life span of a storage device by reducing a writing operation for a flash memory device in which the writing operation is very slow in comparison with a reading operation, through an efficient buffer managing method and a new index node split policy. To this end, the buffer management device having three states on the basis of the flash memory according to an embodiment of the present invention comprises: a buffer memory unit; a list management unit; a buffer memory management unit; and a log buffer unit.

Abstract: The present invention provides a flash memory controller for mapping the logical addresses to the physical addresses of memory including a plurality of blocks, each having a plurality of pages, wherein the memory controller includes a processor. The processor includes hot page decision unit and an address translation unit. The hot page decision unit classifies pages in each block into hot pages and cold pages based on a predetermined criterion. When there is a plurality of the classified hot pages, the address translation unit respectively arranges the classified hot pages in different target blocks. In accordance with this configuration, upon performing a merge operation, hot pages and cold pages are determined, and the hot pages are respectively distributed to empty blocks, so that concentration of an erase operation on a specific physical block may be avoided, thus wear-leveling may be performed more efficiently.

Abstract: The present invention relates to a method of computing the result of a moving range query and the locations of safe exits in a road network and, more particularly, to a method and apparatus that receive a range query request from a moving client terminal and that provide a range query result, a safe region in which the range query result is maintained, and the locations of safe exits. The present invention provides a method in which a server provides a first query processing result and information about a safe region that provides a range query result identical to the first query result, thereby minimizing communication between a server and a client terminal when the client terminal is located in the safe region.

Abstract: The present invention relates to a method for a page-level address mapping based on flash memory and a system thereof. A method for a page-level address mapping based on a flash memory according to an embodiment of the present invention includes the steps of: receiving a write operation from a file system; generating condensed mapping information using a size of data information of the write operation and a start logical address of sequentially allocated logical addresses of the write operation; and storing the condensed mapping information as a first mapping table in a memory of a flash translation.

Abstract: The present invention relates to an information identifying algorithm, and more particularly, to a method and device for identifying write operation information transmitted from a file system to a page-set or block-set type flash memory by utilizing an attribute information page-set buffer and a user information page-set buffer. In order to achieve such an object, the present invention includes a buffering layer for efficiently re-configuring write operation information from a file system to a page-set or block-set type flash memory. The device for identifying write operation information according to one embodiment of the present invention includes: a size determination unit; a logical address determination unit; an attribute information page-set buffer; a user information page-set buffer; a partial user information page-set buffer; a full page-set determination unit; and a session end determination unit.

Abstract: The present invention provides a flash memory controller for mapping the logical addresses to the physical addresses of memory including a plurality of blocks, each having a plurality of pages, wherein the memory controller includes a processor. The processor includes hot page decision unit and an address translation unit. The hot page decision unit classifies pages in each block into hot pages and cold pages based on a predetermined criterion. When there is a plurality of the classified hot pages, the address translation unit respectively arranges the classified hot pages in different target blocks. In accordance with this configuration, upon performing a merge operation, hot pages and cold pages are determined, and the hot pages are respectively distributed to empty blocks, so that concentration of an erase operation on a specific physical block may be avoided, thus wear-leveling may be performed more efficiently.

Abstract: A method for minimizing the degradation of performance upon accessing a flash memory using a logical-physical mapping scheme, and a method for efficiently storing and managing information on logical-physical mapping in a flash memory. A method for writing data in a flash memory includes determining whether a sector is empty in a physical page having a most recently written logical page number of data to be written, the offset of the sector matching that of the data to be written; if the sector is empty, writing the data in the sector to the physical page; and if the sector is not empty, selecting an empty physical page to write the data to a sector in the selected empty physical page of which the offset matches that of the data to be written and writing a logical page number for the data to the selected empty physical page.

Abstract: A flash memory access apparatus and method improves the overall performance of a flash memory system by minimizing the deterioration of performance of a flash memory due to repeated write operations through a minimized process of a write operation and the process of a recovery operation in consideration thereof and by allowing a stable recovery even though an error occurs. The flash memory access apparatus comprises a flash memory with regions divided on the basis of a unit that consists of predetermined blocks; and a flash memory controller.