We demonstrate SODA (Service Oriented Domain Adaptation) for efficient and scalable cross-domain microblog categorization which works on the principle of transfer learning. It is developed on a novel similarity-based iterative domain adaptation algorithm while extended with features such as active learning and interactive GUI to be used by business professionals. SODA demonstrates efficient cla...

BACKGROUND Bread is a valuable source of proteins, minerals and calories. Baking soda prevents the absorption and digestion of bread and more salt used in production of bread also causes different diseases. This study was conducted to determine the amount of soda and salt in bakeries. METHOD Cross-sectional descriptive study was carried out on 50 bakeries district during 2009. 400 samples wer...

This paper presents a system that generates web documents (courses, presentations or articles) enriched with interactive simulations and other hypermedia elements. Simulations are described using an object oriented continuous simulation language called OOCSMP. This language is complemented by two higher language layers (SODA-1L and SODA-2L). SODA-1L describes pages or slides, while SODA-2L buil...

The implementation of service-oriented device architectures (SODA) suffers from restrictions that are imposed by the use of existing syntactic technologies. Related problems include data and message-level heterogeneities among interoperating services, insufficient search and discovery of exposed services and inadequate web process composition. In this paper we propose an approach for introducin...

We have investigated gas composition during simulated inhalation induction with sevoflurane to elucidate possible mechanisms of incidental prolonged induction times and airway irritation. Using a circle system, 8% sevoflurane in oxygen 6 litre min-1 was washed into an absorbing canister filled with fresh soda lime containing 2.9% KOH (Draegersorb, 'D') or no KOH (< 0.01%, Sofnolime, 'S'). The a...

In this paper we construct quantum algorithms for matrix products over several algebraic structures called semirings, including the (max,min)-matrix product, the distance matrix product and the Boolean matrix product. In particular, we obtain the following results. • We construct a quantum algorithm computing the product of two n × n matrices over the (max,min) semiring with time complexity O(n...

A lower bound is presented which shows that a class of heap algorithms in the pointer model with only heap pointers must spend Ω ( log log n log log log n ) amortized time on the Decrease-Key operation (given O(logn) amortized-time Extract-Min). Intuitively, this bound shows the key to having O(1)-time Decrease-Key is the ability to sort O(log n) items in O(log n) time; Fibonacci heaps [M. .L. ...