Supporting effective health and biomedical information retrieval and navigation: A novel facet view interface evaluation There is a need to provide a more effective user interface to facilitate non-domain experts health information seeking in authoritative online databases such as MEDLINE. We developed a new topic cluster based information navigation system called SimMed. Instead of offering a list of documents, SimMed presents users with a list of ranked clusters. Topically similar documents are grouped together to provide users with a better overview of the search results and to support exploration of similar literature within a cluster. We conducted an empirical user study to compare SimMed to a traditional document list based search interface. A total of 42 study participants were recruited to use both interfaces for health information exploration search tasks. The results showed that SimMed is more effective in terms of users perceived topic knowledge changes and their engagement in user-system interactions. We also developed a new metric to assess users efforts to find relevant citations. On average, users need significantly fewer clicks to find relevant information in SimMed than in the baseline system. Comments from study participants indicated that SimMed is more helpful in finding similar citations, providing related medical terms, and presenting better organized search results, particularly when the initial search is unsatisfactory. Findings from the study shed light on future health and biomedical information retrieval system and interface designs.

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

biomedical information retrieval systems


A fast and accurate calibration algorithm for real-time locating systems based on the received signal strength indication With the recent growth of IEEE 802.11 based Wireless Local Area Networks (WLANs), there has been new research attempts to use the WLAN technology for location estimation applications in deep indoor environments where traditional locating algorithms are not effective. The received signal strength indication (RSSI) fingerprinting that uses WLAN infrastructure is a compelling approach due to its fast online tracking capability and to its accurate location estimation. However, the RSSI requires an exhaustive calibration phase to build a fingerprint database. To mitigate the time consuming property of the calibration process, several studies have proposed a number of propagation prediction models that derive the distance of a target object from RSSI values at the expense of lower location accuracy. In this study, we propose a new locating algorithm that combines the calibration procedure with the fingerprint prediction model. Our simulation results show that our new approach not only reduces the calibration time, but it also provides comparable location accuracy to that of the conventional calibration-based locating 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 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 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

location-based services
real-time location systems
path-loss prediction


An integrated driver warning system for driver and pedestrian safety A driver assistance system that correlates obstacles with driver view is proposed. Fuzzy-rules-based subsystems are used for analysis under different road conditions. One set of fuzzy rules for when a vehicle or pedestrian ahead is detected. One set of fuzzy rules for when no immediate obstacle is detected. Lab experiments and comparisons using real-world data show good performance.

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

driving safety
stereo vision
histogram of oriented gradient
adaboost


Maximum volume cuboids for arbitrarily shaped in-situ rock blocks as determined by discontinuity analysisA genetic algorithm approach The block stone industry is one of the main commercial use of rock. The economic potential of any block quarry depends on the recovery rate, which is defined as the total volume of useful rough blocks extractable from a fixed rock volume in relation to the total volume of moved material. The natural fracture system, the rock type(s) and the extraction method used directly influence the recovery rate. The major aims of this study are to establish a theoretical framework for optimising the extraction process in marble quarries for a given fracture system, and for predicting the recovery rate of the excavated blocks. We have developed a new approach by taking into consideration only the fracture structure for maximum block recovery in block quarries. The complete model uses a linear approach based on basic geometric features of discontinuities for 3D models, a tree structure (TS) for individual investigation and finally a genetic algorithm (GA) for the obtained cuboid volume(s). We tested our new model in a selected marble quarry in the town of ?scehisar (AFYONKARAH?SARTURKEY).

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

dimensional stone
3d fracture model
optimisation


On the Efficiency of Cluster-based Approaches for Motion Detection using Body Sensor Networks Body Sensor Networks (BSN) are an emerging application that places sensors on the human body. Given that a BSN is typically powered by a battery, one of the most critical challenges is how to prolong the lifetime of all sensor nodes. Recently, using clusters to reduce the energy consumption of BSN has shown promising results. One of the important parameters in these cluster-based algorithms is the selection of cluster heads (CHs). Most prior works selected CHs either probabilistically or based on nodes' residual energy. In this work, we first discuss the efficiency of cluster-based approaches for saving energy. We then propose a novel cluster head selection algorithm to maximize the lifetime of a BSN for motion detection. Our results show that we can achieve above 90% accuracy for the motion detection, while keeping energy consumption as low as possible.

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

body sensor network
energy conservation
knn


Modeling of human artery tissue with probabilistic approach Probabilistic approach is used to model the inhomogeneity of human artery tissue. Tissue properties are represented by a statistical function with normal distribution. Mean value of the material parameters are identified using genetic algorithm. Empirical 3-sigma rule is used for reliability study of the statistical model. The statistical model represents the human artery properties accurately.

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

human arterial tissue
uncertainty analysis
tissue modeling
medical simulation


user-guided symbiotic space-sharing of real workloads Symbiotic space-sharing is a technique that can improve system throughput by executing parallel applications in combinations and configurations that alleviate pressure on shared resources. We have shown prototype schedulers that leverage such techniques to improve throughput by 20\% over conventional space-sharing schedulers when resource bottlenecks are known. Such evaluations have utilized benchmark workloads and proposed that schedulers be informed of resource bottlenecks by users at job submission time; in this work, we investigate the accuracy with which users can actually identify resource bottlenecks in real applications and the implications of these predictions for symbiotic space-sharing of production workloads. Using a large HPC platform, a representative application workload, and a sampling of expert users, we show that user inputs are of value and that for our chosen workload, user-guided symbiotic scheduling can improve throughput over conventional space-sharing by 15-22\%.

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

resource allocation
high performance computing
job scheduling
symbiotic space-sharing


Automatic Enrichment of Semantic Relation Network and Its Application to Word Sense Disambiguation The most fundamental step in semantic information processing (SIP) is to construct knowledge base (KB) at the human level; that is to the general understanding and conception of human knowledge. WordNet has been built to be the most systematic and as close to the human level and is being applied actively in various works. In one of our previous research, we found that a semantic gap exists between concept pairs of WordNet and those of real world. This paper contains a study on the enrichment method to build a KB. We describe the methods and the results for the automatic enrichment of the semantic relation network. A rule based method using WordNet's glossaries and an inference method using axioms for WordNet relations are applied for the enrichment and an enriched WordNet (E-WordNet) is built as the result. Our experimental results substantiate the usefulness of E-WordNet. An evaluation by comparison with the human level is attempted. Moreover, WSD-SemNet, a new word sense disambiguation (WSD) method in which E-WordNet is applied, is proposed and evaluated by comparing it with the state-of-the-art 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 management applications
knowledge base management
text analysis
knowledge acquisition
dictionaries
semantic networks


Deterministic quantum key distribution using stabilizer quantum code Employing a stabilizer quantum code (SQC), a quantum deterministic communication scheme is proposed to transmit secret messages with unconditional security. The proposed scheme has great capacity to transmit the messages since the utilized SQC can encode more than one qubit of the secret message in the message transmission phase for one scheme run. By utilizing the syndromes of the destroyed qubits, the damaged states can be exactly recovered from the received travel photons, which means that the scheme can be implemented in the imperfect channel with high fidelity.

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


Fast transform from an adaptive multi-wavelet representation to a partial Fourier representation We present a fast algorithm to compute the partial transformation of a function represented in an adaptive pseudo-spectral multi-wavelet representation to a partial Fourier representation. Such fast transformations are useful in many contexts in physics and engineering, where changes of representation from a piece wise polynomial basis to a Fourier basis. The algorithm is demonstrated for a Gaussian in one and in three dimensions. For 2D, we apply this approach to a Gaussian in a periodic domain. The accuracy and the performance of this method is compared with direct summation.

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

