Tracking mobile users in wireless networks via semi-supervised colocalization

Recent years have witnessed the growing popularity of sensor and sensor-network technologies, supporting important practical applications. One of the fundamental issues is how to accurately locate a user with few labeled data in a wireless sensor network, where a major difficulty arises from the need to label large quantities of user location data, which in turn requires knowledge about the locations of signal transmitters or access points. To solve this problem, we have developed a novel machine learning-based approach that combines collaborative filtering with graph-based semi-supervised learning to learn both mobile users' locations and the locations of access points. Our framework exploits both labeled and unlabeled data from mobile devices and access points. In our two-phase solution, we first build a manifold-based model from a batch of labeled and unlabeled data in an offline training phase and then use a weighted k-nearest-neighbor method to localize a mobile client in an online localization phase. We extend the two-phase colocalization to an online and incremental model that can deal with labeled and unlabeled data that come sequentially and adapt to environmental changes. Finally, we embed an action model to the framework such that additional kinds of sensor signals can be utilized to further boost the performance of mobile tracking. Compared to other state-of-the-art systems, our framework has been shown to be more accurate while requiring less calibration effort in our experiments performed on three different testbeds.     

A connection between the Cantor–Bendixson derivative and the well-founded semantics of finite logic programs

Results of Schlipf (J Comput Syst Sci 51:64?C86, 1995) and Fitting (Theor Comput Sci 278:25?C51, 2001) show that the well-founded semantics of a finite predicate logic program can be quite complex. In this paper, we show that there is a close connection between the construction of the perfect kernel of a $\Pi^0_1$ class via the iteration of the Cantor?CBendixson derivative through the ordinals and the construction of the well-founded semantics for finite predicate logic programs via Van Gelder??s alternating fixpoint construction. This connection allows us to transfer known complexity results for the perfect kernel of $\Pi^0_1$ classes to give new complexity results for various questions about the well-founded semantics ${\mathit{wfs}}(P)$ of a finite predicate logic program P.     

Effects of Fluorinated Diluents in Localized High-Concentration Electrolytes for Lithium–Oxygen Batteries

A stable electrolyte is critical for practical application of lithium–oxygen batteries (LOBs). Although the ionic conductivity and electrochemical stability of the electrolytes have been extensively investigated before, their oxygen solubility, viscosity, volatility, and the stability against singlet oxygen (¹O₂) still need to be comprehensively investigated to provide a full picture of the electrolytes, especially for an open system such as LOBs. Herein, a systematic investigation is reported on the localized high-concentration electrolytes (LHCEs) using different fluorinated diluents in comparison with those of conventional electrolytes. The physical properties and activation energies for reactions with singlet oxygen (¹O₂) of these electrolytes are calculated by density functional theory. The electrochemical performances of LOBs using these electrolytes are compared. This study reveals that the correlation between the stability of the electrolytes and their physical and electrochemical properties depends strongly on the diluents in LHCEs. Therefore, it shines light on the rational design of new electrolytes for LOBs.     

Processing speed, working memory, and IQ: A developmental model of cognitive deficits following cranial radiation therapy.

IQ decrements following cranial radiation therapy (CRT) for acute lymphoblastic leukemia (ALL) are most apparent years after treatment. The authors examined a developmental model for delayed deficits by evaluating the relationship between processing speed, working memory, and IQ in long-term survivors of childhood ALL (n?=?27) compared with demographically matched controls (n?≠??7). The ALL group treated with CRT showed deficits in IQ, working memory, and processing speed relative to controls. Differences in IQ between the CRT group and controls were mediated by differences in working memory. Processing speed did not fully account for the working memory deficit in the CRT group. Participants with ALL treated only with chemotherapy showed similar working memory and processing speed as matched controls. Data suggest that deficits in processing speed and working memory following CRT may underlie declines in IQ. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Effects of aging on efficiency of task switching in a variant of the Trail Making Test.

The Trail Making Test [TMT, R. M. Reitan, (see record 1960-00397-001), 1992] is extensively used in research in neuropsychology and in aging, in part because it has been postulated to reflect executive processes, such as planning and switching. However, neurocognitive and individual-difference based analyses of this test are complicated because of different spatial arrangements of targets, the use of letters only in Version B, and potential order effects when Version A is administered prior to Version B. The present article examines a variant of a TMT (called the Connections Test) that attempts to remedy these deficiencies. A structural equation model suggested that there were no direct effects of age on either the nonalternating or alternating versions of the Connections Test (analogous to TMT Versions A and B, respectively); rather, all age-related effects were mediated through effects on perceptual speed. Moreover, although the nonalternating and alternating versions were strongly related to one another, only the latter had significant independent relations with measures of higher order cognition. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Optimizing multiple dimensional queries simultaneously in multidimensional databases

