Delay analysis of feedback-synchronization signaling for multicast flow control Feedback signaling plays a key role in flow control because the traffic source relies on the signaling information to make correct and timely flow-control decisions. Design of an efficient signaling algorithm is a challenging task since the signaling messages can tolerate neither error nor latency. Multicast flow-control signaling imposes two additional challenges: scalability and feedback Synchronization. Previous research on multicast feedback-synchronization signaling has mainly focused on the algorithm design and implementation. However, the delay properties of these algorithms are, despite their vital importance, neither well understood nor thoroughly studied. In this paper, we develop both deterministic and statistical binary-tree models to study the delay performance of the multicast signaling algorithms. The deterministic model is used to derive the expressions of each path's feedback roundtrip time in a multicast tree, while the statistical model is employed to derive the general probability distributions of each path becoming the multicast-tree bottleneck. Using these models, we analyze and contrast the signaling delay scalability of two representative multicast signaling protocols-the Soft-Synchronization Protocol (SSP) and the Hop-By-Hop (HBH) scheme-m-by deriving the first and second moments of multicast signaling delays. Also derived is the optimal flow-control update interval for SSP to minimize the multicast signaling delay.

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

feedback roundtrip time (rtt)
feedback-synchronization signaling
soft-synchronization protocol (ssp)


A study of the use of the laptop XO in Brazilian pilot schools This article presents a study on the perception of 63 students and 15 teachers of two Brazilian public school, which took part in the pilot test of the OLPC educational laptop XO. For the students, the XO turned classes more attractive mainly because they changed from individual learning to collective research. The internet, the games and the learning aid are the most important XO's functionalities but gender and age impacted the results. Boys value the laptop for its recreation attribute while girls use the computer for interaction with people and to improve learning at school. Younger students like mostly the games while the older ones value the social interaction and research. The XO design is suitable for students under 6 years old but considered too toyful by the older ones. Rather than an educational tool, the students recognize the XO as a means of communication/entertainment. Despite an initial resistance to the OLPC project, the teachers understand that the introduction of a laptop as a pedagogical tool was worthy, because it enhanced learning, communication and social skills. Technical problems should be override and a sustainability plan should be promoted before the educational project is implemented countrywide. (C) 2013 Elsevier Ltd. All rights reserved.

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

education
digital inclusion
user's perception


on reducing energy-consumption by late-inserting instructions into the issue queue In the presence of a long-latency instruction as a L2 miss, the issue queue (IQ) may fill with instructions dependent on the L2 miss; consequently, the IQ will not expose instruction-level parallelism until resolving the miss. In the scope of memory-latency tolerant processors, we propose delaying the insertion into the IQ of the instructions dependent on load instructions predicted to miss L2. These instructions will be stored in an instruction buffer instead of being inserted in the IQ. After resolving the L2 miss, the dependent instructions will be inserted into the IQ. Results show that the proposal reduces the total number of replays from 37\% (integer benchs) to 61\% (floating-point benchs), the average performance degradation is, at most, 2\%, and the average overall-chip energy-consumption reduction is around 8\% in FP benchs.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 consumption
l2 hit-miss prediction
memory-latency tolerant processors


an access control model for querying xml data In the last few years, an increasing amount of si-structured data have become available electronically to humans and programs. In such a context, XML is rapidly erging as the new standard for si-structured data representation and exchange on the Internet. Securing XML data is then becoming increasingly important and several attpts at developing methods for securing XML data have been proposed. However, these proposals do not take into consideration scenarios where users want to query XML data by using complex query language.In this paper, we propose an extension to our previous access control model handling the new standard query language XQuery , which is a powerful and convenient language designed for querying XML data.

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


Multi-dimensional color image storage and retrieval for a normal arbitrary quantum superposition state Multi-dimensional color image processing has two difficulties: One is that a large number of bits are needed to store multi-dimensional color images, such as, a three-dimensional color image of \(1024 \times 1024 \times 1024\) needs \(1024 \times 1024 \times 1024 \times 24\)bits. The other one is that the efficiency or accuracy of image segmentation is not high enough for some images to be used in content-based image search. In order to solve the above problems, this paper proposes a new representation for multi-dimensional color image, called a \((n\,+\,1)\)-qubit normal arbitrary quantum superposition state (NAQSS), where \(n\) qubits represent colors and coordinates of \({2^n}\) pixels (e.g., represent a three-dimensional color image of \(1024 \times 1024 \times 1024\) only using 30qubits), and the remaining 1qubit represents an image segmentation information to improve the accuracy of image segmentation. And then we design a general quantum circuit to create the NAQSS state in order to store a multi-dimensional color image in a quantum system and propose a quantum circuit simplification algorithm to reduce the number of the quantum gates of the general quantum circuit. Finally, different strategies to retrieve a whole image or the target sub-image of an image from a quantum system are studied, including Monte Carlo sampling and improved Grovers algorithm which can search out a coordinate of a target sub-image only running in \(O(\sqrt{N/r} )\) where \(N\) and \(r\) are the numbers of pixels of an image and a target sub-image, respectively.

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

quantum image processing
image retrieval
grover search algorithms
quantum computing


Mining Concept Sequences from Large-Scale Search Logs for Context-Aware Query Suggestion Query suggestion plays an important role in improving usability of search engines. Although some recently proposed methods provide query suggestions by mining query patterns from search logs, none of them models the immediately preceding queries as context systematically, and uses context information effectively in query suggestions. Context-aware query suggestion is challenging in both modeling context and scaling up query suggestion using context. In this article, we propose a novel context-aware query suggestion approach. To tackle the challenges, our approach consists of two stages. In the first, offline model-learning stage, to address data sparseness, queries are summarized into concepts by clustering a click-through bipartite. A concept sequence suffix tree is then constructed from session data as a context-aware query suggestion model. In the second, online query suggestion stage, a user's search context is captured by mapping the query sequence submitted by the user to a sequence of concepts. By looking up the context in the concept sequence suffix tree, we suggest to the user context-aware queries. We test our approach on large-scale search logs of a commercial search engine containing 4.0 billion Web queries, 5.9 billion clicks, and 1.87 billion search sessions. The experimental results clearly show that our approach outperforms three baseline methods in both coverage and quality of suggestions.

O O O 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 B I O O O O O O O O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
experimentation
context-aware
click-through data


Killing epsilons with a dagger: A coalgebraic study of systems with algebraic label structure We propose an abstract framework for modelling state-based systems with internal behaviour as e.g. given by silent or ?-transitions. Our approach employs monads with a parametrized fixpoint operator to give a semantics to those systems and implement a sound procedure of abstraction of the internal transitions, whose labels are seen as the unit of a free monoid. More broadly, our approach extends the standard coalgebraic framework for state-based systems by taking into account the algebraic structure of the labels of their transitions. This allows to consider a wide range of other examples, including Mazurkiewicz traces for concurrent systems and non-deterministic transducers.

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

parametrized fixpoint operator
mazurkiewicz traces

coalgebras on kleisli categories
trace semantics
epsilon transitions
non-deterministic transducers


Radial basis function networks for fast contingency ranking This paper presents an artificial neural network-based approach for static-security assessment. The proposed approach uses radial basis function (RBF) networks to predict the system severity level following a given list of contingencies. The RBF networks are trained off-line to capture the nonlinear relationship between the pre-contingency line flows and the post-contingency severity index. A method based on mutual information is proposed for selecting the input features of the networks. Mutual information has the advantage of measuring the general relationship between the independent variables and the dependent variable as against the linear relationship measured by the correlation-based methods. The performance of the proposed approach is demonstrated through contingency ranking in IEEE 30-bus test system.

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

