Abstract: There has been a problem that it is impossible to ensure the ability to acquire RFID tag state information and at the same time reduce the power consumption necessary therefore. Provided is a tag reader including a read means, which detects the loss of communication with a tag during communication with the tag, and a control means, which counts the number of times communication with the tag is lost on the basis of the losses detected by the read means and disables execution of a communication process with the tag when the number of losses has reached a predetermined threshold value.

Abstract: To realize state estimation that corresponds with an actual situation by dynamically changing an abstract state calculation method. Upon receiving an abstract state monitoring request, an abstract state generation section 10 extracts a constituent element of an abstract state from the request, selects a rule for calculating an abstract state from the presence of the element, and generates a presence servicing client 20 that has a watcher for observing the element via a presence servicing section 40 and a presentity for issuing the presence of the abstract state to the presence service. Further, the rule for calculating an abstract state is changed in accordance with presence.

Abstract: A link state routing communication device allowing path precalculation satisfying the required quality of a connection and reducing the call blocking probability is disclosed. A path satisfying a connection request can be selected from a plurality of precalculated paths which are stored for each destination in a memory. The precalculated paths reflect the latest link resource information using the feasibility check operation or precalculated path update operation. Therefore, a blocking probability of connection setup using precalculated paths can be decreased. In a border node, summarized information is calculated based on precalculated paths and therefore high-speed summarized information calculation is allowed, resulting in reduced computation load.

Abstract: A system comprising a wireless tag and a tag reader. The tag comprises: a sensor for generating a detected information; a storage for storing the detected information; a determination unit for storing a criteria information and outputting a result of determination on the detected information on the basis of the criteria information; and a communication control unit for transmitting the determination result in response to receiving a request. The reader transmits the request to the tag and receives the determination result from the tag.

Abstract: An information terminal that reduces the effort of presence input is provided. The information terminal is connected via a network to a server for disclosing a presence that is a present state of each user or each object, and includes: a display unit for displaying a presence input screen that is a screen for inputting the presence; a storage unit storing a terminal identifier that differs from one user terminal to another and information on the presence input screen; and a control unit that causes the presence input screen to be displayed on the display unit upon receiving a presence input request signal that is a signal for requesting input of the presence from another information terminal via the network, and when the presence is inputted via an operating unit, transmits the terminal identifier together with the presence to the server.

Abstract: To realize state estimation that corresponds with an actual situation by dynamically changing an abstract state calculation method. Upon receiving an abstract state monitoring request, an abstract state generation section 10 extracts a constituent element of an abstract state from the request, selects a rule for calculating an abstract state from the presence of the element, and generates a presence servicing client 20 that has a watcher for observing the element via a presence servicing section 40 and a presentity for issuing the presence of the abstract state to the presence service. Further, the rule for calculating an abstract state is changed in accordance with presence.

Abstract: A system comprising a wireless tag and a tag reader. The tag comprises: a sensor for generating a detected information; a storage for storing the detected information; a determination unit for storing a criteria information and outputting a result of determination on the detected information on the basis of the criteria information; and a communication control unit for transmitting the determination result in response to receiving a request. The reader transmits the request to the tag and receives the determination result from the tag.

Abstract: A network application decentralized execution system which allows a network application developed for a centralized switched network to be applied to a decentralized switched network is disclosed. The network application decentralized execution system includes a network application server, a first terminal equipment and a second terminal equipment. Each of the first and second terminal equipments includes a detection section for detecting a variation of a connection state of the terminal equipment, a control section for controlling the connection state, and a plug-in section for plugging in an application execution script downloaded from a network application server.

Abstract: A link state routing communication device allowing path precalculation satisfying the required quality of a connection and reducing the call blocking probability is disclosed. A path satisfying a connection request can be selected from a plurality of precalculated paths which are stored for each destination in a memory. The precalculated paths reflect the latest link resource information using the feasibility check operation or precalculated path update operation. Therefore, a blocking probability of connection setup using precalculated paths can be decreased. In a border node, summarized information is calculated based on precalculated paths and therefore high-speed summarized information calculation is allowed, resulting in reduced computation load.

Abstract: A link state routing communication device allowing path precalculation satisfying the required quality of a connection and reducing the call blocking probability is disclosed. A path satisfying a connection request can be selected from a plurality of precalculated paths which are stored for each destination in a memory. The precalculated paths reflect the latest link resource information using the feasibility check operation or precalculated path update operation. Therefore, a blocking probability of connection setup using precalculated paths can be decreased. In a border node, summarized information is calculated based on precalculated paths and therefore high-speed summarized information calculation is allowed, resulting in reduced computation load.

Abstract: A merchandise order receiving method, a program, and a first-order type drive through system in which an order receiver can trace an orderer's position during movement of the orderer of a merchandise and which stops the acquisition of position information of the orderer on an order receiver side at the time of merchandise transfer completion to protect orderer's privacy.

Abstract: A network application decentralized execution system which allows a network application developed for a centralized switched network to be applied to a decentralized switched network is disclosed. The network application decentralized execution system includes a network application server, a first terminal equipment and a second terminal equipment. Each of the first and second terminal equipments includes a detection section for detecting a variation of a connection state of the terminal equipment, a control section for controlling the connection state, and a plug-in section for plugging in an application execution request downloaded from a network application server.

Abstract: A load distribution failure recovery device allowing the failure recovery process to be executed at the high performance rate and in a short time is disclosed. A link state memory retrievably stores link state information of the connection-oriented network. The link state database is used to dynamically calculate an alternate route for failure recovery when a failure notification is received. A route candidate memory retrievably stores a plurality of route candidates for each of possible endpoint nodes. A load distribution route calculator determines a route for a normally set up connection such that a route having a relatively small load is selected from a plurality of route candidates with a relatively high probability.

Abstract: A link state routing communication device allowing path precalculation satisfying the required quality of a connection and reducing the call blocking probability is disclosed. A path satisfying a connection request can be selected from a plurality of precalculated paths which are stored for each destination in a memory. The precalculated paths reflect the latest link resource information using the feasibility check operation or precalculated path update operation. Therefore, a blocking probability of connection setup using precalculated paths can be decreased. In a border node, summarized information is calculated based on precalculated paths and therefore high-speed summarized information calculation is allowed, resulting in reduced computation load.