multi-wavelet
multi-resolution analysis
fourier transform
fft


A spacetime discontinuous Galerkin method for hyperbolic heat conduction Non-Fourier conduction models remedy the paradox of infinite signal speed in the traditional parabolic heat equation. For applications involving very short length or time scales, hyperbolic conduction models better represent the physical thermal transport processes. This paper reviews the MaxwellCattaneoVernotte modification of the Fourier conduction law and describes its implementation within a spacetime discontinuous Galerkin (SDG) finite element method that admits jumps in the primary variables across element boundaries with arbitrary orientation in space and time. A causal, advancing-front meshing procedure enables a patch-wise solution procedure with linear complexity in the number of spacetime elements. An h-adaptive scheme and a special SDG shock-capturing operator accurately resolve sharp solution features in both space and time. Numerical results for one spatial dimension demonstrate the convergence properties of the SDG method as well as the effectiveness of the shock-capturing method. Simulations in two spatial dimensions demonstrate the proposed methods ability to accurately resolve continuous and discontinuous thermal waves in problems where rapid and localized heating of the conducting medium takes place.

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

hyperbolic heat conduction
discontinuous galerkin
finite element


Geometry theorem proving by decomposing polynomial system into strong regular sets This paper presents a complete method to prove geometric theorem by decomposing the corresponding polynomial system. into strong regular sets, by which one can compute some components for which the geometry theorem is true and exclude other components for which the geometry theorem is false. Two examples are given to show that the geometry theorems are conditionally true for some components which are excluded by other methods.

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

zero decomposition
strong regular set
automated geometry theorem proving
subsidiary condition


Low-complexity multiuser receiver scheme for STC-CDMA communication system and its performance analysis By utilizing the complex orthogonality of spacetime coding, a multiuser receiver scheme is proposed for full-diversity spacetime coded CDMA systems for effective decoding. The scheme can reduce the high decoding complexity of the existing scheme greatly, and achieve low calculation complexity. Based on the system symbol error rate (SER) analysis and moment generation function, the average SER and bit error rate (BER) are derived in detail, and the high-accuracy approximate expressions are obtained. With these expressions, the system performance can be effectively evaluated in theory. Simulation results show that the proposed receiver scheme performance is very close to the existing scheme performance, the derived SER and BER expressions can match the simulated values well, and thus the validity of the theoretical analysis is verified.

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

low-complexity receiver
code division multiple access (cdma)


Selective disassembly for virtual prototyping as applied to de-manufacturing Selective disassembly involves separating a selected set of components from an assembly. Applications for selective disassembly include de-manufacturing (maintenance and recycling), and assembling. This paper presents a new methodology for performing design for selective disassembly analysis on the CAD model of an assembly. The methodology involves the following three steps: (i) identifying the components to be selectively disassembled for de-manufacturing by a software program or designer, (ii) determining an optimal (e.g. minimal cost) disassembly sequence for the selected components that involves a computationally efficient two-level reduction procedure: (a) the determination of a set of sequences with an objective of minimal component removals via a wave propagation approach that topologically order components in an assembly for selective disassembly, and (b) the evaluation of resulting sequences based on an objective function (e.g. minimal cost) to identify an optimal sequence, and (iii) Performing disassembly design decisions based on the evaluated optimal sequence. Preliminary implementation results of the selective disassembly methodology in sequencing and disassembly cost evaluation, and application of the selective disassembly technique for de-manufacturing assessment are presented. (C) 1999 Elsevier Science Ltd. All rights reserved.

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

selective disassembly
sequencing
cost evaluation
wave propagation


Energy-efficient task scheduling algorithms on heterogeneous computers with continuous and discrete speeds A large number of computing servers and personal electronic devices waste a tremendous amount of energy and emit a considerable amount of carbon dioxide, which is the major contribution to the greenhouse effect. Thus, it is necessary to significantly reduce pollution and substantially lower energy usage. Green computing techniques are utilized in a myriad of applications in energy conservation and environment improvement. New green task scheduling algorithms for heterogeneous computers with changeable continuous speeds and changeable discrete speeds are developed to reduce energy consumption as much as possible and finish all tasks before a deadline. A newly proven theorem can determine the optimal speed for tasks assigned to a computer with continuous speeds. This project seeks to develop innovative green task scheduling algorithms that have two main steps: heuristically assigning tasks to computers, and setting optimal or near-optimal speeds for all tasks assigned to each computer. Sufficient simulation results indicate that the algorithm with the best task schedule varied. Thus, two hybrid algorithms for continuous and discrete speeds are created separately to obtain the best task schedule among candidate task schedules. Potential research applications include incorporating energy-efficient software into mobile devices, sensor networks, data centers, and cloud computing systems.

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

energy reduction
power-aware methods
pollution reduction


A competitive and cooperative co-evolutionary approach to multi-objective particle swarm optimization algorithm design Multi-objective particle swarm optimization (MOPSO) is an optimization technique inspired by bird flocking, which has been steadily gaining attention from the research community because of its high convergence speed. On the other hand, in the face of increasing complexity and dimensionality of todays application coupled with its tendency of premature convergence due to the high convergence speeds, there is a need to improve the efficiency and effectiveness of MOPSO. In this paper a competitive and cooperative co-evolutionary approach is adapted for multi-objective particle swarm optimization algorithm design, which appears to have considerable potential for solving complex optimization problems by explicitly modeling the co-evolution of competing and cooperating species. The competitive and cooperative co-evolution model helps to produce the reasonable problem decompositions by exploiting any correlation, interdependency between components of the problem. The proposed competitive and cooperative co-evolutionary multi-objective particle swarm optimization algorithm (CCPSO) is validated through comparisons with existing state-of-the-art multi-objective algorithms using established benchmarks and metrics. Simulation results demonstrated that CCPSO shows competitive, if not better, performance as compared to the other algorithms.

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

multi-objective optimization
competitivecooperative co-evolution


A comparative analysis of interactive arithmetic learning in the classroom and computer lab We compared the usage of interactive arithmetic in classroom and computer lab. We used 3 groups: (1) classroom, (2) computer lab and (3) mixed usage of both. Groups interacting with the system in the classroom achieved higher learning. Peer interaction looks to be the key factor for learning improvement.

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

interpersonal computer
individual feedback
teaching arithmetic
educational computer lab
1:n education
1:1 education


Fuzzy Generalized Ordered Weighted Averaging Distance Operator and Its Application to Decision Making We develop the fuzzy generalized ordered weighted averaging distance (FGOWAD) operator. It is a new aggregation operator that uses the main characteristics of the generalized OWA (GOWA), the ordered weighted averaging distance (OWAD) and uncertain information represented as fuzzy numbers. This operator includes a wide range of distance measures and aggregation operators such as the fuzzy maximum distance, the fuzzy minimum distance, the fuzzy normalized Hamming distance (FNHD), the fuzzy weighted Hamming distance (FWHD), the fuzzy normalized Euclidean distance (FNED), the fuzzy weighted Euclidean distance (FWED), the fuzzy ordered weighted averaging distance (FOWAD) operator, the fuzzy Euclidean ordered weighted averaging distance (FEOWAD) operator and the fuzzy generalized ordered weighted averaging (FGOWA) operator. We study some of its main properties. Finally, we apply the developed operator to a multi-person decision-making problem regarding the selection of strategies.

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

