Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
6,439
Abstract Users Should Be Concerned of Spyware in Free P2P Software
"... Internet users are now a days using Peer-to-Peer networks to share all kinds of files. The users are motivated both by the cost-free content and by the amount of content they can share. Because of the popularity of P2P software, it is targeted by spyware communities. There are various categories of ..."
Abstract
- Add to MetaCart
Internet users are now a days using Peer-to-Peer networks to share all kinds of files. The users are motivated both by the cost-free content and by the amount of content they can share. Because of the popularity of P2P software, it is targeted by spyware communities. There are various categories
IRIE International Review of Information Ethics Winny and the Pirate Bay: A comparative analysis of P2P software usage in Japan and Sweden from a socio-cultural perspective
"... Abstract: In this paper, we examine the ethico-legal issue of P2P file sharing and copyright infringement in two different countries -Japan and Sweden -to explore the differences in attitude and behaviour towards file sharing from a socio-cultural perspective. We adopt a comparative case study appr ..."
Abstract
- Add to MetaCart
approach focusing on one Japanese case, the Winny case, and a Swedish case, the Pirate Bay case. Whereas similarities in attitudes and behaviour towards file sharing using P2P software between the two countries are found in this study, the Swedish debate on file sharing has been coloured by an ideological
Bayesian Model Selection in Social Research (with Discussion by Andrew Gelman & Donald B. Rubin, and Robert M. Hauser, and a Rejoinder)
- SOCIOLOGICAL METHODOLOGY 1995, EDITED BY PETER V. MARSDEN, CAMBRIDGE,; MASS.: BLACKWELLS.
, 1995
"... It is argued that P-values and the tests based upon them give unsatisfactory results, especially in large samples. It is shown that, in regression, when there are many candidate independent variables, standard variable selection procedures can give very misleading results. Also, by selecting a singl ..."
Abstract
-
Cited by 585 (21 self)
- Add to MetaCart
approximation, and can be done using the output from standard software. Specific results are presented for most of the types of model commonly used in sociology. It is shown that this approach overcomes the difficulties with P values and standard model selection procedures based on them. It also allows easy
On the distribution of the largest eigenvalue in principal components analysis
- ANN. STATIST
, 2001
"... Let x �1 � denote the square of the largest singular value of an n × p matrix X, all of whose entries are independent standard Gaussian variates. Equivalently, x �1 � is the largest principal component variance of the covariance matrix X ′ X, or the largest eigenvalue of a p-variate Wishart distribu ..."
Abstract
-
Cited by 422 (4 self)
- Add to MetaCart
distribution on n degrees of freedom with identity covariance. Consider the limit of large p and n with n/p = γ ≥ 1. When centered by µ p = � √ n − 1 + √ p � 2 and scaled by σ p = � √ n − 1 + √ p��1 / √ n − 1 + 1 / √ p � 1/3 � the distribution of x �1 � approaches the Tracy–Widom lawof order 1, which
Analyzing Peer-to-Peer Traffic Across Large Networks
- IEEE/ACM Transactions on Networking
, 2002
"... Abstract—The use of peer-to-peer (P2P) applications is growing dramatically, particularly for sharing large video/audio files and software. In this paper, we analyze P2P traffic by measuring flowlevel information collected at multiple border routers across a large ISP network, and report our investi ..."
Abstract
-
Cited by 383 (3 self)
- Add to MetaCart
Abstract—The use of peer-to-peer (P2P) applications is growing dramatically, particularly for sharing large video/audio files and software. In this paper, we analyze P2P traffic by measuring flowlevel information collected at multiple border routers across a large ISP network, and report our
P-Grid: A self-organizing access structure for P2P information systems
- In CoopIS
, 2001
"... Peer-To-Peer systems are driving a major paradigm shift in the era of genuinely distributed computing. Gnutella is a good example of a Peer-To-Peer success story: a rather simple software enables Internet users to freely exchange files, such as MP3 music files. But it shows up also some of the limit ..."
Abstract
-
Cited by 304 (49 self)
- Add to MetaCart
of the limitations of current P2P information systems with respect to their ability to manage data eÆciently. In this paper we introduce P-Grid, a scalable access structure that is specifically designed for Peer-To-Peer information systems. P-Grids are constructed and maintained by using randomized algorithms
On the (im)possibility of obfuscating programs
- Lecture Notes in Computer Science
, 2001
"... Informally, an obfuscator O is an (efficient, probabilistic) “compiler ” that takes as input a program (or circuit) P and produces a new program O(P) that has the same functionality as P yet is “unintelligible ” in some sense. Obfuscators, if they exist, would have a wide variety of cryptographic an ..."
Abstract
-
Cited by 348 (24 self)
- Add to MetaCart
and complexity-theoretic applications, ranging from software protection to homomorphic encryption to complexity-theoretic analogues of Rice’s theorem. Most of these applications are based on an interpretation of the “unintelligibility ” condition in obfuscation as meaning that O(P) is a “virtual black box
Practical Loss-Resilient Codes
, 1997
"... We present a randomized construction of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decoding algorithms for these codes have fast and simple software implementations. Partial implementations of our algorithms ..."
Abstract
-
Cited by 284 (25 self)
- Add to MetaCart
We present a randomized construction of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decoding algorithms for these codes have fast and simple software implementations. Partial implementations of our algorithms
P.: Dynamic Partial-Order Reduction for Model Checking Software
- In: POPL (2005
"... We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent processes/threads, and dynamically tracking interactions between these to identify backtracking points where alternative ..."
Abstract
-
Cited by 198 (2 self)
- Add to MetaCart
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent processes/threads, and dynamically tracking interactions between these to identify backtracking points where
Identifying P2P applications based on behavioral-signatures
"... Due to the significant increase of peer-to-peer (P2P) traffic in the past few years, network operators in the ISPs and enter-prise networks want to be able to identify P2P applications and their associated traffic so as to perform a better traffic en-gineering and capacity planning. In this paper, w ..."
Abstract
- Add to MetaCart
, we propose a novel approach to identify P2P applications, as well as pin-pointing a specific P2P software from packet traces based on behavioral signatures. The main advantage of the proposed approach is that we do not need to examine the packet pay-loads, but instead, we only need to check whether a
Results 1 - 10
of
6,439
