A feedback vertex set of 2-degenerate graphs A feedback vertex set of a graph G is a set S of its vertices such that the subgraph induced by V(G)?S V ( G ) ? S is a forest. The cardinality of a minimum feedback vertex set of G is denoted by ?(G) ? ( G ) . A graph G is 2-degenerate if each subgraph G? G ? of G has a vertex v such that dG?(v)?2 d G ? ( v ) ? 2 . In this paper, we prove that ?(G)?2n/5 ? ( G ) ? 2 n / 5 for any 2-degenerate n-vertex graph G and moreover, we show that this bound is tight. As a consequence, we derive a polynomial time algorithm, which for a given 2-degenerate n -vertex graph returns its feedback vertex set of cardinality at most 2n/5 2 n / 5 .

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


Hybrid Analytical Modeling of Pending Cache Hits, Data Prefetching, and MSHRs This article proposes techniques to predict the performance impact of pending cache hits, hardware prefetching, and miss status holding register resources on superscalar microprocessors using hybrid analytical models. The proposed models focus on timeliness of pending hits and prefetches and account for a limited number of MSHRs. They improve modeling accuracy of pending hits by 3.9x and when modeling data prefetching, a limited number of MSHRs, or both, these techniques result in average errors of 9.5% to 17.8%. The impact of non-uniform DRAM memory latency is shown to be approximated well by using a moving average of memory access latency.

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

performance
analytical modeling
data prefetching
miss status holding register


Autoimmune polyendocrinopathy candidiasis ectodermal dystrophy: known and novel aspects of the syndrome Autoimmune polyendocrinopathy candidiasis ectodermal dystrophy (APECED) is a monogenic autosomal recessive disease caused by mutations in the autoimmune regulator (AIRE) gene and, as a syndrome, is characterized by chronic mucocutaneous candidiasis and the presentation of various autoimmune diseases. During the last decade, research on APECED and AIRE has provided immunologists with several invaluable lessons regarding tolerance and autoimmunity. This review describes the clinical and immunological features of APECED and discusses emerging alternative models to explain the pathogenesis of the disease.

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

apeced
aire
chronic mucocutaneous candidiasis


Numerical solution of a three-dimensional solidification problem in aluminium casting ? In this paper, we consider an enthalpy formulation for a two-phase Stefan problem arising from the solidification of aluminium during casting process. We solve this free boundary problem in a time varying three-dimensional domain and consider convective heat transfer in the liquid phase. The resulting equations are discretized using a characteristics method in time and a finite element method in space, and we propose a numerical algorithm to solve the obtained nonlinear discretized problem. Finally, numerical results are given which are compared with industrial experimental measurements.

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


Definition and recognition of rib features in aircraft structural part In this research, a new type of manufacturing feature that is commonly observed in aircraft structural parts, known as ribs, is defined and implemented using the object-oriented software engineering approach. The rib feature type is defined as a set of constrained and adjacent faces of a part which are associated with a set of specific rib machining operations. Computerized numerical control (CNC) operation experience and the machining knowledge are leveraged by analysing typical geometry interactions when generating machining tool paths where such knowledge and experience are abstracted as rules of process planning. Then those abstracted machining process rules are implemented in a feature recognition algorithm on top of an existing and holistic attribute adjacency graph solution to extract seed faces, identify individual local rib elements and further cluster these newly identified local rib elements into groups for the ease of machining operations. Out of the potentially different combinations of local rib elements, those optimised cluster groups are merged into the top-level rib features. The enhanced recognition algorithm is presented in details. A pilot system has already been developed and applied for machining many advanced aircraft structural parts in a large aircraft manufacturer. Observations and conclusions are presented at the end.

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

feature recognition
rib
aircraft structural part


An algebraic approach to guarantee harmonic balance method using grobner base Harmonic balance (HB) method is well known principle for analyzing periodic oscillations on nonlinear networks and systems. Because the HB method has a truncation error, approximated solutions have been guaranteed by error bounds. However, its numerical computation is very time-consuming compared with solving the HB equation. This paper proposes an algebraic representation of the error bound using Grobner base. The algebraic representation enables to decrease the computational cost of the error bound considerably. Moreover, using singular points of the algebraic representation, we can obtain accurate break points of the error bound by collisions.

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

harmonic balance method
error bound
grobner base
algebraic representation


A Graph Coloring Based TDMA Scheduling Algorithm for Wireless Sensor Networks Wireless sensor networks should provide with valuable service, which is called service-oriented requirement. To meet this need, a novel distributed graph coloring based time division multiple access scheduling algorithm (GCSA), considering real-time performance for clustering-based sensor network, is proposed in this paper, to determine the smallest length of conflict-free assignment of timeslots for intra-cluster transmissions. GCSA involves two phases. In coloring phase, networks are modeled using graph theory, and a distributed vertex coloring algorithm, which is a distance-2 coloring algorithm and can get colors near to \((\updelta +1)\), is proposed to assign a color to each node in the network. Then, in scheduling phase, each independent set is mapped to a unique timeslot according to the sets priority which is obtained by considering network structure. The experimental results indicate that GCSA can significantly decrease intra-cluster delay and increase intra-cluster throughput, which satisfies real-time performance as well as communication reliability.

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


Building Model as a Service to support geosciences Model as a Service (MaaS) concept and architecture is introduced to support geoscience modeling. MaaS enables various geoscience models to be published as services that can be accessed through a simple web interface. MaaS automates the processes of configuring machines, setting up and running models, and managing model outputs. MaaS provides new guidance for geoscientists seeking solutions to address the computing demands for geoscience models.

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

cloud computing
web service
geospatial data
model web
earthcube
big data


Shot change detection using scene-based constraint A key step for managing a large video database is to partition the video sequences into shots. Past approaches to this problem tend to confuse gradual shot changes with changes caused by smooth camera motions. This is in part due to the fact that camera motion has not been dealt with in a more fundamental way. We propose an approach that is based on a physical constraint used in optical flow analysis, namely, the total brightness of a scene point across two frames should remain constant if the change across two frames is a result of smooth camera motion. Since the brightness constraint would be violated across a shot change, the detection can be based on detecting the violation of this constraint. It is robust because it uses only the qualitative aspect of the brightness constraint-detecting a scene change rather than estimating the scene itself. Moreover, by tapping on the significant know-how in using this constraint, the algorithm's robustness is further enhanced. Experimental results are presented to demonstrate the performance of various algorithms. It was shown that our algorithm is less likely to interpret gradual camera motions as shot changes, resulting in a significantly better precision performance than most other algorithms.

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


Tail asymptotics for HOL priority queues handling a large number of independent stationary sources In this paper we study the asymptotics of the tail of the buffer occupancy distribution in buffers accessed by a large number of stationary independent sources and which are served according to a strict HOL priority rule. As in the case of single buffers, the results are valid for a very general class of sources which include long-range dependent sources with bounded instantaneous rates. We first consider the case of two buffers with one of them having strict priority over the other and we obtain asymptotic upper bound for the buffer tail probability for lower priority buffer. We discuss the conditions to have asymptotic equivalents. The asymptotics are studied in terms of a scaling parameter which reflects the server speed, buffer level and the number of sources in such a way that the ratios remain constant. The results are then generalized to the case of M buffers which leads to the source pooling idea. We conclude with numerical validation of our formulae against simulations which show that the asymptotic bounds are tight. We also show that the commonly suggested reduced service rate approximation can give extremely low estimates.

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