distance measure
gowa operator
fuzzy number


Fabrication and adhesion strength of Cu/NiCr/polyimide films for flexible printed circuits The adhesion strength of a Cu/NiCr/polyimide flexible copper clad laminate (FCCL), was evaluated according to the thickness of the NiCr (Ni:Cr=95:5 ratio) seed layer using the 90 peel test. The changes in the morphology, chemical bonding and adhesion properties were characterized by SEM, AFM and XPS. The peel strength of the FCCL increased with increasing thickness of the NiCr seed layer, due to the increase in the ion bombardment caused by the higher power used in the NiCr sputtering process. This increase in the FCCL peel strength was attributed to the lower proportion of CN bonds and higher proportion of CO bonds in the polyimide surface. The adhesion strength between the metal and polyimide was mostly attributed to the chemical interaction between the metal layer and the functional groups of the polyimide.

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

flexible copper clad laminate (fccl)
roll-to-roll process
flexible printed circuit
electroplating


Visualized cognitive knowledge map integration for P2P networks This study proposes a visualized cognitive knowledge map integration system, called VisCog, to facilitate knowledge management on P2P networks. By using the SOM (self-organized map)-like model, Egocentric SOM (ESOM), VisCog can merge the other peers' knowledge artifacts (e.g., documents) under a focal peer's knowledge structure and visually present the cognitive knowledge map of the P2P network. The experimental results from evaluating VisCog performance show that VisCog can retain an individual peer's knowledge structure while articulating with those of other peers to build its cognitive knowledge map.

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

self-organizing map (som)
peer-to-peer (p2p)
egocentric som (esom)


Locking protocols for materialized aggregate join views The maintenance of materialized aggregate join views is a well-studied problem. However, to date the published literature has largely ignored the issue of concurrency control. Clearly, immediate materialized view maintenance with transactional consistency, if enforced by generic concurrency control mechanisms, can result in low levels of concurrency and high rates of deadlock. While this problem is superficially amenable to well-known techniques, such as fine-granularity locking and special lock modes for updates that are associative and commutative, we show that these previous high concurrency locking techniques do not fully solve the problem, but a combination of a "value-based" latch pool and these previous high concurrency locking techniques can solve the problem.

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

relational databases
transaction processing


Introductory paper: Reflections on Conceptual Modelling The objective of this introductory paper is twofold. On one hand, it shows the guest editors's view about the complex field of Conceptual Modelling. To do that, we discuss some concepts related to this topic, as well as the relation that nowadays exists between this process and the other parts of software development. On the other hand, this introductory paper describes the papers that are included in this special issue, connecting each of these papers with the view that the guest editors have about the field.

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


A QOS ENHANCED FRAMEWORK AND TRUST MODEL FOR EFFECTIVE WEB SERVICES SELECTION Service Oriented Architecture (SOA) has become a promising paradigm for software development. One of the most important research topics in SOA is Web service selection which means to identify best services among a bunch of services with same or similar functions but having different QoS (Quality of Service). Many previous approaches, such as QoS models with quality criteria and selection algorithm, have been proposed to optimize Web service selection. However, in current research, quality values normally come from service providers, who have high possibility to exaggerate these values for advertisement. It is also argued that reputation based on an average user rating is not enough to indicate the trust degree of Web services and service provider. In addition, handling dynamic nature of Web services is still a challenging problem for dynamical Web service selection. In this paper, these problems are focused. First a QoS enhanced framework for effective Web service selection is proposed. Then a Trust model is built, which is composed of TQoS model, Decision model and Trust correction. It is claimed that a Web service can be regarded as trustful if QoS values received by consumers and tested by registry are no less than QoS values promised by providers. A prototype of the proposed framework is implemented, including SC agent, SR agent and QoS Enhanced SR. In addition, a scenario about a Tour agency's Web service selection according to its business process is implemented. To validate effectiveness of proposed approach, we compared it with other approaches, such as Euclid approach and Fuzzy approach. Numerical simulation shows that proposed approach performances better other approaches in terms of obtained quality values.

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

service oriented architecture
web services
web service selection
trust model
tqos
trust correction


Execution of natural language requirements using State Machines synthesised from Behavior Trees This paper defines a transformation from Behavior Tree models to UML state machines. Behavior Trees are a graphical modelling notation for capturing and formalising dynamic system behaviour described in natural language requirements. But state machines are more widely used in software development, and are required for use with many tools, such as test case generators. Combining the two approaches provides a formal path from natural language requirements to an executable model of the system. This in turn facilitates requirements validation and transition to model-driven software development methods. The approach is demonstrated by defining a mapping from Behavior Trees to UML state machines using the ATLAS Transformation Language (ATL) in the Eclipse Modeling Framework. A security-alarm system case study is used to illustrate the use of Behavior Trees and execution to debug requirements.

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

requirements validation
behavior engineering
mde
model transformation
uml state machine


distributed multivariate regression based on influential observations Large-scale data sets are sometimes logically and physically distributed in separate databases. The issues of mining these data sets are not just their sizes, but also the distributed nature. The complication is that communicating all the data to a central database would be too slow. To reduce communication costs, one could compress the data during transmission. Another method is random sampling. We propose an approach for distributed multivariate regression based on sampling and discuss its relationship with the compression method. The central idea is motivated by the observation that, although communication is limited, each individual site can still scan and process all the data it holds. Thus it is possible for the site to communicate only influential samples without seeing data in other sites. We exploit this observation and derive a method that provides tradeoff between communication cost and accuracy. Experimental results show that it is better than the compression method and random sampling.

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

learning curve
distributed data mining
multivariate linear regression


BonnRoute: Algorithms and Data Structures for Fast and Good VLSI Routing We present the core elements of BonnRoute: advanced data structures and algorithms for fast and high-quality routing in modern technologies. Global routing is based on a combinatorial approximation scheme for min-max resource sharing. Detailed routing uses exact shortest path algorithms, based on a shape-based data structure for pin access and a two-level track-based data structure for long-distance connections. All algorithms are very fast. Compared to an industrial router (on 32nm and 22nm chips), BonnRoute is over two times faster, has 5% less netlength, 20% less vias, and reduces detours by more than 90%.

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

algorithms
global routing
detailed routing


Synthesis of water networks considering the sustainability of the surrounding watershed This paper presents a new mathematical programming model for the optimal synthesis of recycle and reuse networks considering simultaneously the integration of the water network system and the surrounding watershed to satisfy process and environmental constraints. The model considers the optimal location of the new industrial facility to integrate its wastewater discharge to the environment with the surrounding watershed through a disjunctive formulation. The pollutants discharged for the new plant are tracked simultaneously with the other discharges to the watershed (i.e., residential, sanitary, industrial and extractions), and the natural phenomena that affect the composition of the watershed (i.e., evaporation, filtration, etc.), in addition to the chemical reactions that are carried out in the rivers. The objective function consists in minimizing the total annual cost that is constituted by the installation of the new plant cost (including the transportation for raw materials, products and services, as well as the land cost), the wastewater treatment costs (including the piping cost) and the fresh sources cost. Two example problems were used to show the applicability of the proposed methodology. (C) 2011 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 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

material flow analysis
optimization
optimal location of a new plant
watersheds
sustainable systems
mass integration
water integration


Extensions of the Ho and Lee interest-rate model to the multinomial case ? The paper presents a state dependent multinomial model of intertemporal changes in the term structure of interest rates. The model is a one-factor interest-rate model within the Markov family models for short-term interest rate and it extends the Ho and Lee [J. Finance XLI (5) (1986) 1001] binomial model. We derive the theoretical basis of the multinomial model, suggest a computational framework to evaluate the model's parameters and investigate the suitability of the model for the Italian market.

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


