Structuring of Ranked Models

Prognostic procedures can be based on ranked linear models. Ranked regression type models are designed on the basis of feature vectors combined with set of relations defined on selected pairs of these vectors. Feature vectors are composed of numerical results of measurements on particular objects or events. Ranked relations defined on selected pairs of feature vectors represent additional knowledge and can reflect experts' opinion about considered objects. Ranked models have the form of linear transformations of feature vectors on a line which preserve a given set of relations in the best manner possible. Ranked models can be designed through the minimization of a special type of convex and piecewise linear (CPL) criterion functions. Some sets of ranked relations cannot be well represented by one ranked model. Decomposition of global model into a family of local ranked models could improve representation. A procedures of ranked models decomposition is described in this paper.

Semi-supervised SVMs for classification with unknown class proportions and a small labeled dataset

In the design of practical web page classification systems one often encounters a situation in which the labeled training set is created by choosing some examples from each class; but, the class proportions in this set are not the same as those in the test distribution to which the classifier will be actually applied. The problem is made worse when the amount of training data is also small. In this paper we explore and adapt binary SVM methods that make use of unlabeled data from the test distribution, viz., Transductive SVMs (TSVMs) and expectation regularization/constraint (ER/EC) methods to deal with this situation. We empirically show that when the labeled training data is small, TSVM designed using the class ratio tuned by minimizing the loss on the labeled set yields the best performance; its performance is good even when the deviation between the class ratios of the labeled training set and the test set is quite large. When the labeled training data is sufficiently large, an unsupervised Gaussian mixture model can be used to get a very good estimate of the class ratio in the test set; also, when this estimate is used, both TSVM and EC/ER give their best possible performance, with TSVM coming out superior. The ideas in the paper can be easily extended to multi-class SVMs and MaxEnt models.

Comparison of three systems of classification in predicting the outcome of diabetic foot ulcers in a Brazilian population

Objective: The aim was to compare there ulcer classification systems as predictors of the outcome of diabetic foot ulcers; the Wagner, the University of Texas (UT) and the size (area, depth), sepsis, arteriopathy, denervation system (S(AD)SAD) systems in specialist clinic in Brazil.Methods: Ulcer area, depth, appearance, infection and associated ischaemia and neuropathy were recorded in a consecutive series of 94 subjects. A novel score, the S(AD)SAD score, was derived from the sum of individual items of the S(AD)SAD system, and was evaluated. Follow-up was for at least 6 months. The primary outcome measure was the incidence of healing.Results: Mean age was 57.6 years; 57 (60.6%) were made. Forty-eight ulcers (51.1%) healed without surgery; 11 (12.2%) subjects underwent minor amputation. Significant differences in terms of healing were observed for depth (P = 0.002), infection (P = 0.006) and denervation (P = 0.002) using the S(AD)SAD system, for UT grade (P = 0.002) and stage (P = 0.032) and for Wagner grades (P = 0.002). Ulcers with an S(AD)SAD score of <= 9 (total possible 15) were 7.6 times more likely to heal than scores >= 10 (P < 0.001).Conclusions: All three systems predicted ulcer outcome. The S(AD)SAD score of ulcer severity could represent a useful addition to routine clinical practice. The association between outcome and ulcer depth confirms earlier reports. The association with infection was stronger than that reported from the centres in Europe or North America. The very strong association with neuropathy has only previously been observed in Tanzania. Studies designed to compare the outcome in different countries should adopt systems of classification, which are valid for the populations studied.

New Trends in Networking, Computing, E-learning, Systems Sciences, and Engineering

This book provides the latest in a series of books growing out of the International Joint Conferences on Computer, Information and Systems Sciences and Engineering. It includes chapters in the most advanced areas of Computing, Informatics, Systems Sciences and Engineering. It has accessible to a wide range of readership, including professors, researchers, practitioners and students. This book includes a set of rigorously reviewed world-class manuscripts addressing and detailing state-of-the-art research projects in the areas of Computer Science, Informatics, and Systems Sciences, and Engineering. It includes selected papers form the conference proceedings of the Ninth International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering (CISSE 2013). Coverage includes topics in: Industrial Electronics, Technology & Automation, Telecommunications and Networking, Systems, Computing Sciences and Software Engineering, Engineering Education, Instructional Technology, Assessment, and E-learning.

Determining appropriate measurement methods for etiological research of computing-related musculoskeletal symptoms and disorders