bahadur-rao theorem
large deviations
cell loss
stationary processes
tail distributions


A Variant of Parallel Plane Sweep Algorithm for Multicore Systems Parallel algorithms used in Very Large Scale Integration physical design bring significant challenges for their efficient and effective design and implementation. The rectangle intersection problem is a subset of the plane sweep problem, a topic of computational geometry and a component in design rule checking, parasitic resistance-capacitance extraction, and mask processing flows. A variant of a plane sweep algorithm that is embarrassingly parallel and therefore easily scalable on multicore machines and clusters, while exceeding the best-known parallel plane sweep algorithms on real-world tests, is presented in this letter.

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

computational geometry
multicore
physical design
plane sweep
rectangle intersection


The antecedents and consequents of user perceptions in information technology adoption A common theme underlying various models that explain information technology adoption is the inclusion of perceptions of an innovation as key independent variables. Although a fairly significant body of research that empirically tests these models is now in existence, some questions with regard to both the antecedents as well as the consequents of perceptions remain unanswered. This paper reports the results of a field study examining adoption of an information technology innovation represented by an expert systems application. Two research objectives that have both theoretical and practical relevance motivated and guided the study. One, the study challenges an assumption which is implicit in technology acceptance models: that of the non-existence of moderating influences on the relationship between perceptions and adoption decisions. Specifically, the study examines the effects of an important moderating influence personal innovativeness on this relationship. Two, the study seeks to shed further light on the determinants of perceptions by examining the relative efficacy of mass media and interpersonal communication channels in facilitating perception development. Theoretical and practical implications that follow from the results are discussed.

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

information technology adoption
personal innovativeness
communication channels


Improving classification with latent variable models by sequential constraint optimization In this paper we propose a method to use multiple generative models with latent variables for classification tasks. The standard approach to use generative models for classification is to train a separate model for each class. A novel data point is then classified by the model that attributes the highest probability. The algorithm we propose modifies the parameters of the models to improve the classification accuracy. Our approach is made computationally tractable by assuming that each of the models is deterministic, by which we mean that a data-point is associated to only a single latent state. The resulting algorithm is a variant of the support vector machine learning algorithm and in a limiting case the method is similar to the standard perceptron learning algorithm. We apply the method to two types of latent variable models. The first has a discrete latent state space and the second, principal component analysis, has a continuous latent state space. We compare the effectiveness of both approaches on a handwritten digit recognition problem and on a satellite image recognition problem.

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

semi-supervised learning
support vector machines
pca
vector quantization
image and character recognition


A framework for a real time intelligent and interactive Brain Computer Interface ? A framework for a real time implementation of a Brain Computer Interface. Implementation & comparison of different feature extraction methods and classifiers. Accuracy & processing time comparison for detection of event related potentials-ERP. An implementation of a prototype system using the proposed BCI framework. Real time EEG data collection and classification of ERPs using Hex-O-Speller.

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

electroencephalography (eeg)
braincomputer interface (bci)
event-related potentials (erp)


Characterizing output processes of E-m/E-k/1 queues Our goal is to study which conditions of the output process of a queue preserve the Increasing Failure Rate (IFR) property in the interdeparture time. We found that the interdeparture time does not always preserve the IFR property, even if the interarrival time and service time are both Erlang distributions with IFR. We give a theoretical analysis and present numerical results of E-m/E-k/1 queues. We show, by numerical examples, that the interdeparture time of E-m/E-k/1 retains the IFR property if m >= k. (c) 2006 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 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 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

departure process
ph/g/1
erlang distribution
queueing theory


A Low-Complexity Down-Mixing Structure on Quadraphonic Headsets for Surround Audio This work presents a four-channel headset achieving a 5.1-channel-like hearing experience using a low-complexity head-related transfer function (HRTF) model and a simplified reverberator. The proposed down-mixing architecture enhances the sound localization capability of a headset using the HRTF and by simulating multiple sound reflections in a room using Moorer's reverberator. Since the HRTF has large memory and computation requirements, the common-acoustical-pole and zero (CAPZ) model can be used to reshape the lower-order HRTF model. From a power consumption viewpoint, the CAPZ model reduces computation complexity by approximately 40%. The subjective listening tests in this study shows that the proposed four-channel headset performs much better than stereo headphones. On the other hand, the four-channel headset that can be implemented by off-the-shelf components preserves the privacy with low cost.

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

head-related transfer function
virtual loudspeaker
reverberation


Security personalization for internet and web services The growth of the Internet has been accompanied by the growth of Internet services (e.g., e-commerce, e-health). This proliferation of services and the increasing attacks on them by malicious individuals have highlighted the need for service security. The security requirements of an Internet or Pleb service may be specified in a security policy. The provider of the service is then responsible.,for implementing the security measures contained in the policy. However, a service customer or consumer may have security preferences that are not reflected in the provider security policy In order for set-vice providers to attract and retain customers, as well as reach a wider market, a way of personalizing a security policy to a particular customer is needed We derive the content of an Internet or Web service security policy and propose a flexible security personalization approach that will allow an Internet or web service provider and customer to negotiate to an agreed-upon personalized security policy. In addition, we present two application examples of security policy personalization, and overview the design of our security personalization prototype.

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

internet services
personalization
security
web services


Two efficient synchronous double left right arrow asynchronous converters well-suited for networks-on-chip in GALS architectures This paper presents two high-throughput, low-latency converters that can be used to convert synchronous communication protocol to asynchronous one and vice versa. We have designed these two hardware components to be used in a Globally Asynchronous Locally Synchronous clusterized Multi-Processor System-on-Chip communicating by a fully asynchronous Network-on-Chip. The proposed architecture is rather generic, and allows the system designer to make various trade-offs between latency and robustness, depending on the selected synchronizer. We have physically implemented the two converters with portable ALLIANCE CMOS standard cell library and evaluated the architectures by SPICE simulation for a 90 nm CMOS fabrication process. (C) 2007 Elsevier B.V. All rights reserved.

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

globally asynchronous locally synchronous

multi-processor systems-on-chip
networks-on-chip
synchronization
asynchronous fifo


Simulation aided design of organizational structures in manufacturing systems using structuring strategies This paper presents a simulation aided approach for designing organizational structures in manufacturing systems. The approach is based on a detailed modeling and characterization of the forecasted order program, especially of elementary processes, activity networks and manufacturing orders. Under the use of the organization modeling system FORM, that has been developed at the ifab-Institute of Human and Industrial Engineering of the University of Karlsruhe, structuring strategies-e.g., a process-oriented strategy can be applied in order to design organizational structures in manufacturing systems in a flexible and efficient way. Following that, a dynamical analysis of the created manufacturing structures can be carried out with the simulation tool FEMOS, that has also been developed at the ifab-Institute. The evaluation module of FEMOS enables to measure the designed solutions with the help of logistical-e.g., lead time degree and organizational-e.g., degree of autonomy key data. This evaluation is the basis for the identification of effective manufacturing systems and also of improvement potentialities. Finally, a case study is presented in this paper designing and analyzing different organizational structures of a manufacturing system where gear boxes and robot grip arms were manufactured.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 and simulation of manufacturing systems

