5533159
Cycles of length 1 modulo 3 in graph
We prove a conjecture of Saito that if a graph G with ≥ 3 has no cycle of length 1 (mod 3), then G has an induced subgraph which is isomorphic to the Petersen graph. The above result strengthened the result by Dean et al. that every 2-connected graph with ≥ 3 has a (1 mod 3)-cycle if G is not isomorphic to the Petersen graph. ? 2001 Elsevier Science B.V. All rights reserved.
3757616
Hamilton cycles in 1-tough triangle-free graphs
A graph G is called triangle-free if G has no induced K3 as a subgraph. We set σ3=min{∑i=13d(vi)|{v1,v2,v3} is an independent set of vertices in G}. In this paper, we show that if G is a 1-tough and triangle-free graph of order n with n⩽σ3, then G is hamiltonian.
1959706
A key pre-distribution scheme using deployment knowledge for wireless sensor networks
Sensor networks pose security and privacy challenges. One challenge is how to bootstrap secure communications among nodes. Several key pre-distribution schemes have been proposed, however, they either have a high memory requirement for large networks or need a large transmission range to achieve the desired connectivity. In this paper, we propose a novel key pre-distribution scheme using deployment knowledge. In our scheme, sensor field is divided into multiple hexagonal grids and nodes are divided into groups, each of which is deployed into a grid. By using deployment knowledge, we can drastically reduce the number of potential groups from which neighbors of each node may come. Thus, a pair-wise key can be generated efficiently for each pair of neighbors. Compared to existing schemes, our scheme achieves a high connectivity with a lower memory requirement and a smaller transmission range and outperforms others in resilience against node capture attacks.
35376903
Robust beamformer design by power minimization and its unconstrained partitioned implementation
A robust array beamformer design method by power minimization and its unconstrained partition implementation is proposed in this paper. An orthogonal blocking matrix is obtained through the proposed method. The new blocking matrix ensures that a desired look-direction response of the processor over a frequency band of interest can be closely approximated. Furthermore, if the spectrum of the target signal is known a priori, such as in microphone array application where the statistical property of speech is known, the new method may use fewer/less degree of freedom. This new method also provide a theoretical support for the derivation of the blocking matrix through array calibration. Simulation results show that the effectiveness of the proposed method.
17105028
Performance and power analysis of globally asynchronous locally synchronous multiprocessor systems
This paper investigates the performance and power dissipation of globally asynchronous locally synchronous (GALS) multi-processor systems. We show that communication loops are a source of significant throughput degradation in communications links and that there is no degradation whatsoever under certain conditions for one-way links, and that it is possible to design GALS multiprocessors without this performance penalty. Independent clock domains and unbalanced computation in the GALS multiprocessor allow scaling of the clock frequency and supply voltage to achieve high energy efficiency. The synchronization overhead between independent clock domains results in a less than 1% performance reduction compared to a globally synchronous system over a number of DSP and numerical applications. Clock and voltage scaling can achieve an approximately 40% power savings with no reduction of performance. These results compare favorably with the 25% power savings and more than 10% performance reduction reported for GALS uniprocessors
32481962
A Hybrid Filter for Program Personalization
15232013
An Adaptive Reputation-based Trust Framework for Peer-to-Peer Applications
In distributed P2P environments, peers (i.e., users) often have to request the services from some unfamiliar peers (i.e., resources) that could be altruistic, selfish, or even malicious. To motivate selfish peers to cooperate and minimize the risk from malicious peers, we propose an adaptive reputation-based trust framework for peer-to-peer applications. In this framework, we define a quantifiable metric trust that is calculated from the user's own view as well as other peers' view (as references) on the reputation of a peer (resource). It can be used to quantify the trustworthiness of peers and provide a measurable and trustable way of resource scheduling/selection and access control for peer-to-peer applications. We assume economic resources compete with each other to maximize their profit and design a number of strategies, for resources to determine their price. The simulation results show that the framework supports economic resources to achieve long-term high user satisfaction, differentiates malicious nodes from normal ones and encourages the resources to provide high-quality services