Search

Privacy-preserving set operations have important practical and theoretical significance and have always been a research focus of secure multiparty computation. Most existing studies focus on single set operations which cannot express many complicated set operations. However, the studies on mixed set operations are highly limited. The available protocols for mixed set operations can only be implemented through a threshold fully homomorphic encryption scheme. Since mixed set operations are necessary in practice, it is necessary to design an efficient and practical secure computation protocol for mixed set operations. In this paper, we propose a new protocol for mixed set operations that is based on a new encoding method and the threshold ElGamal cryptosystem. Through an efficiency analysis, it is proved that the efficiency of the protocol that is proposed in this paper are significantly higher than those of the available protocols. [ABSTRACT FROM AUTHOR]

Abstract Wireless Sensor Network (WSN) monitoring takes a primary role in many industrial and research processes. Huge amounts of WSN sensor readings are nowadays available and can be analyzed to discover fruitful knowledge. This paper focuses on analyzing historical WSN sensor readings to identify the combinations of sensors whose readings show an unexpected trend. Although significant variations of single sensor readings may be easily detected, discovering correlations between multiple sensor readings is challenging without using advanced data analytics tools. To tackle this issue, we present an itemset-based data mining approach to analyzing WSN data. It identifies the combinations of sensors (of arbitrary size) whose readings are unexpectedly low in a given time period. Since the readings acquired by multiple sensors may decrease in an alternate fashion, the discovered patterns provide new information compared to single sensor analysis. To make the mined patterns manageable by domain experts for manual inspection, the mining algorithm is driven by spatial constraints defined on the WSN topology. The experimental results, achieved on real WSN data, demonstrate the effectiveness of the proposed approach in detecting heating system malfunctioning. [ABSTRACT FROM AUTHOR]

Abstract: In crisp run control rules, usually it is stated that a process moves very sharply from in-control condition to out-of-control act. This causes an increase in both false-alarm rate and control chart sensitivity. Moreover, the classical run control rules are not implemented on an intelligent sampling strategy that changes control charts’ parameters to reduce error probability when the process appears to have a shift in parameter values. This paper presents a new hybrid method based on a combination of fuzzified sensitivity criteria and fuzzy adaptive sampling rules, which make the control charts more sensitive and proactive while keeping false alarms rate acceptably low. The procedure is based on a simple strategy that includes varying control chart parameters (sample size and sample interval) based on current fuzzified state of the process and makes inference about the state of process based on fuzzified run rules. Furthermore, in this paper, the performance of the proposed method is examined and compared with both conventional run rules and adaptive sampling schemes. [Copyright &y& Elsevier]

Abstract: In this paper, we introduce weights into Pawlak rough set model to balance the class distribution of a data set and develop a weighted rough set based method to deal with the class imbalance problem. In order to develop the weighted rough set based method, we design first a weighted attribute reduction algorithm by introducing and extending Guiasu weighted entropy to measure the significance of an attribute, then a weighted rule extraction algorithm by introducing a weighted heuristic strategy into LEM2 algorithm, and finally a weighted decision algorithm by introducing several weighted factors to evaluate extracted rules. Furthermore, in order to estimate the performance of the developed method, we compare the weighted rough set based method with several popular methods used for class imbalance learning by conducting experiments with twenty UCI data sets. Comparative studies indicate that in terms of AUC and minority class accuracy, the weighted rough set based method is better than the re-sampling and filtering based methods, and is comparable to the decision tree and SVM based methods. It is therefore concluded that the weighted rough set based method is effective for class imbalance learning. [Copyright &y& Elsevier]

Abstract: Many methods based on the rough set to deal with incomplete information systems have been proposed in recent years. However, they are only suitable for the incomplete systems with regular attributes whose domains are not preference-ordered. This paper thus attempts to present research focusing on a complex incomplete information system—the incomplete ordered information system. In such incomplete information systems, all attributes are considered as criterions. A criterion indicates an attribute with preference-ordered domain. To conduct classification analysis in the incomplete ordered information system, the concept of similarity dominance relation is first proposed. Two types of knowledge reductions are then formed for preserving two different notions of similarity dominance relations. With introduction of the approximate distribution reduct into the incomplete ordered decision system, the judgment theorems and discernibility matrixes associated with four novel approximate distribution reducts are obtained. A numerical example is employed to substantiate the conceptual arguments. [Copyright &y& Elsevier]

