File Sharing

Laporan ini memaparkan tahapan dan prosedur pembuatan kabel UTP tipe straight-through sebagai bagian dari praktikum jaringan komputer. Selain itu, laporan ini juga menjelaskan pengertian jaringan komputer beserta fungsi dan jenis-jenisnya, serta perbedaan antara kabel straight-through dan crossover. Praktikum ini bertujuan untuk meningkatkan pemahaman peserta tentang proses pembuatan kabel UTP yang digunakan dalam jaringan lokal, serta mengaplikasikan teori dasar jaringan komputer secara langsung. Hasil dari praktikum menunjukkan bahwa proses crimping kabel UTP membutuhkan ketelitian dan keahlian agar kabel dapat berfungsi dengan baik dan memenuhi standar jaringan yang diperlukan.

Il mondo dello spettacolo, nelle sue molteplici forme di espressione, quali il cinema, la musica, il teatro e la televisione, rappresenta un settore di fondamentale rilevanza nella vita quotidiana degli individui così come nel panorama economico-giuridico globale.
Sul piano giuridico, è opportuno considerare la trasversalità di una materia quale quella del “diritto dello spettacolo” che abbraccia differenti rami del diritto (diritto privato, diritto d’autore, diritto industriale, diritto com¬merciale, diritto del lavoro, diritto amministrativo), intaccandoli tra loro in un quadro regolatorio eterogeneo.
Il diritto privato si pone in questo contesto in una posizione centrale nella determinazione dei confini del diritto dello spettacolo, sia nella sua funzione definitoria sia attraverso i differenti schemi negoziali, strumenti indispensabili ai fini della regolazione dei mutevoli interessi dei soggetti coinvolti.
L’Opera prende in esame i principali settori del diritto dello spettacolo: il teatro, la musica, il cinema e la televisione, analizzandone gli aspetti peculiari, approfondendo questioni attuali e di grande interesse, aprendosi alle nuove tendenze del mercato.
Quattro sono le parti in cui è diviso lo studio: i diritti sulle opere dell’ingegno nel mondo dello spettacolo, le opere protette, i contratti e le tutele.
L’attenzione è rivolta non solo ai sistemi tradizionali di tutela giudiziale, ma anche ai sempre più diffusi meccanismi di tutela stragiudiziale (e arbitrale) delle controversie.
Per la novità di metodo e di approccio scientifico, l’Opera si presenta, sia come sussidio per l’attività didattica e di studio universitario sia quale prezioso strumento di approfondimento e di ricerca per gli studiosi interessati al mondo dello spettacolo. Essa  si presta alla consultazione di tutti gli appassionati del settore e per i tantissimi professionisti della filiera dello spettacolo, compresi gli operatori del diritto e gli avvocati ai quali si offre uno studio dettagliato del quadro regolatorio, accedendo ad una prospettiva attenta alle dinamiche contrattuali del mercato ed ai profili rimediali e di tutela delle opere dell’ingegno. [dalla Prefazione di Adolfo di Majo]

Real-life networks often encounter vertex dysfunctions, which are usually followed by recoveries after appropriate maintenances. In this paper we present our research on a model of scale-free networks whose vertices are regularly removed and put back. Both the frequency and length of time of the disappearance of each vertex depend on the degree of the vertex, creating a heterogeneous control over the network. Our simulation results show very interesting growth pattern of this kind of networks. We also find that the scale-free property of the degree distribution is maintained in the proposed heterogeneously controlled networks. However, the overall growth rate of the networks in our model can be remarkably reduced if the inactive periods of the vertices are kept long.

Real-life networks often encounter vertex dysfunctions, which are usually followed by recoveries after appropriate maintenances. In this paper we present our research on a model of scale-free networks whose vertices are regularly removed and put back. Both the frequency and length of time of the disappearance of each vertex depend on the degree of the vertex, creating a heterogeneous control over the network. Our simulation results show very interesting growth pattern of this kind of networks. We also find that the scale-free property of the degree distribution is maintained in the proposed heterogeneously controlled networks. However, the overall growth rate of the networks in our model can be remarkably reduced if the inactive periods of the vertices are kept long.

Nowadays the use of cloud computing is increased rapidly. The Cloud computing is very much important in the data sharing application. Due to increased use of cloud platform the management of the file problem on the cloud is increased for every single day the data is uploaded on to the cloud. So increasing demand of computation on a processing of file transfer leads to develop a new kind of technology that provides services for the manageable way. This manageable way is achieved by using file synchronization techniques in the cloud environment. Cloud computing usually consists of front-end user devices and back-end cloud servers. This gives users to access a large volume of storage on the cloud. In this project, the user can upload a file from PC (and from mobile as well) on to the cloud storage. These files will be automatically synchronized on to the user's device. So, the user can be viewed the file from anywhere and on any device. In the existing system, we need to download f...

