query: Tampering with the Delivery of Blocks and Transactions in Bitcoin

positive: Bitter to Better - How to Make Bitcoin a Better Currency Bitcoin is a distributed digital currency which has attracted a substantial number of users. We perform an in-depth investigation to understand what made Bitcoin so successful, while decades of research on cryptographic e-cash has not lead to a large-scale deployment. We ask also how Bitcoin could become a good candidate for a long-lived stable currency. In doing so, we identify several issues and attacks of Bitcoin, and propose suitable techniques to address them.

positive: SoK: Research Perspectives and Challenges for Bitcoin and Cryptocurrencies Bit coin has emerged as the most successful cryptographic currency in history. Within two years of its quiet launch in 2009, Bit coin grew to comprise billions of dollars of economic value despite only cursory analysis of the system's design. Since then a growing literature has identified hidden-but-important properties of the system, discovered attacks, proposed promising alternatives, and singled out difficult future challenges. Meanwhile a large and vibrant open-source community has proposed and deployed numerous modifications and extensions. We provide the first systematic exposition Bit coin and the many related crypto currencies or 'altcoins.' Drawing from a scattered body of knowledge, we identify three key components of Bit coin's design that can be decoupled. This enables a more insightful analysis of Bit coin's properties and future stability. We map the design space for numerous proposed modifications, providing comparative analyses for alternative consensus mechanisms, currency allocation mechanisms, computational puzzles, and key management tools. We survey anonymity issues in Bit coin and provide an evaluation framework for analyzing a variety of privacy-enhancing proposals. Finally we provide new insights on what we term disinter mediation protocols, which absolve the need for trusted intermediaries in an interesting set of applications. We identify three general disinter mediation strategies and provide a detailed comparison.

positive: Majority Is Not Enough: Bitcoin Mining Is Vulnerable

positive: Information propagation in the Bitcoin network Bitcoin is a digital currency that unlike traditional currencies does not rely on a centralized authority. Instead Bitcoin relies on a network of volunteers that collectively implement a replicated ledger and verify transactions. In this paper we analyze how Bitcoin uses a multi-hop broadcast to propagate transactions and blocks through the network to update the ledger replicas. We then use the gathered information to verify the conjecture that the propagation delay in the network is the primary cause for blockchain forks. Blockchain forks should be avoided as they are symptomatic for inconsistencies among the replicas in the network. We then show what can be achieved by pushing the current protocol to its limit with unilateral changes to the client's behavior.

positive: Double-spending fast payments in bitcoin Bitcoin is a decentralized payment system that relies on Proof-of-Work (PoW) to verify payments. Nowadays, Bitcoin is increasingly used in a number of fast payment scenarios, where the time between the exchange of currency and goods is short (in the order of few seconds). While the Bitcoin payment verification scheme is designed to prevent double-spending, our results show that the system requires tens of minutes to verify a transaction and is therefore inappropriate for fast payments. An example of this use of Bitcoin was recently reported in the media: Bitcoins were used as a form of \emph{fast} payment in a local fast-food restaurant. Until now, the security of fast Bitcoin payments has not been studied. In this paper, we analyze the security of using Bitcoin for fast payments. We show that, unless appropriate detection techniques are integrated in the current Bitcoin implementation, double-spending attacks on fast payments succeed with overwhelming probability and can be mounted at low cost. We further show that the measures recommended by Bitcoin developers for the use of Bitcoin in fast payments are not always effective in detecting double-spending; we show that if those recommendations are integrated in future Bitcoin implementations, double-spending attacks on Bitcoin will still be possible. Finally, we propose and implement a modification to the existing Bitcoin implementation that ensures the detection of double-spending attacks against fast payments.