Development for a web-based EDM laboratory in manufacturing engineering A web-based learning framework of electrical discharge machining (EDM) is presented in this research. The architecture supports 'hands-on' exercise in precision manufacturing field for distance education and allows learners to practice and access an EDM-based virtual environment by means of the internet. Meanwhile, a learning website has been planned and constructed in order to facilitate interactivity and support EDM. In this research, open-source software tools and virtual interactive technology available are integrated to develop an emulated, effective, learning environment for distance education. The learning architecture is built independently on specific hardware and software of EDM configuration. The paper concludes with an example and the implementation phase for learning the prototype environment.

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

electrical discharge machining
education


field study on methods for elicitation of preferences using a mobile digital assistant for a dynamic tour guide Knowing tourists' individual preferences provides the possibility to offer personalized tours. The challenge is to capture these preferences using a mobile device. During a field study in Grlitz three methods for elicitation were evaluated by computing the correlation between the tourists' and the algorithms' rankings. The results served to clarify fundamental questions en route to develop a personal tour guide. 1) Is it possible to seed a general interest profile in the mobile context with all its distractions that allows the accurate prediction of actual rankings of sights? 2) Are the interest profiles sufficiently diverse to base personalized tours on individual interest profiles instead of interest prototypes? 3) How do personalized tours affect the spatial behavior of tourists, do they really visit a broader set of attractions than before? Analyzing the interest profiles gives an insight into their actual diversity, discusses their necessity and helps simulating an improved distribution of tourists at a destination.

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

preference elicitation
personalized tour
mobile recommender


Prediction of fault-prone software modules using a generic text discriminator This paper describes a novel approach for detecting fault-prone modules using a spam filtering technique. Fault-prone module detection in source code is important for the assurance of software quality. Most previous fault-prone detection approaches have been based on using software metrics. Such approaches, however, have difficulties in collecting the metrics and constructing mathematical models based on the metrics. Because of the increase in the need for spam e-mail detection, the spam filtering technique has progressed as a convenient and effective technique for text mining. In our approach, fault-prone modules are detected in such a way that the source code modules are considered text files and are applied to the spam filter directly. To show the applicability of our approach, we conducted experimental applications using source code repositories of Java based open source developments. The result of experiments shows that our approach can correctly predict 78% of actual fault-prone modules as fault-prone.

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


Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problem We consider the problem of coloring a grid using p p colors with the requirement that each row and each column has a specific total number of entries of each color. Ryser (1957)[20], and independently Gale (1957) [10], obtained a necessary and sufficient condition for the existence of such a coloring when two colors are considered. This characterization yields a linear-time algorithm for constructing the coloring when it exists. Later, Gardner etal. (2000)[11], and Chrobak and Drr (2001) [5], showed that the problem is NP-hard when p?7 p ? 7 and p?4 p ? 4 , respectively. The case p=3 p = 3 was an open problem for several years and has been recently settled by Drr etal. (2009)[9]: it is NP-hard too. This grid coloring problem is equivalent to finding disjoint realizations of two degree sequences d1,d2 d 1 , d 2 in a complete bipartite graph KX,Y K X , Y . These kinds of questions are well studied when one of the degree sequences has span zero or one, where the span of a function is the difference between its maximum and its minimum values. In [4], Chen and Shastri (1989) showed a necessary and sufficient condition for the existence of a coloring when d1+d2 d 1 + d 2 restricted to X X or Y Y has span at most one. In terms of discrete tomography this latter condition means that for two colors, the sum of the number of occurrences of these colors in each row is k k or k+1 k + 1 , for some integer k k . In the present paper we prove an analog to Chen and Shastris characterization when d1+d2 d 1 + d 2 restricted to X X and to Y Y has span at most two. That is, there exist integers k1 k 1 and k2 k 2 such that the sum of the number of occurrences of two of the colors in each row is k1?1,k1 k 1 ? 1 , k 1 or k1+1 k 1 + 1 , and in each column is k2?1,k2 k 2 ? 1 , k 2 or k2+1 k 2 + 1 . Our characterization relies on a new natural condition called the total saturation condition which, when not satisfied, gives a non-existence certificate of such a coloring that can be checked in polynomial time.

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

discrete tomography
degree sequences
complete bipartite graph


Energetic analysis of fragment docking and application to structure-based pharmacophore hypothesis generation We have developed a method that uses energetic analysis of structure-based fragment docking to elucidate key features for molecular recognition. This hybrid ligand- and structure-based methodology uses an atomic breakdown of the energy terms from the Glide XP scoring function to locate key pharmacophoric features from the docked fragments. First, we show that Glide accurately docks fragments, producing a root mean squared deviation (RMSD) of < 1.0 for the top scoring pose to the native crystal structure. We then describe fragment-specific docking settings developed to generate poses that explore every pocket of a binding site while maintaining the docking accuracy of the top scoring pose. Next, we describe how the energy terms from the Glide XP scoring function are mapped onto pharmacophore sites from the docked fragments in order to rank their importance for binding. Using this energetic analysis we show that the most energetically favorable pharmacophore sites are consistent with features from known tight binding compounds. Finally, we describe a method to use the energetically selected sites from fragment docking to develop a pharmacophore hypothesis that can be used in virtual database screening to retrieve diverse compounds. We find that this method produces viable hypotheses that are consistent with known active compounds. In addition to retrieving diverse compounds that are not biased by the co-crystallized ligand, the method is able to recover known active compounds from a database screen, with an average enrichment of 8.1 in the top 1% of the database.

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

virtual screening
fragment-based drug design


Application of dispersion-relation-preserving theory to develop a two-dimensional convectiondiffusion scheme In this paper a finite difference scheme is developed within the nine-point semi-discretization framework for the convectiondiffusion equation. The employed Pade approximation renders a fourth-order temporal accuracy and the spatial approximation of convection terms accommodates the dispersion relation. The artificial viscosity introduced in the two-dimensional convectiondiffusion-reaction (CDR) equation for stability reasons is analytically derived. Constraints on the mesh size and time interval for rendering a monotonic matrix are also rigorously derived. To validate the proposed method, we investigate several problems that are amenable to the exact solutions. The results with good rates of convergence are obtained for the investigated scalar and NavierStokes 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 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 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

pade approximation
dispersion relation
monotonic

nine-point
fourth-order
convectiondiffusion-reaction equation


Grey Nomads in Australia Lifestyle factors have been identified as being very important in determining health in later life. Nutrition, exercise, and social environment all interact to promote, or to limit, opportunities for an active and healthy post-working life. Not only are rates of chronic illness and disability reduced through the promotion of healthy lifestyles, but also quality of life is maintained through the compression of morbidity. Governments in Australia, as in the European Union and North America, have highlighted the importance of behavioral change in health promotion strategies with the aim of having an impact on the health-related lifestyles of their populations. This paper examines the example of a group of older Australians, the grey nomads, who may present opportunities for examining health-related lifestyle changes. The term grey nomad refers to a portion of the older population in Australia who choose to use their later years and retirement as opportunities for travel and leisure, mainly within the confines of the Australian continent. As such, they are similar to groups in North America, such as the snow birds, who travel to the southern United States to escape the colder winters of more northerly latitudes. Similar seasonal migrations occur from Northern to Southern Europe. What all share in common is an active culture/lifestyle of attempting to age successfully. Grey nomads also participate in the creation of what can be termed postmodern communities, where they and other regular travelers may develop a sense of community feeling with others who are also regularly returning to the same spot year after year. Social support is highly predictive of health outcomes and such mobile communities may prove a positive factor in promoting good health. In this paper we examine whether the grey nomads represent a good model for improving health-related lifestyles in later life

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


