Abstract: The present invention relates to a wearable device for healthcare and method for using the device. More specifically, the wearable device is worn on a finger for measuring the health data of the user, selected from one or more of heart rate, blood oxygen saturation, heart rate variability. Based on the measured data, the sleep quality can be monitored and recorded. Disorders such as obstructive sleep apnea (OSA), can be detected. The wearable device may include an optical sensor coupled with or embedded in a main body including a visible light emitter, an IR light emitter and a light detector being arranged along a longitudinal direction of the finger. During operation of the wearable device, the heart rate is monitored based on a detected light signal. When the heart rate is higher than an adaptive threshold, both heart rate and blood oxygen saturation are monitored.

Abstract: A control assembly for controlling a speed or torque of operation of an electric device includes a control assembly housing, a magnetic sensor, a magnetic element; and an actuator. The actuator moves relative to the control assembly and, responsive to that movement, the magnetic sensor and magnetic element are moved relative to each other between a first position and a second position so that the magnetic sensor senses a first magnetic field reading when in the first position and senses a second magnetic field reading when in the second position. A control module is operably connected to the magnetic sensor and configured for controlling the electric device, and a magnetic shielding element is positioned within the control assembly housing to alleviate a magnetic signal source external to the control assembly from interfering with the sensing by the magnetic sensor.

Abstract: Aberrant cross talk between Notch ligand (e.g. Jag1) and Notch receptor (e.g. Notch1) has been implicated in tumorigenesis in the colon. Inhibition of Notch pathway is therefore an attractive approach for treating diseases with upregulated Jag1 e.g. colorectal cancer (CRC). Pan-notch inhibitors like gamma secretase inhibitors (GSIs) have been developed to inhibit Notch and its downstream events. However, severe gastrointestinal toxicity profiles impede the clinical development of GSIs. The present invention develops novel oligopeptides that specifically inhibit Jag1-Notch1 pathway without interfering DLL1-Notch1 or DLL4-Notch1, which demonstrates a clear advantage over pan-notch inhibitors.

Abstract: Aberrant cross talk between Notch ligand (e.g. Jag1) and Notch receptor (e.g. Notch1) has been implicated in tumorigenesis in the colon. Inhibition of Notch pathway is therefore an attractive approach for treating diseases with upregulated Jag1 e.g. colorectal cancer (CRC). Pan-notch inhibitors like gamma secretase inhibitors (GSIs) have been developed to inhibit Notch and its downstream events. However, severe gastrointestinal toxicity profiles impede the clinical development of GSIs. The present invention develops novel oligopeptides that specifically inhibit Jag1-Notch1 pathway without interfering DLL1-Notch1 or DLL4-Notch1, which demonstrates a clear advantage over pan-notch inhibitors.

Abstract: An open communication method between at least two sub-networks using a broker node. Each of the sub-networks has a different routable network addressing scheme. The method comprises receiving a packet for a specific application, the packet includes an application identifier, determining if the packet is to be relayed to another of the at least two sub-network based upon the application identifier, determining if a node receiving the packet is a broker node, relaying the packet to a broker node if not a broker node and forwarding, by the broker node, the packet to at least one node in another of the at least two sub-network. The node generating the packet is configured to communicate using a first of the at least two sub-networks. A broker node is configured for communicating using at least two of the at least two sub-network via a corresponding routable network addressing schemes for each of the sub-networks.

Abstract: A method for preparing a two-dimensional material includes adding a three-dimensional layered material into a solvent to form a three-dimensional layered material dispersion. Then, the three-dimensional layered material dispersion is irradiated by light to exfoliate the three-dimensional layered material to produce the two-dimensional material suspending in the solvent. The light has a wavelength of 100-1500 nm, and the irradiation time is 0.5-5 hours.