static-security
radial basis function network


Using SMCD to reduce inconsistencies in misuse case models: A subject-based empirical evaluation This paper presents a subject-based empirical evaluation of the SMCD structure. It evaluates whether SMCD can be used by its potential users to improve consistency in misuse case models. Results show that the use of SMCD helps improve consistency in misuse case models.

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


Mapping Cognitive Radio System Scenarios into the TVWS Context Cognitive Radio has been one of the key research topics in the wireless community for about 10years. The digital switch-over in the TV bands provides opportunities for Cognitive Radio Systems (CRS) to operate in the 470790MHz spectrum under incumbent protection restrictions. Locally unused spectrum in this band is often referred to as TV whitespace (TVWS). Regulatory bodies, in particular the US Federal Communications Commission (FCC) and Ofcom in the UK, have specified parameters under which CRS shall operate. In this paper we analyse key scenarios for CRS stemming from the QoSMOS project. We then analyse how these scenarios can be mapped into the TV whitespace (TVWS) context by considering link budget computation based on FCC and Ofcom transmit power recommendations plus statistical propagation models for the UHF band. We also consider the expected capacity which can be achieved when using TVWS as a capacity extension in an LTE network. We also show how cognitive femtocells can be used to provide outdoor coverage when deployment is based on random location. We eventually conclude on the most promising scenarios in the context of the TVWS usage.

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


The ERICA switch algorithm for ABR traffic management in ATM networks This paper describes the "explicit rate indication for congestion avoidance" (ERICA) scheme for rate-based feedback from asynchronous transfer mode (ATM) switches. In ERICA, the switches monitor their load on each link and determine a load factor, the available capacity, and the number of currently active virtual channels. This information is used to advise the sources about the rates at which they should transmit. The algorithm is designed to achieve high link utilization with low delays and fast transient response. It is also fair and robust to measurement errors caused by the variations in ABR demand and capacity. We present performance analysis of the scheme using both analytical arguments and simulation results. The scheme is being considered for implementation by several ATM switch manufacturers.

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


Coil connections and winding factors in flux-switching PM brushless AC machines Purpose - The purpose of this paper is to analyze the phase coil connections and winding factors of flux-switching permanent magnet (FSPM) brushless AC machines with all poles and alternate poles wound, and different combinations of stator and rotor pole numbers. Design/methodology/approach - The coil-emf vectors, which are widely used for analyzing the conventional fractional-slot PM machines with non-overlapping windings, are employed for FSPM machines. Findings - Although the coil-emf vectors have been employed to obtain coil connections in the conventional fractional-slot PM machines, they are different in FSPM machines. It is mainly due to different polarities in the stator of FSPM machines. In addition, from the coil-emf vectors it is able to predict whether the back-emf waveforms are symmetrical or asymmetric. Originality/value - This is the first time that coil-emf vectors are used to determine the coil connections and winding factors in FSPM machines with different topologies and combination of stator and rotor pole numbers.

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


An Adaptive Energy-Efficient and Low-Latency MAC Protocol for Wireless Sensor Networks In this paper, an adaptive MAC protocol (variable load adaptive (VLA)-MAC) is proposed for wireless sensor networks. This protocol can achieve high energy efficiency and provide low latency under variable-traffic-load conditions. In the case of VLA-MAC, traffic load is measured online and used for adaptive adjustment. Sensor nodes transmit packets in bursts under high load conditions to alleviate packet accumulation and reduce latency. This also removes unnecessary listen action and decreases energy consumption in low load conditions. Simulation results show that the energy efficiency, latency, and throughput achieved by VLA-MAC are higher than those achieved by some traditional approaches.

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

burst transmission
selective wake-up schedule
variable load adaptive (vla)-mac


A multimodal alignment framework for spoken documents We present a multimodal document alignment framework, which highlights existing alignment relationships between documents that are discussed and recorded during multimedia events such as meetings. These relationships that should help indexing the archives of these events are detected using various techniques from natural language processing and information retrieval. The main alignment strategies studied are based on thematic, quotation and reference relationships. At the analysis level, the alignment framework was applied at several levels of granularity of documents, requiring specific document segmentation techniques. Our framework that is language independent was evaluated on corpora in French and English, including meetings and scientific presentations. The satisfactory evaluation results obtained at several stages show the importance of our approach in bridging the gap between meeting documents, independently from the language and domain. They highlight also the utility of the multimodal alignment in advanced applications, e.g. multimedia document browsing, content-based / temporal-based searching, etc.

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

document structure
thematic alignment
quotation alignment
reference alignment


adaptive cutaways for comprehensible rendering of polygonal scenes In 3D renderings of complex scenes, objects of interest may be occluded by those of secondary importance. Cutaway renderings address this problem by omitting portions of secondary objects so as to expose the objects of interest. This paper introduces a method for generating cutaway renderings of polygonal scenes at interactive frame rates, using illustrative and non-photorealistic rendering cues to expose objects of interest in the context of surrounding objects. We describe a method for creating a view-dependent cutaway shape along with modifications to the polygonal rendering pipeline to create cutaway renderings. Applications for this technique include architectural modeling, path planning, and computer games.

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

npr
distance transform
visibility
cutaway diagram


Framework for minimum user participation rate determination to achieve specific demand response management objectives in residential smart grids ? A framework to determine minimum user participation to achieve specific DRM objectives. Methodologies to tradeoff participation rate and inconvenience of participating users. Development of appropriate inconvenience indexes for flexible loads. A data-set of household power consumption matching a given aggregated load profile shape. A step towards designing incentives to attract enough users to achieve desired objectives.

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

demand side management
smart energy systems


Bayesian classification for the selection of in vitro human embryos using morphological and clinical data In vitro fertilization (IVF) is a medically assisted reproduction technique that enables infertile couples to achieve successful pregnancy. Given the uncertainty of the treatment, we propose an intelligent decision support system based on supervised classification by Bayesian classifiers to aid to the selection of the most promising embryos that will form the batch to be transferred to the womans uterus. The aim of the supervised classification system is to improve overall success rate of each IVF treatment in which a batch of embryos is transferred each time, where the success is achieved when implantation (i.e. pregnancy) is obtained. Due to ethical reasons, different legislative restrictions apply in every country on this technique. In Spain, legislation allows a maximum of three embryos to form each transfer batch. As a result, clinicians prefer to select the embryos by non-invasive embryo examination based on simple methods and observation focused on morphology and dynamics of embryo development after fertilization. This paper proposes the application of Bayesian classifiers to this embryo selection problem in order to provide a decision support system that allows a more accurate selection than with the actual procedures which fully rely on the expertise and experience of embryologists. For this, we propose to take into consideration a reduced subset of feature variables related to embryo morphology and clinical data of patients, and from this data to induce Bayesian classification models. Results obtained applying a filter technique to choose the subset of variables, and the performance of Bayesian classifiers using them, are presented.

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

decision support systems
feature subset selection
ivf outcome prediction


Corporate LinkedIn practices of Eurozone companies Purpose - The aim of this study is to analyse the extent to which Eurozone companies use the social network LinkedIn, how they manage their online practices, what is their typical audience, and which are the potential factors influencing both extent and audience. Design/methodology/approach - To examine how stakeholder engagement is managed by using LinkedIn, a sample of 306 companies listed in the STOXX Europe 600 index, including 19 subsectors and 12 countries, is analysed. To measure the extent of LinkedIn usage, an index was defined and calculated on a scale from 0 to 5. Findings - Although the majority of the companies (79 per cent) do use LinkedIn, they mainly focus on a particular group of stakeholders: current and potential employees. Their focus is thus mostly related to professional purposes such as providing information about employees and career opportunities. Just a few of them engage in blogging or updating statuses. Only a very small number of companies are using this platform for marketing or other purposes. The findings also show that the audience of a corporate LinkedIn channel is influenced by the extent of usage of that channel as well as by the size of the company. Originality/value - This study is the first one providing an overview of Eurozone companies' practices on LinkedIn. Hence both academics and professionals can benefit from this research.

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

