Super-Resolution in Respiratory Synchronized Positron Emission Tomography Respiratory motion is a major source of reduced quality in positron emission tomography (PET). In order to minimize its effects, the use of respiratory synchronized acquisitions, leading to gated frames, has been suggested. Such frames, however, are of low signal-to-noise ratio (SNR) as they contain reduced statistics. Super-resolution (SR) techniques make use of the motion in a sequence of images in order to improve their quality. They aim at enhancing a low-resolution image belonging to a sequence of images representing different views of the same scene. In this work, a maximum a posteriori (MAP) super-resolution algorithm has been implemented and applied to respiratory gated PET images for motion compensation. An edge preserving Huber regularization term was used to ensure convergence. Motion fields were recovered using a B-spline based elastic registration algorithm. The performance of the SR algorithm was evaluated through the use of both simulated and clinical datasets by assessing image SNR, as well as the contrast, position and extent of the different lesions. Results were compared to summing the registered synchronized frames on both simulated and clinical datasets. The super-resolution image had higher SNR (by a factor of over 4 on average) and lesion contrast (by a factor of 2) than the single respiratory synchronized frame using the same reconstruction matrix size. In comparison to the motion corrected or the motion free images a similar SNR was obtained, while improvements of up to 20% in the recovered lesion size and contrast were measured. Finally, the recovered lesion locations on the SR images were systematically closer to the true simulated lesion positions. These observations concerning the SNR, lesion contrast and size were confirmed on two clinical datasets included in the study. In conclusion, the use of SR techniques applied to respiratory motion synchronized images lead to motion compensation combined with improved image SNR and contrast, without any increase in the overall acquisition times.

O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O

four-dimensional (4-d) positron emission tomography


Real-time wireless multi-hop protocol in underground voice communication The underground communication in tunnels and mines is very challenging due to the hostile nature of the environments and to the propagation issues that electromagnetic waves suffer there. Communication is often unidirectional (e.g. in mines) or very costly (e.g. leaky feeder in road tunnels) and hard to install and maintain. This work proposes the use of multi-hop ad-hoc networks to provide multimedia communication between mobile nodes in such a hostile environments, relying on a complete hardware/software, cheap and easy-to-setup platform that can be used both as temporary or fixed infrastructure or as communication backbone in emergency scenarios like mine accidents or a tunnel collapse. The communication is based on the Real-Time Multi-hop Protocol (RT-WMP) and its QoS extension executed over several nodes equipped with specific hardware. This protocol manages delay sensitive messages and the node mobility across the network while the QoS extension is responsible for allowing the end-to-end voice communication. The specific topology and situation have driven to a specialization of RT-WMP to better perform in this type of environments, taking advantage of the a priori (partial) knowledge about the topology. This proposal was tested in a real application in the Somport tunnel, the about 8km-long railroad linking Canfranc, Spain with Pau, France.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

manet
real-time networks
underground environment


Active control of earthquake excited structures using fuzzy supervisory technique A fuzzy supervisory technique for the active control of earthquake-excited building structures is studied in this paper. The method has a hierarchical structure, which consists of a supervisor at the higher level and several sub-controllers at the lower level. Each sub-controller is designed to reduce the story-drift of each floor by using an optimal control theory and a fuzzy logic is adopted to obtain a desirable supervisor. A fuzzy supervisor appropriately tunes the predesigned control gains at every moment by estimating the state of a structure through the fuzzy inference mechanism. The improved seismic control performance can be achieved by converting a simply designed static gain into a real-time variable dynamic gain through a fuzzy tuning process. Example designs and numerical simulations of an earthquake-excited three-story building are performed to prove the validity of the proposed control strategy.

O O O O O O O B I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

vibration control
seismic performance
earthquake-excited structures


Knowledge-Based Risk Management framework for Information Technology project The purpose of this paper is to explore the field of Risk Management (RM) in relation with Knowledge Management (KM). It attempts to present a conceptual framework, called Knowledge-Based Risk Management (KBRM) that employs KM processes to improve its effectiveness and increase the probability of success in innovative Information Technology (IT) projects. It addresses initiatives towards employing KM processes in RM processes by reviewing, interpreting the related and relevant literature and sheds light on integration with RM in the IT project. The paper exposes some pertinent elements needed for building the KBRM framework for IT projects and also suggests some instrument about the integration of KM and RM process to improve the RRP (Risk Response Planning) process efficiency. This paper will contribute to the literature and practice by providing a clear method for employing KBRM as a framework to keep organizations competitive within the business environment.

O B O O O O O O O O O O O O O O O O O B O O O O O B I O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

risk management knowledge
knowledge-based risk management
risk response planning


Determination of nonlinear stiffness with application to random vibration of geometrically nonlinear structures A novel method for determining the nonlinear modal stiffness coefficients for an arbitrary finite element model is presented. The method is applicable to a wide class of problems exhibiting bending-membrane coupling and is suitable for use with commercial finite element codes having a geometrically nonlinear static capability. The equations of motion are written in modal coordinates with the nonlinear stiffness force components written as the product of second and third order modal displacements multiplied by unknown coefficients. Prescription of particular displacement fields renders a series of inverse linear and nonlinear static problems, which are solved to determine the unknown coefficients. Verification of stiffness coefficients found using this method and their use in equivalent linearization random vibration analysis are presented.

O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I B I O O O

nonlinear stiffness
random vibration
equivalent linearization

geometric nonlinearity
nonlinear dynamics


Challenges of information reuse in customer-oriented engineering networks An exploratory research approach to reviewing existing literature. The challenges of information reuse identified from multiple complementary viewpoints. Proposal of a typology of information reuse challenges. The majority of challenges addressed knowledge processes and reuse situations. Implications for organizational development needs in engineer-to-order companies and networks.

O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O

challenge
product lifecycle management
engineer-to-order product
project-based engineering


Evaluation of semi-supervised learning method on action recognition Action recognition is one of the most difficult problems in computer vision and multimedia areas, since both spatial information and spatiotemporal semantic meaning should be taken into consideration. Moreover, the noisy and weakly annotated information make this task even harder. Nowadays, instead of the traditional features and classifiers, a lot of new attempts have made the task of action recognition promising. Noticing that there is no work on comparison of different combination of pooling and semi-supervised learning method under the same experiment setting, it would be interesting to apply different combination of pooling and semi-supervised learning method on both the synthetic and realistic action recognition datasets to see which combination or method performs better. In summary, we can obtain the following conclusions based on our experiments. Firstly, Second Order Pooling (Carreira et al.2012) is worse than the traditional Bag of Words (Schmid and Mohr1997; Dance et al.2004) regarding to the overall performance in some dataset, but is a good way to speed up the coding stage of video classification with little sacrifice of performance. Secondly, Semi-supervised Hierarchical Regression Algorithm (MLHR) and Manifold Regularized Least Square Regression (MRLS) (Belkin et al. J Mach Learn Res 12:23992434,2006) is better than some of the supervised learning methods (? 2-SVM, SVM-2K (Farquhar et al.2006)) in the real world action recognition problems which shares little available annotated information. Thirdly, for KTH, UCF50 and HMDB dataset, late fusion doesnt necessarily improve the performance. In comparison, MLHR, SVM-2K and Multi-kernel Learning is a more natural way to deal with multi-feature problems.

O O O O O O B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

semi-supervised learning
multi-feature fusion
video concept annotation


The development of initial trust in an online company by new customers Lack of trust in online companies is a primary reason why many web users do not shop online. This study proposes a model to explain how new customers of a web-based company develop initial trust in the company after their first visit. The model is empirically tested using a questionnaire-based field study. The results indicate that perceived company reputation and willingness to customize products and services can significantly affect initial trust. Perceived web site usefulness, ease of use, and security control are also significant antecedents of initial trust. Finally, we found no support for the hypothesized effect of individual customer trust propensity on initial trust.

