imnotteixeira / dissertation Goto Github PK

https://ieeexplore.ieee.org/document/4118688

Peer-to-Peer (P2P) reputation systems are essential to evaluate the trustworthiness of participating peers and to combat the selfish, dishonest, and malicious peer behaviors. The system collects locally-generated peer feedbacks and aggregates them to yield the global reputation scores. Surprisingly, most previous work ignored the distribution of peer feedbacks. We use a trust overlay network (TON) to model the trust relationships among peers. After examining the eBay transaction trace of over 10,000 users, we discover a power-law distribution in user feedbacks. Our mathematical analysis justifies that power-law distribution is applicable to any dynamically growing P2P systems, either structured or unstructured. We develop a robust and scalable P2P reputation system, PowerTrust, to leverage the power-law feedback characteristics. The PowerTrust system dynamically selects small number of power nodes that are most reputable using a distributed ranking mechanism. By using a look-ahead random walk strategy and leveraging the power nodes, PowerTrust significantly improves in global reputation accuracy and aggregation speed. PowerTrust is adaptable to dynamics in peer joining and leaving and robust to disturbance by malicious peers. Through P2P network simulation experiments, we find significant performance gains in using PowerTrust. This power-law guided reputation system design proves to achieve high query success rate in P2P file-sharing applications. The system also reduces the total job makespan and failure rate in large-scale, parameter-sweeping P2P Grid applications.

https://dl.acm.org/doi/10.1145/505151.505152

Real-time collaborative graphics editing systems allow a group of users to view and edit the same graphics document at the same time from geographically dispersed sites connected by communication networks. Consistency maintenance in the face of concurrent accesses to shared objects is one of the core issues in the design of these types of systems. In this article, we propose an object-level multiversioning approach to consistency maintenance in real-time collaborative graphic editors. This approach is novel in achieving intention preservation and convergence, in preserving the work concurrently produced by multiple users in the face of conflict, and in minimizing the number of object versions for conflict resolution. Major technical contributions of this work include a formal specification of a unique combined effect for an arbitrary group of conflict and compatible operations, a distributed algorithm for incremental creation of multiple object versions, a consistent object identification scheme for multiple object versions, and a convergent layering scheme for overlapping objects. All algorithms and schemes presented in this article have been implemented in an Internet-based GRACE (graphics collaborative editing) system. © 2002, ACM. All rights reserved.

https://www.scopus.com/record/display.uri?eid=2-s2.0-77954592850&origin=reflist&sort=plf-f&src=s&st1=real+time+communication+web+offline&nlo=&nlr=&nls=&sid=2a870bc34ff2970b9cae781a860c8735&sot=b&sdt=b&sl=50&s=TITLE-ABS-KEY%28real+time+communication+web+offline%29

In this paper we introduce a practical approach to share the user interface of MVC compatible interactive applications with remote devices that have the ability to adapt the user interface to their specific look and feel. We present the system architecture and the methodology to model the user interface as a set of RESTful resources. The remote user interface and the application state are synchronized using an Web-based event-driven system. © 2010 ACM.

https://www.researchgate.net/requests/r81609045?pli=1&loginT=G5LQmYpMr5vQUCU9xSNGKq12WEtSw97pf1uBC2xJ1g-cKFz8cAvOhTH5BK7z2JFb32P4wKX6S3MQH45-&uid=Z1Ms31lz2TS4lL1Wyt93dyGZNOOWPl5ZBDDu&cp=re299_x_p1&ch=reg&utm_medium=email&utm_source=researchgate&utm_campaign=re299&utm_term=re299_x&utm_content=re299_x_p1

Recommender systems aim at filtering large amounts of information for users, providing them with those pieces of information which better meet their preferences or needs. Such systems have been traditionally used in diverse areas, such as e-commerce or tourism. Within this context, group recommender systems address the problem of generating recommendations for groups of users who might have different interests. Although different aggregation processes have been extensively utilized in real-life applications to generate group recommendations, such processes do not guarantee that the list of products recommended to the group reflect a high agreement level among its members' individual preferences. Given the need for considering the added value of obtaining group recommendations under a high agreement level, this paper presents a novel group recommender system methodology that attempts to reach a high level of consensus among individual recommendations of group members. To do this, and inspired by existing group decision-making approaches in the literature, a consensus reaching process is carried out to bring such individual recommendations closer to each other before delivering the group recommendations.

https://www.mv.helsinki.fi/home/aula/Top20/dellarocas-reputation-mechanisms.pdf

Reputation mechanisms harness the bi-directional communication capabilities of theInternet in order to engineer large-scale word-of-mouth networks. Best known so far asa technology for building trust and fostering cooperation in online marketplaces, suchas eBay, these mechanisms are poised to have a much wider impact on organizations.This paper surveys our progress in understanding the new possibilities and challengesthat these mechanisms represent. It discusses some important dimensions in whichInternet-based reputation mechanisms differ from traditional word-of-mouth networksand surveys the most important issues related to their design, evaluation, and use. Itprovides an overview of relevant work in game theory and economics on the topic ofreputation. It discusses how this body of work is being extended and combined withinsights from computer science, marketing, and psychology in order to take into consid-eration the special properties of online environments. Finally, it identifies opportunitiesthat this new area presents for information systems research.

https://www.scopus.com/record/display.uri?eid=2-s2.0-85006013128&origin=resultslist&sort=plf-f&src=s&st1=real+time+communication+web+offline&st2=&sid=2a870bc34ff2970b9cae781a860c8735&sot=b&sdt=b&sl=50&s=TITLE-ABS-KEY%28real+time+communication+web+offline%29&relpos=15&citeCnt=10&searchTerm=

Near real-time collaboration using Web browsers is becoming rapidly more and more popular for many applications such as text editing, coding, sketching and others. These applications require reliable algorithms to ensure consistency among the participating Web clients. Operational Transformation (OT) and more recently Commutative Replicated Data Types (CRDT) have become widely adopted solutions for this kind of problem. However, most existing approaches are non-trivial and require trade-offs between expressiveness, suitable infrastructure, performance and simplicity. The ever growing number of potential use cases, the new possibilities of cutting-edge messaging protocols that shaped the near real-time Web, and the use of N-way communication between clients (e.g. WebRTC), create a need for peer-topeer algorithms that perform well and are not restricted to only a few supported data types. In this paper, we present YATA, an approach for peer-to-peer shared editing applications that ensures convergence, preserves user intentions, allows offline editing and can be utilized for arbitrary data types in the Web browser. Using Yjs, its open-source JavaScript library implementation, we have evaluated the performance and multiple usage of YATA inWeb and mobile browsers, both on test and real-world data. The promising evaluation results as well as the uptake by many commercial vendors and open-source projects indicate a wide applicability of YATA. © 2016 ACM.