negative: Disruptive Innovation : Removing the Innovators ’ Dilemma The objectives of this research are to co-create understanding and knowledge on the phenomenon of disruptive innovation in order to provide pragmatic clarity on the term’s meaning, impact and implications. This will address the academic audience’s gap in knowledge and provide help to practitioners wanting to understand how disruptive innovation can be fostered as part of a major competitive strategy. This paper reports on the first eighteen months of a three year academic and industrial investigation. It presents a new pragmatic definition drawn from the literature and an overview of the conceptual framework for disruptive innovation that was co-created via the collaborative efforts of academia and industry. The barriers to disruptive innovation are presented and a best practice case study of how one company is overcoming these barriers is described. The remainder of the research, which is supported by a European Commission co-sponsored project called Disrupt-it, will focus on developing and validating tools to help overcome these barriers. Thomond, P., Herzberg, T. and Lettice, F. (2003). "Disruptive Innovation: Removing the Innovators’ Dilemma". Knowledge into Practice British Academy of Management Annual Conference, Harrogate, UK, September 2003. 2 1.0. Introduction and Background. In his ground breaking book “The Innovator’s Dilemma: When New Technologies Cause Great Firms to Fail”, Clayton Christensen first coined the phrase ‘disruptive technologies’. He showed that time and again almost all the organisations that have ‘died’ or been displaced from their industries because of a new paradigm of customer offering could see the disruption coming but did nothing until it was too late (Christensen, 1997). They assess the new approaches or technologies and frame them as either deficient or as an unlikely threat much to the managers’ regret and the organisation’s demise (Christensen 2002). In the early 1990s, major airlines such as British Airways decided that the opportunities afforded by a low-cost, point-to point no frills strategy such as that introduced by the newly formed Ryanair was an unlikely threat. By the mid-1990’s other newcomers such as easyJet had embraced Ryanair’s foresight and before long, the ‘low cost’ approach had captured a large segment of the market. Low-cost no frills proved a hit with European travellers but not with the established airlines who had either ignored the threat or failed to capitalise on the approach. Today DVD technology and Charles Schwab are seen to be having a similar impact upon the VHS industry and Merrill Lynch respectively, however, disruption is not just a recent phenomenon it has firm foundations as a trend in the past that will also inevitably occur in the future. Examples of past disruptive innovations would include the introduction of the telegraph and its impact upon businesses like Pony Express and the transistor’s impact upon the companies that produced cathode ray tubes. Future predictions include the impact of Light Emitting Diode’ (L.E.D.) technology and its potential to completely disrupt the traditional light bulb sector and its supporting industries. More optimistically, Christensen (2002) further shows that the process of disruptive innovation has been one of the fundamental causal mechanisms through which access to life improving products and services has been increased and the basis on which long term organisational survival could be ensured (Christensen, 1997). In spite of the proclaimed importance of disruptive innovation and the ever increasing interest from both the business and academic press alike, there still appears to be a disparity between rhetoric and reality. To date, the multifaceted and interrelated issues of disruptive innovation have not been investigated in depth. The phenomenon with examples has been described by a number of authors (Christensen, 1997, Moore, 1995 Gilbert and Bower, 2002) and practitioner orientated writers have begun to offer strategies for responding to disruptive Thomond, P., Herzberg, T. and Lettice, F. (2003). "Disruptive Innovation: Removing the Innovators’ Dilemma". Knowledge into Practice British Academy of Management Annual Conference, Harrogate, UK, September 2003. 3 change (Charitou and Markides, 2003, Rigby and Corbett, 2002, Rafi and Kampas, 2002). However, a deep integrated understanding of the entire subject is missing. In particular, there is an industrial need and academic gap knowledge in the pragmatic comprehension of how organisations can understand and foster disruptive innovation as part of a major competitive strategy. The objectives of this research are to co-create understanding and knowledge on the phenomenon of disruptive innovation in order to provide pragmatic clarity on the term’s meaning, impact and implications. This will address the academic audience’s gap in knowledge and provide help to practitioners wanting to understand how disruptive innovation can be fostered as part of a major competitive strategy. The current paper reports on the first eighteen months of a three year academic and industrial investigation. It presents a new pragmatic definition drawn from the literature and an overview of the conceptual framework for disruptive innovation that was co-created via the collaborative efforts of academia and industry. The barriers to disruptive innovation are presented and a best practice case study of how one company is overcoming these barriers is described. The research contributes to “Disrupt-it”, a €3million project for the Information Society Technologies Commission under the 5th Framework Program of the European Union, which will focus on developing and validating tools to help organisations foster disruptive innovation. 2.0 Understanding the Phenomenon of Disruptive Innovation. ‘Disruptive Innovation’, ‘Disruptive Technologies’ and ‘Disruptive Business Strategies’ are emerging and increasingly prominent business terms that are used to describe a form of revolutionary change. They are receiving ever more academic and industrial attention, yet these terms are still poorly defined and not well understood. A key objective of this research is to improve the understanding of disruptive innovation by drawing together multiple perspectives on the topic, as shown in Figure 1, into a more holistic and comprehensive definition. Much of the past investigation into discontinuous and disruptive innovation has been path dependent upon the researchers’ investigative history. For example, Hamel’s strategy background leads him to see disruptive innovation through the lens of the ‘business model’; whereas Christensen’s technologically orientated past leads to a focus on ‘disruptive technologies’. What many researchers share is the view that firms need to periodically engage in the process of revolutionary change for long-term survival and this is not a new Thomond, P., Herzberg, T. and Lettice, F. (2003). "Disruptive Innovation: Removing the Innovators’ Dilemma". Knowledge into Practice British Academy of Management Annual Conference, Harrogate, UK, September 2003. 4 phenomenon (Christensen, 1997; Christensen and Rosenbloom, 1995; Hamel, 2000; Schumpeter, 1975, Tushman and Anderson, 1986; Tushman and Nadler, 1986, Gilbert and Bower, 2002; Rigby and Corbett, 2002; Charitou and Markides, 2003; Foster and Kaplan, 2001; Thomond and Lettice, 2002). Disruptive innovation has also been defined as “a technology, product or process that creeps up from below an existing business and threatens to displace it. Typically, the disrupter offers lower performance and less functionality... The product or process is good enough for a meaningful number of customers – indeed some don’t buy the older version’s higher functionality and welcome the disruption’s simplicity. And gradually, the new product or process improves to the point where it displaces the incumbent.” (Rafi and Kampas p 8, 2002). This definition borrows heavily from the work of Christensen (1997), which in turn has some of its origins in the findings of Dosi (1982). For example, each of the cases of disruptive innovation mentioned thus far represents a new paradigm of customer offering. Dosi (1982) claims that these can be represented as discontinuities in trajectories of progress as defined within earlier paradigms where a technological paradigm is a pattern of solutions for selected technological problems. In fact, new paradigms redefine the future meaning of progress and a new class of problems becomes the target of normal incremental innovation (Dosi, 1982). Therefore, disruptive innovations appear to typify a particular type of ‘discontinuous innovation’ (a term which has received much more academic attention). The same characteristics are found, except that disruptive innovations first establish their commercial footing in new or simple market niches by enabling customers to do things that only specialists could do before (e.g. low cost European airlines are opening up air travel to thousands that did not fly before) and that these new offerings, through a period of exploitation, migrate upmarket and eventually redefine the paradigms and value propositions on which the existing industry is based (Christensen, 1997, 2002; Moore, 1995; Business Model Charitou & Markides, 2003 Hamel, 2000

negative: Finding new terminology in very large corpora Most technical and scientific terms are comprised of complex, multi-word noun phrases but certainly not all noun phrases are technical or scientific terms. The distinction of specific terminology from common non-specific noun phrases can be based on the observation that terms reveal a much lesser degree of distributional variation than non-specific noun phrases. We formalize the limited paradigmatic modifiability of terms and, subsequently, test the corresponding algorithm on bigram, trigram and quadgram noun phrases extracted from a 104-million-word biomedical text corpus. Using an already existing and community-wide curated biomedical terminology as an evaluation gold standard, we show that our algorithm significantly outperforms standard term identification measures and, therefore, qualifies as a high-performant building block for any terminology identification system. We also provide empirical evidence that the superiority of our approach, beyond a 10-million-word threshold, is essentially domain- and corpus-size-independent.

negative: Review of axial flux induction motor for automotive applications Hybrid and electric vehicles have been the focus of many academic and industrial studies to reduce transport pollution; they are now established products. In hybrid and electric vehicles, the drive motor should have high torque density, high power density, high efficiency, strong physical structure and variable speed range. An axial flux induction motor is an interesting solution, where the motor is a double sided axial flux machine. This can significantly increase torque density. In this paper a review of the axial flux motor for automotive applications, and the different possible topologies for the axial field motor, are presented.

negative: Generalized vulnerability extrapolation using abstract syntax trees The discovery of vulnerabilities in source code is a key for securing computer systems. While specific types of security flaws can be identified automatically, in the general case the process of finding vulnerabilities cannot be automated and vulnerabilities are mainly discovered by manual analysis. In this paper, we propose a method for assisting a security analyst during auditing of source code. Our method proceeds by extracting abstract syntax trees from the code and determining structural patterns in these trees, such that each function in the code can be described as a mixture of these patterns. This representation enables us to decompose a known vulnerability and extrapolate it to a code base, such that functions potentially suffering from the same flaw can be suggested to the analyst. We evaluate our method on the source code of four popular open-source projects: LibTIFF, FFmpeg, Pidgin and Asterisk. For three of these projects, we are able to identify zero-day vulnerabilities by inspecting only a small fraction of the code bases.

negative: A Combinatorial Noise Model for Quantum Computer Simulation Quantum computers (QCs) have many potential hardware implementations ranging from solid-state silicon-based structures to electron-spin qubits on liquid helium. However, all QCs must contend with gate infidelity and qubit state decoherence over time. Quantum error correcting codes (QECCs) have been developed to protect program qubit states from such noise. Previously, Monte Carlo noise simulators have been developed to model the effectiveness of QECCs in combating decoherence. The downside to this random sampling approach is that it may take days or weeks to produce enough samples for an accurate measurement. We present an alternative noise modeling approach that performs combinatorial analysis rather than random sampling. This model tracks the progression of the most likely error states of the quantum program through its course of execution. This approach has the potential for enormous speedups versus the previous Monte Carlo methodology. We have found speedups with the combinatorial model on the order of 100X-1,000X over the Monte Carlo approach when analyzing applications utilizing the [[7,1,3]] QECC. The combinatorial noise model has significant memory requirements, and we analyze its scaling properties relative to the size of the quantum program. Due to its speedup, this noise model is a valuable alternative to traditional Monte Carlo simulation.

negative:
Random Walk with Restart on Large Graphs Using Block Elimination Given a large graph, how can we calculate the relevance between nodes fast and accurately? Random walk with restart (RWR) provides a good measure for this purpose and has been applied to diverse data mining applications including ranking, community detection, link prediction, and anomaly detection. Since calculating RWR from scratch takes a long time, various preprocessing methods, most of which are related to inverting adjacency matrices, have been proposed to speed up the calculation. However, these methods do not scale to large graphs because they usually produce large dense matrices that do not fit into memory. In addition, the existing methods are inappropriate when graphs dynamically change because the expensive preprocessing task needs to be computed repeatedly.
 In this article, we propose Bear, a fast, scalable, and accurate method for computing RWR on large graphs. Bear has two versions: a preprocessing method BearS for static graphs and an incremental update method BearD for dynamic graphs. BearS consists of the preprocessing step and the query step. In the preprocessing step, BearS reorders the adjacency matrix of a given graph so that it contains a large and easy-to-invert submatrix, and precomputes several matrices including the Schur complement of the submatrix. In the query step, BearS quickly computes the RWR scores for a given query node using a block elimination approach with the matrices computed in the preprocessing step. For dynamic graphs, BearD efficiently updates the changed parts in the preprocessed matrices of BearS based on the observation that only small parts of the preprocessed matrices change when few edges are inserted or deleted. Through extensive experiments, we show that BearS significantly outperforms other state-of-the-art methods in terms of preprocessing and query speed, space efficiency, and accuracy. We also show that BearD quickly updates the preprocessed matrices and immediately computes queries when the graph changes.

negative: An energy-efficient unequal clustering mechanism for wireless sensor networks Clustering provides an effective way for prolonging the lifetime of a wireless sensor network. Current clustering algorithms usually utilize two techniques, selecting cluster heads with more residual energy and rotating cluster heads periodically, to distribute the energy consumption among nodes in each cluster and extend the network lifetime. However, they rarely consider the hot spots problem in multihop wireless sensor networks. When cluster heads cooperate with each other to forward their data to the base station, the cluster heads closer to the base station are burdened with heavy relay traffic and tend to die early, leaving areas of the network uncovered and causing network partition. To address the problem, we propose an energy-efficient unequal clustering (EEUC) mechanism for periodical data gathering in wireless sensor networks. It partitions the nodes into clusters of unequal size, and clusters closer to the base station have smaller sizes than those farther away from the base station. Thus cluster heads closer to the base station can preserve some energy for the inter-cluster data forwarding. We also propose an energy-aware multihop routing protocol for the inter-cluster communication. Simulation results show that our unequal clustering mechanism balances the energy consumption well among all sensor nodes and achieves an obvious improvement on the network lifetime

negative: Art-Bots: Toward Chat-Based Conversational Experiences in Museums

negative: Learning Bound for Parameter Transfer Learning We consider a transfer-learning problem by using the parameter transfer approach, where a suitable parameter of feature mapping is learned through one task and applied to another objective task. Then, we introduce the notion of the local stability and parameter transfer learnability of parametric feature mapping, and thereby derive a learning bound for parameter transfer algorithms. As an application of parameter transfer learning, we discuss the performance of sparse coding in selftaught learning. Although self-taught learning algorithms with plentiful unlabeled data often show excellent empirical performance, their theoretical analysis has not been studied. In this paper, we also provide the first theoretical learning bound for self-taught learning.

negative: Analyzing Posture and Affect in Task-Oriented Tutoring Intelligent tutoring systems research aims to produce systems that meet or exceed the effectiveness of one on one expert human tutoring. Theory and empirical study suggest that affective states of the learner must be addressed to achieve this goal. While many affective measures can be utilized, posture offers the advantages of non intrusiveness and ease of interpretation. This paper presents an accurate posture estimation algorithm applied to a computer mediated tutoring corpus of depth recordings. Analyses of posture and session level student reports of engagement and cognitive load identified significant patterns. The results indicate that disengagement and frustration may coincide with closer postural positions and more movement, while focused attention and less frustration occur with more distant, stable postural positions. It is hoped that this work will lead to intelligent tutoring systems that recognize a greater breadth of affective expression through channels of posture and gesture.

negative: Contributions of the prefrontal cortex to the neural basis of human decision making The neural basis of decision making has been an elusive concept largely due to the many subprocesses associated with it. Recent efforts involving neuroimaging, neuropsychological studies, and animal work indicate that the prefrontal cortex plays a central role in several of these subprocesses. The frontal lobes are involved in tasks ranging from making binary choices to making multi-attribute decisions that require explicit deliberation and integration of diverse sources of information. In categorizing different aspects of decision making, a division of the prefrontal cortex into three primary regions is proposed. (1) The orbitofrontal and ventromedial areas are most relevant to deciding based on reward values and contribute affective information regarding decision attributes and options. (2) Dorsolateral prefrontal cortex is critical in making decisions that call for the consideration of multiple sources of information, and may recruit separable areas when making well defined versus poorly defined decisions. (3) The anterior and ventral cingulate cortex appear especially relevant in sorting among conflicting options, as well as signaling outcome-relevant information. This topic is broadly relevant to cognitive neuroscience as a discipline, as it generally comprises several aspects of cognition and may involve numerous brain regions depending on the situation. The review concludes with a summary of how these regions may interact in deciding and possible future research directions for the field.

negative: Image-based Airborne LiDAR Point Cloud Encoding for 3 D Building Model Retrieval With the development of Web 2.0 and cyber city modeling, an increasing number of 3D models have been available on web-based model-sharing platforms with many applications such as navigation, urban planning, and virtual reality. Based on the concept of data reuse, a 3D model retrieval system is proposed to retrieve building models similar to a user-specified query. The basic idea behind this system is to reuse these existing 3D building models instead of reconstruction from point clouds. To efficiently retrieve models, the models in databases are compactly encoded by using a shape descriptor generally. However, most of the geometric descriptors in related works are applied to polygonal models. In this study, the input query of the model retrieval system is a point cloud acquired by Light Detection and Ranging (LiDAR) systems because of the efficient scene scanning and spatial information collection. Using Point clouds with sparse, noisy, and incomplete sampling as input queries is more difficult than that by using 3D models. Because that the building roof is more informative than other parts in the airborne LiDAR point cloud, an image-based approach is proposed to encode both point clouds from input queries and 3D models in databases. The main goal of data encoding is that the models in the database and input point clouds can be consistently encoded. Firstly, top-view depth images of buildings are generated to represent the geometry surface of a building roof. Secondly, geometric features are extracted from depth images based on height, edge and plane of building. Finally, descriptors can be extracted by spatial histograms and used in 3D model retrieval system. For data retrieval, the models are retrieved by matching the encoding coefficients of point clouds and building models. In experiments, a database including about 900,000 3D models collected from the Internet is used for evaluation of data retrieval. The results of the proposed method show a clear superiority over related methods.

negative: THE ROLE OF DIGITAL AND SOCIAL MEDIA MARKETING IN CONSUMER BEHAVIOR This article reviews recently published research about consumers in digital and social media marketing settings. Five themes are identified: (i) consumer digital culture, (ii) responses to digital advertising, (iii) effects of digital environments on consumer behavior, (iv) mobile environments, and (v) online word of mouth (WOM). Collectively these articles shed light from many different angles on how consumers experience, influence, and are influenced by the digital environments in which they are situated as part of their daily lives. Much is still to be understood, and existing knowledge tends to be disproportionately focused on WOM, which is only part of the digital consumer experience. Several directions for future research are advanced to encourage researchers to consider a broader range of phenomena.

negative: A Spreadsheet Algebra for a Direct Data Manipulation Query Interface A spreadsheet-like "direct manipulation" interface is more intuitive for many non-technical database users compared to traditional alternatives, such as visual query builders. The construction of such a direct manipulation interfacemay appear straightforward, but there are some significant challenges. First, individual direct manipulation operations cannot be too complex, so expressive power has to be achieved through composing (long) sequences of small operations. Second, all intermediate results are visible to the user, so grouping and ordering are material after every small step. Third, users often find the need to modify previously specified queries. Since manipulations are specified one step at a time, there is no actual queryexpression to modify. Suitable means must be provided to address this need. Fourth, the order in which manipulations are performed by the user should not affect the results obtained, to avoid user confusion. We address the aforementioned challenges by designing a new spreadsheet algebra that: i) operates on recursively grouped multi-sets, ii) contains a selectively designed set of operators capable of expressing at least all single-block SQL queries and can be intuitively implemented in a spreadsheet, iii) enables query modification by the notion of modifiable query state, and iv) requires no ordering in unary data manipulation operators since they are all designed to commute. We built a prototype implementation of the spreadsheet algebra and show, through user studies with non-technical subjects, that the resultant query interface is easier to use than a standard commercial visual query builder.

