Search

The interaction between technology and healthcare has a long history. However, recent years have witnessed the rapid growth and adoption of the Internet of Things (IoT) paradigm, the advent of miniature wearable biosensors, and research advances in big data techniques for effective manipulation of large, multiscale, multimodal, distributed, and heterogeneous data sets. These advances have generated new opportunities for personalized precision eHealth and mHealth services. IoT heralds a paradigm shift in the healthcare horizon by providing many advantages, including availability and accessibility, ability to personalize and tailor content, and cost-effective delivery. Although IoT eHealth has vastly expanded the possibilities to fulfill a number of existing healthcare needs, many challenges must still be addressed in order to develop consistent, suitable, safe, flexible, and power-efficient systems that are suitable fit for medical needs. To enable this transformation, it is necessary for a large number of significant technological advancements in the hardware and software communities to come together. This keynote paper addresses all these important aspects of novel IoT technologies for smart healthcare-wearable sensors, body area sensors, advanced pervasive healthcare systems, and big data analytics. It identifies new perspectives and highlights compelling research issues and challenges, such as scalability, interoperability, device-network-human interfaces, and security, with various case studies. In addition, with the help of examples, we show how knowledge from CAD areas, such as large scale analysis and optimization techniques can be applied to the important problems of eHealth. [ABSTRACT FROM AUTHOR]

The 2022 IEEE World Congress on Services will be held in a hybrid mode with physical presence in Barcelona, Spain. SERVICES is the premier international forum for presenting and discussing the most recent and significant technical research contributions in the field of services computing. Centered around web-based services, SERVICES 2022 covers various systems and networking research pertaining to cloud, edge and IoT, as well as technologies for intelligent computing, learning, Big Data, blockchain, and digital healthcare applications, addressing critical issues such as knowledge network, high performance, security, privacy, dependability, trustworthiness, and cost-effectiveness. Particularly, the 2022 Congress will welcome papers on the aftermath and the impact of COVID-19 on services and the world infrastructure. In addition to co-located theme-topic conferences, the Congress will also include symposia supporting deep-dive discussions on emerging topics, and complement the SERVICES 2022 program with industry and application presentations and panels. Authors are invited to prepare early and submit original and unpublished papers to any of these conferences at www.easychair.org. All submitted manuscripts will be peer- reviewed by at least three reviewers. Accepted and presented papers will appear in the conference proceedings published by the IEEE Computer Society Press. SERVICES 2022 is the only premier professional event for the services computing field offered by IEEE, under the auspice of the Technical Committee on Services Computing (TCSVC). [ABSTRACT FROM AUTHOR]

Recognizing actions from still images has been popularly studied recently. In this paper, we model an action class as a flexible number of spatial configurations of body parts by proposing a new spatial sum–product network (SPN). First, we discover a set of parts in image collections via unsupervised learning. Then, our new spatial SPN is applied to model the spatial relationship and also the high-order correlations of parts. To learn robust networks, we further develop a hierarchical spatial SPN method, which models pairwise spatial relationship between parts inside subimages and models the correlation of subimages via extra layers of SPN. Our method is shown to be effective on two benchmark data sets. [ABSTRACT FROM PUBLISHER]

Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers. [ABSTRACT FROM AUTHOR]

Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers. [ABSTRACT FROM AUTHOR]

Prospective authors are requested to submit new, unpublished manuscripts for inclusion in the upcoming event described in this call for papers. [ABSTRACT FROM PUBLISHER]

Stream processing is used in various fields. In the field of big data, stream aggregation is a popular processing technique, but it suffers serious setbacks when the order of events (e.g., stream elements) occurring is different from the order of events arriving to the systems. Such data streams are called “non-FIFO steams”. This phenomenon usually occurs in a distributed environment due to many factors, such as network disruptions, delays, etc. Many analyzing scenarios require efficient processing of such non-FIFO streams to meet various data processing requirements. This paper proposes an efficient scalable checkpoint-based bidirectional indexing approach, called $CPiX$ C P i X , for faster real-time analysis over non-FIFO streams. CPiX maintains the partial aggregation results in an on-demand manner per checkpoint. CPiX needs less time and space than the state-of-the-art approach. Extensive experiments confirm that CPiX can deal with out-of-order streams very efficiently and is, on average, about 3.8 times faster than the state-of-the-art approach while consuming less memory. [ABSTRACT FROM AUTHOR]

The emergence of Internet of Things (IoT) and new manufacturing paradigms have brought greater complexity of massive datasets. Radio frequency identification (RFID), as one of the key IoT technologies, has been used to collect real-time production data to support the manufacturing decision-making in smart factories. The adoption of these technologies results in a large amount of data collection. To extract useful information from this data, this paper utilizes a big data approach to figure out useful insights from RFID-enabled data regarding possible bottlenecks or inefficiencies on the shop floor so as to improve the quality management. Time and quality are the main metrics measured in this paper, where the longest process times, part accuracy percentage, and failure rate are determined for each of the workers (UserIDs) and process types (ProcCodes). Key findings and observations are significant to make advanced decisions in the smart factory by making full use of the RFID captured data. Note to Practitioners— This paper was motivated by a real-life company which has used RFID technology for over ten years. Great myriad of data has been captured from frontline production shop floors where machines, workers, materials, and manufacturing jobs were logically associated. Processing time and quality data are studied in this paper so as to investigate the production performance in the RFID-enabled smart factory. [ABSTRACT FROM AUTHOR]