Peer-to-peer systems have considerably evolved since their original conception, in the 90's. The idea of distributing files using the user's terminal as a relay has now been widely extended to embrace virtually any form of resource (e.g., computational and storage resources), data (e.g. files and real-time streams) and service (e.g., IP telephony, IP TV, collaboration). Robustness, resilience and autonomic management are the key evolutionary step which makes them best fitted in dynamic, large-scale, decentralized environments. Peer-to-Peer systems provide network applications the opportunity to leap over the boundaries of the standardized and best effort protocols and the constraints of administrative domains. We take here the opportunity to warmly thank all the members of the AP2PS 2011 Technical Program Committee, as well as the numerous reviewers. The creation of such a broad and high quality conference program would not have been possible without their involvement. We al...

Developments in technology have provided potentials for better communication methods. New technologies have emerged to improve existing communication channels. Some technologies applied in Real-time communication come with several challenges such as the need for additional software plugins and downloads in order to establish real-time communication, as well as security issues. Web Real-time Communication (WebRTC) is a technology that can be harnessed to overcome these challenges. The aim of this study is to design a system architecture that applies WebRTC and other technologies to support peerto-peer real-time communication solution for an ehealth application. During the study, different technologies were identified and integrated with WebRTC to develop the system architecture. Qualitative and quantitative data were collected during the development process. The solution was able to eliminate the problems associated with plugins, downloads of third party applications, and minimise la...

This article examines what appears to be the most important factor shaping file sharing: the failure of traditional cultural markets to efficiently supply the demand in the online environment. Its findings are based on tracking the traffic of movies on three Hungarian P2P networks. This dataset is then matched with cinematic distribution data of the films tracked in P2P transactions. Central to our analysis is the assessment of two piracy paradigms: substitution and shortage, that is, whether pirated content is available through legal or only illegal channels. Shortage-driven downloaders are found to outnumber those downloading only current theater releases. Nonetheless, the supply of films available for downloading is more affected by parameters of cinematic distribution than it is by box office success. Therefore, part of the sales effort directly contributes to propping up piracy.

Fair use is a statutory legal standard, which authorizes the courts to determine whether a use of a copyrighted work is permissible without a license. The open-ended nature of fair use enabled copyright law to remain flexible and adaptable to the changing circumstances. At the same time, however, flexibility creates high level of uncertainty regarding permissible uses, which may lead to a detrimental chilling effect. Consequently, while courts, scholars and practitioners strive for more certainty in fair use analysis, they are also concerned about losing the flexibility which comes with it. Does fair use mandate case-specific decision-making, or does it also allow some elaboration into rules and guidelines? A recent decision by the Eleventh Circuit brought this issue to the forefront of legal discourse. In Cambridge Univ. Press v. Patton, the Court of Appeals repudiated the attempt made by the lower court to offer a rule-like elaboration of fair-use for educational purposes. This Ar...

Real-world IP applications such as Peer-to-Peer filesharing are now able to benefit from network and location awareness. It is therefore crucial to understand the relation between underlay and overlay networks and to characterize the behavior of real users with regard to the Internet. For this purpose, we have designed and implemented MULTI-PROBE, a framework for large-scale P2P file-sharing measurements. Using this framework, we have performed measurements of BitTorrent, which is currently the P2P file sharing network with the largest amount of Internet traffic. We analyze and correlate these measurements to provide new insights into the topology, the connectivity, and the path characteristics of the Internet parts underlying P2P networks, as well as to present unique information on the BitTorrent throughput and connectivity.

Most current P2P file sharing systems treat their users as anonymous, unrelated entities, and completely disregard any social relationships between them. However, social phenomena such as friendship and the existence of communities of users with similar tastes may be well exploited in such systems, to increase their usability and performance. In this paper we present a novel social-based P2P file-sharing paradigm that exploits social phenomena by maintaining social networks and using these in content discovery, content recommendation, and downloading. Based on this paradigm's first class concepts such as taste groups, friends, and friends-offriends, we have designed and implemented the TRIBLER P2P filesharing system as a set of extensions to Bittorrent. We present and discuss the design of TRIBLER, and we show evidence that TRIBLER enables fast, trusted content discovery and recommendation at a low additional overhead, and a significant improvement in download performance.

Peer-to-Peer (P2P) systems have recently emerged as a scalable platform for which costs are shared between the system users. Today, P2P technology is serving millions of users world-wide, with applications such as file sharing, video streaming, grid computing, and massively multiplayer online games. Such diversity and scale pose important research and technical problems, which in turn require a much better understanding of the usage patterns and of the performance bottlenecks. However, the large amounts of P2P monitoring and measurement data that already exist have not been made public, for fear of lack of anonymity and in lack of a standard format. To address this problem, in this work we propose a unified format for workloads of P2P systems. Our format stores information coming from many types of P2P applications at several levels of detail, has a structure that balances generic and application-specific data, and protects the anonymity of the peers whose personal information was captured in monitoring and measurement data. Using two large traces taken from real P2P systems we show evidence of the usefulness of the proposed format, and substantiate the hope that our unified format has the potential to become a standard for sharing P2P traces.