https://www.scopus.com/record/display.uri?eid=2-s2.0-85050626249&origin=resultslist&sort=plf-f&src=s&sid=e475b6f38553cce759403177cd1e0967&sot=a&sdt=a&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=53&s=TITLE-ABS-KEY%28user+reputation+system+search+ranking+%29&relpos=1&citeCnt=0&searchTerm=

User reputation systems are widely used in Ecommerce website and social networks. In present most of the user reputation systems use the rule-based method or the voting systems to calculate user reputations. These systems heavily depend on the experience of experts. In this paper we try to use machine learning method to automatically learn user reputation in social networks. The social network we selected is a financial forum. A social network is seen as a directed graph, every user in the networks is a node in the graph, and the interactions between the users are the directed edges. Then we extract features of users from the social network graph. We translate the reputation learning problem into the document ranking problem, and use the listwise based rank learning method to build the reputation model. The reputation prediction model is represented as a linear model. We use the model to predict user reputation. The experimental results show that using rank learning method to predict user reputation is effective. © 2017 IEEE.

https://www.scopus.com/record/display.uri?eid=2-s2.0-85090500272&origin=resultslist&sort=plf-f&src=s&sid=b01323793c5d8cf83efca182be40683b&sot=a&sdt=a&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=56&s=TITLE-ABS-KEY%28%28live+OR+real+W%2f1+time%29+reputation+system%29&relpos=12&citeCnt=1&searchTerm=

Trust between agents in multi-agent systems (MASs) is critical to encourage high levels of cooperation. Existing methods to assess trust and reputation use direct and indirect past experiences about an agent to estimate their future performance; however, these will not always be representative if agents change their behaviour over time.Real-world distributed networks such as online market places, P2P networks, pervasive computing and the Smart Grid can be viewed as MAS. Dynamic agent behaviour in such MAS can arise from seasonal changes, cheaters, supply chain faults, network traffic and many other reasons. However, existing trust and reputation models use limited techniques, such as forgetting factors and sliding windows, to account for dynamic behaviour.In this paper, we propose Reacting and Predicting in Trust and Reputation (RaPTaR), a method to extend existing trust and reputation models to give agents the ability to monitor the output of interactions with a group of agents over time to identify any likely changes in behaviour and adapt accordingly. Additionally, RaPTaR can provide an a priori estimate of trust when there is little or no interaction data (either because an agent is new or because a detected behaviour change suggests recent past experiences are no longer representative). Our results show that RaPTaR has improved performance compared to existing trust and reputation methods when dynamic behaviour causes the ranking of the best agents to interact with to change. © 2020 Cambridge University Press.

https://www.scopus.com/record/display.uri?eid=2-s2.0-0030714527&origin=resultslist&sort=r-f&src=s&sid=56acf50be8881758341a862363bf9c81&sot=a&sdt=a&sl=58&s=TITLE-ABS-KEY%28real+W%2f1+time+conflict+resolution+algorithm%29&relpos=14&citeCnt=4&searchTerm=

We present a timestamp based algorithm for the detection of both write-write and read-write conflicts for a single file in distributed systems during network partitions. Our algorithm allows operations to occur in different network partitions simultaneously. When the sites from different partition merge, the algorithm detects and resolves both read-write and write-write conflicts without taking into account the semantics of the transactions. Once the conflicts have been detected, some reconciliation steps for the resolution of conflicts have also been proposed. Our algorithm will be useful in real-time systems where timeliness of operations is more important than response time

https://www.scopus.com/record/display.uri?eid=2-s2.0-84967152787&origin=reflist&sort=plf-f&src=s&st1=real+time+communication+web+offline&st2=&sid=2a870bc34ff2970b9cae781a860c8735&sot=b&sdt=b&sl=50&s=TITLE-ABS-KEY%28real+time+communication+web+offline%29

https://asc.di.fct.unl.pt/~nmp/pubs/middleware-2015.pdf

Client-side apps (e.g., mobile or in-browser) need cloud data to be available in a local cache, for both reads and updates. For optimal user experience and developer support, the cache should be consistent and fault-tolerant. In order to scale to high numbers of unreliable and resource-poor clients, and large database, the system needs to use resources sparingly. The SwiftCloud distributed object database is the first to provide fast reads and writes via a causally-consistent client-side local cache backed by the cloud. It is thrifty in resources and scales well, thanks to consistent versioning provided by the cloud, using small and bounded metadata. It remains available during faults, switching to a different data centre when the current one is not responsive, while maintaining its consistency guarantees. This paper presents the SwiftCloud algorithms, design, and experimental evaluation. It shows that client-side apps enjoy the high performance and availability, under the same guarantees as a remote cloud data store, at a small cost. © 2015 ACM.

https://www.scopus.com/record/display.uri?eid=2-s2.0-35348881533&origin=resultslist&sort=r-f&src=s&nlo=&nlr=&nls=&sid=794284085087747e1e35b90f8cd830de&sot=b&sdt=cl&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=44&s=TITLE-ABS-KEY+%28web+application+offline+mode%29&relpos=13&citeCnt=3&searchTerm=

With the explosive growth and spread of Internet, web access from mobile and rural users has become significant. But these users face problems of low bandwidth and intermittent Internet connectivity. To make the benefits of the Internet reach the common man in developing countries, accessibility and availability of the information has to be improved. aAQUA is an online multilingual, multimedia agricultural portal for disseminating information from and to rural communities. Considering resource constrained rural environments, we have designed and implemented an offline solution which provides an online experience to users in disconnected mode. Our solution is based on heterogeneous database synchronization which involves only a small synchronization payload ensuring an efficient use of available bandwidth. Offline aAQUA has been deployed in the field and systematic studies of our solution show that user experience has improved tremendously not only in disconnected mode but also in connected mode.

https://www.scopus.com/record/display.uri?eid=2-s2.0-77950873518&origin=reflist&sort=r-f&src=s&nlo=&nlr=&nls=&sid=794284085087747e1e35b90f8cd830de&sot=b&sdt=cl&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=44&s=TITLE-ABS-KEY+%28web+application+offline+mode%29

Synchronous groupware depends on the assumption that people are fully connected to the others in the group, but there are many situations (network delay, network outage, or explicit departure) where users are disconnected for various periods. There is little research dealing with disconnection in synchronous groupware from a user and application perspective; as a result, most current groupware systems do not handle disconnection events well, and several user-level problems occur. To address this limitation, we developed the Disco framework, a model for handling several types of disconnection in synchronous groupware. The framework considers how disconnections are identified, what senders and receivers should do during an absence, and what should be done with accumulated data upon reconnection. We have implemented the framework in three applications that show the feasibility, generality, and functionality of our ideas. Our framework is the first to deal with a full range of disconnection issues for synchronous groupware, and shows how groupware can better support the realities of distributed collaboration. Copyright 2010 ACM.