Virtual investigation of pulmonary airways in volumetric computed tomography This paper addresses the issue of non-invasive investigation and functional assessment of pulmonary airways reconstructed from multi detector computed tomography clinical acquisitions. Such an analysis combines accurate 3D meshing of the inner bronchial wall surface and navigation and interactivity tools based on a robust central axis representation. A reliable endoluminal investigation of airways via virtual bronchoscopy is possible regardless of their anatomical/pathological specificity (small caliber bronchi, severe stenoses,...). Computational fluid dynamics simulations on real airway geometries allow to assess functional modifications induced by physiopathological changes. Copyright (C) 2004 John Wiley Sons, Ltd.

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

central axis
pulmonary airways
virtual bronchoscopy

adaptive meshing
endoluminal navigation
fluid flow simulation
3d reconstruction


Exploiting Fault Model Correlations to Accelerate SEU Sensitivity Assessment Nowadays, integrated circuit technologies are increasingly being more susceptible to ionizing radiation effects. In order to assess the reliability of a digital system performing a specific application and to identify the most critical failure effects, radiation experiments and fault injection campaigns are usually performed, which may be costly and time-expensive. This paper proposes a fully automated, practical methodology for accelerating Single-Event-Upset (SEU) fault injection campaigns in digital circuits. The main underlying principle is based on the correlation between the effects of the SEU fault model with the Stuck-At (SA) one. Circuital and functional analysis and experimental case studies confirm the effectiveness of the proposed solutions.

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

digital circuits
fault injection
reliability


Adolescence and the Trajectory of Alcohol Use: Introduction to Part VI Research in the area of adolescent alcohol use is progressing rapidly, as exemplified by the chapters in this section. Basic animal research in rodents has revealed adolescents to be more sensitive than adults to ethanol-induced disruptions in brain plasticity, although adolescents conversely are relatively insensitive to ethanol cues that serve to moderate intake. Risks for excessive alcohol consumption due to genetic background have been shown in primate research to be exacerbated by adverse early life experiences. Studies in clinical populations have revealed neurocognitive deficits evident years following adolescent alcohol abuse, along with evidence that some neural changes may predate adolescent alcohol abuse, whereas others appear to be a consequence of this abuse. Further research is needed to detail determinants and consequences of adolescent alcohol abuse and to identify potential protective factors to diminish the propensity for excessive use of alcohol during this critical developmental period.

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


A robust real-time video stabilization algorithm The acquisition of digital video usually suffers from undesirable camera jitters due to unstable camera motions. In this paper, we propose a robust real-time video stabilization algorithm that alleviates the undesirable jitter motions from the unstable video to produce a stabilized video. In the proposed algorithm, we first compute the sparse optical flow vectors between successive frames, followed by estimating the camera motion by fitting the computed optical flow vectors to a simplified affine motion model with a robust trimmed least squares method. Then the computed camera motion parameters are smoothed temporally to reduce the motion fluctuations by using a regularization method. Finally, we transform all frames in the video sequence based on the original and smoothed camera motions to obtain a stabilized video. Experimental results are given to demonstrate the stabilization performance and the efficiency of the proposed algorithm.

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

optical flow computation
camera motion estimation
robust estimation
motion smoothing


Parts-based segmentation with overlapping part models using Markov chain Monte Carlo ? A probabilistic method is proposed for segmenting multiple objects that overlap or are in close proximity to one another. A likelihood function is formulated that explicitly models overlapping object appearance. Priors on global appearance and geometry (including shape) are learned from example images. Markov chain Monte Carlo methods are used to obtain samples from a posterior distribution over model parameters from which expectations can be estimated. The method is described in detail for the problem of segmenting femur and tibia in X-ray images. The result is a probabilistic segmentation that quantifies uncertainty, conditioned upon the model, so that measurements such as joint space can be made with associated uncertainty.

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

probabilistic segmentation
markov chain monte carlo


Application of a recurrent neural network to space diversity in SDMA and CDMA mobile communication systems Linear and non-linear adaptive algorithms are investigated for Space Division Multiple Access (SDMA). SDMA is one of the emerging techniques for multiple access of users in mobile radio, which uses spatial distribution of users for their differentiation. The performance of the linens Square Root Kalman (SRK) algorithm for SDMA is compared to that of the non-linear Recurrent Neural Network (RNN) technique. The proposed SDMA-RNN technique is evaluated over Rician fading channels. and it shows improved Bit Error Rate (BER) performance e in comparison with the linear SRK-based technique. The performance of SDMA-RNN is also compared with that of Code Division Multiple Acc ess (CDMA) systems, showing that it could he used as a viable alternative scheme for multiple access of users. Finally, a Hybrid CDMA-SDMA system is proposed combining: CDMA and SDMA-RNN systems. Hybrid CDMA-SDMA exhibits a very good potential for increase in the capacity and the performance of mobile communications systems.

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

adaptive space diversity combining
code division multiple access (cdma)
real-time recurrent learning algorithm
space division multiple access (sdma)


An automatic diffferentiation platform: Odyssee Numerous automatic differentiation strategies can be imagined to produce all kind of derivative programs under a wide range of complexity constraints, but there is no way to prototype and evaluate them on real size applications with reasonable effort. Since the development of an automatic differentiation platform is prohibitively expensive, using an existing platform to share investments between the different research teams is a good solution. Odyssee is an open automatic differentiation tool that enables the development of program analysis as well as program transformation for automatic differentiation. It has been used to differentiate large size industrial programs (300 000 lines of Fortran 77) and to prototype diverse new automatic differentiation algorithms. Its source is now freely available, a cooperative research project can therefore be based on it without financial or contractual constraint. (c) 2004 Elsevier B.V. All rights reserved.

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

computational differentiation
open platform
source transformation tool


Cognitive heuristics in design: Instructional strategies to increase creativity in idea generation This paper explores the use of heuristics as cognitive strategies invoked during the process of design. Heuristics are reasoning processes that do not guarantee the best solution, but often lead to potential solutions by providing a simple cognitive "shortcut." We propose that designers use specific design heuristics to explore the problem space of potential designs, leading to the generation of creative solutions. We test whether design heuristics can be taught to novices, and suggest their use will facilitate the design process at multiple levels of instruction. In the present empirical study, we evaluate a set of six instructional heuristics and validate their effectiveness with product concepts generated by novice designers. Six hundred seventy-three drawings were created by 120 first-year college students under four instructional conditions. Drawings were coded according to their content, use of heuristics, creativity, and practicality. The most creative concepts emerged from the experimental conditions where heuristics were introduced. Heuristics appeared to help the participants "jump" to a new problem space, resulting in more varied designs, and a greater frequency of designs judged as more creative. Our findings suggest that simple demonstration of design heuristics may, at times, be sufficient to stimulate divergent thinking, perhaps because these heuristics are readily grasped and contextual application is not required. Based on these findings, a conceptual model for design education emphasizing the importance of using a variety of heuristics is proposed. This model suggests that learning can be enhanced through exposure to a variety of design heuristics, and can supplement formal education and foster personal development in design learning.

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

cognitive processes
design pedagogy
empirical studies