negative: OBJECTIVE SELF-AWARENESS THEORY : RECENT PROGRESS AND ENDURING PROBLEMS By : Objective self-awareness theory has undergone fundamental changes in the 3 decades since Duval and Wicklund's (1972) original formulation. We review new evidence that bears on the basic tenets of the theory. Many of the assumptions of self-awareness theory require revision, particularly how expectancies influence approach and avoidance of self-standard discrepancies; the nature of standards, especially when they are changed; and the role of causal attribution in directing discrepancy reduction. However, several unresolved conceptual issues remain; future theoretical and empirical directions are discussed. Article: The human dilemma is that which arises out of a man's capacity to experience himself as both subject and object at the same time. Both are necessary--for the science of psychology, for therapy, and for gratifying living. (May, 1967, p. 8) Although psychological perspectives on the self have a long history (e.g., Cooley, 1902; James, 1890; Mead, 1934), experimental research on the self has emerged only within the last 40 years. One of the earliest "self theories" was objective self-awareness (OSA) theory (Duval & Wicklund, 1972). OSA theory was concerned with the self-reflexive quality of the consciousness. Just as people can apprehend the existence of environmental stimuli, they can be aware of their own existence: "When attention is directed inward and the individual's consciousness is focused on himself, he is the object of his own consciousness--hence 'objective' self awareness" (Duval & Wicklund, 1972, p. 2). This is contrasted with "subjective self-awareness" that results when attention is directed away from the self and the person "experiences himself as the source of perception and action" (Duval & Wicklund, 1972, p. 3). By this, Duval and Wicklund (1972,chap. 3) meant consciousness of one's existence on an organismic level, in which such existence is undifferentiated as a separate and distinct object in the world. OSA theory has stimulated a lot of research and informed basic issues in social psychology, such as emotion (Scheier & Carver, 1977), attribution (Duval & Wicklund, 1973), attitude--behavior consistency (Gibbons, 1983), self-standard comparison (Duval & Lalwani, 1999), prosocial behavior (Froming, Nasby, & McManus, 1998), deindividuation (Diener, 1979), stereotyping (Macrae, Bodenhausen, & Milne, 1998), self-assessment (Silvia & Gendolla, in press), terror management (Arndt, Greenberg, Simon, Pyszczynski, & Solomon, 1998; Silvia, 2001), and group dynamics (Duval, 1976; Mullen, 1983). Self-focused attention is also fundamental to a host of clinical and health phenomena (Hull, 1981; Ingram, 1990; Pyszczynski, Hamilton, Greenberg, & Becker, 1991; Wells & Matthews, 1994). The study of self-focused attention continues to be a dynamic and active research area. A lot of research relevant to basic theoretical issues has been conducted since the last maj or review (Gibbons, 1990). Recent research has made progress in understanding links between self-awareness and causal attribution, the effects of expectancies on self-standard discrepancy reduction, and the nature of standards--the dynamics of selfawareness are now viewed quite differently. We review these recent developments[1] and hope that a conceptual integration of new findings will further stimulate research on self-focused attention. However, there is still much conceptual work left to be done, and many basic issues remain murky and controversial. We discuss these unresolved issues and sketch the beginnings of some possible solutions. Original Theory The original statement of OSA theory (Duval & Wicklund, 1972) employed only a few constructs, relations, and processes. The theory assumed that the orientation of conscious attention was the essence of selfevaluation. Focusing attention on the self brought about objective self-awareness, which initiated an automatic comparison of the self against standards. The self was defined very broadly as the person's knowledge of the person. A standard was "defined as a mental representation of correct behavior, attitudes, and traits ... All of the standards of correctness taken together define what a 'correct' person is" (Duval & Wicklund, 1972, pp. 3, 4). This simple system consisting of self, standards, and attentional focus was assumed to operate according to gestalt consistency principles (Heider, 1960). If a discrepancy was found between self and standards, negative affect was said to arise. This aversive state then motivated the restoration of consistency. Two behavioral routes were proposed. People could either actively change their actions, attitudes, or traits to be more congruent with the representations of the standard or could avoid the self-focusing stimuli and circumstances. Avoidance effectively terminates the comparison process and hence all self-evaluation. Early research found solid support for these basic ideas (Carver, 1975; Gibbons & Wicklund, 1976; Wicklund & Duval, 1971). Duval and Wicklund (1972) also assumed that objective self-awareness would generally be an aversive state--the probability that at least one self-standard discrepancy exists is quite high. This was the first assumption to be revised. Later work found that self-awareness can be a positive state when people are congruent with their standards (Greenberg & Musham, 1981; Ickes, Wicklund, & Ferris, 1973). New Developments OSA theory has grown considerably from the original statement (Duval & Wicklund, 1972). Our review focuses primarily on core theoretical developments since the last review (Gibbons, 1990). Other interesting aspects, such as interpersonal processes and interoceptive accuracy, have not changed significantly since previous reviews (Gibbons, 1990; Silvia & Gendolla, in press). We will also overlook the many clinical consequences of self-awareness; these have been exhaustively reviewed elsewhere (Pyszczynski et al., 1991; Wells & Matthews, 1994). Expectancies and Avoiding Self-Awareness Reducing a discrepancy or avoiding self-focus are equally effective ways of reducing the negative affect resulting from a discrepancy. When do people do one or the other? The original theory was not very specific about when approach versus avoidance would occur. Duval and Wicklund (1972) did, however, speculate that two factors should be relevant. The first was whether people felt they could effectively reduce the discrepancy; the second was whether the discrepancy was small or large. In their translation of OSA theory into a "test--operate--test--exit" (TOTE) feedback system, Carver, Blaney, and Scheier (1979a, 1979b) suggested that expectancies regarding outcome favorability determine approach versus avoidance behavior. When a self-standard discrepancy is recognized, people implicitly appraise their likelihood of reducing the discrepancy (cf. Bandura, 1977; Lazarus, 1966). If eventual discrepancy reduction is perceived as likely, people will try to achieve the standard. When expectations regarding improvement are unfavorable, however, people will try to avoid self-focus. Later research and theory (Duval, Duval, & Mulilis, 1992) refined Duval and Wicklund's (1972) speculations and the notion of outcome favorability. Expectancies are not simply and dichotomously favorable or unfavorable--they connote a person's rate of progress in discrepancy reduction relative to the magnitude of the discrepancy. More specifically, people will try to reduce a discrepancy to the extent they believe that their rate of progress is sufficient relative to the magnitude of the problem. Those who believe their rate of progress to be insufficient will avoid. To test this hypothesis, participants were told they were either highly (90%) or mildly (10%) discrepant from an experimental standard (Duval et al., 1992, Study 1). Participants were then given the opportunity to engage in a remedial task that was guaranteed by the experimenter to totally eliminate their deficiency provided that they worked on the task for 2 hr and 10 min. However, the rate at which working on the task would reduce the discrepancy was varied. In the low rate of progress conditions individuals were shown a performance curve indicating no progress until the last 20 min of working on the remedial task. During the last 20 min discrepancy was reduced to zero. In the constant rate of progress condition, participants were shown a performance curve in which progress toward discrepancy reduction began immediately and continued throughout such efforts with 30% of the deficiency being reduced in the first 30 min of activity and totally eliminated after 2 hr and 10 min. Results indicated that persons who believed the discrepancy to be mild and progress to be constant worked on the remedial task; those who perceived the problem to be mild but the rate of progress to be low avoided this activity. However, participants who thought that the discrepancy was substantial and the rate of progress only constant avoided working on the remedial task relative to those in the mild discrepancy and constant rate of progress condition. These results were conceptually replicated in a second experiment (Duval et al., 1992) using participants' time to complete the total 2 hr and 10 min of remedial work as the dependent measure. This pattern suggests that the rate of progress was sufficient relative to the magnitude of the discrepancy in the mild discrepancy and constant rate of progress condition; this in turn promoted approaching the problem. In the high discrepancy and constant rate of progress condition and the high and mild discrepancy and low rate of progress conditions, rate of progress was insufficient and promoted avoiding the problem. In a third experiment (Duval et al., 1992), people were again led to believe that they were either highly or mildly discrepant from a standard on an intellectual dimension and then given the opportunity to reduce that deficiency by working on a remedial task. A