https://www.scopus.com/record/display.uri?eid=2-s2.0-33748549921&origin=resultslist

Reputation mechanisms have become an important component of electronic markets, helping to build trust and elicit cooperation among loosely connected and geographically dispersed economic agents. Understanding the impact of different reputation mechanism design parameters on the resulting market efficiency has thus emerged as a question of theoretical and practical interest. Along these lines, this note studies the impact of the frequency of reputation profile updates on cooperation and efficiency. The principal finding is that, in trading settings with pure moral hazard and noisy ratings, if the per-period profit margin of cooperating sellers is sufficiently high, a mechanism that does not publish every single rating it receives but rather only updates a trader's public reputation profile every k transactions with a summary statistic of a trader's most recent k ratings can induce higher average levels of cooperation and market efficiency than a mechanism that publishes all ratings as soon as they are posted. This paper derives expressions for calculating the optimal profile updating interval k, discusses the implications of this finding for existing systems, such as eBay, and proposes alternative reputation mechanism architectures that attain higher maximum efficiency than the, currently popular, reputation mechanisms that publish summaries of a trader's recent ratings. © 2006 INFORMS

https://ieeexplore.ieee.org/document/8432272

In this paper, we investigate how dynamic properties of reputation can influence the quality of users' ranking. Reputation systems should be based on rules that can guarantee high level of trust and help identify unreliable units. To understand the effectiveness of dynamic properties in the evaluation of reputation, we propose our own model (DIB-RM) that utilizes three factors: forgetting, cumulative, and activity period. In order to evaluate the model, we use data from StackOverflow which also has its own reputation model. We estimate similarity of ratings between DIB-RM and the StackOverflow reputation model to test our hypothesis. We use two values to calculate our metrics: DIB-RM reputation and historical reputation. We found out that historical reputation gives better metric values. Our preliminary results are presented for different sets of values of the aforementioned factors in order to analyze how effectively the model can be used for modeling reputation systems.

https://dl.acm.org/doi/10.1145/274444.274447

Real-time cooperative editing systems allow multiple users to view and edit the same text/graphic/image/multimedia document at the same time from multiple sites connected by communication networks. Consistency maintenance is one of the most significant challenges in designing and implementing real-time cooperative editing systems. In this article, a consistency model, with properties of convergence, causality preservation, and intention preservation, is proposed as a framework for consistency maintenance in real-time cooperative editing systems. Moreover, an integrated set of schemes and algorithms, which support the proposed consistency model, are devised and discussed in detail. In particular, we have contributed (1) a novel generic operation transformation control algorithm for achieving intention preservation in combination with schemes for achieving convergence and causality preservation and (2) a pair of reversible inclusion and exclusion transformation algorithms for stringwise operations for text editing. An Internet-based prototype system has been built to test the feasibility of the proposed schemes and algorithms. © 1998, ACM. All rights reserved.

https://www.scopus.com/record/display.uri?eid=2-s2.0-84960128651&origin=resultslist&sort=plf-f&src=s&st1=&st2=&sid=be6da00a276c57cc8d51f4e0e87618de&sot=b&sdt=b&sl=34&s=AUTHOR-NAME+%28F%c3%a9lix+Albertos+Marco%29&relpos=7&citeCnt=1&searchTerm=

User interaction with web applications has changed considerably over the last decade. Technological advances allow users to be more than mere information consumers. Users now produce most of the information on the World Wide Web. Most of the interaction and information management with web applications is carried out on the client side, in the local browser. However, there is not always connectivity with the web platform. Several factors prevent users from connecting with remote servers: rural areas, natural disasters or situations without coverage. These situations, among others, motivated the creation and use of offline or disconnected web applications. The present work takes an indepth look at the problems of using existent web applications in offline scenarios. To that end, the offline proxy is introduced. Then, a test is conducted to perform a preliminary evaluation of how user interaction changes with offline web interfaces. The final objective is to understand and to improve user interaction in offline scenarios with web applications. © 2015 ACM.

https://www.scopus.com/record/display.uri?eid=2-s2.0-33749684670&origin=resultslist

There is growing evidence that consumers are influenced by Internet-based opinion forums before making a variety of purchase decisions. Firms whose products are being discussed in such forums are therefore tempted to manipulate consumer perceptions by posting costly anonymous messages that praise their products. This paper offers a theoretical analysis of the impact of such behavior on firm profits and consumer surplus. There are three main results. First, if every firm's manipulation strategy is a monotonically increasing (decreasing) function of that firm's true quality, strategic manipulation of online forums increases (decreases) the information value of a forum to consumers. This result implies the existence of settings where online forum manipulation benefits consumers. Second, equilibria where strategies are monotonically increasing (decreasing) functions of a firm's true quality exist in settings where the firm's net payoff function, inclusive of the cost of manipulation, is supermodular (submodular) in the firm's quality and manipulation action. Third, in a broad class of settings, if the precision of honest consumer opinions that firms manipulate is sufficiently high, firms of all types, as well as society, would be strictly better off if manipulation of online forums was not possible. Nonetheless, firms are locked into a "rat race" and forced to spend resources on such profit-reducing activities; if they don't, consumer perceptions will be biased against them. The social cost of online manipulation can be reduced by developing "filtering" technologies that make it costlier for firms to manipulate. Interestingly, as the amount of user-contributed online content increases, it is firms, and not consumers, that have most to gain from the development of such technologies. © 2006 INFORMS.

https://www.sciencedirect.com/science/article/pii/S0020025518309253?via%3Dihub

On-line platforms foster the communication capabilities of the Internet to develop large-scale influence networks in which the quality of the interactions can be evaluated based on trust and reputation. So far, this technology is well known for building trust and harnessing cooperation in on-line marketplaces, such as Amazon (www.amazon.com) and eBay (www.ebay.es). However, these mechanisms are poised to have a broader impact on a wide range of scenarios, from large scale decision making procedures, such as the ones implied in e-democracy, to trust based recommendations on e-health context or influence and performance assessment in e-marketing and e-learning systems. This contribution surveys the progress in understanding the new possibilities and challenges that trust and reputation systems pose. To do so, it discusses trust, reputation and influence which are important measures in networked based communication mechanisms to support the worthiness of information, products, services opinions and recommendations. The existent mechanisms to estimate and propagate trust and reputation, in distributed networked scenarios, and how these measures can be integrated in decision making to reach consensus among the agents are analysed. Furthermore, it also provides an overview of the relevant work in opinion dynamics and influence assessment, as part of social networks. Finally, it identifies challenges and research opportunities on how the so called trust based network can be leveraged as an influence measure to foster decision making processes and recommendation mechanisms in complex social networks scenarios with uncertain knowledge, like the mentioned in e-health and e-marketing frameworks.

https://www.researchgate.net/publication/330713206_Expressing_Trust_with_Temporal_Frequency_of_User_Interaction_in_Online_Communities