Today, the BitTorrent Peer-to-Peer file-sharing network is one of the largest Internet applications-it generates massive traffic volumes, it is deployed in thousands of independent communities, and it serves millions of unique users worldwide. Despite a large number of empirical and theoretical studies, observing the state of the global BitTorrent network remains a grand challenge for the BitTorrent community. To address this challenge, in this work we introduce BT-World, an architecture for observing the global BitTorrent network without help from the ISPs. We design BTWorld around three main features specific to BitTorrent measurements. First, our architecture is able to find public trackers, that is, the BitTorrent components that offer unrestricted service to peers around the world. Second, by observing the state of these trackers, BTWorld obtains information about the performance, scalability, and reliability of BitTorrent. Third, BTWorld is designed to pre-process the large volumes of recorded data for later analysis. We demonstrate the viability of our architecture by deploying it in practice, to observe and analyze one week of operation of a large part of the global BitTorrent network-over 10 million swarms and tens of millions of concurrent users. We also show that BT-World can shed light on BitTorrent phenomena, such as the presence of spam trackers and giant swarms.

Real-world IP applications such as Peer-to-Peer filesharing are now able to benefit from network and location awareness. It is therefore crucial to understand the relation between underlay and overlay networks and to characterize the behavior of real users with regard to the Internet. For this purpose, we have designed and implemented MULTIPROBE, a framework for large-scale P2P file-sharing measurements. Using this framework, we have performed measurements of BitTorrent, which is currently the P2P file sharing network with the largest amount of Internet traffic. We analyze and correlate these measurements to provide new insights into the topology, the connectivity, and the path characteristics of the Internet parts underlying P2P networks, as well as to present unique information on the BitTorrent throughput and connectivity.

Collaborative filtering requires a centralized rating database. However, within a peer-to-peer network such a centralized database is not readily available. In this paper, we propose a fully distributed collaborative filtering method that is self-organizing and operates in a distributed way. Similarity ranks between multimedia files (items) are calculated by log-based user profiles and are stored locally at these items in so-called buddy tables. This intuitively creates a semantic overlay to organize multimedia files. Based on this semantic overlay and the items that a user has downloaded previously (indicating the profile of the user), recommendations can be performed and the recommended items can be easily located. We have tested our distributed collaborative filtering approach and compared it to centralized collaborative filtering, showing that it has similar performance. It is therefore a promising technique to facilitate filtering for relevant multimedia data in P2P networks.

In recent years fully decentralized file sharing systems were developed aimed at improving anonymity among their users. These systems provide typical file sharing features such as searching for and downloading files. However, elaborate schemes originally aimed at improving anonymity cause partial keyword matching to be virtually impossible, or introduce a substantial bandwidth overhead. In this paper we introduce 4P, a system that provides users with anonymous search on top of a semantic overlay. The semantic overlay allows users to efficiently locate files using partial keyword matching, without having to resort to an expensive flooding operation. Included into 4P are a number of privacy enhancing features such as probabilistic query forwarding, path uncertainty, caching, and encrypted links. Moreover, we integrate a content retrieval channel into our protocol allowing users to start downloading a file from multiple sources immediately without requiring all intermediate nodes to cache a complete copy. Using a trace-based dataset, we mimic a real-world query workload and show the cost and performance of search using six overlay configurations, comparing random, semantic, Gnutella, RetroShare, and OneSwarm to 4P. The state-of-the-art flooding based alternatives required approximately 10,000 messages to be sent per query, in contrast 4P only required 313. Showing that while flooding can achieve a high recall (more than 85% in our experiments) it is prohibitively expensive. With 4P we achieve a recall of 76% at a considerable reduction in messages sent.

Most current P2P file sharing systems treat their users as anonymous, unrelated entities, and completely disregard any social relationships between them. However, social phenomena such as friendship and the existence of communities of users with similar tastes may be well exploited in such systems, to increase their usability and performance. In this paper we present a novel social-based P2P file-sharing paradigm that exploits social phenomena by maintaining social networks and using these in content discovery, content recommendation, and downloading. Based on this paradigm's first class concepts such as taste groups, friends, and friends-offriends, we have designed and implemented the TRIBLER P2P filesharing system as a set of extensions to Bittorrent. We present and discuss the design of TRIBLER, and we show evidence that TRIBLER enables fast, trusted content discovery and recommendation at a low additional overhead, and a significant improvement in download performance.

This paper describes a compositional specification and proof system for networks of distributed processes. Each process in a network is specified using first order logic in terms of a presupposition P and an affirmation A as a triple (P) S (A). For purely sequential programs, these triples reduce to the familiar Hoare triples extended for total correctness. In distributed programs, P-A triples allow the Internal behaviour of a process to be specified in the context of the communications of the other processes in the network. Communications may either by synchronous or asynchronous. Properties such as termination, the absence of deadlock and the absence of livelock can be verified. As the technique is syntax-directed and allows network abstraction, proofs follow the structure of the program and a subnetwork within a network can be replaced by a single process. It also allows proof of the properties of non-terminating processes, such as servers.

