Abstract: A data poisoning method and a data poisoning apparatus are provided. In the method, a training dataset and a validation dataset are retrieved. A perturbation is randomly initiated and added to data in the training dataset to generate poisoned training data. Values of multiple kernel functions of the poisoned training data and the validation dataset are computed by using kernel functions in a Gaussian process, and used to compute a mean of the Gaussian process on the validation dataset. A loss between the mean and the data in the validation dataset is computed by using a loss function of the Gaussian process, and used to generate an objective function that maximizes the loss. The objective function is solved to compute the perturbation that can maximize the loss.

Abstract: A verification method and a verification apparatus based on an attacking image style transfer are provided. The method includes the following steps. A style transfer is performed on a verification image for verifying an identity, so as to generate multiple stylized images having at least one style, in which the style transfer includes modifying a local pattern of the verification image while retaining a global pattern of the verification image. At least one of the verification image and the stylized images is processed to add an interference signal having at least one specific pattern for interfering with image recognition. And, the processed stylized images are prompted and a selection operation on the stylized images is received to verify an identity of an object executing the selection operation.

Abstract: Methods for database management in a distributed system are provided, wherein the distributed system at least includes a plurality of servers. The method includes the steps of: collecting transactions to be executed, wherein each transaction corresponds to a plurality of requests and each request is associated with at least one data; generating a transaction dependency graph corresponding to the requests according to data dependency among the data associated with the requests of all the transactions; partitioning the transaction dependency graph to generate a plurality of partitions corresponding to the servers; generating execution plans corresponding to the partitions; distributing the transactions to the servers for execution based on the generated execution plans.

Abstract: Methods for database management in a distributed system are provided, wherein the distributed system at least includes a plurality of servers. The method includes the steps of: collecting transactions to be executed, wherein each transaction corresponds to a plurality of requests and each request is associated with at least one data; generating a transaction dependency graph corresponding to the requests according to data dependency among the data associated with the requests of all the transactions; partitioning the transaction dependency graph to generate a plurality of partitions corresponding to the servers; generating execution plans corresponding to the partitions; distributing the transactions to the servers for execution based on the generated execution plans.

Abstract: A method and an apparatus for task challenge using social cooperation are provided. The method is adapted for a service apparatus to provide multiple client apparatuses to create and join in a task. In the method, a task created by one client apparatus is received, and the rest of the client apparatuses are invited to join in the task. Next, a guarantee provided by each of the client apparatuses joining in the task is received. Then, a specific operation executed on each of the client apparatuses is detected, and accordingly it is determined whether each of the client apparatuses completes the task. Finally, a manipulation of the guarantees is determined based on whether each of the client apparatuses completes the task.

Abstract: A social communication system and a method thereof are provided. The system includes a server apparatus and a user device. The user device transmits an authorization request to the server apparatus, and the server apparatus inquires an authorized individual whether to agree a user to access a friendship list of the authorized individual. When the authorized individual agrees the user to access the friendship list of the authorized individual, the friendship list of the authorized individual is added to a FOF database. The user device transmits an anonymous social communication service request to the server apparatus to obtain an anonymous social communication service for the user and the authorized individual. Besides, when the service is stopped, the server apparatus inquires both of the authorized individual and the user whether they agree to provide their profiles to each other as the basis for the friendship.

Abstract: Message matching methods for use in a message matching system are provided. The message matching system includes a first electronic device, a server and at least one second electronic device. The method includes the steps of: receiving, by the server, a first message from the first electronic device; finding, by the server, at least one second message corresponding to the first message from a database based on the content of the first message; determining, by the server, whether the at least one second message matches the first message; and if so, transmitting, by the server, the at least one second message to the first electronic device and the first message to a second electronic device corresponding to the at least one second message respectively, wherein the second message has content corresponding to that of the first message and is sent by an unknown source.

Abstract: A method and an apparatus for one-time connection are provided. In the method, a first apparatus generates a connection item according to first connection information, in which the first connection information is previously registered in a server. Next, a second apparatus obtains the connection item and accordingly generates a virtual card. The second apparatus further uploads the virtual card and second connection information to the server to register the virtual card in the server. Then, the second apparatus receives a selecting operation for the virtual card and accordingly uploads a connection request of using the virtual card to the server. The server establishes a one-time connection between the second apparatus and the first apparatus according to the virtual card, the first connection information and the second connection information.

Abstract: A deterministic database system and a data transferring method thereof are provided. The method includes monitoring a workload of a resource server or a candidate server. When the workload meets a transferring requirement, the resource server starts to copy data to the candidate server. During copying the data, the resource server and the candidate server execute transactions together according to an execution order of the transactions, and then reply an execution result.

