James A. Larson

Bio: James A. Larson is an academic researcher from Intel. The author has contributed to research in topics: Database design & User interface. The author has an hindex of 15, co-authored 31 publications receiving 3837 citations. Previous affiliations of James A. Larson include Honeywell.

Federated database systems for managing distributed, heterogeneous, and autonomous databases

Abstract: A federated database system (FDBS) is a collection of cooperating database systems that are autonomous and possibly heterogeneous. In this paper, we define a reference architecture for distributed database management systems from system and schema viewpoints and show how various FDBS architectures can be developed. We then define a methodology for developing one of the popular architectures of an FDBS. Finally, we discuss critical issues related to developing and operating an FDBS.

Guidelines for multimodal user interface design

Abstract: JMUI (Journal on Multimodal User Interfaces), Special issue “Best of affective computing and intelligent Guidelines for multimodal user interface design. support, human multi-modal information processing. characteristics to the design of a user-oriented and guidelines of multimodal interface design. Artifact lifecycle management, Consumer and user, Interfaces in Automated.Aug 2 Aug 7Los Angeles, CA, USAThursday, 6 August 2015 / HCI International 20152015.hci.international/thursday​CachedDefining and Optimizing User Interfaces Information Complexity for AI Design and Development of Multimodal Applications: A Vision on Key Issues and Traditional Heuristics and Industry Guidelines to Evaluate Multimodal Digital Artifacts

Method and apparatus for annotating a computer document incorporating sound

Abstract: A method and apparatus pertaining to annotating a document window on a display device of a computer-based system. An annotation window is displayed over a selected portion of the document window where the annotation window is defined by a transparent window area bounded by a border. The annotation window enables the selected portion of the document window to be visible through the annotation window. Annotations are displayed within the annotation window where the annotations have a transparent background enabling the selected portion of the document windows to be visible through the transparent background of the annotations. When the annotation window is closed, the annotations are embedded into a contained document shown in the document window so that the annotations and the document are visible simultaneously in the selected portion of the document window.

Creating and maintaining hypertext links among heterogeneous documents by the establishment of anchors and connections among anchors

Abstract: A method and apparatus for relating (called hyperlinking) a region of one document to one or more regions of other documents. This is provided by using a mechanism for linking and embedding objects to establish the endpoints of the hyperlinks (called anchors) together with the creation of intermediate tables which maintain information about relations between regions of documents and attributes of the relationship. When a user selects a region in a document which participates in a relationship, a database program is invoked which displays information about related regions in other documents which may be accessed through the intermediate tables. An auxiliary table maintains information about attributes which may be custom designed by the user, such as author, date of creation, etc. The intermediate tables allow relationships among multiple regions of documents created by different applications. Relationships are bidirectional in that the user can traverse from any region in a document to any other region in the same relationship.

Method for saving and accessing desktop conference characteristics with a persistent conference object

Abstract: A method of saving, retrieving and dynamically establishing a plurality of conference parameters. A desktop conferencing system includes a plurality of nodes connected in a network. A user of the desktop conferencing system is able to manipulate a persistent conference object where a persistent conference object is an object including a plurality of items of information pertaining to a desktop conference. Each of the conference parameters are monitored, updated and saved. It is then possible to retrieve and dynamically establish conference parameters of a conference stored in a persistent conference object by: (1) prompting a user for an identifier identifying a particular persistent conference object on disk; (2) opening the specified persistent conference object by copying it from disk to memory; (3) reading the conference parameters stored in the persistent conference object in memory; and (4) implementing the conference parameters to establish the desired conference environment.

A survey of approaches to automatic schema matching

Abstract: Schema matching is a basic problem in many database application domains, such as data integration, E-business, data warehousing, and semantic query processing. In current implementations, schema matching is typically performed manually, which has significant limitations. On the other hand, previous research papers have proposed many techniques to achieve a partial automation of the match operation for specific application domains. We present a taxonomy that covers many of these existing approaches, and we describe the approaches in some detail. In particular, we distinguish between schema-level and instance-level, element-level and structure-level, and language-based and constraint-based matchers. Based on our classification we review some previous match implementations thereby indicating which part of the solution space they cover. We intend our taxonomy and review of past work to be useful when comparing different approaches to schema matching, when developing a new match algorithm, and when implementing a schema matching component.