Quality in a mobile learning system can be assessed both in terms of product quality and in terms of the quality of the learning experience. Though these do overlap in some respects, it is also the case that current quality metrics such as ISO/IEC 9126 do not address what might be regarded as the 'softer' aspects of quality. Research indicates that the quality of a learning experience is not solely based on the quality of the software but also on the conceptual basis upon which the learning experience is constructed. In this paper we explore the quality related aspects of a conceptual framework for mobile learning and propose some metrics that might be adopted to assess the quality of a mobile learning application.

O material fornece orientações sobre netiqueta, ou seja, regras de boa convivência na internet, assim como cuidados para citar e referenciar obras produzidas por terceiros a fim de não infringir as normas legais que garantem os direitos autorais.

Providing data services support for large file upload and download is increasingly vital for mobile cloud storage. There is an increase in mobile users whose data access trends show more access and large file sharing. It is a challenging task for Mobile Application Developers to handle upload and retrieve large files to/from a mobile app because of difficulties with latency, bandwidth, speed, errors, and disruptions to service in a wireless mobile environment. Some scenarios require these large files to be used offline, sometimes to be updated by a single user, and sometimes be shared among all other users. The Wireless mobile environment must consider mobile user's constraints, such as frequent disconnections and low bandwidth, which affect the ability to handle data and transactions management. The primary objective of this study is to propose a cloud-based Mobile Sync service (sometimes referred as Mobile backend as a Service) with OpenStack Swift object storage to manage large objects efficiently using two main techniques of segmentation and object chunking with compression in a mobile cloud environment. This work further contributed to a prototype implementation of the proposed framework and provides Application Programming Interface (API) consisting of Create, Read, and Delete queries and chunking operations and a lightweight sync protocol that can manage large file synchronization and access. The experimental findings with object-chunking tested size settings show that the proposed Mobile Sync framework can accommodate large files ranging from 100MB to 1GB and provides a decrease in upload/download synchronization times of 63.203% / 92.987% percent as compared to other frameworks.

Reputation systems provide mechanisms to produce a metric encapsulating reputation for a given domain for each identity within the system. These systems seek to generate an accurate assessment in the face of various factors including but not limited to unprecedented community size and potentially adversarial environments. We focus on attacks and defense mechanisms in reputation systems. We present an analysis framework that allows for general decomposition of existing reputation systems. We classify attacks against reputation systems by identifying which system components and design choices are the target of attacks. We survey defense mechanisms employed by existing reputation systems. Finally, we analyze several landmark systems in the peer-to-peer domain, characterizing their individual strengths and weaknesses. Our work contributes to understanding 1) which design components of reputation systems are most vulnerable, 2) what are the most appropriate defense mechanisms and 3) how these defense mechanisms can be integrated into existing or future reputation systems to make them resilient to attacks.

With the increasing use of digital devices, people download a variety of files daily from web browsers, emails,
and other online platforms. This often leads to multiple copies of the same file being saved unknowingly, which
results in wasted storage space and disorganized file systems. To address this problem, the Data Download
Duplication Alert System (DDAS) has been developed. DDAS is a simple yet effective Python-based application
that actively monitors downloaded files in real time. It scans all accessible folders on the computer, excluding
restricted and system-critical directories, to check if a file with the same content already exists. The system uses
the SHA-256 algorithm to generate a unique hash value for each file based on its actual content, making it reliable
even if the file name is changed. All file records, including the name, storage location, hash value, and last
modified timestamp, are stored in an SQLite database for easy reference. When a duplicate is detected, the system
immediately shows a pop-up notification displaying the existing file’s details and asks the user whether to continue
downloading the duplicate or cancel it. A Flask-based web dashboard with an ocean-themed design is also
included, allowing users to view logs of all downloads and duplicates in an organized manner. Overall, DDAS
helps users manage their files efficiently, avoid unnecessary downloads, and keep their storage organized for
better productivity in academic, personal, or professional use.

Recently three foreign academic publishers filed a case of copyright infringement against Sci-Hub and LibGen before the Delhi High Court and prayed for complete blocking these websites in India. In this context, this paper attempted to assess the impact that blocking of Sci-Hub may have on Indian research community. The download requests originating from India on a daily-basis are counted, geotagged and analysed by discipline, publisher, country and publication year etc. Results indicate that blocking Sci-Hub in India may actually hurt Indian research community in a significant way.