O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B I

electronic commerce
online customers
web site perceptions
technology acceptance model
web security


A comment on the implementation of the Ziggurat method We show that the short period of the uniform random number generator in the published implementation of Marsaglia and Tsang's Ziggurat method for generating random deviates can lead to poor distributions. Changing the uniform random number generator used in its implementation fixes this issue.

O O O O O O O B I O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O

random number generators
normal distribution
xorshift rngs


A new dispatching mechanism - Using value classification and indexing - for value predictors Value prediction can be used to break data dependency between instructions, ensuring simultaneous handling of multiple instructions in processors. When such instruction-level parallelism is lifted, it helps reduce a processor's idle time and thus enhances the performance. To improve the accuracy of value prediction at low additional cost, this paper presents a new dispatching mechanism with special data value classifications and simple indexing devices. The proposed dispatching mechanism classifies data values based on their distribution patterns to attain more balanced utilization of all prediction entries. Three different value indexing devices are also introduced to set up more sophisticated and precise predicting steps. Experimental evaluation shows that the new dispatching mechanism is able to enhance the accuracy of value predictors at small extra cost.

O O B I O O B I O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O

data dependency
value predictors
dispatching mechanism
value classification
value indexing

instruction-level parallelism
prediction accuracy


Exploring probabilistic localized video representation for human action recognition In recent years, the bag-of-words (BoW) video representations have achieved promising results in human action recognition in videos. By vector quantizing local spatial temporal (ST) features, the BoW video representation brings in simplicity and efficiency, but limitations too. First, the discretization of feature space in BoW inevitably results in ambiguity and information loss in video representation. Second, there exists no universal codebook for BoW representation. The codebook needs to be re-built when video corpus is changed. To tackle these issues, this paper explores a localized, continuous and probabilistic video representation. Specifically, the proposed representation encodes the visual and motion information of an ensemble of local ST features of a video into a distribution estimated by a generative probabilistic model. Furthermore, the probabilistic video representation naturally gives rise to an information-theoretic distance metric of videos. This makes the representation readily applicable to most discriminative classifiers, such as the nearest neighbor schemes and the kernel based classifiers. Experiments on two datasets, KTH and UCF sports, show that the proposed approach could deliver promising results.

O O O O O O B I I O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

human action recognition
probabilistic video representation


A joint antenna and user selection scheme for multiuser MIMO system In this paper, we present a low-complexity algorithm for real-time joint user scheduling and receive antenna selection (JUSRAS) in Multiuser MIMO systems. The computational complexity of exhaustive search for JUSRAS problem grows exponentially with the number of users and receives antennas. We apply binary particle swarm optimization (BPSO) to the joint user scheduling and receive antenna selection problem. In addition to applying the conventional BPSO to JUSRAS, we also present a specific improvement to this population-based heuristic algorithm; namely, we feed cyclically shifted initial population, so that the number of iterations until reaching an acceptable solution is reduced. The proposed BPSO for JUSRAS problem has a low computational complexity, and its effectiveness is verified through simulation results.

O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

multiuser mimo
particle swarm optimization
user selection


designing spatial story-telling software What does it mean when we design for accessibility, inclusivity and "dissolving boundaries" -- particularly those boundaries between the design philosophy, the software/interface actuality and the stated goals? This paper is about the principles underlying a research project called 'The Little Grey Cat engine' or greyCat. GreyCat has grown out of our experience in using commercial game engines as production environments for the transmission of culture and experience through the telling of individual stories. The key to this endeavour is the potential of the greyCat software to visualize worlds and the manner in which non-formal stories are intertwined with place. The apparently simple dictum of "show, don't tell" and the use of 3D game engines as a medium disguise an interesting nexus of problematic issues and questions, particularly in the ramifications for cultural dimensions and participatory interaction design. The engine is currently in alpha and the following paper is its background story. In this paper we discuss the problematic, thrown into sharp relief by a particular project, and we continue to unpack concepts and early designs behind the greyCat itself.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

computer games
participatory design
spatiality


Quality of health-related online search results Consumers are increasingly searching for health information online and using that information to inform their decisions and behavior. Because the negative consequences of basing decisions on inaccurate or untrustworthy health information may be particularly serious, it is important to understand the quality of online health information. This study empirically investigates the quality of health information that is returned by popular search engines when queried using a large, comprehensive set of health-related search terms. Findings indicate that a majority of such information returned by popular search engines is of a high quality but quality levels vary across different health topic areas. In particular, searches for terms related to preventive health and social health issues tend to produce lower quality results than terms related to diagnosis and treatment of physical disease or injury. While the overall prevalence of high quality information is greater than that of low quality, the observed variance across health-related terms has important implications for consumers, policy makers, health information providers, and search engines.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

health search
online information quality
online medical information
health website quality
search quality


A literature review of electronic marketplace research: Themes, theories and an integrative framework In this paper, we presented a literature review of the current status of electronic marketplace (EM) research. It consists of 109 journal articles published in 19 journals that are appropriate outlets for electronic commerce research. The results show that an increasing volume of EM research has been conducted from diverse theoretical perspectives. Based on content analysis, we identified eight research themes, five types of methodologies and six categories of background theories which most EM researches were grounded in. By combining research themes and the patterns of the background theories, an integrative framework of EM was proposed to represent the paradigms of EM researches. The framework shows that EM phenomena can be addressed from three perspectives: information systems, inter-organizational/social structure and strategic management perspectives. This framework suggests a parsimonious and cohesive way to explain key EM research issues such as EM adoption, success and impact.

O B I O B I O O O O O B I O O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

electronic marketplace
literature review
integrative framework


Hierarchy-aware skip graph for sensing resource discoveries on large-scale sensor overlay networks ? The rapid development of sensor networks has made it possible to build a large-scale sensor overlay network by integrating separated sensor networks all over the world. In our previous research, we proposed to realize sensor overlay networks by connecting their gateways with skip graph (SG) overlay, which is distributed and self-organized, and supports retrieving sensing resources using their properties. Although this method has proven to be effective in some scenarios, the lack of proximity awareness of an SG makes it difficult to build large-scale sensor overlay systems efficiently. In this paper, we present the hierarchy-aware extension of SG (HSG), which uses a hierarchy-aware neighbor selection mechanism that integrates the hierarchy of the physical Internet into overlay construction and routing to improve latency and traffic locality. To construct an HSG efficiently under various network environments, we develop a hierarchy-aware sampling mechanism for nodes to identify better neighbors than SG. To verify and validate the feasibility of HSG as a building block of large-scale sensor overlay networks, we carried out extensive simulations in near practical scenarios, which were obtained by analyzing an Internet measurement dataset. We showed that HSG could improve the routing latency and locality significantly with little overhead.

O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

range query
skip graph (sg)
hierarchy-aware


Balancedness of infrastructure cost games In this paper we study the class of infrastructure cost games. A game in this class models the infrastructure costs (both building and maintenance) produced when a set of users of different types makes use of a certain infrastructure, which may consist of several facilities. Special attention is paid to one facility infrastructure cost games. Such games are modeled as the sum of an airport game and a maintenance cost game. It turns out that the core and nucleolus of these games are very closely related to the core and nucleolus of an associated generalized airport game. Furthermore we provide necessary and sufficient conditions under which an infrastructure cost game is balanced.

B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Self-stabilizing distributed algorithm for local mutual inclusion A self-stabilizing distributed algorithm for the local mutual inclusion problem is presented. The local mutual inclusion is a problem such that for each process P, at least one of P and its neighbors is in critical section. Convergence time of the proposed algorithm is 1 round under weakly fair distributed daemon.

