34097069
Building shallow expert systems using back-propagation learning
216020825
Mean Shift, Mode Seeking, and Clustering
Mean shift, a simple iterative procedure that shifts each data point to the average of data points in its neighborhood, is generalized and analyzed in this paper. This generalization makes some k-m...
14172108
Context-dependent similarity
Attribute weighting and differential weighting, two major mechanisms for computing context-dependent similarity or dissimilarity measures are studied and compared. A dissimilarity measure based on subset size in the context is proposed and its metrization and application are given. It is also shown that while all attribute weighting dissimilarity measures are metrics differential weighting dissimilarity measures are usually non-metric.
6321522
Biclustering of Expression Data
An efficient node-deletion algorithm is introduced to find submatrices in expression data that have low mean squared residue scores and it is shown to perform well in finding co-regulation patterns in yeast and human. This introduces "biclustering", or simultaneous clustering of both genes and conditions, to knowledge discovery from expression data. This approach overcomes some problems associated with traditional clustering methods, by allowing automatic discovery of similarity based on a subset of attributes, simultaneous clustering of genes and conditions, and overlapped grouping that provides a better representation for genes with multiple functions or regulated by many factors.
10297562
Computational Models for the Helix Tilt Angle
The concept of hydrophobic imbalance and that of hydrophobic and hydrophilic centers are used along with side chain models in the computation of helix orientation and tilt angle in or near a membrane. Rotamer statistics are used to infer typical side chain positions and chain length for each amino acid, and the results are used in fast computation of helix orientation. Sliding windows are used to compute local tilt angles on long alpha-helices that defy idealized modeling and generate tilt angle profiles. Seven different procedures based on different formulas and hydrophobicity scales are used for comparison. These procedures generated very similar tilt angle profiles. These profiles provide insights into helix deformation, membrane destabilization, and similarity and differences between membrane proteins.
1895998
A study of associative evidential reasoning
Evidential reasoning is cast as the problem of simplifying the evidence-hypothesis relation and constructing combination formulas that possess certain testable properties. Important classes of evidence as Identifiers, annihilators, and idempotents and their roles in determining binary operations on intervals of reals are discussed. The appropriate way of constructing formulas for combining evidence and their limitations, for instance, in robustness, are presented.
31421692
Efficient resource allocation for SLA based wireless/wireline interworking
This paper proposes efficient resource allocation techniques for a domain-based wireless/wireline interworking architecture. Resource allocation is driven by the service level agreement (SLA). Each wireless domain can freely choose its internal resource management schemes to guarantee the customer access SLA (CASLA), while the border-crossing traffic is served by a DiffServ/MPLS core network according to the transit domain SLA (TRSLA). Specifically, we propose an engineered priority scheme for a cellular wireless domain, where the CASLA for each service class is met with efficient resource utilization and the interdomain TRSLA bandwidth requirement can be obtained conveniently. In the transit domain, the traffic load fluctuation from upstream access domains is tackled with an inter-TRSLA resource sharing technique, where the spare capacity from underloaded TRSLAs can be exploited by the overloaded TRSLAs to improve resource utilization.
11793175
Internet Traffic Characterization Using Packet-Pair Probing
This paper presents an edge-based Internet traffic characterization approach. Our objective is to estimate the marginal distribution and the correlation structure of the packet arrival process at a queue, by sending probe packet pairs with a specific dispersion to sample the traffic. The aggregate work load process inferred from the output dispersions is a compound process of the packet arrival process and the packet size distribution. We show that the packet arrival marginal distribution and the packet size distribution can be decoupled by using the probability generating function; given one of the distributions, the other can then be estimated. We use the fact that the Internet packet size follows a known multi-modal distribution. Moreover, multiple series of packet pairs with different input dispersions can be used to estimate the packet arrival process at different time scales, and therefore to estimate the Hurst parameter, which characterizes the long-range dependence, by generating the variance-time plot. While the traffic characterization techniques are developed and validated in a single-queue context, we indicate how the techniques can be applied to a black box system for end-to-end quality of service provisioning along a multi-hop path.
6228406
Distributed and parallel execution of Java programs on a DSM system
The paper focuses on the loop-level parallelism of bytecode on a distributed shared memory (DSM) system, which is built on a cluster of multiprocessors. We define a new attribute called 'Loop Attribute' to record the information of Java loops. When first loading a Java program, our Java virtual machine, called ES-JVM, checks and analyzes the loops of the bytecode dynamically, handles the data dependence of loops, and records the information as the loop attributes. ES-JVM uses the virtual shared memory and synchronization mechanisms provided by the DSM system to maintain the memory consistency. Before ES-JVM interprets the loops of the bytecodes, it dispatches the workload of loops to the interpreter threads at all nodes according to the loop attributes and the number of threads. After distributed and parallel execution of the loops, ES-JVM continues to interpret the rest of the bytecodes of the Java program. Finally, ES-JVM saves the loop attributes in a new class file for the next run. Our research shows that distributed and parallel execution of loops of a Java program could improve performance.
59852137
Energy Efficient Session Key Establishment in Wireless Sensor Networks
Key distribution and management is the foundation of any secure services of wireless sensor networks. Due to the resource constraints, establishing cryptographic keys between communicating sensors in large-scale wireless sensor networks is a big challenge. Traditional asymmetric key cryptography is not suitable for wireless sensor environment because of its complexity. Based on the polynomial-key pre-distribution scheme, an improved session key establishment method is proposed in this paper. Compared with existing key distribution schemes, our proposed scheme has lower energy consumption, less key storage and lower communication overheads as well as better network resilience against node capture attacks.
15648291
An improved key distribution mechanism for large-scale hierarchical wireless sensor networks
Abstract Wireless sensor networks are often deployed in hostile environments and operated on an unattended mode. In order to protect the sensitive data and the sensor readings, secret keys should be used to encrypt the exchanged messages between communicating nodes. Due to their expensive energy consumption and hardware requirements, asymmetric key based cryptographies are not suitable for resource-constrained wireless sensors. Several symmetric-key pre-distribution protocols have been investigated recently to establish secure links between sensor nodes, but most of them are not scalable due to their linearly increased communication and key storage overheads. Furthermore, existing protocols cannot provide sufficient security when the number of compromised nodes exceeds a critical value. To address these limitations, we propose an improved key distribution mechanism for large-scale wireless sensor networks. Based on a hierarchical network model and bivariate polynomial-key generation mechanism, our scheme guarantees that two communicating parties can establish a unique pairwise key between them. Compared with existing protocols, our scheme can provide sufficient security no matter how many sensors are compromised. Fixed key storage overhead, full network connectivity, and low communication overhead can also be achieved by the proposed scheme.