Adequately supporting applications with Quality-of-service (QoS) requirements is a challenging task, particularly in the Internet. In great part, this is due to the fact that the provisioning of end-toend QoS to traffic that traverses multiple autonomous systems (ASes) requires a level of cooperation between ASes that is difficult to achieve in the current architecture. Recently, service overlay networks have been considered as an approach to QoS deployment that avoids these difficulties. In this study, the problem of the topological synthesis of a service overlay network is addressed. Endsystems and nodes of the overlay network are connected through ISPs that supports bandwidth reservations. The topology design problem is expressed as an optimization problem. Even though the design problem is related to the (in general NP-hard) quadratic assignment problem, it is shown that relatively simple heuristic algorithms can deliver results that are sometimes close to the optimal solution with little overhead.

Peer-to-peer (P2P) architectures have recently become a popular design choice for building virtual environments (VEs). In P2Pbased VEs, peer connectivity between the different VE users depends on their positions in the virtual world regardless of the underlying physical network, which is subject to redundant hops and delay. In this paper, we propose Tri-Cast, a fully-distributed P2P architecture to support virtual environment applications by combining a triangular logical network used for discovering the interest group of an event in the virtual world with an application layer multicast support, used for multicasting the event message to the group members. Simulation results show that the proposed physical multicast tree algorithm reduces the cost of message transmission to group members.

This paper presents an architectural model for Wireless Peer-to-Peer (WP2P) file sharing system for ubiquitos mobile devices. File sharing is one of the rationales for computer networks with increasing demand for file sharing applications and technologies in small and large enterprise networks and on the Internet. With the popularity of mobile phones in day-to-day activities, P2P file sharing in mobile phones is highly desirable, especially in 2/2.5G mobile networks. The proposed model is based on a hybrid or semi centralized architecture with the central database server acting as an interface between the mobile devices. The P2P communication model employs the Short Messaging Service (SMS) and Multimedia Messaging Service (MMS) as the messaging medium. The mobile phone initiates a search for a particular file on the mobile P2P network using a General Packet Radio Service (GPRS) connection. The database replies the "searcher" mobile phone with a list of all the available files and the details of the mobile phones that have them. Using this information, the requesting mobile phone makes a SMS connection to any of the phones provided by the database server. The mobile phone with the file then sends it to the requesting mobile phone using the MMS. We present an architectural model using mobile proxy, SMS and MMS, for a mobile P2P network for 2/2.5G networks despite operator constraints.

Unstructured networks (like ad-hoc or peer-to-peer networks) are networks without centralized control of their operation. Users make local decisions regarding whether to follow the network protocol or not. While providing scalability benefits, this degrades the performance, which is compounded by the potential presence of Malicious Users. In general, these users are trying to disrupt the operation of the network, and prevent the legitimate users from achieving their objectives. More specifically, they could try to break the connectivity of the network, or waste the resources of the legitimate users. In this work we use game theory to examine the effect of Malicious Users. All users are modeled as payoff-maximizing strategic agents. A simple model, fictitious play, is used for the legitimate user behavior, but no limits are imposed on the Malicious Users strategies. We look for the worst case equilibrium: the one that gives Malicious Users the highest payoff. We identify the importance of the network topology.

P2P networks are scalable in serving multimedia files over Internet which is in contrast to the centralized client-server system in which the server provides all the resources to the clients. In this research, we have designed and implemented a Peer-to-Peer network simulator to efficiently serve multimedia on the Internet considering that P2P streaming applications scale very superior even in large crowd scenarios. Simulated data was used to conduct experiment from current popular multimedia serving websites such as YouTube. We have then simulated user traffic by using the P2P system to compare the performance result with the traditional Client-Server system.

The Globe Distribution Network (GDN) is an application for the efficient, worldwide distribution of freely redistributable software packages. Distribution is made efficient by encapsulating the software into special distributed objects which efficiently replicate themselves near to the downloading clients. The Globe Distribution Network takes a novel, optimistic approach to stop the illegal distribution of copyrighted and illicit material via the network. Instead of having moderators check the packages at upload time, illegal content is removed and its uploader's access to the network permanently revoked only when the violation is discovered. Other protective measures defend the GDN against internal and external attacks at its availability. By exploiting the replication of the software and using fault-tolerant server software, the Globe Distribution Network achieves high availability. This article describes the design of the GDN and a number of small experiments with its prototype implementation.

The short-term effect of BitTorrent file-sharing on movie DVD sales is estimated using sales data on newly released DVDs and torrent file downloads during a 13-week period between March and May 2009 in the USA. To overcome endogeneity between downloads and sales, the analysis is carried out in a dynamic panel setting. After controlling for an autoregressive component and a declining time trend in sales, the file-sharing elasticity of sales is not statistically different from zero in the difference GMM estimations. The results hold when external instruments are used. Moreover, the results suggest an upper bound of -0.21 of elasticity, indicating that the short-term sales displacement effect is moderate at worst.