O B I O O B I O O B I O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

mutual exclusion
process synchronization
self-stabilization


user acceptance of mobile tv services Mobile digital television technology facilitates broadcast TV on a mobile phone as well as interactive add-on services provided on top of the selected TV channel. In this paper we describe the results of a six-month field trial where 27 users were evaluating commercially available mobile TV services and 10 different pilot services. Mobile TV found a role in the everyday lives of the users as an extension to ordinary TV. The users appreciated easy and continuous access to TV contents. The results highlight that short usage situations typical to mobile TV use are hindering the adoption of new add-on services. The adoption can be supported by using content, appearance or functionality familiar from other media. The main problems with add-on services were related to knowing about the mere existence of these services and their contents as well as understanding the concept of services available only during a certain TV show.

B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


An improved exact algorithm for the domatic number problem The 3-domatic number problem asks whether a given graph can be partitioned into three dominating sets. We prove that this problem can be solved by a deterministic algorithm in time 2.695(n) (up to polynomial factors) and in polynomial space. This result improves the previous bound of 2.8805(n), which is due to Bjorklund and Husfeldt. To prove our result, we combine an algorithm by Fomin et al. with Yamamoto's algorithm for the satisfiability problem. In addition, we show that the 3-domatic number problem can be solved for graphs G with bounded maximum degree Delta (G) by a randomized polynomial-space algorithm, whose running time is better than the previous bound due to Riege and Rothe whenever Delta (G) >= 5. Our new randomized algorithm employs Schoning's approach to constraint satisfaction problems. (c) 2006 Elsevier B.V. All rights reserved.

O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

graph algorithms
exact algorithms
randomized algorithms


Knowledge-based scheme to create privacy-preserving but semantically-related queries for web search engines Web search engines (WSEs) are basic tools for finding and accessing data in the Internet. However, they also put the privacy of their users at risk. This happens because users frequently reveal private information in their queries. WSEs gather this personal data and build user profiles which are used to provide personalized search (PS). PS improves the users search results and, hence, it is a key element for the successfulness of WSEs: the entity that offers the best searching experience should attract more users. Nevertheless, profiles can also be used in an improper way by WSEs or they can be stolen by attackers. This situation requires privacy-preserving schemes able to handle from simple queries (one single term) to complex queries (several words with or without relation). Generally, these systems generate and submit inaccurate queries in order to provide privacy, but these queries must be carefully built in order to keep the usefulness of the user profiles. Current literature does not address the generation of privacy-preserving and useful complex queries. Therefore, this paper presents a new scheme that generates distorted user queries from a semantic point of view in order to preserve the usefulness of user profiles. Besides, linguistic analysis techniques are used to properly interpret complex queries performed by users and generate new semantically-related ones accordingly. The performance of the new scheme is evaluated in terms of semantic preservation of new queries, privacy level and runtime. A set of query logs taken from real users and compiled by AOL is used as test data.

O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O

complex query
ontologies
private information retrieval
semantic analysis


Understanding tuberculosis epidemiology using structured statistical models Molecular epidemiological studies can provide novel insights into the transmission of infectious diseases such as tuberculosis. Typically, risk factors for transmission are identified using traditional hypothesis-driven statistical methods such as logistic regression. However, limitations become apparent in these approaches as the scope of these studies expand to include additional epidemiological and bacterial genomic data. Here we examine the use of Bayesian models to analyze tuberculosis epidemiology. We begin by exploring the use of Bayesian networks (BNs) to identify the distribution of tuberculosis patient attributes (including demographic and clinical attributes). Using existing algorithms for constructing BNs from observational data, we learned a BN from data about tuberculosis patients collected in San Francisco from 1991 to 1999. We verified that the resulting probabilistic models did in fact capture known statistical relationships. Next, we examine the use of newly introduced methods for representing and automatically constructing probabilistic models in structured domains. We use statistical relational models (SRMs) to model distributions over relational domains. SRMs are ideally suited to richly structured epidemiological data. We use a data-driven method to construct a statistical relational model directly from data stored in a relational database. The resulting model reveals the relationships between variables in the data and describes their distribution. We applied this procedure to the data on tuberculosis patients in San Francisco from 1991 to 1999, their Mycobacterium tuberculosis strains, and data on contact investigations. The resulting statistical relational model corroborated previously reported findings and revealed several novel associations. These models illustrate the potential for this approach to reveal relationships within richly structured data that may not be apparent using conventional statistical approaches. We show that Bayesian methods, in particular statistical relational models, are an important tool for understanding infectious disease epidemiology.

O B B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B B O O O O O O O B I O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B

bayesian networks
epidemiology
tuberculosis

probabilistic and statistical relational models


PC3: Principal Component-based Context Compression: Improving energy efficiency in wireless sensor networks We focus on energy efficiency, which guarantees the operation of a Wireless Sensor Network for long. We propose a context compression model that works in an orthogonal fashion. We first reduce the dimensions of multivariate contextual information. This is achieved through the Principal Component Analysis (PCA), which determines the statistical dependencies between the different contextual components. We then suppress the transmission of the determined principal components through an extrapolation scheme that exploits the properties of each individual component. Our findings are quite promising for the broader domain of WSN-based application engineering and context awareness.

O O O B I O B I O O O O O O O B I O O O O O O B I I O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O

wireless sensor network
context compression
energy efficiency
principal component analysis
extrapolation


Evolution of small guide RNA genes in hyperthermophilic archaea Profiling the RNA production in hyperthermophilic archaea revealed an abundance of small RNAguided processes near the upper temperature limit of life. Archaea utilize the base-pairing ability of RNA guide sequences to target ribosomal RNAs, transfer RNAs, messenger RNAs, and viral genomes. Cellular processes that are guided by small RNAs include the modification of RNA molecules, trans-splicing, gene regulation, and RNA and DNA degradation. Here, a brief overview of our knowledge on small guide RNA genes in archaeal genomes is provided and examples of their putative roles in genome evolution are described.

O O O O O O O O B O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

crispr
c/d box srnas
transfer rna fragments
virus defense
genome rearrangements


An examination of gender differences among college students in their usage perceptions of the internet In todays higher education, the Internet is indispensable in creating, storing, and disseminating information and knowledge. This study examines gender differences among college students in their usage perceptions of the Internet. A multiple-variable logistic model was proposed and tested using data gathered from 805 college students. The results of the study suggest gender differences in usage perceptions of the Internet can be detected among college students. Specifically, the differences are reflected in that male college students have a higher level of perceptions of Internet self-efficacy, experience, and information overload than females. Implications for research in information systems and practice in higher education are discussed.

O O O B O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O B I O O

gender
higher education
information overload

internet usage
self-efficacy
internet experience
ease of use
usefulness


coloring unstructured radio networks During and immediately after their deployment, ad hoc and sensor networks lack an efficient communication scheme rendering even the most basic network coordination problems difficult. Before any reasonable communication can take place, nodes must come up with an initial structure that can serve as a foundation for more sophisticated algorithms. In this paper, we consider the problem of obtaining a vertex coloring as such an initial structure. We propose an algorithm that works under the unstructured radio network model. This model captures the characteristics of newly deployed ad hoc and sensor networks, i.e. asynchronous wake-up, no collision-detection, and scarce knowledge about the network topology. Our algorithm produces a correct coloring with O (?) colors in time O (? log n ) with high probability in a unit disk graph, where n and ? are the number of nodes in the network and the maximum degree, respectively. Furthermore, the number of locally used colors depends only on the local node density.

B O O O O O O O O B O O O B I O O O B B B O O O O B B O O O O O B O O B O O O O O O O B O O O O O O O O O O O O B O O O O O O O O B O O O O B O O O B O O O O O O B B O B O O O O O O O O O B I O O O O O O O B O O B O O B O O O B O O O O O O O O B O O O O B O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O

