Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...

One of the fundamental clustering problems is to assign n points into k clusters based on the minimal sum-of-squares(MSSC), which is known to be NP-hard. In this paper, by using matrix arguments, we first model MSSC as a so-called 0-1 semidefinite programming (SDP). The classical K-means algorithm can be interpreted as a special heuristics for the underlying 0-1 SDP. Moreover, the 0-1 SDP model...

1 Department of Computer Applications, Rayapati Venkata Ranga Rao and Jagarlamudi Chadramouli College of Engineering, Guntur, India 2 Jawaharlal Nehru Technological University, Kakinada, India 3 Department of Statistics, Acharya Nagarjuna University, Guntur, India, 4 Endocrine and Diabetes Centre, Andhra Pradesh, India [email protected], [email protected], [email protected], sridhar...

Recurrent events are frequently observed in biomedical studies, and often more than one type of event is of interest. Follow-up time may be censored due to loss to follow-up or administrative censoring. We propose a class of semi-parametric marginal means/rates models, with a general relative risk form, for assessing the effect of covariates on the censored event processes of interest. We formu...

On clusters and DMPs, locality of objects and threads and hence avoidance of network communication, are crucial for the application performance. We show that { in certain situations { an extension of known type inference mechanisms can be used to compute placement decisions that improve locality of threads and objects and hence reduce the application execution times. In addition to this general...

One of the fundamental clustering problems is to assign n points into k clusters based on the minimal sum-of-squares(MSSC), which is known to be NP-hard. In this paper, by using matrix arguments, we first model MSSC as a so-called 0-1 semidefinite programming (SDP). We show that our 0-1 SDP model provides an unified framework for several clustering approaches such as normalized k-cut and spectr...

In the present paper we establish some integral inequalities analogous to the wellknown Hadamard inequality for a class of generalized weighted quasi-arithmetic means in integral form.