ORCID Profile
0000-0002-9067-5639
Current Organisation
Athena Ereunetiko Kentro
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Research Topics
In Research Link Australia (RLA), "Research Topics" refer to ANZSRC FOR and SEO codes. These topics are either sourced from ANZSRC FOR and SEO codes listed in researchers' related grants or generated by a large language model (LLM) based on their publications.
Top 5 Research Topics
ANZSRC Field of Research (FoR)
Information Systems | Database Management | Social Policy | Information Retrieval and Web Search | Communication Technology and Digital Media Studies | Analysis of Algorithms and Complexity | Community Planning | Public Policy | Urban and Regional Planning | Applied Economics | Policy and Administration | Urban and Regional Studies (excl. Planning) | Industry Economics and Industrial Organisation
ANZSRC Socio-Economic Objective (SEO)
Electronic Information Storage and Retrieval Services | Regional Planning | Social Structure and Health | Productivity (excl. Public Sector) | Application Software Packages (excl. Computer Games) | Information Processing Services (incl. Data Entry and Capture) | Technological and Organisational Innovation | Expanding Knowledge in the Information and Computing Sciences |
Related Links
Publications
Processing and Evaluating Partial Tree Pattern Queries on XML Data
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2012
A Simulation-Based Study on the Concurrent Execution of Rules in a Database Environment
Publisher: Elsevier BV
Date: 1994
DistClusTree: A framework for distributed stream clustering
Publisher: Springer International Publishing
Date: 2018
Implementing Large Production Systems in a DBMS Environment: Concepts and Algorithms
Publisher: ACM Press
Date: 1988
DOI: 10.1145/50202.50251
Effect of Healing on the Expression of Transforming Growth Factor βs and their Receptors in Chronic Venous Leg Ulcers
Publisher: Elsevier BV
Date: 11-2001
DOI: 10.1046/J.0022-202X.2001.01501.X
Abstract: The transforming growth factor betas are of major importance in the wound repair process however, no studies to date have investigated the role of the transforming growth factor beta receptors in chronic venous leg ulcers or what effect healing has on these proteins. To determine whether the transforming growth factor beta peptides and their receptors are expressed in chronic venous wounds, we used immunofluorescent analysis and quantitative competitive reverse transcription polymerase chain reaction to identify the protein and mRNA expression, respectively. Biopsy s les from wounds and normal skin were collected from 12 patients with chronic venous leg ulcers and three patients undergoing reconstructive surgery, respectively. Additionally four of the chronic venous leg ulcer patients were re-biopsied between 2 and 8 wk after the first biopsy when the wounds had entered the healing phase. The tissue excised from the ulcers included the surrounding intact skin, the ulcer edge, and the ulcer base. Immunofluorescent staining for transforming growth factors beta1, beta2, and beta3 was observed within the epidermis of the skin surrounding the chronic venous ulcers and in fibroblasts and inflammatory cells of the dermis, although this staining was not as strong as that seen in normal unwounded skin. Very little staining could be seen within the ulcers for any of the ligands, however. In contrast the transforming growth factor beta type I receptor was observed throughout the ulcers and the normal unwounded skin biopsies, particularly in the basal epidermal cells. No immunofluorescence for the type II transforming growth factor beta receptor was observed in any of the ulcer biopsies investigated, although it was observed throughout the epidermis and in fibroblasts and inflammatory cells in the surrounding skin. Quantitative, competitive reverse transcription polymerase chain reaction was used to analyze mRNA expression for transforming growth factor beta1 and the type II receptor in the nonhealing ulcers and normal unwounded skin biopsies. These studies revealed that transforming growth factor beta1 and transforming growth factor beta receptor II mRNA was expressed in all the chronic nonhealing ulcers albeit at very low levels for the type II receptor. In marked contrast to the staining observed in nonhealing chronic ulcers, positive immunostaining was observed for the transforming growth factor betas and both the type I and type II receptors in healing ulcers. These results suggest that the absence of a viable receptor complex for the transforming growth factor betas in nonhealing chronic venous ulcers may contribute to wound chronicity.
The Generalized Pre-Grouping Transformation
Publisher: Elsevier
Date: 2003
Guest Editorial Special Issue on Online Recommendation Using AI and Big Data Techniques
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2023
ExpFinder: A hybrid model for expert finding from text-based expertise data
Publisher: Elsevier BV
Date: 2023
A Ranking Mechanism for SemanticWeb Service Discovery
Publisher: IEEE
Date: 07-2007
On the Usage of Structural Distance Metrics for Mining Hierarchical Structures
Publisher: IGI Global
Date: 2006
DOI: 10.4018/978-1-59140-655-6.CH008
Abstract: The recent proliferation of XML-based standards and technologies demonstrates the need for effective management of hierarchical structures. Such structures are used, for ex le, to organize data in product catalogs, taxonomies of thematic categories, concept hierarchies, etc. Since the XML language has become the standard data exchange format on the Web, organizing data in hierarchical structures has been vastly established. Even if data are not stored natively in such structures, export mechanisms make data publicly available in hierarchical structures to enable its automatic processing by programs, scripts and agents. Processing data encoded in hierarchical structures has been a popular research issue, resulting in the design of effective query languages. However, the inherent structural aspect of such encodings has not received strong attention till lately, when the requirement for mining tasks, like clustering/classification methods, similarity ranking, etc., on hierarchical structures has been raised. The key point to perform such tasks is the design of a structural distance metric to quantify the structural similarity between hierarchical structures. The chapter will study distance metrics that capture the structural similarity between hierarchical structures and approaches that exploit structural distance metrics to perform mining tasks on them.
Fast Anomaly Detection in Multiple Multi-Dimensional Data Streams
Publisher: IEEE
Date: 12-2019
Classifying Australian citizens' responses to
COVID
‐19 preventative behaviour directives: A latent class approach
Publisher: Wiley
Date: 16-03-2023
DOI: 10.1002/CASP.2691
Abstract: The primary defence against COVID‐19 has been the implementation of public health measures that rely on voluntary compliance with behavioural directives. Compliance is often conceptualised as a single dimension, but there may be distinct patterns of compliance with COVID‐19 preventative behaviours. This study examined behavioural profiles in response to preventative behaviour directives during the early stages of the COVID‐19 pandemic in Australia. A representative s le of Australian residents ( n = 978) responded to a survey measuring self‐reported compliance with a range of preventative measures, trust in various institutions and a range of psychological and demographic variables. The latent class analysis identified five distinct behavioural profiles characterised by different degrees of compliance with different health behaviours. In addition to those who complied with most measures and those who complied with none, there were profiles that complied with most measures except specific ones, including limiting interactions with others and visitations. These profiles were associated with a number of demographic and psychological characteristics, including trust. Implications for public health interventions are discussed.
Containment of partially specified tree-pattern queries in the presence of dimension graphs
Publisher: Springer Science and Business Media LLC
Date: 26-03-2008
Efficient Algorithms for Flexible Sweep Coverage in Crowdsensing
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2018
View selection for designing the global data warehouse
Publisher: Elsevier BV
Date: 12-2001
A frame-based model for large manufacturing databases
Publisher: Springer Science and Business Media LLC
Date: 02-1991
DOI: 10.1007/BF01471336
Expert database systems: Efficient support for engineering environments
Publisher: Elsevier BV
Date: 09-1988
Edge Labeling Schemes for Graph Data
Publisher: ACM
Date: 27-06-2017
High-density mapping of the MHC identifies a shared role for HLA-DRB1*01:03 in inflammatory bowel diseases and heterozygous advantage in ulcerative colitis
Publisher: Springer Science and Business Media LLC
Date: 05-01-2015
DOI: 10.1038/NG.3176
Specifying and authoring multimedia scenarios
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 1999
DOI: 10.1109/93.790609
CUBE File: A File Structure for Hierarchically Clustered OLAP Cubes
Publisher: Springer Berlin Heidelberg
Date: 2004
Search Behavior-Driven Training for Result Re-Ranking
Publisher: Springer Berlin Heidelberg
Date: 2011
Semantics of spatially-aware windows over streaming moving objects
Publisher: Conference and Custom Publishing
Date: 05-2007
DOI: 10.1109/MDM.2007.17
The flexible socio spatial group queries
Publisher: Association for Computing Machinery (ACM)
Date: 10-2018
Abstract: A socio spatial group query finds a group of users who possess strong social connections with each other and have the minimum aggregate spatial distance to a meeting point. Existing studies limit to either finding the best group of a fixed size for a single meeting location, or a single group of a fixed size w.r.t. multiple locations. However, it is highly desirable to consider multiple locations in a real-life scenario in order to organize impromptu activities of groups of various sizes. In this paper, we propose Top k Flexible Socio Spatial Group Query (Top k-FSSGQ) to find the top k groups w.r.t. multiple POIs where each group follows the minimum social connectivity constraints. We devise a ranking function to measure the group score by combining social closeness, spatial distance, and group size, which provides the flexibility of choosing groups of different sizes under different constraints. To effectively process the Top k-FSSGQ, we first develop an Exact approach that ensures early termination of the search based on the derived upper bounds. We prove that the problem is NP-hard, hence we first present a heuristic based approximation algorithm to effectively select members in intermediate solution groups based on the social connectivity of the users. Later we design a Fast Approximate approach based on the relaxed social and spatial bounds, and connectivity constraint heuristic. Experimental studies have verified the effectiveness and efficiency of our proposed approaches on real datasets.
An Efficient Pictorial Database System for PSQL
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 05-1988
DOI: 10.1109/32.6141
Ontology-Driven Conceptual Design of ETL Processes Using Graph Transformations
Publisher: Springer Berlin Heidelberg
Date: 2009
Location-Centered House Price Prediction: A Multi-Task Learning Approach
Publisher: Association for Computing Machinery (ACM)
Date: 05-01-2022
DOI: 10.1145/3501806
Abstract: Accurate house prediction is of great significance to various real estate stakeholders such as house owners, buyers, and investors. We propose a location-centered prediction framework that differs from existing work in terms of data profiling and prediction model. Regarding data profiling, we make an important observation as follows – besides the in-house features such as floor area, the location plays a critical role in house price prediction. Unfortunately, existing work either overlooked it or had a coarse grained measurement of locations. Thereby, we define and capture a fine-grained location profile powered by a erse range of location data sources, including transportation profile, education profile, suburb profile based on census data, and facility profile. Regarding the choice of prediction model, we observe that a variety of approaches either consider the entire data for modeling, or split the entire house data and model each partition independently. However, such modeling ignores the relatedness among partitions, and for all prediction scenarios, there may not be sufficient training s les per partition for the latter approach. We address this problem by conducting a careful study of exploiting the Multi-Task Learning (MTL) model. Specifically, we map the strategies for splitting the entire house data to the ways the tasks are defined in MTL, and select specific MTL-based methods with different regularization terms to capture and exploit the relatedness among tasks. Based on real-world house transaction data collected in Melbourne, Australia, we design extensive experimental evaluations, and the results indicate a significant superiority of MTL-based methods over state-of-the-art approaches. Meanwhile, we conduct an in-depth analysis on the impact of task definitions and method selections in MTL on the prediction performance, and demonstrate that the impact of task definitions on prediction performance far exceeds that of method selections.
Multiple-query optimization
Publisher: Association for Computing Machinery (ACM)
Date: 03-1988
DOI: 10.1145/42201.42203
Abstract: Some recently proposed extensions to relational database systems, as well as to deductive database systems, require support for multiple-query processing. For ex le, in a database system enhanced with inference capabilities, a simple query involving a rule with multiple definitions may expand to more than one actual query that has to be run over the database. It is an interesting problem then to come up with algorithms that process these queries together instead of one query at a time. The main motivation for performing such an interquery optimization lies in the fact that queries may share common data. We examine the problem of multiple-query optimization in this paper. The first major contribution of the paper is a systematic look at the problem, along with the presentation and analysis of algorithms that can be used for multiple-query optimization. The second contribution lies in the presentation of experimental results. Our results show that using multiple-query processing algorithms may reduce execution cost considerably.
ARKTOS: Towards the modeling, design, control and execution of ETL processes
Publisher: Elsevier BV
Date: 12-2001
A Study on External Memory Scan-Based Skyline Algorithms
Publisher: Springer International Publishing
Date: 2014
Chorochronos
Publisher: Association for Computing Machinery (ACM)
Date: 09-1999
Preface
Publisher: World Scientific Pub Co Pte Lt
Date: 03-1992
Geo-Social Influence Spanning Maximization
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2017
HomeSeeker: A visual analytics system of real estate data
Publisher: Elsevier BV
Date: 04-2018
Joint Top-k Subscription Query Processing over Microblog Threads
Publisher: Springer International Publishing
Date: 2016
Specifications for Efficient Indexing in Spatiotemporal Databases
Publisher: IEEE Comput. Soc
Date: 1998
Message from the ICDE 2010 PhD workshop general co-chairs
Publisher: IEEE
Date: 2010
Within-Person Variability in First Impressions From Faces
Publisher: SAGE Publications
Date: 30-05-2021
DOI: 10.1177/03010066211019727
Abstract: Perceptions of an in idual can change dramatically across different images of their face. Questions remain as to whether some traits are more sensitive to image variability than others. To investigate this issue, we constructed a database of 340 naturalistic images consisting of 20 photos of 17 in iduals. In this preregistered study, 95 participants rated all 340 images on one of three traits: trustworthiness, dominance, or attractiveness. Across images, participants’ trustworthiness ratings tended to vary more than dominance, which in turn varied more than attractiveness however, the relative differences between traits depended on the identity in question. Importantly, despite the variability in ratings within identities, there were substantial differences between in iduals, suggesting that these trait judgements are based to some degree on relatively invariant facial characteristics. We found greater between-identity variability for attractiveness judgements compared to trustworthiness and dominance. Future research should further investigate the extent to which each trait dimension is tied to the identity of the faces.
Visualization-Aided Exploration of the Real Estate Data
Publisher: Springer International Publishing
Date: 2016
Evaluating Path Queries over Frequently Updated Route Collections
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2012
DOI: 10.1109/TKDE.2011.30
CDS: Collaborative distant supervision for Twitter account classification
Publisher: Elsevier BV
Date: 10-2017
Query languages for relational multidatabases
Publisher: Springer Science and Business Media LLC
Date: 04-1993
DOI: 10.1007/BF01232185
A pictorial query-by-example language
Publisher: Elsevier BV
Date: 03-1995
Spatio-Temporal Composition and Indexing for Large Multimedia Applications
Publisher: Springer Science and Business Media LLC
Date: 07-1998
Spatio-Temporal Databases: The CHOROCHRONOS Approach
Publisher: Springer Berlin Heidelberg
Date: 2003
DOI: 10.1007/B83622
Query Relaxation across Heterogeneous Data Sources
Publisher: ACM
Date: 17-10-2015
Evaluation Techniques for Generalized Path Pattern Queries on XML Data
Publisher: Springer Science and Business Media LLC
Date: 27-04-2010
A family of directional relation models for extended objects
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2007
Top-k trajectories with the best view
Publisher: Springer Science and Business Media LLC
Date: 26-02-2019
Maximizing bichromatic reverse spatial and textual k nearest neighbor queries
Publisher: Association for Computing Machinery (ACM)
Date: 2016
Abstract: The problem of maximizing bichromatic reverse k nearest neighbor queries (BR k NN) has been extensively studied in spatial databases. In this work, we present a related query for spatial-textual databases that finds an optimal location, and a set of keywords that maximizes the size of bichromatic reverse spatial textual k nearest neighbors (MaxBRST k NN). Such a query has many practical applications including social media advertisements where a limited number of relevant advertisements are displayed to each user. The problem is to find the location and the text contents to include in an advertisement so that it will be displayed to the maximum number of users. The increasing availability of spatial-textual collections allows us to answer these queries for both spatial proximity and textual similarity. This paper is the first to consider the MaxBRST k NN query. We show that the problem is NP-hard and present both approximate and exact solutions.
Handling spatial data in distributed environments
Publisher: ACM
Date: 07-11-2007
On the Multiple-Query Optimization Problem
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-1990
DOI: 10.1109/69.54724
Personalization in Web Search and Data Management
Publisher: Springer Berlin Heidelberg
Date: 2011
The Retrieval of Direction Relations using R-trees
Publisher: Springer Berlin Heidelberg
Date: 1994
Efficient cost models for spatial queries using R-trees
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2000
DOI: 10.1109/69.842247
Parametric Query Optimization
Publisher: Springer Science and Business Media LLC
Date: 05-1997
Reverse $k$ Nearest Neighbor Search over Trajectories
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-2018
Answering Multidimensional Queries on Cubes Using Other Cubes
Publisher: IEEE Comput. Soc
Date: 2000
Dynamic Pickup and Delivery with Transfers
Publisher: Springer Berlin Heidelberg
Date: 2011
Online amnesic summarization of streaming locations
Publisher: Springer Berlin Heidelberg
Date: 2007
Message from the ICDE 2016 Program Committee and general chairs
Publisher: IEEE
Date: 05-2016
Viscrimepredict: A System for Crime Trajectory Prediction and Visualisation from Heterogeneous data sources
Publisher: ACM
Date: 08-04-2019
Optimizing XML queries: Bitmapped materialized views vs. indexes
Publisher: Elsevier BV
Date: 09-2013
Guest Editorial: Advanced Complex Data Analytics for Smart City Industrial Environment
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 06-2021
A study for the parameters of a distributed framework that handles spatial areas
Publisher: Springer Berlin Heidelberg
Date: 2007
Failure-Proof Spatio-temporal Composition of Sensor Cloud Services
Publisher: Springer Berlin Heidelberg
Date: 2014
Data warehouse schema and instance design
Publisher: Springer Berlin Heidelberg
Date: 1998
Data management research at the Knowledge and Database Systems Lab: (NTU Athens)
Publisher: Association for Computing Machinery (ACM)
Date: 06-2006
Abstract: The Knowledge and Database Systems Lab (KDBSL) of the Electrical and Computer Engineering Dept. in the National Technical University of Athens was founded in 1992 by Prof. Timos Sellis and Prof. Yannis Vassiliou. Its activities involve theoretical and applied research in the area of Databases and Information Systems. The lab employs three postdoc researchers (Dr Theodore Dalamagas, Dr Alkis Simitsis, Dr Yannis Stavrakas), several PhD students and many graduate students. It has been involved in many research projects supported by the EU, international institutions, Greek organizations, the Greek Government and industrial companies.
Towards an asynchronous aggregation-capable watermark for end-to-end protection of big data streams
Publisher: Elsevier BV
Date: 07-2017
Supporting Inconsistent Rules in Database Systems
Publisher: Springer Science and Business Media LLC
Date: 12-1992
DOI: 10.1007/BF00962920
Applying knowledge-based technology: trends and directions (Panel Session)
Publisher: IEEE Comput. Soc. Press
Date: 1990
Efficient answering of set containment queries for skewed item distributions
Publisher: ACM
Date: 21-03-2011
Deep resequencing of GWAS loci identifies rare variants in CARD9, IL23R and RNF186 that are associated with ulcerative colitis.
Publisher: Public Library of Science (PLoS)
Date: 12-09-2013
Anchored vertex exploration for community engagement in social networks
Publisher: IEEE
Date: 04-2020
The Lowell database research self-assessment
Publisher: Association for Computing Machinery (ACM)
Date: 05-2005
Abstract: Database needs are changing, driven by the Internet and increasing amounts of scientific and sensor data. In this article, the authors propose research into several important new directions for database management systems.
Hierarchical clustering for OLAP: The CUBE File approach
Publisher: Springer Science and Business Media LLC
Date: 07-09-2008
An Architecture for High Performance Engineering Information Systems
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 1991
DOI: 10.1109/32.67576
Conflict Resolution of Rules Assigning Values to Virtual Attributes
Publisher: ACM Press
Date: 1989
DOI: 10.1145/67544.66945
Computing and Managing Cardinal Direction Relations
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 12-2005
Application of the peer-to-peer paradigm in digital libraries
Publisher: Springer Berlin Heidelberg
Date: 2007
Incremental Design of a Data Warehouse
Publisher: Springer Science and Business Media LLC
Date: 2000
Big data analytics in healthcare A systematic literature review and roadmap for practical implementation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2021
The Database Group at National Technical University of Athens (NTUA)
Publisher: Association for Computing Machinery (ACM)
Date: 12-1995
Global Query Optimization
Publisher: Association for Computing Machinery (ACM)
Date: 15-06-1986
DOI: 10.1145/16856.16874
Abstract: In some recently proposed extensions to relational database systems as well as in deductive databases, a database system is presented with a collection of queries to process instead of just one. It is an interesting problem then, to come up with algorithms that process these queries together instead of one query at a time. We examine the problem of multiple (global) query optimization in this paper. A hierarchy of algorithms that can be used for global query optimization is exhibited and analyzed. These algorithms range from an arbitrary serial execution without any sharing of common results among the queries to an exhaustive search of all possible ways to process all queries.
Viscrime: A crime visualisation system for crime trajectory from multi-dimensional sources
Publisher: ACM
Date: 30-01-2019
Interactive Visualization of Urban Areas of Interest: A Parameter-Free and Efficient Footprint Method
Publisher: ACM
Date: 30-01-2019
Event Processing and Real-Time Monitoring over Streaming Traffic Data
Publisher: Springer Berlin Heidelberg
Date: 2012
Indexing views to route queries in a PDMS
Publisher: Springer Science and Business Media LLC
Date: 12-01-2008
Continuous Summarization over Microblog Threads
Publisher: Springer International Publishing
Date: 2017
A Model for the Prediction of R-tree Performance
Publisher: ACM Press
Date: 1996
Subsuming Multiple Sliding Windows for Shared Stream Computation
Publisher: Springer Berlin Heidelberg
Date: 2011
ETL workflows: From formal specification to optimization
Publisher: Springer Berlin Heidelberg
Date: 2007
Spatiooral composition in multimedia applications
Publisher: IEEE Comput. Soc. Press
Date: 1996
Incorporating fuzzy set methodologies in a DBMS repository for the application domain of GIS
Publisher: Informa UK Limited
Date: 10-1999
Heuristic containment check of partial tree-pattern queries in the presence of index graphs
Publisher: ACM Press
Date: 2006
Combining hierarchy encoding and pre-grouping: Intelligent grouping in star join processing
Publisher: IEEE
Date: 2003
Algorithms and criteria for diversification of news article comments
Publisher: Springer Science and Business Media LLC
Date: 16-07-2014
Ontology-Based Data Sharing in P2P Databases
Publisher: Springer Berlin Heidelberg
Date: 2008
Special issue on spatial and temporal database management
Publisher: Springer Science and Business Media LLC
Date: 05-03-2015
DOMProxy: Enabling dynamic-content front-end Web caching
Publisher: IEEE
Date: 2005
DOI: 10.1109/WCW.2005.9
NaviMoz: Mining Navigational Patterns in Portal Catalogs
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11896548_60
Rules in Database Systems
Publisher: Springer Berlin Heidelberg
Date: 1995
On the Properties of Non-Media Digital Watermarking: A Review of State of the Art Techniques
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2016
Extending Big Data Management via Semantics: Recent Innovations
Publisher: Elsevier BV
Date: 02-2020
Semantics-Aware Approaches to Big Data Engineering
Publisher: Springer Science and Business Media LLC
Date: 16-05-2017
Deep Osmosis: Holistic Distributed Deep Learning in Osmotic Computing
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2017
Hierarchical motor learning and synthesis with passivity-based controller and phase oscillator
Publisher: IEEE
Date: 05-2008
Extraction-transformation-loading processes
Publisher: IGI Global
Date: 2005
DOI: 10.4018/978-1-59140-560-3.CH041
Abstract: A data warehouse (DW) is a collection of technologies aimed at enabling the knowledge worker (executive, manager, analyst, etc.) to make better and faster decisions. The architecture of a DW exhibits various layers of data in which data from one layer are derived from data of the lower layer (see Figure 1). The operational databases, also called data sources, form the starting layer. They may consist of structured data stored in open database and legacy systems, or even in files. The central layer of the architecture is the global DW. The global DW keeps a historical record of data that result from the transformation, integration, and aggregation of detailed data found in the data sources. An auxiliary area of volatile data, data staging area (DSA) is employed for the purpose of data transformation, reconciliation, and cleaning. The next layer of data involves client warehouses, which contain highly aggregated data, directly derived from the global warehouse. There are various kinds of local warehouses, such as data mart or on-line analytical processing (OLAP) databases, which may use relational database systems or specific multidimensional data structures. The whole environment is described in terms of its components, metadata, and processes in a central metadata repository, located at the DW site.
IBD risk loci are enriched in multigenic regulatory modules encompassing putative causative genes
Publisher: Springer Science and Business Media LLC
Date: 21-06-2018
DOI: 10.1038/S41467-018-04365-8
Abstract: GWAS have identified risk loci for Inflammatory Bowel Disease (IBD). The majority of disease associations are known to be driven by regulatory variants. To identify the putative causative genes that are perturbed by these variants, we generate a large transcriptome data set (nine disease-relevant cell types) and identify 23,650 cis -eQTL. We show that these are determined by ∼9720 regulatory modules, of which ∼3000 operate in multiple tissues and ∼970 on multiple genes. We identify regulatory modules that drive the disease association for 63 of the 200 risk loci, and show that these are enriched in multigenic modules. Based on these analyses, we resequence 45 of the corresponding 100 candidate genes in 6600 Crohn disease (CD) cases and 5500 controls, and show with burden tests that they include likely causative genes. Our analyses indicate that ≥10-fold larger s le sizes will be required to demonstrate the causality of in idual genes using this approach.
Data intensive production systems: The DIPS approach
Publisher: Association for Computing Machinery (ACM)
Date: 09-1989
DOI: 10.1145/71031.71038
Abstract: In this paper we highlight the basic approach taken in the design of the DIPS system, and briefly present the main contributions. These include the use of special data structures to store rule definitions they are implemented using relations. A matching algorithm uses these structures to efficiently identify when the antecedents of productions are satisfied, making them applicable for execution. Partial match information stored in the data structures is used by the matching algorithm. We also describe a proposed concurrent execution strategy for applicable productions, which surpasses in performance, the traditional sequential OPS5 production execution algorithm. The requirements for a correct, serializable execution, based on locking, is described. An advantage of the matching technique in DIPS is that it is fully parallelizable, which makes it attractive for implementation in parallel computing environments.
Advanced ad hoc star query processing
Publisher: IGI Global
Date: 2006
DOI: 10.4018/987-1-59904-364-7.CH006
Abstract: Star queries are the most prevalent kind of queries in data warehousing, OLAP and business intelligence applications. Thus, there is an imperative need for efficiently processing star queries. To this end, a new class of fact table organizations has emerged that exploits path-based surrogate keys in order to hierarchically cluster the fact table data of a star schema. In the context of these new organizations, star query processing changes radically. In this chapter, we present a complete abstract processing plan that captures all the necessary steps in evaluating such queries over hierarchically clustered fact tables. Furthermore, we realize the abstract operations in terms of physical operations over the CUBE File data structure. Finally we discuss star query optimization issues over the presented abstract plan.
Stedel: A language for interactive spatio-temporal compositions
Publisher: IEEE
Date: 2001
Data warehouse refreshment
Publisher: IGI Global
Date: 2006
DOI: 10.4018/987-1-59904-364-7.CH005
Abstract: In the early stages of a data warehouse project, the designers/administrators have to come up with a decision concerning the design and deployment of the back-stage architecture. The possible options are (a) the usage of a commercial ETL tool, or (b) the development of an in-house ETL prototype. Both cases have advantages and disadvantages. However, in both cases the design and modeling of the ETL workflows have the same characteristics. The scope of this chapter is to indicate the main challenges, issues, and problems concerning the manufacturing of ETL workflows, in order to assist the designers/administrators to decide which solution suits better to their data warehouse project and to help them construct an efficient, robust and evolvable ETL workflow that implements the refreshment of their warehouse.
A methodology for clustering XML documents by structure
Publisher: Elsevier BV
Date: 05-2006
Top-k-size keyword search on tree structured data
Publisher: Elsevier BV
Date: 2015
miRGen 2.0: a database of microRNA genomic information and regulation
Publisher: Oxford University Press (OUP)
Date: 17-11-2009
DOI: 10.1093/NAR/GKP888
Location prediction in large-scale social networks: an in-depth benchmarking study
Publisher: Springer Science and Business Media LLC
Date: 09-07-2019
Intelligent caching and indexing techniques for relational database systems
Publisher: Elsevier BV
Date: 1988
A protein-truncating R179X variant in RNF186 confers protection against ulcerative colitis
Publisher: Springer Science and Business Media LLC
Date: 09-08-2016
DOI: 10.1038/NCOMMS12342
Abstract: Protein-truncating variants protective against human disease provide in vivo validation of therapeutic targets. Here we used targeted sequencing to conduct a search for protein-truncating variants conferring protection against inflammatory bowel disease exploiting knowledge of common variants associated with the same disease. Through replication genotyping and imputation we found that a predicted protein-truncating variant (rs36095412, p.R179X, genotyped in 11,148 ulcerative colitis patients and 295,446 controls, MAF=up to 0.78%) in RNF186 , a single-exon ring finger E3 ligase with strong colonic expression, protects against ulcerative colitis (overall P =6.89 × 10 −7 , odds ratio=0.30). We further demonstrate that the truncated protein exhibits reduced expression and altered subcellular localization, suggesting the protective mechanism may reside in the loss of an interaction or function via mislocalization and/or loss of an essential transmembrane domain.
Advances in Databases and Information Systems
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11827252
Caching Dynamic Skyline Queries
Publisher: Springer Berlin Heidelberg
Date: 2008
Inherited determinants of Crohn's disease and ulcerative colitis phenotypes: a genetic association study
Publisher: Elsevier BV
Date: 2016
Association analyses identify 38 susceptibility loci for inflammatory bowel disease and highlight shared genetic risk across populations
Publisher: Springer Science and Business Media LLC
Date: 20-07-2015
DOI: 10.1038/NG.3359
Cost Models for Join Queries in Spatial Databases
Publisher: IEEE Comput. Soc
Date: 1998
Index-based query processing on distributed multidimensional data
Publisher: Springer Science and Business Media LLC
Date: 09-08-2012
Prioritized Evaluation of Continuous Moving Queries over Streaming Locations
Publisher: Springer Berlin Heidelberg
Date: 2008
Compliance with COVID-19 prevention measures during the onset of the pandemic in Australia: investigating the role of trust in federal and state governments and scientists
Publisher: Informa UK Limited
Date: 26-06-2023
Window Specification over Data Streams
Publisher: Springer Berlin Heidelberg
Date: 2006
DOI: 10.1007/11896548_35
Efficient Identification of the Highest Diversity Gain Object
Publisher: Springer International Publishing
Date: 2016
On enhancing scalability for distributed RDF/S stores
Publisher: ACM
Date: 21-03-2011
Crowdsourced Coverage as a Service: Two-Level Composition of Sensor Cloud Services
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2017
A DATABASE IMPLEMENTATION FOR LARGE FRAME-BASED SYSTEMS
Publisher: IEEE Comput. Soc. Press
Date: 1989
Image variability and face matching
Publisher: SAGE Publications
Date: 22-08-2022
DOI: 10.1177/03010066221119088
Abstract: This study investigates whether variability in perceived trait judgements disrupts our ability to match unfamiliar faces. In this preregistered study, 174 participants completed a face matching task where they were asked to indicate whether two ambient face images belonged to the same person or different people (17,748 total data points). Participants completed 51 match trials consisting of images of the same person that differed substantially on one trait (either trustworthiness, dominance or attractiveness) with minimal differences in the alternate traits. Participants also completed 51 mismatch trials which contained two photos of similar-looking in iduals. We hypothesised that participants would make more errors on match trials when images differed in terms of attractiveness ratings than when they differed on trustworthiness or dominance. Contrary to expectations, images that differed in terms of attractiveness were matched most accurately, and there was no relationship between the extent of differences in attractiveness ratings and accuracy. There was some evidence that differences in perceived dominance and, to a lesser extent, trustworthiness were associated with lower face matching performance. However, these relationships were not significant when alternate traits were accounted for. The findings of our study suggest that face matching performance is largely robust against variation in trait judgements.
Computing and Handling Cardinal Direction Information
Publisher: Springer Berlin Heidelberg
Date: 2004
Spatiooral architecture-based framework for testing services in the cloud
Publisher: ACM
Date: 28-09-2015
Complexation of metals by phytosiderophores revealed by CE‐ESI‐MS and CE‐ICP‐MS
Publisher: Wiley
Date: 26-03-2010
Abstract: CE‐ESI‐MS and CE‐ICP‐MS were implemented for studying three phytosiderophores (mugineic acid, epi‐mugineic acid and deoxymugineic acid) and their metal complexes. Free ligands and ferric complexes were analyzed using the first methodology, while six free metals (Co(II), Cu(II), Fe(III), Mn(II), Ni(II) and Zn(II)) together with the corresponding complexes were investigated by the latter technique. CE separation was realized at a voltage of +25 kV employing a BGE containing 20 mM ammonium bicarbonate at pH 7.2. Both techniques revealed limits of detection in the high nM to low μM range. Standard additions to hydroponic s les of H. distichon, cv. Bodega (spring barley) showed regression coefficients for the metal–ligand complexes ranging from 0.984 to 0.999. Additionally, results of a competitivity study allowed the determination of relative metal–phytosiderophore complex stability constants of deoxymugineic/mugineic acid.
Exploiting Concurrency in a DBMS Implementation for Production
Publisher: IEEE
Date: 1988
Integrating Keywords and Semantics on Document Annotation and Search
Publisher: Springer Berlin Heidelberg
Date: 2010
Flexible and Adaptable Buffer Management Techniques for Database Management Systems
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-1995
DOI: 10.1109/12.376169
Query Optimization for Nontraditional Database Applications
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 1991
DOI: 10.1109/32.67580
Conceptual Synopses of Semantics in Social Networks Sharing Structured Data
Publisher: Springer Berlin Heidelberg
Date: 2008
Community-diversified influence maximization in social networks
Publisher: Elsevier BV
Date: 09-2020
Flexible buffer allocation based on marginal gains
Publisher: ACM Press
Date: 1991
Direction relations and two-dimensional range queries: optimisation techniques
Publisher: Elsevier BV
Date: 10-1998
Rule-Based Management of Schema Changes at ETL Sources
Publisher: Springer Berlin Heidelberg
Date: 2010
PathOracle: A Deep Learning Based Trip Planner for Daily Commuters
Publisher: Springer Nature Switzerland
Date: 2023
Coupling Production Systems and Database Systems: A Homogeneous Approach
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 04-1993
DOI: 10.1109/69.219733
Top- k dominant web services under multi-criteria matching
Publisher: ACM
Date: 24-03-2009
Mapping Discovery Over Revealing Schemas
Publisher: World Scientific Pub Co Pte Ltd
Date: 12-2015
DOI: 10.1142/S0218843015500069
Abstract: In a world of wide-scale information sharing, data are described in different formats, i.e. data structures, values and schemas. Querying such sources entails techniques that can bridge the data formats. Some existing techniques deal with schema mapping and view complementary aspects of the problem. Important ones, consider producing all the possible mappings for a pair of schemas, insinuating accompanying semantics in the mappings and adapting correct mappings as schemas evolve. In this work, we consider the problem of discovering mappings as schemas of autonomous sources are gradually revealed. Using as an ex le setting an overlay of peer databases, we present a schema mapping solution that discovers correct mappings as peer schemas are gradually revealed to remote peers. Mapping discovery is schema-centric and incorporates new semantics as they are unveiled. Mapping experience is reused and possible mappings are ranked so that the best choice is presented to the user. The experimental study confirms the suitability of the proposed solution to dynamic settings of heterogeneous sources.
Personalized Influential Topic Search via Social Network Summarization
Publisher: IEEE
Date: 04-2017
DOI: 10.1109/ICDE.2017.15
Twitter analytics: a big data management perspective
Publisher: Association for Computing Machinery (ACM)
Date: 25-09-2014
Abstract: With the inception of the Twitter microblogging platform in 2006, a myriad of research efforts have emerged studying different aspects of the Twittersphere. Each study exploits its own tools and mechanisms to capture, store, query and analyze Twitter data. Inevitably, platforms have been developed to replace this ad-hoc exploration with a more structured and methodological form of analysis. Another body of literature focuses on developing languages for querying Tweets. This paper addresses issues around the big data nature of Twitter and emphasizes the need for new data management and query language frameworks that address limitations of existing systems. We review existing approaches that were developed to facilitate twitter analytics followed by a discussion on research issues and technical challenges in developing integrated solutions.
Interoperability and definition of a national standard for geospatial data: the case of the Hellenic Cadastre
Publisher: Elsevier BV
Date: 2000
Monitoring Orientation of Moving Objects around Focal Points
Publisher: Springer Berlin Heidelberg
Date: 2009
Interactive Multimedia Documents: A Modeling, Authoring and Rendering Approach
Publisher: Springer Science and Business Media LLC
Date: 2000
The Semantics of Relations in 2D Space Using Representative Points: Spatial Indexes
Publisher: Springer Berlin Heidelberg
Date: 1993
Efficiently supporting procedures in relational database systems
Publisher: Association for Computing Machinery (ACM)
Date: 12-1987
DOI: 10.1145/38714.38745
Abstract: We examine an extended relational database system which supports database procedures as full fledged objects. In particular, we focus on the problems of query processing and efficient support for database procedures. First, a variation to the original INGRES decomposition algorithm is presented. Then, we examine the idea of storing results of previously processed procedures in secondary storage ( caching ). Using a cache, the cost of processing a query can be reduced by preventing multiple evaluations of the same procedure. Problems associated with cache organizations, such as replacement policies and validation schemes are examined. Another means for reducing the execution cost of queries is indexing. A new indexing scheme for cached results, Partial Indexing, is proposed and analyzed.
Learning risky driver behaviours from multi-channel data streams using genetic programming
Publisher: Springer International Publishing
Date: 2013
Window Update Patterns in Stream Operators
Publisher: Springer Berlin Heidelberg
Date: 2009
Modeling and manipulating the structure of hierarchical schemas for the web
Publisher: Elsevier BV
Date: 15-02-2008
Designing the global data warehouse with SPJ views
Publisher: Springer International Publishing
Date: 1999
Tractography dissection variability: What happens when 42 groups dissect 14 white matter bundles on the same dataset?
Publisher: Elsevier BV
Date: 11-2021
CHOROCHRONOS - Research on spatio-temporal database systems
Publisher: Springer Berlin Heidelberg
Date: 1999
Probabilistic contextual skylines
Publisher: IEEE
Date: 03-2010
Incremental preference adjustment: a graph-theoretical approach
Publisher: Springer Science and Business Media LLC
Date: 03-08-2020
A Trajectory Calculus for Qualitative Spatial Reasoning Using Answer Set Programming
Publisher: Cambridge University Press (CUP)
Date: 07-2018
DOI: 10.1017/S147106841800011X
Abstract: Spatial information is often expressed using qualitative terms such as natural language expressions instead of coordinates reasoning over such terms has several practical applications, such as bus routes planning. Representing and reasoning on trajectories is a specific case of qualitative spatial reasoning that focuses on moving objects and their paths. In this work, we propose two versions of a trajectory calculus based on the allowed properties over trajectories, where trajectories are defined as a sequence of non-overlapping regions of a partitioned map. More specifically, if a given trajectory is allowed to start and finish at the same region, 6 base relations are defined (TC-6). If a given trajectory should have different start and finish regions but cycles are allowed within, 10 base relations are defined (TC-10). Both versions of the calculus are implemented as ASP programs we propose several different encodings, including a generalised program capable of encoding any qualitative calculus in ASP. All proposed encodings are experimentally evaluated using a real-world dataset. Experiment results show that the best performing implementation can scale up to an input of 250 trajectories for TC-6 and 150 trajectories for TC-10 for the problem of discovering a consistent configuration, a significant improvement compared to previous ASP implementations for similar qualitative spatial and temporal calculi.
Panel on Data Warehouse Quality Issues
Publisher: IEEE Comput. Soc
Date: 1999
Dynamic data warehouse design
Publisher: Springer Berlin Heidelberg
Date: 1999
Extended database logic: Complex objects and deduction
Publisher: Elsevier BV
Date: 10-1990
Analysis of object oriented spatial access methods
Publisher: Association for Computing Machinery (ACM)
Date: 12-1987
DOI: 10.1145/38714.38758
Abstract: This paper provides an analysis of R-trees and a variation (R + -trees) that avoids overlapping rectangles in intermediate nodes of the tree. The main contributions of the paper are the following. We provide the first known analysis of R-trees. Although formulas are given for objects in one dimension (line segments), they can be generalized for objects in higher dimensions as well. We show how the transformation of objects to higher dimensions [HINR83] can be effectively used as a tool for the analysis of R- and R + - trees. Finally, we derive formulas for R + -trees and compare the two methods analytically. The results we obtained show that R + -trees require less than half the disk accesses required by a corresponding R-tree when searching files of real life sizes R + -trees are clearly superior in cases where there are few long segments and a lot of small ones.
ReEx: An integrated architecture for preference model representation and explanation
Publisher: Elsevier BV
Date: 12-2020
Capturing the Spatiotemporal Evolution in Road Traffic Networks
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2018
Experimental Evaluation of Data Warehouse Configuration Algorithms
Publisher: IEEE Comput. Soc
Date: 1998
Design of the ERATOSTHENES OLAP server
Publisher: Springer Berlin Heidelberg
Date: 2003
Web Technologies and Applications
Publisher: Springer International Publishing
Date: 2014
RDFSculpt: Managing RDF Schemas Under Set-Like Semantics
Publisher: Springer Berlin Heidelberg
Date: 2005
DOI: 10.1007/11431053_9
Guest Editorial: Data Management and Analysis in Location-Based Social Networks
Publisher: Springer Science and Business Media LLC
Date: 19-04-2015
Ranking and Clustering Web Services Using Multicriteria Dominance Relationships
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2010
DOI: 10.1109/TSC.2010.14
Optimization of extended database query languages
Publisher: Association for Computing Machinery (ACM)
Date: 05-1985
Monitoring continuous queries over streaming locations
Publisher: ACM
Date: 05-11-2008
Heuristic Algorithms for Designing a Data Warehouse with SPJ Views
Publisher: Springer Berlin Heidelberg
Date: 1999
Improvements on a heuristic algorithm for multiple-query optimization
Publisher: Elsevier BV
Date: 03-1994
State-Space Optimization of ETL Workflows
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2005
Topological Relations in the World of Minimum Bounding Rectangles: A Study with R-trees
Publisher: ACM Press
Date: 1995
DIANA-microT web server: elucidating microRNA functions through target prediction
Publisher: Oxford University Press (OUP)
Date: 30-04-2009
DOI: 10.1093/NAR/GKP292
Spatial Reasoning Using Symbolic Arrays
Publisher: Springer Berlin Heidelberg
Date: 1992
Implementing embedded valid time query languages
Publisher: Springer Berlin Heidelberg
Date: 1998
DOI: 10.1007/BFB0054514
Fast Large-Scale Trajectory Clustering
Publisher: Association for Computing Machinery (ACM)
Date: 09-2019
Abstract: In this paper, we study the problem of large-scale trajectory data clustering, k -paths, which aims to efficiently identify k "representative" paths in a road network. Unlike traditional clustering approaches that require multiple data-dependent hyperparameters, k -paths can be used for visual exploration in applications such as traffic monitoring, public transit planning, and site selection. By combining map matching with an efficient intermediate representation of trajectories and a novel edge-based distance (EBD) measure, we present a scalable clustering method to solve k -paths. Experiments verify that we can cluster millions of taxi trajectories in less than one minute, achieving improvements of up to two orders of magnitude over state-of-the-art solutions that solve similar trajectory clustering problems.
Social-textual query processing on graph database systems
Publisher: Springer International Publishing
Date: 2018
mirPub: a database for searching microRNA publications
Publisher: Oxford University Press (OUP)
Date: 20-12-2014
DOI: 10.1093/BIOINFORMATICS/BTU819
Abstract: Summary: Identifying, amongst millions of publications available in MEDLINE, those that are relevant to specific microRNAs (miRNAs) of interest based on keyword search faces major obstacles. References to miRNA names in the literature often deviate from standard nomenclature for various reasons, since even the official nomenclature evolves. For instance, a single miRNA name may identify two completely different molecules or two different names may refer to the same molecule. mirPub is a database with a powerful and intuitive interface, which facilitates searching for miRNA literature, addressing the aforementioned issues. To provide effective search services, mirPub applies text mining techniques on MEDLINE, integrates data from several curated databases and exploits data from its user community following a crowdsourcing approach. Other key features include an interactive visualization service that illustrates intuitively the evolution of miRNA data, tag clouds summarizing the relevance of publications to particular diseases, cell types or tissues and access to TarBase 6.0 data to oversee genes related to miRNA publications. Availability and Implementation: mirPub is freely available at www.microrna.gr/mirpub/. Contact: vergoulis@imis.athena-innovation.gr or dalamag@imis.athena-innovation.gr Supplementary information: Supplementary data are available at Bioinformatics online.
Research issues in spatio-temporal database systems
Publisher: Springer Berlin Heidelberg
Date: 1999
Probabilistic range monitoring of streaming uncertain positions in GeoSocial networks
Publisher: Springer Berlin Heidelberg
Date: 2012
Classification and annotation of open internet of things datastreams
Publisher: Springer International Publishing
Date: 2018
From Homomorphisms to Embeddings: A Novel Approach for Mining Embedded Patterns from Large Tree Data
Publisher: Elsevier BV
Date: 12-2018
Clustering XML Documents Using Structural Summaries
Publisher: Springer Berlin Heidelberg
Date: 2004
Implementing Large Production Systems in a DBMS Environment: Concepts and Algorithms
Publisher: Association for Computing Machinery (ACM)
Date: 06-1988
DOI: 10.1145/971701.50251
Abstract: It has been widely recognized that many future database applications, including engineering processes, manufacturing and communications, will require some kind of rule based reasoning. In this paper we study methods for storing and manipulating large rule bases using relational database management systems. First, we provide a matching algorithm which can be used to efficiently identify applicable rules. The second contribution of this paper, is our proposal for concurrent execution strategies which surpass, in terms of performance, the sequential OPS5 execution algorithm. The proposed method is fully parallelizable, which makes its use even more attractive, as it can be used in parallel computing environments.
RDivF: Diversifying Keyword Search on RDF Graphs
Publisher: Springer Berlin Heidelberg
Date: 2013
Knowledge of identity reduces variability in trait judgements across face images
Publisher: SAGE Publications
Date: 12-2023
DOI: 10.1177/17470218221136118
Abstract: Faces vary from image to image, eliciting different judgements of traits and often different judgements of identity. Knowledge that two face images belong to the same person facilitates the processing of identity information across images, but it is unclear if this also applies to trait judgements. In this preregistered study, participants (
A survey of logical models for OLAP databases
Publisher: Association for Computing Machinery (ACM)
Date: 12-1999
Abstract: In this paper, we present different proposals for multidimensional data cubes, which are the basic logical model for OLAP applications. We have grouped the work in the field in two categories: commercial tools (presented along with terminology and standards) and academic efforts. We further ide the academic efforts in two subcategories: the relational model extensions and the cube-oriented approaches. Finally, we attempt a comparative analysis of the various efforts.
Effects of Face Masks on Person Perception
Publisher: SAGE Publications
Date: 22-09-2021
DOI: 10.1177/03010066211045172
Abstract: As face masks have become more commonplace in many regions due to COVID-19, concerns have been raised about their effects on the perception of mask wearers and social cohesion more broadly, including racial profiling. In two studies we examined the effects of masks on social judgments of mask wearers, and whether masks have different effects on judgments of Black and White faces. Participants rated 20 Black and 20 White faces with and without masks on trustworthiness/approachability (Studies 1 and 2) and on dominance/competence and attractiveness (Study 2). In both studies masks increased perceived trustworthiness and reduced the effect of face race on judgments. Masks also increased perceived attractiveness, but had no effect on the perception of dominance/competence. Overall, this study found no negative effects of face masks on judgments of mask wearers, though further research is needed.
Learning to rank user intent
Publisher: ACM
Date: 24-10-2011
Social event detection with retweeting behavior correlation
Publisher: Elsevier BV
Date: 12-2018
Analysis of Object Oriented Spatial Access Methods
Publisher: ACM Press
Date: 1987
DOI: 10.1145/38713.38758
Keyword aware influential community search in large attributed graphs
Publisher: Elsevier BV
Date: 02-2022
Storing and Indexing Spatial Data in P2P Systems
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 02-2009
Optimization of Extended Database Query Languages
Publisher: ACM
Date: 05-1985
On crowdsensed data acquisition using multi-dimensional point processes
Publisher: IEEE
Date: 04-2015
Topological Relations in the World of Minimum Bounding Rectangles: A Study with R-trees
Publisher: Association for Computing Machinery (ACM)
Date: 22-05-1995
Abstract: Recent developments in spatial relations have led to their use in numerous applications involving spatial databases. This paper is concerned with the retrieval of topological relations in Minimum Bounding Rectangle-based data structures. We study the topological information that Minimum Bounding Rectangles convey about the actual objects they enclose, using the concept of projections. Then we apply the results to R-trees and their variations, R + -trees and R*-trees in order to minimise disk accesses for queries involving topological relations. We also investigate queries that involve complex spatial conditions in the form of disjunctions and conjunctions and we discuss possible extensions.
Business Intelligence for the Real-Time Enterprise
Publisher: Springer Berlin Heidelberg
Date: 2009
Reusing classical query rewriting in P2P databases
Publisher: Springer Berlin Heidelberg
Date: 2007
Experiments on the Concurrent Rule Execution in Database Systems
Publisher: IEEE Comput. Soc. Press
Date: 1992
Performance of DBMS implementations of production systems
Publisher: IEEE Comput. Soc. Press
Date: 1990
Evolutionary feature subspaces generation for ensemble classification
Publisher: ACM
Date: 02-07-2018
Point Representation of Spatial Objects and Query Window Extension: A New Technique for Spatial Access Methods
Publisher: Informa UK Limited
Date: 09-1997
Answering Top-k Exemplar Trajectory Queries
Publisher: IEEE
Date: 04-2017
Towards Scalable Visual Exploration of Very Large RDF Graphs
Publisher: Springer International Publishing
Date: 2015
Optimization Issues in R-tree Construction (Extended Abstract)
Publisher: Springer Berlin Heidelberg
Date: 1994
Monitoring the Top-m Rank Aggregation of Spatial Objects in Streaming Queries
Publisher: IEEE
Date: 04-2017
Location Estimation Using Crowdsourced Spatial Relations
Publisher: Association for Computing Machinery (ACM)
Date: 21-06-2016
DOI: 10.1145/2894745
Abstract: The “crowd” has become a very important geospatial data provider. Specifically, nonexpert users have been providing a wealth of quantitative geospatial data (e.g., geotagged tweets or photos, online). With spatial reasoning being a basic form of human cognition, textual narratives expressing user travel experiences (e.g., travel blogs) would provide an even bigger source of geospatial data. Narratives typically contain qualitative geospatial data in the form of objects and spatial relations (e.g., “St. John’s church is to the North of the Acropolis museum.” The scope of this work is (i) to extract these spatial relations from textual narratives, (ii) to quantify (model) them, and (iii) to reason about object locations based only on the quantified spatial relations. We use information extraction methods to identify toponyms and spatial relations, and we formulate a quantitative approach based on distance and orientation features to represent the latter. Probability density functions (PDFs) for spatial relations are determined by means of a greedy expectation maximization (EM)-based algorithm. These PDFs are then used to estimate unknown object locations. Experiments using a text corpus harvested from travel blog sites establish the considerable location estimation accuracy of the proposed approach on synthetic and real-world scenarios.
NOX1 loss-of-function genetic variants in patients with inflammatory bowel disease
Publisher: Elsevier BV
Date: 03-2018
DOI: 10.1038/MI.2017.74
Semantic grouping of social networks in P2P database settings
Publisher: Springer Berlin Heidelberg
Date: 2007
Special Section on the International Conference on Data Engineering 2016
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2019
MIDAS: Multi-attribute Indexing for Distributed Architecture Systems
Publisher: Springer Berlin Heidelberg
Date: 2011
Diversifying User Comments on News Articles
Publisher: Springer Berlin Heidelberg
Date: 2012
Comparative performances of machine learning methods for classifying Crohn Disease patients using genome-wide genotyping data
Publisher: Springer Science and Business Media LLC
Date: 17-07-2019
DOI: 10.1038/S41598-019-46649-Z
Abstract: Crohn Disease (CD) is a complex genetic disorder for which more than 140 genes have been identified using genome wide association studies (GWAS). However, the genetic architecture of the trait remains largely unknown. The recent development of machine learning (ML) approaches incited us to apply them to classify healthy and diseased people according to their genomic information. The Immunochip dataset containing 18,227 CD patients and 34,050 healthy controls enrolled and genotyped by the international Inflammatory Bowel Disease genetic consortium (IIBDGC) has been re-analyzed using a set of ML methods: penalized logistic regression (LR), gradient boosted trees (GBT) and artificial neural networks (NN). The main score used to compare the methods was the Area Under the ROC Curve (AUC) statistics. The impact of quality control (QC), imputing and coding methods on LR results showed that QC methods and imputation of missing genotypes may artificially increase the scores. At the opposite, neither the patient/control ratio nor marker preselection or coding strategies significantly affected the results. LR methods, including Lasso, Ridge and ElasticNet provided similar results with a maximum AUC of 0.80. GBT methods like XGBoost, LightGBM and CatBoost, together with dense NN with one or more hidden layers, provided similar AUC values, suggesting limited epistatic effects in the genetic architecture of the trait. ML methods detected near all the genetic variants previously identified by GWAS among the best predictors plus additional predictors with lower effects. The robustness and complementarity of the different methods are also studied. Compared to LR, non-linear models such as GBT or NN may provide robust complementary approaches to identify and classify genetic markers.
Database interoperability through Web Services and ontologies
Publisher: IEEE
Date: 10-2008
Spatio-Temporal Indexing for Large Multimedia Applications
Publisher: IEEE
Date: 1996
Host–microbe interactions have shaped the genetic architecture of inflammatory bowel disease
Publisher: Springer Science and Business Media LLC
Date: 31-10-2012
DOI: 10.1038/NATURE11582
Event and Action Representation and Composition for Multimedia Application Scenario Modelling
Publisher: Springer Berlin Heidelberg
Date: 1996
Genome-wide association study of CNVs in 16,000 cases of eight common diseases and 3,000 shared controls
Publisher: Springer Science and Business Media LLC
Date: 04-2010
DOI: 10.1038/NATURE08979
Efficiently Supporting Procedures in Relational Database Systems
Publisher: ACM Press
Date: 1987
DOI: 10.1145/38713.38745
A study on workload-aware wavelet synopses for point and range-sum queries
Publisher: ACM
Date: 10-11-2006
Airport Context Analytics
Publisher: Springer International Publishing
Date: 2014
Temporal betweenness centrality in dynamic graphs
Publisher: Springer Science and Business Media LLC
Date: 05-06-2019
Mining user navigation patterns for personalizing topic directories
Publisher: ACM
Date: 09-11-2007
Multiplexing trajectories of moving objects
Publisher: Springer Berlin Heidelberg
Date: 2012
Multi-granular time-based sliding windows over data streams
Publisher: IEEE
Date: 09-2010
DOI: 10.1109/TIME.2010.14
On-line discovery of hot motion paths
Publisher: ACM
Date: 25-03-2008
Microblogging Queries on Graph Databases: An Introspection
Publisher: ACM
Date: 31-05-2015
Data Exchange Issues in Peer-to-Peer Database Systems
Publisher: Springer Berlin Heidelberg
Date: 2006
Amnesic online synopses for moving objects
Publisher: ACM Press
Date: 2006
Serving the Sky: Discovering and Selecting Semantic Web Services through Dynamic Skyline Queries
Publisher: IEEE
Date: 08-2008
DOI: 10.1109/ICSC.2008.65
Advances in Object-Oriented Database Systems
Publisher: Springer Berlin Heidelberg
Date: 1994
A Method to Exploit the Structure of Genetic Ancestry Space to Enhance Case-Control Studies
Publisher: Elsevier BV
Date: 05-2016
Personalizing Keyword Search on RDF Data
Publisher: Springer Berlin Heidelberg
Date: 2013
Personalized Influential Topic Search via Social Network Summarization
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 07-2016
In the shadows we trust: A secure aggregation tolerant watermark for data streams
Publisher: IEEE
Date: 06-2015
A heuristic approach for checking containment of generalized tree-pattern queries
Publisher: ACM
Date: 26-10-2008
Inferring Location Types With Geo-Social-Temporal Pattern Mining
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Going rural but not staying long: Recruitment and retention issues for the rural dietetic workforce in Australia
Publisher: Wiley
Date: 29-11-2010
Reverse k Nearest Neighbor Search over Trajectories (Extended Abstract)
Publisher: IEEE
Date: 04-2018
Formal specification and optimization of ETL scenarios
Publisher: ACM
Date: 10-11-2006
Containment of Partially Specified Tree-Pattern Queries
Publisher: IEEE
Date: 2006
Approximate regional sequence matching for genomic databases
Publisher: Springer Science and Business Media LLC
Date: 18-03-2012
Maintaining consistent results of continuous queries under diverse window specifications
Publisher: Elsevier BV
Date: 03-2011
Efficient compilation of large rule bases using logical access paths
Publisher: Elsevier BV
Date: 1990
On effective and efficient graph edge labeling
Publisher: Springer Science and Business Media LLC
Date: 09-08-2018
GrouPeer: Dynamic clustering of P2P databases
Publisher: Elsevier BV
Date: 03-2009
A framework for semantic grouping in P2P databases
Publisher: Elsevier BV
Date: 11-2008
Spatio-temporal composition of Sensor Cloud services
Publisher: IEEE
Date: 06-2014
DOI: 10.1109/ICWS.2014.44
Novel Loci Associated with Increased Risk of Sudden Cardiac Death in the Context of Coronary Artery Disease
Publisher: Public Library of Science (PLoS)
Date: 04-04-2013
The unusual suspects--innate lymphoid cells as novel therapeutic targets in IBD.
Publisher: Springer Science and Business Media LLC
Date: 05-2015
An Algebra and calculus for relational multidatabase systems
Publisher: IEEE Comput. Soc. Press
Date: 1991
A simulator for a mobile peer-to-peer database environment
Publisher: IEEE
Date: 04-2008
DOI: 10.1109/MDM.2008.23
ConcaveCubes: Supporting Cluster-based Geographical Visualization in Large Data Scale
Publisher: Wiley
Date: 06-2018
DOI: 10.1111/CGF.13414
A combination of trie-trees and inverted files for the indexing of set-valued attributes
Publisher: ACM Press
Date: 2006
Complex Event Summarization Using Multi-Social Attribute Correlation
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 11-2023
Most Influential Community Search over Large Social Networks
Publisher: IEEE
Date: 04-2017
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface
Publisher: Springer Berlin Heidelberg
Date: 2013
Integrity 2023: Integrity in Social Networks and Media
Publisher: ACM
Date: 27-02-2023
Accurate microRNA target prediction correlates with protein repression levels
Publisher: Springer Science and Business Media LLC
Date: 18-09-2009
Interactive Trip Planning Using Activity Trajectories
Publisher: ACM
Date: 05-12-2016
An Organizational Framework for Cooperating Intelligent Information Systems
Publisher: World Scientific Pub Co Pte Lt
Date: 03-1992
DOI: 10.1142/S0218215792000088
Abstract: There is a growing belief that the next generation of information processing systems will be based on the paradigm of Intelligent and Cooperative Information Systems (ICISs). Such systems will involve information agents — distributed over the nodes of a common communication network — which work in a synergistic manner by exchanging information and expertise, coordinating their activities and negotiating how to solve parts of a common information-intensive problem. Along with motivating the importance of such systems the paper gives an overview of related research areas, notably Distributed Artificial Intelligence (DAI) and Distributed Databases (DDBs), and presents a generic architecture which views an ICIS as a community of communicating and cooperating intelligent information agents.
Boosting the ranking function learning process using clustering
Publisher: ACM
Date: 30-10-2008
The maximum trajectory coverage query in spatial databases
Publisher: Association for Computing Machinery (ACM)
Date: 11-2018
Abstract: With the widespread use of GPS-enabled mobile devices, an unprecedented amount of trajectory data has become available from various sources such as Bikely, GPS-wayPoints, and Uber. The rise of smart transportation services and recent break-throughs in autonomous vehicles increase our reliance on trajectory data in a wide variety of applications. Supporting these services in emerging platforms requires more efficient query processing in trajectory databases. In this paper, we propose two new coverage queries for trajectory databases: (i) k Best Facility Trajectory Search ( k BFT) and (ii) k Best Coverage Facility Trajectory Search ( k BCovFT). We propose a novel index structure, the Trajectory Quadtree (TQ-tree) that utilizes a quadtree to hierarchically organize trajectories into different nodes, and then applies a z-ordering to further organize the trajectories by spatial locality inside each node. This structure is highly effective in pruning the trajectory search space, which is of independent interest. By exploiting the TQ-tree, we develop a ide-and-conquer approach to efficiently process a k BFT query. To solve the k BCovFT, which is a non-submodular NP-hard problem, we propose a greedy approximation. We evaluate our algorithms through an extensive experimental study on several real datasets, and demonstrate that our algorithms outperform baselines by two to three orders of magnitude.
Prescriptive Analytics for Big Data
Publisher: Springer International Publishing
Date: 2016
TARCLOUD: A Cloud-Based Platform to Support miRNA Target Prediction
Publisher: Springer Berlin Heidelberg
Date: 2012
Exploring the genetic architecture of inflammatory bowel disease by whole-genome sequencing identifies association at ADCY7
Publisher: Springer Science and Business Media LLC
Date: 09-01-2017
DOI: 10.1038/NG.3761
CHOROCHRONOS: Research on Spatiotemporal Database Systems
Publisher: IEEE
Date: 1999
Holistic influence maximization for targeted advertisements in spatial social networks
Publisher: IEEE
Date: 04-2018
Shrink: Distance preserving graph compression
Publisher: Elsevier BV
Date: 09-2017
Designing Data Warehouses
Publisher: Elsevier BV
Date: 11-1999
A geometric approach to indexing large rule bases
Publisher: Springer-Verlag
Date: 1992
DOI: 10.1007/BFB0032445
Diversifying Microblog Posts
Publisher: Springer International Publishing
Date: 2014
Flexible Buffer Allocation Based on Marginal Gains
Publisher: Association for Computing Machinery (ACM)
Date: 04-1991
Performance Issues in the Binary Relationship Model
Publisher: Elsevier BV
Date: 09-1989
Big data analytics in telecommunications: literature review and architecture recommendations
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 2020
Efficient Semantic Web Service Discovery in Centralized and P2P Environments
Publisher: Springer Berlin Heidelberg
Date: 2008
Conflict resolution of rules assigning values to virtual attributes
Publisher: Association for Computing Machinery (ACM)
Date: 06-1989
DOI: 10.1145/66926.66945
Abstract: In the majority of research work done on logic programming and deductive databases, it is assumed that the set of rules defined by the user is consistent , i.e., that no contradictory facts can be inferred by the rules. In this paper, we address the problem of resolving conflicts of rules that assign values to virtual attributes. We devise a general framework for the study of the problem, and we propose an approach that subsumes all previously suggested solutions. Moreover, it suggests several additional solutions, which very often capture the semantics of the data more accurately than the known approaches. Finally, we address the issue of how to index rules so that conflicts are resolved efficiently, i.e., only one of the applicable rules is processed at query time.
GoNTogle: A Tool for Semantic Annotation and Search
Publisher: Springer Berlin Heidelberg
Date: 2010
RIPPLE: A Scalable Framework for Distributed Processing of Rank Queries
Publisher: No publisher found
Date: 2014
Erratum: A family of directional relation models for extended objects (IEEE Transactions on Knowledge and Data Engineering (2007) 19:8 (1116-1130))
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2007
Hierarchically compressed wavelet synopses
Publisher: Springer Science and Business Media LLC
Date: 26-03-2008
Batch processing of Top-k Spatial-textual Queries
Publisher: ACM
Date: 31-05-2015
Implementing a Query Language for Context-Dependent Semistructured Data
Publisher: Springer Berlin Heidelberg
Date: 2004
Implementation of a Prolog-INGRES Interface
Publisher: Association for Computing Machinery (ACM)
Date: 06-1988
DOI: 10.1145/51708.51713
Abstract: This report describes a working prototype of a Prolog-INGRES interface based on external semantic query simplification. Semantic query simplification employs integrity constraints enforced in a database system for reducing the number of tuple variables and terms in a relational query. This type of query simplifier is useful in providing very high level user interfaces to existing database systems. The system employes a graph theoretic approach to simplify arbitrary conjunctive queries with inequalities. One very interesting feature of the system is to provide meaningful error messages in case of an empty query result resulting from contradiction. In addition to data, rules are stored in the database as well and are retrieved automatically if the Prolog program references them but they are not defined in the Prolog rulebase.
SISYPHUS: The implementation of a chunk-based storage manager for OLAP data cubes
Publisher: Elsevier BV
Date: 05-2003
Qualitative representation of spatial knowledge in two-dimensional space
Publisher: Springer Science and Business Media LLC
Date: 10-1994
DOI: 10.1007/BF01231605
Optimizing ETL processes in data warehouses
Publisher: IEEE
Date: 2005
Finding the optimal location and keywords in obstructed and unobstructed space
Publisher: Springer Science and Business Media LLC
Date: 25-04-2018
Supporting Large-scale Geographical Visualization in a Multi-granularity Way
Publisher: ACM
Date: 02-02-2018
Clustering XML Documents by Structure
Publisher: Springer Berlin Heidelberg
Date: 2004
Spatio-temporal composition of crowdsourced services
Publisher: Springer Berlin Heidelberg
Date: 2015
Spatial Textual Top-k Search in Mobile Peer-to-Peer Networks
Publisher: Springer International Publishing
Date: 2016
Efficient Evaluation of Generalized Tree-Pattern Queries with Same-Path Constraints
Publisher: Springer Berlin Heidelberg
Date: 2009
A tool for mapping discovery over revealing schemas
Publisher: ACM
Date: 24-03-2009
TopicTracker: A platform for topic trajectory identification and visualisation
Publisher: Elsevier BV
Date: 05-2023
Efficient evaluation of generalized path pattern queries on XML data
Publisher: ACM
Date: 21-04-2008
Automated density-based clustering of spatial urban data for interactive data exploration
Publisher: IEEE
Date: 05-2017
Event Popularity Prediction Using Influential Hashtags From Social Media
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 10-2022
Evaluation of partial path queries on xml data
Publisher: ACM
Date: 06-11-2007
Approximate order-k Voronoi cells over positional streams
Publisher: ACM
Date: 07-11-2007
Sampling trajectory streams with spatiotemporal criteria
Publisher: IEEE
Date: 2006
Spatio-temporal Databases in the Years Ahead
Publisher: Springer Berlin Heidelberg
Date: 2003
Checking the Temporal Integrity of Interactive Multimedia Documents
Publisher: Springer Science and Business Media LLC
Date: 07-2000
DOI: 10.1007/PL00010674
Evaluating Reachability Queries over Path Collections
Publisher: Springer Berlin Heidelberg
Date: 2009
Introduction
Publisher: Springer Berlin Heidelberg
Date: 2003
Geo-social Influence Spanning Maximization
Publisher: IEEE
Date: 04-2018
A Metadata-Assisted Cascading Ensemble Classification Framework for Automatic Annotation of Open IoT Data
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 08-2023
Tractography dissection variability: what happens when 42 groups dissect 14 white matter bundles on the same dataset?
Publisher: Cold Spring Harbor Laboratory
Date: 08-10-2020
DOI: 10.1101/2020.10.07.321083
Abstract: White matter bundle segmentation using diffusion MRI fiber tractography has become the method of choice to identify white matter fiber pathways in vivo in human brains. However, like other analyses of complex data, there is considerable variability in segmentation protocols and techniques. This can result in different reconstructions of the same intended white matter pathways, which directly affects tractography results, quantification, and interpretation. In this study, we aim to evaluate and quantify the variability that arises from different protocols for bundle segmentation. Through an open call to users of fiber tractography, including anatomists, clinicians, and algorithm developers, 42 independent teams were given processed sets of human whole-brain streamlines and asked to segment 14 white matter fascicles on six subjects. In total, we received 57 different bundle segmentation protocols, which enabled detailed volume-based and streamline-based analyses of agreement and disagreement among protocols for each fiber pathway. Results show that even when given the exact same sets of underlying streamlines, the variability across protocols for bundle segmentation is greater than all other sources of variability in the virtual dissection process, including variability within protocols and variability across subjects. In order to foster the use of tractography bundle dissection in routine clinical settings, and as a fundamental analytical tool, future endeavors must aim to resolve and reduce this heterogeneity. Although external validation is needed to verify the anatomical accuracy of bundle dissections, reducing heterogeneity is a step towards reproducible research and may be achieved through the use of standard nomenclature and definitions of white matter bundles and well-chosen constraints and decisions in the dissection process.
Related Organisations
University Of Maryland At College Park
Location: United States of America
University Of California, Berkeley
Location: United States of America
Related Funding Activities
Discovery Projects - Grant ID: DP140101587
Start Date: 2014
End Date: 12-2018
Amount: $422,000.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP170102231
Start Date: 2017
End Date: 12-2019
Amount: $416,000.00
Funder: Australian Research Council
View Funded ActivityLinkage Infrastructure, Equipment And Facilities - Grant ID: LE200100074
Start Date: 05-2020
End Date: 12-2021
Amount: $580,000.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP160102114
Start Date: 10-2016
End Date: 12-2019
Amount: $270,000.00
Funder: Australian Research Council
View Funded ActivityLinkage Projects - Grant ID: LP170100416
Start Date: 07-2018
End Date: 12-2020
Amount: $256,551.00
Funder: Australian Research Council
View Funded ActivityDiscovery Projects - Grant ID: DP220101434
Start Date: 2022
End Date: 12-2024
Amount: $364,295.00
Funder: Australian Research Council
View Funded ActivityLinkage Infrastructure, Equipment And Facilities - Grant ID: LE180100094
Start Date: 2018
End Date: 08-2020
Amount: $1,361,651.00
Funder: Australian Research Council
View Funded Activity