Federated Machine Learning: Concept and Applications

Abstract: Today’s artificial intelligence still faces two major challenges. One is that, in most industries, data exists in the form of isolated islands. The other is the strengthening of data privacy and security. We propose a possible solution to these challenges: secure federated learning. Beyond the federated-learning framework first proposed by Google in 2016, we introduce a comprehensive secure federated-learning framework, which includes horizontal federated learning, vertical federated learning, and federated transfer learning. We provide definitions, architectures, and applications for the federated-learning framework, and provide a comprehensive survey of existing works on this subject. In addition, we propose building data networks among organizations based on federated mechanisms as an effective solution to allowing knowledge to be shared without compromising user privacy.

Ontology Matching

Abstract: Ontologies tend to be found everywhere. They are viewed as the silver bullet for many applications, such as database integration, peer-to-peer systems, e-commerce, semantic web services, or social networks. However, in open or evolving systems, such as the semantic web, different parties would, in general, adopt different ontologies. Thus, merely using ontologies, like using XML, does not reduce heterogeneity: it just raises heterogeneity problems to a higher level. Euzenat and Shvaikos book is devoted to ontology matching as a solution to the semantic heterogeneity problem faced by computer systems. Ontology matching aims at finding correspondences between semantically related entities of different ontologies. These correspondences may stand for equivalence as well as other relations, such as consequence, subsumption, or disjointness, between ontology entities. Many different matching solutions have been proposed so far from various viewpoints, e.g., databases, information systems, and artificial intelligence. The second edition of Ontology Matching has been thoroughly revised and updated to reflect the most recent advances in this quickly developing area, which resulted in more than 150 pages of new content. In particular, the book includes a new chapter dedicated to the methodology for performing ontology matching. It also covers emerging topics, such as data interlinking, ontology partitioning and pruning, context-based matching, matcher tuning, alignment debugging, and user involvement in matching, to mention a few. More than 100 state-of-the-art matching systems and frameworks were reviewed. With Ontology Matching, researchers and practitioners will find a reference book that presents currently available work in a uniform framework. In particular, the work and the techniques presented in this book can be equally applied to database schema matching, catalog integration, XML schema matching and other related problems. The objectives of the book include presenting (i) the state of the art and (ii) the latest research results in ontology matching by providing a systematic and detailed account of matching techniques and matching systems from theoretical, practical and application perspectives.

Mediators in the architecture of future information systems

Abstract: For single databases, primary hindrances for end-user access are the volume of data that is becoming available, the lack of abstraction, and the need to understand the representation of the data. When information is combined from multiple databases, the major concern is the mismatch encountered in information representation and structure. Intelligent and active use of information requires a class of software modules that mediate between the workstation applications and the databases. It is shown that mediation simplifies, abstracts, reduces, merges, and explains data. A mediator is a software module that exploits encoded knowledge about certain sets or subsets of data to create information for a higher layer of applications. A model of information processing and information system components is described. The mediator architecture, including mediator interfaces, sharing of mediator modules, distribution of mediators, and triggers for knowledge maintenance, are discussed. >

Principles of Distributed Database Systems

Abstract: This third edition of a classic textbook can be used to teach at the senior undergraduate and graduate levels. The material concentrates on fundamental theories as well as techniques and algorithms. The advent of the Internet and the World Wide Web, and, more recently, the emergence of cloud computing and streaming data applications, has forced a renewal of interest in distributed and parallel data management, while, at the same time, requiring a rethinking of some of the traditional techniques. This book covers the breadth and depth of this re-emerging field. The coverage consists of two parts. The first part discusses the fundamental principles of distributed data management and includes distribution design, data integration, distributed query processing and optimization, distributed transaction management, and replication. The second part focuses on more advanced topics and includes discussion of parallel database systems, distributed object management, peer-to-peer data management, web data management, data stream systems, and cloud computing. New in this Edition: New chapters, covering database replication, database integration, multidatabase query processing, peer-to-peer data management, and web data management. Coverage of emerging topics such as data streams and cloud computing Extensive revisions and updates based on years of class testing and feedback Ancillary teaching materials are available.