For companies to have a competitive advantage, they need to extract relevant information from data and for that, they need to complement their own data with other data sources. Data marketplaces are platforms on which data providers and data consumers do business. However, every data interaction incurs a monetary cost. Therefore, data consumers are interested in buying a set of interesting views that fit their (goal and) budget. Views allow data to be represented visually, enabling users to make sense of patterns and insights. Besides allowing for easier cost control, buying a set of views bundled together increases the chance of finding what consumers want over buying them view-by-view. Selecting the suitable views to compose an interesting bundle is non-trivial, due to the vast number of view combinations that potentially meet the data consumer’s needs. In this paper, we address the problem of view bundle recommendation in data marketplaces, in which the utility of a bundle depends on the interplay among candidate views. We propose the use of Self-Organizing Maps as a means to compute this interplay and use a Genetic Algorithm to design near-optimal bundles. Our empirical results demonstrate that our approach can effectively aid data consumers to find relevant view bundles under budget constraints.

Indoor Localization Systems (ILS) are increasingly applied in various use cases, such as tracking the position and movement of staff or equipment within buildings. Creating and applying these systems requires decisions about measuring and transmitting signals, the algorithm transforming signals into position estimations as well as the representation displayed to the user. One approach gaining significance recently in this context are Mesh Networks. A Mesh Network enables single nodes to exchange information with other nodes directly and dynamically, increases the error-tolerance, and facilitates the setup by reducing installation overhead. This paper studies the applicability of Bluetooth Mesh Networking technology for ILS by means of an experimental setup. The quality of localization is evaluated depending on different inference approaches as well as the scalability of the Bluetooth Mesh Technology. As initial results show, ILS based on Bluetooth Mesh Networks provide similar results regarding the accuracy of localization compared to other underlying technologies, such as Wi-Fi mesh networks, and can be set up with lower effort and costs. However, the underlying Bluetooth technology limits the scalability of the mesh network, especially in case of permanent localization of nodes.

With the increasing availability and production of data, data-driven decision-making has been largely adopted by people and organizations. However, finding and purchasing data suitable for a specific purpose and addressing unique (and sometimes) personal requirements is still a challenge. Alternative solutions to the traditional data commerce, the data marketplaces, are of almost no help for novice buyers, as the number of datasets that are available to purchase is often massive. To alleviate this problem, we consider an intelligent decision support approach for helping buyers, particularly inexperienced ones, to better search and evaluate data offerings. The contribution of this work consists of a preference recommendation strategy that focuses a buyer's attention towards more appropriate offers while enhancing his or her awareness of the market. An experimental case is designed to show the feasibility and effectiveness of the approach. The results obtained demonstrate that preference recommendation has the potential to suggest unexpected, yet useful data offerings to buyers.

The Big Data era is affording a paradigm change on decision-making approaches. More and more, companies as well as individuals are relying on data rather than on the so called "gut feeling" to make decisions. However, searching the Web for carrying out purchases is not completely satisfactory yet, given the arduousness of finding suitable quality data. This has contributed to the emergence of data marketplaces as an alternative to traditional data commerce, as they provide appropriate online environments for data offering and purchasing. Nevertheless, as the number of available datasets to purchase increases, the task of buying appropriate offers is, very often, challenging. In this sense, we propose an intelligent decision support system to help buyers in purchasing data offers based on a multiple-criteria decision analysis. Experimental results show that our approach provides an interactive way that addresses buyers' needs, allowing them to state and easily refine their preferences, without any specific order, via a series of dataset recommendations.

Web services have become popular as a vehicle for the design, integration, composition, reuse, and deployment of distributed and heterogeneous software. However, although industry standards for the description, composition, and orchestration of Web services have been under development, their conceptual underpinnings are not fully understood. Conceptual models for service specification are rare, as are investigations based on them. This paper presents and studies a multi-level service composition model that perceives service specification as going through several levels of abstraction. It starts from transactional operations at the lowest level and abstracts into activities at higher levels that are close to the service provider or end user. The authors treat service composition from a specification and execution point of view, where the former is about composition logic and the latter about transactional guarantees. Consequently, the model allows for the specification of a number of transactional properties, such as atomicity and guaranteed termination, at all levels. Different ways of achieving the composition properties and implications of the model are presented. The authors also discuss how the model subsumes practical proposals like the OASIS Business Transaction Protocol, Sun’s WS-TXM, and execution aspects of the BPEL4WS standard.