Abstract: A multiple hop communications method among a plurality of moving vehicles. Each moving vehicles has a plurality of unidirectional radio. The method comprises receiving an incoming packet at one of the plurality of unidirectional radios, determining if there is an active link between each of the plurality of unidirectional radios and an unidirectional radio of a neighbor vehicle, relaying the incoming packet to the plurality of unidirectional radios having an active link and transmitting the incoming packet as an outgoing packet from at least one of the plurality of unidirectional radios. If more than one packet is received, the packets can be encoded using group coding before send the packets out as an outgoing packet.

Abstract: Network architecture configured for open communication between a plurality of sub-networks. Each of the plurality of sub-networks has a different routable network addressing scheme. The architecture includes at least one broker node adapted to communicate using at least two different routable network addressing schemes. The broker node comprises an identification management module configured to collect peer-application addresses for nodes currently accessing a specific application, the peer-application addresses being associated with a specific application, an address resolution module configured to map each of the peer-application addresses to a sub-network specific routable network address and a network coordination module configured to monitor and coordinate sub-network communication capabilities between the broker node and at least one other broker node and elect a primary broker node for each sub-network which the broker node and at least one other broker node is capable of communication.

Abstract: An on-demand method of routing data between a plurality of local peer groups (LPG) of plural moving nodes comprises transmitting a route request message from a source node, relaying the route request message to a native boundary node; forwarding the route request message to a foreign boundary node, determining if the destination node is within an LPG for the foreign boundary node; relaying the route request message to another boundary node if the destination node is not within the LPG, relaying the route request message to the destination node if the destination node is within the LPG, receiving the routing request message at the destination node, transmitting a routing response to the source node, relaying the routing response to the source node through a path discovered by the route request, receiving the routing response at the source node, and transmitting the data, upon receipt of the routing response.

Abstract: An aspect of the present invention is a method for routing content information to a mobile user or client application. The method preferably comprises re-directing a user request to one or more gateway servers provided via an overlay network. In another aspect, the present invention is an apparatus that includes a proxy service that intercepts content information requests to the Internet and re-directs the content requests to an overlay. Another aspect of the present invention comprises a location-based Uniform Resource Locator that includes a protocol semantic portion and a location-based resolver address portion that identifies one or more resources on a network based on the geographical location of the resources.

Abstract: An open communication method between at least two sub-networks using a broker node. Each of the sub-networks has a different routable network addressing scheme. The method comprises receiving a packet for a specific application, the packet includes an application identifier, determining if the packet is to be relayed to another of the at least two sub-network based upon the application identifier, determining if a node receiving the packet is a broker node, relaying the packet to a broker node if not a broker node and forwarding, by the broker node, the packet to at least one node in another of the at least two sub-network. The node generating the packet is configured to communicate using a first of the at least two sub-networks. A broker node is configured for communicating using at least two of the at least two sub-network via a corresponding routable network addressing schemes for each of the sub-networks.

Abstract: A method, simulator and program for simulating vehicular movement based upon user input parameters related to simulation topology and simulation vehicles including, but not limited to linear vehicular density. The simulator generates the simulation topology having a simulation area using the user input parameters, places a plurality of simulation vehicles within the simulation area at an initial placement using at least two input parameters related to simulation vehicle and the generated simulation topology; and determines movement of the plurality of simulation vehicles starting with the initial placement using a plurality of movement models. Each of the plurality of simulation vehicles has mobility characteristics generated using the plurality of movement models. When vehicle moves outside the simulation area, the vehicle re-emerges at a location within the simulation area. The vehicle re-emerges with new movement characteristics.

Abstract: A method for routing a multicast message comprising the steps of receiving a multicast message including at least a message, a source identifier, a sequence number, a time-to-live value and a multicast group destination, determining if the multicast group destination is in a multicast forwarding table, determining if the message has been previously received, adding the multicast message to the multicast forwarding table if it is determined that the multicast message has not been previously received, determining if a node that received the multicast message is a forwarding node; randomly setting a wait time for forwarding the multicast message; and forwarding the multicast message at the expiration of the wait time.