The short-term effect of BitTorrent file-sharing on movie DVD sales is estimated using sales data on newly released DVDs and torrent file downloads during a 13-week period between March and May 2009 in the USA. To overcome endogeneity between downloads and sales, the analysis is carried out in a dynamic panel setting. After controlling for an autoregressive component and a declining time trend in sales, the file-sharing elasticity of sales is not statistically different from zero in the difference GMM estimations. The results hold when external instruments are used. Moreover, the results suggest an upper bound of -0.21 of elasticity, indicating that the short-term sales displacement effect is moderate at worst.

Peer-to-Peer (P2P) Networks continue to be popular means of trading content. However the files exchanged in these networks are not malicious, making them an ideal medium for spreading Malware. Some existing studies have shown that Malware proliferation can pose significant threats to P2P Networks, defending against such an attack are largely an open problem. This paper aims to develop the countermeasure that can effectively mitigate the Malware proliferation while preserving P2P networks performance and provide software implementations for P2P.Malware is highly pervasive in P2P file-sharing systems and is difficult to detect. To alleviate this problem, we analyze and provide preventive measures for Malware. Analysis include two types for detecting Malware and provide two basic approaches and Advanced techniques for preventing Malware. We instrument two different open source P2P networks; KaZaA and IMesh to examine the prevalence of Malware in P2P networks and provide an algorithm for detecting Malware.

La domanda relativa alla possibilità di realizzare un film ricreando attori deceduti tramite l'intelligenza artificiale-IA, o AI: artificial intelligence in inglese-rappresenta una delle sfide più attuali e complesse nel panorama giuridico e produttivo dell'industria cinematografica. I rapidi progressi della IA generativa e delle tecnologie deepfake hanno reso possibile la creazione di repliche digitali estremamente realistiche di individui, capaci di riprodurre aspetto, voce e persino le maniere di attori scomparsi. 1 Questa capacità apre orizzonti creativi e commerciali senza precedenti, consentendo di "resuscitare" figure iconiche per nuove performance o per completare progetti incompiuti. Tuttavia, questa innovazione solleva simultaneamente una serie di questioni legali intricate, che spaziano dalla proprietà intellettuale ai diritti della personalità, dalla privacy alla protezione dei dati, soprattutto quando si tratta di individui deceduti. La semplice nozione di "avere i diritti" si rivela molto più complessa di quanto possa apparire a prima vista, richiedendo un'analisi approfondita delle diverse aree del diritto e della loro applicazione post-mortem.

Peer-to-Peer (P2P) networks provide a significant solution for file sharing among peers connected to Internet. It is fast and completely decentralised system with robustness. But due to absence of a server documents on a P2P network are not rated which makes it difficult for a peer to obtain precise information in result of a query. In past, some researchers tried to attach ratings to the peers itself but it was complex and less effective. In this paper, a novel P2P architecture is proposed which attaches ratings to the uploaded document directly. These ratings then become as <Rating> element in its XML advertisement which has several child elements for information classification. The attached <Rating> element is extracted from the advertisement in real time and the document is then sorted accordingly. Therefore, the information can be easily sorted based on a request by a peer according to the relevance of matter. The information regarding relevance is obtained by the peer issuing the query. This research leads to a smart P2P model, the Rated-Resource P2P network (R2P2P).

File-sharing has become synonym with the "digital economy" where large music conglomerates as well as certain artist voice strong concern over the impact on their bottom line. This research analyzes the music industry, which has been heavily impacted by a major technological shift i.e. the invention, and rollout, of the Internet. We look to the technological shift that has enabled the downloading phenomenon, as well as analyze the uniqueness of the music industries situation. By comparing the book publishing industry as well as the software industry, which are arguably also influenced by intellectual property rights and plagiarism, we try to find similarities as well as dissimilarities with the music industry. We find that the music industry has used alliances as well as Mergers and Acquisitions in order to consolidate their positions in an attempt to slow down change. There is no consensus on the exact extent of ill effects of filesharing. We point to an unwillingness to achieve convergence of purpose between the IT-community and the much of the music industry. Finally we point to the historical fact that consumers always get what they want in the end, which should indicate a need to find a viable e-commerce solution.

This paper presents an analytical framework for
evaluating auxiliary cache utility data structures in vector
databases and local large language model (LLM) retrieval
pipelines. While frequency-based caching policies such as
TinyLFU are well-established in mature systems, the incremental
value of a dedicated auxiliary cache layer that sits between
application logic and existing caching mechanisms remains an
open question. We develop a formal mathematical model for
analyzing cache utility and present a structured assessment
methodology examining architectural trade-offs. Our analysis
encompasses system complexity, maintenance burden, and cache
coherence challenges against potential performance benefits. We
systematically compare architectural approaches across different
deployment scenarios and query workloads, identifying conditions
where auxiliary caches might provide meaningful benefits beyond
existing mechanisms. Rather than making empirical claims
that would require extensive benchmarking, we contribute a
decision framework that system architects can apply to their
specific contexts. We conclude by identifying key experimental
metrics and validation approaches that would be necessary
to quantitatively evaluate auxiliary cache implementations in
production environments.