Reputation systems concern soft security dynamics in diverse areas. Trust dynamics in a reputation system should be stable and adaptable at the same time to serve the purpose. Many reputation mechanisms have been proposed and tested over time. However, the main drawback of reputation management is that users need to share private information to gain trust in a system such as phone numbers, reviews, and ratings. Recently, a novel model that tries to overcome this issue was presented: the Dynamic Interaction-based Reputation Model (DIBRM). This approach to trust considers only implicit information automatically deduced from the interactions of users within an online community. In this primary research study, the Reddit and MathOverflow online social communities have been selected for testing DIBRM. Results show how this novel approach to trust can mimic behaviors of the selected reputation systems, namely Reddit and MathOverflow, only with temporal information.

https://www.scopus.com/record/display.uri?eid=2-s2.0-79960180094&origin=reflist&sort=plf-f&src=s&st1=offline+web+real-time&nlo=&nlr=&nls=&sid=b11fa6b26653d6db1494ee7cecb0be08&sot=b&sdt=b&sl=36&s=TITLE-ABS-KEY%28offline+web+real-time%29

Ubiquitous environments call for user interfaces able to migrate across various types of devices while preserving task continuity. One fundamental issue in migratory user interfaces is how to preserve the state while moving from one device to another. In this paper we present a solution for the interactive part of Web applications. In particular, we focus on the most problematic part, which is maintaining the JavaScript state. We also describe an example application to illustrate the support provided by our migration platform. Copyright 2011 ACM.

https://www.scopus.com/record/display.uri?eid=2-s2.0-84984699020&origin=reflist&sort=plf-f&src=s&st1=real+time+communication+web+offline&st2=&sid=2a870bc34ff2970b9cae781a860c8735&sot=b&sdt=b&sl=50&s=TITLE-ABS-KEY%28real+time+communication+web+offline%29

Collaborative text editing systems allow users to concurrently edit a shared document, inserting and deleting elements (e.g., characters or lines). There are a number of protocols for collaborative text editing, but so far there has been no precise specification of their desired behavior, and several of these protocols have been shown not to satisfy even basic expectations. This paper provides a precise specification of a replicated list object, which models the core functionality of replicated systems for collaborative text editing.We define a strong list specification, which we prove is implemented by an existing protocol, as well as a weak list specification, which admits additional protocol behaviors. A major factor determining the efficiency and practical feasibility of a collaborative text editing protocol is the space overhead of the metadata that the protocol must maintain to ensure correctness. We show that for a large class of list protocols, implementing either the strong or the weak list specification requires a metadata overhead that is at least linear in the number of elements deleted from the list. The class of protocols to which this lower bound applies includes all list protocols that we are aware of, and we show that one of these protocols almost matches the bound. © 2016 ACM.

https://www.scopus.com/record/display.uri?eid=2-s2.0-84880106669&origin=reflist&sort=plf-f&src=s&st1=real+time+communication+web+offline&st2=&sid=2a870bc34ff2970b9cae781a860c8735&sot=b&sdt=b&sl=50&s=TITLE-ABS-KEY%28real+time+communication+web+offline%29

Graphical user interfaces (GUIs) mediate many of our interactions with computers. Functional Reactive Programming (FRP) is a promising approach to GUI design, providing high-level, declarative, compositional abstractions to describe user interactions and time-dependent computations. We present Elm, a practical FRP language focused on easy creation of responsive GUIs. Elm has two major features: simple declarative support for Asynchronous FRP; and purely functional graphical layout. Asynchronous FRP allows the programmer to specify when the global ordering of event processing can be violated, and thus enables efficient concurrent execution of FRP programs; long-running computation can be executed asynchronously and not adversely affect the responsiveness of the user interface. Layout in Elm is achieved using a purely functional declarative framework that makes it simple to create and combine text, images, and video into rich multimedia displays. Together, Elm's two major features simplify the complicated task of creating responsive and usable GUIs.

https://www.scopus.com/record/display.uri?eid=2-s2.0-84978879489&origin=resultslist&sort=plf-f&src=s&nlo=&nlr=&nls=&sid=b01323793c5d8cf83efca182be40683b&sot=a&sdt=a&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=56&s=TITLE-ABS-KEY%28%28live+OR+real+W%2f1+time%29+reputation+system%29&relpos=94&citeCnt=3&searchTerm=

With the emergence of the Web 2.0, (digital) services are coverging and moving into the digital and mobile world, producing lots of information in real-time, such as traffic conditions, points of interests and so on. With the big amount of collected data from community-based applications, it becomes necessary to know wheather such content is trustworhty. When using applications such as Waze, we are supposed to trust in the information provided by unknown users, which act as digital content producers. However, it needs to be transparently clear where this information comes from and how trustable are its providers/endorsers. This paper presents the results of a two-step study to investigate how users recognize (or not) the signs and the reputation model of digital content producers in Waze app. We analysed and found out how the reputation is communicated to the users and the potential impacts on human computer interaction. © Springer International Publishing Switzerland 2016.

https://www.scopus.com/record/display.uri?eid=2-s2.0-84962284231&origin=resultslist&sort=r-f&src=s&nlo=&nlr=&nls=&sid=11f5326ff2876ac207a7eb8f52534eba&sot=b&sdt=b&sl=33&s=TITLE-ABS-KEY+%28web+local+offline%29&relpos=42&citeCnt=3&searchTerm=

Storage is one of the main services that came with Cloud Computing. It offers to the client the possibility to externalize his data. In this work, we concentrate on the use of HTML5 standard in SaaS cloud Services. In particular, we focus on the local storage APIs that offer to web application the possibility to store user's data and information in browsers. These APIs allow the user to work in offline mode. The problem with HTML5 local storage, besides the lack of security in storage, is the loss of data while moving from one machine to another. Based on the adoption of Digital Safe, the main contributions of our proposal are as follows. First, we add new secure mechanisms to enhance the security in HTML5 local storage APIs. Second, we propose an architecture that ensures a secure synchronization of local data stored with HTML5.

https://www.scopus.com/record/display.uri?eid=2-s2.0-84893813448&origin=resultslist&sort=r-f&src=s&nlo=&nlr=&nls=&sid=794284085087747e1e35b90f8cd830de&sot=b&sdt=cl&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=44&s=TITLE-ABS-KEY+%28web+application+offline+mode%29&relpos=3&citeCnt=0&searchTerm=

Despite the wide availability of Internet connections, situations of interruptedwork caused by accidental loss of connectivity or by intentional offlinework are very frequent. Concerned by the negative effects of interruptionsin users' activities, this work investigates a new approach for the design anddevelopment of Web applications resilient to interruptions applied to e-learningenvironments. In order to help users to recover from interruptions whilst navigatingWeb sites, this paper proposes a model-based approach that combinesexplicit representation of end-user navigation, local information storage (i.e.Web browser caching mechanism) and polices for client-side adaptation of Websites. With this model, we are able to provide users with information aboutwhich Web site's contents are available in an offline mode and how they canget easy access to local cache content. Moreover, the model can be also be usedto set proactive mechanism such as pre-caching Web pages that are likely to beseen by users. Such model-based approach is aimed to be used to build newWeb sites from scratch but it can also be used as a mapping support to describeoffline navigation of existing Web site. © Springer International Publishing 2013.