strategies for production systems design


explicit constructions of selectors and related combinatorial structures, with applications In this paper we present explicit constructions of several combinatorial objects: selectors [CGR00] and selective families [CGGPR00], pseudo-random generators for proof systems [ABRW00] and fixed waking schedules [GPP00]. As a result, we obtain almost optimal deterministic protocols for broadcasting in unknown directed radio networks [CGR00] and wake-up problem [GPP00]. We also show application of selectors (and its variants) to explicit construction of test sets for coin-weighting problems [DH00]. The parameters of our constructions come close to the best known non-constructive bounds. The constructions are achieved using a common technique, which could be of use for other problems.

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


Selective finite element refinement in torsional problems based on the membrane analogy This work presents a selective finite element refinement strategy based on the h-refinement type, in the context of a posteriori error estimates considerations (error computed after the application of the proposed refining scheme), based on a graphical procedure to determine progressively better estimates for the maximum shearing stress in prismatic torsional members. It is structured in an integrated FORTRAN code and DELPHI based environment to refine an initial arbitrary finite element mesh. The proposed procedure is founded on the membrane analogy that exists between membrane deflections and the torsion problem in the sense that the location of the membrane largest gradient drives the refining procedure. It is shown that multiple level application of the proposed method to two members with different cross sectional geometries with known analytic solutions leads to progressively more accurate estimates (< 1.0% error in most cases) for the maximum shearing stresses calculations. Finally, the proposed method is applied to the torsional analysis of an L section member, showing that for this practical case the procedure results in a very accurate calculation as well.

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

membrane analogy
torsion
maximum shearing stress


RNS Montgomery multiplication algorithm for duplicate processing of base transformations This paper proposes a new algorithm to achieve about two-times speedup of modular exponentiation which is implemented by Montgomery multiplication based on Residue Number Systems (RNS). In RNS Montgomery multiplication, its performance is determined by two base transformations dominantly. For the purpose of realizing parallel processing of these base transformations, i.e. "duplicate processing," we present two procedures of RNS Montgomery multiplication, in which RNS bases a and b are interchanged, and perform them alternately in modular exponentiation iteration. In an investigation of implementation, 1.87-times speedup has been obtained for 1024-bit modular multiplication. The proposed RNS Montgomery multiplication algorithm has an advantage in achieving the performance corresponding to that the upper limit of the number of parallel processing units is doubled.

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

modular exponentiation
residue number systems
montgomery multiplication


from quality in use to value in the world This paper argues that a focus on quality in use limits the potential of HCI. It summarizes how novel approaches such as Grounded Design can let us go beyond usability to reveal the fit between designs and expected contexts of use. This however is still not enough. It cannot resolve dilemmas about what is and is not a usability problem, or when fit is or is not essential. Such dilemmas can only be resolved by an understanding of the value that artifacts aim to deliver in the world. HCI must move beyond contextual description to prescriptive approaches to value in the world.

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


Comparative Study of Family 2 GPCRs in Fugu rubripes Abstract: In this study, members of family 2 GPCRs, one of the largest families of receptors in vertebrates, were isolated and characterized in the genome of the Japanese pufferfish, Fugu rubripes, and compared with the orthologous genes in other vertebrates. Phylogenetic analysis carried out with all vertebrate family 2 GPCR members indicated that CALR/CGRPR and CRF are the most divergent receptor group within this family and that the remaining members appear to originate from a common ancestral gene precursor.

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


Blotto game-based low-complexity fair multiuser subcarrier allocation for uplink OFDMA networks This article presents a subcarrier allocation scheme based on a Blotto game (SABG) for orthogonal frequency-division multiple access (OFDMA) networks where correlation between adjacent subcarriers is considered. In the proposed game, users simultaneously compete for subcarriers using a limited budget. In order to win as many good subcarriers as possible in this game, users are required to wisely allocate their budget. Efficient power and budget allocation strategies are derived for users for obtaining optimal throughput. By manipulating the total budget available for each user, competitive fairness can be enforced for the SABG. In addition, the conditions to ensure the existence and uniqueness of Nash equilibrium (NE) for the SABG are also established. An low-complexity algorithm that ensures convergence to NE is proposed. Simulation results show that the proposed low-complexity SABG can allocate resources fairly and efficiently for both uncorrelated and correlated fading channels.

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

ofdma
subcarrier allocation
blotto game
fairness
correlated fading


Polymerization conditions influence on the thermomechanical and dielectric properties of unsaturated polyesterstyrene-copolymers The influence of different polymerization conditions like curing agent (MEKP) amount and styrene content on the glass transition temperature, the relative dielectric constant as well as loss factors of unsaturated polyesterstyrene-polymer systems after solidification was investigated in depth. With respect to a high average molecular mass and Vickers hardness a curing agent content of 3wt% is recommendable. Increasing MEKP-concentrations cause a slight elevation of the polymers relative dielectric constant as well as of the loss factor. Regarding an easy film formation using tape casting a.o. higher styrene amounts lower the viscosity of the resin significantly, the relative dielectric constant and the loss factor decrease also. As an average value a relative dielectric constant of 3 under ambient conditions can be obtained.

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

unsaturated polyester resin
embedded capacitors


An integration of online and pseudo-online information for cursive word recognition In this paper, we present a novel method to extract stroke order independent information from online data. This information, which we term pseudo-online, conveys relevant information on the offline representation of the word. Based on this information, a combination of classification decisions from online and pseudo- online cursive word recognizers is performed to improve the recognition of online cursive words. One of the most valuable aspects of this approach with respect to similar methods that combine online and offline classifiers for word recognition is that the pseudo- online representation is similar to the online signal and, hence, word recognition is based on a single engine. Results demonstrate that the pseudo- online representation is useful as the combination of classifiers perform better than those based solely on pure online information.

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


Generation of Quasi-Gaussian Pulses Based on Correlation Techniques The Gaussian pulses have been mostly used within communications, where some applications can be emphasized: mobile telephony (GSM), where GMSK signals are used, as well as the UWB communications, where short-period pulses based on Gaussian waveform are generated. Since the Gaussian function signifies a theoretical concept, which cannot be accomplished from the physical point of view, this should be expressed by using various functions, able to determine physical implementations. New techniques of generating the Gaussian pulse responses of good precision are approached, proposed and researched in this paper. The second and third order derivatives with regard to the Gaussian pulse response are accurately generated. The third order derivates is composed of four individual rectangular pulses of fixed amplitudes, being easily to be generated by standard techniques. In order to generate pulses able to satisfy the spectral mask requirements, an adequate filter is necessary to be applied. This paper emphasizes a comparative analysis based on the relative error and the energy spectra of the proposed pulses.

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

digital signal processing
spectral analysis
ultra-wideband