stakeholder engagement
linkedin
eurozone companies


Education journals: Two decades of change and implications for the field The authors sought to systematically examine patterns of change over time, as well as current variations, in educational journal specifications and publishing, including higher education. The 100 journals in this sample included research and practitioner venues across a range of subdomains and specializations. The authors gathered data for 3 points in time, at 10-year intervals during a 20-year period, from 19892009. They examined the following in detail: journal profiles for publishing characteristics, submission specifications for manuscript parameters, and full-text published manuscripts for compliance with specifications. All were analyzed as point-in-time comparisons as well as trajectories of change over time. Journal profiles demonstrated patterns of increased centralization and digitization, inclusiveness of readership, increased frequency of issues, and increased length of articles. Key findings for manuscript parameter trends included increased specificity of detail, range of manuscript types and research designs accepted, and average manuscript length. In addition, journals have more explicitly specified elements previously left implicit, such as professional and ethical standards. Criteria for submission procedures and manuscript quality are consistent with university faculty performance standards for productivity and technological advancement. Findings carry implications for publishing, journal management, faculty work, and performance evaluation.

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


Two new approaches for assessing the weights of fuzzy opinions in group decision analysis ? The aggregation of fuzzy opinions is an important component of group decision analysis with fuzzy information. This paper proposes two new approaches for the assessment of the weights to be associated with fuzzy opinions. These approaches involve, respectively, the minimization of the sum of squared distances from one weighted fuzzy opinion to another, which is called the least squares distance method (LSDM), and the minimization of the sum of squared differences between the defuzzified values of any two weighted fuzzy opinions, which is called the defuzzification-based least squares method (DLSM). The two approaches are developed and numerical examples are presented to illustrate their simplicity and effectiveness in aggregating fuzzy opinions.

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

fuzzy opinion
aggregation of fuzzy opinions

fuzzy group decision analysis
defuzzification


Clustering-based hierarchical radiosity for dynamic environments This paper extends hierarchical radiosity and clustering techniques to dynamic environments, in which dynamic manipulations, such as repositioning an object and changing surface attributes, are repeatedly applied. The cluster techniques can be effective in reducing the computational complexity of both initial linking creation and link updating of dynamic manipulations. When the object is repositioned in a dynamic environment, the affected links, both energy and cluster links, can be identified rapidly by means of our proposed new strategy. As,the total net energy of the environment is decreased, we exploit the so-called history links to un-refine the affected patches. An effective progressive refinement strategy is also applied to further avoid the creation of unnecessary links.

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

hierarchical radiosity
dynamic environments
clustering

global illumination
virtual environments
interactivity


dominant critical gate identification for power and yield optimization in logic circuits With increasing process variations, low-V T swapping is an effective technique that can be used to improve timing yield without having to modify a design following placement and routing. Gate criticality, defined as the probability that a gate lies on a critical path, forms the basis for existing low-V T swapping techniques. This paper presents a simulation-based study that challenges the effectiveness of low-V T swapping based on the conventional definition of gate criticality, especially as random process variations increase with technology scaling. We introduce dominant gate criticality to address the drawbacks of the conventional definition of gate criticality, and formulate dominant critical gate ranking in the presence of process variations as an optimization problem. Simulation results for 12 benchmark circuits from the ISCAS and OpenSPARC suites to achieve timing yields of 95\% and 98\% indicate that low-V T swapping based on dominant gate criticality reduces leakage power overhead by 61\% and 42\% for independent and correlated process variations, respectively, over low-V T swapping based on conventional gate criticality.

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


SYMBIOTIC EVOLUTION OF RULE BASED CLASSIFIER SYSTEMS Evolutionary Algorithms are vastly used in development of rule based classifier systems in data mining where the rule base is usually a set of If-Then rules and an evolutionary trait develops and optimizes these rules. Genetic Algorithm is usually a favorite solution for such tasks as it globally searches for good rule-sets without any prior bias or greedy force, but it is usually slow. Also, designing a good genetic algorithm for rule base evolution requires the design of a recombination operator that merges two rule bases without disrupting the functionalities of each of them. To overcome the speed problem and the need to design recombination operator, this paper presents a novel algorithm for rule base evolution based on natural process of symbiogenesis. The algorithm uses symbiotic combination operator instead of traditional sexual recombination operator of genetic algorithms. This operator takes two chromosomes with different number of genes ( rules here) and merges them by combining all the information content of both chromosomes. Using this operator results in two major advantages: First, it totally removes the need to design the recombination operator and therefore is easier to use; second, it outperforms traditional genetic algorithm both in emergence speed and classification rate, this is tested and presented on some globally used benchmarks.

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

symbiotic evolution
rule based classifier


The optimization paradigm in engineering design: promises and challenges Formal design optimization involves application of mathematical optimization techniques to models derived from engineering science, often presented as computer simulations. Industry use of design optimization tools is now widespread and sophisticated. As the size and complexity of design problems addressed with these formal methods increase, so do the challenges for successful implementations. Based on the author's experiences, after briefly reviewing the mathematical challenges involved, the article describes several problem areas where optimization technology is likely to have a major impact in the development of improved artifacts in the coming years. These include conceptual and topological design, large complex systems, smart products, and enterprise-wide product design.

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

surrogate models
topology design
decomposition
optimal control
platform design


off-line handwriting recognition system based on ga and visual encoding Our day, the communication technology has been progressed. The handwriting is one of the most familiar communication media. Both online and off line recognition of the handwriting are largely presented in literature. In this paper, we proceed to reconstruct the temporally order from the scanned handwritten Arabic words. We used the GA system to recognize the handwritten words. The input signal presents a string of visual codes. Note that the last one can be either directly collected from a PDA or it can be the restored signal from an image of handwritten script. To validate our approach we used the IfN/ENIT dataset.

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

ifn/enit-database
off-line handwriting recognition
ga algorithms


sketching probabilistic data streams The management of uncertain, probabilistic data has recently emerged as a useful paradigm for dealing with the inherent unreliabilities of several real-world application domains, including data cleaning, information integration, and pervasive, multi-sensor computing. Unlike conventional data sets, a set of probabilistic tuples defines a probability distribution over an exponential number of possible worlds (i.e., "grounded", deterministic databases). This "possibleworlds" interpretation allows for clean query semantics but also raises hard computational problems for probabilistic database query processors. To further complicate matters, in many scenarios (e.g., large-scale process and environmental monitoring using multiple sensor modalities), probabilistic data tuples arrive and need to be processed in a streaming fashion; that is, using limited memory and CPU resources and without the benefit of multiple passes over a static probabilistic database. Such probabilistic data streams raise a host of new research challenges for stream-processing engines that, to date, remain largely unaddressed. In this paper, we propose the first space- and time-efficient algorithms for approximating complex aggregate queries (including, the number of distinct values and join/self-join sizes) over probabilistic data streams. Following the possible-worlds semantics, such aggregates essentially define probability distributions over the space of possible aggregation results, and our goal is to characterize such distributions through efficient approximations of their key moments (such as expectation and variance). Our algorithms offer strong randomized estimation guarantees while using only sublinear space in the size of the stream(s), and rely on novel, concise streaming sketch synopses that extend conventional sketching ideas to the probabilistic streams setting. Our experimental results verify the effectiveness of our approach.

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