https://www.scopus.com/record/display.uri?eid=2-s2.0-57649195239&origin=reflist&sort=r-f&src=s&nlo=&nlr=&nls=&sid=794284085087747e1e35b90f8cd830de&sot=b&sdt=cl&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=44&s=TITLE-ABS-KEY+%28web+application+offline+mode%29

We performed an empirical study to investigate whether the context of interruptions makes a difference. We found that context does not make a difference but surprisingly, people completed interrupted tasks in less time with no difference in quality. Our data suggests that people compensate for interruptions by working faster, but this comes at a price: experiencing more stress, higher frustration, time pressure and effort. Individual differences exist in the management of interruptions: personality measures of openness to experience and need for personal structure predict disruption costs of interruptions. We discuss implications for how system design can support interrupted work. Copyright 2008 ACM.

https://www.researchgate.net/publication/295240343_A_Node-Centric_Reputation_Computation_Algorithm_on_Online_Social_Networks

In online social networks, reputations of users (nodes) are emerged and propagated through interactions among the users. These interactions include intrinsic and extrinsic consensus (voting) among neighboring users influenced by the network topology. We introduce an algorithm that considers the degree information of nodes (users) to model how reputations spread within the network. In our algorithm, each node updates reputations about its neighbors by considering the history of interactions and the frequency of the interactions in recent history. The algorithm also captures the phenomena of accuracy of reputations deteriorating over time if interactions have not occurred recently. We present the following two contributions through experiments: (1) We show that an agent’s reputation value is influenced by the position of the node in the network and the neighboring topology; and (2) We also show that our algorithm can compute more accurate reputations than existing algorithms especially when the topological information matters. The experiments are conducted in random social networks and Autonomous Systems Network of the Internet. In addition, we show the efficacies of each component in our algorithm and present their effects on the algorithm.

https://www.scopus.com/record/display.uri?eid=2-s2.0-70349843492&origin=resultslist&sort=plf-f&src=s&nlo=&nlr=&nls=&sid=e475b6f38553cce759403177cd1e0967&sot=a&sdt=a&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=53&s=TITLE-ABS-KEY%28user+reputation+system+search+ranking+%29&relpos=22&citeCnt=3&searchTerm=

The "wisdom of the crowds" is a concept used to describe the utility of harnessing group behaviour, where user opinion evolves over time and the opinion of the masses collectively demonstrates wisdom. Web 2.0 is a new medium where users are not just consumers, but are also contributors. By contributing content to the system, users become part of the network and relationships between users and content can be derived. Example applications are collaborative bookmarking networks such as del.icio.us and file sharing applications such as YouTube and Flickr. These networks rely on user contributed content, described and classified using tags. The wealth of user generated content can be hard to navigate and search due to difficulties in comparing documents with similar tags and the application of traditional information retrieval scoring techniques are limited. Evaluating the time evolving interests of users may be used to derive quality of content. In this paper, we propose a technique to rank documents based on reputation. The reputation is a combination of the number of bookmarkers, the reputation of the bookmarking user and the time dynamics of the document Experimental results and analysis are presented on a large collaborative IBM bookmarking network called Dogear. © 2009 IEEE.

https://www.scopus.com/record/display.uri?eid=2-s2.0-84954128924&origin=resultslist&sort=plf-f&src=s&st1=real+time+communication+web+offline&nlo=&nlr=&nls=&sid=2a870bc34ff2970b9cae781a860c8735&sot=b&sdt=b&sl=50&s=TITLE-ABS-KEY%28real+time+communication+web+offline%29&relpos=21&citeCnt=2&searchTerm=

The use of mobile devices such as smartphones, tablets, smart watches and notebooks in the agriculture sector is gaining significant popularity. Through mobile technologies, farmers are aided to quickly and easily communicate, advertise goods and services, as well as accessing agronomic data in soft-real time. Though mobile devices are a good source of agronomic information access and dissemination, the over-dependence on wireless communication protocols for communication is a bit of a challenge. Due to the mobility of farmers, the wireless networks can experience bandwidth fluctuations and that can hamper data transfer and management in mobile-server (cloud) ecosystems. To address this issue, previous works propose mobile data storage to support information access in an offline mode. However, the question of how to efficiently management the data state on the mobile is under-studied. In this work, we proposed a mobile-cloud architecture that enables farmers to manage data transfer and storage of agronomic data on their mobile devices in the face of the network challenges. Three different P2P Key-Value Storage methodologies are presented which are: 1) Bloom Filters algorithm, 2) whole state data transfer, and 3) exchange of delta (updates) only. The whole state data transfer is only recommended when there is stable wireless connection. © 2015 IEEE.

https://www.scopus.com/record/display.uri?eid=2-s2.0-85049534536&origin=resultslist&sort=plf-f&src=s&sid=e475b6f38553cce759403177cd1e0967&sot=a&sdt=a&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=53&s=TITLE-ABS-KEY%28user+reputation+system+search+ranking+%29&relpos=2&citeCnt=1&searchTerm=

The emergence of web-based Knowledge Management Systems (KMS) has raised several concerns about the quality of Knowledge Objects (KO), which are the building blocks of knowledge expertise. Web-based KMSs offer large knowledge repositories with millions of resources added by experts or uploaded by users, and their content must be assessed for accuracy and relevance. To improve the efficiency of ranking KOs, two models are proposed for KO evaluation. Both models are based on user interactions and exploit user reputation as an important factor in quality estimation. For the purpose of evaluating the performance of the two proposed models, the algorithms were implemented and incorporated in a KMS. The results of the experiment indicate that the two models are comparable in accuracy, and that the algorithms can be integrated in the search engine of a KMS to estimate the quality of KOs and accordingly rank the results of user searches. © 2015 The Science and Information (SAI) Organization Limited.

https://www.scopus.com/record/display.uri?eid=2-s2.0-34548030451&origin=resultslist&sort=plf-f&src=s&st1=web+socket+queue&st2=&sid=14314b00f3480b160eb8cf653d0ff13e&sot=b&sdt=b&sl=31&s=TITLE-ABS-KEY%28web+socket+queue%29&relpos=7&citeCnt=47&searchTerm=