negative: An empirical study on dependence clusters for effort-aware fault-proneness prediction A dependence cluster is a set of mutually inter-dependent program elements. Prior studies have found that large dependence clusters are prevalent in software systems. It has been suggested that dependence clusters have potentially harmful effects on software quality. However, little empirical evidence has been provided to support this claim. The study presented in this paper investigates the relationship between dependence clusters and software quality at the function-level with a focus on effort-aware fault-proneness prediction. The investigation first analyzes whether or not larger dependence clusters tend to be more fault-prone. Second, it investigates whether the proportion of faulty functions inside dependence clusters is significantly different from the proportion of faulty functions outside dependence clusters. Third, it examines whether or not functions inside dependence clusters playing a more important role than others are more fault-prone. Finally, based on two groups of functions (i.e., functions inside and outside dependence clusters), the investigation considers a segmented fault-proneness prediction model. Our experimental results, based on five well-known open-source systems, show that (1) larger dependence clusters tend to be more fault-prone; (2) the proportion of faulty functions inside dependence clusters is significantly larger than the proportion of faulty functions outside dependence clusters; (3) functions inside dependence clusters that play more important roles are more fault-prone; (4) our segmented prediction model can significantly improve the effectiveness of effort-aware fault-proneness prediction in both ranking and classification scenarios. These findings help us better understand how dependence clusters influence software quality.