Learning linear PCA with convex semi-definite programming ? The aim of this paper is to learn a linear principal component using the nature of support vector machines (SVMs). To this end, a complete SVM-like framework of linear PCA (SVPCA) for deciding the projection direction is constructed, where new expected risk and margin are introduced. Within this framework, a new semi-definite programming problem for maximizing the margin is formulated and a new definition of support vectors is established. As a weighted case of regular PCA, our SVPCA coincides with the regular PCA if all the samples play the same part in data compression. Theoretical explanation indicates that SVPCA is based on a margin-based generalization bound and thus good prediction ability is ensured. Furthermore, the robust form of SVPCA with a interpretable parameter is achieved using the soft idea in SVMs. The great advantage lies in the fact that SVPCA is a learning algorithm without local minima because of the convexity of the semi-definite optimization problems. To validate the performance of SVPCA, several experiments are conducted and numerical results have demonstrated that their generalization ability is better than that of regular PCA. Finally, some existing problems are also discussed.

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

principal component analysis
statistical learning theory
maximal margin algorithm
semi-definite programming
robustness


The Neighborhood Auditing Tool: A hybrid interface for auditing the UMLS The UMLS's integration of more than 100 source vocabularies, not necessarily consistent with one another, causes some inconsistencies. The purpose of auditing the UMLS is to detect such inconsistencies and to suggest how to resolve them while observing the requirement of fully representing the content of each source in the UMLS. A software tool, called the Neighborhood Auditing Tool (NAT), that facilitates UMLS auditing is presented. The NAT supports "neighborhood-based" auditing, where, at any given time, an auditor concentrates on a single-focus concept and one of a variety of neighborhoods of its closely related concepts. Typical diagrammatic displays of concept networks have a number of shortcomings, so the NAT utilizes a hybrid diagram/text interface that features stylized neighborhood views which retain some of the best features of both the diagrammatic layouts and text windows while avoiding the shortcomings. The NAT allows an auditor to display knowledge from both the Metathesaurus (concept) level and the Semantic Network (semantic type) level. Various additional features of the NAT that support the auditing process are described. The usefulness of the NAT is demonstrated through a group of case studies. Its impact is tested with a study involving a select group of auditors. (C) 2009 Elsevier Inc. All rights reserved.

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

unified medical language system
auditing of terminologies
auditing of ontologies
auditing of the umls
user interface
hybrid diagram/text user interface


Exclusion regions for optimization problems Branch and bound methods for finding all solutions of a global optimization problem in a box frequently have the difficulty that subboxes containing no solution cannot be easily eliminated if they are close to the global minimum. This has the effect that near each global minimum, and in the process of solving the problem also near the currently best found local minimum, many small boxes are created by repeated splitting, whose processing often dominates the total work spent on the global search. This paper discusses the reasons for the occurrence of this so-called cluster effect, and how to reduce the cluster effect by defining exclusion regions around each local minimum found, that are guaranteed to contain no other local minimum and hence can safely be discarded. In addition, we will introduce a method for verifying the existence of a feasible point close to an approximate local minimum. These exclusion regions are constructed using uniqueness tests based on the Krawczyk operator and make use of first, second and third order information on the objective and constraint functions.

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

global optimization
branch and bound
cluster effect
krawczyk operator

validated enclosure
existence test
uniqueness test
inclusion region
exclusion region
kantorovich theorem
backboxing
affine invariant
primary 65h20
65g30


Learning about meetings Most people participate in meetings almost every day, multiple times a day. The study of meetings is important, but also challenging, as it requires an understanding of social signals and complex interpersonal dynamics. Our aim in this work is to use a data-driven approach to the science of meetings. We provide tentative evidence that: (i) it is possible to automatically detect when during the meeting a key decision is taking place, from analyzing only the local dialogue acts, (ii) there are common patterns in the way social dialogue acts are interspersed throughout a meeting, (iii) at the time key decisions are made, the amount of time left in the meeting can be predicted from the amount of time that has passed, (iv) it is often possible to predict whether a proposal during a meeting will be accepted or rejected based entirely on the language (the set of persuasive words) used by the speaker.

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

analysis of meetings
applications of machine learning


Design and implementation of an expert interface system for integration of photogrammetric and Geographic Information Systems for intelligent preparation and structuring of spatial data Preparation of spatial data for Geographic Information System (GIS) simultaneously during feature digitizing process from photogrammetric models reduces data editing phases after feature digitizing process. Therefore, the problems, caused by separating spatial data production process from preparation of this data, are overcome as far as possible. To achieve this purpose, specialty and expertise required for spatial data structuring and preparation for GIS, should be available in an interface system which establishes a direct connection between photogrammetric and GIS systems. In this case, when a user digitizes a feature from a photogrammetric model, decision making process about the method of editing, structuring, layering, and storing of the feature in GIS database, can be carried out by such an interface system. Thus, according to the capabilities of expert systems for modeling the knowledge and deduction methods of experts, generating an expert interface system between photogrammetric and GIS systems, offers a suitable solution for this integration. In this paper, the capabilities of expert systems for intelligent spatial data structuring and preparation simultaneously during feature digitizing process from photogrammetric models, have been investigated. Also, design, implementation and test of an expert interface system for integration of photogrammetric and GIS systems in order to take advantages of capabilities of both systems simultaneously as one integrated system, has been described.

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


WEVAN A mechanism for evidence creation and verification in VANETs There are traffic situations (e.g. incorrect speeding tickets) in which a given vehicles driving behavior at some point in time has to be proved to a third party. Vehicle-mounted sensorial devices are not suitable for this matter since they can be maliciously manipulated. However, surrounding vehicles may give their vision on another ones behavior. Furthermore, these data may be shared with the affected vehicle through VANETs. In this paper, a VANET-enabled data exchange mechanism called WEVAN is presented. The goal of this mechanism is to build and verify evidences based on surrounding vehicles (called witnesses) testimonies. Due to the short-range nature of VANETs, the connectivity to witnesses may be reduced with time the later their testimonies are requested, the lower the amount of witnesses may be. Simulation results show that if testimonies are ordered 5s later, an average of 38 testimonies may be collected in highway scenarios. Other intervals and road settings are studied as well.

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

digital evidence
vehicular ad-hoc networks (vanets)
witness


Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums We present a notion of eta-long beta-normal term for the typed lambda calculus with sums and prove, using Grothendieck logical relations, that every term is equivalent to one in normal form. Based on this development we give the first type-directed partial evaluator that constructs normal forms of terms in this calculus.

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

typed lambda calculus
grothendieck logical relations
normalisation

strong sums
type-directed partial evaluation


yet another write-optimized dbms layer for flash-based solid state storage Flash-based Solid State Storage (flashSSS) has write-oriented problems such as low write throughput, and limited life-time. Especially, flashSSDs have a characteristic vulnerable to random-writes, due to its control logic utilizing parallelism between the flash memory chips. In this paper, we present a write-optimized layer of DBMSs to address the write-oriented problems of flashSSS in on-line transaction processing environments. The layer consists of a write-optimized buffer, a corresponding log space, and an in-memory mapping table, closely associated with a novel logging scheme called InCremental Logging (ICL). The ICL scheme enables DBMSs to reduce page-writes at the least expense of additional page-reads, while replacing random-writes into sequential-writes. Through experiments, our approach demonstrated up-to an order of magnitude performance enhancement in I/O processing time compared to the original DBMS, increasing the longevity of flashSSS by approximately a factor of two.

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


