Local Coupled Extreme Learning Machine (LCELM) is a recently-proposed variant of ELM, which assigns an address for each hidden-layer node and activates the hidden-layer node when its activated degree is less than a given threshold. In this paper, an improved version of LCELM is proposed by developing a new way to initialize the address for each hidden-layer node and calculating the activated de...

This paper orders certain important issues related to both uncorrelated and correlated networks with hidden variables, in which hidden variables correspond to desired node degrees. In particular, we show that networks being uncorrelated at the hidden level are also lacking in correlations between node degrees. The observation supported by the depoissonization idea allows us to extract a distrib...

In wireless networks, hidden terminal problem is common and leads to collision which makes it difficult to provide the required quality of multimedia services or support priority based services. To overcome these problems a directional antennas have been extensively used in designing MAC protocols for wireless network. Directional antennas provide many advantages over the classical antennas. In...

Ascertaining the existence of hidden objects in a complex system, objects that cannot be observed from the external world, not only is curiosity-driven but also has significant practical applications. Generally, uncovering a hidden node in a complex network requires successful identification of its neighboring nodes, but a challenge is to differentiate its effects from those of noise. We develo...

Sensor networks and ad-hoc networks, which do not require a base station such as an access point, have a hidden node problem because nodes communicating at the same time cannot know each other's communication status. On other hand, in a wireless infrastructure network the access point manages the communication with the node using RTS (request to send) and CTS (clear to send). However, we cannot...

Shortcut connections are a popular architectural feature of multi-layer perceptrons. It is generally assumed that by implementing a linear sub-mapping, shortcuts assist the learning process in the remainder of the network. Here we nd that this is not always the case: shortcut weights may also act as distractors that slow down convergence and can lead to inferior solutions. This problem can be a...

Consider a social network and suppose that we are only given the number of common friends between each pair of users. Can we reconstruct the underlying network? Similarly, consider a set of documents and the words that appear in them. If we only know the number of common words for every pair of documents, as well as the number of common documents for every pair of words, can we infer which word...

The mobile nodes are infrequent movement in nature; therefore, its packet transmission is also infrequent. Packet overload occurred for routing process, and data lossed by receiver node, since hackers hide the normal node. Basically, hidden node problem created based on malicious that planned to vital relay specific path. loss routing; so, it minimizes delivery ratio network lifetime. Then, pro...

This work seeks to develop an analytical model for the per-node throughput analysis of IEEE 802.11 WLAN networks with hidden nodes by extending Bianchi’s model. With the analytic model we derive the per-node throughput of each node and quantify the impact of hidden nodes on per-node throughput. Through our analysis, we find that nodes having more hidden nodes are likely to have worse throughput...