Abstract: According to an exemplary embodiment, a substrate having a first area and a second area is provided. The substrate includes a plurality of pads. Each of the pads has a pad size. The pad size in the first area is larger than the pad size in the second area.

Abstract: A field effect transistor includes a substrate having a transistor forming region thereon; an insulating layer on the substrate; a first graphene layer on the insulating layer within the transistor forming region; an etch stop layer on the first graphene layer within the transistor forming region; a first inter-layer dielectric layer on the etch stop layer; a gate trench recessed into the first inter-layer dielectric layer and the etch stop layer within the transistor forming region; a second graphene layer on interior surface of the gate trench; a gate dielectric layer on the second graphene layer and on the first inter-layer dielectric layer; and a gate electrode on the gate dielectric layer within the gate trench.

Abstract: A phototherapy device includes a base, at least one light conversion device and a light source module. The base has an installation slot. The light conversion device is detachably arranged in the installation slot. Each light conversion device includes a plurality of light conversion patterns. The light source module is arranged on a side of the base and configured to provide an excitation beam to the light conversion patterns, so that each of the light conversion patterns emits a converted beam. In this way, the light conversion device of the phototherapy device can be replaced according to the user's needs.

Abstract: A pumping device has a container, an inlet pipe, a float barrel, and a discharging pipe. The container has a box containing water and a first gas, and a pressure gauge and a check valve mounted to the box. The inlet pipe connects to a water supply and has a second section erectly disposed within the box and communicating with an inside of the box. The float barrel is disposed within the box, contains a second gas, and has an opening. The second section is mounted through the opening. The discharging pipe has two opposite ends respectively communicating with a water reservoir and the inside of the box. The first gas has a pressure larger than 1 atm. The second gas has a pressure less than 1 atm. Water enters the float barrel. A water level inside the float barrel is higher than a water level inside the box.

Abstract: A pumping device has a container, an inlet pipe, a float barrel, and a discharging pipe. The container has a box containing water and a first gas, and a pressure gauge and a check valve mounted to the box. The inlet pipe connects to a water supply and has a second section erectly disposed within the box and communicating with an inside of the box. The float barrel is disposed within the box, contains a second gas, and has an opening. The second section is mounted through the opening. The discharging pipe has two opposite ends respectively communicating with a water reservoir and the inside of the box. The first gas has a pressure larger than 1 atm. The second gas has a pressure less than 1 atm. Water enters the float barrel. A water level inside the float barrel is higher than a water level inside the box.

Abstract: A buoyant rotation device has a casing, a rotating cylinder, and multiple floating elements. The casing has a body with an opening and two connecting boards. The rotating cylinder is rotatably mounted in the casing and has an inner tank, an outer tank, multiple dividing panels, and two side panels. A part of the rotating cylinder extends out of the body. The inner tank has a holding shaft. The outer tank is mounted around the inner tank to form an annular space, and has multiple main inlet holes formed through the outer tank and communicating with the annular space. The dividing panels are deposited in the annular space at spaced intervals between the inner tank and the outer tank to form multiple separate spaces not communicating with each other. Each one of the multiple floating elements is deposited in one of the multiple separate spaces of the rotating cylinder.

Abstract: Peer-to-peer mobility management in heterogeneous IP networks provides a peer-to-peer mobility module operable to intercept a data packet received at a communication protocol layer of an Internet Protocol communication stack. A translation table may be stored on memory device. The translation table stores real address of one or more network interfaces and a corresponding virtual address. The peer-to-peer mobility module may be further operable to modify the intercepted data packet using the real address and virtual address stored on the translation table.

Abstract: Disclosed is an improved proactive location based routing protocol for ad-hoc wireless networks. When a source node has a data packet to send to a destination node, the source node calculates an estimated future location of the destination node prior to forwarding a data packet to the destination node. The estimated future location may be based on the last known location, velocity and bearing of the destination node, as well as upon the estimated propagation delay (i.e., the estimated time it will take the data packet to reach the destination node after being transmitted by the source node). The source node routes the data packet by identifying which one of a plurality of its neighbor nodes is closest to the estimated future location of the destination node, and routes the data packet the identified neighbor node as an intermediate node along the route from the source node to the destination node. Further, the frequency of flooding broadcasts is based on the velocity of the network nodes.