We present a gamified video conferencing platform that integrates real-time WebRTC-based video chat with multiplayer educational games (using Phaser3 and Colyseus) to boost engagement in children (ages 5-12). The system uses a web front-end (React/JavaScript) for the UI, PeerJS/WebRTC for peer-to-peer video, and a Node.js server (with Colyseus) to synchronize game state. In a pilot evaluation with 30 young learners, the gamified platform produced markedly higher engagement and learning gains than a conventional video lesson. For example, students reported an average engagement score of 4.2/5 on the gamified platform versus 3.1/5 on a standard video call. These results are consistent with prior studies showing that game-based learning yields moderate-to-large improvements in motivation and engagement. Overall, our findings suggest that embedding interactive gaming elements in a video class can significantly enhance young students' participation and learning outcomes.

The William R. Wiley Environmental Molecular Sciences Laboratory (EMSL) at the Pacific Northwest National Laboratory (Washington) is a collaborative user facility with many unique scientific capabilities. The EMSL expects to support many of its remote users and collaborators by electronic means and is creating a collaborative environment for this purpose with capabilities ranging from chat and videoconferencing to shared applications, electronic notebooks, and remote-controlled instruments. This paper describes some of the particular capabilities required to support scientific collaborations, the status and direction of the EMSL tools, and several early uses of the EMSL software in both research and education collaborations. The first section presents a taxonomy of the types of research collaborations that currently exist (peer-to-peer, mentor-student, inter-disciplinary, producer-consumer) and evaluates the communications needs for each type. EMSL's real-time Collaborative Research Environment (CORE) is described in the next section, and the following capabilities/components are summarized: WebTour, file sharing, chat box, TeleViewer, Electronic Laboratory Notebook, on-line instruments, whiteboard, and audio/video conferencing. The third section describes the use of CORE in research and education settings. Together, these topics define a vision for natural, in-depth, virtual partnerships in research and education. A figure presents the CORE World Wide Web interface. (Author/AEF)

The paper describes a design of a peer-to-peer system which is being developed currently to support file and service (help, advise) sharing in research groups and groups of learners. The design addresses some non-technical problems in the deployment of P2P systems, such as coping with free riders, creating closely-knit groups of users sharing common interests and trust. It describes a user modelling approach for servents and presents several approaches for motivating users to participate and contribute to the community.

