Over the past decade, the integration of digital technologies into clinical trials has fundamentally transformed the ability to monitor patients in real-time through wearable sensors, enabling the rapid capture of clinically relevant signals. This transformation has accelerated the development of medicines by providing faster, more objective measurements of therapeutic effects. Central to this technological shift is the Internet of Medical Things (IoMT) platform, with Magnol.Ai serving as a prime example. Magnol.Ai excels in continuously processing and converting vast amounts of digital data, including wearable sensor signals and electronic Patient-Reported Outcomes (ePROs), into actionable clinical insights for digital biomarker (dBM) research. Beyond its pivotal role in clinical research, Magnol.Ai demonstrates versatility as a scalable, real-time edge computing platform in other domains, such as real-time gait computing. By deploying advanced sensors and algorithms for real-time speed of movement tracking, Magnol.Ai underscores its capacity to support a broad range of applications within IoMT.

Connected clinical trials enable real-time connection with consented patients, allowing the capture of clinically meaningful signals via wearable sensors to accelerate the development of medicines. At the core of the full-stack technologies needed to support such trials is our digital data platform (DDP) — to continuously ingest, visualize, process, and transform a large amount of digital data, including wearable sensor signals and electronic Patient-Reported Outcomes (ePRO)s into meaningful clinical measures. This paper presents the integrated systems and technologies we have developed to establish such a cloud-based platform. The main advantages of the DDP include 1) interactive exploration and navigation of large volumes of digital data at scale, 2) real-time data monitoring to promptly track data quality and compliance, and 3) novel data delivery methods to allow seamless access to large-scale raw sensor signals, processed signals, and aggregated digital biomarker measures for endpoints analysis. Finally, two use scenarios developed and deployed in the DDP will be demonstrated.

Large bibliographic data sets hold the promise of revolutionizing the scientific enterprise when combined with state-of-the-science computational capabilities. Providing high-quality data services for large network datasets such as the Microsoft Academic Graph, which contains more than two billion citation links, poses significant difficulties for universities. Data systems based on the property graph model are capable of delivering efficient graph query services for large networks. However, real-life queries often combine multiple types of data models. To satisfy the needs of different user groups, we developed and deployed a cloud-based data system consisting of scalable graph and text-indexed query engines. For non-expert users, the property graph model also presents a technological barrier. To alleviate the steep learning curve, we designed an intuitive graphical user interface for query-building. For advanced users, a scalable notebook service in our platform provides a more flexible computing environments where the query results can be further analyzed. These systems form the data-backbone of the Collaborative Archive and Data Research Environment (CADRE), which provides efficient and high-quality bibliographic data services to eleven large public universities in North America.

Over the past decade, cyberinfrastructure community like XSEDE has substantially fostered and enriched knowledge discovery of scholars, researchers, and engineers from a variety of domains through enabling access to advanced computing systems, where continuing support for classic packages and parallel computing frameworks (e.g., MPI and OpenMP) has been well established. However, with the rise of "Big Data" era, an ever increasing demand from user community is the desire to run sophisticated, state-of-the-art distributed frameworks that handle various data related tasks. Examples include Hadoop and Spark for data processing and analytics, Cassandra and Redis for scalable on-disk and in-memory data stores, Apache Airflow for distributed workflow engine, just to name a few. Though by design such frameworks provision high-level, user friendly programming APIs for business logic composition, their deployment process oftentimes is both complex and complicated, requiring expertise well beyond what the majority of cyberinfrastructure users may have. To bridge the gap, in this paper we propose the concept of provisioning such frameworks through "cyberinfrastructure managed", system wide services, especially through leveraging "high level, complexity hiding interfaces" principle when designing interfaces that are exposed to users for framework setup and shutdown. In particular, we use Spark-as-a-Service at Indiana University as a concrete case study to illustrate how we applied the design principles. Furthermore, to demonstrate the generality of the design, we showcase Cassandra-as-a-Service, a work-in-progress prototype.

Geometric problems of interest to mathematical visualization applications involve changing structures, such as the moves that transform one knot into an equivalent knot. In this paper, we describe mathematical entities (curves and surfaces) as link-node graphs, and make use of energy-driven relaxation algorithms to optimize their geometric shapes by moving knots and surfaces to their simplified equivalence. Furthermore, we design and conFigure parallel functional units in the relaxation algorithms to accelerate the computation these mathematical deformations require. Results show that we can achieve significant performance optimization via the proposed threading model and level of parallelization.

Dentistry is a particularly complex and sophisticated applied science; many problems have to be solved by analyzing intensive longitudinal data. For example, dynamic carious lesion assessment requires dental researchers to perform knowledge discovery in a situation with multiple specimens across different experimental phases. The technological development and availability of cyberinfrastructure today can enable dental researchers to perform existing procedures far faster and more accurately than ever. This paper uses dynamic carious lesion activity assessment as a case study, to illustrate how visual computing on advanced cyberinfrastructure can expand beyond statistical number crunching and information retrieval to make an imaginative and creative contribution to some aspects of dental science. Our work focuses on the generation of BIG pictures on cyberinfrastructure and the presentation of derived dental structures in an interactive means, which combine to allow researchers to navigate from observation to qualitative discovery and then to quantitative assessment with multiple variables and degrees of freedom. Our work has seen early use by our collaborators in oral health research, where our system has been used to pose and answer domain-specific questions for quantitative assessment of dynamic carious lesion activities.

Mining frequent subsequences of patterns, or sequential pattern mining, has wide application in customer shopping sequence analysis, web log stream analysis, multi-modal behavioral studies, to name a few. To detect unknown, anomalous, and unexpected patterns from large-scale interval-based temporal data without complete a priori knowledge is challenging. In this paper, we present a framework - PESMiner which allows parallel and quantitative mining of sequential patterns at scale. Whereas most existing sequential mining algorithms can only find sequential orders of temporal events, our work presents a novel interactive temporal data mining algorithm capable of extracting precise temporal properties of sequential patterns. Furthermore, our work provides a unified parallel solution that scales our algorithms to larger temporal data sets by exploiting iterative MapReduce tasks. Comprehensive performance evaluations demonstrate that PESMiner significantly outperforms existing interval-based mining algorithms in terms of both quality (i.e. accuracy, precision, and recall) and scalability.