Wrinkle development analysis in thin sail-like structures using MITC shell finite elements We propose a method of modelling sail type structures which captures the wrinkling behaviour of such structures. The method is validated through experimental and analytical test cases, particularly in terms of wrinkling prediction. An enhanced wrinkling index is proposed as a valuable measure characterizing the global wrinkling development on the deformed structure. The method is based on a pseudo-dynamic finite element procedure involving non-linear MITC shell elements. The major advantage compared to membrane models generally used for this type of analysis is that no ad hoc wrinkling model is required to control the stability of the structure. We demonstrate our approach to analyse the behaviour of various structures with spherical and cylindrical shapes, characteristic of downwind sails over a rather wide range of shape and constitutive parameters. In all cases convergence is reached and the overall flying shape is most adequately represented, which shows that our approach is a most valuable alternative to standard techniques to provide deeper insight into the physical behaviour. Limitations appear only in some very special instances in which local wrinkling-related instabilities are extremely high and would require specific additional treatments, out of the scope of the present study.

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

sail modelling
mitc shells
wrinkling index


Cliques, holes and the vertex coloring polytope Certain subgraphs of a given graph G restrict the minimum number chi(G) of colors that can be assigned to the vertices of G such that the endpoints of all edges receive distinct colors. Some of such subgraphs are related to the celebrated Strong Perfect Graph Theorem. as it implies that every graph G contains a clique of size chi(G), or an odd hole or an odd anti-hole as an induced subgraph. In this paper, we investigate the impact of induced maximal cliques, odd holes and odd anti-holes on the polytope associated with a new 0-1 integer programming formulation of the graph coloring problem. We show that they induce classes of facet defining, inequalities. (C) 2003 Elsevier B.V. All rights reserved.

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

combinatorial problems
facets of polyhedra
graph colorings


An experimental validation of a novel clustering approach to PWARX identification In this paper, the problem of clustering based procedure for the identification of PieceWise Auto-Regressive eXogenous (PWARX) models is addressed. This problem involves both the estimation of the parameters of the affine sub-models and the hyperplanes defining the partitions of the state-input regression. In fact, we propose the use of the Chiu's clustering algorithm in order to overcome the main drawbacks of the existing methods which are the poor initialization and the presence of outliers. In addition, our approach is able to generate automatically the number of sub-models. Simulation results are presented to illustrate the performance of the proposed method. An application of the developed approach to an olive oil esterification reactor is also suggested in order to validate simulation results.

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

pwarx models
clustering
identification
experimental validation

hybrid systems
chiu's clustering technique


A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP We present a primal-dual ?log(n)?-approximation algorithm for the version of the asymmetric prize collecting traveling salesman problem, where the objective is to find a directed tour that visits a subset of vertices such that the length of the tour plus the sum of penalties associated with vertices not in the tour is as small as possible. The previous algorithm for the problem (V.H. Nguyen and T.T Nguyen in Int. J. Math. Oper. Res. 4(3):294301, 2012) which is not combinatorial, is based on the Held-Karp relaxation and heuristic methods such as the Frieze et al.s heuristic (Frieze et al. in Networks 12:2339, 1982) or the recent Asadpour et al.s heuristic for the ATSP (Asadpour etal. in 21st ACM-SIAM symposium on discrete algorithms, 2010). Depending on which of the two heuristics is used, it gives respectively 1+?log(n)? and \(3+ 8\frac{\log(n)}{\log(\log(n))}\) as an approximation ratio. Our algorithm achieves an approximation ratio of ?log(n)? which is weaker than \(3+ 8\frac{\log(n)}{\log(\log(n))}\) but represents the first combinatorial approximation algorithm for the Asymmetric Prize-Collecting TSP.

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

prize collecting traveling salesman
approximation algorithm


Second order ambient intelligence This text attempts to describe an imagined future of ambient intelligence. It assumes that one day most of the current issues within ambient intelligence will be solved and that a second order ambient intelligence will be formulated, one with new research agendas. It describes several topics and ideas that might be part of this agenda and surmises on the prerequisites for this change.

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

critique of ambient intelligence
temporal design
adaptive systems
long-term behavior
animal machine interaction
critical futurism


PDMS prism-glass optical coupling for surface plasmon resonance sensors based on MEMS technology A miniaturized surface plasmon resonance (SPR) chip has been developed for biomedical and chemical analysis with low cost and high performance. The techniques of bulk silicon micromachining and polymer replication were used to fabricate the Kretschmann SPR sensor composed of a Polydimethylsiloxane (PDMS) prism, a coupling glass and microchannels. The plasmon properties of thin metal films were investigated theoretically based on Fresnel analysis, with optical boundary conditions pertaining to the surface plasmon resonance at the gold/water and gold/air interfaces. The theoretical results show that difference in the refractive index (RI) between the PDMS prism and the coupling glass layer affect the precision of the SPR angle and the SPR curve. Meanwhile, the period of the interference fringe attaching on the SPR curve increases with an increase in wavelength and a decrease in the refractive index of the coupling glass layer. The gold thickness of 50 nm is required while employing a fixed incident wavelength of 650 nm, to achieve optimum SPR excitation conditions and the sensor sensitivity. The characteristics of this SPR sensor were evaluated in the angular interrogation mode of employing the incident wavelength of 650 nm in air and water media, respectively. The obtained SPR angles were approximately consistent with the theoretical ones.

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


Isogeometric analysis for strain field measurements In this paper, the potential of isogeometric analysis for strain field measurement by digital image correlation is investigated. Digital image correlation (DIC) is a full field kinematics measurement technique based on gray level conservation principle and the formulation we adopt allows for using arbitrary displacement bases. The high continuity properties of Non-Uniform Rational B-Spline (NURBS) functions are exploited herein as an additional regularization of the initial ill-posed problem. k-Refinement is analyzed on an artificial test case where the proposed methodology is shown to outperform the usual finite element-based DIC. Finally a fatigue tensile test on a thin aluminum sheet is analyzed. Strain localization occurs after a certain number of cycles and combination of NURBS into a DIC algorithm clearly shows a great potential to improve the robustness of non-linear constitutive law identification.

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

digital image correlation
nurbs
strain field measurement
isogeometric analysis


Stable computation of the functional variation of the DirichletNeumann operator This paper presents an accurate and stable numerical scheme for computation of the first variation of the DirichletNeumann operator in the context of Eulers equations for ideal free-surface fluid flows. The Transformed Field Expansion methodology we use is not only numerically stable, but also employs a spectrally accurate Fourier/Chebyshev collocation method which delivers high-fidelity solutions. This implementation follows directly from the authors previous theoretical work on analyticity properties of functional variations of DirichletNeumann operators. These variations can be computed in a number of ways, but we establish, via a variety of computational experiments, the superior effectiveness of our new approach as compared with another popular Boundary Perturbation algorithm (the method of Operator Expansions).

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