Two studies among college students were conducted to evaluate appropriate measurement methods for etiological research on computing-related upper extremity musculoskeletal disorders (UEMSDs). ^ A cross-sectional study among 100 graduate students evaluated the utility of symptoms surveys (a VAS scale and 5-point Likert scale) compared with two UEMSD clinical classification systems (Gerr and Moore protocols). The two symptom measures were highly concordant (Lin's rho = 0.54; Spearman's r = 0.72); the two clinical protocols were moderately concordant (Cohen's kappa = 0.50). Sensitivity and specificity, endorsed by Youden's J statistic, did not reveal much agreement between the symptoms surveys and clinical examinations. It cannot be concluded self-report symptoms surveys can be used as surrogate for clinical examinations. ^ A pilot repeated measures study conducted among 30 undergraduate students evaluated computing exposure measurement methods. Key findings are: temporal variations in symptoms, the odds of experiencing symptoms increased with every hour of computer use (adjOR = 1.1, p < .10) and every stretch break taken (adjOR = 1.3, p < .10). When measuring posture using the Computer Use Checklist, a positive association with symptoms was observed (adjOR = 1.3, p < 0.10), while measuring posture using a modified Rapid Upper Limb Assessment produced unexpected and inconsistent associations. The findings were inconclusive in identifying an appropriate posture assessment or superior conceptualization of computer use exposure. ^ A cross-sectional study of 166 graduate students evaluated the comparability of graduate students to College Computing & Health surveys administered to undergraduate students. Fifty-five percent reported computing-related pain and functional limitations. Years of computer use in graduate school and number of years in school where weekly computer use was ≥ 10 hours were associated with pain within an hour of computing in logistic regression analyses. The findings are consistent with current literature on both undergraduate and graduate students. ^

Approximate Model Checking of Real-Time Systems for Linear Duration Invariants

Real-time systems are usually modelled with timed automata and real-time requirements relating to the state durations of the system are often specifiable using Linear Duration Invariants, which is a decidable subclass of Duration Calculus formulas. Various algorithms have been developed to check timed automata or real-time automata for linear duration invariants, but each needs complicated preprocessing and exponential calculation. To the best of our knowledge, these algorithms have not been implemented. In this paper, we present an approximate model checking technique based on a genetic algorithm to check real-time automata for linear durration invariants in reasonable times. Genetic algorithm is a good optimization method when a problem needs massive computation and it works particularly well in our case because the fitness function which is derived from the linear duration invariant is linear. ACM Computing Classification System (1998): D.2.4, C.3.

On Optimal Quadratic Lagrange Interpolation: Extremal Node Systems with Minimal Lebesgue Constant via Symbolic Computation

ACM Computing Classification System (1998): G.1.1, G.1.2.

Generalized Priority Systems. Analytical Results and Numerical Algorithms

A class of priority systems with non-zero switching times, referred as generalized priority systems, is considered. Analytical results regarding the distribution of busy periods, queue lengths and various auxiliary characteristics are presented. These results can be viewed as generalizations of the Kendall functional equation and the Pollaczek-Khintchin transform equation, respectively. Numerical algorithms for systems’ busy periods and traffic coefficients are developed. ACM Computing Classification System (1998): 60K25.

Assigning metabolic equivalent (MET) values to the 2002 Census Occupational Classification System

Background: The Current Population Survey (CPS) and the American Time Use Survey (ATUS) use the 2002 census occupation system to classify workers into 509 separate occupations arranged into 22 major occupational categories. Methods: We describe the methods and rationale for assigning detailed MET estimates to occupations and present population estimates (comparing outputs generated by analysis of previously published summary MET estimates to the detailed MET estimates) of intensities of occupational activity using the 2003 ATUS data comprised of 20,720 respondents, 5,323 (2,917 males and 2,406 females) of whom reported working 6+ hours at their primary occupation on their assigned reporting day. Results: Analysis using the summary MET estimates resulted in 4% more workers in sedentary occupations, 6% more in light, 7% less in moderate, and 3% less in vigorous compared to using the detailed MET estimates. The detailed estimates are more sensitive to identifying individuals who do any occupational activity that is moderate or vigorous in intensity resulting in fewer workers in sedentary and light intensity occupations. Conclusions: Since CPS/ATUS regularly captures occupation data it will be possible to track prevalence of the different intensity levels of occupations. Updates will be required with inevitable adjustments to future occupational classification systems.

Classification of inventory data suit for managing Australian railway bridges

With a focus to optimising the life cycle performance of Australian Railway bridges, new bridge classification and environmental classification systems are proposed. The new bridge classification system is mainly to facilitate the implementation of novel Bridge Management System (BMS) which optimise the life cycle cost both at project level and network level while environment classification is mainly to improve accuracy of Remaining Service Potential (RSP) module of the proposed BMS. In fact, limited capacity of the existing BMS to trigger the maintenance intervention point is an indirect result of inadequacies of the existing bridge and environmental classification systems. The proposed bridge classification system permits to identify the intervention points based on percentage deterioration of individual elements and maintenance cost, while allowing performance based rating technique to implement for maintenance optimisation and prioritisation. Simultaneously, the proposed environment classification system will enhance the accuracy of prediction of deterioration of steel components.

Offloading content routing cost from routers

The publish/subscribe paradigm has lately received much attention. In publish/subscribe systems, a specialized event-based middleware delivers notifications of events created by producers (publishers) to consumers (subscribers) interested in that particular event. It is considered a good approach for implementing Internet-wide distributed systems as it provides full decoupling of the communicating parties in time, space and synchronization. One flavor of the paradigm is content-based publish/subscribe which allows the subscribers to express their interests very accurately. In order to implement a content-based publish/subscribe middleware in way suitable for Internet scale, its underlying architecture must be organized as a peer-to-peer network of content-based routers that take care of forwarding the event notifications to all interested subscribers. A communication infrastructure that provides such service is called a content-based network. A content-based network is an application-level overlay network. Unfortunately, the expressiveness of the content-based interaction scheme comes with a price - compiling and maintaining the content-based forwarding and routing tables is very expensive when the amount of nodes in the network is large. The routing tables are usually partially-ordered set (poset) -based data structures. In this work, we present an algorithm that aims to improve scalability in content-based networks by reducing the workload of content-based routers by offloading some of their content routing cost to clients. We also provide experimental results of the performance of the algorithm. Additionally, we give an introduction to the publish/subscribe paradigm and content-based networking and discuss alternative ways of improving scalability in content-based networks. ACM Computing Classification System (CCS): C.2.4 [Computer-Communication Networks]: Distributed Systems - Distributed applications

Korkean käytettävyyden klusterointiteknologioiden vertailu

Tutkielma käsittelee korkean käytettävyyden klustereita. Tavoitteena on vertailla eri klusteriteknologioiden eroja ja arvioida tulosten perusteella sopivia käyttökohteita eri klusterituotteille. Samoja funktioita tarjoavat eri klusterituotteet asetetaan paremmuusjärjestykseen. Arviointi perustuu erilaisiin määrällisiin arvoihin, kuten solmulaitteiden maksimilukumäärä, sekä laadullisiin arvoihin, kuten käyttöönoton ja hallinnoinnin helppous. Erityisesti tavoitteena on tuoda esille eri tuotteiden vahvuuksia ja heikkouksia. Vertailtavia tuotteita ovat Microsoft Cluster Service (MSCS), TruCluster Server for Tru64 UNIX, Steeleye Lifekeeper for Windows ja Sun Cluster. ACM Computing Classification System (CSS): D.4 OPERATING SYSTEMS (C) D.4.5 Reliability

A model of social work classification in health care

The introduction of casemix funding for Australian acute health care services has challenged Social Work to demonstrate clear reporting mechanisms, demonstrate effective practice and to justify interventions provided. The term 'casemix' is used to describe the mix and type of patients treated by a hospital or other health care services. There is wide acknowledgement that the procedure-based system of Diagnosis Related Groupings (DRGs) is grounded in a medical/illness perspective and is unsatisfactory in describing and predicting the activity of Social Work and other allied health professions in health care service delivery. The National Allied Health Casemix Committee was established in 1991 as the peak body to represent allied health professions in matters related to casemix classification. This Committee has pioneered a nationally consistent, patient-centred information system for allied health. This paper describes the classification systems and codes developed for Social Work, which includes a minimum data set, a classification hierarchy, the set of activity (input) codes and 'indicator for intervention' codes. The advantages and limitations of the system are also discussed.

Contributions to unsupervised and supervised learning with applications in digital image processing

311 p. : il.

Contributions to High-Throughput Computing Based on the Peer-to-Peer Paradigm

XII, 116 p.