Uniform Local Well-Posedness to the Density-Dependent Navier-Stokes-Maxwell System In this paper we establish the uniform local-in-time existence and uniqueness of classical solutions to the density-dependent Navier-Stokes-Maxwell system. We then apply this uniform result to investigate the zero dielectric constant limit and the vanishing viscosity limit to Navier-Stokes-Maxwell system. We obtain the well-known density-dependent magnetohydrodynamic equations when the dielectric constant goes to zero.

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

zero dielectric constant limit
vanishing viscosity limit

navier-stokes-maxwell system
density-dependent
uniform local well-posedness


Formal correctness of a quadratic unification algorithm We present a case study using ACL2 to verify a nontrivial algorithm that uses efficient data structures. The algorithm receives as input two first-order terms, and it returns a most general unifier of these terms if they are unifiable, failure otherwise. The verified implementation stores terms as directed acyclic graphs by means of a pointer structure. Its time complexity is O(n(2)) and its space complexity O(n), and it can be executed in ACL2 at a speed comparable to a similar C implementation. We report the main issues encountered to achieve this formally verified implementation.

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


Mapping tasks onto nodes: a parallel local neighborhood approach We consider the problem of mapping processes onto computing nodes so as to reduce the execution time by minimizing communication delays. Our approach relies on a genetic algorithm implementation of the local neighborhood search (LNS) approach and is called Genetic-LNS or GLNS. We also present our parallel version of the GLNS algorithm, called parallel genetic local neighborhood search (P-GLNS). LNS, GNLS, and P-GLNS were implemented and compared. Simulations demonstrate that the GLNS algorithm has better performance than LNS, and that, when the workload is sufficiently high, the P-GLNS algorithm achieved near linear scalability.

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

mapping onto nodes
parallel local neighborhood search


Unsupervised recursive sequence processing The self-organizing map (SOM) is a valuable tool for data visualization and data mining for potentially high-dimensional data of an a priori fixed dimensionality. We investigate SOMs for sequences and propose the SOM-S architecture for sequential data. Sequences of potentially infinite length are recursively processed by integrating the currently presented item and the recent map activation, as proposed in the SOMSD presented in (IEEE Trans. Neural Networks 14(3) (2003) 491). We combine that approach with the hyperbolic neighborhood of Ritter (Proceedings of PKDD-01, Springer, Berlin, 2001, pp. 338349), in order to account for the representation of possibly exponentially increasing sequence diversification over time. Discrete and real-valued sequences can be processed efficiently with this method, as we will show in experiments. Temporal dependencies can be reliably extracted from a trained SOM. U-matrix methods, adapted to sequence processing SOMs, allow the detection of clusters also for real-valued sequence elements.

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

self-organizing map
recurrent models
hyperbolic som
u-matrix
markov models


The Response of Plasma Catecholamines in Rats Simultaneously Exposed to Immobilization and Painful Stimuli Immobilization represents a strong stressor inducing a profound increase in plasma epinephrine and norepinephrine levels. We have previously demonstrated that a subcutaneous injection of formalin (0.2 mL of 4% solution/100 g bw) attenuated the immobilization-induced elevation of plasma epinephrine levels in rats. In the present study, we investigated whether other painful and stressful stimuli, such as capsaicin, hydrochloric acid, mechanical pressure, heat, and cold, might also attenuate the increase of plasma epinephrine in rats exposed to acute immobilization stress. With the exception of formalin, all of the painful stimuli applied failed to attenuate the increase of plasma epinephrine levels in immobilized animals. Our data suggest that the attenuation of an immobilization-induced increase in plasma epinephrine levels is specific for subcutaneous formalin administration.

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

capsaicin
epinephrine
formalin
immobilization
norepinephrine
painful stimuli


Scheduling the cleaning actions for a fouled heat exchanger subject to ageing: MINLP formulation This paper addresses the problem of scheduling the cleaning actions of a heat exchanger undergoing fouling and ageing. The existence of two discrete layers leads to the use of two cleaning methods which differ in their ability to remove the aged layer. A mixed integer nonlinear programming (MINLP) model is presented and solved for three case studies with different ageing rates. The optimal schedule consists of: (i) the timing of the cleanings and (ii) the cleaning mode in each instant. (c) 2011 Elsevier Ltd. All rights reserved.

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

ageing cleaning fouling minlp scheduling


Surface reflectance and normal estimation from photometric stereo In this paper, we propose a new photometric stereo method for estimating diffuse reflection and surface normal from color images. Using dichromatic reflection model, we introduce surface chromaticity as a matching invariant for photometric stereo, which serves as the foundation of the theory of this paper. An extremely simple and robust reflection components separation method is proposed based on the invariant. Our separation method differs from most previous methods which either assume dependencies among pixels or require segmentation. We also show that a linear relationship between the image color and the surface normal can be obtained based on this invariant. The linear relationship turns the surface normal estimation problem into a linear system that can be solved exactly or via least-squares optimization. We present experiments on both synthetic and real images, which demonstrate the effectiveness of our method. (C) 2012 Elsevier Inc. All rights reserved.

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

reflection components separation
dichromatic reflection model
chromaticity
photometric stereo


Sparse Poisson Noisy Image Deblurring Deblurring noisy Poisson images has recently been a subject of an increasing amount of works in many areas such as astronomy and biological imaging. In this paper, we focus on confocal microscopy, which is a very popular technique for 3-D imaging of biological living specimens that gives images with a very good resolution (several hundreds of nanometers), although degraded by both blur and Poisson noise. Deconvolution methods have been proposed to reduce these degradations, and in this paper, we focus on techniques that promote the introduction of an explicit prior on the solution. One difficulty of these techniques is to set the value of the parameter, which weights the tradeoff between the data term and the regularizing term. Only few works have been devoted to the research of an automatic selection of this regularizing parameter when considering Poisson noise; therefore, it is often set manually such that it gives the best visual results. We present here two recent methods to estimate this regularizing parameter, and we first propose an improvement of these estimators, which takes advantage of confocal images. Following these estimators, we secondly propose to express the problem of the deconvolution of Poisson noisy images as the minimization of a new constrained problem. The proposed constrained formulation is well suited to this application domain since it is directly expressed using the antilog likelihood of the Poisson distribution and therefore does not require any approximation. We show how to solve the unconstrained and constrained problems using the recent alternating-direction technique, and we present results on synthetic and real data using well-known priors, such as total variation and wavelet transforms. Among these wavelet transforms, we specially focus on the dual-tree complex wavelet transform and on the dictionary composed of curvelets and an undecimated wavelet transform.

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

alternating-direction method (adm)
constrained minimization
discrepancy principle
regularizing parameter selection
3-d confocal microscopy deconvolution


error characteristics and calibration-free techniques for wireless lan-based location estimation Using wireless LAN technology for location estimation provides alternate means to enable location-based applications without investment in sensor network infrastructure and special hardware. However, the main drawback of wireless LAN-based location systems is calibration of signal strength as a function of location in spatially high-density, which consumes manual labor and needs to be carried out repeatedly. In this paper, we analyze empirical error characteristics of calibration-based location algorithms such as triangulation in various spatial densities of calibration, using commercially available wireless LAN products. Then, we propose Triangular Interpolation and eXtrapolation (TIX), a calibration-free location algorithm, and present empirical performance evaluation. TIX can achieve mean distance error within 5.4 m, which is comparable to within 4.7 m errors of the calibration-based algorithms. We also present theoretical analysis on error characteristics of the location algorithms deriving accuracy limits and quantifying the effect of RF measurement and calibration.

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