In this paper, we consider the development of algorithms for the automatic detection of buried threats using ground penetrating radar (GPR) measurements. GPR is one of the most studied and successful modalities for automatic buried threat detection (BTD), and a large variety of BTD algorithms have been proposed for it. Despite this, large-scale comparisons of GPR-based BTD algorithms are rare in the literature. In this paper, we report the results of a multi-institutional effort to develop advanced BTD algorithms for a real-world GPR BTD system. The effort involved five institutions with substantial experience with the development of GPR-based BTD algorithms. In this paper, we report the technical details of the advanced algorithms submitted by each institution, representing their latest technical advances, and many state-of-the-art GPR-based BTD algorithms. We also report the results of evaluating the algorithms from each institution on the large experimental data set used for development. The experimental data set comprised 120 000 m2 of GPR data using surface area, from 13 different lanes across two U.S. test sites. The data were collected using a vehicle-mounted GPR system, the variants of which have supplied data for numerous publications. Using these results, we identify the most successful and common processing strategies among the submitted algorithms, and make recommendations for GPR-based BTD algorithm design. [ABSTRACT FROM AUTHOR]

Many big data applications produce a massive amount of high-dimensional, real-time, and evolving streaming data. Clustering such data streams with both effectiveness and efficiency are critical for these applications. Although there are well-known data stream clustering algorithms that are based on the popular online-offline framework, these algorithms still face some major challenges. Several critical questions are still not answer satisfactorily: How to perform dimensionality reduction effectively and efficiently in the online dynamic environment? How to enable the clustering algorithm to achieve complete real-time online processing? How to make algorithm parameters learn in a self-supervised or self-adaptive manner to cope with high-speed evolving streams? In this paper, we focus on tackling these challenges by proposing a fully online data stream clustering algorithm (called ESA-Stream) that can learn parameters online dynamically in a self-adaptive manner, speedup dimensionality reduction, and cluster data streams effectively and efficiently in an online and dynamic environment. Experiments on a wide range of synthetic and real-world data streams show that ESA-Stream outperforms state-of-the-art baselines considerably in both effectiveness and efficiency. [ABSTRACT FROM AUTHOR]

This paper proposes a complex-valued convolutional neural network for land form classification and discovery in interferometric synthetic aperture radar (InSAR). Since the amount of satellite-borne SAR data has been increasing drastically, it is necessary to structurize the local features contained in observation data prior to utilization in the so-called big data framework for higher usability. Convolutional neural networks have such potential in general. However, there exists no network that can deal with complex amplitude data obtained in InSAR consistently. In this paper, we propose a complex-valued convolutional neural network to deal with InSAR. We demonstrate that the network classifies slopes and plains adaptively and, moreover, indicates small volcanos similar to a sample volcano (Omuroyama) included in the InSAR data. We also find their characteristic features emerging in the kernels in the convolution layers. These results reveal that the proposed complex-valued convolutional neural network is capable of successfully discovering unidentified lands similar to a prepared sample, which is highly useful for the InSAR data structurization. [ABSTRACT FROM AUTHOR]

Over the past five years, topic models have been applied to bibliometrics research as an efficient tool for discovering latent and potentially useful content. The combination of topic modeling algorithms and bibliometrics has generated new challenges of interpreting and understanding the outcome of topic modeling. Motivated by these new challenges, this paper proposes a systematic methodology for topic analysis in scientific literature corpora to face the concerns of conducting post topic modeling analysis. By linking the corpus metadata with the discovered topics, we feature them with a number of topic-based analytic indices to explore their significance, developing trend, and received attention. A topic relation identification approach is then presented to quantitatively model the relations among the topics. To demonstrate the feasibility and effectiveness of our methodology, we present two case studies, using big data and dye-sensitized solar cell publications derived from searches in World of Science. Possible application of the methodology in telling good stories of a target corpus is also explored to facilitate further research management and opportunity discovery. [ABSTRACT FROM AUTHOR]

A schedule-based system is a system that operates on or contains within a schedule of events and breaks at particular time intervals. Entities within the system show presence or absence in these events by entering or exiting the locations of the events. Given radio frequency identification (RFID) data from a schedule-based system, what can we learn about the system (the events and entities) through data mining? Which data mining methods can be applied so that one can obtain rich actionable insights regarding the system and the domain? The research goal of this paper is to answer these posed research questions, through the development of a framework that systematically produces actionable insights for a given schedule-based system. We show that through integrating appropriate data mining methodologies as a unified framework, one can obtain many insights from even a very simple RFID dataset, which contains only very few fields. The developed framework is general, and is applicable to any schedule-based system, as long as it operates under certain basic assumptions. The types of insights are also general, and are formulated in this paper in the most abstract way. The applicability of the developed framework is illustrated through a case study, where real world data from a schedule-based system is analyzed using the introduced framework. Insights obtained include the profiling of entities and events, the interactions between entity and events, and the relations between events. [ABSTRACT FROM AUTHOR]

Current train delay (TD) prediction systems do not take advantage of state-of-the-art tools and techniques for handling and extracting useful and actionable information from the large amount of endogenous (i.e., generated by the railway system itself) and exogenous (i.e., related to railway operation but generated by external phenomena) data available. Additionally, they are not designed in order to deal with the intrinsic time varying nature of the problem (e.g., regular changes in the nominal timetable, etc.). The purpose of this paper is to build a dynamic data-driven TD prediction system that exploits the most recent tools and techniques in the field of time varying big data analysis. In particular, we map the TD prediction problem into a time varying multivariate regression problem that allows exploiting both historical data about the train movements and exogenous data about the weather provided by the national weather services. The performance of these methods have been tuned through the state-of-the-art thresholdout technique, a very powerful procedure which relies on the differential privacy theory. Finally, the performance of two efficient implementations of shallow and deep extreme learning machines that fully exploit the recent in-memory large-scale data processing technologies have been compared with the current state-of-the-art TD prediction systems. Results on real-world data coming from the Italian railway network show that the proposal of this paper is able to remarkably improve the state-of-the-art systems. [ABSTRACT FROM AUTHOR]

In this paper, we present a comparative evaluation of various multi-person tracking-by-detection approaches on public data sets. This paper investigates five popular trackers coupled with six relevant visual people detectors evaluated on seven public data sets. The evaluation emphasizes on exhibited performance variation depending on tracker-detector choices. Our experimental results show that the overall performance depends on how challenging the data set is, the performance of the detector on the specific data set, and the tracker-detector combination. Some trackers are more sensitive to the choice of a detector and some detectors to the choice of a tracker than others. Based on our results, two of the trackers demonstrate the best performances consistently across different data sets, whereas the best performing detectors vary per data set. This underscores the need for careful application context specific evaluation when choosing a detector. [ABSTRACT FROM AUTHOR]

The classical solution to an underdetermined system of linear equations mainly has two opposite directions, which lead to either a large l2-norm sparse solution or a non-sparse minimum l2-norm solution. In this paper, we systematically show that by modifying the well-known basic matching pursuit algorithm originally proposed to identify the sparse solution, an alternative solution between the two classical ones could be obtained. The modified algorithm, termed as random matching pursuit (RMP), is then used to create a novel image watermarking framework. Compared to conventional systems, the security is substantially improved by the use of random over-complete dictionaries and the order parameter of RMP. Capacity can also be increased thanks to the transform with over-complete dictionaries that could expand signal dimension. Meanwhile, imperceptibility and robustness properties of the proposed design framework are not compromised. The classical spread spectrum and improved spread spectrum techniques are applied to the proposed framework for practical implementations. The novelty and effectiveness of the proposed systems are supported by rigorous performance analysis and experimental results using an image data set. This paper reveals the potential of using over-complete dictionaries in multimedia watermarking systems, which theoretically leads to the exploration of alternative candidates among the infinite solutions to underdetermined linear systems other than minimum l2-norm and sparse ones. [ABSTRACT FROM AUTHOR]

Traditional approaches for classifying event videos rely on a manually curated training data set. While this paradigm has achieved excellent results on benchmarks, such as TrecVid multimedia event detection (MED) challenge data sets, it is restricted by the effort involved in careful annotation. Recent approaches have attempted to address the need for annotation by automatically extracting images from the web, or generating queries to retrieve videos. In the former case, they fail to exploit additional cues provided by video data, while in the latter, they still require some manual annotation to generate relevant queries. We take an alternate approach in this paper, leveraging the synergy between visual video data and the associated textual metadata, to learn event classifiers without manually annotating any videos. Specifically, we first collect a video data set with queries constructed automatically from textual description of events, prune irrelevant videos with text and video data, and then learn the corresponding event classifiers. We evaluate this approach in the challenging setting where no manually annotated training set is available, i.e., EK0 in the TrecVid challenge, and show state-of-the-art results on MED 2011 and 2013 data sets. [ABSTRACT FROM AUTHOR]

This paper presents the analysis of all driving during 1 year by 14 older drivers from the Candrive study. Data analytic techniques have been applied to this unique big data set that includes global positioning system and geographic information system data with an average of 1567 trips and 20 200 km for each driver. The drivers have stable general, cognitive, and physical health over the year. This paper identifies trip features and tests their potential to be used to distinguish between driver pairs and shows that trip length and duration allow 90.1% and 90.1% of the 91 driver pairs (14 drivers) to be distinguished ( $p<5$ %). Driver velocity histograms are also shown to allow driver pairs to be distinguished. This paper explores the deceleration habits of the drivers by locating all deceleration events with a net velocity drop of >=4 km/h (average of 30 156 events per driver) and finds that the event mean and minimum deceleration values have different two-phase relationships for each driver. Trips taken by a driver are compared with the drivers’ two-phase relationships and this paper shows that the measures achieve their maximum performance for trips with >=8 events. The minimum measure is better (correlation of 0.74) than the mean measure (0.54). These relationships provide a measure of a driver’s unique behaviors and could allow more personalized autonomous driving systems and capture features of the deceleration habits for the driver that can be used to distinguish between drivers. [ABSTRACT FROM PUBLISHER]

Representation learning with small labeled data have emerged in many problems, since the success of deep neural networks often relies on the availability of a huge amount of labeled data that is expensive to collect. To address it, many efforts have been made on training sophisticated models with few labeled data in an unsupervised and semi-supervised fashion. In this paper, we will review the recent progresses on these two major categories of methods. A wide spectrum of models will be categorized in a big picture, where we will show how they interplay with each other to motivate explorations of new ideas. We will review the principles of learning the transformation equivariant, disentangled, self-supervised and semi-supervised representations, all of which underpin the foundation of recent progresses. Many implementations of unsupervised and semi-supervised generative models have been developed on the basis of these criteria, greatly expanding the territory of existing autoencoders, generative adversarial nets (GANs) and other deep networks by exploring the distribution of unlabeled data for more powerful representations. We will discuss emerging topics by revealing the intrinsic connections between unsupervised and semi-supervised learning, and propose in future directions to bridge the algorithmic and theoretical gap between transformation equivariance for unsupervised learning and supervised invariance for supervised learning, and unify unsupervised pretraining and supervised finetuning. We will also provide a broader outlook of future directions to unify transformation and instance equivariances for representation learning, connect unsupervised and semi-supervised augmentations, and explore the role of the self-supervised regularization for many learning problems. [ABSTRACT FROM AUTHOR]

In the last years, crowdsourcing is transforming the way classification training sets are obtained. Instead of relying on a single expert annotator, crowdsourcing shares the labelling effort among a large number of collaborators. For instance, this is being applied in the laureate laser interferometer gravitational waves observatory (LIGO), in order to detect glitches which might hinder the identification of true gravitational-waves. The crowdsourcing scenario poses new challenging difficulties, as it has to deal with different opinions from a heterogeneous group of annotators with unknown degrees of expertise. Probabilistic methods, such as Gaussian processes (GP), have proven successful in modeling this setting. However, GPs do not scale up well to large data sets, which hampers their broad adoption in real-world problems (in particular LIGO). This has led to the very recent introduction of deep learning based crowdsourcing methods, which have become the state-of-the-art for this type of problems. However, the accurate uncertainty quantification provided by GPs has been partially sacrificed. This is an important aspect for astrophysicists in LIGO, since a glitch detection system should provide very accurate probability distributions of its predictions. In this work, we first leverage a standard sparse GP approximation (SVGP) to develop a GP-based crowdsourcing method that factorizes into mini-batches. This makes it able to cope with previously-prohibitive data sets. This first approach, which we refer to as scalable variational Gaussian processes for crowdsourcing (SVGPCR), brings back GP-based methods to a state-of-the-art level, and excels at uncertainty quantification. SVGPCR is shown to outperform deep learning based methods and previous probabilistic ones when applied to the LIGO data. Its behavior and main properties are carefully analyzed in a controlled experiment based on the MNIST data set. Moreover, recent GP inference techniques are also adapted to crowdsourcing and evaluated experimentally. [ABSTRACT FROM AUTHOR]

Submission deadline: 31 January 2016. This upcomming special issue targets a mixed audience of researchers and investigators from several communities and research fields, including those from social media, multimedia signal processing, and distributed and Cloud computing. This issue will only consider papers on new technologies, applications, services, and novel ideas to achieve realization of multimedia big data on Clouds. [ABSTRACT FROM PUBLISHER]

The expected explosive growth of big data, the Internet of Things, artificial intelligence, and 5G mobile networks will not only challenge but also offer new opportunities to solid-state memories in the next decade. Mainstream technologies such as the 3-D NAND Flash and the 1T-1C DRAM technology will have to keep evolving to prolong their scaling trends and maintain their undisputed leadership in the standalone memory arena. At the same time, other memory technologies may take advantage of the rise of the new market applications, likely changing the balance among cost, performance, and reliability. Phase-change memories (PCM), magnetoresistive random-access memories (MRAM), resistive random-access memories (ReRAM), and ferroelectric memories have the potential to play a role both in the embedded and in the standalone memory market. However, all of them will need innovations to fully demonstrate their long-term performance. Finally, all the memory technologies will have to compete to prove the benefits of new applications and solutions, such as the mixing of storage and computing with in-memory computing, neuromorphic computing, and nonvolatile logic. [ABSTRACT FROM AUTHOR]

Locally recoverable codes are very important due to their applications in distributed storage systems. In this paper, by using cyclic codes, we construct two classes of optimal q-ary cyclic $(\text {r}, \delta _{1})$ locally recoverable codes with parameters $[2(\text {q}+1), 2(\text {q}+1)-2\delta _{1}, \delta _{1}+2]_{\text {q}}$ , where $q$ is an odd prime power and $\text {r}+\delta _{1}-1=\text {q}+1$ , and $(\text {r}, \delta _{2})$ locally recoverable codes with parameters $[2(\text {q}+1), 2(\text {q}+1)-4\delta _{2}+2, \delta _{2}+2]_{q}$ , where $\text {q}\geq 7$ is an odd prime power, $\text {q}\equiv 3~ (mod~ 4)$ and $r+\delta _{2}-1=\frac {\text {q}+1}{2}$. Compared with the known cyclic and constacyclic $(\text {r}, \delta)$ locally recoverable codes, our construction yields new optimal cyclic $(\text {r}, \delta)$ locally recoverable codes. [ABSTRACT FROM AUTHOR]

Concept drift describes unforeseeable changes in the underlying distribution of streaming data over time. Concept drift research involves the development of methodologies and techniques for drift detection, understanding, and adaptation. Data analysis has revealed that machine learning in a concept drift environment will result in poor learning results if the drift is not addressed. To help researchers identify which research topics are significant and how to apply related techniques in data analysis tasks, it is necessary that a high quality, instructive review of current research developments and trends in the concept drift field is conducted. In addition, due to the rapid development of concept drift in recent years, the methodologies of learning under concept drift have become noticeably systematic, unveiling a framework which has not been mentioned in literature. This paper reviews over 130 high quality publications in concept drift related research areas, analyzes up-to-date developments in methodologies and techniques, and establishes a framework of learning under concept drift including three main components: concept drift detection, concept drift understanding, and concept drift adaptation. This paper lists and discusses 10 popular synthetic datasets and 14 publicly available benchmark datasets used for evaluating the performance of learning algorithms aiming at handling concept drift. Also, concept drift related research directions are covered and discussed. By providing state-of-the-art knowledge, this survey will directly support researchers in their understanding of research developments in the field of learning under concept drift. [ABSTRACT FROM AUTHOR]

The concept of Big Data is often used to describe any extremely large set of data and the analytical methods used to derive meaning from it. In semiconductor manufacturing, more sensors are added to manufacturing equipment to capture deeper levels of equipment and process data which gives engineers the opportunity to achieve tighter control of their manufacturing processes. The amount of data is increasing at an exponential rate, but the time available to analyze the data is not. This means engineers must become more efficient in finding the most critical data and responding to out-of-control events. This paper expands on a paper presented at the 2019 Compound Semiconductor Manufacturing Technology Conference in Minneapolis. We present automated data filtering techniques and additional Data Visualization tools that effectively communicate results when data is presented in tables and graphs. We show how we implemented these tools as part of a Process Engineering Dashboard. [ABSTRACT FROM AUTHOR]

A central question in the era of big data is what to do with the enormous amount of information. One possibility is to characterize it through statistics, e.g., averages, or classify it using machine learning, in order to understand the general structure of the overall data. The perspective in this paper is the opposite, namely that most of the value in the information in some applications is in the parts that deviate from the average, that are unusual, atypical. We define what we mean by atypical in an axiomatic way as data that can be encoded with fewer bits in itself rather than using the code for the typical data. We show that this definition has good theoretical properties. We then develop an implementation based on universal source coding, and apply this to a number of real world data sets. [ABSTRACT FROM AUTHOR]

Processing large very high-resolution remote sensing images on resource-constrained devices is a challenging task because of the large size of these data sets. For applications such as environmental monitoring or natural resources management, complex algorithms have to be used to extract information from the images. The memory required to store the images and the data structures of such algorithms may be very high (hundreds of gigabytes) and therefore leads to unfeasibility on commonly available computers. Segmentation algorithms constitute an essential step for the extraction of objects of interest in a scene and will be the topic of the investigation in this paper. The objective of the present work is to adapt image segmentation algorithms for large amounts of data. To overcome the memory issue, large images are usually divided into smaller image tiles, which are processed independently. Region-merging algorithms do not cope well with image tiling since artifacts are present on the tile edges in the final result due to the incoherencies of the regions across the tiles. In this paper, we propose a scalable tile-based framework for region-merging algorithms to segment large images, while ensuring identical results, with respect to processing the whole image at once. We introduce the original concept of the stability margin for a tile. It allows ensuring identical results to those obtained if the whole image had been segmented without tiling. Finally, we discuss the benefits of this framework and demonstrate the scalability of this approach by applying it to real large images. [ABSTRACT FROM PUBLISHER]

Optimal resource provisioning is essential for scalable big data analytics. However, it has been difficult to accurately forecast the resource requirements before the actual deployment of these applications as their resource requirements are heavily application and data dependent. This paper identifies the existence of effective memory resource requirements for most of the big data analytic applications running inside JVMs in distributed Spark environments. Provisioning memory less than the effective memory requirement may result in rapid deterioration of the application execution in terms of its total execution time. A machine learning-based prediction model is proposed in this paper to forecast the effective memory requirement of an application given its service level agreement. This model captures the memory consumption behavior of big data applications and the dynamics of memory utilization in a distributed cluster environment. With an accurate prediction of the effective memory requirement, it is shown that up to 60 percent savings of the memory resource is feasible if an execution time penalty of 10 percent is acceptable. The accuracy of the model is evaluated on a physical Spark cluster with 128 cores and 1TB of total memory. The experiment results show that the proposed solution can predict the minimum required memory size for given acceptable delays with high accuracy, even if the behavior of target applications is unknown during the training of the model. [ABSTRACT FROM AUTHOR]

