wireless security patch management system Wireless access on college campuses facilitates the spread of computer viruses and worms due to laptops that do not have current software patches and/or antivirus protection connecting to the network. Wireless local area networks provide a luxury of mobility to clients so that they may roam about without the restriction of wires, room, and/or buildings. At the same time, wireless local area networks have given birth to a new breed of network weaknesses that are compounding and exploiting current local area network vulnerabilities. Today's college campuses present students and professors with a unique environment of network connectivity. Workstations and laptops have the ability to connect to the campus network either through wired or wireless access points. The popularity of wireless mobility has generated an influx of wireless clients on college campuses throughout the United States. However, the popularity has not been as eagerly received by network administrators. Because a great majority of these users lack the knowledge and/or experience to implement best practices such as installing the latest security patches and antivirus software protection or properly configuring firewalls, college campus networks are experiencing high levels of unwanted malicious activity. Network engineers have implemented quick fixes such as "Blacklists" that keep track of infected computers, denying access until properly patched and cleaned. However, this is a labor-intensive temporary solution that requires user involvement, not a fully functional system that automates all the necessary security updates and antivirus software installations as well as assuring proper firewall configuration. An enormous challenge is being faced to keep wireless clients updated with security patches, antivirus protection, and firewall configurations. Viruses and worms are released daily, escalating the problem of keeping wireless clients updated. In response, an automated wireless security patch management system can alleviate the aggravation and overhead associated with the wireless clients. In addition, a wireless security patch management system will also increase the networks information security structure. This paper focuses on a wireless security patch management/antivirus update system that seeks to remedy the problem presented by wireless clients that are not updated with current security patches, antivirus software, and weak or no firewall settings.

B B B 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 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 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 B 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 O O O 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 B O O O O O O O O O O O B O O O O O O O O B O O 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 O B B B O O O O O O O O O O O B O O O O B B B O O O O O O O O B O O O O O O B B B O B O O O O O O O O O B O O O O O O O B O O O O O O O O O

wireless configuration security update patch


Optimal fault-tolerant broadcasting in wireless mesh networks Wireless mesh networks (WMNs) is an emerging communication paradigm to enable resilient, cost-efficient and reliable services for the future-generation wireless networks. In this paper, we study the broadcasting (one-to-all communication) in WMNs with known topology, i.e. where for each primitive the schedule of transmissions is pre-computed based on full knowledge about the size and the topology of the network. We show that broadcasting can complete in D?+?O(log n) time units in the WMN with size n and diameter D. Moreover, we also propose an optimal O(D)-time deterministic energy efficient broadcasting scheduling, under which each node in the WMN is only allowed to transmit at most once. Furthermore, we explore the fault-tolerant broadcasting in the WMN. We show an O(n)-time deterministic broadcasting schedule with large number of link failures. This is an optimal schedule in the sense that there exists a network topology in which the broadcasting cannot complete in less than ?(n) units of time. Copyright 2009 John Wiley & Sons, Ltd.

O O B O B I I 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 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 O O 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 B 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


An illustration of Cox's non-nested testing procedure for logit and probit models Empirical and methodological issues arising when the Cox test statistic for non-nested models is used to test the probit vs. logit specifications are discussed. As an example, the models in Bardasi and Monfardini (European University Institute Working Paper ECO No. 97/9, 1997) for the occupational choice by Italian workers among the private, public and self-employed options is considered. Different versions of the test are compared. The bootstrap technique is then used to control for the actual properties of the test. The results indicate the probit to be the more adequate model, providing evidence against the independence of the irrelevant alternatives assumption imposed by the logit formulation.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

discrete choice models
non-nested testing
simulation-based inference


Locating landfills and transfer stations in alberta This paper investigates the locational patterns of facilities that deal with municipal solid waste. A mixed-integer linear programming problem is set up to optimize the locations of landfills and garbage transfer stations in the province of Alberta. The solutions are analyzed with respect to their sensitivity to changes in the metric and the number of facilities opened.

O B 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 O O O O O O B 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

municipal solid waste
landfills
transfer stations


understanding technology choices and values through social class This ethnographic study of 22 diverse families in the San Francisco Bay Area provides a holistic account of parents' attitudes about their children's use of technology. We found that parents from different socioeconomic classes have different values and practices around technology use, and that those values and practices reflect structural differences in their everyday lives. Calling attention to class differences in technology use challenges the prevailing practice in human-computer interaction of designing for those similar to oneself, which often privileges middle-class values and practices. By discussing the differences between these two groups and the advantages of researching both, this research highlights the benefits of explicitly engaging with socioeconomic status as a category of analysis in design.

O O O O B 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 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 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

socio-economic status
video games
mobile phones
computers
family
telephones
television
ethnography


characterizing the subjectivity of topics A document or web page in isolation may appear completely reasonable, but may represent a biased perspective on the topic being discussed. Given the topic of a document, we propose new metrics provocativeness and balance that suggest when the topic could be controversial. We explore the use of these metrics to characterize the subjectivity of the topics in the TREC Blog Track.

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

opinion classification
subjectivity/polarity detection
sentiment analysis


Variable-constraint classification and quantification of radiology reports under the ACR Index We apply hierarchical supervised learning technology to the problem of assigning codes from the well-known ACR Index (a double-hierarchy classification scheme from the American College of Radiology) to radiology reports. This task is actually two classification tasks in one: the former uses a first hierarchy of codes describing anatomic locations, and the latter uses a second hierarchy of codes describing pathologies, where the two hierarchies are closely intertwined. A requirement of each such classification task is that the document be placed in exactly one node of depth ?2 of the anatomic location hierarchy and in exactly one node of depth ?3 of the pathology hierarchy; this makes our task a (fairly uncommon) variable-constraint classification task, since at the first levels of the hierarchy (2 for anatomic location, 3 for pathology) we need to use a standard exactly 1 class per document constraint, while at the lower levels we need to use an at most 1 class per document constraint. We have used a large dataset of about 250,000 radiology reports written in Italian and an adaptation of our TreeBoost.MH learning algorithm to variable-constraint classification. Notwithstanding the extreme difficulty of the task (given by the fact that the two codes had to be picked out of a pool of 719 codes for anatomic location and 5269 codes for pathology, respectively) our system displayed good accuracy, indicating that it may represent a viable tool for semi-automated classification of medical reports. We also analyzed the quantification accuracy of our system (i.e., the ability of the system at correctly estimating the frequency of the individual codes), a concern of special interest in epidemiology; the results show that our system has excellent quantification accuracy, making this system a valuable tool for the fully automated coding of radiology reports for epidemiological purposes.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

automatic classification
text classification


Issues in using model checkers for test case generation ? The use of model checkers for automated software testing has received some attention in the literature: It is convenient because it allows fully automated generation of test suites for many different test objectives. On the other hand, model checkers were not originally meant to be used this way but for formal verification, so using model checkers for testing is sometimes perceived as a hack. Indeed, several drawbacks result from the use of model checkers for test case generation. If model checkers were designed or adapted to take into account the needs that result from the application to software testing, this could lead to significant improvements with regard to test suite quality and performance. In this paper we identify the drawbacks of current model checkers when used for testing. We illustrate techniques to overcome these problems, and show how they could be integrated into the model checking process. In essence, the described techniques can be seen as a general road map to turn model checkers into general purpose testing tools.

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 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

automated test case generation
testing with model checkers
minimization