negative: Reinforcement Learning in Continuous State and Action Spaces Many traditional reinforcement-learning algorithms have been designed for problems with small finite state and action spaces. Learn ing in such discrete problems can been difficult, due to noise and delayed reinfor cements. However, many real-world problems have continuous state or action sp aces, which can make learning a good decision policy even more involved. In this c apter we discuss how to automatically find good decision policies in continuous d omains. Because analytically computing a good policy from a continuous model c an be infeasible, in this chapter we mainly focus on methods that explicitly up date a representation of a value function, a policy or both. We discuss conside rations in choosing an appropriate representation for these functions and disc uss gradient-based and gradient-free ways to update the parameters. We show how to a pply these methods to reinforcement-learning problems and discuss many speci fic algorithms. Amongst others, we cover gradient-based temporal-difference lear ning, evolutionary strategies, policy-gradient algorithms and (natural) actor-cri ti methods. We discuss the advantages of different approaches and compare the perform ance of a state-of-theart actor-critic method and a state-of-the-art evolutiona ry strategy empirically.

negative: Decision Support based on Bio-PEPA Modeling and Decision Tree Induction: A New Approach, Applied to a Tuberculosis Case Study The problem of selecting determinant features generating appropriate model structure is a challenge in epidemiological modelling. Disease spread is highly complex, and experts develop their understanding of its dynamic over years. There is an increasing variety and volume of epidemiological data which adds to the potential confusion. The authors propose here to make use of that data to better understand disease systems. Decision tree techniques have been extensively used to extract pertinent information and improve decision making. In this paper, the authors propose an innovative structured approach combining decision tree induction with Bio-PEPA computational modelling, and illustrate the approach through application to tuberculosis. By using decision tree induction, the enhanced Bio-PEPA model shows considerable improvement over the initial model with regard to the simulated results matching observed data. The key finding is that the developer expresses a realistic predictive model using relevant features, thus considering this approach as decision support, empowers the epidemiologist in his policy decision making. KEywoRDS Bio-PEPA Modelling, Data Mining, Decision Support, Decision Tree Induction, Epidemiology, Modelling and Simulation, Optimisation, Refinement, Tuberculosis

