Journal Volumes


Visitors
ALL : 888,694
TODAY : 360
ONLINE : 26



















  JOURNAL DETAIL



Wellness, Social Networking, and Algorithms


Paper Type 
Contributed Paper
Title 
Wellness, Social Networking, and Algorithms
Author 
Raymond Greenlaw
Email 
greenlaw@usna.edu
Abstract:
This paper is one of the first written that ties together the areas of wellness, social networking, and computational-complexity theory. Our goal is to integrate these three fields in order to develop a system in which we can help people improve their well being. There are over one billion obese people in the world and that number is growing alarmingly fast. We must find a way to motivate unhealthy people to take care of themselves, so as to put less strain on economies around the world, less strain on natural resources, less strain on the health-care system, less strain on nearby individuals, and, most importantly, to save lives and to reduce suffering. We have gone from hunters and gathers to sitters and twitterers. As our standard of living increases, so does our size. While eating high-caloric foods, many people watch TV or play with the Internet all day long. And one particular Internet application, social networking, is amazingly popular-nations around the world have a significant percentage of their populations engaged in social-networking sites such as Facebook, Flickr, Friendster, hi5, LinkedIn, MySpace, Orkut, Qzone, and so on. In this paper we leverage the popularity of social networking to improve people’s wellness. We propose a WELLNESS PROFILE MODEL that captures a social-network members’ characteristics, preferences, activities, vitals, and other relevant information. We formulate dynamic-matching problems whose focus is to find groups of individuals with similar interests and time constraints, so that they can participate in activities together thereby contributing to each other’s well being. We examine the computational complexity of the problems from both the sequential and parallel perspectives. Our results tell us how hard these problems are to solve. That is, we determine the complexity of these problems. The problems defined here involve a new type of dynamic matching, as opposed to traditional matching as is done in many of the current Internet social-networking sites and traditional graph theory. We intend to implement restricted versions of some of the algorithms in the systems being developed by Elbrys Networks, Inc. Keywords: algorithms, computational-complexity theory, dynamic matching, social networking, mobile wellness applications, wellness profile model.
Start & End Page 
17 - 30
Received Date 
Revised Date 
Accepted Date 
Full Text 
  Download
Keyword 
algorithms, computational-complexity theory, dynamic matching, social networking, mobile, wellness applications, wellness profile model.
Volume 
Vol.38 (SPECIAL ISSUE 2011)
DOI 
SDGs
View:505 Download:145

Search in this journal


Document Search


Author Search

A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

Popular Search






Chiang Mai Journal of Science

Faculty of Science, Chiang Mai University
239 Huaykaew Road, Tumbol Suthep, Amphur Muang, Chiang Mai 50200 THAILAND
Tel: +6653-943-467




Faculty of Science,
Chiang Mai University




EMAIL
cmjs@cmu.ac.th




Copyrights © Since 2021 All Rights Reserved by Chiang Mai Journal of Science