Reputation based probabilistic resource allocation for avoiding free riding and formation of common interest groups in unstructured P2P networks

Free riding is a major problem in peer-to-peer networks. Reputation management systems are generally employed to overcome this problem. In this paper, a new reputation based scheme called probabilistic resource allocation is proposed. This strategy probabilistically decide whether to provide the resource to requesting peer or not. Aforesaid method gives selection preference to higher reputation peers and at the same time provides some finite probability of interaction between those peers who don’t have good reputation about each other. This avoids disconnection between the aforesaid peers. The proposed scheme also introduces a new mechanism for resource distribution which not only allocates resources based on peers’ reputation but simultaneously maximizes network utility also. Algorithm for formation of interest groups based upon both similarity of interests and reputation between peers is also presented.     

The dark side of information technology use

A large body of research has considered the positive aspects of information technology (IT) use. However, emerging research and practice commentary is beginning to focus on complex and often alarming ways in which use of IT affects organisational and social life. This Special Issue focuses on these ‘dark’ effects of IT use.     

AVCOL: Availability-aware information aggregation in large distributed systems under uncollaborative behavior

Aggregation of system-wide information in large-scale distributed systems, such as p2p systems and Grids, can be unfairly influenced by nodes that are selfish, colluding with each other, or are offline most of the time. We present AVCOL, which uses probabilistic and gossip-style techniques to provide availability-aware aggregation. Concretely, AVCOL is the first aggregation system that: (1) implements any (arbitrary) global predicate that explicitly specifies any node’s probability of inclusion in the global aggregate, as a mathematical function of that node’s availability (i.e., percentage time online); (2) probabilistically tolerates large numbers of selfish nodes and large groups of colluders; and (3) scales well with hundreds to thousands of nodes. AVCOL uses several unique design decisions: per-aggregation tree construction where nodes are allowed a limited but flexible probabilistic choice of parents or children, probabilistic aggregation along trees, and auditing of nodes both during aggregation as well as in gossip-style (i.e., periodically). We have implemented AVCOL, and we experimentally evaluated it using real-life churn traces. Our evaluation and our mathematical analysis show that AVCOL satisfies arbitrary predicates, scales well, and withstands a variety of selfish and colluding attacks.     

A closed-loop cross-correlation method for detecting model mismatch in MIMO model-based controllers

Correlation between a dithering signal and the prediction error has been used for detecting model mismatch in univariate model based control systems. This paper extends that approach to MIMO control systems. A closed-loop cross-correlation method is presented to detect which specific input-output pairings of a model-based controller are mismatched. This method may be used in screening the complete set of models and in selecting candidate models for re-identification. The method first finds the rows and columns of the transfer function matrix that contain mismatch, and then the candidates are found by the intersection of the said rows and columns. Placing the system under partial control, whereby one or more of the manipulated variables are held constant, can be used to further reduce the set of candidate models.     

Entrance effects for power-law fluid

Entrance pressure losses for the creeping flow of a power-law fluid are calculated for an abrupt contraction of ratio 2, 4, 8 and ∞ for both the axisymmetric and planar cases using P₂P₁ and PP₁ finite elements. Contrary to some earlier findings in the literature, the entrance pressure loss obtained by using the two different types of finite elements, both of which satisfy the Babus?ka-Brezzi condition, are found to converge to the same results. The present results also confirm that the variational method of Duda and Vrentas gives excellent upper bounds for both the axisymmetric and planar cases with infinite contraction ratio.     

Two-dimensional imaging of soot volume fraction by the use of laser-induced incandescence

A recently developed laser-induced incandescence technique is used to make novel planar measurements of soot volume fraction within turbulent diffusion flames and droplet flames. The two-dimensional imaging technique is developed and assessed by systematic experiments in a coannular laminar diffusion flame, in which the soot characteristics have been well established. With a single point calibration procedure, agreement to within 10% was found between the values of soot volume fraction measured by this technique and those determined by conventional laser scattering-extinction methods in the flame. As a demonstration of the wide range of applicability of the technique, soot volume fraction images are also obtained from both turbulent ethene diffusion flames and from a freely falling droplet flame that burns the mixture of 75% benzene and 25% methanol. For the turbulent diffusion flames, approximately an 80% reduction in soot volume fraction was found when the Reynolds number of the fuel jet increased from 4000 to 8000. In the droplet flame case, the distribution of soot field was found to be similar to that observed in coannular laminar diffusion flames.     

Belief Decay or Persistence? A Mixed-method Study on Belief Movement Over Time

When individuals encounter new information (data), that information is incorporated with their existing beliefs (prior) to form a new belief (posterior) in a process referred to as belief updating. While most studies on rational belief updating in visual data analysis elicit beliefs immediately after data is shown, we posit that there may be critical movement in an individual's beliefs when elicited immediately after data is shown v. after a temporal delay (e.g., due to forgetfulness or weak incorporation of the data). Our paper investigates the hypothesis that posterior beliefs elicited after a time interval will “decay” back towards the prior beliefs compared to the posterior beliefs elicited immediately after new data is presented. In this study, we recruit 101 participants to complete three tasks where beliefs are elicited immediately after seeing new data and again after a brief distractor task. We conduct (1) a quantitative analysis of the results to understand if there are any systematic differences in beliefs elicited immediately after seeing new data or after a distractor task and (2) a qualitative analysis of participants' reflections on the reasons for their belief update. While we find no statistically significant global trends across the participants beliefs elicited immediately v. after the delay, the qualitative analysis provides rich insight into the reasons for an individual's belief movement across 9 prototypical scenarios, which includes (i) decay of beliefs as a result of either forgetting the information shown or strongly held prior beliefs, (ii) strengthening of confidence in updated beliefs by positively integrating the new data and (iii) maintaining a consistently updated belief over time, among others. These results can guide subsequent experiments to disambiguate when and by what mechanism new data is truly incorporated into one's belief system.     

A post quantum secure construction of an authentication protocol for satellite communication

Satellite's communication system is used to communicate under significant distance and circumstances where the other communication systems are not comfortable. Since all the data are exchanged over a public channel, so the security of the data is an essential component for the communicating parties. Both key exchange and authentication are two cryptographic tools to establish a secure communication between two parties. Currently, various kinds of authentication protocols are available to establish a secure network, but all of them depend on number–theoretical (discrete logarithm problem/factorization assumption) hard assumptions. Due to Shor's and Grover's computing algorithm number theoretic assumptions are breakable by quantum computers. Although Kumar and Garg have proposed a quantum attack-resistant protocol for satellite communication, it cannot resist stolen smart card attack. We have analyzed that how Kumar and Garg is vulnerable to the stolen smart card attack using differential power analysis attack described in He et al and Chen and Chen. We have also analyzed the modified version of signal leakage attack and sometimes called improved signal leakage attack on Kumar and Garg's protocol. We have tried to construct a secure and efficient authentication protocol for satellites communication that is secure against quantum computing. This is more efficient as it requires only three messages of exchange. This paper includes security proof and performance of the proposed authentication and key agreement protocol.