Abstract: A method for real-time conversations and comment with each other in a mobile device comprises the following steps. In the step (a), it activates a communication module of real-time conversations and comment with each other of a first mobile device. In the step (b), it performs a matching process for a user of the first mobile by a server. In the step (c), it provides a topic of chat for the user of the first mobile device for conversations by using the communication module of real-time conversations and comment with each other or by using the server. In the step (d), the user of the first mobile device transmits a first message to the successfully matched user of a second mobile device and makes comments for a second message from the user of the second mobile device.

Abstract: A method, a server and an apparatus for lecture feedback are provided. In the method, an adding request is received to establish a lecture. A login for the lecture from each of at least one audience apparatus is received to provide a presentation data to each of the at least one audience apparatus. The presentation data includes several pages. A usage behavior of each audience apparatus executing on each of the pages of the presentation data is monitored, and the usage behaviors of all of the at least one audience apparatus are analyzed to provide a feedback of the lecture.

Abstract: A method, an apparatus, and a computer program product for presenting a cooking schedule are provided. In the method, recipes are received, wherein each of the recipes includes cooking processes and cooking time required for finishing each of the cooking processes. The cooking processes are scheduled according to the cooking time of each of the cooking processes to make a total cooking time required for finishing all of the cooking processes in the recipes to be the shortest. Finally, the scheduled cooking processes are sequentially prompted.

Abstract: A method and an electronic device for rating outfit are provided. In the method, a plurality of candidate items are received, and each two of the candidate items are paired to create a plurality of questions, where each of the questions includes two candidate items among the candidate items. The questions are respectively transmitted to a plurality of raters in a group, and a selection of each of the raters on the two candidate items in the received question is received. A number of times that each of the candidate items is selected is aggregated, and accordingly the candidate items are sorted to form a recommending series. In addition, a rating for at least one of the candidate items is received, and the raters who selected the candidate item matching the rating are searched to serve as the raters for a subsequent outfit rating.

Abstract: Shopping methods and systems for providing real-time transaction are provided. First, product information of one or more stores neighboring to a plurality of first electronic devices are obtained and transmitted to a server by the first electronic devices. Thereafter, a product list in a database of the server is updated according to the obtained product information and the updated product list is further provided to a second electronic device by the server to enable the second electronic device to select a product therefrom and request a user of the first electronic device for providing a surrogate shopping service of buying the selected product.

Abstract: An electronic apparatus and a soft locking method thereof are provided. The method is adapted for at least one electronic apparatus. In the method, the at least one electronic apparatus is added to a group and an event is created for the at least one electronic apparatus to participate in. Next, a specific operation performed on each electronic apparatus is detected and a time that all of the at least one electronic apparatus does not detect the specific operation is accumulated. When any one of the at least one electronic apparatus detects the specific operation, the event is suspended and a suspension message is distributed. When the accumulated time reaches a predetermined value, a reward is sent to the at least one electronic apparatus participating in the event.

Abstract: An asymmetric and asynchronous energy conservation protocol for vehicular networks is provided. In one aspect, an a-quorum may be defined for one or more members for the one or more members to establish asymmetric links to contact the cluster head. An s-quorum for the cluster head to establish symmetric link between the cluster heads and relays may be defined.

Abstract: An asymmetric and asynchronous energy conservation protocol for vehicular networks is provided. In one aspect, an a-quorum may be defined for one or more members for the one or more members to establish asymmetric links to contact the cluster head. An s-quorum for the cluster head to establish symmetric link between the cluster heads and relays may be defined.

Abstract: System, method and program storage device for unified messaging services. The method includes receiving a message generated by a sender, collecting user attribute information of the sender and/or a recipient, providing at least one policy factor associated with the user attribute information, converting the first message into a unified format message, processing the user attribute information of the sender and/or the recipient and the policy factor to determine a terminal device for the recipient, converting the unified format message into a second message according to the determined terminal device for the recipient and delivering the message converted according to the determined terminal device for the recipient to the recipient.

Abstract: A peer-to-peer based secondary key search method and system for cluster databases is disclosed. A cluster database has a plurality of storage nodes and each storage node is assigned with a node number and stores a plurality of records. A search term input means couples to the plurality of storage nodes for retrieving a record at a storage node. The search term input means calculates a first node number based on a hash function of a secondary key, queries the first storage node with the secondary key for retrieving a corresponding primary key, calculates a second node number based on a hash function of the primary key, and then queries the second storage node with the primary key for retrieving a corresponding record.