Abstract: This disclosure provides a portable object detection system and method. The system includes a first cluster network, a family cluster network, and a detection server. The first cluster network includes a portable object coupled with a small communication device (SCD), a first cluster head device (first CHD) including a smartphone that registers the SCD prior to monitoring, and performs mutual monitoring between the SCD and the first CHD. The detection server manages the first CHD and a second CHD, and when the detection server receives a loss event from the first CHD in the first cluster network, it requests a mutual search by the second CHD for the SCD as a lost target in the first cluster network. The mutual monitoring in a first cluster network adjusts a message transmission interval and a radio transmission power depending on collected parameters such as the SCD's location information, mobility, power capacity, and others.

Abstract: This disclosure provides a portable object detection system and method. The system includes a first cluster network, a family cluster network, and a detection server. The first cluster network includes a portable object coupled with a small communication device (SCD), a first cluster head device (first CHD) including a smartphone that registers the SCD prior to monitoring, and performs mutual monitoring between the SCD and the first CHD. The detection server manages the first CHD and a second CHD, and when the detection server receives a loss event from the first CHD in the first cluster network, it requests a mutual search by the second CHD for the SCD as a lost target in the first cluster network. The mutual monitoring in a first cluster network adjusts a message transmission interval and a radio transmission power depending on collected parameters such as the SCD's location information, mobility, power capacity, and others.

Abstract: This disclosure provides a real time makeup supporting method which generates a makeup guide content in real time corresponding to a user's facial image. In accordance with an embodiment of the present invention, a makeup supporting application is installed at a device. And the makeup supporting application enables to access a personal image classification table that maps between personal image classifications and personal image rules. A user executes the makeup supporting application, and user's personal image data are collected in real time by a built-in camera module equipped at a device.

Abstract: This disclosure provides a portable object detection system and method. The system includes a first cluster network, a family cluster network, and a detection server. The first cluster network includes a portable object coupled with a small communication device (SCD), a first cluster head device (first CHD) including a smartphone that registers the SCD prior to monitoring, and performs mutual monitoring between the SCD and the first CHD. The detection server manages the first CHD and a second CHD, and when the detection server receives a loss event from the first CHD in the first cluster network, it requests a mutual search by the second CHD for the SCD as a lost target in the first cluster network. The mutual monitoring in a first cluster network adjusts a message transmission interval and a radio transmission power depending on collected parameters such as the SCD's location information, mobility, power capacity, and others.

Abstract: This disclosure provides a real time makeup supporting method which generates a makeup guide content in real time corresponding to a user's facial image. In accordance with an embodiment of the present invention, a makeup supporting application is installed at a device. And the makeup supporting application enables to access a personal image classification table that maps between personal image classifications and personal image rules. A user executes the makeup supporting application, and user's personal image data are collected in real time by a built-in camera module equipped at a device.

Abstract: This invention is about a system and the methods for collecting donations by using context-awareness based on a social networking service.

Abstract: A prefix aggregation technique for coordination protocol in a router includes the forming of a prefix tree from a plurality of nodes in a first unit managing a routing table, each node including a prefix, depth, a color field, and at least three pointers including a first pointer to a parent node, a second pointer to a left child node, and a third pointer to a right child node, routing from a first node to a second node according to the prefix, and aggregating a certain node from the plurality of nodes according to the color field. The present invention also includes the inserting of a new prefix into a certain node according to the prefix, depth and color field. The node can also be deleted according to the prefix.

Abstract: A parallel router comprising: 1) a plurality of routing nodes, each of the plurality of routing nodes capable of receiving message packets from and transmitting message packets to external devices, wherein the each of the plurality of routing nodes maintains a routing table suitable for routing message packets from transmitting ones of the plurality of routing nodes to receiving ones of the plurality of routing nodes; and 2) a switch fabric capable of transmitting the messages packets between the transmitting nodes and the receiving nodes, wherein a designated one of the plurality of routing nodes is operable to transmit to at least one non-designated one of the plurality of routing nodes a hello request message operable to cause the non-designated routing node to transmit back a hello acknowledgment message, wherein the designated routing node monitors a time duration between transmission of the hello request message and receipt of the hello acknowledgment message to determine if the non-designated routing n

Abstract: A parallel router comprising: 1) a plurality of routing nodes, each of the plurality of routing nodes capable of receiving message packets from and transmitting message packets to external devices, wherein each of the routing nodes maintains a routing table suitable for routing message packets from transmitting ones of the plurality of routing nodes to receiving ones of the plurality of routing nodes; and 2) a switch fabric capable of transmitting the messages packets between the transmitting nodes and the receiving nodes, wherein a designated one of the plurality of routing nodes is operable to receive from non-designated ones of the plurality of routing nodes link state advertisement (LSA) message packets containing link state information, wherein the designated routing node aggregates the LSA message packets to thereby form a link-state database.

Abstract: A method for constructing routing/forwarding tables for an IP address lookup using a skip list. The method comprises dividing a prefix length range of an IP address in a preset method; creating a header node having a maximum level based on a number of clusters divided into the prefix length range, the header node pointing every node in the skip list; and creating subnodes by the number of the divided clusters, the subnodes each having the divided prefix length range as a key.

Abstract: A prefix aggregation technique for coordination protocol in a router includes the forming of a prefix tree from a plurality of nodes in a first unit managing a routing table, each node including a prefix, depth, a color field, and at least three pointers including a first pointer to a parent node, a second pointer to a left child node, and a third pointer to a right child node, routing from a first node to a second node according to the prefix, and aggregating a certain node from the plurality of nodes according to the color field. The present invention also includes the inserting of a new prefix into a certain node according to the prefix, depth and color field. The node can also be deleted according to the prefix.

Abstract: A parallel router comprising: 1) a plurality of routing nodes, each of the plurality of routing nodes capable of receiving message packets from and transmitting message packets to external devices, wherein each of the routing nodes maintains a routing table suitable for routing message packets from transmitting ones of the plurality of routing nodes to receiving ones of the plurality of routing nodes; and 2) a switch fabric capable of transmitting the messages packets between the transmitting nodes and the receiving nodes, wherein a designated one of the plurality of routing nodes is operable to receive from non-designated ones of the plurality of routing nodes link state advertisement (LSA) message packets containing link state information, wherein the designated routing node aggregates the LSA message packets to thereby form a link-state database.

Abstract: A parallel router comprising: 1) a plurality of routing nodes, each of the plurality of routing nodes capable of receiving message packets from and transmitting message packets to external devices, wherein the each of the plurality of routing nodes maintains a routing table suitable for routing message packets from transmitting ones of the plurality of routing nodes to receiving ones of the plurality of routing nodes; and 2) a switch fabric capable of transmitting the messages packets between the transmitting nodes and the receiving nodes, wherein a designated one of the plurality of routing nodes is operable to transmit to at least one non-designated one of the plurality of routing nodes a hello request message operable to cause the non-designated routing node to transmit back a hello acknowledgment message, wherein the designated routing node monitors a time duration between transmission of the hello request message and receipt of the hello acknowledgment message to determine if the non-designated routing n

Abstract: A method for constructing routing/forwarding tables for an IP address lookup using a skip list. The method comprises dividing a prefix length range of an IP address in a preset method; creating a header node having a maximum level based on a number of clusters divided into the prefix length range, the header node pointing every node in the skip list; and creating subnodes by the number of the divided clusters, the subnodes each having the divided prefix length range as a key.