communication
network
sensor networks
coordination
log
probability
paper
model
knowledge
place
structure
rendering
deployment
graph
coloring
algorithm
scheme

collision detection
radio network
ad hoc networks
efficiency
timing
locality
asynchronous wake-up
initialization
asynchronicity
network topologies
ad-hoc


Preemptive scheduling on uniform machines to minimize mean flow time A set of jobs has to be scheduled on parallel uniform machines. Each machine can handle at most one job at a time. Each job becomes available for processing at its release date. All jobs have the same execution requirement, and each machine has a known speed. The processing of any job may be interrupted arbitrarily often and resumed later on any machine. We want to find a schedule that minimizes the sum of completion times, i.e., we consider problem Q|rj,pj=p,pmtn|?Cj Q | r j , p j = p , pmtn | ? C j whose complexity status was open. In this paper, we give a polynomial algorithm for the above problem. The algorithm is based on a reduction of the scheduling problem to a linear program. The crucial condition for implementing the proposed reduction is the known order of job completion times.

O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

parallel uniform machines
polynomial algorithm


Estimating and testing effect size from an arbitrary population In this article, we develop inference tools for an effect size parameter in a paired experiment. A class of estimators is defined that includes natural, shrinkage and shrinkage preliminary test estimators. The shrinkage and preliminary test methods incorporate uncertain prior information on the parameter. This information may be available in the form of a realistic guess on the basis of the experimenter's knowledge and experience, which can be incorporated into the estimation process to increase the efficiency of the estimator. Asymptotic properties of the proposed estimators are investigated both analytically and computationally. A simulation study is also conducted to assess the performance of the estimators for moderate and large samples. For illustration purposes, the method is applied to a data set.

O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

shrinkage and preliminary test estimators


timethread-role maps for object-oriented design of real-time-and-distributed systems Object-oriented design methods and notations do not adequately address the concerns of real-time-and-distributed (RTD) systems. Issues critical to such systems, like performance, robustness, and concurrency are not seriously considered until detailed design. We propose an object-oriented approach that allows RTD design issues to be considered before detailed design. The approach revolves around timethread-role maps that present composite pictures of concurrent, interacting, end-to-end responsibility paths through a system. It is related to responsibility-driven design approaches, but extended for RTD systems. The paper illustrates by example how timethread-role maps can be used to explore, compare and explain different organizations for achieving the paths. The paper also illustrates how timethread-role maps may be used to represent dynamic structure.

O B O O B O O B O B O O O O O O O O O O O O B O O O O B O B O O B O O O O O O B O O O O O O O O B O O O O O O B O O O O O B O O O O O O O O O O O O O O O O O O B O O O O O B O B O O O O O B O O O O O O O O O O O O O O O B O O O O B O O O O O B B

structure systems maps dynamic design performance concurrency paper

role
organization
examples
object-oriented design
addressing
response
distributed
critic
object-oriented
real-time
compositing
distributed systems
design method
exploration
robust


EDI use and participation models: from the inter-organizational relationship perspective Electronic Data interchange (EDI) is an inter-organizational information system that requires collaboration and commitment between trading partners. The potential benefits that EDI can offer are substantial. However, the adoption and use of electronic linkages between companies is not as simple, or as profitable as had been expected. This study developed three conceptual models based on four important EDI measurements: EDI volume, diversity, depth, and breadth. Next, this research identified and discussed the evolutionary procedures of and the magnitude of EDI participation that companies tend to adopt in the context of the various environmental factors. Finally, this study produced a number of managerial implications and recommendations.

O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

information systems
partnering
information technology


Solving satisfiability problems using elliptic approximations. A note on volumes and weights In this note we propose to use the volume of elliptic approximations of satisfiability problems as a measure for computing weighting coefficients of clauses of different lengths. For random 3-SAT formula it is confirmed experimentally that, when applied in a DPLL algorithm with a branching strategy that is based on the ellipsoids as well, the weight deduced yields better results than the weights that are used in previous studies.

O B O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

conjunctive normal form
elliptic approximation


