Gaming Social Capital: Exploring Civic Value in Multiplayer Video Games

Recent research suggests that social interactions in video games may lead to the development of community bonding and prosocial attitudes. Building on this line of research, a national survey of U.S. adults finds that gamers who develop ties with a community of fellow gamers possess gaming social capital, a new gaming‐related community construct that is shown to be a positive antecedent in predicting both face‐to‐face social capital and civic participation.     

Socio-Cultural Connections and Ruptures: Social Roles of Older Adults in Chile

This research focused on determining the sociocultural factors that build the social perception of the social roles of senior citizens in Chile in the 2002–2012 period. For this purpose, public opinion was studied in newspapers El Mercurio and La Cuarta. Specialized opinion included the Senior Citizen Program of Pontificia Universidad Católica de Chile, the National Service for Senior Citizens, the Social Observatory for Aging and Old Age of Universidad de Chile, and the Society of Geriatrics and Gerontology of Chile. A comprehensive methodology was used, along with a bibliographical four-stage design. The following ten sociocultural factors were identified: Health and Quality of Life, Studies and Data, Social Images of Aging, Gerontological Concepts and Sociopolitical Participation, Gerontological Policies, Plans and Principles, Aging, Production and Gender, Institutionalization, Demographic Growth, Gerontological Training, and Exclusion and Old Age. This work suggests modifying the conceptual premise that emphasizes the inexistence of a social role for elderly people with a vision centered on the heterogeneity of social roles under permanent sociocultural construction.     

Optimizing content placement in a peer-assisted VoD architecture

Recently, a new peer-assisted architecture to build content delivery systems has been presented. This architecture is based on the use of the storage capacity of end-users’ set-top boxes (STBs), connected in a peer-to-peer (P2P) manner in order to help the content servers in the delivery process. In these systems, the contents are usually split into a set of smaller pieces, called sub-streams, which are randomly injected at the STBs. The present paper is focused on Video on Demand (VoD) streaming and it is assumed that the STB-based content delivery system is deployed over the global Internet, where the clients are distributed over different ISP networks. In this scenario, three different strategies are studied for increasing the percentage of data uploaded by peers, in order to offload the content servers as much as possible. First of all, a new mechanism is presented which determines which sub-stream has to be placed at which STB by a Non-Linear Programming (NLP) formulation. A different strategy for reducing the content server load is to take advantage of the available bandwidth in the different ISP networks. In this sense, two new mechanisms for forwarding the VoD requests to different ISP networks are presented. Finally, the present paper also shows that in some situations the available uplink bandwidth is associated with STBs that do not have the required sub-streams. Regarding this concern, a new mechanism has been designed that dynamically re-allocates some streams, which are being transmitted from specific STBs, to different STBs, in order to find the necessary resources to start new streaming sessions.     

COACH: COllaborative certificate stAtus CHecking mechanism for VANETs

Vehicular Ad Hoc Networks (VANETs) require mechanisms to authenticate messages, identify valid vehicles, and remove misbehaving vehicles. A public key infrastructure (PKI) can be used to provide these functionalities using digital certificates. However, if a vehicle is no longer trusted, its certificates have to be revoked and this status information has to be made available to other vehicles as soon as possible. In this paper, we propose a collaborative certificate status checking mechanism called COACH to efficiently distribute certificate revocation information in VANETs. In COACH, we embed a hash tree in each standard Certificate Revocation List (CRL). This dual structure is called extended-CRL. A node possessing an extended-CRL can respond to certificate status requests without having to send the complete CRL. Instead, the node can send a short response (less than 1 kB) that fits in a single UDP message. Obviously, the substructures included in the short responses are authenticated. This means that any node possessing an extended-CRL can produce short responses that can be authenticated (including Road Side Units or intermediate vehicles). We also propose an extension to the COACH mechanism called EvCOACH that is more efficient than COACH in scenarios with relatively low revocation rates per CRL validity period. To build EvCOACH, we embed an additional hash chain in the extended-CRL. Finally, by conducting a detailed performance evaluation, COACH and EvCOACH are proved to be reliable, efficient, and scalable.     

Image Compression and Video Segmentation Using Hierarchical Self-Organization

Both image compression based on color quantization and image segmentation are two typical tasks in the field of image processing. Several techniques based on splitting algorithms or cluster analyses have been proposed in the literature. Self-organizing maps have been also applied to these problems, although with some limitations due to the fixed network architecture and the lack of representation in hierarchical relations among data. In this paper, both problems are addressed using growing hierarchical self-organizing models. An advantage of these models is due to the hierarchical architecture, which is more flexible in the adaptation process to input data, reflecting inherent hierarchical relations among data. Comparative results are provided for image compression and image segmentation. Experimental results show that the proposed approach is promising for image processing, and the powerful of the hierarchical information provided by the proposed model.     

Robust Saturated PI Joint Velocity Control for Robot Manipulators

It is well known that many industrial manipulators use an embedded linear proportional‐integral (PI) joint velocity controller to guarantee motion control through proper velocity commands. However, although this control scheme has been very successful in practice, not much attention has been paid to designing new PI velocity control structures. The problem of analyzing a saturated PI velocity joint velocity controller is addressed in this paper. By using the theory of singularly perturbed systems, the closed‐loop system is studied. The robot dynamics assumed in this paper take into account bounded time–varying disturbances which may include the friction at the joints. An experimental study in a planar two degrees‐of‐freedom direct‐drive robot is also presented, confirming the advantage of the new saturated PI joint velocity controller.     

Regularized continuous estimation of distribution algorithms

Regularization is a well-known technique in statistics for model estimation which is used to improve the generalization ability of the estimated model. Some of the regularization methods can also be used for variable selection that is especially useful in high-dimensional problems. This paper studies the use of regularized model learning in estimation of distribution algorithms (EDAs) for continuous optimization based on Gaussian distributions. We introduce two approaches to the regularized model estimation and analyze their effect on the accuracy and computational complexity of model learning in EDAs. We then apply the proposed algorithms to a number of continuous optimization functions and compare their results with other Gaussian distribution-based EDAs. The results show that the optimization performance of the proposed RegEDAs is less affected by the increase in the problem size than other EDAs, and they are able to obtain significantly better optimization values for many of the functions in high-dimensional settings.     

WHAD: Wikipedia historical attributes data

This paper describes the generation of temporally anchored infobox attribute data from the Wikipedia history of revisions. By mining (attribute, value) pairs from the revision history of the English Wikipedia we are able to collect a comprehensive knowledge base that contains data on how attributes change over time. When dealing with the Wikipedia edit history, vandalic and erroneous edits are a concern for data quality. We present a study of vandalism identification in Wikipedia edits that uses only features from the infoboxes, and show that we can obtain, on this dataset, an accuracy comparable to a state-of-the-art vandalism identification method that is based on the whole article. Finally, we discuss different characteristics of the extracted dataset, which we make available for further study.