pervasive
sensor
streams
information integration
probability
paper
management
probabilistic database
data cleaning
research
values
space
interpretation
size
aggregate
sketching
data
process
queries
query

challenge
scenario
estimates
applications
efficiency
large-scale
approximation
computation
domain
timing
randomization
processor
experimentation
modal
semantic
memorialized
complexity
data streams
algorithm
distributed
monitor
stream processing
effect
database
resource
uncertain data


A nonlinear soft sensor based on multivariate smoothing procedure for quality estimation in distillation columns An accurate on-line measurement of quality variables are essential for the successful monitoring and control tasks in chemical process operations. However, due to the measurement difficulties such as the large time delays, the soft sensor, an inferential model, for the target quality variable, has been widely used as an alternative for the physical sensors. Partial least-squares (PLS) was used to develop a soft sensor because it can handle the correlations among many variables. However, the successful applications of linear projection methods like PLS were limited to only the cases without strong nonlinearities. This paper proposes a design methodology to build a soft sensor for chemical processes that can handle the correlations among many process variables and nonlinearities based on smoothness concept. The method has been directly motivated by the locally weighted regression that estimates a regression surface through multivariate smoothing. The proposed method will be illustrated by comparisons with other familiar methods. The industrial case studies have shown that the proposed method gives a better or equal performances over other methods such as PLS, nonlinear PLS and artificial neural networks. (C) 2000 Elsevier Science Ltd. All rights reserved.

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


instructional design theory provides insights into evolving information technology technical curricula One of the challenges of university technological education is the constant evolution of new technologies in most high-tech disciplines. Nowhere is this more apparent than in computer-oriented disciplines that are subject to Moore's Law. New developments require frequent updating of college curricula in many fields, with the concomitant additional load on faculty members to not only constantly update their technical knowledge but to constantly invest effort into updating curricula to provide students with a sound and relevant education. Instructional Design (ID) is the educational discipline focused on the theoretical and practical problems inherent in designing curricula. As such ID has developed a number of theories and methodologies that have a bearing on the problem of rapidly changing curricula. In particular some newer evolving theories of viewing instructional design in terms of abstract layers offers a powerful paradigm that will help technology curriculum designers.There is a useful model in the work of Stewart Brand in analyzing how buildings are built in layers that age differently. His work is related to Christopher Alexander's seminal exposition on the design of buildings, which inspired the development of Design Patterns in software design. These approaches also lead to new theoretical approaches in technical educational design.These design theories enable viewing curriculum design in a layered context and thus lead to paradigms which enable updating technical courses to cater for evolutionary changes without having to completely redesign courses. This promises both better instruction and less development effort for course designers.Several related theories relating to this work with some discussion of the practical applications to creating Information Technology curricula are discussed in this paper.

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

instructional design theory
curriculum design

moore's law
uml
technology evolution
learning theory


user biased document language modelling Capitalizing on the intuitive underlying assumptions of Language Modelling for Ad-Hoc Retrieval we present a novel approach that is capable of injecting the user's context of the document collection into the retrieval process. The preliminary findings from the evaluation undertaken suggest that improved IR performance is possible under certain circumstances. This motivates further investigation to determine the extent and significance of this improved performance.

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


A parametric family of two ranked objects auctions: equilibria and associated risk This paper deals with simultaneous auctions of two commonly ranked objects following the model studied in Menezes and Monteiro (J. Real Estate Finance Econ., 17(3):219232, 1998). For these problems we introduce a parametric family of auction mechanisms which includes the three classic auctions (discriminatory-price auction, uniform-price auction and Vickrey auction) and we call it the \(\mathcal{DUV}\) family. We provide the unique Bayesian Nash equilibrium for each auction in \(\mathcal{DUV}\) and prove a revenue equivalence theorem for the parametric family. Likewise, we study the value at risk of the auctioneer as a reasonable decision criterion to determine which auctions in \(\mathcal{DUV}\) may be better taking into account the interests of the auctioneer. We show that there are auction mechanisms in \(\mathcal{DUV}\) which are better than the classic auction mechanisms with respect to this criterion.

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


Modeling of the energies and splitting of the Q(x) and Q(y) bands in positional isomers of zinc pyridinoporphyrazines by TDDFT approach: Can TDDFT help distinguishing the structural isomers? Electronic structures, energies and splitting of the Q(x) and Q(y) bands for positional isomers of zinc mono, di-, tri-, and tetra pyridinoporphyrazines as well as parent zinc phthalocyanine were investigated using density functional theory (DFT) and time-dependent (TD) DFT approaches. The influence of the Hartree-Fock exchange on excited state energies and Q(x) and Q(y) bands splitting were studied using GGA BP86 and hybrid B3LYP and PBE1PBE exchange-correlation functionals. Solvent effects were estimated using the polarized continuum model (PCM) approach and cyclohexane, toluene, or DMSO as solvents. It was found that general trends in the Q(x) and Q(y) band energies and splitting correlate very well with the available experimental data on pyridinoporphyrazines and follow the trends in HOMO-LUMO and HOMO-LUMO + 1 energy gaps as well as LUMO-LUMO + 1 splitting. TDDFT trends allow estimation of the Q(x) and Q(y) band energies and splitting in unknown tripyridinoporphyrazines and in individual positional isomers of tetrapyridinoporphyrazines. (C) 2013 Elsevier Inc. All rights reserved.

O O O O O O O O O O O O O O O O O B O B O O B O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O 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 O O O O O O O O O O O O O O O O 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 O O O O O 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 novel competitive learning technique for the design of variable-rate vector quantizers with reproduction vector training in the wavelet domain This paper presents a novel competitive learning algorithm for the design of variable-rate vector quantizers (VQs). The algorithm, termed variable-rate competitive learning (VRCL) algorithm, designs a VQ having minimum average distortion subject to a rate constraint. The VRCL performs the weight vector training in the wavelet domain so that required training time is short. In addition, the algorithm enjoys a better rate-distortion performance than that of other existing VQ design algorithms and competitive learning algorithms. The learning algorithm is also more insensitive to the selection of initial codewords as compared with existing design algorithms. Therefore, the VRCL algorithm can be an effective alternative to the existing variable-rate VQ design algorithms for the applications of signal compression.

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

neural networks
vector quantization
image coding
image processing


Double Cut and Join with Insertions and Deletions Many approaches to compute the genomic distance are still limited to genomes with the same content, without duplicated markers. However, differences in the gene content are frequently observed and can reflect important evolutionary aspects. While duplicated markers can hardly be handled by exact models, when duplicated markers are not allowed, a few polynomial time algorithms that include genome rearrangements, insertions and deletions were already proposed. In an attempt to improve these results, in the present work we give the first linear time algorithm to compute the distance between two multichromosomal genomes with unequal content, but without duplicated markers, considering insertions, deletions and double cut and join (DCJ) operations. We derive from this approach algorithms to sort one genome into another one also using DCJ operations, insertions and deletions. The optimal sorting scenarios can have different compositions and we compare two types of sorting scenarios: one that maximizes and one that minimizes the number of DCJ operations with respect to the number of insertions and deletions. We also show that, although the triangle inequality can be disrupted in the proposed genomic distance, it is possible to correct this problem adopting a surcharge on the number of non-common markers. We use our method to analyze six species of Rickettsia, a group of obligate intracellular parasites, and identify preliminary evidence of clusters of deletions.

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