dirichletneumann operators
functional variations

boundary perturbation methods
high-order/spectral methods
water waves


Optimal tool selection for 2.5D milling, part 1: a solid-modeling approach for construction of the Voronoi mountain Cutter selection is a critical subtask of machining process planning. In this two-part series, we develop a robust approach for the selection of an optimal set of milling cutters for a 2.5D generalized pocket. In the first article ( part 1), we present a solid modeling approach for the construction of the Voronoi mountain for the pocket geometry, which is a 3D extension of the Voronoi diagram. The major contributions of this work include: ( 1) the development of a robust and systematic procedure for construction of the Voronoi mountain for a multiply-connected curvilinear polygon; and ( b) an extension of the Voronoi mountain concept to handle open edges.

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

voronoi mountain (diagram)
cutter (tool) selection
2.5d milling
solid modelling


evaluating the novelty of text-mined rules using lexical knowledge In this paper, we present a new method of estimating the novelty of rules discovered by data-mining methods using WordNet, a lexical knowledge-base of English words. We assess the novelty of a rule by the average semantic distance in a knowledge hierarchy between the words in the antecedent and the consequent of the rule - the more the average distance, more is the novelty of the rule. The novelty of rules extracted by the DiscoTEX text-mining system on Amazon.com book descriptions were evaluated by both human subjects and by our algorithm. By computing correlation coefficients between pairs of human ratings and between human and automatic ratings, we found that the automatic scoring of rules based on our novelty measure correlates with human judgments about as well as human judgments correlate with one another. @Text mining

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

novelty
semantic distance
knowledge hierarchy
wordnet


VISOR: Vast independence system optimization routine An algorithm is sketched that generates all K maximal independent sets and all M minimal dependent sets of an arbitrary independence system, based on a set of cardinality n having at most 2(n) subsets. with access to an oracle that decides if a set is independent or not. Because the algorithm generates all those sets, it solves the problems of finding all maximum independent and minimum dependent sets. Those problems are known to be impossible to solve in general in time polynomial in n, K, and M, and they are NP hard. The algorithm proposed and used is efficient in the sense that it requires only O(nK + M) or O(K + nM) visits to the oracle, the nonpolynomial part is only related to bitstring comparisons and the like, which can be performed rather quickly and, to some degree, in parallel on a sequential machine. This complexity compares favorably with another algorithm that is O(n(2)K(2)). The design of a computer routine that implements the algorithm in a highly optimized way is discussed. The routine behaves as expected, as is shown by numerical experiments on a range of randomly generated independence systems with n up to n = 34. Application on an engineering design problem with n = 28 shows the routine requires almost 10(6) times less visits to the oracle than an exhaustive search, while the time spent in visiting the oracle is still significantly larger than that spent for all other computations together.

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

combinatorial optimization
maximal independent set
input/output selection


Superconvergence in high-order Galerkin finite element methods In this paper, we shall use local estimates to give the superconvergence of high-order Galerkin finite element method for the elliptic equation of second order with constant coefficients by using the symmetric technique and integral identity. We get improved superconvergence on the inner locally symmetric mesh with respect to a point x0 for rectangular and triangular meshes.

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

integral identities
locally symmetric meshes
elliptic equations of second order


A REVIEW OF DESIGN PATTERN MINING TECHNIQUES The quality of a software system highly depends on its architectural design. High quality software systems typically apply expert design experience which has been captured as design patterns. As demonstrated solutions to recurring problems, design patterns help to reuse expert experience in software system design. They have been extensively applied in the industry. Mining the instances of design patterns from the source code of software systems can assist in the understanding of the systems and the process of re-engineering them. More importantly, it also helps to trace back to the original design decisions, which are typically missing in legacy systems. This paper presents a review on current techniques and tools for mining design patterns from source code or design of software systems. We classify different approaches and analyze their results in a comparative study. We also examine the disparity of the discovery results of different approaches and analyze possible reasons with some insight.

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


Stabilization of second-order nonholonomic systems in canonical chained form Stabilization of a class of second-order nonholonomic systems in canonical chained form is investigated in this paper. First, the models of two typical second-order nonholonomic systems, namely, a three-link planar manipulator with the third joint unactuated, and a kinematic redundant manipulator with all joints free and driven by forces/torques imposing on the end-effector, are presented and converted to second-order chained form by transformations of coordinate and input. A discontinuous control law is then proposed to stabilize all states of the system to the desired equilibrium point exponentially. Computer simulation is given to show the effectiveness of the proposed controller.

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

second-order nonholonomic systems
canonical second-order chained form
underactuated manipulator
discontinuous coordinate transformation
discontinuous stabilization


Truthful mechanisms for two-range-values variant of unrelated scheduling In this paper, we consider a restricted variant of the scheduling problem, where the machines are the strategic players. For this multi-parameter mechanism design problem, the only known truthful mechanisms use task independent allocation algorithms and only have approximation ratio O(m) [N. Nisan, & Ronen. Algorithmic mechanism design (extended abstract), in: STOC'99: Proceedings of the thirty-first annual ACM symposium on Theory of computing, ACM, New York, NY, USA, 1999. pp. 129-140; A. Mu'alem, M. Schapira, Setting lower bounds on truthfulness: Extended abstract, in: SODA'07: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, Philadelphia. PA, USA, 2007, pp. 1143-1152; P. Lu, C. Yu, An improved randomized truthful mechanism for scheduling unrelated machines, in: 25th International Symposium on Theoretical Aspects of Computer Science, STACS, 2008, pp. 527-538; P. Lu, C. Yu, Randomized truthful mechanisms for scheduling unrelated machines, in: C.H. Papadimitriou, S. Zhang (Eds.), Proceedings of WINE, in: Lecture Notes in Computer Science, vol. 5385, Springer, 2008, pp. 402-413]. Lavi and Swamy first use the cycle monotone condition and design a 3-approximation truthful mechanism for a two value variant in [R. Lavi, C. Swamy, Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity, in: EC'07: Proceedings of the 8th ACM conference on Electronic commerce, ACM, New York, NY, USA, 2007, pp. 252-261], where the processing time of task j on machine i, say t(ij), can only be either a lower value L(j) or a higher value H(j). We consider a generalized variant. where t(ij) lies in [L(j), L(j)(1+epsilon)] boolean OR [H(j), H(j)(1+epsilon)] and epsilon is a parameter satisfying some condition. We consider two special cases, case A when H(j)/L(j) > 2,for all(j) and case B when H(j)/L(j) <= 2, for all j, and give randomized truthful mechanisms with approximation ratio 4(1+epsilon) for both cases. Based on these two cases' results, we are also able to deal with the general case of our two-range-values scheduling problem. We use a combination of two mechanisms, which is also a novel method in mechanism design for scheduling problems, and finally we give a randomized truthful mechanism with approximation ratio 7(1+epsilon). Although the generalization seems a little incremental, we actually use a very novel technique in the key step of proving truthfulness for case A, as well as a new mechanism scheme for case B. Besides, the results in this paper are the first truthful mechanisms with constant approximation ratios when a machine (player) can report infinitely possible values, which is quite different from the two value variant, in which only finite values are available. Furthermore, together with Lavi and Swamy's work, our results suggest that such a task-dependent approach can really do much better for the scheduling unrelated machines problem. (C) 2009 Elsevier B.V. All rights reserved.

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


