Results 1 - 10
of
1,843
Event-to-Sink Reliable Transport in Wireless Sensor Networks
- IEEE/ACM Trans. Networking
, 2005
"... Abstract—Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of several microsensor nodes. Reliable event detection at the sink is based on collective information provided by source nodes and not on any individual report. However, conventional end-to-end reliab ..."
Abstract
-
Cited by 376 (11 self)
- Add to MetaCart
in WSN has not been studied from this perspective before. In order to address this need, a new reliable transport scheme for WSN, the event-to-sink reliable transport (ESRT) protocol, is presented in this paper. ESRT is a novel transport solution developed to achieve reliable event detection in WSN
An information flow model for conflict and fission in small groups
- J. Anthropolog. Res
, 1977
"... Data from a voluntary association are used to construct a new formal model for a traditional anthropological problem, fission in small groups. The process leading to fission is viewed as an unequal flow of sentiments and information across the ties in a social network. This flow is unequal because i ..."
Abstract
-
Cited by 380 (0 self)
- Add to MetaCart
Data from a voluntary association are used to construct a new formal model for a traditional anthropological problem, fission in small groups. The process leading to fission is viewed as an unequal flow of sentiments and information across the ties in a social network. This flow is unequal because
File System Design for an NFS File Server Appliance
, 1994
"... Network Appliance recently began shipping a new kind of network server called an NFS file server appliance, which is a dedicated server whose sole function is to provide NFS file service. The file system requirements for an NFS appliance are different from those for a general-purpose UNIX system, b ..."
Abstract
-
Cited by 338 (2 self)
- Add to MetaCart
Network Appliance recently began shipping a new kind of network server called an NFS file server appliance, which is a dedicated server whose sole function is to provide NFS file service. The file system requirements for an NFS appliance are different from those for a general-purpose UNIX system
Multi-Cell MIMO Cooperative Networks: A New Look at Interference
- J. Selec. Areas in Commun. (JSAC
, 2010
"... Abstract—This paper presents an overview of the theory and currently known techniques for multi-cell MIMO (multiple input multiple output) cooperation in wireless networks. In dense networks where interference emerges as the key capacitylimiting factor, multi-cell cooperation can dramatically improv ..."
Abstract
-
Cited by 257 (40 self)
- Add to MetaCart
improve the system performance. Remarkably, such techniques literally exploit inter-cell interference by allowing the user data to be jointly processed by several interfering base stations, thus mimicking the benefits of a large virtual MIMO array. Multicell MIMO cooperation concepts are examined from
A Survey of Packet-Loss Recovery Techniques for Streaming Audio
- IEEE Network
, 1998
"... We survey a number of packet-loss recovery techniques for streaming audio applications operating using IP multicast. We begin with a discussion of the loss and delay characteristics of an IP multicast channel and from this show the need for packet loss recovery. Recovery techniques may be divided in ..."
Abstract
-
Cited by 197 (6 self)
- Add to MetaCart
We survey a number of packet-loss recovery techniques for streaming audio applications operating using IP multicast. We begin with a discussion of the loss and delay characteristics of an IP multicast channel and from this show the need for packet loss recovery. Recovery techniques may be divided
Learning to rank: from pairwise approach to listwise approach
- In Proc. ICML’07
, 2007
"... The paper is concerned with learning to rank, which is to construct a model or a function for ranking objects. Learning to rank is useful for document retrieval, collaborative filtering, and many other applications. Several methods for learning to rank have been proposed, which take object pairs as ..."
Abstract
-
Cited by 248 (30 self)
- Add to MetaCart
of objects are used as ‘instances ’ in learning. The paper proposes a new probabilistic method for the approach. Specifically it introduces two probability models, respectively referred to as permutation probability and top one probability, to define a listwise loss function for learning. Neural Network
The induction of dynamical recognizers
- Machine Learning
, 1991
"... A higher order recurrent neural network architecture learns to recognize and generate languages after being "trained " on categorized exemplars. Studying these networks from the perspective of dynamical systems yields two interesting discoveries: First, a longitudinal examination of the le ..."
Abstract
-
Cited by 225 (14 self)
- Add to MetaCart
A higher order recurrent neural network architecture learns to recognize and generate languages after being "trained " on categorized exemplars. Studying these networks from the perspective of dynamical systems yields two interesting discoveries: First, a longitudinal examination
The Polylith Software Bus
- ACM Transactions on Programming Languages and Systems
, 1991
"... We describe a system called Polylith that helps programmers prepare and interconnect mixed-language software components for execution in heterogeneous environments. Polylith's principal benefit is that programmers are free to implement functional requirements separately from their treatment of ..."
Abstract
-
Cited by 195 (19 self)
- Add to MetaCart
of interfacing requirements; this means that once an application has been developed for use in one execution environment (such as a distributed network) it can be adapted for reuse in other environments (such as a shared-memory multiprocessor) by automatic techniques. This flexibility is provided without loss
Temporal sequence learning and data reduction for anomaly detection
- ACM TRANSACTIONS ON INFORMATION SYSTEMS SECURITY
, 1999
"... The anomaly detection problem can be formulated as one of learning to characterize the behaviors of an individual, system, or network in terms of temporal sequences of discrete data. We present an approach to this problem based on instance based learning (IBL) techniques. To cast the anomaly detecti ..."
Abstract
-
Cited by 191 (6 self)
- Add to MetaCart
new greedy clustering algorithm reduces the size of the user model by 70 % with only a small loss in accuracy. A comparison of the greedy clustering technique to clustering with K-centers shows that greedy clustering is preferable in terms of accuracy and computation time for this domain.
Cluster Reserves: A Mechanism for Resource Management in Cluster-based Network Servers
- In Proceedings of the ACM SIGMETRICS Conference
, 2000
"... In network (e.g., Web) servers, it is often desirable to isolate the performance of different classes of requests from each other. That is, one seeks to achieve that a certain minimal proportion of server resources are available for a class of requests, independent of the load imposed by other reque ..."
Abstract
-
Cited by 166 (4 self)
- Add to MetaCart
In network (e.g., Web) servers, it is often desirable to isolate the performance of different classes of requests from each other. That is, one seeks to achieve that a certain minimal proportion of server resources are available for a class of requests, independent of the load imposed by other
Results 1 - 10
of
1,843