Web-oriented Architectures provide a way of designing an IT system by using a variety of Web Procedures, i.e., procedures (or services) called over the Web. The idea of (typically atomic) components that are black boxes, have interfaces, and can be assembled into a larger process is fundamental and has existed since the early days of distributed systems. Two particular types of modern distributed systems are Service-oriented Architectures and Resource-oriented Architectures, which are built upon specific technology stacks and define their own concepts. Web-oriented Architecture (WOA) is using the best of both worlds plus some specifics such as Web APIs, in order to build an interconnected IT system in the easiest way possible. In this paper we first sharpen our understanding of the concept behind a WOA, the topology of a WOA and possible integration scenarios within an enterprise. More importantly, we point out how governance and control of a WOA can be achieved, by using a controlling software element called the Web Architecture Controller (WAC) which specifies the Web-centric core elements of a WOA.

Mobile RFID-enhanced applications ("mobile RFID") offer a unique way of interacting with the physical world by using the touch paradigm. They offer an intuitive way to interact with physical objects to which RFID transponders are attached. However, the development of mobile RFID applications is not well supported yet, in contrast to stationary RFID applications where typically RFID middleware components are used to integrate RFID technology into information systems. Our ID-services RFID middleware architecture applies the idea of a dedicated RFID middleware component to mobile information systems and addresses their different requirements with a flexible integration approach based on graduated abstraction and complexity hiding. A major feature of ID-services is the use of "proxy objects" which allow a transparent interaction with objects from the physical world in the same way as with objects from an object-oriented programming paradigm. We propose a design and development methodology for the use of ID-Services that helps speeding up the development process of mobile RFID applications and keeps both design and implementation phases simple, by fully externalizing the complex, RFID-specific concepts and technical details to the ID-services middleware.