Abstract: Applying dither to highly nonlinear systems may suppress chaotic phenomena, but dynamic performance, such as convergence rate and disturbance attenuation, is usually not guaranteed. This paper presents a dithered H ∞ robust fuzzy control scheme to stabilize chaotic systems that ensures disturbance attenuation bounds. In the proposed scheme, Takagi–Sugeno (T–S) fuzzy linear models are used to describe the relaxed models of the dithered chaotic system, and fuzzy controllers are designed based on an extension to the concept of parallel distributed compensation (PDC). Sufficient condition for the existence of the H ∞ robust fuzzy controllers is presented in terms of a novel linear matrix inequalities (LMI) form which takes full consideration of modeling error and disturbances, but cannot be solved by the standard procedures. In order to solve the LMI problem and to identify the chaotic systems as T–S fuzzy modes, we propose a compound optimization strategy called the island-based random-walk algorithm (IRA). The algorithm is composed of a set of communicating random-walk optimization procedures concatenated with the down-hill simplex method. The design procedure and validity of the proposed scheme is demonstrated via numerical simulation of the dithered fuzzy control of a chaotic system. [Copyright &y& Elsevier]

Abstract: This paper presents the use of a Taylor series for fuzzy multiobjective linear fractional programming problems (FMOLFP). The Taylor series is a series expansion that a representation of a function. In the proposed approach, membership functions associated with each objective of fuzzy multiobjective linear fractional programming problem transformed by using a Taylor series are unified. Thus, the problem is reduced to a single objective. Practical applications and numerical examples are used in order to show the efficiency and superiority of the proposed approach. [Copyright &y& Elsevier]

Abstract: In this paper, the notions of L-fuzzy convex sets and L-fuzzy numbers are introduced where L is a completely distributive lattice. The notions of [0,1]-fuzzy convex sets and [0,1]-fuzzy numbers are generalized. Furthermore their properties and characterizations are presented in terms of cut sets of L-fuzzy sets. [Copyright &y& Elsevier]

Abstract: The n-dimensional folded hypercube FQ n , a variation of the hypercube proposed by Ahmed et al. [A. El-Amawy, S. Latifi, Properties and performance of folded hypercubes, IEEE Transactions on Parallel and Distributed Systems 2(3) (1991) 31–42], is an (n +1)-regular (n +1)-connected graph. Conditional diagnosability, a new measure of diagnosability introduced by Lai et al. [Pao-Lien Lai, Jimmy J.M. Tan, Chien-Ping Chuang, Lih-Hsing Hsu, Conditional diagnosability measures for large multiprocessor systems, IEEE Transactions on Computers 54(2) (2005) 165–175] can better measure the diagnosability of regular interconnection networks. This paper determines that under PMC-model the conditional diagnosability of FQ n (t c (FQ n )) is 4n −3 when n =5 or n ⩾8; t c (FQ3)=3, t c (FQ4)=7. [Copyright &y& Elsevier]

Abstract: In this paper, we propose a distributed agent model that applies belief-desire-intention (BDI) reasoning and negotiation for addressing the linear assignment problem (LAP) collaboratively. In resource allocation, LAP is viewed as seeking a concurrent allocation of one different resource for every task to optimize a linear sum objective function. The proposed model provides a basic agent-based foundation needed for efficient resource allocation in a distributed environment. A distributed agent algorithm that has been developed based on the BDI negotiation model is examined both analytically and experimentally. To improve performance in terms of average negotiation speed and solution quality, two initialization heuristics and two different reasoning control strategies are applied, with the latter yielding different variants of the basic algorithm. Extensive simulations suggest that all the heuristic-algorithm combinations can produce a near optimal solution soon enough in some specific sense. The significance and applicability of the research work are also discussed. [Copyright &y& Elsevier]

Abstract: This paper studies evolutionary programming and adopts reinforcement learning theory to learn individual mutation operators. A novel algorithm named RLEP (Evolutionary Programming based on Reinforcement Learning) is proposed. In this algorithm, each individual learns its optimal mutation operator based on the immediate and delayed performance of mutation operators. Mutation operator selection is mapped into a reinforcement learning problem. Reinforcement learning methods are used to learn optimal policies by maximizing the accumulated rewards. According to the calculated Q function value of each candidate mutation operator, an optimal mutation operator can be selected to maximize the learned Q function value. Four different mutation operators have been employed as the basic candidate operators in RLEP and one is selected for each individual in different generations. Our simulation shows the performance of RLEP is the same as or better than the best of the four basic mutation operators. [Copyright &y& Elsevier]

Abstract: This paper proposes a method to solve the group decision making (GDM) problems with multi-granularity linguistic assessment information. In the method, the multi-granularity linguistic information provided by experts is firstly expressed in the form of fuzzy numbers. In order to make the collective opinion close to each expert’s opinion, a linear goal programming model is constructed to integrate the fuzzy assessment information and to directly compute the collective ranking values of alternatives without the need of information transformation. Then, a fuzzy preference relation on the pairwise comparisons of the collective ranking values of alternatives is constructed using the dominance possibility degree of the comparison between the fuzzy numbers. By applying a non-dominance choice degree to this fuzzy preference relation, the ranking of alternatives is determined and the most desirable alternative(s) is selected. An example is used to illustrate the applicability of the proposed method and its advantages. [Copyright &y& Elsevier]