Tsallis q-exponential describes the distribution of scientific citationsa new characterization of the impact In this work we have studied the research activity for countries of Europe, Latin America and Africa for all sciences between 1945 and November 2008. All the data are captured from the Web of Science database during this period. The analysis of the experimental data shows that, within a nonextensive thermostatistical formalism, the Tsallis q-exponential distribution N(c) satisfactorily describes Institute of Scientific Information citations. The data which are examined in the present survey can be fitted successfully as a first approach by applying a single curve (namely, \(N(c) \propto 1/[1+(q-1)\, c/T]^{\frac{1} {q-1}}\) with q ? 4/3 for all the available citations c, T being an effective temperature. The present analysis ultimately suggests that the phenomenon might essentially be one and the same along the entire range of the citation number. Finally, this manuscript provides a new ranking index, via the effective temperature T, for the impact level of the research activity in these countries, taking into account the number of the publications and their citations.

O O O O O O O O O O O O O O O O O O O O O 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O 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


Improving routing distance for geographic multicast with Fermat points in mobile ad hoc networks In mobile ad hoc networks (MANETs), each node has the ability to transmit, receive, and route packets, and also moves through the field either randomly or in accordance with a pre-planned route. For enhancing the performance of MANETs, reducing the routing distance is a primary concern. For either ad hoc or static networks, the problem of minimizing the overall routing distance during multicasting is NP-complete. Therefore, it is difficult to determine an optimal solution. This paper presents an efficient geographic multicast protocol, designated as GMFP, based on the use of Fermat points. The objective of GMFP is to improve the overall routing distance for multicast tasks. Through a series of simulations, it is shown that GMFP outperforms the conventional Position-Based Multicast protocol and FERMA protocol in terms of the total routing distance, the packet transmission delay, the packet delivery ratio, and the node energy consumption. The performance improvements provided by GMFP are apparent as the scale of the network topology increases.

O B I O O B O O O O B I I I O B I 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 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 B O O O 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 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

multicast
mobile ad hoc networks
routing distance


Maximum Bayesian entropy method for determining ordered weighted averaging operator weights Determination of the ordered weighted averaging (OWA) operators is an important issue in the theory of the OWA operator weights. In this paper, the main existing models for determining the OWA operator weights are outlined and the concept of the Bayesian entropy is introduced. Based upon the Bayesian entropy the maximum Bayesian entropy approach for obtaining the OWA operator weights is proposed. In this model it is assumed, according to previous experiences or from theoretical considerations that a decision maker may have reasons to consider a given prior OWA vector. Finally the new model is solved according to the prior OWA vector with specific level of orness comparing the results with other methods. The results demonstrate the efficiency of our model in generating the OWA operator weights. An applied example is also presented to illustrate the applications of the proposed model. (C) 2012 Elsevier Ltd. All rights reserved.

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 B I 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 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 B I O O O O O O O O O O O O O O O O O O O O O O

owa operator
operator weights
bayesian entropy


An adaptive multimedia streaming dissemination system for vehicular networks This work tackles several challenges for video streaming dissemination system in vehicular networks. The proposed system computes prefetched stream data for each user based on current situation of the users. A bandwidth reservation mechanism for premium user was proposed to ensure the QoS of stream data premium user received. A fuzzy logic inference system is utilized to determine if a BS or a vehicle can be chosen to transfer stream data.

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 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

vehicular networks
fuzzy logic
bandwidth reservation

adaptable streaming service dissemination


Inflammation-mediated obesity and insulin resistance as targets for nutraceuticals Obesity-induced inflammation plays an important role in the development of insulin resistance, type 2 diabetes (T2D), and metabolic dysfunctions. Chronic activation of proinflammatory pathways within insulin target cells can lead to obesity-related insulin resistance. The inflammatory mediators consist of immune cells, cytokines, adipokines, and inflammatory signaling molecules. Targeting obesity-associated inflammation has been shown to protect experimental animals and human subjects from obesity-induced insulin resistance. Modulation of the inflammatory responses associated with obesity may help prevent or improve obesity-induced metabolic dysfunctions. In this review, we introduce the beneficial effects of nutraceuticals for targeting inflammation in the treatment of obesity-induced insulin resistance and metabolic dysfunctions.

O B 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 O O 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 B O O O O O O O O O O O O O O O O O B O O B O O O O O O O O O O


Max-flow segmentation of the left ventricle by recovering subject-specific distributions via a bound of the Bhattacharyya measure This study investigates fast detection of the left ventricle (LV) endo- and epicardium boundaries in a cardiac magnetic resonance (MR) sequence following the optimization of two original discrete cost functions, each containing global intensity and geometry constraints based on the Bhattacharyya similarity. The cost functions and the corresponding max-flow optimization built upon an original bound of the Bhattacharyya measure yield competitive results in nearly real-time. Within each frame, the algorithm seeks the LV cavity and myocardium regions consistent with subject-specific model distributions learned from the first frame in the sequence. Based on global rather than pixel-wise information, the proposed formulation relaxes the need of a large training set and optimization with respect to geometric transformations. Different from related active contour methods, it does not require a large number of iterative updates of the segmentation and the corresponding computationally onerous kernel density estimates (KDEs). The algorithm requires very few iterations and KDEs to converge. Furthermore, the proposed bound can be used for several other applications and, therefore, can lead to segmentation algorithms which share the flexibility of active contours and computational advantages of max-flow optimization. Quantitative evaluations over 2280 images acquired from 20 subjects demonstrated that the results correlate well with independent manual segmentations by an expert. Moreover, comparisons with a related recent active contour method showed that the proposed framework brings significant improvements in regard to accuracy and computational efficiency.

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 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

cardiac magnetic resonance images (cardiac mri)


Oscillabolastic model, a new model for oscillatory dynamics, applied to the analysis of Hes1 gene expression and Ehrlich ascites tumor growth This paper introduces a new dynamical model, called the oscillabolastic model, to analyze the dynamical behavior of biomedical data when one observes oscillatory behavior. The proposed oscillabolastic model is sufficiently flexible to represent various types of oscillatory behavior. The oscillabolastic model is applied to two sets of data. The first data set deals with the oscillabolastic modeling of Ehrlich ascites tumor cells and the second one is the oscillabolastic modeling of the mean signal intensity of Hes1 gene expression in response to serum stimulation. A generalized oscillabolastic model is also suggested to accommodate cases in which predictor variables other than time are also involved.

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 B I I I 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

hes1 gene expression
ehrlich ascites tumor cells


Different Effects of Adenosine A1 Agonist Ribavirin on Amphetamine-Induced Total Locomotor and Stereotypic Activities in Rats Abstract: Pretreatment with a single dose of ribavirin (10, 20, and 30 mg/kg b.w. i.p.) decreased amphetamine (1.5 mg/kg b.w. i.p.)-induced total locomotor activity (distance traveled) compared to amphetamine alone, but the most significant effect was observed with 30 mg/kg dose. In contrast, total stereotypic activities (such as sniffing, self-grooming, licking, and head weaving) of these animals were unchanged. These findings demonstrate the ability of ribavirin to modulate in a different way central regulation of locomotor and stereotypic activities that in the future could have a practical application in target therapy of some movement disorders.

O O O O O O B O O O O O O O O B O O O O O O O B 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 O O 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


Applying input variables selection technique on input weighted support vector machine modeling for BOF endpoint prediction Basic oxygen furnace (BOF) steelmaking is a complex process and dynamic model is very important for endpoint control. It is usually difficult to build a precise BOF endpoint dynamic model because many input variables affect the endpoint carbon content and temperature. For this problem, two effective variables selection steps: mechanism analysis and mutual information calculation are proposed to choose appropriate input variables according to a variable selection algorithm. Then, the selected inputs are weighted on the basis of mutual information values. Finally, two input weighted support vector machine BOF endpoint dynamic models are constructed to predict endpoint carbon content and temperature. Results show that the variable selection for BOF endpoint prediction model is essential and effective. The complexity and precise of two endpoint prediction models are improved.

O O B I O O O O B I I 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 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 B I 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

basic oxygen furnace
mutual information
support vector machine
variables selection


Probabilistic default reasoning with conditional constraints We present an approach to reasoning from statistical and subjective knowledge, which is based on a combination of probabilistic reasoning from conditional constraints with approaches to default reasoning from conditional knowledge bases. More precisely, we introduce the notions of z-, lexicographic, and conditional entailment for conditional constraints, which are probabilistic generalizations of Pearl's entailment in system Z, Lehmann's lexicographic entailment, and Geffner's conditional entailment, respectively. We show that the new formalisms have nice properties. In particular, they show a similar behavior as reference-class reasoning in a number of uncontroversial examples. The new formalisms, however, also avoid many drawbacks of reference-class reasoning. More precisely, they can handle complex scenarios and even purely probabilistic subjective knowledge as input. Moreover, conclusions are drawn in a global way from all the available knowledge as a whole. We then show that the new formalisms also have nice general nonmonotonic properties. In detail, the new notions of z-, lexicographic, and conditional entailment have similar properties as their classical counterparts. In particular, they all satisfy the rationality postulates proposed by Kraus, Lehmann, and Magidor, and they have some general irrelevance and direct inference properties. Moreover, the new notions of z- and lexicographic entailment satisfy the property of rational monotonicity. Furthermore, the new notions of z-, lexicographic, and conditional entailment are proper generalizations of both their classical counterparts and the classical notion of logical entailment for conditional constraints. Finally, we provide algorithms for reasoning under the new formalisms, and we analyze its computational complexity.

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 B I O O O O O O O O O O O B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 O O O O O O O O O O O O O O O O O O O O O O O O

probabilistic default reasoning
system z
lexicographic entailment
conditional entailment


SPoRE: a mathematical model to predict double strand breaks and axis protein sites in meiosis Meiotic recombination between homologous chromosomes provides natural combinations of genetic variations and is a main driving force of evolution. It is initiated via programmed DNA double-strand breaks (DSB) and involves a specific axial chromosomal structure. So far, recombination regions have been mainly determined by experiments, both expensive and time-consuming.

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 B O O O O O O O O O O O

3d chromosomal structure
genome
gene
modeling
intergenic region
saccharomyces cerevisiae


An area-saving decoder structure for ROMs Read-only memories (ROMs) are widely used in both digital communication systems and daily consumer electronics. The major functions of ROMs are storage of data, programs, firmwares, etc. In this paper, a three-dimensional decoding structure for ROMs is proposed. The number of address decoding stages is drastically shortened. Hence, the delay is reduced, as well as the power consumption and area. The analysis of overall transistor count and delay is thoroughly derived. A real 256 x 8 ROM possessing the proposed decoder is physically fabricated by 0.5-mum two-poly two-metal (2P2M) CMOS technology.

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

area saving
natural encoding
p plus implant
ready-only memory (rom) decoder
three-dimensional decoding


I-binomial scrambling of digital nets and sequences The computational complexity of the integration problem in terms of the expected error has recently been an important topic in Information-Based Complexity. In this setting, we assume some sample space of integration rules from which we randomly choose one. The most popular sample space is based on Owen's random scrambling scheme whose theoretical advantage is the fast convergence rate for certain smooth functions. This paper considers a reduction of randomness required for Owen's random scrambling by using the notion of i-binomial property. We first establish a set of necessary and sufficient conditions for digital (0,s)-sequences to have the i-binomial property. Then based on these conditions, the left and right i-binomial scramblings are defined. We show that Owen's key lemma (Lemma 4, SIAM J. Numer. Anal. 34 (1997) 1884) remains valid with the left i-binomial scrambling, and thereby conclude that all the results on the expected errors of the integration problem so far obtained with Owen's scrambling also hold with the left i-binomial scrambling. (C) 2003 Elsevier Science (USA). All rights reserved.

O O O B I 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

low-discrepancy sequences
randomized quasi-monte carlo methods


Technological information infrastructure for product lifecycle engineering For sustainable development, it is requisite not only to assess multi-dimensional items such as environmental impacts, process safety, product safety, and so on, required from human society, environment, and markets, but also to feedback assessment results to product and process design/development. Through the investigation about requirements for manufactures at each stage in product lifecycle, it becomes clear that PDCA (plan-do-check-action) cycle is necessary to take actions properly from viewpoints of ecosystems, business systems, and society. We clarify required functions of supporting system of PDCA cycle, and then propose material supply chain models of hierarchy structure composed of unit process models. Based on proposed system and models, evaluations of PET bottle recycle system and greenhouse sheet recycle system are implemented as trials. Furthermore, we show the directions of future scope. (C) 2000 Elsevier Science Ltd. All rights reserved.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 infrastructure
environmental impacts


recognizing join points from their context through graph grammars Aspect-oriented software development has been proposed with the intent of better modularizing object-oriented programs by confining crosscutting concerns in aspects. Unfortunately, the aspects do not completely keep their promises. Most of the current approaches revealed to be tightly coupled with the base-program's code compromising the modularity. Moreover, the feasible modularization has a coarse-grain since the aspects can only be woven at the public interface level but not on a generic statement. We have designed the Blueprint framework to overcome these limits. The join points are located through the description of the context where they could be found. This work is about the framework realization and the role that graph grammars play in locating the join points in the base-program from the context description.

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 B I O O O O O O O O O O O O O


A method for counting people attending large public events The algorithm for people counting in crowded scenes, based on the idea of virtual gate which uses optical flow method is presented. The concept and practical application of the developed algorithm under real conditions is depicted. The aim of the work is to estimate the number of people passing through entrances of a large sport hall. The most challenging problem was the unpredicted behavior of people while entering the building. The examined flow of people fluctuated between individual persons and dense crowd. A series of experiments during sport and entertainment events was made. The results of the experiments show a high efficiency of the elaborated algorithm.

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 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


Designing evolvable systems in a framework of robust, resilient and sustainable engineering analysis Evolvability is a concept normally associated with biology or ecology, but recent work on control of interdependent critical infrastructures reveals that network informatics systems can be designed to enable artificial, human systems to evolve. To explicate this finding, we draw on an analogy between disruptive behavior and stable variation in the history of science and the adaptive patterns of robustness and resilience in engineered systems. We present a definition of an evolvable system in the context of a model of robust, resilient and sustainable systems. Our review of this context and standard definitions indicates that many analysts in engineering (as well as in biology and ecology) do not differentiate Resilience from Robustness. Neither do they differentiate overall dependable system adaptability from a multi-phase process that includes graceful degradation and time-constrained recovery, restabilization, and prevention of catastrophic failure. We analyze how systemic Robustness, Resilience, and Sustainability are related to Evolvability. Our analysis emphasizes the importance of Resilience as an adaptive capability that integrates Sustainability and Robustness to achieve Evolvability. This conceptual framework is used to discuss nine engineering principles that should frame systems thinking about developing evolvable systems. These principles are derived from Kevin Kellys book: Out of Control, which describes living and artificial self-sustaining systems. Kellys last chapter, The Nine Laws of God, distills nine principles that govern all life-like systems. We discuss how these principles could be applied to engineering evolvability in artificial systems. This discussion is motivated by a wide range of practical problems in engineered artificial systems. Our goal is to analyze a few examples of system designs across engineering disciplines to explicate a common framework for designing and testing artificial systems. This framework highlights managing increasing complexity, intentional evolution, and resistance to disruptive events. From this perspective, we envision a more imaginative and time-sensitive appreciation of the evolution and operation of reliable artificial systems. We conclude with a short discussion of two hypothetical examples of engineering evolvable systems in network-centric communications using Error Resilient Data Fusion (ERDF) and cognitive radio.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 O O O O O O O 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 B I

error resilient data fusion (erdf)
electrical grids
reflexive behaviors
system dynamics


Comment on "A direct approach with computerized symbolic computation for finding a series of traveling waves to nonlinear equations" by Engui Fan and H.H. Dai [Comput. Phys. Commun. 153 (2003) 17] Fan and Dai [Comput. Phys. Commun. 153 (2003) 17] have found a series of traveling wave solutions for nonlinear equations by applying a direct approach with computerized symbolic computations. They have claimed that the proposed method, in comparison with most existing symbolic computation methods such as a tanh method and Jacobi function method, not only give new and more general solutions, but also provides a guideline to classify various types of the solution according to some parameters. We show that the claims by Fan and Dai are wrong since some of the solutions do not satisfy the differential equation that they have adopted for the algebraic method. (C) 2004 Published by Elsevier B.V.

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

algebraic method with computerized symbolic computation


The management of electronics engineering design teams: linking tactics to changing conditions This paper reports on a multi-method study of design team management in a leading UK electronics company, focusing on how project leaders support collaboration between design engineers, the management issues they confront when working with a design team, and the influence these issues have on the team's perceptions and design process. The first part of the study examines the perceptions of project leaders as to the way in which they manage design projects. The second part of the study examines the experiences of design engineers over the 33-week duration of a complete project phase. This provides a bottom-up, engineers' view of the range of issues described by project leaders in the first part of the study. Analysis of these findings from both engineering and psychological perspectives points to design coordination and team integration as two prominent and recurrent management dilemmas, and demonstrates that successful team management requires project leaders continuously to steer an acceptable path through these dilemmas. We suggest that these problems are most successfully addressed by the adoption of a flexible, dynamic approach to team coordination in which moment-to-moment demands are met by appropriate management responses.

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

teamwork
design management
contingency theory


CVThresh: R package for level-dependent cross-validation thresholding The core of the wavelet approach to nonparametric regression is thresholding of wavelet coefficients. This paper reviews a cross-validation method for the selection of the thresholding value in wavelet shrinkage of Oh, Kim, and Lee (2006), and introduces the R package CVThresh implementing details of the calculations for the procedures. This procedure is implemented by coupling a conventional cross-validation with a fast imputation method, so that it overcomes a limitation of data length, a power of 2. It can be easily applied to the classical leave-one-out cross-validation and K-fold cross-validation. Since the procedure is computationally fast, a level-dependent cross-validation can be developed for wavelet shrinkage of data with various sparseness according to levels.

O B 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 B 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 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 B O O O O O O O O


acquiring ontological knowledge from query logs We present a method for acquiring ontological knowledge using search query logs. We first use query logs to identify important contexts associated with terms belonging to a semantic category; we then use these contexts to harvest new words belonging to this category. Our evaluation on selected categories indicates that the method works very well to help harvesting terms, achieving 85\% to 95\% accuracy in categorizing newly acquired terms.

O O O O B I O O O O O O O O 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

knowledge acquisition
named entity
ontology


SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications This paper presents the surrogate model based algorithm SO-I for solving purely integer optimization problems that have computationally expensive black-box objective functions and that may have computationally expensive constraints. The algorithm was developed for solving global optimization problems, meaning that the relaxed optimization problems have many local optima. However, the method is also shown to perform well on many local optimization problems, and problems with linear objective functions. The performance of SO-I, a genetic algorithm, Nonsmooth Optimization by Mesh Adaptive Direct Search (NOMAD), SO-MI (Mller et al. in Comput Oper Res 40(5):13831400, 2013), variable neighborhood search, and a version of SO-I that only uses a local search has been compared on 17 test problems from the literature, and on eight realizations of two application problems. One application problem relates to hydropower generation, and the other one to throughput maximization. The numerical results show that SO-I finds good solutions most efficiently. Moreover, as opposed to SO-MI, SO-I is able to find feasible points by employing a first optimization phase that aims at minimizing a constraint violation function. A feasible user-supplied point is not necessary.

O O B I O O O O O O O O B I O O O O O B I O O O O O O B I O O O B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 optimization
computationally expensive
surrogate model
global optimization

derivative-free
response surface
linear and nonlinear
nonconvex
radial basis functions
multimodal


Fuzzy-rough attribute reduction with application to web categorization Due to the explosive growth of electronically stored information, automatic methods must be developed to aid users in maintaining and using this abundance of information effectively. In particular, the sheer volume of redundancy present must be dealt with, leaving only the information-rich data to be processed. This paper presents a novel approach, based on an integrated use of fuzzy and rough set theories, to greatly reduce this data redundancy. Formal concepts of fuzzy-rough attribute reduction are introduced and illustrated with a simple example. The work is applied to the problem of web categorization, considerably reducing dimensionality with minimal loss of information. Experimental results show that fuzzy-rough reduction is more powerful than the conventional rough set-based approach. Classifiers that use a lower dimensional set of attributes which are retained by fuzzy-rough reduction outperform those that employ more attributes returned by the existing crisp rough reduction method. (C) 2003 Elsevier B.V. All rights reserved.

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 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 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

attribute reduction
web categorization
data redundancy


A Boltzmann machine with non-rejective move It have been one open and significant topic for real-time applications to enhance the processing-speed of Boltzmann machines for long time. One effective way of solution of this problem is the augmentation of probability of neurons' state move. In this paper, a novel method, called a rejection-less method, was proposed and introduced into the Boltzmann machines for this augmentation. This method has a feature of independence on the ratio of neurons' state move. The efficiency of this method for speed-up was confirmed with the experiments of TSP and graph problem.

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

neurons' state move
rejection of state move
simulated annealing
movement probability


Departure from linear mechanical behaviour of a helical spring We model small deviations from linear mechanical behaviour of a loaded vertically suspended helical spring. A Taylor expansion of the elasticity equations governing the axial extension of the spring is used to determine the relative magnitudes of linear and (quadratic and cubic) nonlinear terms in the force-extension relationship. This relationship is the basis for the derivation of a model for the static extension of a loaded spring, and a wave equation that models small amplitude oscillation. The models account for the natural decline in pitch angle down a suspended spring, and provide accurate fits to measurements of static extension and periods of oscillation that are not adequately represented by equations based on Hooke's law. The static and dynamic data yield consistent estimates of the spring rate. (C) 2010 Elsevier Ltd. 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 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

spring extension
spring oscillation
nonlinear mechanics
nonlinear wave equation


Lagrangian methods for the tensor-diffusivity subgrid model A subgrid-scale model based on a truncated exact series expansion for Gaussian filtered products is considered for the incompressible scalar advection-diffusion equation. This model can be interpreted as a tensor diffusivity term proportional to the rate-of-strain tensor of the large-scale filtered velocity field. To control negative diffusion in the stretching directions, a Lagrangian method is used. The scalar field is represented in terms of a collection of anisotropic or axisymmetric Gaussian particles. An expansion in Hermite polynomials leads to equations of motion for particle velocity and shape based on a weighted average. A new accurate remeshing method, taking advantage of the properties of the subgrid model, is proposed and tested. A stagnation flow is used to demonstrate several theoretical and numerical aspects of the model. Better agreement with filtered DNS data is obtained than with the Smagorinsky subgrid model for a 2D time-dependent sinusoidal flow, which yields chaotic advection. The use of anisotropic particles leads to slightly more accurate results than the use of axisymmetric particles. Computational efficiency, however, makes the latter therefore the preferred choice. (C) 2001 Academic Press.

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

computational fluid dynamics
scalar transport
large eddy simulation
lagrangian particle method
tensor-diffusivity subgrid model


A reactive state-space model for prediction of urban air pollution The generic reaction set (GRS) model offers a convenient framework for studying photochemical smog production. Its highly condensed seven equations are deduced from the principal reactions that produce photochemical smog (such as photolysis of reactive organic species, oxidation of NO to NO2, photolysis of NO2, etc.), and have been validated with the CSIRO outdoor smog chamber data. The performance of the model has been found comparable to more detailed photochemical mechanisms such as the CBM-IV. This paper expands the GRS model to include spatial advection and diffusion in the airshed. Via an appropriate numerical scheme, this extended dynamic model is transformed into the state space form, from which interpolation and prediction can be performed using the Kalman algorithm. The model is implemented on a simple grid of seven stations in the Sydney monitoring network. One-step ahead forecasts are derived for observed as well as unobserved locations. Comparison with observed data indicate that the model performs quite well, in particular, it traces the ozone episodes accurately.

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


Statistics-based outlier detection for wireless sensor networks Wireless sensor network (WSN) applications require efficient, accurate and timely data analysis in order to facilitate (near) real-time critical decision-making and situation awareness. Accurate analysis and decision-making relies on the quality of WSN data as well as on the additional information and context. Raw observations collected from sensor nodes, however, may have low data quality and reliability due to limited WSN resources and harsh deployment environments. This article addresses the quality of WSN data focusing on outlier detection. These are defined as observations that do not conform to the expected behaviour of the data. The developed methodology is based on time-series analysis and geostatistics. Experiments with a real data set from the Swiss Alps showed that the developed methodology accurately detected outliers in WSN data taking advantage of their spatial and temporal correlations. It is concluded that the incorporation of tools for outlier detection in WSNs can be based on current statistical methodology. This provides a usable and important tool in a novel scientific field.

O B 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 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 O O O O O O O O O O O O O O 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

outlier detection
wireless sensor networks
geostatistics

spatial correlation
temporal correlation
time-series analysis


Water Surface Modeling from a Single Viewpoint Video We introduce a video-based approach for producing water surface models. Recent advances in this field output high-quality results but require dedicated capturing devices and only work in limited conditions. In contrast, our method achieves a good tradeoff between the visual quality and the production cost: It automatically produces a visually plausible animation using a single viewpoint video as the input. Our approach is based on two discoveries: first, shape from shading (SFS) is adequate to capture the appearance and dynamic behavior of the example water; second, shallow water model can be used to estimate a velocity field that produces complex surface dynamics. We will provide qualitative evaluation of our method and demonstrate its good performance across a wide range of scenes.

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


Decoupled Linear Estimation of Affine Geometric Deformations and Nonlinear Intensity Transformations of Images We consider the problem of registering two observations on an arbitrary object, where the two are related by a geometric affine transformation of their coordinate systems, and by a nonlinear mapping of their intensities. More generally, the framework is that of jointly estimating the geometric and radiometric deformations relating two observations on the same object. We show that the original high-dimensional, nonlinear, and nonconvex search problem of simultaneously recovering the geometric and radiometric deformations can be represented by an equivalent sequence of two linear systems. A solution of this sequence yields an exact, explicit, and efficient solution to the joint estimation problem.

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

affine transformations
image registration
parameter estimation
domain registration
nonlinear range registration


Efficient Bit-Parallel GF(2(m)) Multiplier for a Large Class of Irreducible Pentanomials This work studies efficient bit-parallel multiplication in GF(2(m)) for irreducible pentanomials, based on the so-called Shifted Polynomial Bases (SPBs). We derive a closed expression of the reduced SPB product for a class of polynomials x(m) + x(ks) + x(ks-1) + ... + x(k1) + 1, with k(s) - k(1) <= m+1/2. Then, we apply the above formulation to the case of pentanomials. The resulting multiplier outperforms, or is as efficient as the best proposals in the technical literature, but it is suitable for a much larger class of pentanomials than those studied so far. Unlike previous works, this property enables the choice of pentanomials optimizing different field operations (for example, inversion), yet preserving an optimal implementation of field multiplication, as discussed and quantitatively proved in the last part of the paper.

O O O O O O O O O B I O O O O O O O O O B I 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

shifted polynomial bases
irreducible pentanomials


practical experiences from signal probability simulation of digital designs Propagated transitions, represented by probability functions, are very useful for digital design verification of race conditions. The existing simulation system DIGSIM already has features implemented to handle these probabilities. This paper gives some application examples to illustrate the technique. The system has been transfered from UNIVAC 1108 to a DEC-10, and that experience is described. Four years' use of the algorithms has shown good agreement between theory and practice.

B O O O B B O O O O O O O B O O O O O O B B O O O O O B O O O O O O O O O O O B O O O B O 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 B O O

use examples simulation design verification theory probability experience paper practical

digitize
applications
systems
signaling
transit
race condition
algorithm
feature


A hybrid feature selection method for DNA microarray data Gene expression profiles, which represent the state of a cell at a molecular level, have great potential as a medical diagnosis tool. In cancer classification, available training data sets are generally of a fairly small sample size compared to the number of genes involved. Along with training data limitations, this constitutes a challenge to certain classification methods. Feature (gene) selection can be used to successfully extract those genes that directly influence classification accuracy and to eliminate genes which have no influence on it. This significantly improves calculation performance and classification accuracy. In this paper, correlation-based feature selection (CFS) and the Taguchi-genetic algorithm (TGA) method were combined into a hybrid method, and the K-nearest neighbor (KNN) with the leave-one-out cross-validation (LOOCV) method served as a classifier for eleven classification profiles to calculate the classification accuracy. Experimental results show that the proposed method reduced redundant features effectively and achieved superior classification accuracy. The classification accuracy obtained by the proposed method was higher in ten out of the eleven gene expression data set test problems when compared to other classification methods from the literature.

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 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

taguchi-genetic algorithm
k-nearest neighbor
leave-one-out cross-validation


lifetime and coverage guarantees through distributed coordinate-free sensor activation Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distributed sensing of a target field. Each sensor is a small battery-operated device that can sense events of interest in its sensing range and can communicate with neighboring sensors. A sensor cover is a subset of the set of all sensors such that every point in the target field is in the interior of the sensing ranges of at least $k$ different sensors in the subset, where k is a given positive integer. The lifetime of the network is the time from the point the network starts operation until the set of all sensors with non-zero remaining energy does not constitute a sensor cover. An important goal in sensor networks is to design a schedule, that is, a sequence of sensor covers to activate in every time slot, so as to maximize the lifetime of the network. In this paper, we design a polynomial-time, distributed algorithm for maximizing the lifetime of the network and prove that its lifetime is at most a factor O(log n * log nB) lower than the maximum possible lifetime, where n is the number of sensors and B is an upper bound on the initial energy of each sensor. Our algorithm does not require knowledge of the locations of nodes or directional information, which is difficult to obtain in sensor networks. Each sensor only needs to know the distances between adjacent nodes in its transmission range and their sensing radii. In every slot, the algorithm first assigns a weight to each node that is exponential in the fraction of its initial energy that has been used up so far. Then, in a distributed manner, it finds a O(log n) approximate minimum weight sensor cover which it activates in the slot. Our simulations reveal that our algorithm substantially outperforms several existing lifetime maximization algorithms.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 algorithms
wireless sensor networks (wsns)
approximation algorithms
network lifetime
coordinate-free


G(1)-smooth branching surface construction from cross sections This paper proposes a framework for constructing G(1) surfaces that interpolate data points on parallel cross sections, consisting of simple disjoined and non-nested contours, the number of which may vary from plane to plane. Using appropriately estimated cross tangent vectors at the given points, we split the problem into a sequence of local Hermite problems, each of which can be one of the following three types: "one-to-one", "one-to-many" or "many-to-many ". The solution of the "one-to-many" branching problem, where one contour on the i-plane is to be connected to M contours on the (i+1)-plane, is based on combining skinning with trimming and hole filling. More specifically, we first construct a C-1 surrounding curve of all M contours on the (i+1)-plane. Next, we build the so-called surrounding surface that skins the i-plane contour with the (i+1)-plane surrounding curve, and trim suitably along parts of the surrounding curve that connect contours. The resulting multi-sided hole is covered with quadrilateral Gordon-Coons patches that possess G(1) continuity. For this purpose, we develop a hole-filling technique that employs shape-preserving guide curves and is able to preserve data symmetries. The "many-to-many" problem is handled by combining the "one-to-many" methodology with a zone-separation technique, that achieves splitting the "many-to-many" problem into two "one-to-many" problems. The methodology, implemented as a C++ Rhino v3.0 plug-in, is illustrated via two synthetic data sets and in the context of two realistic design examples. Finally, the paper concludes with discussing ongoing work towards improving the robustness and the applicability of the method regarding the surrounding curve construction step. (c) 2007 Elsevier Ltd. All rights reserved.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 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

design
cross sections
skinning
trimming
hole filling

reconstruction
branching surfaces
g(1) surfaces
shape-preserving interpolation


Scanning World Wide Web documents with the vector space model The vector space model used in Information Retrieval is combined with discriminant analysis to provide an automated WWW environment scanning system to detect signals of interest to an organization. The vector space model converts text-based information to numerical vectors that are then used in discriminant analysis. We illustrate the methodology using news articles pertaining to a predefined randomly selected set of stocks to test whether they provide predictive signals on whether the stock's return will increase or decrease relative to the market in the target period following the report or whether the stock's trading volume will increase or decrease.

O O O O O O O B I I O B I 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 B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

discriminant analysis
vector space model

multivariate statistics
environmental scanning
decision support systems
text classification


Adaptive global power optimization for Web servers This work investigates power and performance trade-offs for Web servers on a state-of-the-art, high-density, power-efficient SeaMicro SM15k cluster by AMD. We relied on the concept of virtual power states (VPSs), a combination of CPU utilization rate to the P/C power states available in modern processors, and on our global optimization algorithm called Slack Recovery, to deploy an adaptive global power management system in a production environment. The main contributions of this paper are twofold. First, it presents the Slack Recovery algorithm deployed on a real cluster, composed of 25 SeaMicro nodes. The algorithm finds a P-state and a utilization rate for each CPU node to minimize power under a minimum performance requirement. Second, it proposes a novel mechanism to control utilization rates in each server, a key aspect on our power/performance optimization system which enables the implementation of the VPS concept in practice. Experimental results show that our Slack Recovery-based system can reduce up to 6.7% of the power consumption when compared to policies usually deployed in SeaMicro production systems.

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 O O O O O O O O O O O O O O O O O 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 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

power management
power optimization
cluster


Self-recalibration of a structured light system via plane-based homography Self-recalibration of the relative pose in a vision system plays a very important role in many applications and much research has been conducted on this issue over the years. However, most existing methods require information of some points in general three-dimensional positions for the calibration, which is hard to be met in many practical applications. In this paper, we present a new method for the self-recalibration of a structured light system by a single image in the presence of a planar surface in the scene. Assuming that the intrinsic parameters of the camera and the projector are known from initial calibration, we show that their relative position and orientation can be determined automatically from four projection correspondences between an image and a projection plane. In this method, analytical solutions are obtained from second order equations with a single variable and the optimization process is very fast. Another advantage is the enhanced robustness in implementation via the use of over constrained systems. Computer simulations and real data experiments are carried out to validate our method.

O O O B I 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 O O O O 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

self-recalibration
plane-based homography
eigenvalue decomposition
cheirality constraint


issues on building t++, a tool for web application development with c++ As the demand for web applications grows, so does the demand for tools that support them. As a general rule, such tools extend general purpose programming languages, like Servlets/Jsp[2] does for Java [4], or define their own programming language, like PHP[3]. But there is no established engine for web applications written with C++. This work presents technical challenges that were faced when developing T++, an engine that supports web application development with C++.

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 B I I O O


sentence-level contextual opinion retrieval Existing opinion retrieval techniques do not provide context-dependent relevant results. Most of the approaches used by state-of-the-art techniques are based on frequency of query terms, such that all documents containing query terms are retrieved, regardless of contextual relevance to the intent of the human seeking the opinion. However, in a particular opinionated document, words could occur in different contexts, yet meet the frequency attached to a certain opinion threshold, thus explicitly creating a bias in overall opinion retrieved. In this paper we propose a sentence-level contextual model for opinion retrieval using grammatical tree derivations and approval voting mechanism. Model evaluation performed between our contextual model, BM25, and language model shows that the model can be effective for contextual opinion retrieval such as faceted opinion retrieval.

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 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

grammatical tree derivation
sentence level


Otter - The CADE-13 competition incarnations This article discusses the two incarnations of Otter entered in the CADE-13 Automated Theorem Proving System Competition. Also presented are some historical background, a summary of applications that have led to new results in mathematics and logic, and a general discussion of Otter.

B O O O B O O O O O O O O B 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 B

automated theorem proving
competition
otter

automated reasoning
equational deduction
paramodulation
resolution


Separating Ownership Topology and Encapsulation with Generic Universe Types Ownership is a powerful concept to structure the object store and to control aliasing and modifications of objects. This article presents an ownership type system for a Java-like programming language with generic types. Like our earlier Universe type system, Generic Universe Types structure the heap hierarchically. In contrast to earlier work, we separate the enforcement of an ownership topology from an encapsulation system. The topological system uses an existential modifier to express that no ownership information is available statically. On top of the topological system, we build an encapsulation system that enforces the owner-as-modifier discipline. This discipline does not restrict aliasing, but requires modifications of an object to be initiated by its owner. This allows owner objects to control state changes of owned objects-for instance, to maintain invariants. Separating the topological system from the encapsulation system allows for a cleaner formalization, separation of concerns, and simpler reuse of the individual systems in different contexts.

O O B O B O B 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 O O O O O O O B B I O O O O O O O O O O O O O O O O B 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 B O O O O O O O O O O O O O O O O O O O

encapsulation
generic
topology
universe types

languages
theory
verification
ownership types
owner-as-modifier


a novel approach to adaptive isolation in evolution strategies Hierarchically organised evolution strategies have been seen to be able to successfully adapt step lengths where mutative self-adaptation fails. However, the computational costs of such strategies are high due to the need to evolve several subpopulations in isolation, and their performance depends crucially on the length of the isolation periods. This paper proposes a novel approach to adapting the length of the isolation periods that is found to robustly generate good settings across a range of test functions.

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

reproductive isolation
step length adaptation


Quantification of Positive and Negative Attacker's Information Different techniques for expressing an amount of information on secrete data which can be obtained by a process observation are presented. They are based on information theory and they express certainty about sets of private actions which execution is guaranteed by a given observation and sets of actions which execution is excluded by a given observation. Moreover, the case when an intruder has same preliminary belief on secrete data is discussed. It is shown how the presented technique could be applied for such case. As regards working formalism, probabilistic process algebra is used for description of systems as well as attacker's belief.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B

probabilistic process algebras
information flow
opacity
security


Fast practical multi-pattern matching The multi-pattern matching problem consists in finding all occurrences of the patterns from a finite set X in a given text T of length n, We present a new and simple algorithm combining the ideas of the Aho-Corasick algorithm and the directed acyclic word graphs. The algorithm has time complexity which is linear in the worst case (it makes at most 2n symbol comparisons) and has good average-case time complexity assuming the shortest pattern is sufficiently long. Denote the length of the shortest pattern by m, and the total length of all patterns by M. Assume that M is polynomial with respect to m, the alphabet contains at least 2 symbols and the text (in which the pattern is to be found) is random, for each position each letter occurs independently with the same probability. Then the average number of comparisons is O((n/m) . log m), which matches the lower bound of the problem. For sufficiently large values of m the algorithm has a good behavior in practice. (C) 1999 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Fitness approximation for bot evolution in genetic programming Estimating the fitness value of individuals in an evolutionary algorithm in order to reduce the computational expense of actually calculating the fitness has been a classical pursuit of practitioners. One area which could benefit from progress in this endeavour is bot evolution, i.e. the evolution of non-playing characters in computer games. Because assigning a fitness value to a bot (or rather, the decision tree that controls its behaviour) requires playing the game, the process is very costly. In this work, we introduce two major contributions to speed up this process in the computer game Unreal Tournament 2004. Firstly, a method for fitness value approximation in genetic programming which is based on the idea that individuals that behave in a similar fashion will have a similar fitness. Thus, similarity of individuals is taken at the performance level, in contrast to commonly employed approaches which are either based on similarity of genotypes or, less frequently, phenotypes. The approximation performs a weighted average of the fitness values of a number of individuals, attaching a confidence level which is based on similarity estimation. The latter is the second contribution of this work, namely a method for estimating the similarity between individuals. This involves carrying out a number of tests consisting of playing a static version of the game (with fixed inputs) with the individuals whose similarity is under evaluation and comparing the results. Because the tests involve a limited version of the game, the computational expense of the similarity estimation plus that of the fitness approximation is much lower than that of directly calculating the fitness. The success of the fitness approximation by similarity estimation method for bot evolution in UT2K4 allows us to expect similar results in environments that share the same characteristics.

B I 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 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 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 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 B I O O O O B I O O O O O O O O O O O O O O B I O B I O O B I O O O O O O O O O O O O O O O

bot evolution
fitness approximation
similarity estimation
genetic programming
unreal tournament 2004

computationally expensive fitness functions


Exploring the P2 and P3 ligand binding features for Hepatitis C virus NS3 protease using some 3D QSAR techniques Several three-dimensional quantitative structureactivity relationship (3D-QSAR) models have been constructed using the comparative molecular field analysis (CoMFA), comparative molecular similarity indices analysis (CoMSIA), and Catalyst pharmacophore feature building programs for a series of 26 truncated ketoacid inhibitors designed particularly for exploring the P2 and P3 binding pockets of HCV NS3 protease. The structures of these inhibitors were built from a structure template extracted from the crystal structure of HCV NS3 protease. The structures were aligned through docking each inhibitor into the NS3 active site using program GOLD. The best CoMSIA model was identified from the stepwise analysis results and the corresponding pharmacophore features derived were used for constructing a pharmacophore hypothesis by the Catalyst program. Pharmacophore features obtained by CoMFA and CoMSIA are found to be in accord with each other and are both mapped onto the molecular 5K surface of NS3 active site. These pharmacophore features were also compared with those obtained by the Catalyst program and mapped onto the same NS3 molecular surface. The pharmacophore building process was also performed for 20 boronic acid based NS3 inhibitors characterized by a long hydrophobic side chain attached at position P2. This latter pharmacophore hypothesis built by the Catalyst program was also mapped onto the molecular surface of NS3 active site to define a second hydrophobic feature at position P2. The possibility of using the pharmacophore features mapped P2 and P3 binding pocket to design more potent depeptidized NS3 inhibitors was discussed.

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 B 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 O O O O O O O O O O O O O O O O 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 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 B 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 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

structure alignment
molecular docking
pharmacophore model


Mobile agent migration modeling and design for target tracking in wireless sensor networks Computing paradigms play an important and fundamental role in collaborative processing in wireless sensor networks. The client/server based paradigm and the mobile agent based paradigm are two popular computing models used to facilitate collaboration among sensor nodes. In this paper, we study the key problem of determining the mobile agent itinerary for collaborative processing and model the dynamic mobile agent planning problem. We then present three itinerary planning algorithms, the static, the dynamic, and the predictive dynamic approaches to solve the target tracking problem in wireless sensor networks. We design three metrics (energy consumption, network lifetime, and the number of hops) and use simulation tools to quantitatively measure the performance of different itinerary planning algorithms. Simulation results show considerable improvement over the static itinerary and the dynamic itinerary approaches using the predictive dynamic itinerary algorithm.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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

computing paradigm
mobile agent computing
client/server computing


DAY-AHEAD PRICE FORECASTING IN ASIA'S FIRST LIBERALIZED ELECTRICITY MARKET USING ARTIFICIAL NEURAL NETWORKS This paper proposes a comparative model for the day-ahead electricity price forecasting that could be realized using multi-layer neural network (MLNN) with levenberg-marquardt (LM) algorithm, generalized regression neural network (GRNN) and cascade-forward neural network (CFNN). In this work applications of various models were applied to national electricity market of Singapore (NEMS), i.e. Asia's first liberalized electricity market. The individual price of year 2006 is very volatile with a very wide range. Therefore, accurate forecasting models are required for Singapore electricity market company (EMC) to maximize their profits and for consumers to maximize their utilities. Hence the year 2006 has been taken for forecasting the uniform Singapore electricity price (USEP). The mean absolute percentage error (MAPE) results show that the proposed CFNN model possess better forecasting abilities than the other models and its performance was least affected by the volatility.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

generalized regression neural network (grnn)

national electricity market of singapore (nems)


Parallel loop generation and scheduling Loop tiling is an efficient loop transformation, mainly applied to detect coarse-grained parallelism in loops. It is a difficult task to apply n-dimensional non-rectangular tiles to generate parallel loops. This paper offers an efficient scheme to apply non-rectangular n-dimensional tiles in non-rectangular iteration spaces, to generate parallel loops. In order to exploit wavefront parallelism efficiently, all the tiles with equal sum of coordinates are assumed to reside on the same wavefront. Also, in order to assign parallelepiped tiles on each wavefront to different processors, an improved block scheduling strategy is offered in this paper.

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

loop parallelization
wave-front
code generation
loop scheduling


Optimal weight design of rotor systems with oil-film bearings subjected to frequency constraints The purpose of this study is to investigate optimal weight design of rotors. The analysis results of this work for dynamic analysis of rotors are compared to those available in the literature. An excellent agreement is observed, which validates the formulation and implementation of the model developed. Further analysis is conducted for rotors with oil-film bearings. The stability of the system is studied by examining the real parts of the eigenvalues and the logarithmic decrement. The sequential quadratic programming technique is used for the minimum weight design. The effect of minimum weight design on the distribution of rotor shape, weight saving, and system stability is examined. It is demonstrated that significant reduction of rotor weight can be achieved. Weight reduction of more than 80% is possible for a simple rotor analyzed, whereas for a realistic complex rotor with oil-lubricated bearings, an original rotor weight of 5.4886kg can be reduced to 1.7267kg after being optimized.

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

finite element analysis
optimal design
oil film bearings
rotor dynamics.


WHICH DTN CLP IS BEST FOR LONG-DELAY CISLUNAR COMMUNICATIONS WITH CHANNEL-RATE ASYMMETRY? Delay-/disruption-tolerant networking is considered one of the most suitable technologies to handle the delays and disconnection inherent in space internetworking. To date, little work has been done in evaluating its effectiveness in cislunar communications involving long link delay and highly asymmetric channel rates. In this article, we present an experimental study of DTN convergence layer protocols over a typical cislunar communication infrastructure accompanied by a very long link delay, various asymmetric channel rates, and varying data loss rate. The intent of the work was to find answers to two questions: which CLP is the best for long-delay cislunar communications in the presence of highly asymmetric channel rates, and whether aggregation of bundle protocol bundles is helpful for improving goodput of DTN in the presence of IPN channel asymmetry.

O 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 O O O O O O O O O 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

fault tolerant networks
channel estimation


A new critical path method and a memetic algorithm for flexible job shop scheduling with overlapping operations The flexible job shop scheduling problem (FJSP) is an extension of the classical job shop scheduling problem (JSP) which allows an operation to be processed by any machine from a given set of machines. FJSP is NP-hard and presents two major difficulties. The first is to assign each operation to a machine out of a set of capable machines; and the second deals with sequencing the assigned operations on the machines. However, it is quite difficult to obtain an optimal solution to this problem in medium and large size problems with traditional optimization approaches. In this paper, a memetic algorithm (MA) for flexible job shop scheduling with overlapping operations is proposed that solves the FJSP to minimize makespan. We also proposed a heuristic that uses the critical path method (CPM) in order to improve the results of MA and reduce the objective function. The experimental results of MA and CPM show that our approach is capable of achieving the optimal solution for small size problems and near-optimal solutions for medium and large size problems in a reasonable time.

O O O O O O O B I O B I I I O B O O B I 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 B I O O B I 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 O O O O

flexible job shop scheduling
overlapping
memetic algorithm


Full-Text Search Engine using MySQL In this article we will try to explain how we can create a search engine using the powerful MySQL full-text search. The ever increasing demands of the web requires cheap and elaborate search options. One of the most important issues for a search engine is to have the capacity to order its results set as relevance and provide the user with suggestions in the case of a spelling mistake or a small result set. In order to fulfill this request we thought about using the powerful MySQL full-text search. This option is suitable for small to medium scale websites. In order to provide sound like capabilities, a second table containing a bag of words from the main table together with the corresponding metaphone is created. When a suggestion is needed, this table is interrogated for the metaphone of the searched word and the result set is computed resulting a suggestion.

O B O O B O O O O O O O O O O O O O B O O O O B O B O O O O O O O O O O O B 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 B 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 B O O O O O O O O O O O O O

full-text
index
search engine
ranking
levenstein


a taxonomic analysis of what world wide web activities significantly impact people's decisions and actions In this paper, we present three taxonomic classification schemes based on Web users' responses to what Web activities significantly impacted their decisions and actions. The taxonomic classifications focus on three variables: the Purpose of people's search on the Web, the Method people use to find information, and the Content of the information for which they are searching. These taxonomies are useful for understanding people's activity on the Web and for developing ecologically-valid tasks to be used when studying Web behavior.

O O B O O O O B O O O O O O O O O B O O O O B O O O B B 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 B 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 B B

use users analysis web behavior paper search classification

understandability
variability
activation
taxonomy
web usability
information foraging
informal
world wide web
action
scheme


An Experiment Description Language for Wireless Network Research This article introduces a network experiment description language that is designed as a general approach for testbed networks and simulation environments. The approach is based on a domain specific language simplifying the execution of experiments by using an easily comprehensible and straight-forward design scheme. By laying out a clear logical structure, experiment descriptions provide the user with the possibility to only focus on the crucial matter of experiments. An experiment description file serves as the input for a software tool that executes the experiment automatically, thus being able to use a reliable timing for all specified actions. We developed this approach as DES-Cript for the DES-Testbed at the Freie Universitat Berlin, but it is not limited to this particular testbed.

O B I I 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


White matter lesion segmentation based on feature joint occurrence probability and chi(2) random field theory from magnetic resonance (MR) images Lesions of the brain's white matter are common findings in MR examinations of elderly subjects. A fully automatic method for segmenting white matter lesions is proposed here. The joint probability of multimodality MR image intensities is used as a feature to segment lesions, because lesion intensities usually are outliers of the normal tissue intensities and the lesions' joint intensity probability appears much smaller than those of normal brain tissues. The chi(2) random field theory is used to determine the significance of a detected lesion and provides a strict statistical analysis to exclude small-sized false-positive lesions. Experimental results show that the automatic segmentation of lesions is in high agreement with manual segmentation, and the chi(2) random-field-based statistical analysis greatly improves lesion segmentation results. (c) 2010 Elsevier 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 B I 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


NeuroXidence: reliable and efficient analysis of an excess or deficiency of joint-spike events We present a non-parametric and computationally efficient method named NeuroXidence that detects coordinated firing of two or more neurons and tests whether the observed level of coordinated firing is significantly different from that expected by chance. The method considers the full auto-structure of the data, including the changes in the rate responses and the history dependencies in the spiking activity. Also, the method accounts for trial-by-trial variability in the dataset, such as the variability of the rate responses and their latencies. NeuroXidence can be applied to short data windows lasting only tens of milliseconds, which enables the tracking of transient neuronal states correlated to information processing. We demonstrate, on both simulated data and single-unit activity recorded in cat visual cortex, that NeuroXidence discriminates reliably between significant and spurious events that occur by chance.

O 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 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 B I I O O O O O O O O O O O O O

non-parametric and parametric significance estimation


Assessing the IEEE 802.11e QoS effectiveness in multi-hop indoor scenarios The IEEE 802.11e technology is receiving much interest due to the enhancements offered to wireless local area networks in terms of QoS. Other application fields for this technology are wireless ad hoc networks, wireless mesh networks, and vehicular ad hoc networks. In the literature, most of the research works available focusing on the IEEE 802.11e technology offer simulation results alone, being hard to find empirical results of implementations that prove its effectiveness in realistic scenarios. Additionally, we consider that studies of IEEE 802.11e based on simulation platforms have not been thoroughly validated using real-life results. In this work we analyze the performance of the IEEE 802.11e technology in real multi-hop ad hoc networks. With this purpose we first we devise a set of experiments where we compare the results obtained on a small testbed to those from the ns-2 simulation platform. A significant consistency in terms of overall trends is found, although remarkable differences can be appreciated in terms of both delay and throughput results. Afterward we proceed with a full deployment of IEEE 802.11e enabled stations throughout the floor of an university building, performing several experiments using both static and dynamic routing. Experimental results show that QoS can be reasonably sustained for both voice and video traffic in multi-hop ad hoc networks, although dynamic routing protocols can hinder performance by provoking frequent onoff connectivity problems.

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

ieee 802.11e
multi-hop ad hoc network
indoor testbed
ns-2 simulator


Sub-Symbols and Icons There is a relationship between perception through biological senses and simple problem-solving. According to the production system theory, we can define a geometrically based problem-solving model as a production system operating on vectors of fixed dimensions (Icons). Our goal is to form a sequence of associations, which lead to a desired state represented by a vector, from an initial state represented by a vector. We define a simple and universal heuristics function, which takes into account the relationship between the vector and the corresponding similarity of the represented object or state in the real world.

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

iconic representation
problem-solving
symbols
sub-symbols