Service-oriented architectures (SOAs) have been discussed intensively in science and industry since their first appearance in the mid-nineties. However, even today there is no generally accepted method for modeling a SOA or for converting other concepts (e.g., monolithic architectures, CORBA landscapes) into a SOA. There are numerous standards available in the SOA context, but instead of easing the creation of a SOA, they typically make their realization more complicated. On the other hand, recent developments in the Web 2.0 context show how easy it can be to link or compose ("mesh'') IT components dynamically, so that original SOA goals like flexibility or reduction of complexity can be achieved by relatively simple means. An interesting concept in this context is the Web-oriented architecture (WOA), which represents a specialization of SOAs obtained by using simple Web 2.0 technologies and standards. Since for a WOA no generally accepted modeling techniques are available either, this paper reviews SOA models in light of their applicability to WOAs. A case study is used to discuss a possible realization and to preliminarily investigate the question of whether the intended simplicity can indeed be achieved.

Hyperlinks are a well understood and widely used concept in many applications. Particularly the Web has promoted the concept of "clickable " links to users. Typically, hyperlinks are only used to interact with applications and content in the "virtual" sphere of information systems. However, the basic idea of a hyperlink, which is creating an inviolable link between two resources, can be extended to the physical world as well and then allows a much closer and more intuitive interaction with information systems in many scenarios. We describe how RFID tags can be used to implement physical hyperlinks that establish a direct connection between a physical object and a mobile information system. Any kind of mobile, object-centered information system, such as the PDA-based visitor information system for museums MoVIS presented in this paper, provides a richer experience for users when it is extended into the physical world with physical hyperlinks.

THE Semantic Web has recently emerged as a new and highly promising context for knowledge and data engineering. Within an atmosphere of high expectations, many myths as well as many visions have exhibited a number of different approaches for the exploitation of the Semantic Web in both academia and industry. However, a struggling business reality requires a concrete strategy as well as the development of specific competencies from the knowledge and data engineering community in order to prove the value of the Semantic Web to society. For three years, we have undertaken a significant effort to cultivate the Semantic Web vision in the computer science, information systems, and Semantic Web communities through the Special Interest Group on Semantic Web and Information Systems of the Association for Information Systems (AIS, see http://www.aisnet.org [1], [8]). We have emphasized the benefits of the Semantic Web merits in different application contexts, including digital libraries, e-government, knowledge management, health care, and e-learning [3], [4], [5], [6]. One of the most fascinating aspects of our effort is the exchange of ideas with people that come from different disciplines, which has led us to arrive at the conclusion that the Semantic Web adoption requires the convergence of many different disciplines; this is illustrated in Fig. 1. It is more than obvious that, after an early stage of evolution, Semantic Web research has reached a first level of maturity. Most significantly, some “voices” of criticism or questioning for the pace of the change that Semantic Web brings to traditional knowledge and data engineering have initiated a new stream of innovations. The concept of semantics [2] and its capacity to support a new era of applications challenges the traditional perceptions for the never-ending journey of computing. Knowledge and data representation and retrieval require new conceptual models and the move to a human Semantic Web vision seems more timely than ever. After the initial enthusiasm and excitement following the launch of the Semantic Web vision, a time of significant problems, unexploited opportunities, and slow adoption followed. Knowledge and data engineering had to meet several diverse and high demanding requirements for the realization of the Semantic Web. In numerous international efforts as well as in various research and competence centers of the Semantic Web, there is now a continuous effort to reach the point for a real “take-off” of the Semantic Web. It looks like an entire research community is looking for the last step before the breaking of the “wall.” And, this wall is associated with all the inefficiencies of the traditional Web, and with a panacea for the solution of all the knowledgerelated performance gaps. For the past one and a half years, we have been working hard, with the support of a large number of reviewers, on the development of an excellent quality TKDE special issue on the Semantic Web. From the beginning, our motivation was based on a clear belief that the Semantic Web represents a key milestone for the knowledge and data engineering community. While the Semantic Web is often considered to be a machine-intensive/oriented theme, our key argumentation is that Semantic Web is a Human manifesto [7]. The fundamental social and political impact of the Semantic Web is derived from the fact that its underlying technology supports a shift of social interaction patterns from “knowledge push” to “knowledge pull” [7]. This includes the shift

The importance of metadata for e-Learning is undisputed, particularly in terms of the Semantic Web. Based on metadata standards such as LOM (Learning Object Metadata), e-Learning repositories can offer an effective and efficient search for e-Learning content. The emerging paradigm of Service-Oriented Architectures (SOAs) enables developers to implement open systems instead of monolithic ones. Well-defined interfaces for distributed systems have to be provided to enable easy integration of functionalities. In this context it is important to build the entire system architecture on a suitably chosen metadata standard. The e-Learning Repository share.loc presented in this paper uses special implementations of LOM within its different tiers of the entire architecture. An additional service tier that is implemented vertically to the common application tiers enables remote systems to request LOM-compliant representations of metadata from each tier that are tailored towards their individual needs.

An important research topic in the field of e-learning platform architectures focuses on service orientation. Although service-oriented architectures (SOAs) are well-understood in the field of software engineering, the e-learning community has started only recently to discuss SOAs for e-learning. This paper takes a closer look at the implications of service orientation on SCORM, because this new type of e-learning platform architecture offers a different way of reusing content and functionalities. SCORM is widely accepted by e-learning manufacturers to establish a distributed learning environment model that fosters the interoperability of learning tools and course content. It is near at hand to use the SCORM approach also for service-oriented e-learning environments. However, as is shown in this paper, several improvements have to be executed to specify a SCORM version for a SOA

Digital multimedia devices for private usage have nowadays left their analogous counterparts behind. Our homes increasingly incorporate a digital communication infrastructure for interconnecting their various devices inside the house, and this infrastructure also gives access to external information via the Internet. Thus, we now store much of our personal information in digital form and information services like newspaper, radio, or TV are digitally available. The capacity of digital storage devices provides enormous space at affordable prices to save all this digital information into a giant personal multimedia archive; however, as is well known, the more data we store, the less information we have at our disposal. In this article, an approach to personal information management is described that is based on Semantic Web technology. In particular, the design decisions behind, and core features of OntoMedia, a software system based on a multimedia ontology that is intended for personal usage, are presented. OntoMedia supports users organizing personal multimedia archives using ontology powered metadata extraction and integration technology. The application includes a novel, easy to use graphical user interface to organize documents in categories and browse/query the semantic database.

The provision of e-learning content through the emerging paradigm of Web services leads to a number of advantages over traditional, centralized e-learning platforms which store learning objects in their own database. This is on the one hand the timeliness of content since it is stored on remote machines and called on demand only. Decentralized storage makes content improvements readily available for all learners. On the other hand, content is now available for a larger group of users since it is no longer stored in closed platforms. However, the composition of content into courses needs new strategies, as content cannot simply be copied and assembled to packaging interchange files (PIF) as specified by IMS and SCORM. In this paper, we show different ways how a mediator can offer courses that are based on the Web services paradigm. In particular, we describe how a repository in a distributed architecture can be enhanced to provide added value for learners, by offering courses built from content services that are available on the Web.

Web services are rapidly becoming popular as a vehicle for the design, integration, composition, and deployment of distributed and heterogeneous software. However, while industry standards for the description, composition, and orchestration of Web services have been under discussion (and development) for quite some time already, their conceptual underpinnings are still in their infancy. Indeed, conceptual models/or service specification are rare so far, as are investigations based on them. This paper presents a multilevel service composition model that perceives service specification as going through several levels of abstraction, from transactional operations to the end user. Importantly, the model allows for specification of desirable composition properties at all levels. Different ways of achieving these properties as well as implications of the model are addressed.

Learning objects are under discussion in the context of electronic and in particular Web-based learning. Intuitively, they represent reusable units of learning content that can be consumed or studied within a single learning session, and that can be sequenced into larger units such as classes and courses if necessary or desired. To achieve these goals, making learning objects amenable to the technical support of a database system appears appropriate. Once this view is in place, learning objects can be used as the central and uniform foundation of an e-learning platform that, for example, is capable of tracking users or of adapting content to users, and that can simultaneously handle a company's knowledge management. It is shown in this paper how the latter can be achieved through a common exploitation of (and interaction between) database objects and suitably designed processes.

E-learning has been a topic of increasing interest in recent years. It is often perceived as a group effort, where content authors, instructional designers, multimedia technicians, teachers, trainers, database administrators, and people from various other areas of expertise come together in order to serve a community of learners. In a typical e-learning scenario, many of the activities can be perceived and modeled as processes and consequently be executed as workflows; there are even prototypical system developments that are experimenting with this approach. On the other hand, there are increasingly many activities, which aim at providing services of any kind on the Web; these can occur as business-to-business or as business-to-consumer services and are generally subsumed under the term Web services. In this paper we suggest to combine the areas of e-learning and Web services, by providing electronic learning offerings as (individual or collections of) Web services as well. We elaborate on this by showing how content providers and content consumers (i.e., learners) can communicate appropriately through a Web service platform with its common description, publication, and retrieval functionalities. Finally, we indicate how a corresponding system can be realized.

Views as a means to describe parts of a given data collection play an important role in many database applications. In dynamic environments where data is updated, not only information provided by views, but also information provided by data sources yet missing from views turns out to be relevant: Previously, this missing information has been characterized in terms of view complements ; recently, it has been shown that view complements can be exploited in the context of data warehouses to guarantee desirable warehouse properties such as independence and self-maintainability. As the complete source information is a trivial complement for any view, a natural interest for "small" or even "minimal" complements arises. However, the computation of minimal complements is still not very well understood. In this article, it is shown how to compute reasonably small (and in special cases even minimal) complements for a large class of relational views.

e-learning has become an important topic, both in academia and industry. This paper reports on a newly created Web-based platform, called eXtreme e-Learning eXperience (XLX), to perform exercise work of technically oriented graduate-level university courses, in support of blended learning. In addition to providing a course portal with traditional teaching material, an e-mail list, and a discussion forum, XLX's main contribution lies in a personalized training section that allows transparent access to underlying (possibly commercial) third-party systems such as database systems, XSLT processors, or workflow management systems for hands-on experience and increased students' motivation.

Data warehouses present a powerful framework for storing and analyzing huge amounts of data. In this context analyses focus on data that has been gathered over long periods of time, often between one and five years. A data warehouse can therefore be regarded as a specialized historical database. However not only the data kept in a data warehouse has to be seen in a temporal context, but also the fact that dimension data may undergo changes during such a time period needs to be taken into consideration. In this paper we focus on update operations on dimensions and establish a notion of consistency for guiding such operations. We devise algorithms for executing update operations that can be shown to preserve consistency, and we study their time complexity.

Views as a means to describe parts of a given data collection play an important role in many database applications. In dynamic environments, where data is updated, not only information provided by views, but also information provided by data sources but missing from views turns out to be relevant: Previously, this missing information was characterized in terms of view complements; recently, it was shown that view complements can be exploited in the context of data warehouses to guarantee desirable warehouse properties such as independence and self-maintainability. As the complete source information is a trivial complement for any given view, a natural interest for "small" or even "minimal" complements arises. However, the computation of minimal complements is still not too well understood. In this paper, we show how to compute reasonably small (and in special cases even minimal) complements for monotonic relational views, where the complexity of constructing complements is polynomial in the size of schema information.

Finding information in diverse sources, in particular on the World-Wide Web is highly relevant these days. As more and more Web sites are administered by database systems, and as information on and off the Web increasingly comes out of a database, it is crucial to be able to search databases when working with the Web. This paper introduces a novel query language which renders it possible to formulate queries to databases in the absence of schema-knowledge. The proposed language Schema-Independent SQL (SISQL) takes parameterized SQL queries as input and dynamically generates correct SQL statements for collections of underlying schemata. SISQL is based on the Reflective Relational Algebra as a "processing engine,", which has been proposed in recent years for overcoming the limitations of classical algebra w.r.t. the treatment of procedural data.

The quest for unified correctness criteria in database concurrency control is addressed from a new perspective. A family of Herbrand semantics is presented, where each semantics provides an interpretation for operations in the read-write model of transactions. Using commutativity arguments, each semantics leads to a notion of conflict, which then gives rise to distinct classes of serializable schedules. Surprisingly, the classical notion of serializability with respect to two of these sematics, update-in-place and deferred-update semantics, already embodies a unified correctness criterion; moreover, prefix-closed variants of it allow for a higher degree of transaction parallelism than, for example, prefix-reducibility. Finally, it is shown that previous criteria may permit undesirable schedules, which are ruled out by a stronger notion of serializability that captures all intuitively correct schedules, but is incomparable to prefix-reducibility and the classes of schedules recognized by optimistic protocols.

Views over databases have recently regained attention in the context of data warehouses, which are seen as materialized views. In this setting, efficient view maintenance is an important issue, for which the notion of self-maintainability has been identified as desirable. We extend self-maintainability to (query and update) independence, and we establish an intuitively appealing connection between warehouse independence and view complements. Moreover, we study minimal complements and show how to compute them in the presence of key constraints and inclusion dependencies in the underlying databases. Taking advantage of these complements, an algorithm is outlined for the specification of independent warehouses.

Article Free Access Share on The WASA2 object-oriented workflow management system Authors: Gottfried Vossen University of Münster, Germany University of Münster, GermanyView Profile , Mathias Weske University of Münster, Germany University of Münster, GermanyView Profile Authors Info & Claims SIGMOD '99: Proceedings of the 1999 ACM SIGMOD international conference on Management of dataJune 1999Pages 587–589https://doi.org/10.1145/304182.304586Published:01 June 1999Publication History 26citation995DownloadsMetricsTotal Citations26Total Downloads995Last 12 Months21Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

In this work a new distributed deadlock resolution algorithm for the OR model is proposed. The algorithm verifies the correctness criteria: safety-false deadlocks are not resolved; and liveness-deadlocks are resolved in finite time.

This paper introduces and studies the relational meta a1gebra, a statically typed extension of the relational algebra to nllow for m&a programming in databases.In this meta algebra one can manipulate database relations involving not only stored data values (as in classical relational databases) but also stored relational algebra expressions.Topics diicussed include modeling of advanced database applications involving "procedural data"; desirability as well as limitations of a strict typing discipline in this context; equivalence with a first-order calculus; and global expressive power and non-redundancy of the proposed formalism.

DNA fragment assembly is an area which makes intensive use of computers. However, computer users in this field are typically not experts in computer science, but build their working environment on an ad-hoc basis. In this situation, it seems appropriate to offer a kind of support which can contribute to a better organization of working environments, and a better exploitation of computer hardware and software. The authors describe an approach in this direction based on the emerging paradigms of workflow modeling and management. In particular they offer three contributions: first, they discuss why workflow management can be fruitfully adopted in DNA fragment assembly, and describe one way to perceive and model sequencing processes as workflows. Second, they outline an architecture of a system intended to support sequencing applications, whose core component is a workflow management system. Finally, they sketch their experience of building a prototype using commercial workflow management technology.

In reflective programming languages it is possible for a program to generate code that is integrated into the program's own execution. We introduce a reflective version of the relational algebra. Reflection is achieved by storing and manipulating relational algebra programs as relations in the database. We then study the expressibility and complexity of the reflective algebra thus obtained. It turns out that there is a close correspondence between reflection and bounded looping. We also discuss the applicability of the reflective algebra.

A theoretical framework for wait-for systems is provided, and general characteristics of a correct algorithm for deadlock detection and resolution are presented. It is shown that the computational upper bounds (number of messages) for deadlock detection and resolution are both O(n/sup 3/) in the worst case when n transactions are involved. This result is better than previous ones, which often are even exponential. Two correct deadlock detection and resolution algorithms are described which both achieve these upper bounds.>

A database system that is based on the universal relation (UR) model aims at freeing its users from specifying access paths on both the physical and on the logical levels. All information about the logical structure of the database (i.e., its conceptual scheme) is hidden from users; they need only to know the attribute names, which now carry all the semantics of the database. Previous work on UR interfaces has concentrated on the design and implementation of query languages that serve to facilitate retrieval of data from a relational database. On the other hand, updates are always handled as before, which means that users still have to know the logical structure of the database in case they want to insert, delete, or modify tuples. In this paper the concepts underlying a UR interface, which is really “universal,” are presented; it is based on the UR model, and it permits not only queries but also updates: Combinations of attributes that may participate in an update-operation ("objects") have to be specified during the design phase of the database, and are then embodied into the database scheme by an extended synthesis algorithm. They form the basis for any insertion or deletion operation. A precise definition of “insertable” tuples, and of the insert- and delete-operation in this new context, is given. It is then shown that these operations modify a database state in such a way that a representative instance always exists. This is accomplished by providing a more detailed version of Sagiv's uniqueness condition and by exploring the structure of nonunique objects. Since the underlying database always has a representative instance, this instance can be used to define the window function for retrieval. It is shown that it is still possible to compute windows by a union of minimal extension joins.

Article Updating a relational database through a universal schema interface Share on Authors: Volkert Brosda View Profile , Gottfried Vossen View Profile Authors Info & Claims PODS '85: Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systemsMarch 1985 Pages 66–75https://doi.org/10.1145/325405.325414Online:25 March 1985Publication History 12citation73DownloadsMetricsTotal Citations12Total Downloads73Last 12 Months2Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Article Free Access Share on A high-level user interface for update and retrieval in relational databases—language aspects Authors: Gottfried Vossen Technical University of Aachen, Lehrstuhl fuer Informatik III, Buechel 29 - 31, D-5100 Aachen, West Germany Technical University of Aachen, Lehrstuhl fuer Informatik III, Buechel 29 - 31, D-5100 Aachen, West GermanyView Profile , Volkert Brosda Technical University of Aachen, Lehrstuhl fuer Informatik III, Buechel 29 - 31, D-5100 Aachen, West Germany Technical University of Aachen, Lehrstuhl fuer Informatik III, Buechel 29 - 31, D-5100 Aachen, West GermanyView Profile Authors Info & Claims SIGMOD '85: Proceedings of the 1985 ACM SIGMOD international conference on Management of dataMay 1985 Pages 343–353https://doi.org/10.1145/318898.318934Published:01 May 1985Publication History 1citation262DownloadsMetricsTotal Citations1Total Downloads262Last 12 Months23Last 6 weeks6 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF