The widespread adoption of encrypted network protocols has made traffic encryption ubiquitous, creating substantial challenges for network management and security. This paper introduces a novel encrypted traffic classification system, ANASETC, which combines traffic burst features with Neural Architecture Search (NAS) to automatically design efficient neural network architectures. ANASETC autonomously generates high-performance classification models, significantly reducing manual intervention while maintaining high classification accuracy. To enhance search efficiency, we introduce a new search space called ETNasnet, which optimizes the training process through parameter sharing among sub-models. We evaluate ANASETC’s performance on three public datasets and a real-world satellite network traffic dataset. The results show that ANASETC achieves an optimal balance between classification accuracy and search efficiency, demonstrating strong robustness and adaptability across various task scenarios, outperforming state-of-the-art methods.

Image segmentation remains a pivotal challenge in computer vision, particularly in complex scenarios requiring fine-grained feature discrimination. Current approaches often suffer from inefficient feature utilization and local detail loss during semantic segmentation. To address these limitations, we propose a novel deep neural network with multi-scale attention fusion for accurate fine-grained image segmentation and the lightweight architecture ensures computational efficiency without sacrificing accuracy. Our approach integrates three key components: the Dynamic Spatial-Atrous Spatial Pyramid Pooling (DSA-ASPP) module, which combines depthwise separable convolution with adaptive dilation rates to reduce parameters; a multi-scale attention fusion mechanism which hierarchically integrates features to enhance local texture discriminability and minimizing computational overhead. and the PreactResNet-ECA, a pre-activated residual network with channel-wise attention optimized for fine-grained feature interaction. Experimental results on CamVid and Cityscapes datasets demonstrate the superior performance of our proposed model, achieving mean intersection-over-union (mIoU) scores of 69.6% and 73.6%, respectively, with inference speeds reaching 255.8 FPS. Furthermore, evaluations on fine-grained datasets (CUB-200-2011 and Stanford Dogs) reveal that our PreactResNet-based model outperforms state-of-the-art approaches, attaining accuracies of 93.0% and 97.0%. The framework effectively preserves local texture details, reduces pixel-level misclassification, and offers a balanced trade-off between accuracy and computational efficiency.

Shapelets that discriminate time series using local features (subsequences) are promising for time series clustering. Existing time series clustering methods may fail to capture representative shapelets because they discover shapelets from a large pool of uninformative subsequences, and thus result in low clustering accuracy. This paper proposes a Semi-supervised Clustering of Time Series Using Representative Shapelets (SE-Shapelets) method, which utilizes a small number of labeled and propagated pseudo-labeled time series to help discover representative shapelets, thereby improving the clustering accuracy. In SE-Shapelets, we propose two techniques to discover representative shapelets for the effective clustering of time series. (1) A salient subsequence chain (SSC) that can extract salient subsequences (as candidate shapelets) of a labeled/pseudo-labeled time series, which helps remove massive uninformative subsequences from the pool. (2) A linear discriminant selection (LDS) algorithm to identify shapelets that can capture representative local features of time series in different classes, for convenient clustering. Experiments on UCR time series datasets demonstrate that SE-shapelets discovers representative shapelets and achieves higher clustering accuracy than counterpart semi-supervised time series clustering methods.

Abstract Entity alignment plays an essential role in the integration of knowledge graphs (KGs) as it seeks to identify entities that refer to the same real-world objects across different KGs. Recent research has primarily centred on embedding-based approaches. Among these approaches, there is a growing interest in graph neural networks (GNNs) due to their ability to capture complex relationships and incorporate node attributes within KGs. Despite the presence of several surveys in this area, they often lack comprehensive investigations specifically targeting GNN-based approaches. Moreover, they tend to evaluate overall performance without analysing the impact of individual components and methods. To bridge these gaps, this paper presents a framework for GNN-based entity alignment that captures the key characteristics of these approaches. We conduct a fine-grained analysis of individual components and assess their influences on alignment results. Our findings highlight specific module options that significantly affect the alignment outcomes. By carefully selecting suitable methods for combination, even basic GNN networks can achieve competitive alignment results.

Supervised Question Answering systems (QA systems) rely on domain-specific humanlabeled data for training.Unsupervised QA systems generate their own question-answer training pairs, typically using secondary knowledge sources to achieve this outcome.Our approach (called PIE-QG) uses Open Information Extraction (OpenIE) to generate synthetic training questions from paraphrased passages and uses the question-answer pairs as training data for a language model for a state-of-the-art QA system based on BERT.Triples in the form of are extracted from each passage, and questions are formed with subjects (or objects) and predicates while objects (or subjects) are considered as answers.Experimenting on five extractive QA datasets demonstrates that our technique achieves onpar performance with existing state-of-the-art QA systems with the benefit of being trained on an order of magnitude fewer documents and without any recourse to external reference data sources.

The success of advanced Background Subtraction (BGS) algorithms for dynamic backgrounds is mostly in land scenes such as those in CDNet benchmarks; few handle underwater scenes, since existing underwater video datasets are either in low resolution or with only static backgrounds. Consequently, the lack of reliable BGS support makes supervised Moving-Objects Segmentation (MOS) algorithms much harder to adapt to unknown underwater scenes because of the diversities of the aquatic environments. For example, those trained by the latest underwater image dataset, SUIM, are ineffective in the underwater videos of our experiments.The underwater waving objects (e.g., plants) often render existing BGS algorithms inaccurate due to three types of errors: (a) incompletely identified MOs (Moving Objects), (b) missing MOs, and (c) falsely identified MOs. In this paper, we propose a novel Clustering-Based Multi-State Background Representation (CBMSBR) model to learn and represent the repeatable patterns of waving movements in k background states (i.e., color ranges) per pixel, and thus accurately subtract the background waving objects to reduce these errors. In addition, we further develop a CBMSBR+ model to remove the more challenging background objects in unusually large magnitudes of wavings. Both models come from a basic observation: the video pixels in the waving zones repeatedly switch among multiple background states; e.g., a pixel switches among water state, plant 1 state, and plant 2 state. To test our proposed models, we create experiments using three types of challenging scenarios that each often covers at least two error types, i.e., the scattered MOs scenario covering (b) and (c), the crowded MOs scenario covering (a) - (c), and the slow MOs scenario covering (a) and (c). Experiments on these scenarios demonstrate the accuracy, effectiveness, and efficiency of our models and their applications in MOS improvements.

Autonomous racing has lately gained popularity because of its entertainment value and potential of advancing autonomous driving in high-speed situations. These high-speed racing efforts usually focus on a road domain with fixed dynamics. They cannot meet the challenge of policy adaptation between domains with large dynamics gaps. Meanwhile, existing policy adaptation methods either rely on experts to build new environments for policy training, or only handle a small dynamics gap for low-speed control tasks due to limited dynamics modeling and rigorous data collection assumptions. To overcome these drawbacks, we introduce DAARL, a novel policy adaptation algorithm that uses adversarial and reinforcement learning to bridge the large dynamics gap between different domains. It has two training stages. In the first training stage, a domain transfer function is learned by adversarial learning to better capture the dynamics gap. The single domain transfer function integrates with the source domain to implement the dynamics of different target domains virtually without the help of experts. We name these virtual domains the imaginary target domains. In the second training stage, the knowledge of the source-domain policy guides the reinforcement learning of a target-domain policy on an imaginary target domain. It improves the convergence of the target-domain policy. Five experiments have been conducted on a racing simulator with different road domains. All results show that DAARL outperforms baselines in terms of driving speed, stability, success rate, and domain scalability.

In the author list, "Ferry Sansoto" should be Ferry Susanto.• To reflect more accurately the contribution of the article, the title should be changed to "A permutation and equinumerosity based polynomial-time algorithm for simple undirected graph isomorphism."• In the abstract, the "Pythagorean Triples Theorem" should be removed.• In the abstract, "squared sums of elements" should be "nth power sums."• In Section 2.2, "and the sum of the individual squared elements.By checking two sums," should be ", the sum of the individual squared elements and until the sum of the nth power of the nth element in the array.By checking these sums,"• In Section 2.2, "For both vertex and edge arrays of row/column sum based on the vertex and edge adjacency matrices, if and only if one array is a permutation of another one, the corresponding two graphs are isomorphic."should be "For both the vertex and edge arrays of row/column sum based on the vertex and edge adjacency matrices, if and only if one array is a permutation of another one and the corresponding edge and vertex's adjacent relationship has been preserved, the corresponding two graphs are isomorphic."

Summary Human emotions can be recognized from facial expressions captured in videos. It is a growing research area in which many have attempted to improve video emotion detection in both lab‐controlled and unconstrained environments. While existing methods show a decent recognition accuracy on lab‐controlled datasets, they deliver much lower accuracy in a real‐world uncontrolled environment, where a variety of challenges need to be addressed such as variations in illumination, head pose, and individual appearance. Moreover, automatically identifying the key frames consisting of the expression from real‐world videos is another challenge. In this article, to overcome these challenges, we provide a video emotion recognition via multiple feature fusion method. First, a uniform local binary pattern (LBP) and the scale‐invariant feature transform features are extracted from each frame in the video sequences. By applying a random forest classifier, all of the static frames are then labelled by the related emotion class. In this way, the key frames can be automatically identified, including neutral and other expressions. Furthermore, from the key frames, a new geometric feature vector and the LBP from three orthogonal planes are extracted. To further improve robustness, audio features are extracted from the video sequences as an additional dimension to augmenting visual facial expression analysis. The audio and visual features are fused through a kernel multimodal sparse representation. Finally, the corresponding emotion labels to the video sequences can be assigned when a multimodal quality measure specifies the quality of each modality and its role in the decision. The results on both acted facial expressions in the Wild and MMI datasets demonstrate that the proposed method outperforms several counterpart video emotion recognition methods.

Summary With the development of internet technologies, social media and mobile devices, short texts have become an increasingly popular medium among users to communicate with friends, search information and review products. Measuring the similarity between short texts is a fundamental task due to its importance in many applications, such as text retrieval, topic discovery, and event detection. However, short texts generally comprise sparse, noisy, and ambiguous information. Hence, effectively measuring the distance between short texts is a challenging task. In this paper, we exploit the advantageous corpus‐wide word co‐occurrence information into document‐level feature enrichment to mitigate the challenges caused by the sparseness of short texts for distance measurement. We propose a novel context‐aware weighted Biterm method for short text Distance Measurement (BDM). In BDM, we extract biterms (ie, word pairs) from a short text corpus and exploit a biterm topic model to determine the global weights of biterms in the corpus. We then determine the local importance of a biterm in different contexts (ie, short texts) based on the corpus‐level biterm weight. The distance between two short texts is computed using the context‐aware weighted biterms. Experimental results on three real‐world datasets demonstrate better accuracy and effectiveness of the proposed BDM.

Summary In case of sharp road illumination changes, bad weather such as rain, snow or fog, wear or missing of the lane marking, the reflective water stain on the road surface, the shadow obstruction of the tree, and mixed lane markings and other signs, missing detection or wrong detection will occur for the traditional lane marking detection algorithm. In this manuscript, a lane marking detection algorithm based on high‐precision map and multisensor fusion is proposed. The basic principle of the algorithm is to use the centimeter‐level high‐precision positioning combined with high‐precision map data to complete the detection of lane markings. In the process of generating high‐precision maps or in the uncovered areas of high‐precision maps, LIDAR (LIght Detection And Ranging) is used to estimate the curvature of the road to assist in lane marking detection. The experimental results show that the algorithm has lower false detection rate in case of bad road conditions, and the algorithm is robust.

Crowd counting and localisation are essential tasks in crowd analysis and are vital to ensure public safety. However, these tasks via UAV bring new obstacles compared with video surveillance (e.g. viewpoint and scale variations, background clutter, and small scales). To overcome the difficulties, this research presents a novel network named PDNet. It employs the multi-task learning approach to combine the point regression and density map regression. PDNet includes a backbone to extract multi-scale features, a Dilated Feature Fusion module (DFF), a Density Map Attention module (DMA), a density map branch and a point branch. Aims of DFF is to address the difficulties of small targets and scale variations by establishing relationships between targets and their surroundings. DMA is created to address the challenges of complicated backgrounds, allowing the PDNet to focus on the target's location. In addition, the density map branch and point branch are designed for density maps regression and point regression, respectively. Experiments on the DroneCrowd dataset demonstrate that our proposed network outperforms state-of-the-art approaches in terms of localisation, L-mAP (53.85%), L-AP@10 (59.14%), L-AP@15 (63.64%), and L-AP@20 (66.21%), and we improved counting performance and significantly reduced inference time. In addition, ablation experiments are conducted to prove the modules' effectiveness.

Summary The graph isomorphism problem is to determine two finite graphs that are isomorphic which is not known with a polynomial‐time solution. This paper solves the simple undirected graph isomorphism problem with an algorithmic approach as NP=P and proposes a polynomial‐time solution to check if two simple undirected graphs are isomorphic or not. Three new representation methods of a graph as vertex/edge adjacency matrix and triple tuple are proposed. A duality of edge and vertex and a reflexivity between vertex adjacency matrix and edge adjacency matrix were first introduced to present the core idea. Beyond this, the mathematical approval is based on an equivalence between permutation and bijection. Because only addition and multiplication operations satisfy the commutative law, we propose a permutation theorem to check fast whether one of two sets of arrays is a permutation of another or not. The permutation theorem was mathematically approved by Integer Factorization Theory, Pythagorean Triples Theorem, and Fundamental Theorem of Arithmetic. For each of two n ‐ary arrays, the linear and squared sums of elements were respectively calculated to produce the results.

Negative survey is an effective method to protect the privacy of survey participants and has many applications. Different from normal survey, it hides personal privacy by requiring an individual participant to provide a negative option as the answer to the survey question. Answers of participants can further be reconstructed into the distribution of positive options. However, the current negative survey that assumes all participants are 100 percent confident in their answers introduces some precision loss to the reconstruction process. In this paper, we provide an accurate negative survey by allowing participants to annotate their confidence levels to the answers. In particular, we develop a novel Negative Survey to Positive Survey with Answer Confidence Level (NStoPS-CL) algorithm to reconstruct the negative survey with answer confidence level and further increase the accuracy of reconstruction. Experiments demonstrate that NStoPS-CL reliably improves the reconstruction accuracy by testing answer confidence level under different conditions (i.e., dataset size, number of question options and dataset distributions), while balancing reconstruction accuracy and privacy well.

Eigenvalue decomposition is widely used in dimensionality reduction for knowledge engineering, in particular principal component analysis and other similar spectral methods. Traditional eigenvalue decomposition algorithms for decomposing a matrix of size n ×nn×n are usually of complexity O(n3)O(n3), due to a bottleneck in using Householder/Givens transforms to convert a general matrix to a tri-diagonal one. It is proposed in this article a new algorithm that takes only O(n2.584963log 1/ε) computational complexity to achieve accuracy ε of eigenvalue decomposition for any ε > 0ε>0. The basic idea of our algorithm is to convert a matrix into a diagonal form in multi-scale divide and conquer scheme, and the conversion is to iteratively and recursively apply two phases of operations called diagonal attractions and diagonal absorptions respectively. In a diagonal attraction, it attracts the off-diagonal entries to make the entries nearer to the diagonal larger in magnitude than those farther away from the diagonal. In a diagonal absorption, it absorbs the near-to-diagonal nonzero entries into the diagonal. In such a scheme, no Householder or Givens transforms are involved. Moreover, diagonal attractions and diagonal absorptions can be implemented with fast matrix multiplications. The scheme's divide and conquer pattern also allows our algorithm to be easily mapped to modern computer hardware. Our algorithm also complements well the family of randomized eigenvalue/SVD algorithms using sampling techinques, which are of complexity O(nαpolylog(1/ε)) with small α but very large overheads in the polylog. Their strength in the small exponent αα of nn in complexity was easily cancelled by the exploding overheads in the polylog. Now, with their low-accuracy estimate refined by our algorithm for high accuracy, their strength can be boosted significantly.

The topological distance is to measure the structural difference between two graphs in a metric space. Graphs are ubiquitous, and topological measurements over graphs arise in diverse areas, including, e.g. COVID-19 structural analysis, DNA/RNA alignment, discovering the Isomers, checking the code plagiarism. Unfortunately, popular distance scores used in these applications, that scale over large graphs, are not metrics, and the computation usually becomes NP-hard. While, fuzzy measurement is an uncertain representation to apply for a polynomial-time solution for undirected multigraph isomorphism. But the graph isomorphism problem is to determine two finite graphs that are isomorphic, which is not known with a polynomial-time solution. This paper solves the undirected multigraph isomorphism problem with an algorithmic approach as NP=P and proposes a polynomial-time solution to check if two undirected multigraphs are isomorphic or not. Based on the solution, we define a new fuzzy measurement based on graph isomorphism for topological distance/structural similarity between two graphs. Thus, this paper proposed a fuzzy measure of the topological distance between two undirected multigraphs. If two graphs are isomorphic, the topological distance is 0; if not, we will calculate the Euclidean distance among eight extracted features and provide the fuzzy distance. The fuzzy measurement executes more efficiently and accurately than the current methods.

Summary The increasing amount of solid waste is becoming a significant problem that needs to be addressed urgently. The reliable and accurate classification method is a crucial step in waste disposal because different types of wastes have different disposal ways. The existing waste classification models driven by deep learning are not easy to achieve accurate results and still need to be improved due to the various architecture networks adopted. Their performance on different datasets is varied, and there is also a lack of specific large‐scale datasets for training. We propose a new combination classification model based on three pretrained CNN models (VGG19, DenseNet169, and NASNetLarge) for processing the ImageNet database and achieve high classification accuracy. In our proposed model, the transfer learning model based on each pretrained model is constructed as a candidate classifier, and the optimal output of three candidate classifiers is selected as the final classification result. The experiments based on two waste image datasets demonstrate that the proposed model achieves 96.5% and 94% classification accuracy and outperforms several counterpart methods.

Summary The performance of active contour model is limited on retinal vessel segmentation as vessel images are usually corrupted with intensity inhomogeneity, low contrast, and weak boundary, which severely affect the segmentation results of retinal vessels. A new active contour model combining the local and global information is proposed in this paper to facilitate the vessel segmentation. In our model, the fuzzy conception is firstly introduced as fuzzy methods generally provide more accurate and robust clustering and the concept of fuzziness in fuzzy clustering, which is represented by membership, can reflect the intensity distribution of the image. Then, we define local energy based on Maximum a Posterior Probability and use spatially varying parameters, mean and stand deviation, to describe the local Gaussian distribution in order to better deal with intensity inhomogeneity. Furthermore, we combine local and global energy based on fuzzy clustering, with a weight coefficient. The coefficient is computed by a weight function according to contrast ratio of the image. Experiments on synthetic and real images and comparisons with other state‐of‐the‐art active contour models show that the proposed model can detect objects more accurate and robust, especially for vessels on retinal angiogram.

Group recommendation has become highly demanded when users communicate in the forms of group activities in online sharing communities. These group activities include student group study, family TV program watching, friends travel decision, etc. Existing group recommendation techniques mainly focus on the small user groups. However, online sharing communities have enabled group activities among thousands of users. Accordingly, recommendation over large groups has become urgent. In this paper, we propose a new framework to accomplish this goal by exploring the group interests and the connections between group users. We first divide a big group into different interest subgroups, each of which contains users closely connected with each other and sharing the similar interests. Then, for each interest subgroup, our framework exploits the connections between group users to collect a comparably compact potential candidate set of media-user pairs, on which the collaborative filtering is performed to generate an interest subgroup-based recommendation list. After that, a novel aggregation function is proposed to integrate the recommended media lists of all interest subgroups as the final group recommendation results. Extensive experiments have been conducted on two real social media datasets to demonstrate the effectiveness and efficiency of our proposed approach.

Abstract The problem of risk classification and prediction, an essential research direction, aiming to identify and predict risks for various applications, has been researched in this paper. To identify and predict risks, numerous researchers build models on discovering hidden information of a label (positive credit or negative credit). Fuzzy logic is robust in dealing with ambiguous data and, thus, benefits the problem of classification and prediction. However, the way to apply fuzzy logic optimally depends on the characteristics of the data and the objectives, and it is extraordinarily tricky to find such a way. This paper, therefore, proposes a general membership function model for fuzzy sets (GMFMFS) in the fuzzy decision tree and extend it to the fuzzy random forest method. The proposed methods can be applied to identify and predict the credit risks with almost optimal fuzzy sets. In addition, we analyze the feasibility of our GMFMFS and prove our GMFMFS‐based linear membership function can be extended to a nonlinear membership function without a significant increase in computing complex. Our GMFMFS‐based fuzzy decision tree is tested with a real dataset of US credit, Susy dataset of UCI, and synthetic datasets of big data. The results of experiments further demonstrate the effectiveness and potential of our GMFMFS‐based fuzzy decision tree with linear membership function and nonlinear membership function.

Due to the rapid growth of smart grids, use of smart meters (SMs) have increased in the recent days. The main problem with the use of SMs is that by observing the SMs reading, it is possible to infer the daily activities of the consumers. Therefore, protection of privacy is a major concern related to SMs. Using rechargeable batteries (RBs) is a popular method in protecting the privacy in SMs as these methods do not tamper with SM readings. The major problem in RB-based mechanism is that the energy management unit (EMU) cannot protect privacy, if the demand is lower or higher for a longer period. To overcome this problem, in this paper a heuristic method has been proposed by considering time varying target output load based on the three major properties of artificial fish swarm optimization algorithm. For the optimal choice of the time varying target output load, RB constraints as well as reduction of the average cost of energy have been considered in our proposed method. We have proposed two privacy preserving mechanisms for both offline and online scenarios. The proposed method preserves privacy while reducing the cost of energy. Simulation results show that the proposed method is able to provide privacy by overcoming the problem identified in the existing methods.

Witnessing the wide spread of malicious information in large networks, we develop an efficient method to detect anomalous diffusion sources and thus protect networks from security and privacy attacks. To date, most existing work on diffusion sources detection are based on the assumption that network snapshots that reflect information diffusion can be obtained continuously. However, obtaining snapshots of an entire network needs to deploy detectors on all network nodes and thus is very expensive. Alternatively, in this article, we study the diffusion sources locating problem by learning from information diffusion data collected from only a small subset of network nodes. Specifically, we present a new regression learning model that can detect anomalous diffusion sources by jointly solving five challenges, that is, unknown number of source nodes, few activated detectors, unknown initial propagation time, uncertain propagation path and uncertain propagation time delay. We theoretically analyze the strength of the model and derive performance bounds. We empirically test and compare the model using both synthetic and real-world networks to demonstrate its performance.

The creation of sharing communities has resulted in the astonishing increasing of digital videos, and their wide applications in the domains such as entertainment, online news broadcasting etc. The improvement of these applications relies on effective solutions for social user access to video data. This fact has driven the recent research interest in social recommendation in shared communities. Although certain effort has been put into video recommendation in shared communities, the contextual information on social users has not been well exploited for effective recommendation. In this paper, we propose an approach based on the content and social information of videos for the recommendation in sharing communities. Specifically, we first exploit a robust video cuboid signature together with the Earth Mover's Distance to capture the content relevance of videos. Then, we propose to identify the social relevance of clips using the set of users belonging to a video. We fuse the content relevance and social relevance to identify the relevant videos for recommendation. Following that, we propose a novel scheme called sub-community-based approximation together with a hash-based optimization for improving the efficiency of our solution. Finally, we propose an algorithm for efficiently maintaining the social updates in dynamic shared communities. The extensive experiments are conducted to prove the high effectiveness and efficiency of our proposed video recommendation approach.

With the advance of computing and electronic technology, quantitative data, for example, continuous data (i.e., sequences of floating point numbers), become vital and have wide applications, such as for analysis of sensor data streams and financial data streams. However, existing association rule mining generally discover association rules from discrete variables, such as boolean data (`O' and `l') and categorical data (`sunny', `cloudy', `rainy', etc.) but very few deal with quantitative data. In this paper, a novel optimized fuzzy association rule mining (OFARM) method is proposed to mine association rules from quantitative data. The advantages of the proposed algorithm are in three folds: 1) propose a novel method to add the smoothness and flexibility of membership function for fuzzy sets; 2) optimize the fuzzy sets and their partition points with multiple objective functions after categorizing the quantitative data; and 3) design a two-level iteration to filter frequent-item-sets and fuzzy association-rules. The new method is verified by three different data sets, and the results have demonstrated the effectiveness and potentials of the developed scheme.

Unlike in general recommendation scenarios where a user has only a single role, users in trust rating network, e.g. Epinions, are associated with two different roles simultaneously: as a truster and as a trustee. With different roles, users can show distinct preferences for rating items, which the previous approaches do not involve. Moreover, based on explicit single links between two users, existing methods can not capture the implicit correlation between two users who are similar but not socially connected. In this paper, we propose to learn dual role preferences (truster/trustee-specific preferences) for trust-aware recommendation by modeling explicit interactions (e.g., rating and trust) and implicit interactions. In particular, local links structure of trust network are exploited as two regularization terms to capture the implicit user correlation, in terms of truster/trustee-specific preferences. Using a real-world and open dataset, we conduct a comprehensive experimental study to investigate the performance of the proposed model, RoRec. The results show that RoRec outperforms other trust-aware recommendation approaches, in terms of prediction accuracy.

With the rapid development of Internet, the amount of information on the Web grows explosively, people often feel puzzled and helpless in finding and getting the information they really need. For overcoming this problem, recommender systems such as s

Detecting abnormalities from multiple correlated time series is valuable to those applications where a credible realtime event prediction system will minimize economic losses (e.g. stock market crash) and save lives (e.g. medical surveillance in the operating theatre). For example, in an intensive care scenario, anesthetists perform a vital role in monitoring the patient and adjusting the flow and type of anesthetics to the patient during an operation. An early awareness of possible complications is vital for an anesthetist to correctly react to a given situation. In this demonstration, we provide a comprehensive medical surveillance system to effectively detect abnormalities from multiple physiological data streams for assisting online intensive care management. Particularly, a novel online support vector regression (OSVR) algorithm is developed to approach the problem of discovering the abnormalities from multiple correlated time series for accuracy and real-time efficiency. We also utilize historical data streams to optimize the precision of the OSVR algorithm. Moreover, this system comprises a friendly user interface by integrating multiple physiological data streams and visualizing alarms of abnormalities.

Combining the Semantic Web and the Ubiquitous Web, Web 3.0 is for things . The Semantic Web enables human knowledge to be machine-readable and the Ubiquitous Web allows Web services to serve any thing, forming a bridge between the virtual world and the real world. By using context, Web services can become smarter—that is, aware of the target things' or applications' physical environments, or situations and respond proactively and intelligently. Existing methods for implementing context-aware Web services on Web 2.0 mainly enumerate different implementations corresponding to different attribute values of the context, in order to improve the Quality of Services (QoS). However, things in the physical world are extremely diverse, which poses new problems for Web services: it is difficult to unify the context of things and to implement a flexible smart Web service for things. This article proposes a novel smart Web service based on the context of things, which is implemented using a REpresentational State Transfer for Things (Thing-REST) style, to tackle the two problems. In a smart Web service, the user's description (semantic context) and sensor reports (sensing context) are two channels for acquiring the context of things which are then employed by ontology services to make the context of things machine-readable. With guidance of domain knowledge services, event detection services can analyze things' needs particularly, well through the context of things. We then propose a Thing-REST style to manage the context of things and user context, and to mashup Web services through three structures (i.e., chain, select, and merge) to implement smart Web services. A smart plant watering-service application demonstrates the effectiveness of our method.

In data gathering wireless sensor networks, data loss often happens due to external faults such as random link faults and hazard node faults, since sensor nodes have constrained resources and are often deployed in inhospitable environments. However, already known fault tolerance mechanisms often bring new internal faults (e.g. out-of-power faults and collisions on wireless bandwidth) to the original network and dissipate lots of extra energy and time to reduce data loss. Therefore, we propose a novel Dual Cluster Heads Cooperation (CoDuch) scheme to tolerate external faults while introducing less internal faults and dissipating less extra energy and time. In CoDuch scheme, dual cluster heads cooperate with each other to reduce extra costs by sending only one copy of sensed data to the Base Station; also, dual cluster heads check errors with each other during the collecting data process. Two algorithms are developed based on the CoDuch scheme: CoDuch-l for tolerating link faults and CoDuch-b for tolerating both link faults and node faults; theory and experimental study validate their effectiveness and efficiency.

Extracting knowledge from the transaction records and the personal data of credit card holders has great profit potential for the banking industry. The challenge is to detect/predict bankrupts and to keep and recruit the profitable customers. However, grouping and targeting credit card customers by traditional data-driven mining often does not directly meet the needs of the banking industry, because data-driven mining automatically generates classification outputs that are imprecise, meaningless, and beyond users' control. In this paper, we provide a novel domain-driven classification method that takes advantage of multiple criteria and multiple constraint-level programming for intelligent credit scoring. The method involves credit scoring to produce a set of customers' scores that allows the classification results actionable and controllable by human interaction during the scoring process. Domain knowledge and experts' experience parameters are built into the criteria and constraint functions of mathematical programming and the human and machine conversation is employed to generate an efficient and precise solution. Experiments based on various data sets validated the effectiveness and efficiency of the proposed methods.

Abstract Scientific workflow offers a framework for cooperation between remote and shared resources on a grid computing environment (GCE) for scientific discovery. One major function of scientific workflow is to schedule a collection of computational subtasks in well‐defined orders for efficient outputs by estimating task duration at runtime. In this paper, we propose a novel time computation model based on algorithm complexity (termed as TCMAC model) for high‐level data intensive scientific workflow design. The proposed model schedules the subtasks based on their durations and the complexities of participant algorithms. Characterized by utilization of task duration computation function for time efficiency, the TCMAC model has three features for a full‐aspect scientific workflow including both dataflow and control‐flow: (1) provides flexible and reusable task duration functions in GCE; (2) facilitates better parallelism in iteration structures for providing more precise task durations; and (3) accommodates dynamic task durations for rescheduling in selective structures of control flow. We will also present theories and examples in scientific workflows to show the efficiency of the TCMAC model, especially for control‐flow. Copyright © 2009 John Wiley & Sons, Ltd.

Memory faults are major forms of software bugs that severely threaten system availability and security in C/C++ program. Many tools and techniques are available to check memory faults, but few provide systematic full-scale research and quantitative analysis. Furthermore, most of them produce high noise ratio of warning messages that require many human hours to review and eliminate false-positive alarms. And thus, they cannot locate the root causes of memory faults precisely. This paper provides an innovative state machine to check memory faults, which has three main contributions. Firstly, five concise formulas describing memory faults are given to make the mechanism of the state machine simple and flexible. Secondly, the state machine has the ability to locate the cause roots of the memory faults. Finally, a case study applying to an embedded software, which is written in 50 thousand lines of C codes, shows it can provide useful data to evaluate the reliability and quality of software