7613281
New results about the centroid of an interval type-2 fuzzy set, including the centroid of a fuzzy granule
The centroid of an interval type-2 fuzzy set (IT2 FS) provides a measure of the uncertainty of such a FS. Its calculation is very widely used in interval type-2 fuzzy logic systems. In this paper, we present properties about the centroid of an IT2 FS. We also illustrate many of the general results for a T2 fuzzy granule (FG) in order to develop some understanding about the uncertainty of the FG in terms of its vertical and horizontal dimensions. At present, the T2 FG is the only IT2 FS for which it is possible to obtain closed-form formulas for the centroid, and those formulas are in this paper.
19790752
Classification of Battlefield Ground Vehicles Using Acoustic Features and Fuzzy Logic Rule-Based Classifiers
In this paper, we demonstrate, through the multicategory classification of battlefield ground vehicles using acoustic features, how it is straightforward to directly exploit the information inherent in a problem to determine the number of rules, and subsequently the architecture, of fuzzy logic rule-based classifiers (FLRBC). We propose three FLRBC architectures, one non-hierarchical and two hierarchical (HFLRBC), conduct experiments to evaluate the performances of these architectures, and compare them to a Bayesian classifier. Our experimental results show that: 1) for each classifier the performance in the adaptive mode that uses simple majority voting is much better than in the non-adaptive mode; 2) all FLRBCs perform substantially better than the Bayesian classifier; 3) interval type-2 (T2) FLRBCs perform better than their competing type-1 (T1) FLRBCs, although sometimes not by much; 4) the interval T2 nonhierarchical and HFLRBC-series architectures perform the best; and 5) all FLRBCs achieve higher than the acceptable 80% classification accuracy
8588311
Perceptually lossless medical image coding
A novel perceptually lossless coder is presented for the compression of medical images. Built on the JPEG 2000 coding framework, the heart of the proposed coder is a visual pruning function, embedded with an advanced human vision model to identify and to remove visually insignificant/irrelevant information. The proposed coder offers the advantages of simplicity and modularity with bit-stream compliance. Current results have shown superior compression ratio gains over that of its information lossless counterparts without any visible distortion. In addition, a case study consisting of 31 medical experts has shown that no perceivable difference of statistical significance exists between the original images and the images compressed by the proposed coder.
10467092
Marshalgen: A Package for Semi-Automatic Marshaling of Objects
Marshaling or serialization of objects is an important component of both distributed and parallel computing. Current systems impose a significant burden on the programmer for describing the marshaling of complex, recursive data structures. Marshalgen provides a semi-automatic process for marshaling in C and C++. Marshalgen avoids the need for complex IDLs and auxiliary routines. It is based on annotations of the existing source code.
27950545
On Vertex-Triads in 3-Connected Binary Matroids
A cocircuit C* in a matroid M is said to be non-separating if and only if M∖C*, the deletion of C* from M, is connected. A vertex-triad in a matroid is a three-element non-separating cocircuit. Non-separating cocircuits in binary matroids correspond to vertices in graphs. Let C be a circuit of a 3-connected binary matroid M such that ∣E(M)∣≥4 and, for all elements x of C, the deletion of x from M is not 3-connected. We prove that C meets at least two vertex-triads of M. This gives direct binary matroid generalizations of certain graph results of Halin, Lemos, and Mader. For binary matroids, it also generalizes a result of Oxley. We also prove that a minimally 3-connected binary matroid M which has at least four elements has at least ½r*(M)+1 vertex-triads, where r*(M) is the corank of the matroid M. An immediate consequence of this result is the following result of Halin: a minimally 3-connected graph with n vertices has at least 2n+6/5 vertices of degree three. We also generalize Tutte's Triangle Lemma for general matroids.
13992284
CPU scheduling for statistically-assured real-time performance and improved energy efficiency
We present a CPU scheduling algorithm, called Energy-efficient Utility Accrual Algorithm (or EUA), for battery-powered, embedded real-time systems. We consider an embedded software application model where repeatedly occurring application activities are subject to deadline constraints specified using step time/utility functions. For battery-powered embedded systems, system-level energy consumption is also a primary concern. We consider CPU scheduling that (1) provides assurances on individual and collective application timeliness behaviors and (2) maximizes system-level timeliness and energy efficiency. Since the scheduling problem is intractable, EUA heuristically computes CPU schedules with a polynomial-time cost. Several properties of EUA are analytically established, including timeliness optimality during under-load situations and statistical assurances on timeliness behavior. Further, our simulation results confirm EUA's superior performance.
14728640
Public Authentication of 3D Mesh Models
In this paper, a public-key scheme is proposed to authenticate 3D mesh models. It is well known that digital signature schemes can be used for data authentication by generating a separate signature and appending it to the file. Another way is divide the original data into two parts: the content to be authenticated and the cover content. In the embedding process, the signature of the first part is generated and imperceptibly embedded within the cover content to form the signed content. In the authentication process, a new hash value is produced from the signed content and compared with the value decrypted from the retrieved signature for tamper detection. Before we implement such a scheme on polygonal meshes, mesh partitioning technique is used to divide them into patches with a fixed amount of vertices. For each patch, a corresponding signature is generated to replace the least significant bits of vertex coordinates within it so that the tamper can be localized. The experimental results have shown the promising results