reducing maintenance complexity of user-centric web portrayal services With the success of applications providing geospatial 3D data to end-users via virtual globes and web-based services, the need for accessing more accurate and up-to-date information has come up. Geodata typically comes from different and unrelated sources, whereas users expect a seamless view which respects their specific needs. A modern geo portrayal service therefore has to deliver information from heterogeneous data sources adapted to specific applications. Each data model introduces limitations that might make it harder to fulfil user requirements. Since in practise user requirements constantly change and data sets are updated, the complexity of configuring and adminstering such a process increases disproportionately to both the number of requirements and data model limitations. To overcome this situation, we outline an approach which seeks to avoid what we call the explosion of interdependencies between formalized requirements and geodata features. Our goal is to keep original data virtually untouched while delivering adapted data to multiple users with specific portrayal requirements. We therefore introduce an intermediate representation (IR) to alleviate the growing complexity of interdependencies from O ( n m ) to O ( n + m ). We adapt this technique to the geospatial domain, deriving a prototypical implementation of an OGC Web 3D Service which delivers X3D documents. The service is capable of adapting to user requirements and at the same time serving originally heterogeneous geodata. We introduce the implementation, discuss results and application opportunities.

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

complexity reduction
w3ds
rapid mapping
web-based portrayal
rule-based system


Synaptic plasticity model of a spiking neural network for reinforcement learning This paper presents a reward-related synaptic modification method of a spiking neuron model. The proposed algorithm determines which synapse is eligible for reinforcement by a reward signal. According to the proposed algorithm, a synapse is determined to be eligible when a presynaptic spike occurs shortly before a postsynaptic spike. A pre- and postsynaptic spike correlator (PPSC) is defined and used to determine synaptic eligibility, and to modify synaptic efficacy in cooperation with a reward signal. A simulation is conducted to demonstrate how the interaction between the PPSC and the reward signal influences synaptic plasticity.

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

spiking neural network
synaptic plasticity
reinforcement learning