Abstract: In a Vehicular Ad Hoc Network (VANET) a hybrid method combines SDMA (Space Division Multiple Access) and dynamic TDMA (Time Division Multiple Access) that divides the roadway into regions (whose size is larger than the SDMA unit) where each region is allocated a pool of radio channels based on SDMA and may contain a limited number of vehicles. Vehicles within the same region compete for and access the channels using dynamic TDMA. A channel allocation scheme that maps the pool of channels to the regions such that when a vehicle acquires multiple channels (time slots) in a region, the intervals among the channels are as uniform as possible, thus minimizing the waiting time of the messages to be broadcast by the vehicle, which is critical for safety related applications. This solution is referred to as R-SDMA (Region based SDMA).

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: In a Vehicular Ad Hoc Network (VANET) a hybrid method combines SDMA (Space Division Multiple Access) and dynamic TDMA (Time Division Multiple Access) that divides the roadway into regions (whose size is larger than the SDMA unit) where each region is allocated a pool of radio channels based on SDMA and may contain a limited number of vehicles. Vehicles within the same region compete for and access the channels using dynamic TDMA. A channel allocation scheme that maps the pool of channels to the regions such that when a vehicle acquires multiple channels (time slots) in a region, the intervals among the channels are as uniform as possible, thus minimizing the waiting time of the messages to be broadcast by the vehicle, which is critical for safety related applications. This solution is referred to as R-SDMA (Region based SDMA).

Abstract: A channel buffering method is for dynamically altering a number of channels for an Internet protocol television (IPTV). The method is applicable for a home gateway (HG) having a channel section used for channel buffering. After the HG has received two consecutive channel-switching requests, the HG compares whether the two requests are similarly directed to switching a channel towards the same direction or not; if yes, a cumulative switching frequency is set, and two trimming numerical values are set through the cumulative switching frequency, and thus, the channel section for buffering the channels can be dynamically adjusted through the two trimming numerical values.

Abstract: Peer-to-peer mobility management in heterogeneous IP networks provides a peer-to-peer mobility module operable to intercept a data packet received at a communication protocol layer of an Internet Protocol communication stack. A translation table may be stored on memory device. The translation table stores real address of one or more network interfaces and a corresponding virtual address. The peer-to-peer mobility module may be further operable to modify the intercepted data packet using the real address and virtual address stored on the translation table.

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: A plurality of servers for processing client requests forward the requests among themselves to achieve a balanced load. When a server initially receives a client request, it randomly selects another of the plurality of servers, referred to as a first-chance server, and forwards the request to this server. Upon receiving the request, the first-chance server determines if it is overloaded and if not, processes the request. However, if overloaded, the first-chance server compares its load to the load of one or more predetermined next-neighbor servers. If the next-neighbor server(s) are more loaded than the first-chance server, the first-chance server processes the request. Otherwise, the first-chance server forwards the request to the least loaded next-neighbor server. The next-neighbor receiving the request either processes it directly, or alternatively, based on its current load and that of its next-neighbor server(s), forwards the request to another next-neighbor server for processing.

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.

Abstract: A channel buffering method is for dynamically altering a number of channels for an Internet protocol television (IPTV). The method is applicable for a home gateway (HG) having a channel section used for channel buffering. After the HG has received two consecutive channel-switching requests, the HG compares whether the two requests are similarly directed to switching a channel towards the same direction or not; if yes, a cumulative switching frequency is set, and two trimming numerical values are set through the cumulative switching frequency, and thus, the channel section for buffering the channels can be dynamically adjusted through the two trimming numerical values.

Abstract: Disclosed is an improved proactive location based routing protocol for ad-hoc wireless networks. When a source node has a data packet to send to a destination node, the source node calculates an estimated future location of the destination node prior to forwarding a data packet to the destination node. The estimated future location may be based on the last known location, velocity and bearing of the destination node, as well as upon the estimated propagation delay (i.e., the estimated time it will take the data packet to reach the destination node after being transmitted by the source node). The source node routes the data packet by identifying which one of a plurality of its neighbor nodes is closest to the estimated future location of the destination node, and routes the data packet the identified neighbor node as an intermediate node along the route from the source node to the destination node. Further, the frequency of flooding broadcasts is based on the velocity of the network nodes.

Abstract: A plurality of servers for processing client requests forward the requests among themselves to achieve a balanced load. When a server initially receives a client request, it randomly selects another of the plurality of servers, referred to as a first-chance server, and forwards the request to this server. Upon receiving the request, the first-chance server determines if it is overloaded and if not, processes the request. However, if overloaded, the first-chance server compares its load to the load of one or more predetermined next-neighbor servers. If the next-neighbor server(s) are more loaded than the first-chance server, the first-chance server processes the request. Otherwise, the first-chance server forwards the request to the least loaded next-neighbor server. The next-neighbor receiving the request either processes it directly, or alternatively, based on its current load and that of its next-neighbor server(s), forwards the request to another next-neighbor server for processing.