Compared with other applications in computer vision, convolutional neural networks (CNNs) have underperformed on pedestrian detection. A breakthrough was made very recently using sophisticated deep CNN (DCNN) models, with a number of handcrafted features or explicit occlusion handling mechanism. In this paper, we show that by reusing the convolutional feature maps of a DCNN model as image features to train an ensemble of boosted decision models, we are able to achieve the best reported accuracy without using specially designed learning algorithms. We empirically identify and disclose important implementation details. We also show that pixel labeling may be simply combined with a detector to boost the detection performance. By adding complementary handcrafted features such as optical flow, the DCNN-based detector can be further improved. We advance the state-of-the-art results by lowering the log-average miss rate from 11.7% to 8.9% on the Caltech data set and from 11.2% to 8.6% on the Inria data set. We also achieve a comparable result to state-of-the-art approaches on the KITTI data set. [ABSTRACT FROM AUTHOR]

A distributed storage system (DSS) is one of the most vital components of a cloud computing system used for storing and sharing big data among authorized users. A typical DSS consists of ${ n}$ storage nodes each with a storage capacity of ${\alpha }$ units of data such that the entire file stored on the DSS can be recovered by accessing any ${k < n}$ nodes. The objective of this paper is to construct fractional repetition (FR) codes with applications in DSSs. FR codes are the key to constructing a class of distributed storage codes with exact repair by transfer (i.e., upon failure, a failed storage node is exactly regenerated through simple downloading). A major drawback of existing FR codes is that they are insufficiently flexible to adapt adequately to system changes in DSSs. To address this problem, this paper introduces a new type of FR codes, called pliable FR codes, in which both the per-node storage ${\alpha }$ and repetition degree ${ \rho }$ can easily and simultaneously be adjusted. In addition, this paper presents several constructions of pliable FR codes and provides a relatively comprehensive analysis of the constructed pliable FR codes, which reveals the following versatile properties of the codes: 1) the transposed codes of the constructed codes are also pliable FR codes; 2) the constructed codes attain a tight upper bound on the file size with equality at least for ${1 \le k < \min (3, k' + 1)}$ , where ${k'}$ is the smallest value of ${k}$ such that ${k \alpha - (k - 1) > \frac {n - 1}{\rho - 1}}$ ; 3) the constructed codes also meet a Singleton-like bound on the minimum distance at least for ${1 \le k < 3}$ , which demonstrates their optimality; 4) the computational complexity necessary for determining the file size or the minimum distance of the constructed codes can be greatly reduced when it is hard to exactly determine them; and 5) the constructed codes can be used as fractional repetition batch codes to provide load balancing in DSSs, for which the batch size (i.e., the number of symbols that can be read in parallel) can be exactly determined. [ABSTRACT FROM AUTHOR]

In this paper, we propose a discriminative framework for online simultaneous segmentation and classification of modeled visual actions that can be performed in the context of other unknown actions. To this end, we employ Hough transform to vote in a 3D space for the begin point, the end point, and the label of the segmented part of the input stream. A support vector machine is used to model each class and to suggest putative labeled segments on the timeline. To identify the most plausible segments among the putative ones, we apply a dynamic programming algorithm, which maximizes the likelihood for label assignment in linear time. The performance of our method is evaluated on synthetic as well as on real data (Weizmann, TUM Kitchen, UTKAD, and Berkeley Multimodal Human Action databases). Extensive quantitative results obtained on a number of standard data sets demonstrate that the proposed approach is of comparable accuracy with the state-of-the-art approaches for online stream segmentation and classification when all performed actions are known, and performs considerably better in the presence of unmodeled actions. [ABSTRACT FROM AUTHOR]

A time instant is said to be a critical instant for a task, if the task’s arrival at the instant makes the duration between the task’s arrival and completion the longest. Critical instants for a task, once revealed, make it possible to check the task’s schedulability by investigating situations associated with the critical instants. This potentially results in efficient and tight schedulability tests, which is important in real-time systems. For example, existing studies have discovered critical instants under preemptive fixed-priority scheduling (P-FP), which limit interference from carry-in jobs, yielding the state-of-the-art schedulability tests on both uniprocessor and multiprocessor platforms. However, studies on schedulability tests associated with critical instants have not matured yet for non-preemptive scheduling, especially on a multiprocessor platform. In this paper, we find necessary conditions for critical instants for non-preemptive global fixed-priority scheduling (NP-FP) on a multiprocessor platform, and develop a new schedulability test that takes advantage of the finding for reducing carry-in jobs’ interference. Evaluation results show that the proposed schedulability test finds up to 14.3 percent additional task sets schedulable by NP-FP, which are not deemed schedulable by the state-of-the-art NP-FP schedulability test. [ABSTRACT FROM AUTHOR]