In this paper, we extensively tune and then compare the performance of web servers based on three different server architectures. The μserver utilizes an event-driven architecture, Knot uses the highly-efficient Capriccio thread library to implement a thread-per-connection model, and WatPipe uses a hybrid of events and threads to implement a pipeline-based server that is similar in spirit to a staged event-driven architecture (SEDA) server like Haboob. We describe modifications made to the Capriccio thread library to use Linux's zero-copy sendfile interface. We then introduce the SY mmetric Multi-Processor Event Driven (SYMPED) architecture in which relatively minor modifications are made to a single process event-driven (SPED) server (the μserver) to allow it to continue processing requests in the presence of blocking due to disk accesses. Finally, we describe our C++ implementation of WatPipe, which although utilizing a pipeline-based architecture, excludes the dynamic controls over event queues and thread pools used in SEDA. When comparing the performance of these three server architectures on the workload used in our study, we arrive at different conclusions than previous studies. In spite of recent improvements to threading libraries and our further improvements to Capriccio and Knot, both the event-based μserver and pipeline-based Wat-Pipe server provide better throughput (by about 18%). We also observe that when using blocking sockets to send data to clients, the performance obtained with some architectures is quite good and in one case is noticeably better than when using non-blocking sockets. Copyright 2007 ACM.

https://www.scopus.com/record/display.uri?eid=2-s2.0-84898659345&origin=resultslist&sort=plf-f&src=s&st1=real+time+communication+web+offline&nlo=&nlr=&nls=&sid=2a870bc34ff2970b9cae781a860c8735&sot=b&sdt=b&sl=50&s=TITLE-ABS-KEY%28real+time+communication+web+offline%29&relpos=24&citeCnt=0&searchTerm=

This work proposes a novel algorithm to maximize the utilization of bandwidth for any text based application. The algorithm is used for real-time online text chatting, as well as offline SMS in mobile phones. Text is handled transparently without any modification in the core network. The proposed algorithm is an application of 'A-M' compression framework. Applying such algorithm will save at least 25% and up to 90% of the bandwidth depending on the context of the transferred data. Other applications such as email, web browsing, etc... will also gain from applying such algorithm. This paper demonstrated two types of applications; the real-time text chatting, and the mobile SMS application. The algorithm depends on a pre-defined dictionary of maximum size of 16 Kbyte installed on the client side or on the cloud near each client. © Springer International Publishing Switzerland 2014.

https://www.scopus.com/record/display.uri?eid=2-s2.0-85048633300&origin=resultslist&sort=plf-f&src=s&st1=offline+web+real-time&nlo=&nlr=&nls=&sid=b11fa6b26653d6db1494ee7cecb0be08&sot=b&sdt=b&sl=36&s=TITLE-ABS-KEY%28offline+web+real-time%29&relpos=34&citeCnt=3&searchTerm=

With the fast development of mobile computing and increasing computing capacities of mobile devices, new collaborative applications and platforms are appearing to support collaboration on the move. Indeed, nowadays, members of a team can be not only geographically distributed but they can also work anytime and anywhere thanks to the use of mobile devices. Often, however, team members would like to work either online or offline on a common project; likewise, they may wish to switch among various devices such as laptops, tablets and mobile phones and still work in the same application environment, sharing the same data, etc. In this paper we present a platform that enables application and services migration at runtime between different platforms using the WebRTC (Web Real-Time Communication) framework. We have studied applications migration both through a central server and through a distributed (Peer-to-Peer) model. Various issues that arise in application migration such as profile matching, application context, data synchronisation and consistency are discussed. The efficiency and scalability of the WebRTC framework and mobile devices (peers) under Android in a real computing infrastructure are studied. Some experimental results on the application migration time according to application state data size are reported. © Springer International Publishing AG, part of Springer Nature 2019.

https://www.scopus.com/record/display.uri?eid=2-s2.0-80052661210&origin=reflist&sort=plf-f&src=s&sid=e475b6f38553cce759403177cd1e0967&sot=a&sdt=a&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=53&s=TITLE-ABS-KEY%28user+reputation+system+search+ranking+%29

Reputable users are valuable assets of a web site. We focus on user reputation in a comment rating environment, where users make comments about content items and rate the comments of one another. Intuitively, a reputable user posts high quality comments and is highly rated by the user community. To our surprise, we find that the quality of a comment judged editorially is almost uncorrelated with the ratings that it receives, but can be predicted using standard text features, achieving accuracy as high as the agreement between two editors! However, extracting a pure reputation signal from ratings is difficult because of data sparseness and several confounding factors in users'voting behavior. To address these issues, we propose a novel bias-smoothed tensor model and empirically show that our model significantly outperforms a number of alternatives based on Yahoo! News, Yahoo! Buzz and Epinions datasets. Copyright 2011 ACM.

https://dl.acm.org/doi/10.1145/2145204.2145413

Conflict is common in collaboration, and may have both negative and positive effects on collaborative work. Past research has focused on controlling negative aspects of conflict by preventing, eliminating or isolating conflicts, but done little on exploring positive aspects of conflict. In this paper, we contribute a novel creative conflict resolution (CCR) approach to address these issues in real-time collaborative editing systems. In addition to maintaining consistency, the CCR approach is able to create new results from conflicts, generate alternative solutions based on collective effects of conflict operations, and support users to choose suitable conflict solutions and conflict resolution policies according to their needs. The CCR approach provides not only a new way of resolving conflicts in real-time collaborative editing systems, but also a framework for supporting a range of existing conflict resolution strategies. Techniques and user interface issues related to the CCR approach and a prototype implementation are discussed in this paper. © 2012 ACM.

https://www.scopus.com/record/display.uri?eid=2-s2.0-77957269160&origin=reflist&sort=plf-f&src=s&st1=real+time+communication+web+offline&nlo=&nlr=&nls=&sid=2a870bc34ff2970b9cae781a860c8735&sot=b&sdt=b&sl=50&s=TITLE-ABS-KEY%28real+time+communication+web+offline%29

In recent years, REST (Representational State Transfer) has received much attention for designing scalable web services in various domains. There is an increasing interest on its application to real-time communication web services. Based on a case study of CSTA services, we found that communication services exhibit a combination of complex message exchange and stateful behavior patterns, ncluding multi-states, twoway interaction, event-driven, multi-resources, multiresponses and session management, that need to be modeled properly within the framework of REST. To address these challenges, we propose three REST design patterns: session, event subscription and relationship using REST composition. This approach leads to a systematic one-to-one transformation from CSTA to REST. We hope such a study on a concrete use case can contribute to a better understanding of REST and lead to a seamless convergence of communication services with the infrastructure of the Web. © 2010 IEEE.

https://www.scopus.com/record/display.uri?eid=2-s2.0-81855213141&origin=resultslist&sort=r-f&src=s&nlo=&nlr=&nls=&sid=794284085087747e1e35b90f8cd830de&sot=b&sdt=cl&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=44&s=TITLE-ABS-KEY+%28web+application+offline+mode%29&relpos=0&citeCnt=17&searchTerm=

