There has been significant recent interest in parallel graph processing due to the need quickly analyze large graphs available today. Many codes have designed for distributed memory or external memory. However, today even largest publicly-available real-world (the Hyperlink Web with over 3.5 billion vertices and 128 edges) can fit of a single commodity multicore server. Nevertheless, most exper...

Recently, deep reinforcement learning (RL) has achieved remarkable empirical success by integrating neural networks into RL frameworks. However, these algorithms often require a large number of training samples and admit little theoretical understanding. To mitigate issues, we propose theoretically principled nearest neighbor (NN) function approximator that can replace the value in methods. Ins...

We study game-theoretically secure protocols for the classical ordinal assignment problem (aka matching with one-sided preference), in which each player has a total preference order on items. To achieve fairness notion of equal treatment equals, conventionally randomness necessary to resolve conflicts between players is assumed be generated by some trusted authority. However, distributed settin...

The present study resulted in the development of a measure for the four sources of selfefficacy expectations postulated by Bandura’s (1977, 1997) theory in the domain of social behaviors. The four sources subscales were internally consistent and related as postulated to relevant criterion measures and theoretical constructs. Examination of the degree to which the four sources of social self-eff...