negative: On Optimizing VLC Networks for Downlink Multi-User Transmission: A Survey The evolving explosion in high data rate services and applications will soon require the use of untapped, abundant unregulated spectrum of the visible light for communications to adequately meet the demands of the fifth-generation (5G) mobile technologies. Radio-frequency (RF) networks are proving to be scarce to cover the escalation in data rate services. Visible light communication (VLC) has emerged as a great potential solution, either in replacement of, or complement to, existing RF networks, to support the projected traffic demands. Despite of the prolific advantages of VLC networks, VLC faces many challenges that must be resolved in the near future to achieve a full standardization and to be integrated to future wireless systems. Here, we review the new, emerging research in the field of VLC networks and lay out the challenges, technological solutions, and future work predictions. Specifically, we first review the VLC channel capacity derivation, discuss the performance metrics and the associated variables; the optimization of VLC networks are also discussed, including resources and power allocation techniques, user-to-access point (AP) association and APs-toclustered-users-association, APs coordination techniques, nonorthogonal multiple access (NOMA) VLC networks, simultaneous energy harvesting and information transmission using the visible light, and the security issue in VLC networks. Finally, we propose several open research problems to optimize the various VLC networks by maximizing either the sum rate, fairness, energy efficiency, secrecy rate, or harvested energy.

negative: Comparison of CoAP and MQTT Performance Over Capillary Radios The IoT protocols used in the application layer, namely the Constraint Application Protocol (CoAP) and Message Queue Telemetry Transport (MQTT) have dependencies to the transport layer. The choice of transport, Transmission Control Protocol (TCP) or the User Datagram Protocol(UDP), on the other hand, has an impact on the Internet of Things (IoT) application level performance, especially over a wireless medium. The motivation of this work is to look at the impact of the protocol stack on performance over two different wireless medium realizations, namely Bluetooth Low Energy and Wi-Fi. The use case studied is infrequent small reports sent from the sensor device to a central cloud storage over a last mile radio access link. We find that while CoAP/UDP based transport performs consistently better both in terms of latency and power consumption over both links, MQTT/TCP may also work when the use requirements allow for longerlatency providing better reliability. All in all, the full connectivity stack needs to be considered when designing an IoT deployment.

negative: Design of a compact high power phased array for 5G FD-MIMO system at 29 GHz This paper presents a new design concept of a beam steerable high gain phased array antenna based on WR28 waveguide at 29 GHz frequency for fifth generation (5G) full dimension multiple input multiple output (FD-MIMO) system. The 8×8 planar phased array is fed by a three dimensional beamformer to obtain volumetric beam scanning ranging from −60 to +60 degrees both in azimuth and elevation direction. Beamforming network (BFN) is designed using 16 set of 8×8 Butler matrix beamformer to get 64 beam states, which control the horizontal and vertical angle. This is a new concept to design waveguide based high power three-dimensional beamformer for volumetric multibeam in Ka band for 5G application. The maximum gain of phased array is 28.5 dBi that covers 28.9 GHz to 29.4 GHz frequency band.

negative: Development and evaluation of low cost game-based balance rehabilitation tool using the microsoft kinect sensor The use of the commercial video games as rehabilitation tools, such as the Nintendo WiiFit, has recently gained much interest in the physical therapy arena. Motion tracking controllers such as the Nintendo Wiimote are not sensitive enough to accurately measure performance in all components of balance. Additionally, users can figure out how to "cheat" inaccurate trackers by performing minimal movement (e.g. wrist twisting a Wiimote instead of a full arm swing). Physical rehabilitation requires accurate and appropriate tracking and feedback of performance. To this end, we are developing applications that leverage recent advances in commercial video game technology to provide full-body control of animated virtual characters. A key component of our approach is the use of newly available low cost depth sensing camera technology that provides markerless full-body tracking on a conventional PC. The aim of this research was to develop and assess an interactive game-based rehabilitation tool for balance training of adults with neurological injury.

negative: Aesthetics and Entropy III . Aesthetic measures 2 1 Consultant, Maplewood, MN USA 4 * Correspondence: sahyun@infionline.net; 1-(651)-927-9686 5 6 Abstract: We examined a series of real-world, pictorial photographs with varying 7 characteristics, along with their modification by noise addition and unsharp masking. As 8 response metrics we used three different versions of the aesthetic measure originally 9 proposed by Birkhoff. The first aesthetic measure, which has been used in other studies, 10 and which we used in our previous work as well, showed a preference for the least 11 complex of the images. It provided no justification for noise addition, but did reveal 12 enhancement on unsharp masking. Optimum level of unsharp masking varied with the 13 image, but was predictable from the individual image’s GIF compressibility. We expect this 14 result to be useful for guiding the processing of pictorial photographic imagery. The 15 second aesthetic measure, that of informational aesthetics based on entropy alone failed 16 to provide useful discrimination among the images or the conditions of their modification. 17 A third measure, derived from the concepts of entropy maximization, as well as the 18 hypothesized preference of observers for “simpler”, i.e., more compressible, images, 19 yielded qualitatively the same results as the more traditional version of the measure. 20 Differences among the photographs and the conditions of their modification were more 21 clearly defined with this metric, however. 22

negative: A Syllable-based Technique for Word Embeddings of Korean Words Word embedding has become a fundamental component to many NLP tasks such as named entity recognition and machine translation. However, popular models that learn such embeddings are unaware of the morphology of words, so it is not directly applicable to highly agglutinative languages such as Korean. We propose a syllable-based learning model for Korean using a convolutional neural network, in which word representation is composed of trained syllable vectors. Our model successfully produces morphologically meaningful representation of Korean words compared to the original Skip-gram embeddings. The results also show that it is quite robust to the Out-of-Vocabulary problem.