An increasing number of people use cell phones daily. Users are not only capable of making phone calls, but can also install applications on their mobile phones. When creating mobile applications, developers usually encounter the cross-platform incompatibility problem (for example, iPhone applications cannot be executed on the Android platform). Moreover, because mobile Web browsers have increasingly supported more and more Web-related standards, Web applications are more possible to be executed on different platforms than mobile applications. However, the problem of Web application is that it cannot be executed in offline mode. This study proposes a Web-based platform for executing applications on mobile devices. This platform provides several services for developers such as offline service, content adaptation service, and synchronization service. With the help of the proposed platform, application developers can develop and publish offline Web applications easily with simplified external Web content and synchronization capability. © 2011 Elsevier B.V.

https://www.cs.bham.ac.uk/~pxt/IDA/topic_pagerank.pdf

"Personalised PageRank"

In the original PageRank algorithm for improving the ranking of search-query results, a single PageRank vector is computed, using the link structure of the Web, to capture the relative "importance" of Web pages, independent of any particular search query. To yield more accurate search results, we propose computing a set of PageRank vectors, biased using a set of representative topics, to capture more accurately the notion of importance with respect to a particular topic. By using these (precomputed) biased PageRank vectors to generate query-specific importance scores for pages at query time, we show that we can generate more accurate rankings than with a single, generic PageRank vector. For ordinary keyword search queries, we compute the topic-sensitive PageRank scores for pages satisfying the query using the topic of the query keywords. For searches done in context (e.g., when the search query is performed by highlighting words in a Web page), we compute the topic-sensitive PageRank scores using the topic of the context in which the query appeared.

https://www.scopus.com/record/display.uri?eid=2-s2.0-84968754882&origin=reflist&sort=r-f&src=s&nlo=&nlr=&nls=&sid=794284085087747e1e35b90f8cd830de&sot=b&sdt=cl&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=44&s=TITLE-ABS-KEY+%28web+application+offline+mode%29

Research into Web based teamwork support has assumed that the network connection exists permanently, i.e. online. However, there is an increasing demand that teamwork environments should also support the offline mobile scenario that is so far not well addressed. The paper describes the radical requirements, novel mechanisms and innovative prototype for team members to work in an offline mobile mode in addition to that of the normal online mode. The prototype supports teamwork between the online and offline mobile modes with smooth switching over. © 2000 IEEE.

https://dspace.mit.edu/handle/1721.1/1850

Online reputation mechanisms are emerging as a promising alternative to more established mechanisms for promoting trust and cooperative behavior, such as legally enforceable contracts. As information technology dramatically reduces the cost of accumulating, processing and disseminating consumer feedback, it is plausible to ask whether such mechanisms can provide an economically more efficient solution to a wide range of moral hazard settings where societies currently rely on the threat of litigation in order to induce cooperation. In this paper we compare online reputation to legal enforcement as institutional mechanisms in terms of their ability to induce cooperative behavior. Furthermore, we explore the impact of information technology on their relative economic efficiency. We find that although both mechanisms result in losses relative to the maximum possible social surplus, under certain conditions online reputation outperforms litigation in terms of maximizing the total surplus, and thus the resulting social welfar

https://www.scopus.com/record/display.uri?eid=2-s2.0-85076749929&origin=resultslist&sort=plf-f&src=s&st1=real+time+communication+web+offline&st2=&sid=2a870bc34ff2970b9cae781a860c8735&sot=b&sdt=b&sl=50&s=TITLE-ABS-KEY%28real+time+communication+web+offline%29&relpos=3&citeCnt=4&searchTerm=

https://www.inkandswitch.com/media/local-first/local-first.pdf

Cloud apps like Google Docs and Trello are popular because they enable real-time collaboration with colleagues, and they make it easy for us to access our work from all of our devices. However, by centralizing data storage on servers, cloud apps also take away ownership and agency from users. If a service shuts down, the software stops functioning, and data created with that software is lost. In this article we propose local-first software, a set of principles for software that enables both collaboration and ownership for users. Local-first ideals include the ability to work offline and collaborate across multiple devices, while also improving the security, privacy, long-term preservation, and user control of data. We survey existing approaches to data storage and sharing, ranging from email attachments to web apps to Firebase-backed mobile apps, and we examine the trade-offs of each. We look at Conflict-free Replicated Data Types (CRDTs): data structures that are multi-user from the ground up while also being fundamentally local and private. CRDTs have the potential to be a foundational technology for realizing local-first software. We share some of our findings from developing local-first software prototypes at the Ink & Switch research lab over the course of several years. These experiments test the viability of CRDTs in practice, and explore the user interface challenges for this new data model. Lastly, we suggest some next steps for moving towards local-first software: for researchers, for app developers, and a startup opportunity for entrepreneurs. © 2019 Copyright held by the owner/author(s). Publication rights licensed to ACM.

https://www.scopus.com/record/display.uri?eid=2-s2.0-49249126404&origin=resultslist&sort=plf-f&src=s&nlo=&nlr=&nls=&sid=e475b6f38553cce759403177cd1e0967&sot=a&sdt=a&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=53&s=TITLE-ABS-KEY%28user+reputation+system+search+ranking+%29&relpos=24&citeCnt=153&searchTerm=

High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommendations may incorporate this information. This paper focuses on networks that represent trust and recommendation systems that incorporate these trust relationships. The goal of a trust-based recommendation system is to generate personalized recommendations by aggregating the opinions of other users in the trust network. In analogy to prior work on voting and ranking systems, we use the axiomatic approach from the theory of social choice. We develop a set of five natural axioms that a trust-based recommendation system might be expected to satisfy. Then, we show that no system can simultaneously satisfy all the axioms. However, for any subset of four of the five axioms we exhibit a recommendation system that satisfies those axioms. Next we consider various ways of weakening the axioms, one of which leads to a unique recommendation system based on random walks. We consider other recommendation systems, including systems based on personalized Page Rank, majority of majorities, and minimum cuts, and search for alternative axiomatizations that uniquely characterize these systems. Finally, we determine which of these systems are incentive compatible, meaning that groups of agents interested in manipulating recommendations can not induce others to share their opinion by lying about their votes or modifying their trust links. This is an important property for systems deployed in a monetized environment.

https://www.scopus.com/record/display.uri?eid=2-s2.0-77954573233&origin=reflist&sort=r-f&src=s&nlo=&nlr=&nls=&sid=794284085087747e1e35b90f8cd830de&sot=b&sdt=cl&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=44&s=TITLE-ABS-KEY+%28web+application+offline+mode%29