Abstract: An open communication method between at least two sub-networks using a broker node. Each of the sub-networks has a different routable network addressing scheme. The method comprises receiving a packet for a specific application, the packet includes an application identifier, determining if the packet is to be relayed to another of the at least two sub-networks based upon the application identifier, determining if a node receiving the packet is a broker node, relaying the packet to a broker node if not a broker node and forwarding, by the broker node, the packet to at least one node in another of the at least two sub-networks. The node generating the packet communicates using a first of the at least two sub-networks. A broker node communicates using at least two of the at least two sub-networks via a corresponding routable network addressing schemes for each of the sub-networks.

Abstract: An inventive method for data delivery in a multi-hop vehicular network with multiple vehicles and intersections is presented. The method comprises, at each source vehicle, initiating packet flow, labeling packets with destination coordinates and a current location, and forwarding the packet flow, and at each intersection, selecting a header vehicle, computing a backlog indicator and listening for broadcasts with a matrix and delay information, updating the matrix in accordance with the backlog indicator if the matrix is present, otherwise initializing the matrix, forwarding the packet flow, and broadcasting the matrix from the header vehicle. In one embodiment, selection of the header vehicle is performed based on random countdown and vehicle ID. The method converges to the optimal (lowest latency) state irrespective of the initial starting point of the network and continues to tend towards the optimal state even as the network conditions alter.

Abstract: A method for maintaining a local peer group (LPG) for supporting communications among vehicles. The LPG is formed from a plurality of vehicles. Each vehicle is equipped with a wireless communications device. One of the vehicles is selected as a group header node (GH). The method comprises receiving periodically a heartbeat packet from the GH, the heartbeat packet including a maximum hop count, and a heartbeat cycle, forwarding the heartbeat packet until the maximum hop count is reached after waiting for a first random relay delay, which is less than a maximum allowable adjustable value, replying to the heartbeat packet with a membership report packet, forwarding a membership report packet towards the GH, and adding a vehicle that submitted the membership report packet to a LPG membership as a member node of the LPG if the membership report packet is new or updating information for a member node.

Abstract: Network architecture configured for open communication between a plurality of sub-networks. Each of the plurality of sub-networks has a different routable network addressing scheme. The architecture includes at least one broker node adapted to communicate using at least two different routable network addressing schemes. The broker node comprises an identification management module configured to collect peer-application addresses for nodes currently accessing a specific application, the peer-application addresses being associated with a specific application, an address resolution module configured to map each of the peer-application addresses to a sub-network specific routable network address and a network coordination module configured to monitor and coordinate sub-network communication capabilities between the broker node and at least one other broker node and elect a primary broker node for each sub-network which the broker node and at least one other broker node is capable of communication.

Abstract: The present invention relates to the reduction of handoff delays for mobile telematics applications. In particular, the present invention provides a method employing GPS technology to define IP addresses in a mobile environment in order to reduce delays and transient data loss caused by handoff from one network to another.

Abstract: Network architecture configured for open communication between a plurality of sub-networks. Each of the plurality of sub-networks has a different routable network addressing scheme. The architecture includes at least one broker node adapted to communicate using at least two different routable network addressing schemes. The broker node comprises an identification management module configured to collect peer-application addresses for nodes currently accessing a specific application, the peer-application addresses being associated with a specific application, an address resolution module configured to map each of the peer-application addresses to a sub-network specific routable network address and a network coordination module configured to monitor and coordinate sub-network communication capabilities between the broker node and at least one other broker node and elect a primary broker node for each sub-network which the broker node and at least one other broker node is capable of communication.

Abstract: A method for determining a transmission channel for multi-hop transmission of a data packet from a plurality of data channels in an ad-hoc network. The network includes at least one local peer group. Each local peer group has a plurality of moving vehicles as nodes. The method comprises steps of determining available channels for data packet transmission at each node, transmitting a first list of available channels to at least one other node, receiving, from the at least one other node, a second list of available channel for the at least one other node, creating an available channel table including the first and second lists of available channels, selecting a transmitting channel for a data packet based upon information in the available channel table, and advertising the selected channel to the at least one other node.