Some significant progress related to multidimensional data analysis has been achieved in the past few years, including the design of fast algorithms for computing datacubes, selecting some precomputed group-bys to materialize, and designing efficient storage structures for multidimensional data. However, little work has been carried out on multidimensional query optimization issues. Particularly the response time (or evaluation cost) for answering several related dimensional queries simultaneously is crucial to the OLAP applications. Recently, Zhao et al. first exploited this problem by presenting three heuristic algorithms. In this paper we first consider in detail two cases of the problem in which all the queries are either hash-based star joins or index-based star joins only. In the case of the hash-based star join, we devise a polynomial approximation algorithm which delivers a plan whose evaluation cost is $ O(n^{\epsilon }$) times the optimal, where n is the number of queries and is a fixed constant with . We also present an exponential algorithm which delivers a plan with the optimal evaluation cost. In the case of the index-based star join, we present a heuristic algorithm which delivers a plan whose evaluation cost is n times the optimal, and an exponential algorithm which delivers a plan with the optimal evaluation cost. We then consider a general case in which both hash-based star-join and index-based star-join queries are included. For this case, we give a possible improvement on the work of Zhao et al., based on an analysis of their solutions. We also develop another heuristic and an exact algorithm for the problem. We finally conduct a performance study by implementing our algorithms. The experimental results demonstrate that the solutions delivered for the restricted cases are always within two times of the optimal, which confirms our theoretical upper bounds. Actually these experiments produce much better results than our theoretical estimates. To the best of our knowledge, this is the only development of polynomial algorithms for the first two cases which are able to deliver plans with deterministic performance guarantees in terms of the qualities of the plans generated. The previous approaches including that of [ZDNS98] may generate a feasible plan for the problem in these two cases, but they do not provide any performance guarantee, i.e., the plans generated by their algorithms can be arbitrarily far from the optimal one. Received: July 21, 1998 / Accepted: August 26, 1999     

Validation of a commercial process for inactivation of Escherichia coli O157:H7, Salmonella typhimurium, and Listeria monocytogenes on the surface of whole muscle beef jerky

We validated the lethality of three time and temperature regimens for commercial processing of whole muscle beef jerky. A total of ca. 8.9 log CFU per strip of multiple-strain cocktails of Escherichia coli O157:H7, Salmonella Typhimurium, or Listeria monocytogenes were separately applied onto the surface of beef strips that were treated as follows: (i) inoculated but not marinated or (ii) inoculated and then marinated. A total of three beef strips for each treatment in each of three trials were separately inoculated with a cocktail of one of the three pathogens and placed on the top, middle, and bottom racks of a loading truck. The strips on the rack were loaded into a commercial smokehouse and cooked and dried for 1.5, 2.5, or 3.5 h at a target temperature of 180 degrees F (82.2 degrees C) with constant (natural hickory) smoking, but without the addition of humidity. Regardless of how the strips were treated or where the strips were placed on the loading rack, drying for 1.5, 2.5, or 3.5 h to a target temperature of 180 degrees F (average of 177.2 +/- 5.6 degrees F [80.7 +/- 3.1 degrees C]), with constant smoke at an initial average relative humidity of 63.1% to a final average relative humidity of 20.9% resulted in a decrease of > or = 7.3 log CFU per strip (> or = 6.9 log CFU/g) for each of the three pathogen cocktails. Of note, marinated strips that were cooked and dried for 2.5 and 3.5 h or nonmarinated strips cooked or dried for 3.5 h also satisfied the U.S. Food Safety and Inspection Service standard of identity (moisture-to-protein ratio < or = 0.75:1) and/or shelf-stability (water activity < or = 0.8) requirements for jerky.     

Quantitation of steroid hormones in thin fresh frozen tissue sections

As analytical technologies in proteomics and metabolomics continue to mature, there is an increasing need to apply these to clinically relevant biologic samples. In this study, a liquid chromatography-tandem mass spectrometry method that utilizes selected reaction monitoring was used to measure the absolute quantity of estrogens and estrogen metabolites and testosterone in 8-microm tissue sections obtained from a fresh frozen lymph node tumor infiltrated by metastatic breast carcinoma. Total (conjugated plus unconjugated) and unconjugated levels of these steroid hormones were measured using two cohorts, each containing five adjacent serial sections cut from this tumor. The results were highly reproducible across replicate samples, showing that typical histological tissue sections represent an important sample type for the measurement of these specific metabolites.