wireless lan
extrapolation
calibration
interpolation
triangulation

static scene analysis
rf-based location estimation


A complete plane strain fictitious stress boundary element method for poroelastic media A fully coupled generalized plane strain boundary element model for determining the distribution of stress and pore pressure around underground openings in poroelastic media is developed. It is based on the indirect boundary element method of fictitious stress extended to complete plane strain analysis. New fundamental solutions for longitudinal forces were derived for the development of the model which uses elements with a constant variation of fictitious forces and sources in both space and time. As an example, the problem of a borehole drilled in an arbitrary direction in a triaxial stress field is considered. The results indicate that the fictitious stress method is an accurate and suitable means for complete plane strain poroelastic analyses of underground openings.

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

complete plane strain
fictitious stress
generalized plane strain
pore pressure

anti-plane shear
line force
line source
point force
point source
poroelasticity


Virtually homosexual: Technoromanticism, demarginalisation and identity formation among homosexual males Coming out is a key stage in the identity formation process for the homosexual male when the individual discloses his homosexual status to himself and others. Although previous research has indicated that homosexual men often use the Internet and computer-mediated communication (CMC) during the identity formation process to discover and develop their sexual and self-identities, studies to date have focused on their use of text-based CMC with scant attention paid to experiences within virtual worlds. This study explored whether homosexual males use virtual worlds in the sexual identity formation process and, specifically, the applicability of technoromanticism within this context. Qualitative retrospective biographical interviews were undertaken with 12 self-selected individuals who had engaged with virtual worlds before or during their sexual identity development. The CASE model (Community, Anonymity, Sexual experimentation, and Escape) was developed to characterise the key themes emerging from the data and illustrate the enactment of technoromanticism by homosexual males within virtual worlds. It is concluded that technoromanticism in virtual worlds can only have a profound impact on individuals if the individuals personal development online is transferred offline as there is a potential to become toxically immersed and thus stall or halt the identity development process altogether.

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

homosexual males
virtual worlds
technoromanticism
coming out
identity formation
cmc


A uniform approach to logic programming semantics Part of the theory of logic programming and nonmonotonic reasoning concerns the study of fixed-point semantics for these paradigms. Several different semantics have been proposed during the last two decades, and some have been more successful and acknowledged than others. The rationales behind those various semantics have been manifold, depending on one's point of view, which may be that of a programmer or inspired by commonsense reasoning, and consequently the constructions which lead to these semantics are technically very diverse, and the exact relationships between them have not yet been fully understood. In this paper, we present a conceptually new method, based on level mappings, which allows to provide uniform characterizations of different semantics for logic programs. We will display our approach by giving new and uniform characterizations of some of the major semantics, more particular of the least model semantics for definite programs, of the Fitting semantics, and of the well-founded semantics. A novel characterization of the weakly perfect model semantics will also be provided.

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

level mapping
well-founded semantics
stable semantics
weak stratification


Empowering students through digital game authorship: Enhancing concentration, critical thinking, and academic achievement Digital game-based learning is a popular strategy for engaging students by making learning fun. Actively involving students as designers and producers of digital games may have even greater potential for student empowerment through enhancing concentration and engagement, fostering higher order thinking, and improving learning outcomes. Thus, this study empirically investigated the impact of digital game authoring on students' concentration, critical thinking skills, and academic achievement. A total of 67 students in two seventh-grade classes participated in this 19-week-long experiment, and were divided into an experimental group (32 students designing digital games) and a comparison group (35 students designing Flash animations). The interdisciplinary approach involved integrating biology and computer programming classes. Students in the experimental group designed digital games based upon biology course content, while the comparison group collaboratively produced Flash animations based upon the same course content. The experimental results, using MANCOVA for pretest, posttest, and delayed posttest scores, demonstrate significant improvements in critical thinking skills, and academic achievement, with increased retention of both course content and critical thinking skills observed for the delayed posttest. For concentration, a relative advantage for the experimental group as compared with the comparison group was noted, but did not reach statistical significance. Based on the results of this study, implications for practitioners and researchers are provided, including the integration of programming or computer science with other courses for digital game authoring and the evaluation of other learning outcomes such as creative thinking, problem-solving, and flow. (C) 2013 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

applications in subject areas
authoring tools and methods
cooperative/collaborative learning
interdisciplinary projects
teaching/learning strategies


An efficient tree-based algorithm for mining sequential patterns with multiple minimum supports Sequential pattern mining (SPM) is an important technique for determining time-related behavior in sequence databases. In real-life applications, the frequencies for various items in a sequence database are not exactly equal. If all items are set with the same minimum support, the rare item problem may result, meaning that we are unable to effectively retrieve interesting patterns regardless of whether minsup is set too high or too low. Liu (2006) first included the concept of multiple minimum supports (MMSs) to SPM. It allows users to specify the minimum item support (MIS) for each item according to its natural frequency. A generalized sequential pattern-based algorithm, named Multiple Supports Generalized Sequential Pattern (MS-GSP), was also developed to mine complete set of sequential patterns. However, the MS-GSP adopts candidate generate-and-test approach, which has been recognized as a costly and time-consuming method in pattern discovery. For the efficient mining of sequential patterns with MMSs, this study first proposes a compact data structure, called a Preorder Linked Multiple Supports tree (PLMS-tree), to store and compress the entire sequence database. Based on a PLMS-tree, we develop an efficient algorithm, Multiple Supports Conditional Pattern growth (MSCP-growth), to discover the complete set of patterns. The experimental result shows that the proposed approach achieves more preferable findings than the MS-GSP and the conventional SPM.

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

sequential patterns
multiple minimum supports


The development of CASC Researchers who make theoretical advances also need some way to demonstrate that an advance really does have general, overall positive consequences for system performance. For this it is necessary to evaluate the system on a set of problems that is sufficiently large and diverse to be somehow representative of the intended application area as a whole. It is only a small step from system evaluation to a communal system competition. The CADE ATP System Competition (CASC) has been run annually since 1996. Any competition is difficult to design and organize in the first instance, and to then run over the years. In order to obtain the full benefits of a competition, a thoroughly organized event, with an unambiguous and motivated design, is necessary. For some issues relevant to the CASC design, inevitable constraints have emerged. For other issues there have been several choices, and decisions have had to be made. This paper describes the evolution of CASC, paying particular attention to its design, design changes, and organization.

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


A review of procedures to evolve quantum algorithms There exist quantum algorithms that are more efficient than their classical counterparts; such algorithms were invented by Shor in 1994 and then Grover in 1996. A lack of invention since Grovers algorithm has been commonly attributed to the non-intuitive nature of quantum algorithms to the classically trained person. Thus, the idea of using computers to automatically generate quantum algorithms based on an evolutionary model emerged. A limitation of this approach is that quantum computers do not yet exist and quantum simulation on a classical machine has an exponential order overhead. Nevertheless, early research into evolving quantum algorithms has shown promise. This paper provides an introduction into quantum and evolutionary algorithms for the computer scientist not familiar with these fields. The exciting field of using evolutionary algorithms to evolve quantum algorithms is then reviewed.

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

evolving quantum algorithms
evolutionary algorithms
quantum algorithms

quantum computing
genetic algorithms
genetic programming