improving end-to-end performance of the web using server volumes and proxy filters The rapid growth of the World Wide Web has caused serious performance degradation on the Internet. This paper offers an end-to-end approach to improving Web performance by collectively examining the Web components --- clients, proxies, servers, and the network. Our goal is to reduce user-perceived latency and the number of TCP connections, improve cache coherency and cache replacement, and enable prefetching of resources that are likely to be accessed in the near future. In our scheme, server response messages include piggybacked information customized to the requesting proxy. Our enhancement to the existing request-response protocol does not require per-proxy state at a server, and a very small amount of transient per-server state at the proxy, and can be implemented without changes to HTTP 1.1. The server groups related resources into volumes (based on access patterns and the file system's directory structure) and applies a proxy-generated filter (indicating the type of information of interest to the proxy) to tailor the piggyback information. We present efficient data structures for constructing server volumes and applying proxy filters, and a transparent way to perform volume maintenance and piggyback generation at a router along the path between the proxy and the server. We demonstrate the effectiveness of our end-to-end approach by evaluating various volume construction and filtering techniques across a collection of large client and server logs.

O O B O O B O B B O B B O O O O O O O B O O O B O O O B O B O O O O O O B B O O O O B O O O O O O O B O O O O O O B O O O O O O O B B O B O O O B O O O O O O O O O O O B O O B B B O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O B O O O O O O O O O O B O O O O B O O B O O O B I O B O O O O O O O O O O O O O O B O B O O O O O O B I O O B B O O B B O O O O O O O B O O B O O B O O O O O B O O B O B O O O O O O O O O O O O O O O O O O O O O B O

network
generation
web
performance
data structures
router
tailor
prefetching
response
access
paper
cache
structure
latency
proxy
coherency
filters
volumes
maintenance
demonstrate
internet
future
file systems
server
scheme

efficiency
collect
group
informal
world wide web
user
change
pattern
component
cache coherence
piggybacking
transparency
message
custom
caching
connection
effect
resource


Object-oriented programming in FEM and BEM: a bibliography (1990-2003) This paper gives a bibliographical review of the object-oriented programming applied to the finite element method as well as to the boundary element method. The bibliography at the end of the paper contains references to papers, conference proceedings and theses/dissertations on the subject that were published between 1990 and 2003. The following topics are included: finite element method-object-oriented programming philosophy, mesh modelling, distributed/parallel processing, toolkits and libraries, object-oriented specific applications (aerospace, civil engineering/geomechanics, coupled problems, dynamical systems, electromagnetics, fracture mechanics and contact problems, material simulations/manufacturing, mechanical engineering, nonlinear structural simulations, optimization, others); boundary element method. Totally 408 references are listed. (C) 2004 Elsevier Ltd. All rights reserved.

O O O O O O O B O O O O O O O O O O O O O O B I I O O O O O B I I O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O

finite element method
boundary element method
bibliography


Scheduling and planning job execution of loosely coupled applications Growth in availability of data collection devices has allowed individual researchers to gain access to large quantities of data that needs to be analyzed. As a result, many labs and departments have acquired considerable compute resources. However, effective and efficient utilization of those resources remains a barrier for the individual researchers because the distributed computing environments are difficult to understand and control. We introduce a methodology and a tool that automatically manipulates and understands job submission parameters to realize a range of job execution alternatives across a distributed compute infrastructure. Generated alternatives are presented to a user at the time of job submission in the form of tradeoffs mapped onto two conflicting objectives, namely job cost and runtime. Such presentation of job execution alternatives allows a user to immediately and quantitatively observe viable options regarding their job execution, and thus allows the user to interact with the environment at a true service level. Generated job execution alternatives have been tested through simulation and on real-world resources and, in both cases, the average accuracy of the runtime of the generated and perceived job alternatives is within 5%.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

distributed architectures
load balancing and task assignment
scheduling and task partitioning
user interfaces


Movement-induced motion signal distributions in outdoor scenes The movement of an observer generates a characteristic field of velocity vectors on the retina (Gibson 1950). Because such optic flow-fields are useful for navigation, many theoretical, psychophysical and physiological studies have addressed the question how egomotion parameters such as direction of heading can be estimated from optic flow. Little is known, however, about the structure of optic flow under natural conditions. To address this issue, we recorded sequences of panoramic images along accurately defined paths in a variety of outdoor locations and used these sequences as input to a two-dimensional array of correlation-based motion detectors (2DMD). We find that (a) motion signal distributions are sparse and noisy with respect to local motion directions; (b) motion signal distributions contain patches (motion streaks) which are systematically oriented along the principal flow-field directions; (c) motion signal distributions show a distinct, dorso-ventral topography, reflecting the distance anisotropy of terrestrial environments; (d) the spatiotemporal tuning of the local motion detector we used has little influence on the structure of motion signal distributions, at least for the range of conditions we tested; and (e) environmental motion is locally noisy throughout the visual field, with little spatial or temporal correlation; it can therefore be removed by temporal averaging and is largely over-ridden by image motion caused by observer movement. Our results suggest that spatial or temporal integration is important to retrieve reliable information on the local direction and size of motion vectors, because the structure of optic flow is clearly detectable in the temporal average of motion signal distributions. Egomotion parameters can be reliably retrieved from such averaged distributions under a range of environmental conditions. These observations raise a number of questions about the role of specific environmental and computational constraints in the processing of natural optic flow.

O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O B O O O O O O O O O O B O O B O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O B I O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I

vision
motion detector model
motion integration
natural scenes


Fundamental limits of linear equalizers: Diversity, capacity, and complexity Linear equalizers (LEs) have been widely adopted for practical systems due to their low computational complexity. However, it is also well known that LEs provide inferior performance relative to a maximum-likelihood equalizer (MLE) or other near-MLEs, because LEs usually cannot collect the diversity order enabled by the transmitter and at the same time they lose mutual information. More importantly, unlike MLE or near-MLEs, the performance of LES has not been well quantified. This hinders more general applications of LEs in wireless systems. In this paper, we reveal a fundamental link between a channel parameter-orthogonality deficiency (od) of the channel matrix-and the diversity and capacity of LEs. We identify that when the od of channel matrix has an upper bound strictly less than 1, the same diversity order as that of MLEs is collected by LEs and the outage capacity loss relative to MLEs is also a constant over signal-to-noise ratio (SNR). These results can be applied to designing a framework for hybrid equalizers. Furthermore, by studying the statistical properties of the od and comparing the complexity of different equalizers, we show that hybrid equalizers can trade off between performance and complexity by tuning the channel matrix od. The theoretical analysis is corroborated by computer simulations.

O O O B I B B O B B I O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O B O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O

capacity
complexity
diversity
linear equalizers


A 2-D parallel convex hull algorithm with optimal communication phases We investigate the problem of finding the 2-D convex hull of a set of points on a coarse-grained parallel computer, Goodrich has devised a parallel sorting algorithm for n items on P processors which achieves an optimal number of communication phases for all ranges of P less than or equal to n. Ferreira et al. have recently introduced a deterministic convex hull algorithm with a constant number of communication phases for n and P satisfying n greater than or equal to P1+is an element of. Here we present a new parallel 2-D convex hull algorithm with an optimal bound on number of communication phases for all values of P less than or equal to n while maintaining optimal local computation time. (C) 2001 Elsevier Science B.V, All rights reserved.

O O O B I O O O B O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O B I O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O


CLUMPY:

A

code

for

gamma-ray

signals

from

dark

matter

structures

We

present

the

first

public

code

for

semi-analytical

calculation

of

the

gamma-ray

flux

astrophysical

J-factor

from

dark

matter

annihilation/decay

in

the

Galaxy,

including

dark

matter

substructures.

The

core

of

the

code

is

the

calculation

of

the

line

of

sight

integral

of

the

dark

matter

density

squared

(for

annihilations)

or

density

(for

decaying

dark

matter).

The

code

can

be

used

in

three

modes:

i)

to

draw

skymaps

from

the

Galactic

smooth

component

and/or

the

substructure

contributions,

ii)

to

calculate

the

flux

from

a

specific

halo

(that

is

not

the

Galactic

halo,

e.g.

dwarf

spheroidal

galaxies)

or

iii)

to

perform

simple

statistical

operations

from

a

list

of

allowed

DM

profiles

for

a

given

object.

Extragalactic

contributions

and

other

tracers

of

DM

annihilation

(e.g.

positrons,

anti-protons)

will

be

included

in

a

second

release.

Program

summary

Program

title:

CLUMPY

Catalogue

identifier:

Program

summary

URL:

Program

obtainable

from:

CPC

Program

Library,

Queen's

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

C/C++

Computer:

PC

and

Mac

Operating

system:

UNIX(Linux),

MacOS

X

RAM:

Depends

on

the

requested

size

of

skymaps

(similar

to

Mb

for

a

x

map)

Classification:

External

routines:

CERN

ROOT

library

Doxygen

(optional)

Nature

of

problem:

Calculation

of

gamma-ray

signal

from

dark

matter

annihilation

(resp.

decay).

This

involves

a

particle

physics

term

and

an

astrophysical

one.

The

focus

here

is

on

the

latter.

Solution

method:

Integration

of

the

DM

density

squared

(resp.

density)

along

a

line

of

sight.

The

code

is

optimised

to

deal

with

the

DM

density

peaks

encountered

along

the

line

of

sight

(DM

substructures).

A

semi-analytical

approach

(calibrated

on

N-body

simulations)

is

used

for

the

spatial

and

mass

distributions

of

the

dark

matter

substructures

in

the

Galaxy.

Restrictions:

Some

generic

dark

matter

annihilation

spectra

are

provided

but

are

not

included

in

the

calculation

so

far

as

it

is

assumed

that

the

particle

physics

is

independent

of

the

astrophysics

of

the

problem.

Running

time:

This

is

highly

dependent

on

the

DM

profiles

considered,

the

requested

precision

epsilon

and

integration

angle

alpha(int):

about

mn

for

a

degrees

x

degrees

map

towards

the

Galactic

centre,

with

alpha(int)

degrees,

NFW

dark

matter

profiles

and

epsilon

about

h

for

the

same

set-up

towards

the

anti-centre;

to

DM

models

per

second,

depending

on

integration

angle

and

DM

profile.

(C)

Elsevier

B.V.

All

rights

reserved.

O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

cosmic rays
cosmology
indirect detection
gamma-rays


Structure-based graph distance measures of high degree of precision In recent years, evaluating graph distance has become more and more important in a variety of real applications and many graph distance measures have been proposed. Among all of those measures, structure-based graph distance measures have become the research focus due to their independence of the definition of cost functions. However, existing structure-based graph distance measures have low degree of precision because only node and edge information of graphs are employed in these measures. To improve the precision of graph distance measures, we define substructure abundance vector (SAV) to capture more substructure information of a graph. Furthermore, based on SAV, we propose unified graph distance measures which are generalization of the existing structure-based graph distance measures. In general, the unified graph distance measures can evaluate graph distance in much finer grain. We also show that unified graph distance measures based on occurrence mapping and some of their variants are metrics. Finally, we apply the unified graph distance metric and its variants to the population evolution analysis and construct distance graphs of marker networks in three populations, which reflect the single nucleotide polymorphism (SNP) linkage disequilibrium (LD) differences among these populations.

