Search results for " CLUSTER"
showing 10 items of 2162 documents
PROLISEAN: A New Security Protocol for Programmable Matter
2021
The vision for programmable matter is to create a material that can be reprogrammed to have different shapes and to change its physical properties on demand. They are autonomous systems composed of a huge number of independent connected elements called particles. The connections to one another form the overall shape of the system. These particles are capable of interacting with each other and take decisions based on their environment. Beyond sensing, processing, and communication capabilities, programmable matter includes actuation and motion capabilities. It could be deployed in different domains and will constitute an intelligent component of the IoT. A lot of applications can derive fro…
Variation of polarizability in the [4n+2] annulene series: from [22]- to [66]-annulene.
2008
Using correlated ab initio methods, the polarizability of large [4n + 2]-annulenes is determined, showing that there exists an almost linear relation between the exaltation of magnetic susceptibility (a measure of aromaticity) and an equivalent enlargement of polarizability.
Comparative statistical studies on the physical anthropology of the late Medieval period (A.D. 1000–1500)
1984
Continuing previous studies on preceding temporal periods, a total of 162 skeletal series from the late Medieval period are analysed. The dendrogram reveals an east cluster as in the other periods but a west cluster is not evident possibly because western Europe is represented by very few series. Moreover, we find a Scandinavian and a Turk cluster. Regional or ethnic pooling of the original series gives an affinity structure which is more influenced by geographic proximity than by ethnic relation. This structure predominantly reflects differentiations of skull width and length and to a lesser degree of facial height. The diachronic trend appears again, but in this period there is only a sli…
Tīmekļa lietotņu horizontāla mērogošana
2015
Kursa darba mērķis ir veikt praktisku pētījumu par tīmekļa lietotņu horizontālas mērogošanas realizāciju (slodzes sadalīšanu pa vairākiem serveru mezgliem). Tā kā tīmekļa lietotņu servera puses valodu un risinājumu ir daudz, konkrēti šim darbam tika izvēlētas tirgū visbiežāk sastopamās komponentes – PHP kā servera puses valoda (81.9% tirgus daļa 2015. gada 16. aprīlī [1]) un MySQL kā datubāžu risinājums (populārākā datubāze, ko izmanto kopā ar PHP). Kā papildus datu krātuve tiks izmantots Redis1, kas kalpos kā centralizēts datu kešošanas serveris. Papildus horizontāli mērogojamas serveru infrastruktūras izbūvei, darbā tiks apskatīti arī veidi, kā maksimāli optimizēt jau esošos resursus pēc …
A hybrid approach to semantic web services matchmaking
2008
AbstractDeploying the semantics embedded in web services is a mandatory step in the automation of discovery, invocation and composition activities. The semantic annotation is the “add-on” to cope with the actual interoperability limitations and to assure a valid support to the interpretation of services capabilities. Nevertheless many issues have to be reached to support semantics in the web services and to guarantee accurate functionality descriptions. Early efforts address automatic matchmaking tasks, in order to find eligible advertised services which appropriately meet the consumer’s demand. In the most of approaches, this activity is often entrusted to software agents, able to drive re…
Experimental Performance Evaluation of Cloud-Based Analytics-as-a-Service
2016
An increasing number of Analytics-as-a-Service solutions has recently seen the light, in the landscape of cloud-based services. These services allow flexible composition of compute and storage components, that create powerful data ingestion and processing pipelines. This work is a first attempt at an experimental evaluation of analytic application performance executed using a wide range of storage service configurations. We present an intuitive notion of data locality, that we use as a proxy to rank different service compositions in terms of expected performance. Through an empirical analysis, we dissect the performance achieved by analytic workloads and unveil problems due to the impedance…
An interest-aware video streaming platform: Shaping its architecture to better suit users' demands
2014
This paper investigates how a p2p television platform can take advantage of the presence of frequent channel viewers to grant them a more satisfying service than to less regular spectators. The idea we explore is to learn beforehand about the users’ interests, in order to cluster them in groups that display different behaviors; then, the video chunk scheduling algorithm of the p2p overlay is altered, with the aim of serving frequent spectators in a privileged manner, providing them with a faster access to the selected channel. An analytical model is developed, to capture the difference in startup delay that the proposed changes introduce; several additional performance metrics are numerical…
Solution Using Clustering Methods
1987
The main aim of this analysis is to find out typical morphologies from the multivariate and longitudinal data set on growing children and to describe the morphological evolution of the found groups of girls. The finding out of typical morphologies is, in our opinion, strictly linked to the search of structures in the individuals and in the variables.
Robust refinement of initial prototypes for partitioning-based clustering algorithms
2007
Non-uniqueness of solutions and sensitivity to erroneous data are common problems to large-scale data clustering tasks. In order to avoid poor quality of solutions with partitioning-based clustering methods, robust estimates (that are highly insensitive to erroneous data values) are needed and initial cluster prototypes should be determined properly. In this paper, a robust density estimation initialization method that exploits the spatial median estimate to the prototype update is presented. Besides being insensitive to noise and outliers, the new method is also computationally comparable with other traditional methods. The methods are compared by numerical experiments on a set of syntheti…
A hierarchical clustering strategy and its application to proteomic interaction data
2003
We describe a novel strategy of hierarchical clustering analysis, particularly useful to analyze proteomic interaction data. The logic behind this method is to use the information for all interactions among the elements of a set to evaluate the strength of the interaction of each pair of elements. Our procedure allows the characterization of protein complexes starting with partial data and the detection of "promiscuous" proteins that bias the results, generating false positive data. We demonstrate the usefulness of our strategy by analyzing a real case that involves 137 Saccharomyces cerevisiae proteins. Because most functional studies require the evaluation of similar data sets, our method…