A note on the relationships among certified discrete log cryptosystems The certified discrete logarithm problem modulo p prime is a discrete logarithm problem under the conditions that the complete factorization of p - 1 is given and by which the base g is certified to be a primitive root mod p. For the cryptosystems based on the intractability of certified discrete logarithm problem, Sakurai-Shizuya showed that breaking the Diffie-Hellman key exchange scheme reduces to breaking the Shamir 3-pass key transmission scheme with respect to the expected polynomial-time Turing reducibility. In this paper, we show that we can remove randomness from the reduction above, and replace the reducibility with the polynomial-time many-one. Since the converse reduction is known to hold with respect to the polynomial-time many-one reducibility, our result gives a stronger evidence for that the two schemes are completely equivalent as certified discrete log cryptosystems.

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

certified discrete logarithm problem
primitive root

order
probabilistic reducibility
deterministic reducibility


Hydraulic performance of a large slanted axial-flow pump Purpose - The pump of the Taipuhe Pump Station, larger flow discharge, lower head, is one of the largest 150 slanted axial-flow pumps in the world. However, few studies have been done for the larger slanted axial-flow pump on safe operation. The purpose of this paper is to analyze the impeller elevation, unsteady flow, hydraulic thrust and the zero-head flow characteristics of the pump. Design/methodology/approach - The flow field in and through the pump was analyzed numerically during the initial stages of the pump design process, then the entire flow passage through the pump was analyzed to calculate the hydraulic thrust to prevent damage to the bearings and improve the operating stability The zero-head pump flow characteristics were analyzed to ensure that the pump will work reliably at much lower heads. Findings - The calculated results are in good agreement with experimental data for the pump elevation effects, the performance curve, pressure oscillations, hydraulic thrust and zero-head performance. Research limitations/implications - Since it is assumed that there is no gap between blades and shroud, gap cavitations are beyond the scope of the paper. Originality/value - The paper indicates the slanted axial-flow pump characteristics including the characteristic curves, pressure fluctuations, hydraulic thrust and radial force for normal operating conditions and zero-head conditions. It shows how to guarantee the pump safety operating by computational fluid dynamics.

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

force measurement
water supply engineering
china


High-radix montgomery modular exponentiation on reconfigurable hardware It is widely recognized that security issues will play a crucial role in the majority of future computer and communication systems. Central tools for achieving system security are cryptographic algorithms. This contribution proposes arithmetic architectures which are optimized for modern field programmable gate arrays (FPGAs). The proposed architectures perform modular exponentiation with very long integers. This operation is at the heart of many practical public-key algorithms such as RSA and discrete logarithm schemes. We combine a high-radix Montgomery modular multiplication algorithm with a new systolic array design. The designs are flexible, allowing any choice of operand and modulus. The new architecture also allows the use of high radices. Unlike previous approaches, we systematically implement and compare several variants of our new architecture for different bit lengths. We provide absolute area and timing measures for each architecture. The results allow conclusions about the feasibility and time-space trade-offs of our architecture for implementation on commercially available FPGAs. We found that 1,024-bit RSA decryption can be done in 3.1 ms with our fastest architecture.

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

montgomery
exponentiation
rsa
systolic array


Combined use of supervised and unsupervised learning for power system dynamic security mapping This paper proposes a new methodology which combines supervised and unsupervised learning for evaluating power system dynamic security. Based on the concept of stability margin, pre-fault power system conditions are assigned to the output neurons on the two-dimensional grid with the growing hierarchical self-organizing map technique (GHSOM) via supervised artificial neural networks (ANNs) which perform an estimation of post-fault power system state. The technique estimates the dynamic stability index that corresponds to the most critical value of synchronizing and damping torques of multimachine power systems. ANN-based pattern recognition is carried out with the growing hierarchical self-organizing feature mapping in order to provide adaptive neural network architecture during its unsupervised training process. Numerical tests, carried out on a IEEE 9 bus power system are presented and discussed. The analysis using such method provides accurate results and improves the effectiveness of system security evaluation.

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

synchronizing and damping torques
supervised and unsupervised learning


0.35 mu m CMOS T/R switch for 2.4 GHz short range wireless applications This paper describes the design and implementation of a transmit/receive switch for 2.4 GHz ISM band applications. The T/R switch is implemented in a 0.35 mum bulk CMOS process and it occupies 150 mum . 170 mum of die area. A parasitic MOSFET model including bulk resistance is used to optimize the physical dimensions of the transistors with regard to insertion loss and isolation. The measured insertion loss is 1.3 dB without port matching. Simulations using measured s-parameters indicate that an insertion loss of 0.8 dB can be obtained with a conjugate match. The measured isolation is 42 dB and the maximum transmit power is 16 dBm.

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

t/r switch
mosfet switch
rf cmos
spdt switch


Probabilistic equivalence checking of multiple-valued functions This paper describes a probabilistic method for verifying the equivalence of two multiple-valued functions. Each function is hashed to an integer code by transforming it to a integer-valued polynomial and evaluating it for values of variables taken independently and uniformly at random from a finite field. Since the polynomial is unique for a given function, if two hash codes are different, then the functions are not equivalent. However, if two hash codes are the same, the functions may or may not be equivalent, because different polynomials may happen to hash to the same code. Thus, the method presented in this paper determines the equivalence of two functions with a known (small) probability of error, arising from collisions between inequivalent functions. Such a method seems to be an attractive alternative for verifying functions that are too large to be handled by deterministic equivalence checking methods.

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

multiple-valued function
probabilistic verification


A model and environment for improving multimedia scholarly reading practices The evolution of multimedia document production and diffusion technologies has lead to a significant spread of knowledge in form of pictures and recordings. However, scholarly reading tasks are still principally performed on textual contents. We argue that this is due to a lack of critical and structured tools: (1) to handle the wide spectrum of interpretive operations involved by the polymorphous scholarly reading process; (2) to perform these operations on a heterogeneous multimedia corpus. This firstly calls for identifying fundamental document requirements for such reading practices. Then, we present a flexible model and a software environment which enable the reader to structure, annotate, link, fragment, compare, freely organise and spatially lay out documents, and to prepare the writing of their critical comment. We eventually discuss experiments with humanities scholars, and explore new academic reading practices which take advantage of document engineering principles such as multimedia document structuring, publication or sharing.

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

graphical user interfaces for critical reading