Online Intrusion Alert Aggregation with Generative Data Stream Modeling Alert aggregation is an important subtask of intrusion detection. The goal is to identify and to cluster different alerts-produced by low-level intrusion detection systems, firewalls, etc.-belonging to a specific attack instance which has been initiated by an attacker at a certain point in time. Thus, meta-alerts can be generated for the clusters that contain all the relevant information whereas the amount of data (i.e., alerts) can be reduced substantially. Meta-alerts may then be the basis for reporting to security experts or for communication within a distributed intrusion detection system. We propose a novel technique for online alert aggregation which is based on a dynamic, probabilistic model of the current attack situation. Basically, it can be regarded as a data stream version of a maximum likelihood approach for the estimation of the model parameters. With three benchmark data sets, we demonstrate that it is possible to achieve reduction rates of up to 99.96 percent while the number of missing meta-alerts is extremely low. In addition, meta-alerts are generated with a delay of typically only a few seconds after observing the first alert belonging to a new attack instance.

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

generative modeling
data stream algorithm


Chaotic dynamics of the fractional order nonlinear system with time delay This paper presents the fractional order model of a nonlinear autonomous continuous-time difference-differential equation with only one variable. Numerical simulation results of the fractional order model demonstrate the existence of chaos when system order \(q\ge 0.2\). Values of the delay time \(\tau \) in which chaotic behavior is observed at system order \(q\) are quantitatively defined using the largest Lyapunov exponents obtained from the output time series.

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

fractional order time delayed nonlinear system


Network integration testing: concepts, test specifications and tools for automatic telecommunication services verification The purpose of this tutorial is to provide concepts and historical background of the network integration testing (NIT) methodology. NIT is a grey box testing technique that is aimed at verifying the correct behaviour of interconnected networks (operated by different operators) in provisioning services to end users, or the behaviour of a complex network operated by a unique operator. The main technical concepts behind this technique are presented along with the history of some International projects that have contributed to its early definition and application. European Institute for Research and Strategic Studies in Telecommunication (EURESCOM) has actually been very active, with many projects, in defining the NIT basic methodology and providing actual NIT specifications (for narrow-band and broad-band services, covering both voice and data). EURESCOM has also been acting as a focal point in the area, e.g., encouraging the Industry in developing commercial tools supporting NIT. In particular, the EURESCOM P412 project (19941996) first explicitly defined the NIT methodology (the methodological aspects include test notation, test implementation, test processes, distributed testing and related co-ordination aspects). P412 applied the methodology to ISDN whilst another project, P410, applied NIT to data services. The P613 project (19971999) extended the basic NIT methodology to the broad band and GSM. More into details, the areas covered currently by NIT test specifications developed by EURESCOM projects include N-ISDN, N-ISUP, POTS, B-ISDN, B-ISUP, IP over ATM, ATM/FR, GSM, focusing also on their inter-working cases (e.g., ISDN/ISDN, ISDN/GSM, etc.). ETSI, the European Telecommunication Standards Institute, also contributed to NIT development (e.g., the definition of the TSP1+ protocol, used for the functional co-ordination and timing synchronisation of all tools involved in a distributed testing session). The paper also discusses NIT in relation to the recent major changes (processes) within the telecommunication (TLC) community. Beyond the new needs coming from the pure technical aspects (integration of voice and data, fixed mobile convergence, etc.) the full deregulation of the TLC sector has already generated new processes and new testing needs (e.g., Interconnection Testing) that had a significant influence on the methodology. NIT is likely to continue to develop further in the future according to the needs of telecom operators, authorities, users associations and suppliers.

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

network integration testing
gsm
isdn
atm
testing


A multiqueue service room MAC protocol for wireless networks with multipacket reception An adaptive medium-access control (MAC) protocol for heterogeneous networks with finite population is proposed. Referred to as the multiqueue service room (MQSR) protocol, this scheme is capable of handling users with different quality-of-service (QoS) constraints. By exploiting the multipacket reception (MPR) capability, the MQSR protocol adaptively grants access to the MPR channel to a number of users such that the expected number of successfully received packets is maximized in each slot. The optimal access protocol avoids unnecessary empty slots for light traffic and excessive collisions for heavy traffic. It has superior throughput and delay performance as compared to, for example, the slotted ALOHA with the optimal retransmission probability. This protocol can be applied to random-access networks with multimedia traffic.

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

medium-access control (mac)
multipacket reception (mpr)
random-access network


Local and global effects of Mg2+ on Ago and miRNA-target interactions Three magnesium ions (Mg2+), named Mg1 (in Mid domain), Mg2 and Mg3 (both in PIWI domain), located at the small RNA binding domain of Argonaute (Ago) protein, are important for sequence-specific miRNA-target interactions. Such conjunction between the Ago protein and miRNA raises the question: How do Mg2+ ions participate in the recognition process of miRNA by Ago or its target. Furthermore, it is still unclear whether the Mg2+ ions contribute to the local or global stability of the miRNA complex. In this work, we have performed a series of 16 independent molecular dynamic simulations (MD) to characterize the functions of Mg2+, hydration patterns and the conformational events involved in the miRNA-target interactions. The cross correlation analysis shows that Mg1 and Mg2 significantly enhance a locally cooperated movement of the PAZ, PIWI and Mid domains with the average correlation coefficient of similar to 0.65, producing an "open-closed" motion (rotation Angle, 46.5A degrees) between the PAZ and PIWI domains. Binding of Mg3 can globally stabilize the whole Ago protein with the average RMSD of similar to 0.34 , compared with the systems in absence of Mg3 (average RMSD = similar to 0.43 ). Three structural water molecules surrounding the Mg2+-binding regions also stabilize these ions, thus facilitating the recognition of miRNA to its target. In addition, the thermodynamic analysis also verifies the positive contribution of all three Mg2+ to the binding of miRNA to Ago, as well as the importance Mg2 plays in the cleavage of the miRNA targets.

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

mg2+
mirna-mrna
mm/gbsa
molecular dynamic simulation


On the characteristics of information dissemination paths in vehicular ad hoc networks on the move Recently, Intelligent Transportation Systems (ITS) is becoming an important research topic. One goal for ITS is to disseminate important information among vehicles in a timely and efficient manner. In the ITS research community, inter-vehicle communications (IVC) is considered a way that may be able to achieve this goal. An information network built on top of vehicles using IVC can be viewed as a type of mobile ad hoc networks. Although several information dissemination protocols for mobile ad hoc networks have been proposed, how well they can be applied to a vehicle-formed mobile ad hoc network is still poorly studied. Without doubt, no matter what methodology is taking for designing an IVC suitable information dissemination protocol, the protocol performance is fundamentally limited by the potential degree of physical-link connectivity. Thus, in this paper, some potential link attributes of IVC networks, such as the lifetime of a transmission path between two vehicles, are studied based on reasonable vehicle traces generated by a microscopic traffic simulator. Although no specific protocol is focused on in this paper, the studied results can potentially contribute to performance improvement and/or protocol efficiently for any existed or developing protocol.

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

inter vehicle communications
physical-link connectivity
vehicular ad hoc network


An object-oriented programming framework for boundary integral equation methods This work presents an object-oriented numerical framework for the development of computer programs based on the boundary element method (BEM). The proposed design provides a large set of classes developed specially to handle those entities most commonly found in BEM solution procedures. The framework is divided into three basic sets of classes that enable the analyst to build the code accordingly to the type of problem to be solved. The design also allows the use of an arbitrary number of subregions, which are connected automatically by imposing compatibility conditions on the interfaces. Code fragments illustrate how the use of the proposed framework can simplify the development cycle of research software based on the BEM.

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

object-oriented programming
finite element method
engineering software