Extracting latent low-dimensional structure from high-dimensional data is of paramount importance in timely inference tasks encountered with “Big Data” analytics. However, increasingly noisy, heterogeneous, and incomplete datasets, as well as the need for real-time processing of streaming data, pose major challenges to this end. In this context, the present paper permeates benefits from rank minimization to scalable imputation of missing data, via tracking low-dimensional subspaces and unraveling latent (possibly multi-way) structure from incomplete streaming data. For low-rank matrix data, a subspace estimator is proposed based on an exponentially weighted least-squares criterion regularized with the nuclear norm. After recasting the nonseparable nuclear norm into a form amenable to online optimization, real-time algorithms with complementary strengths are developed, and their convergence is established under simplifying technical assumptions. In a stationary setting, the asymptotic estimates obtained offer the well-documented performance guarantees of the batch nuclear-norm regularized estimator. Under the same unifying framework, a novel online (adaptive) algorithm is developed to obtain multi-way decompositions of low-rank tensors with missing entries and perform imputation as a byproduct. Simulated tests with both synthetic as well as real Internet and cardiac magnetic resonance imagery (MRI) data confirm the efficacy of the proposed algorithms, and their superior performance relative to state-of-the-art alternatives. [ABSTRACT FROM PUBLISHER]

This paper deals with change detection of utility maximization behavior given a dataset. In online social media, such changes occur due to the effect of marketing, advertising, or changes in ground truth. First, we use the revealed preference framework to detect the unknown time point (change point) at which the utility function changed. We derive necessary and sufficient conditions for detecting the change point. Second, in the presence of noisy measurements, we propose a method to detect the change point and construct a decision test. Also, an optimization criteria is provided to recover the linear perturbation coefficients. Finally, to reduce the computational cost, a dimensionality reduction algorithm using Johnson–Lindenstrauss transform is presented. The results developed are illustrated on two real datasets: Yahoo! Tech Buzz dataset and Youstatanalyzer dataset. By using the results developed in the paper, several useful insights can be gleaned from these datasets. First, the changes in ground truth affecting the utility of the agent can be detected by utility maximization behavior in online search. Second, the recovered utility functions satisfy the single crossing property indicating strategic substitute behavior in online search. Finally, due to the large number of videos in YouTube, the utility maximization behavior was verified through the dimensionality reduction algorithm. [ABSTRACT FROM PUBLISHER]

High-dimensional data streams are becoming increasingly ubiquitous in industrial systems. Efficient detection of system faults from these data can ensure the reliability and safety of the system. The difficulties brought about by high dimensionality and data streams are mainly the “curse of dimensionality” and concept drifting, and one current challenge is to simultaneously address them. To this purpose, this paper presents an approach to fault detection from nonstationary high-dimensional data streams. An angle-based subspace anomaly detection approach is proposed to detect low-dimensional subspace faults from high-dimensional datasets. Specifically, it selects fault-relevant subspaces by evaluating vectorial angles and computes the local outlier-ness of an object in its subspace projection. Based on the sliding window strategy, the approach is further extended to an online mode that can continuously monitor system states. To validate the proposed algorithm, we compared it with the local outlier factor-based approaches on artificial datasets and found the algorithm displayed superior accuracy. The results of the experiment demonstrated the efficacy of the proposed algorithm. They also indicated that the algorithm has the ability to discriminate low-dimensional subspace faults from normal samples in high-dimensional spaces and can be adaptive to the time-varying behavior of the monitored system. The online subspace learning algorithm for fault detection would be the main contribution of this paper. [ABSTRACT FROM PUBLISHER]

This paper describes a method for rapid resolution of parametric failure during the development period. Since the number of samples is small, it is not possible to carry out general big data analysis of white defect failures of CMOS image sensors (CISs) during the development period in the same way as can be done during the mass production period. Our feature value analysis of white defects based on device physics revealed that both a development product and mass products using big data show similar fluctuations in dark current spectroscopy and in-plane distribution in the wafer. Process step/tool identification and tool sensor data analysis revealed the degree of vacuum within the implantation tool to have a strong correlation with white defect count. We developed a virtual metrology (VM) model for white defect count and varied the degree of vacuum. As a result of our experiments, we were able to reduce white defect count during the development period by 75%. The time required for resolution of failures was 10% that of the conventional method. This paper describes a detailed explanation of how the potential causative process step/tool was identified in addition to the conference paper presented in ISSM2020. [ABSTRACT FROM AUTHOR]

Recommender systems (RSs) commonly adopt a user-item rating matrix to describe users’ preferences on items. With users and items exploding, such a matrix is usually high-dimensional and sparse (HiDS). Recently, the idea of deep learning has been applied to RSs. However, current deep-structured RSs suffer from high computational complexity. Enlightened by the idea of deep forest, this paper proposes a deep latent factor model (DLFM) for building a deep-structured RS on an HiDS matrix efficiently. Its main idea is to construct a deep-structured model by sequentially connecting multiple latent factor (LF) models instead of multilayered neural networks through a nonlinear activation function. Thus, the computational complexity grows linearly with its layer count, which is easy to resolve in practice. The experimental results on four HiDS matrices from industrial RSs demonstrate that when compared with state-of-the-art LF models and deep-structured RSs, DLFM can well balance the prediction accuracy and computational efficiency, which well fits the desire of industrial RSs for fast and right recommendations. [ABSTRACT FROM AUTHOR]