A model for short alpha-neurotoxin bound to nicotinic acetylcholine receptor from Torpedo californica: Comparison with long-chain alpha-neurotoxins and alpha-conotoxins Short-chain alpha-neurotoxins from snakes are highly selective antagonists of the muscle-type nicotinic acetylcholine receptors (nAChR). Although their spatial structures are known and abundant information on topology of binding to nAChR is obtained by labeling and mutagenesis studies, the accurate structure of the complex is not yet known. Here, we present a model for a short a-neurotoxin, neurotoxin 11 from Naja oxiana (NTH), bound to Torpedo californica nAChR. It was built by comparative modeling, docking and molecular dynamics using H-1 NMR structure of NTH, cross-linking and mutagenesis data, cryoelectron microscopy structure of Torpedo marmorata nAChR [Unwin, N., 2005. Refined structure of the nicotinic acetylcholine receptor at 4 A resolution. J. Mol. Biol. 346, 967-9891 and X-ray structures of acetylcholine-binding protein (AChBP) with agonists [Celie, P.H., van Rossum-Fikkert, S.E., van Dijk, W.J., Brejc, K., Smit, A.B., Sixma, T.K., 2004. Nicotine and carbamylcholine binding to nicotinic acetylcholine receptors as studied in AChBP crystal structures. Neuron 41 (6), 907-914] and antagonists: alpha-cobratoxin, a long-chain at-neurotoxin [Bourne, Y., Talley, T.T., Hansen, S.B., Taylor, R, Marchot, R, 2005. Crystal structure of Cbtx-AChBP complex reveals essential interactions between snake alpha-neurotoxins and nicotinic receptors. EMBO J. 24 (8), 1512-1522] and alpha-conotoxin [Celie, P.H., Kasheverov, I.E., Mordvintsev, D.Y., Hogg, R.C., van Nierop, P, van Elk, R., van Rossum-Fikkert, S.E., Zhmak, M.N., Bertrand, D., Tsetlin, V., Sixma, T.K., Smit, A.B., 2005. Crystal structure of nicotinic acetylcholine receptor homolog AChBP in complex with an alpha-conotoxin PnIA variant. Nat. Struct. Mol. Biol. 12 (7), 582-588]. In complex with the receptor, NTH was located at about 30 A from the membrane surface, the tip of its loop II plunges into the ligand-binding pocket between the alpha/gamma or alpha/delta nAChR subunits, while the loops I and HI contact nAChR by their tips only in a 'surface-touch' manner. The toxin structure undergoes some changes during the final complex formation (for 1.45 rmsd in 15-25 ps according to AMBER'99 molecular dynamics simulation), which correlates with NMR data. The data on the mobility and accessibility of spin- and fluorescence labels in free and bound NTH were used in MD simulations. The binding process is dependent on spontaneous outward movement of the C-loop earlier found in the AChBP complexes with (x-cobratoxin and alpha-conotoxin. Among common features in binding of short- and long alpha-neurotoxins is the rearrangement of aromatic residues in the binding pocket not observed for (alpha-conotoxin binding. Being in general very similar, the binding modes of short- and long alpha-neurotoxins differ in the ways of loop II entry into nAChR. (c) 2005 Elsevier Ltd. All rights reserved.

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

snake three-fingered short alpha-neurotoxin


The diagnosability of triangle-free graphs The ability of identifying all the faulty devices in a multiprocessor system is known as diagnosability. The local diagnosability concerns the local connective substructure in a network. The PMC model is the test-based diagnosis with a processor performing the diagnosis by testing the neighboring processors via the links between them. In this paper, we discuss the diagnosability and the local diagnosability of a triangle-free network under the PMC model. We also propose the local diagnosis algorithms under the PMC model for some specific structures.

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

diagnosability
local diagnosis
pmc model


Identification and analysis of unsatisfactory psychosocial work situations: a participatory approach employing videocomputer interaction A method for psychosocial evaluation of potentially stressful or unsatisfactory situations in manual work was developed. It focuses on subjective responses regarding specific situations and is based on interactive worker assessment when viewing video recordings of oneself. The worker is first video-recorded during work. The video is then displayed on the computer terminal, and the filmed worker clicks on virtual controls on the screen whenever an unsatisfactory psychosocial situation appears; a window of questions regarding psychological demands, mental strain and job control is then opened. A library with pictorial information and comments on the selected situations is formed in the computer. The evaluation system, called PSIDAR, was applied in two case studies, one of manual materials handling in an automotive workshop and one of a group of workers producing and testing instrument panels. The findings indicate that PSIDAR can provide data that are useful in a participatory ergonomic process of change.

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

video-confrontation
job strain
participatory ergonomics


Monte Carlo method for photon heating using temperature-dependent optical properties Couples the Monte Carlo Method of photon transport with heat transfer. Allows for both optical and thermal properties to vary with temperature. Interpolates local optical properties based on local temperatures. Enhances simulation accuracy in systems that undergo large thermal changes.

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

monte carlo
photon transport
heat transfer

temperature-dependent
optical irradiation
laser heating


SEAS, a secure e-voting protocol: Design and implementation This paper presents SEAS, the Secure E-voting Applet System, a protocol for implementing a secure system for potting over computer networks, usable in distributed organizations whose members may range up to dozens of thousands. We consider an architecture requiring the minimum number of servers involved in the validation and voting phases. Sensus, [Cranor L, Cytron RK. Sensor: a security-conscious electronic potting system for the internet. In: Proceedings of HICSS'97. IEEE; 1997. p. 561-70], a well-known e-voting protocol, requires only two servers, namely a validator and a tallier. Even if satisfying most of the security requirements of an e-voting system, Sensus suffers from a vulnerability that allows one of the entities involved in the election process to cast its own votes in place of those that abstain from the vote. SEAS is a portable and flexible system that preserves the limited number of servers of Sensus, but it avoids the mentioned vulnerability. We propose a prototype implementation of SEAS based on Java applet and XML technology. (C) 2005 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

electronic voting
cryptographic protocols


Regularization of noisy ISAR images containing extended features We present a regularization method that employs a cross-entropy functional and which deals with the three issues of complex-valued data, prior information, and noise mitigation. The basic model of this approach is similar to that used in usual maximum a posteriori analysis and allows for a more general relationship between the image and its configuration entropy than that usually employed.

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


An improved voting algorithm for planted (l,d) motif search The planted motif search problem is a classical problem in bioinformatics that seeks to identify meaningful patterns in biological sequences. As an NP-complete problem, current algorithms focus on improving the average time complexity and solving challenging instances within an acceptable time. In this paper, we propose a new exact algorithm CVoting that improves the state-of-the-art Voting algorithm. CVoting uses a new hash technique to reduce the space complexity to O(mn+N(l,d )) and a new pruning technique to reduce the average time complexity to O m 2 nN ( l , d ) 1 4 + 3 l l . Experimental results show that CVoting outperforms competing algorithms, including PMS1, RISOTTO, Voting and Pmsprune, in both space and time: up to an order of magnitude faster and using less memory in solving challenging instances. The software of the proposed algorithm is publicly available at http://staff.ustc.edu.cn/xuyun/motif.

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

planted motif search
exact algorithm
challenging instances


Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm A local search method is often introduced in an evolutionary optimization algorithm, to enhance its speed and accuracy of convergence to optimal solutions. In multi-objective optimization problems, the implementation of local search is a non-trivial task, as determining a goal for local search in presence of multiple conflicting objectives becomes a difficult task. In this paper, we borrow a multiple criteria decision making concept of employing a reference point based approach of minimizing an achievement scalarizing function and integrate it as a search operator with a concurrent approach in an evolutionary multi-objective algorithm. Simulation results of the new concurrent-hybrid algorithm on several two to four-objective problems compared to a serial approach, clearly show the importance of local search in aiding a computationally faster and accurate convergence to the Pareto optimal front.

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

multicriteria optimization
pareto optimality
evolutionary algorithms
hybrid algorithms
achievement scalarizing functions
nsga-ii


Adaptive fuzzy control for differentially flat MIMO nonlinear dynamical systems The paper proposes flatness-based adaptive fuzzy control for uncertain MIMO nonlinear dynamical systems. The considered control scheme based on differential flatness theory extends the class of systems in which indirect adaptive fuzzy control can be applied. To conclude if a dynamical system is differentially flat, the following should be examined: (i) the existence of the flat output, which is a variable that can be written as a function of the system's state variables (ii) the system's state variables and the input can be written as functions of the flat output and its derivatives. Nonlinear systems satisfying the differential flatness property can be written in the Brunovsky (canonical) form via a transformation of their state variables and control inputs. The resulting control signal is shown to contain nonlinear elements, which in case of unknown system parameters can be calculated using neuro-fuzzy approximators. Using Lyapunov stability analysis it is shown that one can compute an adaptation law for the neuro-fuzzy approximators which assures stability of the closed loop. The performance of the proposed flatness-based adaptive fuzzy control scheme is tested through simulation experiments on benchmark nonlinear multi-input multi-output dynamical systems, such as robotic manipulators.

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

adaptive fuzzy control
differential flatness theory
lyapunov stability analysis
robotic manipulators


Oxidized Low-Density Lipoprotein/?2-Glycoprotein I Complexes and Autoantibodies in Patients with Type 2 Diabetes Mellitus Abstract: Diabetes mellitus (DM) is associated with a high incidence of atherosclerotic cardiovascular complications that result from chronic metabolic abnormalities such as hyperglycemia-induced oxidative stress. The oxidative-modification of low-density lipoproteins (oxLDL) and oxLDL/?2-GPI complex formation have been reported in patients with autoimmune disorders. OxLDL/?2-GPI complexes and autoantibodies to these complexes were measured by ELISA in serum samples from 50 type 2 DM patients and 50 age/sex-matched healthy controls. Mean OD for oxLDL/?2-GPI complexes in DM was 0.099 0.065 with 50% of patients reacting above the assay cutoff (P < 0.001 vs. controls). Mean OD for controls was 0.037 0.015 with 2% positives. Thirty-six (72%) DM patients were taking cholesterol-lowering statins and had a significantly lower mean OD complex level (0.092 0.071, P= 0.05) compared to patients not taking statins (0.112 0.05). Mean OD for IgG anti-oxLDL/?2-GPI antibodies in DM was 0.157 0.112, similar to the controls (0.146 0.098, P= 0.328). Increased serum levels of oxLDL/?2-GPI complexes may be a consequence of oxidative stress and LDL modification in DM. Lower levels of oxLDL/?2GPI complexes in DM patients taking statins are in agreement with the antioxidant and antithrombotic properties of these drugs. No significant IgG autoantibody production was observed in this group of DM patients. The interaction of oxLDL with ?2-GPI in circulation suggests the intriguing possibility that oxLDL/?2-GPI complexes may also play a role in the development of atherosclerosis and/or cardiovascular complications in DM.

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

low-density lipoprotein
?2-glycoprotein i


Forward and backward synchronizing algorithms We describe a general framework for constructing synchronizing algorithms. We design currently the best heuristic polynomial synchronizing algorithm. Detailed analysis shows impact of various parameters on the results. Experiments are conducted on much larger automata than in other studies up to date.

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

synchronizing automaton
reset word
reset length
reset sequence
sequential circuit


Performance analysis of IM, DPSK and DQPSK payload signals with frequency swept coherent detected spectral amplitude code labelling We present the performance analysis for frequency swept coherent detection of spectral amplitude code (SAC) labelled switching systems for high-speed payload signals with different modulation formats. We consider a payload bit-rate of 40Gbit/s for an intensity modulation (IM), differential phase shift keying (DPSK), differential quadrature phase shift keying (DQPSK) and 4-channel multi-rate DQPSK payload signals with 2.5, 10, 20 and 80Gb/s rates for comparison purposes. The label and payload signal performances are assessed by the eye-diagram opening factor (EOF) and bit-error rate (BER) as function of the optical signal-to-noise ratio (OSNR). Our proposed SAC label detection method offers flexible, robust and multi-bit-rate label performance for payload signal with different modulation formats.

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

optical signal-to-noise ratio (osnr) measurement


Development of terminology subsets using ICNP For healthcare terminologies to provide coverage of a domain, many have evolved into very large and complex sets, creating a challenge for implementation. The International Classification of Nursing Practice (ICNP) Version 2 has over 2800 concepts. Thus, development of terminology subsets is considered as a potential solution to facilitate implementation. Based on early efforts to develop ICNP Catalogues, or clinically relevant subsets of the terminology, a process model was developed based on the ICNP life cycle. The steps involved in developing a subset are (a) identifying client(s) and health priority, (b) gathering terms and concepts relevant to a given priority, (c) mapping the identified concepts to the ICNP terminology, (d) modeling new concepts, (e) finalizing a Catalogue, and (f) disseminating the Catalogue. The ICNP model was applied to subset development resulting in three ICNP Catalogues: (a) Partnering with Patients and Families to Promote Adherence to Treatment, (b) Palliative Care for Dignified Dying, and (c) Canadian Health Outcomes for Better Information and Care. Although the three Catalogues were very different in the focus of health priority addressed, there are overlapping concepts across the Catalogues ranging from 1.0 to 14.2%. The ICNP process model for Catalogue development can be used by other terminology developers and potentially assist in the creation of subset of ICNP to be used at the electronic health record interface. Further research is needed to address challenges and implications for testing and applications of terminology subsets.

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

international classification for nursing practice (icnp)


citizens' requirement analysis in chinese e-government E-government in China is experiencing a flourish period of development till now. Government delivers high quality services to citizens by means of e-government. However, it shows that in many aspects, some problems occur during the process of e-government construction. In order to facilitate the further development of Chinese e-government, the requirement of citizens as one of the important customers of government should be truly considered and represented.

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


A distributed fault identification protocol for wireless and mobile ad hoc networks ? This paper considers the problem of self-diagnosis of wireless and mobile ad hoc networks (MANETs) using the comparison approach. In this approach, a network (MANET) consists of a collection of n independent heterogeneous mobile or stationary hosts interconnected via wireless links, and it is assumed that at most ? ? of these hosts are faulty. In order to diagnose the state of the MANET, tasks are assigned to pairs of hosts and the outcomes of these tasks are compared. The agreements and disagreements between the hosts are the basis for identifying the faulty ones. The comparison approach is believed to be one of the most practical fault identification approaches for diagnosing hard and soft faults. We develop a new distributed self-diagnosis protocol, called Dynamic-DSDP, for MANETs that identifies both hard and soft faults in a finite amount of time. The protocol is constructed on top of a reliable multi-hop architecture. Correctness and complexity proofs are provided and they show that our Dynamic-DSDP performs better, from a communication complexity viewpoint, than the existing protocols. We have also developed a simulator, that is scalable to a large number of nodes. Using the simulator, we carried out a simulation study to analyze the effectiveness of the self-diagnosis protocol and its performance with regards to the number of faulty hosts. The simulation results show that the proposed approach is an attractive and viable alternative or addition to present fault diagnosis techniques in MANET environments.

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

wireless networks
fault tolerance
distributed algorithms
system-level fault self-diagnosis
comparison-based approach


a performance comparison of object and relational databases using the sun benchmark A general concern about object-oriented systems has been whether or not they are able to meet the performance demands required to be useful for the development of significant production software systems. Attempts to evaluate this assertion have been hampered by a lack of meaningful performance benchmarks that compare database operations across different kinds of databases. In this paper, we utilize the Sun Benchmark [Rube87] as a means for assessing the performance of an object database and comparing it with existing relational systems. We discuss the benchmark, and many of the implementation issues involved in introducing a relationally oriented benchmark into an object-oriented paradigm. We demonstrate the performance of an object database using Ontologic's Vbase object database platform as an example of a commercially available object database, and we compare these benchmark results against those of existing relational database systems. The results offer strong evidence that object databases are capable of performing as well as, or better than, existing relational database systems.

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

software platform systems benchmark performance implementation object demonstrate general evidence paper database

product
examples
developer
operability
relation
object-oriented
comparisons
assert
evaluation
relational database


Simulation of river streams: Comparison of a new technique with QUAL2E Predictions and quality management issues for environmental protection in river basins rely on water-quality models. These models can be used to simulate conditions in or near the range of the calibrated or verified conditions. In this respect, estimation of parameters, which is still practiced by heuristic approaches (i.e. manually), seems to be the point where the attention needs to be focused. The authors' research group has developed a systematic approach for dynamic simulation and parameter estimation in river water quality models, which has eliminated the cumbersome trial-end-error method. This study reports a user-interactive software named as RSDS (River Stream Dynamics and Simulation) for the implementation of the suggested technique, and provides a comparative investigation of the suggested modelling approach against a well established and worldwide known water quality software, QUAL2E. Experimental data collected in field observations along the Yesilirmak river basin in Turkey were checked against the predictions from both software programs. The results indicated that much better agreement with the experimental data could be obtained from RSDS compared with QUAL2E. Thus, the systematic procedure suggested in the present work provides an effective means for reliable estimation of the model parameters and dynamic simulation for river basins, and therefore, contributes to the efforts toward predicting the extent of the effect of possible pollutant discharges in river basins. (c) 2007 Elsevier Ltd. All rights reserved.

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

river water quality
parameter estimation
dynamic simulation
qual2e


A new per-class flow fixed proportional differentiated service for multi-service wireless LAN In this paper, we propose a new per-CLAss Flow fixed proportional differentiated service model (CLAF) and a companioning medium access control scheme for multi-service wireless LANs (WLANs), based on the IEEE 802.11 framework. Different from conventional relative differentiated service, in CLAF, a fixed bandwidth quality ratio is guaranteed on per-class per-flow basis regardless of the traffic load of each service class. Specifically, each service class is assigned a number of separate coordination periods, proportional to the policy-based bandwidth quality ratio for class isolation. Each class is associated with its own contention window size which is dynamically adjusted in accordance with the number of flows in the class in such a way to minimize collision probability between flows of the same class. Simulations results of the CLAF performance as well as a comparison with IEEE 802.11e EDCA including the support of QoS-sensitive VoIP applications are presented. The results show that the proposed scheme outperforms EDCA and achieves better resource utilization efficiency. CLAF can provide users a more predictive, affirmative service guarantees than conventional relative differentiated service like IEEE 802.11e EDCA.

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

differentiated services
quality of service
ieee 802.11


The Tower of Hanoi problem on Path h graphs The generalized Tower of Hanoi problem with h?4 h ? 4 pegs is known to require a sub-exponentially fast growing number of moves in order to transfer a pile of n n disks from one peg to another. In this paper we study the Path h variant, where the pegs are placed along a line, and disks can be moved from a peg to its nearest neighbor(s) only. Whereas in the simple variant there are h(h?1)/2 h ( h ? 1 ) / 2 possible bi-directional interconnections among pegs, here there are only h?1 h ? 1 of them. Despite the significant reduction in the number of interconnections, the number of moves needed to transfer a pile of n n disks between any two pegs also grows sub-exponentially as a function of n n . We study these graphs, identify sets of mutually recursive tasks, and obtain a relatively tight upper bound for the number of moves, depending on h,n h , n and the source and destination pegs.

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

path graphs
analysis of algorithms
subexponential growth rate


The professionalisation of information security: Perspectives of UK practitioners In response to the increased cyber threats to business, the UK and US Governments are taking steps to develop the training and professional identity of information security practitioners. The ambition of the UK Government is to drive the creation of a recognised profession, in order to attract technology graduates and others into the practice of cyber-security. Although much has been written by state bodies and industry commentators alike on this topic, we believe this qualitative study is the first empirical academic work investigating attitudes to that professionalisation amongst information security workers. The results are contextualised using concepts from the literature in the fields of professionalisation and social topics in information security. Despite the movement to establish professional status for their industry, these practitioners showed mixed levels of support for further professionalisation, with a distinctly wary attitude towards full regulation and licensing and an explicit rejection of elitist and exclusive models of profession. Whereas the UK Government looks to establish professional status in order to attract entrants, such status in itself was seen to be of little import to those already working in the area. In addition there are significant tensions between managers embracing business- and human-centred security and those more interested in the technical practice of executing policy. While these tensions continue, the results suggest that state attempts artificially to catalyse the professionalisation process for this group would be precipitate. Historically such projects have risen from the front line; ambitions to move the industry in that direction might see more success by identifying and delegating control to a single regulatory body, founded and respected by the people it aims eventually to regulate.

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

security professional
qualification
certification
socio-technical
graduate


IMPROVING NEURAL NETWORK APPROXIMATIONS IN APPLICATIONS: A CASE STUDY IN MATERIALS SCIENCE The popularity of feed-forward neural networks such as multilayer perceptrons and radial basis function networks is to a large extent due to their universal approximation capability. This paper concerns its theoretical principles, together with the influence of network architecture and of the distribution of training data on this capability. Then, the possibility to exploit this influence in order to improve the approximation capability of multilayer perceptrons by means of cross-validation and boosting is explained. Although in theory, the impact of both methods on the approximation capability of feed-forward networks is known, they are still not common in real-world applications. Therefore, the paper documents usefulness of both methods on a detailed case study in materials science.

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


A posteriori error estimates for the JohnsonNdlec FEMBEM coupling Only very recently, Sayas [The validity of JohnsonNdlec's BEM-FEM coupling on polygonal interfaces. SIAM J Numer Anal 2009;47:345163] proved that the JohnsonNdlecone-equation approach from [On the coupling of boundary integral and finite element methods. Math Comput 1980;35:106379] provides a stable coupling of finite element method (FEM) and boundary element method (BEM). In our work, we now adapt the analytical results for different a posteriori error estimates developed for the symmetric FEMBEM coupling to the JohnsonNdlec coupling. More precisely, we analyze the weighted-residual error estimator, the two-level error estimator, and different versions of (h?h/2)-based error estimators. In numerical experiments, we use these estimators to steer h-adaptive algorithms, and compare the effectivity of the different approaches.

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

finite element-boundary element coupling


Time evolution of circular cellular automata on square lattices Time evolutions of the circular cellular automata (CCA) are studied. The pattern seems to reach a dynamic balance state after several iterations in a fixed space. The time variations of population of each quadrant obey the famous logistic equation. It is found that although the initial patterns axe very sensitive to the location of the first ring and the growth sequence, the dynamic patterns are independent of them. We propose that the CCA model may be used to simulate the evolution of biology.

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

circular cellular automata
time evolution
logistic equation


Processing of Continuous Location-Based Range Queries on Moving Objects in Road Networks With the proliferation of mobile devices, an increasing number of urban users subscribe to location-based services. This trend has led to significant research interest in techniques that address two fundamental requirements: road network-based distance computation and the capability to process moving objects as points of interests. However, there exist few techniques that support both requirements simultaneously. To address these challenges, we propose a novel approach to process continuous range queries. We build on our previous work of an infrastructure that supports location-based snapshot queries on MOVing objects in road Networks (MOVNet). We introduce several significant features to enable continuous queries. The dual index structure that we proposed for MOVNet has been appropriately modified. We further appoint a number of connecting vertices in each cell and precompute the distances among them to expedite query processing. Most importantly, to alleviate the effects of frequent object updates, we introduce a Shortest-Distance-based Tree (SD-Tree). We illustrate that the network connectivity and distance information can be preserved and reused by the SD-Tree when the query point location is updated; hence, reducing the continuous query update cost. Our experimental results demonstrate that our method yields excellent performance with a very large number of moving objects.

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

spatial databases and gis
location-dependent and sensitive


A new nearest neighbor classifier via fusing neighborhood information The nearest neighbor (NN) classification is a classical and yet effective technique in machine learning and data mining communities. However, its performance depends crucially on the distance function used to compute distance between samples. In this paper, we first define the concept of sample?s neighborhood and present two related criteria according to neighborhood influence. Then, the influence of sample?s neighborhood is comprehensively considered when computing the distances between the query and training samples. Finally, we propose an improved nearest neighbor classification algorithm via fusing neighborhood information. The proposed method can precisely characterize the distance among samples as well as enhance the predictive power of classifier to some extent. The experimental results show that the proposed algorithm basically outperforms classical nearest neighbor classifier and some other state-of-the-art classification methods.

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

nearest neighbor classifier
neighborhood information


A Fast HEVC Inter CU Selection Method Based on Pyramid Motion Divergence The newly developed HEVC video coding standard can achieve higher compression performance than the previous video coding standards, such as MPEG-4, H.263 and H.264/AVC. However, HEVC's high computational complexity raises concerns about the computational burden on real-time application. In this paper, a fast pyramid motion divergence (PMD) based CU selection algorithm is presented for HEVC inter prediction. The PMD features are calculated with estimated optical flow of the downsampled frames. Theoretical analysis shows that PMD can be used to help selecting CU size. A k nearest neighboring like method is used to determine the CU splittings. Experimental results show that the fast inter prediction method speeds up the inter coding significantly with negligible loss of the peak signal-to-noise ratio.

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

hevc
inter prediction
motion divergence
video coding


Fast multi-label feature selection based on information-theoretic feature ranking A score function from mutual information between a feature and labels was derived. Unnecessary computations from the score function were discarded. A strategy to identify important labels from sparse label set was proposed. The computational cost of each component was analyzed theoretically.

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

multi-label feature selection
interaction information
entropy


On generalized Fibonacci numbers and k k -distance Kp K p -matchings in graphs In this paper, we give a new interpretation of the generalized Fibonacci numbers and the generalized Lucas numbers also with respect to the total number of Kp K p -matchings in the corona of special graphs. In special cases, we obtain the graph interpretation of the generalized Pell numbers and generalized PellLucas numbers.

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

fibonacci number
lucas number
h h -matching h h h h h
k k -independent set k k k k k
counting


using a planner to support office work Supporting a wide range of activities in offices has been a major objective for designers of office systems. The complex nature of office work and the fact that there are no simple limits on the amount of domain knowledge required to do this work have made the achievement of this objective very difficult. Planning and representation techniques from artificial intelligence appear to have some advantages for this task in terms of flexibility and adaptability. In this paper we describe the POLYMER planning system and representation language. In particular, we point out the system components that are required to make planning useful in real environments. The operation of the system is illustrated using an example activity.

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

point
task
systems
domain knowledge
environments
intelligence
language
support
flexibility
paper
representation

activation adapt examples plan object complexity component


Noise reduction in spine videofluoroscopic images using the undecimated wavelet transform Videofluoroscopy permits using sequences of low quality images to study the spine movement. In this work the problem of enhancing the quality of these images is considered in order to facilitate the extraction of kinematic parameters. The method is based on the undecimated wavelet transform and on a preliminary training of a sub-set of images. The anatomical features are preserved using a mask. Key element of the method is its fast and automated implementation. The concept of improving the extraction of kinematic parameters by improving the image representation instead of the technique to extract these is also innovative. The technique has been tested on two sequences of images and the results demonstrates that the method enhances images not related with training sub-set.

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

videofluoroscopy
spine
undecimated wavelet transform
training


Layout-Based Defect-Driven Diagnosis for Intracell Bridging Defects This paper presents a layout-based methodology to predict the exact physical location of a bridging defect inside a standard cell. It involves a number of techniques. First of all, most likely intracell bridging defects are identified through layout analysis and then converted into equivalent logic models. Next, we use a new defect-oriented formulation to generate test pattern for each candidate defect so as to further enhance the diagnostic resolution. Experimental results indicate that this methodology can remove 90% false defect candidates beyond gate-level diagnosis for four real designs and ISCAS'85 benchmark circuits.

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

automatic test pattern generation (atpg)


Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors We study a new method for proving lower bounds for subclasses of arithmetic circuits. Roughly speaking, the lower bound is proved by bounding the correlation between the coefficients' vector of a polynomial and the coefficients' vector of any product of two polynomials with disjoint sets of variables. We prove lower bounds for several old and new subclasses of circuits: monotone circuits, orthogonal formulas, non-canceling formulas, and noise-resistant formulas. One ingredient of our proof is an explicit map that has exponentially small discrepancy for every partition of the input variables into two sets of roughly the same size. We give two additional applications of this explicit map: to extractors construction and to communication complexity. (C) 2010 Elsevier Inc. All rights reserved.

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