Abstract: Establishing interschema semantic knowledge between corresponding elements in a cooperating OWL-based multi-information server grid environment requires deep knowledge, not only about the structure of the data represented in each server, but also about the commonly occurring differences in the intended semantics of this data. The same information could be represented in various incompatible structures, and more importantly the same structure could be used to represent data with many diverse and incompatible semantics. In a grid environment interschema semantic knowledge can only be detected if both the structural and semantic properties of the schemas of the cooperating servers are made explicit and formally represented in a way that a computer system can process. Unfortunately, very often there is lack of such knowledge and the underlying grid information servers (ISs) schemas, being semantically weak as a consequence of the limited expressiveness of traditional data models, do not help the acquisition of this knowledge. The solution to overcome this limitation is primarily to upgrade the semantic level of the IS local schemas through a semantic enrichment process by augmenting the local schemas of grid ISs to semantically enriched schema models, then to use these models in detecting and representing correspondences between classes belonging to different schemas. In this paper, we investigate the possibility of using OWL-based domain ontologies both for building semantically rich schema models, and for expressing interschema knowledge and reasoning about it. We believe that the use of OWL/RDF in this setting has two important advantages. On the one hand, it enables a semantic approach for interschema knowledge specification, by concentrating on expressing conceptual and semantic correspondences between both the conceptual (intensional) definition and the set of instances (extension) of classes represented in different schemas. On the other hand, it is exactly this semantic nature of our approach that allows us to devise reasoning mechanisms for discovering and reusing interschema knowledge when the need arises to compare and combine it. [Copyright &y& Elsevier]

Abstract: Transparent models search for a balance between interpretability and accuracy. This paper is about the estimation of transparent models of chaotic systems from data, which are accurate and simple enough for their expression to be understandable by a human expert. The models we propose are discrete, built upon common blocks in control engineering (gain, delay, sum, etc.) and optimized both in their complexity and accuracy. The accuracy of a discrete model can be measured by means of the average error between its prediction for the next sampling period and the true output at that time, or ‘one-step error’. A perfect model has zero one-step error, but a small error is not always associated with an approximate model, especially in chaotic systems. In chaos, an arbitrarily low difference between two initial states will produce uncorrelated trajectories, thus a model with a low one-step error may be very different from the desired one. Even though a recursive evaluation (multi-step prediction) improves the fitting, in this work we will show that a learning algorithm may not converge to an appropriate model, unless we include some terms that depend on estimates of certain properties of the model (so called ‘invariants’ of the chaotic series). We will show this graphically, by means of the reconstructed attractors of the original system and the model. Therefore, we also propose to follow a multi-objective approach to model chaotic processes and to apply a simulated annealing-based optimization to obtain transparent models. [Copyright &y& Elsevier]

Abstract: One of the tasks of decision-making support systems is to develop methods that help the designer select a solution among a set of actions, e.g. by constructing a function expressing his/her preferences over a set of potential solutions. In this paper, a new method to solve multiobjective optimization (MOO) problems is developed in which the user’s information about his/her preferences is taken into account within the search process. Preference functions are built that reflect the decision-maker’s (DM) interests and use meaningful parameters for each objective. The preference functions convert these objective preferences into numbers. Next, a single objective is automatically built and no weight selection is performed. Problems found due to the multimodality nature of a generated single cost index are managed with Genetic Algorithms (GAs). Three examples are given to illustrate the effectiveness of the method. [Copyright &y& Elsevier]

Abstract: This paper evaluates the statistical methodologies of cluster analysis, discriminant analysis, and Logit analysis used in the examination of intrusion detection data. The research is based on a sample of 1200 random observations for 42 variables of the KDD-99 database, that contains ‘normal’ and ‘bad’ connections. The results indicate that Logit analysis is more effective than cluster or discriminant analysis in intrusion detection. Specifically, according to the Kappa statistic that makes full use of all the information contained in a confusion matrix, Logit analysis (K =0.629) has been ranked first, with second discriminant analysis (K =0.583), and third cluster analysis (K =0.460). [Copyright &y& Elsevier]

Time-series forecasting is an important research and application area. Much effort has been devoted over the past several decades to develop and improve the time-series forecasting models. This paper introduces a new time-series forecasting model based on the flexible neural tree (FNT). The FNT model is generated initially as a flexible multi-layer feed-forward neural network and evolved using an evolutionary procedure. Very often it is a difficult task to select the proper input variables or time-lags for constructing a time-series model. Our research demonstrates that the FNT model is capable of handing the task automatically. The performance and effectiveness of the proposed method are evaluated using time series prediction problems and compared with those of related methods. [ABSTRACT FROM AUTHOR]