O B I O O O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O B I O O O O O B I O O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O

graph distance
snp linkage disequilibrium

distance metric
structure-based graph distance


Controlled sealing of nanopores using an easily fabricated silicon platform combining in situ optical and electrical monitoring A functional SOI-based nanopore platform fabricated by a simple front side process. We develop an integrated fluidic chip for optical and electrical characterization. We demonstrate the electrical and optical monitoring of particles trapping events.

O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O

biosensors
e-beam lithography
microfluidics integration
soi


Prediction and assignment of latent roots of damped asymmetric systems by structural modifications This paper studies the latent roots of damped asymmetric systems in which the stiffness matrix is asymmetrical. The asymmetric terms are due to external loads and are represented by a parameter or parameters. The latent roots of such asymmetric systems are complex and the real parts become positive at some critical values of the parameter(s) (critical points). The work reported in this paper consists of two parts. The first part presents a method for predicting the latent roots of the damped asymmetric system from the receptance of the damped symmetric system. The second part presents an inverse method for assigning latent roots by means of mass, stiffness and damping modifications to the damped asymmetric system again based on the receptance of the unmodified damped symmetric system. The simulated numerical examples of a friction-induced vibration problem show the complexity in assigning stable latent roots for damped asymmetric systems. It is found that it is quite difficult to assign the real parts of latent roots to stabilise the originally unstable asymmetric system and sometimes there is no solution to the modification that is intended to assign certain latent roots.

B O B O B I O B O O O O O O O O O B I O B O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B B I O O O O O B O O O O O O O O O O O B I O O O O O O O O O O B B I O O O O O O O O B O O O O O O O O O O O O O O O O O B I O B O O O O O O O O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O O O B I

asymmetric system
damped
latent roots
prediction
assignment

structural modification
friction-induced vibration
flutter
instability


Trends in transforming scholarly communication and their implications Scholarly communication is undergoing transformation under the confluence of many forces. The purpose of this article is to explore trends in transforming scholarly publishing and their implications. It examines how collaboration and volume of information production were changed over the past century. It also explores how older documents are used under todays network environment where new information is easily accessible. Understanding these trends would help us design more effective electronic scholarly publishing systems and digital libraries, and serve the needs of scholars more responsively.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O

authorship
citation analysis
digital library


WEAK LFM SIGNAL DECTECTION BASED ON WAVELET TRANSFORM MODULUS MAXIMA DENOISING AND OTHER TECHNIQUES A new method for detecting weak linear frequency modulated (LFM) pulse signals buried in additive white Gaussian noise (AWGN) is presented in this paper. The method is based on the features of wavelet transform modulus maxima (WTMM) denoising and auto-correlation filtering theory. Firstly, the frequency-domain information is extracted by auto-correlation matched filtering, and is used to deduce the optimal wavelet decomposition scales. Secondly, let the signal modulus dominate on the biggest scale after the optimal scales decomposition, then keeping the signal modulus and removing the noise modulus at each scale are performed by utilizing the different propagation properties of signal and noise wavelet modulus maxima across the scales. Finally, a reconstructed signal is obtained from the reserved signal modulus with an improved signal-to-noise ratio (SNR), and is used for time-domain information extraction. At the same time, wavelet denoising depends on selecting an optimum wavelet that matches well the shape of the signal. The cross correlation coefficients between signal and db wavelets are calculated and the optimal wavelet to analysis the LFM signal is selected. Simulations show that the method can extract time-frequency information of LFM signal when SNR <= -6dB.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

lfm pulse signal
auto-correlation filtering
optimal wavelet selection
wavelet transform modulus maxima (wtmm)
parameter extraction


Density functional studies of the substituent effect on absorption and emission properties of 1, 8-naphthalimide derivatives Using TD-PBE1PBE/6-31G* and TD-B3LYP/6-31G* approaches, we calculated the absorption and emission spectra of 1,8-naphthalmide derivatives in gas-phase. The geometric structures optimized by HF/6-31G* and B3LYP/6-31G* models and the absorption and emission maxima were in good agreement with existed experimental measurements. It was also found that the lowest singlet states corresponded mainly to the electronic transition from the highest occupied orbital (HOMO) to the lowest unoccupied molecular orbital (LUMO). Intramolecular charge transfer occurred between substituents and naphthalimic rings. Study also showed that most compounds with low absorption excitation energies had low vertical ionization potentials. Finally, the delocalization electronic energies between substituents and naphthalimic rings of isomers were investigated to obtain further sight into their stability.

O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

absorption spectra
dft
frontier molecular orbitals
isomeric structures
1,8-naphthalimide derivatives


popss - a parametric operating system simulator In this paper we describe POPSS, an event driven simulator which is intended to simulate the activity of a computer system- hardware together with an operating system - as it processes a work-load. Input to the simulator is in the form of keyword parameters which are used for describing all three components - hardware, operating system, and workload. POPSS is a simulator as opposed to a simulation language. It is designed to model the inner workings of a computer system in addition to yielding the results usually associated with simulation. The program is highly modular, consisting of some 45 subprograms. Of these, there are 22 modules, each of which represents an operating system component (or possibly a part of one such component). Included in POPSS are built-in replacement features to allow a user the capability of designing alternative resource allocation strategies. These features are in addition to the standard subprogram replacement automatically available through the use of FORTRAN IV.

O O O B B I O O O B O O O O B O O O O O O O O O O O O O B O O O B I O O O O O B B O O O O O O O O O O O O O O O O O O O B B I O B O O O O O O O O B B O O O O B O O O O O O O O O O O O O O O O B O O O O B O O O O O O O O O O O O O O O O B I B O O O O O O O B O O O O O O O O O O B O O O O O B I B O O O O O O O O O O O O O O B O O O

use
strategies
resource allocation
simulation
input
event
workload
language
parametric
operating system
modular
hardware
model
paper
user
component

activation systems association computation module standardization process feature


Low power dynamic logic circuit design using a pseudo dynamic buffer In this paper, we propose a pseudo dynamic buffer (PDB) for footed domino logic circuit implementation. Using the proposed PDB structure, the output pulse during the precharge process is prevented from propagating to the output stage, as is the case in conventional case. As a result, up to half of the power is saved compared to a conventional domino gate, while improving the sampling window of the dynamic gate. This PDB structure is applicable not only for Pull-down network (N-type) dynamic logic, but also for Pull-up networks (P-type). Simulation results illustrate improved performance using the proposed scheme compared to the conventional dynamic logic for different loading conditions, clock frequencies and logic functions. In addition, our proposed design reduces the clock loading from conventional three to two transistors. As a result, the proposed scheme significantly saves power due to lower load capacitance on the clock bus. Test structures are fabricated in 0.35 ? m CMOS technology. Measurement results validate the proposed concept and illustrate power saving as compared to conventional design.

O O B I O O O O B I I O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting In this paper, we explore the difference between preemption and activity splitting in the resource-constrained project scheduling problem (RCPSP) literature and identify a new set of RCPSPs that only allows non-preemptive activity splitting. Each activity can be processed in multiple modes and both renewable and non-renewable resources are considered. Renewable resources have time-varying resource constraints and vacations. Multi-mode RCPSP (MRCPSP) with non-preemptive activity splitting is shown to be a generalization of the RCPSP with calendarization. Activity ready times and due dates are considered to study the impact on project makespan. Computational experiments are conducted to compare optimal makespans under three different problem settings: RCPSPs without activity splitting (P1), RCPSPs with non-preemptive activity splitting (P2), and preemptive RCPSPs (P3). A precedence tree-based branch-and-bound algorithm is modified as an exact method to find optimal solutions. Resource constraints are included into the general time window rule and priority rule-based simple heuristics are proposed to search for good initial solutions to tighten bounding rules. Results indicate that there are significant makespan reductions possible when non-preemptive activity splitting or preemptions are allowed. The higher the range of time-varying renewable resource limits and the tighter the renewable resource limits are, the bigger the resulting makespan reduction can be.