negative: Anti-phishing based on automated individual white-list In phishing and pharming, users could be easily tricked into submitting their username/passwords into fraudulent web sites whose appearances look similar as the genuine ones. The traditional blacklist approach for anti-phishing is partially effective due to its partial list of global phishing sites. In this paper, we present a novel anti-phishing approach named Automated Individual White-List (AIWL). AIWL automatically tries to maintain a white-list of user's all familiar Login User Interfaces (LUIs) of web sites. Once a user tries to submit his/her confidential information to an LUI that is not in the white-list, AIWL will alert the user to the possible attack. Next, AIWL can efficiently defend against pharming attacks, because AIWL will alert the user when the legitimate IP is maliciously changed; the legitimate IP addresses, as one of the contents of LUI, are recorded in the white-list and our experiment shows that popular web sites' IP addresses are basically stable. Furthermore, we use Naïve Bayesian classifier to automatically maintain the white-list in AIWL. Finally, we conclude through experiments that AIWL is an efficient automated tool specializing in detecting phishing and pharming.

negative: perspectives on Bitcoin and second-generation cryptocurrencies Bitcoin has emerged as the most successful cryptographic currency in history. Within two years of its quiet launch in 2009, Bitcoin grew to comprise billions of dollars of economic value, even while the body of published research and security analysis justifying the system’s design was negligible. In the ensuing years, a growing literature has identified hidden-butimportant properties of the system, discovered attacks, proposed promising alternatives, and singled out difficult future challenges. This interest has been complemented by a large and vibrant community of open-source developers who steward the system, while proposing and deploying numerous modifications and extensions. We provide the first systematic exposition of the second generation of cryptocurrencies, including Bitcoin and the many alternatives that have been implemented as alternate protocols or “altcoins.” Drawing from a scattered body of knowledge, we put forward three key components of Bitcoin’s design that can be decoupled, enabling a more insightful analysis of Bitcoin’s properties and its proposed modifications and extensions. We contextualize the literature into five central properties capturing blockchain stability. We map the design space for numerous proposed modification, providing comparative analyses for alternative consensus mechanisms, currency allocation mechanisms, computational puzzles, and key management tools. We focus on anonymity issues in Bitcoin and provide an evaluation framework for analyzing a variety of proposals for enhancing unlinkability. Finally we provide new insights on a what we term disintermediation protocols, which absolve the need for trusted intermediaries in an interesting set of applications. We identify three general disintermediation strategies and provide a detailed comparative cost analysis. I. WHY BITCOIN IS WORTHY OF RESEARCH Consider two opposing viewpoints on Bitcoin in straw-man form. The first is that “Bitcoin works in practice, but not in theory.” At times devoted members of the Bitcoin community espouse this philosophy and criticize the security research community for failing to discover Bitcoin, not immediately recognizing its novelty, and still today dismissing its importance due to a lack of rigorous theoretical foundation. A second viewpoint is that Bitcoin hopelessly relies on an unknown combination of socio-economic factors for its current stability which are intractable to model with sufficient precision, failing to yield a convincing argument for the system’s soundness. Given these difficulties, experienced security researchers may avoid Bitcoin as a topic of study, considering it prudent security engineering to only design systems with precise threat models that admit formal security proofs. We strongly dismiss both of these simplistic approaches and show where each viewpoint fails, forwarding new insights based on multiple examples of existing knowledge. To the first, we contend that while Bitcoin has worked surprisingly well in practice so far, there is an important role for research to play in identifying precisely why this has been possible, moving beyond a blind acceptance of the informal arguments presented with the system’s initial proposal. Furthermore, it is crucial to understand whether Bitcoin will still “work in practice” as practices change. We expect external political and economic factors to evolve, and the system must change if and when transaction volume scales, and the nature of the monetary rewards for Bitcoin miners will change over time as part of the system design. It is not enough to argue that Bitcoin has worked from 2009–2014 and will therefore continue likewise. We do not yet have sufficient understanding to conclude with confidence that Bitcoin will continue to work well in practice, and that is a crucial research challenge that requires insight from computer science theory. To the second viewpoint, we contend that Bitcoin is filling an important niche by providing a virtual currency system without any trusted parties and without pre-assumed identities among the participants. Within these constraints, the general problem of consensus in a distributed system is impossible [5], [81] without further assumptions like Bitcoin’s premise that rational (greedy) behavior can be modeled and incentives can be aligned to ensure secure operation of the consensus algorithm. Yet these constraints matter in practice, both philosophically and technically, and Bitcoin’s approach to consensus within this model is deeply surprising and a fundamental contribution. Bitcoin’s core consensus protocol also has profound implications for many other computer security problems beyond currency1 such as distributed naming, secure timestamping and commitment, generation of public randomness, as well as many financial problems such as self-enforcing (“smart”) contracts, decentralized markets and order books, and distributed autonomous agents. In short, even though Bitcoin is not easy to model, it is worthy of considerable research attention as it may form the basis for practical solutions to exceedingly difficult and important problems. II. OVERVIEW OF BITCOIN A. A Contextualized History We refer the interested reader to existing surveys on the “first wave” of cryptocurrency research [13], [82]. In short, cryptographic currencies date back to Chaum’s proposal for 1As we shall see, it may not be possible to remove the currency functionality and still have a working consensus system. “untraceable payments” in 1983 [22], a system involving bankissued cash in the form of blindly signed coins. Unblinded coins are transferred between users and merchants, and redeemable after the bank verifies they have not been previously redeemed. Blind signatures prevent the bank from linking users to coins, providing unlinkability akin to cash. Throughout the 1990s, many variations and extensions of this scheme were proposed. Significant contributions include: removing the need for the bank to be online at purchase time [23], allowing coins to be divided into smaller units [80] and improving efficiency [21]. Several startup companies including DigiCash [95] and Peppercoin [87] attempted to bring electronic cash protocols into practice but ultimately failed in the market. In fact, no schemes from this “first wave” of cryptocurrency research achieved significant deployment. Moderately hard “proof-of-work” puzzles were proposed in the early 1990s for combatting email spam [34] (although it was never widely deployed for this purpose [59]). Many other applications followed, including proposals for a fair lottery [41], minting coins for micropayments [88], and preventing various forms of denial-of-service and abuse in anonymous networks [8]. The latter, Hashcash, was an alternative to using digital micropayments (e.g., NetBill [98] and Karma [107]). Proof of work was also used to detect sybil nodes in distributed peer-to-peer consensus protocols [5], and is used in Bitcoin consensus for a similar reason. Another essential element of Bitcoin is the public ledger, which makes double-spending detectable. In auditable ecash [93], [94], proposed in the late 1990s, the bank maintains a public database to detect double-spending and ensure the validity of coins, however the notion of publishing the entire set of valid coins was dismissed as impractical (only a Merkle root was published instead). B-money [29], proposed in 1998, appears to be the first system where all transactions are publicly (anonymously) broadcast and stored. Proposed on the Cypherpunks mailing list, b-money received minimal attention from the academic research community. Smart contracts [102], proposed in the early 1990s, enable parties to formally specify an enforceable agreement using cryptography and scripts. This idea portends Bitcoin’s scripting capabilities. In 2008, Bitcoin was announced and a white paper penned under the pseudonym Satoshi Nakamoto was posted to the Cypherpunks mailing list [77], followed quickly the source code of the original reference client. Bitcoin’s genesis block was mined on or around January 3, 2009.2 The first use of Bitcoin as a currency is thought to be a transaction in May 2010, where one user ordered pizza delivery for another in exchange for 10 000 bitcoins. Since then, increasing number of merchants and services have incorporated Bitcoin in some way, and the price has generally risen, reaching a peak of approximately $1400USD per coin in July 2013. Bitcoin’s history has also been colored by association with 2Famously, the first block contains the string “The Times 03/Jan/2009 Chancellor on brink of second bailout for banks.” crime. Bitcoin was famously used in a black market website, Silk Road [24], which operated from Feb. 2011 until Oct. 2013 when it was seized and shut down by the FBI. Botnets have found Bitcoin mining to be a supplemental source of income [46]. A current US federal court case involves a large Bitcoin-based Ponzi scheme [97]. In 2014, a computer virus called CryptoLocker extorted millions of dollars from victims by encrypting their files and demanding a Bitcoin ransom to release the decryption key [38]. Many users’ Bitcoins have been lost due to theft [33] and collapsed exchanges [75]. B. A Technical Overview We present Bitcoin’s current operation through its three main technical components: transactions (including scripts), the consensus protocol, and the communication network. Bitcoin is exceedingly complex—our goal is to present the system with sufficient technical depth, so the extant literature on Bitcoin, reviewed and evaluated in later sections of this paper, becomes understandable. In particular, a key benefit of our three-component breakdown is that it makes evaluating and systematizing proposed changes (Sections V & VIII) insightful by “decoupling” concepts that may be changed independently. Sources of information on Bitcoin. Bitcoin can be difficult to define as there is no formal

