Showing papers by "Sameep Mehta published in 2007"

Open Reduction for Late-Presenting Posterior Dislocation of the Elbow:

Abstract: Purpose.To evaluate results of open reduction for late-presenting (more than 3 weeks) posterior dislocation of the elbow in 10 patients.Method.Elbow stiffness was the main indication for surgery. The mean age of the patients was 34 (range, 13–65) years; the mean time since injury was 4 (range, 2–6) months. All patients had non-functional elbow movement for any activity of daily living. Three patients had associated fractures around the elbow joint.Results.At a mean follow-up of 19 (range, 11–28) months, 8 patients regained a functional range of movement for activities of daily living and maintained a median arc of flexion of 100 degrees and a supination-pronation arc of 140 degrees. According to the Mayo Elbow Performance Index, the results of 5 patients were excellent, 3 were good, and 2 were poor. Complications included pin site infection (n=2), ulnar neuritis (n=1), and delayed wound healing (n=1).Conclusion.In patients with late-presenting, unreduced elbow dislocation occurring up to 6 months earlier,...

System and computer program product to predict edges in a non-cumulative graph

Abstract: To predict edges in a non-cumulative graph, based on a sequence of non-cumulative previous occurrences of the graph, the sequence of non-cumulative previous occurrences of the graph is obtained, and topological properties of each of the previous occurrences of the graph are extracted. Topological similarities between each of the previous occurrences of the graph are computed based on the topological properties. The edges of the graph are predicted by computing a score for each possible edge of the graph, based upon the topological similarities.

Method to predict edges in a non-cumulative graph

Abstract: To predict edges in a non-cumulative graph, based on a sequence of non-cumulative previous occurrences of the graph, the sequence of non-cumulative previous occurrences of the graph is obtained, and topological properties of each of the previous occurrences of the graph are extracted. Topological similarities between each of the previous occurrences of the graph are computed based on the topological properties. The edges of the graph are predicted by computing a score for each possible edge of the graph, based upon the topological similarities.

Toward interactive learning by concept ordering

Abstract: In this paper we present a visual education tool for efficient and effective learning. The toolkit is based on a simple premise: simple concepts should be learned before advanced ones. We propose algorithms to automatically capture such pre-requisite dependence relationships between concepts. We extract concept definitions from the web's hyperlinked environment and create a concept graph arranged in a hierarchical structure and presented to the user in an interactive fashion. Thereafter, the user guides the learning process in a hyperlinked environment, by selecting a target concept, exploring the associated learning graph, learning pre-requisite concepts, and repeating this process till her learning goal is reached. To measure usefulness and correctness of our approach, we conducted a user study with 25 users using precision and recall measures. Overall, the feedback from users was encouraging. We believe this is a positive step toward building user driven interactive learning systems.