O O O O O O O B I O O O O O O O O B O B I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

preemption
calendarization
activity splitting


ENHANCING STATIONARY ENTANGLEMENT OF TWO QUBITS OR QUTRITS BY COLLECTIVELY INTERACTING WITH A COMMON THERMAL RESERVOIR The stationary entanglement and Bell violation of two qubits collectively interacting with a common thermal reservoir is investigated, and the analytical relations among average thermal photon number of the reservoir, entanglement and Bell violation of two qubits are given in detail. The initial fraction of Bell singlet state determines whether the common thermal reservoir can enhance the entanglement of two qubits or not in this case. Moreover, the stationary maximally entangled mixed state can emerge in the collective decay of two qubits in a thermal reservoir at zero-temperature only if the fraction of Bell singlet state in the initial state is not smaller than 2/3. Furthermore, it is shown that the collective decay can induce the entanglement of two qutrits initially in the maximally mixed state, and induce distillable entanglement from bound entangled states.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O

stationary state
entanglement of qutrits


A study on the application of data mining to disadvantaged social classes in Taiwan's population census Data mining has been widely applied to different areas. For a country with a huge population and household census data, data mining is an ideal approach for analyzing this information. In Taiwan single-parent families, aborigines and the elderly have long been considered disadvantaged social classes, and their widening problems will have a tremendous impact and influence on society. This study aims to apply data mining techniques to investigate the demographic features of socially disadvantaged groups in Taiwan by using population and household data collected in the 2000 census to provide reference for social welfare decision makers in understanding these groups and forming policy. The demographic features, marital features and educational attainment of the heads of household in single-parent families were investigated. The demographic features, educational attainment and marital status of aborigines were analyzed. The marital features, educational attainment, care and life patterns of the elderly were studied. (C) 2007 Elsevier Ltd. All rights reserved.

O O O O O O B I O O O O O O O O B I O O O O O O O O O O O O O B I I I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

data mining
population and household census


Diffusion of mobile telephony: An empirical study in Taiwan Mobile telephony penetration is a major indicator of mobile telephony diffusion. Taiwan had a mobile telephony penetration of 108% in 2002, ranking first in the world. This study analyzes this accelerated diffusion in terms of growth model and determinants of the diffusion rate. To eliminate the inherent uncertainty associated with choosing the optimal growth model, this study compares the performance of three conventional models, namely Gompertz, Logistic and Bass, to identify the most appropriate model, and to distinguish the forces driving the diffusion rate. Empirical results indicate that the most appropriate model is the Logistic model. Network externalities, which this study shows to be the same as the imitation effect in the Bass model, explain the superiority of the Logistic model. Moreover, market competition, which markedly reduces service prices, is identified as a primary driver of the diffusion rate of mobile telephony in Taiwan. Economic conditions, technological innovation and number of operators are insignificant factors. Finally, mobile telephony is a substitute for fixed-line telephony in Taiwan.

O O B I O O O O O B I O O O O O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O

mobile communications
technology diffusion
diffusion forecasting
deregulation


A virtual network mapping algorithm based on integer programming The virtual network (VN) embedding/mapping problem is recognized as an essential question of network virtualization. The VN embedding problem is a major challenge in this field. Its target is to efficiently map the virtual nodes and virtual links onto the substrate network resources. Previous research focused on designing heuristic-based algorithms or attempting two-stage solutions by solving node mapping in the first stage and link mapping in the second stage. In this study, we propose a new VN embedding algorithm based on integer programming. We build a model of an augmented substrate graph, and formulate the VN embedding problem as an integer program with an objective function and some constraints. A factor of topology-awareness is added to the objective function. The VN embedding problem is solved in one stage. Simulation results show that our algorithm greatly enhances the acceptance ratio, and increases the revenue/cost (R/C) ratio and the revenue while decreasing the cost of the VN embedding problem.

O O O O O O O B I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

integer programming
network virtualization

virtual network embedding
topology-awareness


Grid-Flow: a Grid-enabled scientific workflow system with a Petri-net-based interface Advances in computer technologies have enabled scientists to explore research issues in their respective domains at scales greater and finer than ever before. The availability of efficient data collection and analysis tools presents researchers with vast opportunities to process heterogeneous data within a distributed environment. To support the opportunities enabled by massive computation, a suitable scientific workflow system is needed to help the users to manage data and programs, and to design reusable procedures of scientific experimental tasks. In this paper, the design and prototype implementation of a scientific workflow infrastructure, called Grid-Flow, is presented. Grid-Flow assists researchers in specifying scientific experiments using a Petri-net-based interface. The Grid-Flow infrastructure is designed as a Service Oriented Architecture with multi-layer component models. The contributions of Grid-Flow are as follows: (1) a new, lightweight, programmable Grid workflow language, Grid-Flow Description Language, is provided to describe the workflow process in a Grid environment; (2) a Petri-net-based user interface, based on the Generic Modeling Environment, is demonstrated to help the user design the workflow process with a Petri-net model; and (3) a program integration component of the Grid-Flow system is presented to integrate all possible programs into the system. Copyright (c) 2005 John Wiley & Sons, Ltd.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

workflow management system
grid computing
grid workflow system
petri-net model


Continuity properties and Alexandroff theorem in Vietoris topology In several previous papers. we introduced and studied various continuity properties in the set-valued case. Precisely, we established results concerning increasing/decreasing convergence, exhaustivity. order continuity and regularity in Hausdorff topology for closed-set-valued monotone set multifunctions on a real normed space. In this paper. taking as starting point of a previous work, we introduce and study from another point of view, corresponding continuity properties in Vietoris topology for more general monotone set multifunctions on a Hausdorff linear topological space. Thus, we obtain generalizations of some previous results, which in turn, generalize to the set-valued case, well known results from classical fuzzy (i.e., monotone) measure theory. An Alexandroff theorem in Vietoris topology and its converse are also established. (C) 2012 Elsevier B.V. All rights reserved.

B I O B I O B I O O O O O O O O O B I O O O O O O O O O O O O O O O B O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O

vietoris topology
hausdorff topology
regularity
continuity properties
alexandroff theorem


Error-detecting codes and fault-containing self-stabilization Self-stabilizing algorithms recover from all cases of transient failure, but the mechanism of self-stabilization may be costly for mild cases of transient failure. Error-detecting codes can be used to identify, with high probability, transient faults in data. This note investigates how error-detecting codes can enhance self-stabilization to deal efficiently with the common case of single-process transient faults. The main results are characterizations of self-stabilizing algorithms that can use error-detecting codes to recover from single-process transient faults in a single step. (C) 2000 Elsevier Science B.V. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fault tolerance
self-stabilization
fault containment
error-detecting codes


Adding the missing user to policy discourse: understanding US user telephone privacy concerns ? In telecommunication privacy policy discourses, there is a paucity of evidence regarding how lay people understand and deal with telephone privacy issues. This article aims to add the voice of the missing user to policy discourse and reports the results of a US study of residential users in the state of Ohio. We provide a descriptive analysis of users understandings of telephone privacy concerns; their strategies for protecting phone privacy; and their assessments of these strategies. Further, we posit that the goal of adding the missing user voice cannot be realised by conducting empirical research that is guided solely by traditional categories of users (e.g. users defined demographically). Drawing on Dervin's Sense-Making Methodology, we generated two sets of alternative categories of users through salience measures tapping orientations toward the telephone; and function measures tapping specific uses of the phone in life situations. We pitted these alternative categories against demographic categories in tests of their power to predict user perspectives and behaviours relating to phone privacy. Results of the descriptive analysis showed that experiences of privacy violations by phone were widespread and that residential users construct phone privacy violations in terms of immediate and visible impediments and constraints on their lives. The results of the predictive analysis showed that each of the predictor categories played a role in predicting user perspectives and behaviours. Demographic measures, for example, accounted for more variance in predicting whether users took action to protect phone privacy while function measures did so in predicting whether users saw these protective actions as hindering. We conclude that there is a gulf between privacy concerns as expressed by telecommunication policy experts and as expressed by residential phone users. Attempting to understand users based only on demographic characteristics alone provides a far too limited portrait of users and the experiential conditions of their phone use.