Traditionally web applications have required an internet connection in order to work with data. Browsers have lacked any mechanisms to allow web applications to operate offline with a set of data to provide constant access to applications. Recently, through browser plug-ins such as Google Gears, browsers have gained the ability to persist data for offline use. However, until now it's been difficult for a web developer using these plug-ins to manage persisting data both locally for offline use and in the internet cloud due to: synchronization requirements, managing throughput and latency to the cloud, and making it work within the confines of a standards-compliant web browser. Historically in non-browser environments, programming language environments have offered automated object persistence to shield the developer from these complexities. In our research we have created a framework which introduces automated persistence of data objects for JavaScript utilizing the internet. Unlike traditional object persistence solutions, ours relies only on existing or forthcoming internet standards and does not rely upon specific runtime mechanisms such as OS or interpreter/compiler support. A new design was required in order to be suitable to the internet's unique characteristics of varying connection quality and a browser's specific restrictions. We validate our approach using benchmarks which show that our framework can handle thousands of data objects automatically, reducing the amount of work needed by developers to support offline Web applications. © 2010 International World Wide Web Conference Committee (IW3C2).

https://www.researchgate.net/publication/228593520_SUS_A_quick_and_dirty_usability_scale

A system to measure usability. Might be interesting when doing UX tests

https://www.scopus.com/record/display.uri?eid=2-s2.0-77954597031&origin=reflist&sort=r-f&src=s&nlo=&nlr=&nls=&sid=794284085087747e1e35b90f8cd830de&sot=b&sdt=cl&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=44&s=TITLE-ABS-KEY+%28web+application+offline+mode%29

We introduce a client-server toolkit called Sync Kit that demonstrates how client-side database storage can improve the performance of data intensive websites. Sync Kit is designed to make use of the embedded relational database defined in the upcoming HTML5 standard to offload some data storage and processing from a web server onto the web browsers to which it serves content. Our toolkit provides various strategies for synchronizing relational database tables between the browser and the web server, along with a client-side template library so that portions web applications may be executed client-side. Unlike prior work in this area, Sync Kit persists both templates and data in the browser across web sessions, increasing the number of concurrent connections a server can handle by up to a factor of four versus that of a traditional server-only web stack and a factor of three versus a recent template caching approach. © 2010 International World Wide Web Conference Committee (IW3C2).

https://www.scopus.com/record/display.uri?eid=2-s2.0-85039152434&origin=resultslist&sort=r-f&src=s&nlo=&nlr=&nls=&sid=794284085087747e1e35b90f8cd830de&sot=b&sdt=cl&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=44&s=TITLE-ABS-KEY+%28web+application+offline+mode%29&relpos=2&citeCnt=0&searchTerm=

The alliance with mobile device cloud computing technology promises new ways of developing business application. Using web and cloud technology, it is possible to transfer a small part of secured business data from cloud to the small storage mobile devices. However, it is challenging to keep secure data in offline mode when the web application is unable to connect to the cloud and sync those offline data at online mode. The paper discusses architecture of cloud-based mobile application. The proposed architecture helps us to develop cloud-based mobile application. Special consideration of low memory and network connectivity on the mobile device is taken into account. We present various challenges to design a cloud-based mobile application, store the data in a secured manner at offline mode and sync those at online mode. This would greatly improve enterprise productivity even when users are working offline. © 2018, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

https://www.scopus.com/record/display.uri?eid=2-s2.0-84937440373&origin=reflist&sort=plf-f&src=s&sid=e475b6f38553cce759403177cd1e0967&sot=a&sdt=a&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=53&s=TITLE-ABS-KEY%28user+reputation+system+search+ranking+%29

Why doesn't your home page appear on the first page of search results, even when you query your own name? How do other web pages always appear at the top? What creates these powerful rankings? And how? The first book ever about the science of web page rankings, Google's PageRank and Beyond supplies the answers to these and other questions and more. The book serves two very different audiences: the curious science reader and the technical computational reader. The chapters build in mathematical sophistication, so that the first five are accessible to the general academic reader. While other chapters are much more mathematical in nature, each one contains something for both audiences. For example, the authors include entertaining asides such as how search engines make money and how the Great Firewall of China influences research. The book includes an extensive background chapter designed to help readers learn more about the mathematics of search engines, and it contains several MATLAB codes and links to sample web data sets. The philosophy throughout is to encourage readers to experiment with the ideas and algorithms in the text. Any business seriously interested in improving its rankings in the major search engines can benefit from the clear examples, sample code, and list of resources provided. • Many illustrative examples and entertaining asides • MATLAB code • Accessible and informal style • Complete and self-contained section for mathematics review. © 2011 Princeton University Press. All Rights Reserved.

https://www.scopus.com/record/display.uri?eid=2-s2.0-84893817960&origin=resultslist&sort=r-f&src=s&nlo=&nlr=&nls=&sid=794284085087747e1e35b90f8cd830de&sot=b&sdt=cl&cluster=scosubjabbr%2c%22COMP%22%2ct&sl=44&s=TITLE-ABS-KEY+%28web+application+offline+mode%29&relpos=10&citeCnt=6&searchTerm=

Despite the wide availability of Internet connections, situations of interrupted work caused by accidental loss of connectivity or by intentional offline work are very frequent. Concerned by the negative effects of interruptions in users' activities, this work investigates a new approach for the design and development of Web applications resilient to interruptions. In order to help users to recover from interruptions whilst navigating Web sites, this paper proposes a model-based approach that combines explicit representation of end-user navigation, local information storage (i.e. Web browser caching mechanism) and polices for client-side adaptation of Web sites. With this model, we are able to provide users with information about which Web site's contents are available in an offline mode and how they can get easy access to local cache content. Moreover, the model can also be used to set proactive mechanism such as pre-caching Web pages that are likely to be looked at by users. Such a model-based approach is aimed at being used to build new Web sites from scratch but it can also be used as a mapping support to describe offline navigation of existing Web sites. This paper presents the conceptual model, a modeling case study and a tool support that illustrates the feasibility of the approach. © Springer International Publishing 2013.

https://scholar.harvard.edu/files/rzeckhauser/files/reputation_systems.pdf

Quick read!

https://www.scopus.com/record/display.uri?eid=2-s2.0-84896841511&origin=resultslist&sort=plf-f&src=s&st1=&st2=&sid=9a5e3968d2b98993262c5396ac215774&sot=b&sdt=b&sl=39&s=TITLE-ABS-KEY+%28HTML5+local+storage+api%29&relpos=4&citeCnt=0&searchTerm=

Offline storage technology has many uses in the Web application and it can store the user status, cache data, temporary data, and persistent data and so on. In this paper several typical web client storage technologies are discussed and it includes the IE browser's unique storage technology User Data, local Storage and session Storage of HTML5, Web SQL Databases, Indexed Database, as well as classic storage technology Cookie and so on. Their concrete using methods are explained and their individual strengths and differences are compared. Their respective applications occasions and some issues that need attention are discussed. The general cross-browser offline storage method is presented and it can use the same application programming interface to complete different browser offline storage technologies. © (2014) Trans Tech Publications, Switzerland.