Content sharing using cooperative peer-to-peer model has become increasingly more popular in a vehicular ad hoc network (VANET). The small transmission window from a vehicle to an access point (AP), high mobility of vehicles, and intermittent and short-lived connectivity to an AP provide incentives for vehicles to cooperate with one another to obtain information from the Internet. These characteristics of VANETs naturally stipulate the use of cooperative peer-to-peer paradigm and motivate related content sharing application such as CarTorrent. Building upon previous research on SPAWN [6,, we have implemented CarTorrent and deployed it on a real VANET. We have run extensive field tests to affirm the feasibility of the peer-to-peer file sharing application tailored to VANET. To the best of our knowledge, the deployment of such a content sharing application on a real vehicular ad hoc testbed is the first of its kind.

Data deduplication is one of important data compression technique for removing duplicate copies of repeated data, and has been broadly used in cloud storage space to decrease the sum of storage space and hoard bandwidth. To look after the privacy of responsive data while supporting deduplication, the convergent encryption methods has been projected to encrypt the data ahead of outsourcing. Deduplication removes extra copies by saving only one print of the records and replacing the other prints with pointers that goes ahead back to the unique print. To guard data security, we are making attempt to properly tackle the difficulty of authoritative data deduplication. Dissimilar from habitual deduplication systems, the differential privileges of users are additionally measured in duplicate test as well the data itself. We also present more than a few new deduplication constructions sustaining authoritative duplicate test in hybrid cloud system. Security examination demonstrates with the ...

In content based file sharing peer-to-peer (P2P) network model nodes share files directly with each other without a centralized server. In such a file sharing system, nodes meet and exchange requests and files in the format of text, short videos, and voice clips in different interest categories. Content is various and large file sharing such as the multimedia content is required with the rapid development of the wireless communication technology. File sharing can also mean having an allocated amount of personal file storage in a common file system. A P2P content based file sharing system, for efficient file searching, threshold takes advantage of node mobility by designating stable nodes, which have the most frequent contact with community members, as community coordinators for intra community searching, and highly mobile nodes that visit other communities frequently as community ambassadors for intercommunity searching. The large file sharing needs more stable end to end path and long transmission time. Last but not least, more relationship between nodes will be used to promote the file sharing process. Content based file sharing is helpful for taking certain decisions during file transmission. These decisions will benefit in proper utilization of network resources. In this paper content-based file sharing scheme using threshold is proposed. The user's interest is determined by the proposed scheme before searching and sharing the files in the peer-to-peer network. The resources in the network are utilized as per the contents of the files to be shared. The performance evaluation show that proposed system significantly lowers transmission cost and improves file sharing success rate compared to current methods.

In our current cyber age, the increasing volume and velocity of cyberattacks targeting institutions force security teams to exert more effort. While organizations are becoming more resilient to external threats such as malware, denial-of-service attacks, and zero-day vulnerabilities, their defenses against internal threats-either from malicious or unaware employees-have not reached the desired level. User behavior analysis (UBA) within AI-powered SIEM systems is gaining prominence to address this issue. This approach aims to detect abnormal behaviors by analyzing user activities using artificial intelligence techniques, compensating for the shortcomings of traditional methods. In this study, UBA methodologies, widely used for anomaly detection against new-generation threats, are discussed alongside their core components, offering insights that can enhance security strategies. Moreover, case studies from various sectorsincluding finance, healthcare, retail, telecommunications, and critical infrastructure-are examined, focusing on the techniques used to detect anomalies in security events. In this context, the study highlights the importance of strengthening security skills and capabilities to combat evolving cybersecurity threats effectively. It is concluded that integrating AI-supported UBA into SIEM systems significantly enhances anomaly detection capabilities, providing institutions with substantial security advantages. Recommendations for collaborative approaches and the sharing of cybersecurity intelligence are also presented.

The Internet enables global sharing of data across organizational boundaries. Distributed file systems facilitate data sharing in the form of remote file access. However, traditional access control mechanisms used in distributed file systems are intended for machines under common administrative control, and rely on maintaining a centralized database of user identities. They fail to scale to a large user base distributed across multiple organizations. We provide a survey of decentralized access control mechanisms in distributed file systems intended for large scale, in both administrative domains and users. We identify essential properties of such access control mechanisms. We analyze both popular production and experimental distributed file systems in the context of our survey.

Over the past several years, we have seen the emergence of numerous types of so-called &quot;overlay&quot; networks in the Internet. There are many diverse examples of such overlay networks including the content-delivery-caching networks, implemented by companies like Akamai, ...

This paper considers the problem of allocating exchange rates in peer-to-peer dissemination, which must consider the dual objectives of throughput efficiency and reciprocity between peers, the latter essential to cooperation incentives. This question has been studied in prior research for wired networks under an upload constraint, where the focus is on achieving reciprocity through decentralized peer interactions. We consider here a wireless network substrate, for which link capacities are non-uniform according to the peering choice, and exchanges may be subject to interference. A convex optimization problem is formulated that trades off efficiency and reciprocity, and various schemes are investigated to achieve a decentralized solution.

Peer to peer file exchange systems such as Bit-Torrent are changing the way in which content is distributed in the Internet. Service capacity for a certain content adjusts dynamically as a function of peer population, thus achieving scalability. This dynamic behavior has been the subject of recent analytical studies. In this paper, we propose a partial differential equation model for BitTorrent-like systems, in which a fluid variable represents content and its distribution in the system is taken into account. This model allows for a variety of file sharing disciplines; we identify equilibrium properties that must hold regardless of this choice, and others that depend on a notion of efficiency. The equilibrium properties of many specific disciplines are described. Through a discretized ordinary differential equation model, we also present results on the stability of the equilibrium for a particular sharing policy that is suitable to model current BitTorrent systems.

À la suite du double volume consacré à La cinéphilie des cinéastes, la présente publication entend aborder la question des cinéphilies en adoptant une posture sociologique cette fois, ain d'interroger plus précisément la question des nouvelles pratiques cinéphiles. Les différents textes composant ce volume tentent ainsi de mettre en évidence les mutations à l'oeuvre dans les usages, en particulier dans le contexte des transformations radicales engendrées par l'apparition d'Internet, devenu un vecteur privilégié en matière de diffusion d'images animées. Comment les prescripteurs historiques voient-ils leur fonction se transformer au contact des nouveaux modes de consommation cinématographique ? De nouvelles instances de médiation se mettent-elles en place ain de répondre aux enjeux nouvellement formulés ? Comment appréhender le rôle des nouvelles communautés cinéphiles nées de l'émergence du Web 2.0 ? Quelle analyse peut-on porter à propos des pratiques nouvelles qui se développent au contact des nouvelles technologies ? En quoi le renouveau des pratiques amateurs questionne-t-il la notion de cinéphilie ? C'est à ces différents points que les dix auteurs qui ont participé à cet ouvrage tentent d'apporter des réponses. Les Cahiers de Champs Visuels se veulent, avant tout, une tribune pour tous ceux qui s'intéressent à la recherche interdisciplinaire se donnant comme objets l'image animée et le son (publicité, cinéma, télévision, vidéo, multimédia), analogiques et digitaux, dans la perspective d'une étude de leurs usages (socioprofessionnels, marchands, techniques, esthétiques) dans la société : évolution des métiers, des techniques, des écritures, et de leurs interactions. Ainsi, nous souhaitons que cette publication soit mise au service de la Communauté scientiique intéressée par l'image.