negative: O Bitcoin Where Art Thou? Insight into Large-Scale Transaction Graphs Bitcoin is a rising digital currency and exemplifies the growing need for systematically gathering and analyzing public transaction data sets such as the blockchain. However, the blockchain in its raw form is just a large ledger listing transfers of currency units between alphanumeric character strings, without revealing contextually relevant real-world information. In this demo, we present GraphSense, which is a solution that applies a graph-centric perspective on digital currency transactions. It allows users to explore transactions and follow the money flow, facilitates analytics by semantically enriching the transaction graph, supports path and graph pattern search, and guides analysts to anomalous data points. To deal with the growing volume and velocity of transaction data, we implemented our solution on a horizontally scalable data processing and analytics infrastructure. Given the ongoing digital transformation in financial services and technologies, we believe that our approach contributes to development of analytics solutions for digital currency ecosystems, which is relevant in fields such as financial analytics, law enforcement, or scientific research.

negative: Blockchain — Literature survey In the modern world that we live in everything is gradually shifting towards a more digitized outlook. From teaching methods to online transactions, every small aspect of our life is given a more technological touch. In such a case “money” is not left behind either. An approach towards digitizing money led to the creation of “bitcoin”. Bitcoin is the most efficient crypto-currency so far in the history of digital currency. Ruling out the interference of any third party which monitors the cash flow, Bitcoin is a decentralized form of online currency and is widely accepted for internet transactions all over the world. The need for digital money would be extensive in the near future.

negative: ETHEREUM: A SECURE DECENTRALISED GENERALISED TRANSACTION LEDGER The blockchain paradigm when coupled with cryptographically-secured transactions has demonstrated its utility through a number of projects, with Bitcoin being one of the most notable ones. Each such project can be seen as a simple application on a decentralised, but singleton, compute resource. We can call this paradigm a transactional singleton machine with shared-state. Ethereum implements this paradigm in a generalised manner. Furthermore it provides a plurality of such resources, each with a distinct state and operating code but able to interact through a message-passing framework with others. We discuss its design, implementation issues, the opportunities it provides and the future hurdles we envisage.

negative: Block Chain Technologies & The Semantic Web : A Framework for Symbiotic Development The concept of peer-to-peer applications is not new, nor is the concept of distributed hash tables. What emerged in 2008 with the publication of the Bitcoin white paper was an incentive structure that unified these two software paradigms with a set of economic stimuli to motivate the creation of a dedicated computing network orders of magnitude more powerful than the world’s fastest supercomputers. The purpose of which is the maintenance of a massive distributed database known as the Bitcoin “block chain”. Apart from the digital currency it enables, block chain technology is a fascinating new computing paradigm with broad implications for the future development of the World Wide Web, and by extension, the further growth of Linked Data and the Semantic Web. This work is divided into two main sections, we first demonstrate how block chain technologies can contribute toward the realization of a more robust Semantic Web, and subsequently we provide a framework wherein the Semantic Web is utilized to ameliorate block chain technology itself.

negative: An Improved Lexicographical Sort Algorithm of Copy-move Forgery Detection As a technique for digital image tampering, copy-move forgery is frequently used. In this paper, an improved lexicographical sort algorithm based on discrete cosine transform (DCT) is developed to detect copy-move forgery. Firstly, the image is split into 8*8 blocks, and the image data undergoes a DCT. Then the DCT coefficients were grouped to reduce the dimension according to the frequency property. Finally, the distance of eigenvectors, instead of the DCT coefficients, was taken as the eigenvalue to fulfill the block matching. Experiments results showed that the false matching ratio of the proposed algorithm was reduced while the detecting ability was maintained.

negative: Who Uses Bitcoin? An exploration of the Bitcoin community Many cryptocurrencies have come into existence in recent years, with Bitcoin the most prominent among them. Although its short history has been volatile, the virtual currency maintains a core group of committed users. This paper presents an exploratory analysis of Bitcoin users. As a virtual currency and peer-to-peer payment system, Bitcoin may signal future challenges to state oversight and financial powers through its decentralized structure and offer of instantaneous transactions with relative anonymity. Very little is known about the users of Bitcoin, however. Utilizing publicly available survey data of Bitcoin users, this analysis explores the structure of the Bitcoin community in terms of wealth accumulation, optimism about the future of Bitcoin, and themes that attract users to the cryptocurrency. Results indicate that age, time of initial use, geographic location, mining status, engaging online discourse, and political orientation are all relevant factors that help explain various aspects of Bitcoin wealth, optimism, and attraction.