A key aspect for any greedy pursuit algorithm used in compressed sensing is a good support-set detection method. For distributed compressed sensing, we consider a setup where many sensors measure sparse signals that are correlated via the existence of a signals’ intersection support-set. This intersection support-set is called the joint support-set. Estimation of the joint support-set has a hig...

This paper proposes a real-time 3D feature extraction hardware algorithm with feature point matching capability between neighboring frames, which realizes 3D tracking of moving objects. This hardware algorithm is based on a 3D voting method. Both the 3D voting and tlie featiire point matching arc directly carried out through highly parallel processing by content addressable memory (CAM) i11 rea...

This research presents an algorithm that allows transaction processing to proceed during site failures and network partitioning while ensuring the consistency of replicated data. Our algorithm can be used together with various voting schemes which provide varying degrees of data availability. Different voting schemes may be used simultaneously for different groups,'of data. Our algorithm contai...

Concerns about both security and fault-tolerance have had an important impact on the design and use of distributed information systems in the past. As such systems become more prevalent, as well as more pervasive, these concerns will become even more immediately relevant. From national defense, to commercial interests, to private citizens, distributed systems are making an ever greater impact o...

In this paper, we propose two new anonymous secure electronic voting schemes that protect the privacy of the voters and prevent double voting. These schemes do not require any special voting channel and the communications can occur entirely over existing networks such as the Internet. The proposed schemes are based on ElGamal digital signature algorithm and can be applied to elections in a vari...

Voting protocols guarantee consistency of replicated data in the presence of any scenar io involving non-Byzantine site failures and networ k par titions. While Static Majority Consensus Voting algorithms use static quorums, Dynamic Voting algorithms dynamically adjust quorums to changes in the status of the networ k of sites holding the copies. We propose in this paper two novel dynamic voting...

Do print media significantly impact political attitudes and party identification? To examine this question, we draw on a rare quasi-natural experiment that occurred when The Sun, a right-leaning UK tabloid, shifted its support to the Labour party in 1997 and back to the Conservative party in 2010. We compared changes in party identification and political attitudes among Sun readers with non-rea...

In this paper we propose a method using a generalization of the weighted majority voting scheme to locate the optic disc (OD) in retinal images automatically. The location with the maximal sum of the weights of OD center candidates falling into a disc of radius predefined in the clinical protocol is chosen for optic disc. We have worked out a weighted voting scheme, where besides the weights, a...

The facility voting location problems arise from the application of criteria derived from the voting processes concerning the location of facilities. The multiple location problems are those location problems in which the alternative solutions are sets of points. This paper extends previous results and notions on single voting location problems to the location of a set of facility points. The a...