Human Digital Twins (HDTs) have emerged as a key technology in digitalizing human-centered applications, able to enhance decision-making, personalize healthcare, and optimize workplace environments. However, despite a growing research body, there exists a critical lack of guidance for designing sophisticated, user-centric HDTs. In addressing this gap, this paper reports a systematic literature review of 44 papers in the field of HDTs (published between 2022 and 2023) to distill key design process insights and identify gaps in the current understanding and approaches to HDT design. Based on insights from this review, we introduce ETHICA, a systematic methodology that advocates for an iterative development process, emphasizing stakeholder collaboration and focusing on ethical and user-centric principles throughout the design life cycle. The resulting ETHICA methodology offers a robust blueprint for constructing sophisticated HDTs that harmonizes technological advancements with human-centered design and ethical considerations, encouraging a shift towards more holistic and human-centric approaches in the emerging field of Digital Twin technologies.

The Metaverse platform offers 3D immersive experiences through virtual reality, artificial intelligence, and blockchain technologies. Blockchain-based Metaverse has garnered recent interest due to its decentralization, anonymity, and other security features. Integrating blockchain into Metaverse promotes the formation of a shared ecosystem and provides digital asset tracking, privacy protection, and security in both virtual and physical environments. This paper explores the role of blockchain in creating and managing the Metaverse platform. It is intended to provide a helpful reference for researchers and practitioners in the field of the blockchain-based Metaverse. The main topics covered include the concept and characteristics of the Metaverse; its different use cases, architectures, and technologies; Metaverse as a service provider; Metaverse management; Metaverse users and data; and blockchain-based Metaverse in terms of roles, technologies, applications, and challenges. In addition, recent advances in the blockchain-based Metaverse and challenges such as scalability, interoperability, and edge resource sharing will be discussed. The paper will conclude by highlighting open research issues and future directions, including improving immersion, scalability, security, and integration with existing systems.

Action recognition from videos is an important area of computer vision research due to its various applications, ranging from visual surveillance to human–computer interaction. To address action recognition problems, this paper presents a framework that jointly models multiple complex actions and motion units at different hierarchical levels. We achieve this by proposing a generative topic model, namely, multi-label hierarchical Dirichlet process (ML-HDP). The ML-HDP model formulates the co-occurrence relationship of actions and motion units, and enables highly accurate recognition. In particular, our topic model possesses the three-level representation in action understanding, where low-level local features are connected to high-level actions via mid-level atomic actions. This allows the recognition model to work discriminatively. In our ML-HDP, atomic actions are treated as latent topics and automatically discovered from data. In addition, we incorporate the notion of class labels into our model in a semi-supervised fashion to effectively learn and infer multi-labeled videos. Using discovered topics and inferred labels, which are jointly assigned to local features, we present the straightforward methods to perform three recognition tasks including action classification, joint classification and segmentation of continuous actions, and spatiotemporal action localization. In experiments, we explore the use of three different features and demonstrate the effectiveness of our proposed approach for these tasks on four public datasets: KTH, MSR-II, Hollywood2, and UCF101. [ABSTRACT FROM AUTHOR]

Recently, along with the wide application of new generation information technologies (New IT) in manufacturing, many countries issued their national advanced manufacturing development strategies, such as Industrial Internet, Industry 4.0, and Made in China 2025. One common aim of these strategies is to achieve smart manufacturing, which demands the interoperation, integration, and fusion of the physical world and the cyber world of manufacturing. As well, New IT [such as Internet of Things (IoT), cloud computing, big data, mobile Internet, and cyber-physical systems (CPS)] have played pivotal roles in promoting smart manufacturing. Data generated in the physical world can be sensed and transfered to the cyber world through IoT and the Internet, and be processed and analyzed by cloud computing, big data technologies to adjust the physical world. The physical world and the cyber world of manufacturing are integrated based on CPS. On the other hand, servitization has become a prominent trend in the manufacturing. Embracing the concept of “Manufacturing-as-a-Service,” manufacturing is provided as service for users. Because of the characteristics of interoperability and platform independence, services pave the way for large-scale smart applications and manufacturing collaboration. Combining New IT and services, this paper proposes a framework—New IT driven service-oriented smart manufacturing (SoSM). SoSM aims at facilitating the visions of smart manufacturing by making full use of New IT and services. Complementary to the framework of SoSM, the New IT driven typical characteristics of SoSM are also investigated and discussed, respectively. [ABSTRACT FROM AUTHOR]

The storage and the transmission of messages in big data are discussed in this paper, where message importance is taken into account. To this end, we propose to use non-parametric message importance measure (NMIM) as a measure of message importance, which can characterize the uncertainty of random events like Shannon entropy and Rényi entropy. We prove that NMIM sufficiently describes the two key characters of big data, i.e., the rare events finding and the large diversities of events. Based on NMIM, we then propose an effective compressed encoding mode for data storage, and discuss the transmission of messages over some typical channel models with limited message importance loss. Our numerical results show that the proposed strategy occupies less storage space without losing too much important information, and the maximum received entropy rate increases with the increasing of message importance loss until it reaches saturation, which contributes to designing of better practical communication system. [ABSTRACT FROM AUTHOR]

IEEE GLOBECOM 2013, the premier international event held from December 9 - 13 in Atlanta, Georgia, highlighted its 56th annual conference with the presentation of more than 1,500 technical papers, keynotes, business panels and industry forums dedicated to next wave communications and the newest advancements in cloud computing, Big Data and 5G technologies. [ABSTRACT FROM AUTHOR]