O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

privacy violation
telecom policy
end-users


Computation of time and space derivatives in a CQM-based BEM formulation This work proposes an approach for the numerical computation of time and space derivatives of the time-domain solution of scalar wave propagation problems by means of a boundary element method formulation. Here, this formulation employs the so-called convolution quadrature method. Non-homogeneous initial conditions are taken into account by means of a general procedure, known as initial condition pseudo-force procedure, which replaces the initial conditions by equivalent pseudo-forces. The boundary integral equation with initial conditions contribution is differentiated analytically and the quadrature weights of the standard formulation are transformed in order to compute time and space derivatives at interior points. Numerical examples are presented to show the efficiency of the implemented formulation.

O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I I O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O

space derivatives
boundary element method
convolution quadrature method


Aligning ontology-based development with service oriented systems We proposed an ontology-based development approach for service oriented system. We proposed a three layer abstraction of ontology alignment. We proposed a semantic integration life cycle for semantic Web services. We applied our approach in the building QoS ontology for service and cloud systems. We developed multi-agent and peer-to-peer based service system to align ontologies.

O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B

software development life cycle
agents
multi-agent systems
peer-to-peer systems


Uplink Power Control via Adaptive Hidden-Markov-Model-Based Pathloss Estimation Dynamic variations in channel behavior is considered in transmission power control design for cellular radio systems. It is well known that power control increases system capacity, improves Quality of Service (QoS), and reduces multiuser interference. In this paper, an adaptive power control design based on the identification of the underlying pathloss dynamics of the fading channel is presented. Formulating power control decisions based on the measured received power levels allows modeling the fading channel pathloss dynamics in terms of a Hidden Markov Model (HMM). Applying the online HMM identification algorithm enables accurate estimation of the real pathloss ensuring efficient performance of the suggested power control scheme.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O

adaptive power control
hidden markov model

cdma cellular networks
model identification


Developments and trends in the parallel solution of linear systems In this review paper, we consider some important developments and trends in algorithm design for the solution of linear systems concentrating on aspects that involve the exploitation of parallelism. We briefly discuss the solution of dense linear systems, before studying the solution of sparse equations by direct and iterative methods. We consider preconditioning techniques for iterative solvers and discuss some of the present research issues in this field.

O O O O O O O O B I O O O O O O O O O O O O O O O O O O B I O O O O O O O O B O O O O O O O B I O O O O O O O O O O B I O O B O O O O O O O O O O O O O O O

linear systems
parallelism
iterative methods
preconditioning

dense matrices
sparse matrices
tridiagonal systems
direct methods
krylov methods


Sparse Modeling of Textures This paper presents a generative model for textures that uses a local sparse description of the image content. This model enforces the sparsity of the expansion of local texture patches on adapted atomic elements. The analysis of a given texture within this framework performs the sparse coding of all the patches of the texture into the dictionary of atoms. Conversely, the synthesis of a new texture is performed by solving an optimization problem that seeks for a texture whose patches are sparse in the dictionary. This paper explores several strategies to choose this dictionary. A set of hand crafted dictionaries composed of edges, oscillations, lines or crossings elements allows to synthesize synthetic images with geometric features. Another option is to define the dictionary as the set of all the patches of an input exemplar. This leads to computer graphics methods for synthesis and shares some similarities with non-local means filtering. The last method we explore learns the dictionary by an optimization process that maximizes the sparsity of a set of exemplar patches. Applications of all these methods to texture synthesis, inpainting and classification shows the efficiency of the proposed texture model.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I B O O O O O O O O O O

image processing
sparse representation
learning dictionaries


Synthesis of short-term time-series of daily averaged surface pressure on Mars Simulation of the operation of various devices for future robotic or manned expeditions to Mars requires a detailed knowledge of the atmospheric pressure time variation. Martian pressure data records are not continuous and finding means of filling in the gaps is necessary. The short-term time-series of daily average pressure on the surface of Mars have specific sequential and distribution characteristics. Both features were studied here by using data from the Viking Lander Meteorology and Atmospheric Opacity Data Set Archive. As a first step, the surface pressure was separated into a slow-varying term (the average pressure) and a fast-varying term (the excess pressure). The average time variation of the daily pressure was fitted using a formula retaining the first eight harmonics of the annual cycle. In order to obey as much as possible the homoscedasticity criterion the analysis was performed separately for each of the four seasons of the Martian year. A number of intervals with continuous data were selected for both VL1 and VL2 and the first autocorrelation coefficients were evaluated. They were used to develop autoregressive (AR) models of various orders. The excess pressure time-series generated by AR models keep the sequential properties of the measured data quite well. Also, there is reasonable good agreement between the first statistical moments of the measured and synthetic excess pressure data.

O O O O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

data synthesis
autoregressive models
data reduction techniques


Second order symmetric duality in nondifferentiable multiobjective programming A pair of MondWeir type second order symmetric nondifferentiable multiobjective programs is formulated. Weak, strong and converse duality theorems are established under ?-pseudobonvexity assumptions. Special cases are discussed to show that this paper extends some work appeared in this area.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

nondifferentiable programming
multiobjective symmetric duality
?-pseudobonvexity
efficient solutions
properly efficient solutions


simulation of the effects of timing jitter in track-and-hold and sample-and-hold circuits In this paper, we analyze the effect of jitter in track and hold circuits. The output spectrum is obtained in terms of the system function of the track and hold. It is a fairly general model in which the effect of input as well as clock jitter can be included. The clock can have an arbitrary duty cycle, so that the circuit could also approximate a sample and hold. Using this model, it is possible to simulate the effects of jitter in a track and hold using a standard circuit simulator. Three cases are analyzed - long term jitter, correlated jitter with exponential autocorrelation and white noise jitter. These results are verified using Monte Carlo simulations.

O O O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O B O B O O O O O O B O O O O O O O O


Using CAD geometric variation approach machining complex workpiece by a 3-SPR parallel machine tool A novel CAD geometric variation approach is proposed for machining the complex workpiece, caving letter on a 3D free-form surface, and milling cam by a 3-SPR parallel machine tool. First, a simulation mechanism of the 3-SPR parallel manipulator is created, and a workspace of the moving platform is constructed by the 3-SPR simulation mechanism. Second, the tool path guiding plane with complex workpiece and the simulation mechanism of the 3-SPR parallel machine tool are combined to form the whole simulation mechanism. Third, the extension of the active legs and the position of the moving platform are solved automatically and visualized dynamically by using simulation mechanism. Finally, the formulae for solving displacement kinematics of the 3-SPR parallel machine tool are derived. The results of the simulation mechanism are verified by kinematic analytic results. The CAD geometric variation approach is straightforward without compiling any program.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

3-spr parallel machine tool
letter carving
computer simulation


text 2.0 We discuss the idea of text responsive to reading and argue that the combination of eye tracking, text and real time interaction offers various possibilities to en- hance the reading experience. We present a number of prototypes and applications facilitating the user's gaze in order to assist comprehension difficulties and show their benefit in a preliminary evaluation.

O O O O O O O O O O B O O O O O O B I O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O