sensor selection for energy-efficient ambulatory medical monitoring Epilepsy affects over three million Americans of all ages. Despite recent advances, more than 20\% of individuals with epilepsy never achieve adequate control of their seizures. The use of a small, portable, non-invasive seizure monitor could benefit these individuals tremendously. However, in order for such a device to be suitable for long-term wear, it must be both comfortable and lightweight. Typical state-of-the-art non-invasive seizure onset detection algorithms require 21 scalp electrodes to be placed on the head. These electrodes are used to generate 18 data streams, called channels. The large number of electrodes is inconvenient for the patient and processing 18 channels can consume a considerable amount of energy, a problem for a battery-powered device. In this paper, we describe an automated way to construct detectors that use fewer channels, and thus fewer electrodes. Starting from an existing technique for constructing 18 channel patient-specific detectors, we use machine learning to automatically construct reduced channel detectors. We evaluate our algorithm on data from 16 patients used in an earlier study. On average, our algorithm reduced the number of channels from 18 to 4.6 while decreasing the mean fraction of seizure onsets detected from 99\% to 97\%. For 12 out of the 16 patients, there was no degradation in the detection rate. While the average detection latency increased from 7.8 s to 11.2 s, the average rate of false alarms per hour decreased from 0.35 to 0.19. We also describe a prototype implementation of a single channel EEG monitoring device built using off-the-shelf components, and use this implementation to derive an energy consumption model. Using fewer channels reduced the average energy consumption by 69\%, which amounts to a 3.3x increase in battery lifetime. Finally, we show how additional energy savings can be realized by using a low-power screening detector to rule out segments of data that are obviously not seizures. Though this technique does not reduce the number of electrodes needed, it does reduce the energy consumption by an additional 16\%.

O O O O B I I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 energy consumption
channel selection
electroencephalography (eeg)


process synchronization without long-term interlock A technique is presented for replacing long-term interlocking of shared data by the possible repetition of unprivileged code in case a version number (associated with the shared data) has been changed by another process. Four principles of operating system architecture (which have desirable effects on the intrinsic reliability of a system) are presented; implementation of a system adhering to these principles requires that long-term lockout be avoided.

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

synchronization
reliability
code
architecture
operating system
implementation
process
data
case
version


Application of an artificial immune system-based fuzzy neural network to a RFID-based positioning system Due to the rapid development of globalization, which makes supply chain management more complicated, more companies are applying radio frequency identification (RFID), in warehouse management. The obvious advantages of RFID are its ability to scan at high-speed, its penetration and memory. In addition to recycling, use of a RFID system can also reduce business costs, by indentifying the position of goods and picking carts. This study proposes an artificial immune system (AIS)-based fuzzy neural network (FNN), to learn the relationship between the RFID signals and the picking cart's position. Since the proposed network has the merits of both AIS and FNN. it is able to avoid falling into the local optimum and possesses a learning capability. The results of the evaluation of the model show that the proposed AIS-based FNN really can predict the picking cart position more precisely than conventional FNN and, unlike an artificial neural network, it is much easier to interpret the training results, since they are in the form of fuzzy IF-THEN rules. (C) 2012 Elsevier Ltd. All rights reserved.

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

radio frequency identification (rfid)
artificial immune system (ais)
genetic algorithms (gas)
fuzzy neural network (fnn)


Single-dimension multidimensional software pipelining for loops Traditionally, software pipelining is applied either to the innermost loop of a given loop nest or from the innermost loop to outer loops. This paper proposes a three-step approach, called single-dimension software pipelining (SSP), to software pipeline a loop nest at an arbitrary loop level that has a rectangular iteration space and contains no sibling inner loops in it. The first step identifies the most profitable loop level for software pipelining in terms of initiation rate, data reuse potential, or any other optimization criteria. The second step simplifies the multidimensional data-dependence graph (DDG) of the selected loop level into a one-dimensional DDG and constructs a one-dimensional (1D) schedule. Based on the one-dimensional schedule, the third step derives a simple mapping function that specifies the schedule time for the operation instances in the multidimensional loop. The classical modulo scheduling is subsumed by SSP as a special case. SSP is also closely related to hyperplane scheduling, and, in fact, extends it to be resource constrained. We prove that SSP schedules are correct and at least as efficient as those schedules generated by traditional modulo scheduling methods. We extend SSP to schedule imperfect loop nests, which are most common at the instruction level. Multiple initiation intervals are naturally allowed to improve execution efficiency. Feasibility and correctness of our approach are verified by a prototype implementation in the ORC compiler for the IA-64 architecture, tested with loop nests from Livermore and SPEC2000 floating-point benchmarks. Preliminary experimental results reveal that, compared to modulo scheduling, software pipelining at an appropriate loop level results in significant performance improvement. Software pipelining is beneficial even with prior loop transformations.

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

algorithms
languages
loop transformation


A geometric-based method for recognizing overlapping polygonal-shaped and semi-transparent particles in gray tone images A geometric-based method is proposed to recognize the overlapping particles of different polygonal shapes such as rectangular, regular and/or irregular prismatic particles in a gray tone image. The first step consists in extracting the salient corners, identified by their locations and orientations, of the overlapping particles. Although there are certain difficulties like the perspective geometric projection, out of focus, transparency and superposition of the studied particles. Then, a new clustering technique is applied to detect the shape by grouping its correspondent salient corners according to the geometric properties of each shape. A simulation process is carried out for evaluating the performance of the proposed method. Then, it is particularly applied on a real application of batch cooling crystallization of the ammonium oxalate in pure water. The experimental results show that the method is efficient to recognize the overlapping particles of different shapes and sizes.

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

salient corner detection
contour detection
clustering method
overlapping particles recognition


EXPLICIT DIMENSION REDUCTION AND ITS APPLICATIONS We construct a small set of explicit linear transformations mapping R-n to R-t, where t = O(log(gamma(-1))epsilon(-2)), such that the L-2 norm of any vector in R-n is distorted by at most 1 +/- epsilon in at least a fraction of 1 - gamma of the transformations in the set. Albeit the tradeoff between the size of the set and the success probability is suboptimal compared with probabilistic arguments, we nevertheless are able to apply our construction to a number of problems. In particular, we use it to construct an epsilon-sample (or pseudorandom generator) for linear threshold functions on Sn-1 for epsilon = o(1). We also use it to construct an epsilon-sample for spherical digons in Sn-1 for epsilon = o(1). This construction leads to an efficient oblivious derandomization of the Goemans-Williamson Max-Cut algorithm and similar approximation algorithms (i.e., we construct a small set of hyperplanes such that for any instance we can choose one of them to generate a good solution). Our technique for constructing an epsilon-sample for linear threshold functions on the sphere is considerably different than previous techniques that rely on k-wise independent sample spaces.

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

dimension reduction
pseudorandom generator
linear threshold functions
digons


Capital One Financial and a decade of experience with newly vulnerable markets: Some propositions concerning the competitive advantage of new entrants Market share and brand recognition have historically provided advantage to established players in mature industries. The success of Capital One, an attacker in the mature credit card industry is therefore interesting, both to researchers and to executives developing strategies. A partial explanation is offered by the theory of newly vulnerable markets. The success of Capital One can be partially attributed to its application of information-based strategies to several newly vulnerable markets, allowing it to target and retain the most profitable customers. These strategies sustained double-digit return on equity and double-digit increase in sales volume and profits every year of our study.

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

newly vulnerable markets
capital one financial

information-based strategy
market entry
differential pricing
customer profitability gradient
information economics