non-slicing floorplanning-based crosstalk reduction on gridless track assignment for a gridless routing system with fast pseudo-tile extraction Track assignment, which is an intermediate stage between global routing and detailed routing, provides a good platform for promoting performance, and for imposing additional constraints during routing, such as crosstalk. Gridless track assignment (GTA) has not been addressed in public literature. This work develops a gridless routing system integrating a congestion-driven global router, crosstalk-driven GTA and an enhanced implicit connection graph-based router. Initial assignment is produced rapidly with a left-edge like algorithm. Crosstalk reduction on the assignment is then transformed to a restricted non-slicing floorplanning problem, and a deterministic O-tree based algorithm is employed to re-assign each net segment. Finally, each panel is partitioned into several sub-panels, and the sub-panels are reordered using branch and bound algorithm to decrease the crosstalk further. Before detailed routing, routing tree construction is undertook for placed IRoutes and other pins; many original point-to-point routings are set to connect to IRoutes, and can be accomplished simply with pattern routing. For detailed routing, this work proposes a rapid extraction method for pseudo-maximum stripped tiles to boost path propagation. Experimental results demonstrate that the proposed gridless routing system has over 2.66 times the runtime speedup for fixed- and variable-rule routings of an implicit connection-graph-based router, NEMO. As compared with a commercial routing tool, this work yields an average reduction rate of 15\% in coupling capacitance calculated using its built-in coupling capacitance estimator

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

gridless routing
detailed routing
crosstalk reduction

non-slicing floorplanning
implicit connection graph-based router
full-chip routing


Face recognition in JPEG compressed domain: a novel coefficient selection approach JPEG compression standard is widely used for reducing the volume of images that are stored or transmitted via networks. In biometrics datasets, facial images are usually stored in JPEG compressed format and should be fully decompressed to be used in a face recognition system. Recently, in order to reduce the computational complexity of JPEG decompression step, face recognition in compressed domain is considered as an emerging topic in face recognition systems. In this paper, a novel coefficient selection method based on face segmentation has been proposed for selecting a limited number of zigzag scanned quantized coefficients in JPEG compressed domain, which led to an improvement in recognition accuracy and a reduction in computational complexity of the face recognition system. In the proposed method, different low frequency coefficients based on the importance of the regions of a face have been selected for recognition process. The experiments were conducted on FERET and FEI face databases, and PCA and ICA methods have been utilized to extract the features of the selected coefficients. Different criteria including recognition accuracy and time complexity metrics were employed in order to evaluate the performance of the proposed method, and the results have been compared with those of the state-of-the art methods. The results show the superiority of the proposed approach, in terms of recognition ranks, discriminatory power and time complexity aspects.

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

face recognition
jpeg compressed domain
coefficient selection


Autoimmune Diseases and Sjgren's Syndrome Autoimmune diseases include a diverse group of over 80 conditions. Sjgren's syndrome is the second most common autoimmune rheumatic disease, with an estimated prevalence in the United States of 24 million persons. There are prominent and consistent oral and dental findings in Sjgren's syndrome related to the autoimmune-mediated loss of normal salivary function. Additionally, nonoral clinical manifestations of Sjgren's syndrome includ

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

diagnosis and therapy of sjgren's syndrome


Gleichzeitigkeitsfaktoren in der elektrischen Energieversorgung Konventioneller und probabilistischer Ansatz In diesem Beitrag werden die konventionell ermittelten Gleichzeitigkeitsfaktoren zur Auswahl und Dimensionierung elektrischer Betriebsmittel (Transformatoren, Leitungen) einer probabilistischen Methode gegenbergestellt. Die konventionelle Dimensionierung von elektrischen Betriebsmitteln fr einzelne Nutzungen (Bro, Gewerbe, Haushalt und Industrie) erfolgt blicherweise auf der Basis der zu erwartenden Nutzungen mittels Gleichzeitigkeitsfaktoren und spezifischen Flchenlasten, die aus Erfahrungswerten stammen. Bei dieser Vorgangsweise bleibt immer beim technischen Planer das Risiko einer nicht angepassten Dimensionierung.

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

spitzenleistungen
probabilistische planungsanstze
niederspannungsnetz
netzrestrukturierung
coincidence factor
peak power
probabilistic grid planning
low voltage network
grid restructuring


Using Case-Based Reasoning and Principled Negotiation to provide decision support for dispute resolution The growing use of Information Technology in the commercial arena leads to an urgent need to find alternatives to traditional dispute resolution. New tools from fields such as artificial intelligence (AI) should be considered in the process of developing novel online dispute resolution (ODR) platforms, in order to make the ligation process simpler, faster and conform with the new virtual environments. In this work, we describe UMCourt, a project built around two sub-fields of AI research: Multi-agent Systems and Case-Based Reasoning, aimed at fostering the development of tools for ODR. This is then used to accomplish several objectives, from suggesting solutions to new disputes based on the observation of past similar disputes, to the improvement of the negotiation and mediation processes that may follow. The main objective of this work is to develop autonomous tools that can increase the effectiveness of the dispute resolution processes, namely by increasing the amount of meaningful information that is available for the parties.

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

expert system
case-based reasoning
information retrieval


An empirical examination of initial trust in mobile banking Purpose - The purpose of this paper is to examine the effect of initial trust on mobile banking user adoption. Design/methodology/approach - Based on the valid responses collected from a survey questionnaire, structural equation modeling (SEM) technology was employed to examine the research model. Findings - The results indicate that structural assurance and information quality are the main factors affecting initial trust, whereas information quality and system quality significantly affect perceived usefulness. Initial trust affects perceived usefulness, and both factors predict the usage intention of mobile banking. Research limitations/implications - The sample was mainly composed of users having rich mobile Internet experience, which may affect their trust in mobile banking. Future research needs to generalize these results to other samples, such as those users without much mobile Internet experience. Originality/value - Extant research has mainly adopted information technology adoption theories such as TAM to explain mobile user behavior, and has seldom examined the effect of initial trust on mobile banking user adoption. However, the high perceived risk and low switching cost highlight the necessity to build initial trust to facilitate user behavior. This research fills the gap.

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

initial trust
mobile banking
information quality
system quality
trust


Influence of transient flow and solder bump resistance on underfill process The underfill flow process is one of the important steps in Microsystems technology. One of the best known examples of such a process is with the flip-chip packaging technology which has great impact on the reliability of electronic devices. For optimization of the design and process parameters or real-time feedback control, it is necessary to have a dynamic model of the process that is computationally efficient yet reasonably accurate. The development of such a model involves identifying any factors that can be neglected with negligible loss of accuracy. In this paper, we present a study of flow transient behavior and flow resistance due to the presence of an array of solder bumps in the gap. We conclude (1) that the assumption of steady flow in the modeling of the flow behavior of fluids in the flip-chip packaging technology is reasonable, and (2) the solder bump resistance to the flow can not be neglected when the clearance between any two solder bumps is less than 6070?m. We subsequently present a new model, which extends the one proposed by Han and Wang in 1997 by considering the solder bump resistance to the flow.

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

transient effect
dynamic contact angle
fluid filling time


LMI-BASED ADAPTIVE FUZZY INTEGRAL SLIDING MODE CONTROL OF MISMATCHED UNCERTAIN SYSTEMS Integral sliding mode design is considered for a class of uncertain systems in the presence of mismatched uncertainties in both state and input matrices, as well as norm-bounded nonlinearities and external disturbances. A sufficient condition for the robust stability of the sliding manifold is derived by means of linear matrix inequalities. The initial existence of the sliding mode is guaranteed by the proposed control law. The improvement of the proposed control scheme performances, such as chattering elimination and estimation of norm bounds of uncertainties, is then considered with the application of an adaptive fuzzy integral sliding mode control law. The validity and efficiency of the proposed approaches are investigated through a sixth order uncertain mechanical system.

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

integral sliding mode
mismatched uncertainties


Verified distance computation between non-convex superquadrics using hierarchical space decomposition structures Verified distance computation is an important task in various application domains. In some domains a proof of correctness is crucial. In this paper, we show how we can apply the methods provided by our uniform framework for verified geometric computations to derive verified bounds on the distance between non-convex objects. The framework features a layered structure enabling the algorithm to run independently whether the objects are described by implicit functions or parametric ones or by polyhedrons. The approach is based on the use of adaptively constructed hierarchical decompositions of the models. As a practical example we use various scenarios occurring in automatic surgery assistance systems for total hip replacement (THR). To ensure that an implant selected by the system fits into the patients femoral shaft, we have to derive verified bounds on the distance between them. In this case, the models are either superquadrics or polyhedrons, both of which can be non-convex We first show how to increase the enclosure quality of implicit objects by incorporating interval contractors into the hierarchical space decomposition. Next, we describe the construction of a decomposition structure for parametric objects. After that, we present an improvement of the case selector for computing the distance between interval tree nodes, yielding tighter results. We also show how to integrate surface normals into the algorithm if first-order information is available and how to accelerate the solving process by incorporating information gained by non-verified floating-point solvers. Finally, we provide numerical results for all distance query types occurring during the THR procedure and examine whether it is advisable to perform the computation on the implicit model or on the parametric one if both are available. Further numerical results are presented for test cases involving contractors in the decomposition structures.

O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 framework for geometric computations


Regexpcount, a symbolic package for counting problems on regular expressions and words In previous work [10], we considered algorithms related to the statistics of matches with words and regular expressions in texts generated by Bernoulli or Markov sources. In this work these algorithms are extended for two purposes: to determine the statistics of simultaneous counting of different motifs, and to compute the waiting time for the first match with a motif in a model which may be constrained. This extension also handles matches with errors. The package is fully implemented and gives access to high and low level commands. We also consider an example corresponding to a practical biological problem: getting the statistics for the number of matches of words of size 8 in a genome (a Markovian sequence), knowing that an (overrepresented DNA protecting) pattern named Chi occurs a given number of times.

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

marked automata
generating functions
computer algebra


Atomicity Analysis of Service Composition across Organizations Atomicity is a highly desirable property for achieving application consistency in service compositions. To achieve atomicity, a service composition should satisfy the atomicity sphere, a structural criterion for the backend processes of involved services. Existing analysis techniques for the atomicity sphere generally assume complete knowledge of all involved backend processes. Such an assumption is invalid when some service providers do not release all details of their backend processes to service consumers outside the organizations. To address this problem, we propose a process algebraic framework to publish atomicity-equivalent public views from the backend processes. These public views extract relevant task properties and reveal only partial process details that service providers need to expose. Our framework enables the analysis of the atomicity sphere for service. compositions using these public views instead of their backend processes. This allows service consumers to choose suitable services such that their composition satisfies the atomicity sphere without disclosing the details of their backend processes. Based on the theoretical result, we present algorithms to construct atomicity-equivalent public views and to analyze the atomicity sphere for a service composition. Two case studies from the supply chain and insurance domains are given to evaluate our proposal and demonstrate the applicability of our approach.

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

privacy protection
process algebra
theory and models
web services


A Bayesian approach to detect pedestrian destination-sequences from WiFi signatures WiFi traces are used to detect pedestrian activity-episode sequence. They are merged with other data: attractivity, map and time constraints. Ambiguity of the data is explicitly modeled. Novel method to generate candidate activity-episode sequences and their likelihood. Detailed validation and sensitivity analysis is performed.

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

semantically-enriched routing graph (serg)


Earnings forecasts in enterprise information systems environment With the globalisation and integration of world financial markets, the application of enterprise information systems has become more and more popular in the financial service sector. This paper examines the analyst's decision regarding allocation of effort to the precision and timeliness of earnings forecasts with financial decision support systems. Once an analyst decides to follow a firm, the analyst must choose the level of effort to devote to generating outputs, such as earnings forecasts. This paper provides insights into this by examining three issues concerning the forecasts of the individual analyst. First, forecast accuracy and frequency are modelled simultaneously. Then, whether these two effort allocation choices are complements or substitutes is tested. Finally, how competition affects these two characteristics is examined. The accuracy and frequency are examined with simultaneous equations. Results from this analysis suggest that analysts allocate effort among these two forecast criteria in a complementary way. Finally, empirical results reveal a positive association between competition and forecast frequency by the individual analyst. However, a significant association between competition and the individual analyst's forecast accuracy is not found.

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

decision support systems
forecast accuracy
forecast frequency
competition

enterprise information systems for financial sector


Fresh Press Modeler: A generative system for physically based low fidelity prototyping Automatic finger joint generation. Rapid prototyping of watertight structure. True representation of a 3D model based on laser cut parts.

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

press fit
planar structures
digital fabrication
laser cutting


interorganizational coordination and awareness in a nonprofit ecosystem Nonprofit organizations working with high-risk vulnerable populations such as human trafficking victims often need to engage in a significant level of interorganizational collaboration. Given the importance for nonprofits to be able to work with many different organizations, and given the importance of awareness in initiating and facilitating such collaborations, we conducted a field study to explore existing practices around coordination and awareness across a specific ecosystem of nonprofit organizations. In this paper, we provide an in-depth reflection on interorganizational issues among a cross-section of nonprofits. We identify four aspects of the interorganizational context in which these nonprofits must operate, as well as challenges they may encounter. Our goal is to illuminate first steps towards finding appropriate technological solutions for supporting coordination and awareness between these organizations so they can be more effective in accomplishing their mission.

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

nonprofit organizations
awareness
interorganizational coordination


Provision of supplementary materials in library and information science scholarly journals Purpose - This study seeks to analyse the policies of library and information science (US) journals regarding the publication of supplementary materials, the number of journals and articles that include this feature, the kind of supplementary materials published with regard to their function in the article, the formats employed and the access provided to readers. Design/methodology/approach - The study analysed the instructions for authors of US journals indexed in the ISI Journal Citation Reports, as well as the supplementary materials attached to the articles published in their 2011 online volumes. Findings - Large publishers are more likely to have a policy regarding the publication of supplementary materials, and policies are usually homogeneous across all the journals of a given publisher. Most policies state the acceptance of supplementary materials, and even journals without a policy also publish supplementary materials. The majority of supplementary materials provided in LIS articles are extended methodological explanations and additional results in the form of textual information in PDF or Word files. Some toll-access journals provide open access to any reader to these files. Originality/value - This study provides new insights into the characteristics of supplementary materials in US journals. The results may be used by journal publishers to establish a policy on the publication of supplementary materials and, more broadly, to develop data sharing initiatives in academic settings.

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

library and information science
journals
supplementary materials
data sharing

bibliometrics
scholarly publishing
publishing


STABILITY AND ACCURACY OF LATTICE BOLTZMANN SCHEMES FOR ANISOTROPIC ADVECTION-DIFFUSION EQUATIONS The stability of the numerical schemes for anisotropic advection-diffusion equations derived from the lattice Boltzmann equation with the D2Q4 particle velocity model is analyzed through eigenvalue analysis of the amplification matrices of the scheme. Accuracy of the schemes is investigated by solving benchmark problems, and the LBM scheme is compared with traditional implicit schemes. Numerical experiments demonstrate that the LBM scheme produces stable numerical solutions close to the analytical solutions when the values of the relaxation parameters in x and y directions are greater than 1.9 and the Courant numbers satisfy the stability condition. Furthermore, the numerical solutions produced by the LBM scheme are more accurate than those of the Crank-Nicolson finite difference scheme for the case where the Courant numbers are set to be values close to the upper bound of the stability region of the scheme.

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

anisotropic advection-diffusion
lattice boltzmann method
stability of the numerical scheme
accuracy of the scheme


learning objects The purpose of this paper is to introduce a concept known commonly as the "learning object", articulate the foundational principles for developing a concept of LOs, and to provide guidelines for creating LOs. The paper proposes a view of the content packaging of learning objects grounding on the IMS Content Packaging and the SCORM (Sharable Content Object Reference Model).

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


Modeling and computing throughput capacity of wireless multihop networks ? Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., protocol interference, unidirectional links, perfect scheduling or perfect routing) and either provide asymptotic bounds or are based on integer linear programming solvers. In this paper, we present a probabilistic approach to capacity calculation by linking the normalized throughput of a communicating pair in an ad hoc network to the connection probability of the two nodes in a so-called schedule graph GT(N,E) G T ( N , E ) . The effective throughput of a random network is modeled as a random variable and its expected value is computed using Monte-Carlo methods. A schedule graph GT(N,E) G T ( N , E ) for a given network is directly derived from the physical properties of the network like node distribution, radio propagation and channel assignment. The modularity of the approach leads to a capacity analysis under more realistic network models. In the paper, throughput capacity is computed for various forms of network configurations and the results are compared to simulation results obtained with ns-2.

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


Multiscale traveling: crossing the boundary between space and scale Adding multiscale interaction capabilities to 3D virtual environments may permit work with huge virtual worlds that might otherwise be too large to manage. Multiscale technology has shown potential to support user interactions. This paper reports an experimental study of two multiscale traveling techniques. Our results show that while allowing a flexible control on travel speed and accuracy is beneficial, directly traversing the space-scale could be a challenge for users, probably due to difficulties in perceiving scalable virtual space and executing scaling operations. The results suggest that more research is needed to improve the understanding of the coupling of space and scale in multiscale user interface and to harness the full potentials of multiscale traveling techniques.

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


Multilevel preconditioning of rotated bilinear non-conforming FEM problems Preconditioners based on various multilevel extensions of two-level finite element methods (FEM) lead to iterative methods which often have an optimal order computational complexity with respect to the number of degrees of freedom of the system. Such methods were first presented in [O. Axelsson, P.S. Vassilevski, Algebraic multilevel preconditioning methods I, Numer. Math. 56 (1989) 157177; O. Axelsson, P.S. Vassilevski, Algebraic multilevel preconditioning methods II, SIAM J. Numer. Anal. 27 (1990) 15691590] on (recursive) two-level splittings of the finite element space. The key role in the derivation of optimal convergence rate estimates is played by the constant ? ? in the so-called strengthened CauchyBunyakowskiSchwarz (CBS) inequality, associated with the angle between the two subspaces of the splitting. More precisely, the value of the upper bound for ??(0,1) ? ? ( 0 , 1 ) is a part of the construction of various multilevel extensions of the related two-level methods. In this paper algebraic two-level and multilevel preconditioning algorithms for second-order elliptic boundary value problems are constructed, where the discretization is done using RannacherTurek non-conforming rotated bilinear finite elements on quadrilaterals. An important point to make is that in this case the finite element spaces corresponding to two successive levels of mesh refinement are not nested in general. To handle this, a proper two-level basis is required to enable us to fit the general framework for the construction of two-level preconditioners for conforming finite elements and to generalize the method to the multilevel case. The proposed variants of the hierarchical two-level basis are first introduced in a rather general setting. Then, the parameters involved are studied and optimized. The major contribution of the paper is the derived estimates of the constant ? ? in the strengthened CBS inequality which is shown to allow the efficient multilevel extension of the related two-level preconditioners. Representative numerical tests well illustrate the optimal complexity of the resulting iterative solver.

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

non-conforming fem
multilevel preconditioners
hierarchical basis
cbs constant


Coherence and recurrency: maintenance, control and integration in working memory Working memory (WM), including a central executive, is used to guide behavior by internal goals or intentions. We suggest that WM is best described as a set of three interdependent functions which are implemented in the prefrontal cortex (PFC). These functions are maintenance, control of attention and integration. A model for the maintenance function is presented, and we will argue that this model can be extended to incorporate the other functions as well. Maintenance is the capacity to briefly maintain information in the absence of corresponding input, and even in the face of distracting information. We will argue that maintenance is based on recurrent loops between PFC and posterior parts of the brain, and probably within PFC as well. In these loops information can be held temporarily in an active form. We show that a model based on these structural ideas is capable of maintaining a limited number of neural patterns. Not the size, but the coherence of patterns (i.e., a chunking principle based on synchronous firing of interconnected cell assemblies) determines the maintenance capacity. A mechanism that optimizes coherent pattern segregation, also poses a limit to the number of assemblies (about four) that can concurrently reverberate. Top-down attentional control (in perception, action and memory retrieval) can be modelled by the modulation and re-entry of top-down information to posterior parts of the brain. Hierarchically organized modules in PFC create the possibility for information integration. We argue that large-scale multimodal integration of information creates an episodic buffer, and may even suffice for implementing a central executive.

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

working memory
maintenance
control of attention
integration
prefrontal cortex


computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations Spectral techniques have found many applications in computer-aided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coefficients to be calculated via graph-based algorithms. In this paper, algorithms are described for transforming multi-output functions to produce Walsh, arithmetic, and Reed-Muller spectral decision diagrams and the experimental results of those implementations are presented.

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

spectral methods
discrete functions
data structures


A virtual grouping based fault-tolerant scheme for autonomous networks In an autonomous network environment, each independent node communicates with others by some agreement mechanism to make sure that the majority of nodes can take a common corresponding action. Under a constraint on the amount of faulty nodes, the classical solution, Byzantine Agreement (BA), has been proved to effectively make all healthy nodes able to obey the same command issued from the commander node. The major challenge for BA is its considerable amount of exchanged messages among nodes to reach the consensus, especially when BA is applied to a network environment, which comprises a lot of cooperative nodes. Such a situation may hinder BA from being practically applied in the modern network environment, such as an autonomous wireless sensor network. Thus, we propose a Virtual Grouping Byzantine Agreement (VGBA) scheme to compromise between the percentage of nodes, which can obtain the common command, and the number of exchanged messages produced in the network. That means that VGBA may suffer a lower tolerance capability of faulty nodes and a lower percentage of healthy nodes having the command, but it significantly reduces the message volume. Consequently, the improved VGBA scheme is still applicable while facing a larger number of nodes. (C) 2013 Elsevier Ltd. All rights reserved.

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

autonomous network
byzantine agreement
virtual grouping


Applied relaxation: an experimental analogue study of therapist vs. computer administration This experimental analog component study compared two ways of administrating relaxation, either via a computer or by a therapist. The second phase of applied relaxation was used, which is called release-only relaxation. Sixty participants from a student population were randomized to one of three groups: computer-administered relaxation, therapist-administered relaxation, or a control group in which participants surfed on the Internet. Outcome was measures using psychophysiological responses and self-report. Objective psychophysiological data and results on the subjective visual analogue scale suggest that there was no difference between the two forms of administration. Both experimental groups became significantly more relaxed than the control group that surfed on the Internet. Practical applications and future directions are discussed.

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

applied relaxation
computer administration
internet


Universal psychometrics: Measuring cognitive abilities in the machine kingdom We present and develop the notion of universal psychometrics as a subject of study, and eventually a discipline, that focusses on the measurement of cognitive abilities for the machine kingdom, which comprises any (cognitive) system, individual or collective, either artificial, biological or hybrid. Universal psychometrics can be built, of course, upon the experience, techniques and methodologies from (human) psychometrics, comparative cognition and related areas. Conversely, the perspective and techniques which are being developed in the area of machine intelligence measurement using (algorithmic) information theory can be of much broader applicability and implication outside artificial intelligence. This general approach to universal psychometrics spurs the re-understanding of most (if not all) of the big issues about the measurement of cognitive abilities, and creates a new foundation for (re)defining and mathematically formalising the concept of cognitive task, evaluable subject, interface, task choice, difficulty, agent response curves, etc. We introduce the notion of a universal cognitive test and discuss whether (and when) it may be necessary for exploring the machine kingdom. On the issue of intelligence and very general abilities, we also get some results and connections with the related notions of no-free-lunch theorems and universal priors.

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

psychometrics
cognitive abilities
artificial intelligence
algorithmic information theory


Proactive channel access in cognitive radio networks using statistical radio environment maps Inclusion of statistical knowledge of the primary user (PU) channel usage had shown to be beneficial in dynamic spectrum access. Motivated by this fact, this paper investigated the importance of collecting and using statistics on neighboring secondary users (SUs) in selecting channels in addition to the knowledge of PU channel usage. The paper assumed that PU traffic characteristics of the channels are included in the radio environment map in the form of probabilistic suffix trees, which is a sequence predictor based on Markov property. In the proposed method, an intelligent sequence hopping-based common control channel and a carrier sense multiple access (CSMA)/collision avoidance (CA)-based medium access control (MAC) protocol were introduced. As shown in the paper, selecting channels using statistics of both the neighboring SUs and PUs reduced the number of packet collisions compared to a scheme which only uses PU statistics. Furthermore, the simulation results showed that the scheme proposed had better throughput performance with respect to both the random channel selection scheme and the scheme which only uses PU statistics while having less training complexity.

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

prediction methods
predictive control
artificial intelligence


Combined characteristics and finite volume methods for sediment transport and bed morphology in surface water flows We propose a new numerical method for solving the equations of coupled sediment transport and bed morphology by free-surface water flows. The mathematical formulation of these models consists of the shallow water equations for the hydraulics, an advection equation for the transport of sediment species, and an Exner equation for the bedload transport. The coupled problem forms a one-dimensional hyperbolic system of conservation laws with geometric source terms. The proposed numerical method combines the method of characteristics with a finite volume discretization of the system. The combined method is simple to implement and accurately resolves the governing equations without relying on Riemann problem solvers. Numerical results are presented for several test examples on sediment transport and bed morphology by free-surface water flows. (C) 2011 IMACS. Published by Elsevier B.V. All rights reserved.

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

shallow water equations
sediment transport
bed morphology
method of characteristics


A WIDE SUPPLY RANGE BANDGAP VOLTAGE REFERENCE WITH CURVATURE COMPENSATION For the requirement of power management controller chips, a wide supply range bandgap voltage reference circuit is presented. The preregulated circuit based on the regulation characteristic of zener diode extends the supply range and increases power supply rejection ratio (PSRR). Compensated by the base-emitter voltage (V-BE) linearization technique, the temperature stability of the bandgap circuit is improved further. The proposed circuit is implemented in a 0.4 mu m bipolar CMOS DMOS (BCD) process and Spice simulation has been done for validation. The results of simulation and test show that the supply range of this circuit can reach 7.2 V to 40 V and 159 mu V/V of supply voltage dependence; the temperature coefficient is just 3.5 ppm/degrees C over a wide temperature of -40 degrees C to 125 degrees C and PSRR is up to -94 dB at 1 kHz. For the perfective performance, this circuit can be used in wide temperature and wide supply range integrated circuit design.

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

bandgap voltage reference
wide supply range
curvature compensation
temperature coefficient
psrr
bcd process


A convex formulation for joint RNA isoform detection and quantification from multiple RNA-seq samples Detecting and quantifying isoforms from RNA-seq data is an important but challenging task. The problem is often ill-posed, particularly at low coverage. One promising direction is to exploit several samples simultaneously.

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

rna-seq
alternative splicing
muti-task estimation
convex optimization


Influence of class distribution on cost-sensitive learning: A case study of bankruptcy analysis Skewed class distribution and non-uniform misclassification cost are pervasive in many real-world domains such as bankruptcy prediction, medical diagnosis, and intrusion detection. Although class imbalance learning and cost-sensitive learning can be manipulated in a unified framework as was illustrated in previous studies, the influence of class distribution on cost-sensitive learning still needs clarification. In this paper, we investigate the effect of cost ratio, imbalance ratio and sample size on classification performance using a real-world French bankruptcy database. The results show that the cost ratio and the level of class imbalance have strong effect on prediction performance. A near-balanced training data set is favorable when a relatively uniform cost ratio is used, whereas a near-natural class distribution is favorable when a highly uneven cost ratio is used.

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

classification
class imbalance
bankruptcy prediction

non-uniform misclassification cost
cost-sensitive learning


An Ultra-Low Bandwidth Design Method for MPEG-2 to H.264/AVC Transcoding Motion estimation (ME) is a computation and data intensive module in video coding system. The search window reuse methods play a critical role in bandwidth reduction by exploiting the data locality in video coding system. In this paper, a search window reuse method (Level C+) is proposed for MPEG-2 to H.264/AVC transcoding. The proposed method is designed for ultra-low bandwidth application, while the on-chip memory is not a main constraining factor. By loading search window for the motion estimation unit (MEU) and applying motion vector clipping processing, each MB in MEU can utilize both horizontal and vertical search reuse. A very low bandwidth level (R(alpha) < 2) can be achieved with an acceptable on-chip memory.

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

transcoding
motion estimation
search window reuse


Reducing Test Time Using an Enhanced RF Loopback This work presents a method to improve the loopback test used in RF transceivers. The approach is targeted to the System-On-Chip environment, being able to reuse system resources in order to minimize the test overhead. An RF sampler is used during loopback operation, allowing observation of spectral characteristics of the RF signal. While able to improve the overall observability of the RF signal path, faster diagnosis than conventional loopback tests is achieved thanks to a large reduction in the number of transmitted symbols. Theoretical analysis and practical results for a prototype transceiver operating at 846MHz are presented. It is shown that a significant test time reduction is achievable considering bit error rate tests for common digital modulation schemes.

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


Shape preserving multiplications of fuzzy numbers In this note, we show that T-W, the weakest t-norm, is the only t-norm T which induces a shape preserving multiplications of LR-fuzzy numbers. (C) 2001 Elsevier Science B.V. All rights reserved.

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


Correlation between parameter sensitivity and counter-intuitive phenomenon of elasticplastic beam dynamics Method of parameter sensitivity is applied to study the counter-intuitive phenomenon observed in numerical, analytical and experimental studies on the dynamic response of elasticplastic beams. Direct differentiation approach and central difference approach are used in parameter sensitivity analysis. It is shown that the direct differentiation approach is more suitable for extremely parameter-sensitive problems. A correlation between the parameter sensitivity analysis and the occurrence of the counter-intuitive phenomenon of beam dynamics is established, which is then used to identify the range of the loading parameters for the occurrence of the counter-intuitive phenomenon.

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

elasticplastic beam
dynamic response
parameter sensitivity


a computer graphics curriculum to meet the european bologna requirements Computer graphics programmes in Europe have been working to address the requirements of the Bologna education process. This poster presents the results of a workshop held in Vienna, Austria in September 2006 that developed an outline for computer graphics curricula to meet those requirements.

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

curriculum
computer graphics
bologna requirements


An adaptive extension library for improving collective communication operations In this paper, we present an adaptive extension library that combines the advantage of using a portable MPI library with the ability to optimize the performance of specific collective communication operations. The extension library is built on top of MPI and can be used with any MPI library. Using the extension library, performance improvements can be achieved by an orthogonal organization of the processors in 2D or 3D meshes and by decomposing the collective communication operations into several consecutive phases of MPI communication. Additional point-to-point-based algorithms are also provided. The extension library works in two steps, an a priori configuration phase detecting possible improvements for implementing collective communication for the MPI library used and an execution phase selecting a better implementation during execution time. This allows an adaptation of the performance of MPI programs to a specific execution platform and communication situation. The experimental evaluation shows that significant performance improvements can be obtained for different MPI libraries by using the library extension for collective MPI communication operations in isolation as well as in the context of application programs. Copyright (c) 2007 John Wiley & Sons, Ltd.

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


Flexible hybrid WDM/TDM PON architectures using wavelength selective switches For building an optical access network, we propose some new hybrid WDM/TDM passive optical network (PON) architectures that use wavelength selective switches (WSSs) at the remote node to improve flexibility, data security and power budget. Through simulations we demonstrate that the switching capabilities of a WSS can provide additional gains in terms of wavelength usage by a better statistical multiplexing. Several WSS-based hybrid WDM/TDM PON variants are proposed and assessed. These architectures are also compared with the more commonly used hybrid WDM/TDM PONs consisting of power splitters and/or arrayed wavelength gratings (AWGs), in terms of cost and power budget.

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

optical access
pon architectures
flexibility

hybrid wdm/tdm
dynamic bandwidth allocation


A clustering method based on multidimensional texture analysis Considering the analogy between image segmentation and cluster analysis, the aim of this paper is to adapt statistical texture measures to describe the spatial distribution of multidimensional observations. The main idea is to consider the cluster cores as domains characterized by their specific textures in the data space. The distribution of the data points is first described as a multidimensional histogram defined on a multidimensional regular array of sampling points. In order to evaluate locally a multidimensional texture, a co-occurrence matrix is introduced, which characterizes the local distribution of the data points in the multidimensional data space. Several local texture features can be computed from this co-occurrence matrix, which accumulates spatial and statistical information on the data distribution in the neighborhoods of the sampling points. Texture features are selected according to their ability to discriminate different distributions of data points. The sampling points where the local underlying texture is evaluated are categorized into different texture classes. The points assigned to these classes tend to form connected components in the data space, which are considered as the cores of the clusters.

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

co-occurrence matrices
feature selection


how valuable are shopbots? The price information that shopbots provide to buyers is clearly valuable, as it enables them to make a better informed choice of product and vendor. We quantify the value of this price information to the buyer in terms of the price dispersion and the buyer's brand preferences, and consider scenarios in which the buyer pays a seller, a shopbot, or some other third party for price information. As an illustration, we compute the value of price information of well known retailers in online book markets, using data on price dispersion and brand preferences reported by Smith and Brynjolfsson, finding that information about a book's price can be about 6\% to 10\% as valuable as the book itself.

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


Aluminum bulk micromachining through an anodic oxide mask by electrochemical etching in an acetic acid/perchloric acid solution A new aluminum bulk micromachining through an anodic oxide mask was developed. Laser irradiation of anodized aluminum results in the formation of a locally exposed aluminum pattern. The anodic oxide acted as a resist mask during electrochemical etching. A hemicylindrical microgroove with a flat surface was fabricated by electrochemical etching. Free-standing oxides formed by an undercutting were easily removed by ultrasonication.

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

bulk micromachining
aluminum
electrochemical etching
laser irradiation


The role of affect and cognition on online consumers' decision to disclose personal information to unfamiliar online vendors Based on the privacy calculus framework and the stimulusorganismresponse (SOR) model, this study examines online information disclosure decision as a result of affective and cognitive reactions of online consumers over several stages, i.e. an initial stage where an overall impression is formed about an unfamiliar online vendor, and a subsequent information exchange stage where information necessary to complete the ecommerce transaction will be provided to the online vendor. We found that, initial emotions formed from an overall impression of a Web site act as initial hurdles to information disclosure. Once online consumers enter the information exchange stage, fairness-based levers further adjust privacy beliefs.

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

privacy belief
privacy concern
emotion
e-commerce
social contract


Optical properties of stepped InxGa1?xAs/GaAs quantum wells A systematic study of InxGa1?xAs/InyGa1?yAs/GaAs(001) stepped quantum wells with indium composition x=14.9% and y=6.4% and thicknesses in the range of quasi-two-dimensional behaviour of Wannier excitons is performed. Optical spectra are compared with model calculations obtained by an accurate exciton envelope function. We point out that optical spectroscopy is a tool for studying indium diffusion in stepped wells, and this property is crucial in order to obtain second harmonic generation enhanced with respect to the bulk value.

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

polaritons
strained iii-v semiconductors


Applying model-checking to solve queries on semistructured data The large volume and nature of data available to the casual users and programs motivate the increasing interest of the database community in studying flexible and efficient techniques for extracting and querying semistructured data. On the other hand, efficient methods have been discovered for solving the so-called model-checking problem for some modal logics. The aim of this paper is to show how some of these methods can be used for querying semistructured data. For doing that we show that semistructured data can be naturally seen as Kripke Transition Systems. To keep the presentation independent of a specific language, we introduce a graphical query language that includes some of the features of the query languages based on graphs and patterns. We show how to associate CTL formulas to queries of this language. This allows us to see the problems of solving a query as an instance of the model-checking problem for CTL that can be solved in polynomial time. We have tested the method by using a model-checker, and have studied the applicability of the method to some existing languages for semistructured databases.

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


Reducing the Steiner problem in four uniform orientations We studied the Steiner tree problem in four uniform orientations where any line, half-line, or line segment must be on a line which makes an angle of (i pi)/4 with the positive x-axis, for some i is an element of{0,1,2,3}, and the distance between two points is measured as the length of the shortest polygonal path connecting them. We show that for any set P of n terminal points there exists a Steiner minimum tree interconnecting P such that all Steiner points are in G([2n/3]-1)(P), the ([(2n)/3]-1)(st)-generation grid points of P. Our result improves the previous best result which guarantees that for any set P of n terminal points there is a Steiner minimum tree in which all Steiner points are in G(n-2)(P). (C) 2000 John Wiley & Sons, Inc.

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

vlsi design
steiner minimum trees
octagonal routing


Deleting the subject: A feminist reading of epistemology in artificial intelligence This paper argues that AI follows classical versions of epistemology in assuming that the identity of the knowing subject is not important. In other words this serves to 'delete the subject'. This disguises an implicit hierarchy of knowers involved in the representation of knowledge in AI which privileges the perspective of those who design and build the systems over alternative perspectives. The privileged position reflects Western, professional masculinity. Alternative perspectives, denied a voice, belong to less powerful groups including women. Feminist epistemology can be used to approach this from new directions, in particular, to show how women's knowledge may be left out of consideration by AI's focus on masculine subjects. The paper uncovers the tacitly assumed Western professional male subjects in two flagship AI systems, Cyc and Soar.

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


Complexity of model checking for reaction systems Reaction systems are a new mathematical formalism inspired by the living cell and driven by only two basic mechanisms: facilitation and inhibition. As a modeling framework, they differ from the traditional approaches based on ODEs and CTMCs in two fundamental aspects: their qualitative character and the non-permanency of resources. In this article we introduce to reaction systems several notions of central interest in biomodeling: mass conservation, invariants, steady states, stationary processes, elementary fluxes, and periodicity. We prove that the decision problems related to these properties span a number of complexity classes from P P to NP NP - and coNP coNP -complete to PSPACE PSPACE -complete.

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

reaction systems
model checking
biomodeling
invariants
periodicity
complexity classes

conserved sets
steady state
stationary process
elementary flux


Adaptive reduced basis finite element heterogeneous multiscale method An adaptive reduced basis finite element heterogeneous multiscale method (RB-FE-HMM) is proposed for elliptic problems with multiple scales. The multiscale method is based on the RB-FE-HMM introduced in [A. Abdulle, Y. Bai, Reduced basis finite element heterogeneous multiscale method for high-order discretizations of elliptic homogenization problems, J. Comput. Phys. 231 (21) (2012) 70147036]. It couples a macroscopic solver with effective data recovered from the solution of micro problems solved on sampling domains. Unlike classical numerical homogenization methods, the micro problems are computed in a finite dimensional space spanned by a small number of accurately computed representative micro solutions (the reduced basis) obtained by a greedy algorithm in an offline stage. In this paper we present a residual-based a posteriori error analysis in the energy norm as well as an a posteriori error analysis in quantities of interest. For both type of adaptive strategies, rigorous a posteriori error estimates are derived and corresponding error estimators are proposed. In contrast to the adaptive finite element heterogeneous multiscale method (FE-HMM), there is no need to adapt the micro mesh simultaneously to the macroscopic mesh refinement. Up to an offline preliminary stage, the RB-FE-HMM has the same computational complexity as a standard adaptive FEM for the effective problem. Two and three dimensional numerical experiments confirm the efficiency of the RB-FE-HMM and illustrate the improvements compared to the adaptive FE-HMM.

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

numerical homogenization
heterogeneous multiscale method

reduced basis method
residual based adaptive fem
quantity of interest


An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix ? The uncapacitated facility location problem is considered in case when the transportation matrix has a totally balanced characteristic matrix. Since this problem is equivalent to the minimization problem of a polynomial in Boolean variables, an efficient algorithm is developed in terms of the latter. The idea of the algorithm is based on the fact that the minimization problem of a totally balanced polynomial can be reduced to the minimization problem of a similar polynomial having one fewer variables.

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

facility location
totally balanced matrix


Elasto-plastic analysis of plates by the element free Galerkin method Purpose - The aim of this paper is to extend the Element Free Galerkin method (EFGM) in order to perform the elasto-plastic analysis of isotropic plates. Design/methodology/approach - The EFGM shape-function construction is briefly presented. The Newton-Raphson method and the elasto-plastic algorithm adapted to the EFGM, are described. Several plate bending non-linear material problems are solved and the obtained solutions are compared with available finite element method (FEM) solutions. Findings - The paper finds that the developed EFGM approach is a good alternative to the FEM for the solution of non-linear problems, once the obtained results with the EFGM show a high similarity with the obtained FEM results. Research limitations/implications - Comparing the FEM and the EFGM there are some drawbacks for the EFGM. The computational cost of the EFGM is higher, the imposition of the essential boundary conditions is more complex and there is a high sensitivity of the method in what concerns the choice of the influence domain and the choice of the weight function. Practical implications - The knowledge that the EFGM formulation can be treated almost as the FEM formulation once the EFGM parameters are calibrated and optimized. Originality/value - The extension of the EFGM to the elasto-plastic analysis of isotropic plates.

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


Large eddy simulation of homogeneous shear flows with several subgrid-scale models In this article, large eddy simulation is used to simulate homogeneous shear flows. The spatial discretization is accomplished by the spectral collocation method and a third-order Runge-Kutta method is used to integrate the time-dependent terms. For the estimation of the subgrid-scale stress tensor, the Smagorinsky model, the dynamic model, the scale-similarity model and the mixed model are used. Their predicting performance for homogeneous shear flow is compared accordingly. The initial Reynolds number varies from 33 to 99 and the initial shear number is 2. Evolution of the turbulent kinetic energy, the growth rate, the anisotropy component and the subgrid-scale dissipation rate is presented. In addition, the performance of several filters is examined. Copyright (c) 2005 John Wiley & Sons, Ltd.

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


Logic programming in the context of multiparadigm programming: the Oz experience Oz is a multiparadigm language that supports logic programming as one of its major paradigms. A multiparadigm language is designed to support different programming paradigms (logic, functional, constraint, object-oriented, sequential, concurrent, etc.) with equal ease. This paper has two goals: to give a tutorial of logic programming in Oz; and to show how logic programming fits naturally into the wider context of multiparadigm programming. Our experience shows that there are two classes of problems, which we call algorithmic and search problems, for which logic programming can help formulate practical solutions. Algorithmic problems have known efficient algorithms. Search problems do not have known efficient algorithms but can be solved with search. The Oz support for logic programming targets these two problem classes specifically, using the concepts needed for each. This is in contrast to the Prolog approach, which targets both classes with one set of concepts, which results in less than optimal support for each class. We give examples that can be run interactively on the Mozart system, which implements Oz, To explain the essential difference between algorithmic and search programs, we define the Oz execution model. This model subsumes both concurrent logic programming (committed-choice-style) and search-based logic programming (Prolog-style). Furthermore, as consequences of its multiparadigm nature, the model supports new abilities such as first-class top levels, deep guards, active objects, and sophisticated control of the search process. Instead of Horn clause syntax, Oz has a simple, fully compositional, higher-order syntax that accommodates the abilities of the language. We give a brief history of Oz that traces the development of its main ideas and we summarize the lessons learned from this work. Finally, we give many entry points into the Oz literature.

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

multiparadigm programming
prolog
oz
history

language design
encapsulated search
concurrent constraint programming
software development


a processor for a high-performance personal computer This paper describes the design goals, micro- architecture, and implementation of the microprogrammed processor for a compact high performance personal computer. This computer supports a range of high level language environments and high bandwidth I/O devices. Besides the processor, it has a cache, a memory map, main storage, and an instruction fetch unit; these are described in other papers. The processor can be shared among 16 microcoded tasks, performing microcode context switches on demand with essentially no overhead. Conditional branches are done without any lookahead or delay. Microinstructions are fairly tightly encoded, and use an interesting variant on control field sharing. The processor implements a large number of internal registers, hardware stacks, a cyclic shifter/masker, and an arithmetic/logic unit, together with external data paths for instruction fetching, memory interface, and I/O, in a compact, pipe-lined organization. The machine has a 50 ns microcycle, and can execute a simple macroinstruction in one cycle; the available I/O bandwidth is 640 Mbits/sec. The entire machine, including disk, display and network interfaces, is implemented with approximately 3000 MSI components, mostly ECL 10K; the processor is about 35\% of this. In addition there are up to 4 storage modules, each with about 300 16K or 64K RAMS and 200 MSI components, for a total of 8 Mbytes. Several prototypes are currently running.

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

network
use
goals
design
delay
context
interfaces
paper
control
processor
sharing
organization
cache
compact
environments
personal computer
language
storage
implementation
instruction
data
bandwidth
hardware

intern computation high-performance microarchitecture component stack prototype device module memorialized logic switch


An efficient three-dimensional adaptive quasicontinuum method using variable-node elements A new quasicontinuum (QC) implementation using the so-called variable-node finite elements is reported in this work. Tetrahedral elements, which have been exclusively utilized for the conventional QC are replaced by hexahedral elements in conjunction with the so-called variable-node elements. This enables an effective adaptive mesh refinement in QC, leading to fast and efficient simulations compared with the conventional QC. To confirm the solution accuracy, comparison is made for a nanoindentation problem with a molecular dynamics simulation as well as a molecular mechanics solution. Further examples of nanoindentation are shown and discussed to demonstrate the effectiveness of the present scheme.

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

nanoindentation
adaptive mesh refinement

qasicontinuum
variable-node elements
multiscale modeling


personal location based services on place-enhanced blog This paper proposes personal location based services on blog to make users recall past memories and things to do by displaying their personal records like diary, schedule and to-do list depending on the positions of the users. A lot of Internet users are recording their personal experiences and knowledge as texts and other digital media on the network. These users' created content is called "User Generated Content" (UGC). One of the reasons that users record their experiences and knowledge is not only informing other users about author's opinions but also retrieving them as needed. Although users can retrieve these records easily through their personal computer, it is difficult to retrieve them at the right place because most UGC systems do not have features to deal with some place attributes, on the other hand current commercial LBS do not support to deal with personal records. Our proposed tool provides users with an environment to store personal records with related place attributes, and to retrieve these personal records at the right place. There are two applications on this tool, a place enhanced blog and a place reminder on a mobile phone. A place enhanced blog provide users with blog interfaces for inputting place information. The place reminder is a browser for spatial data on the place enhanced blog. Users can generate place information by writing personal records on their blog. Furthermore, using the place reminder, other users can retrieve all users' permitted personal records on the spots. Also, the place reminder can serve as a simple navigation system using both GPS and non-GPS navigation methods

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

location based service
personal information
mobile device


Extreme market risk and extreme value theory The phenomenon of the occurrence of rare yet extreme events, "Black Swans" in Taleb's terminology, seems to be more apparent in financial markets around the globe. This means there is not only a need to design proper risk modelling techniques which can predict the probability of risky events in normal market conditions but also a requirement for tools which can assess the probabilities of rare financial events; like the recent global financial crisis (2007-2008). An obvious candidate, when dealing with extreme financial events and the quantification of extreme market risk is extreme value theory (EVT). This proves to be a natural statistical modelling technique of relevance. Extreme value theory provides well-established statistical models for the computation of extreme risk measures like the return level, value at risk and expected shortfall. In this paper we apply univariate extreme value theory to model extreme market risk for the ASX-All Ordinaries (Australian) index and the S&P-500 (USA) Index. We demonstrate that EVT can be successfully applied to financial market return series for predicting static VaR. CVaR or expected shortfall (ES) and expected return level and also daily VaR using a GARCH(1,1) and EVT based dynamic approach. (C) 2012 IMACS. Published by Elsevier B.V. All rights reserved.

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

risk modelling
value at risk
expected shortfall
extreme value theory


Comparison of various fluidstructure interaction methods for deformable bodies A perspective is given on fictitious domain methods for deformable bodies that exert large motions induced by unsteady flow. In these methods an Eulerian and Lagrangian formulation are employed for the fluid and solid, respectively, and both bodies are coupled using a Lagrange multiplier. The use of a multiplier allows the solid not to be an integral part of the fluid mesh. Three variations of the fictitious domain method that have been published before, are compared to an ALE method in two numerical experiments and in conclusion the advantages, disadvantages and differences for the different approaches are discussed.

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

fsi
fictitious domains
deformable solids
lagrange multipliers


Analytic image unwarping by a systematic calibration method for omni-directional cameras with hyperbolic-shaped mirrors Unwarping an omni-directional image into a perspective-view one is easy for a single-viewpoint (SVP) designed catadioptric omni-directional camera. But misalignment between the components (such as the mirror and the lens) of this kind of camera creates multiple viewpoints and distorts the unwarped image if the SVP constraint is assumed. The SVP constraint is relaxed in this study and a systematic method is proposed to derive a set of new and general analytic equations for unwarping images taken from an omni-directional camera with a hyperbolic-shaped mirror (called a hypercatadioptric camera). The derivation is made possible by careful investigation on the system configuration and precise calibration of involved system parameters. As a verification of the correctness of the derived equations, some of the system parameters are adjusted to fit the SVP constraint, and unwarped images using the resulting simplified camera model are shown to be of no difference from those obtained by a method based on the SVP model. The generality of the proposed method so has extended the image-unwarping capability of the existing methods for the hypercatadioptric camera to tolerate lens/mirror assembly imprecision, which is difficult to overcome in most real applications. Some experimental results of image unwarping are also included to show the effectiveness of the proposed method.

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

image unwarping
hypercatadioptric camera

omni-directional camera
single-viewpoint (svp) constraint
hyperbolic mirror
camera calibration
analytic solution


Linear inductive antenna design for large area flat panel display plasma processing Two different internal-type linear inductive antenna arrangements, that is, parallel and anti-parallel antenna arrangements having different current directions between adjacent antennas were investigated for a large area plasma source having the size of 1020mm830mm. The electric field profile and plasma density of Ar calculated by the F2L code showed consistent results with the experimental results on the plasma density and processing results. The results showed that the anti-parallel antenna arrangement showed better plasma uniformity compared to the parallel antenna arrangement due to the destructive Ez-field between adjacent antennas even though the destructive Ez-field decreases the plasma density at the center of the chamber.

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


semi-supervised ranking aggregation Ranking aggregation is important in data mining and information retrieval. In this paper, we proposed a semi-supervised ranking aggregation method, in which the order of several item pairs are labeled as side information. The core idea is to learn a ranking function based on the ordering agreement of different rankers. The ranking scores assigned by this ranking function on the labeled data are consistent with the given pairwise order constraints while the ranking scores on the unlabeled data obey the intrinsic manifold structure of the rank items. The experiment results show our method work well.

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

semi-supervised learning
data manifold
quadratic programming


Information quality: Critical ingredient for national security Information Quality Management is critical for national security not just because of the myriad information types, including textual, audio, video and other complex information types and to the difficulties in collecting intelligence information, but because of the consequences of failure of national security caused by low-quality information. The diversity and breadth of the number of autonomous or semi-autonomous agencies create complexity in aggregating data from disparately defined databases. Federal laws, an open society, human rights and privacy further hinder the ability to collect, access, aggregate and use certain information. The collection of intelligence information requires rigorous procedures and technologies to error-proof the collection processes, to assure information quality and techniques for analyzing less-than-optimum-quality information. Data definition and database design for information required across multiple agencies can and must be standardized to prevent misinterpretation and analysis failure. Standard Information Quality Management processes with specific considerations applied to address the nature of intelligence information. Cultural transformation within various intelligence community organizations will enable agencies to sustain a level of information quality to minimize the risks of national security process failure.

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

data definition quality
data quality intelligence
information architecture quality
information sharing
intelligence information quality


Viscous flows in corner regions: Singularities and hidden eigensolutions Numerical issues arising in computations of viscous flows in corners formed by a liquid fluid free surface and a solid boundary are considered. It is shown that on the solid a Dirichlet boundary condition, which removes multivaluedness of velocity in the 'moving contact-line problem' and gives rise to a logarithmic singularity of pressure, requires a certain modification of the standard finite-element method. This modification appears to be insufficient above a certain critical value of the corner angle where the numerical solution becomes mesh-dependent. As shown, this is due to an eigensolution, which exists for all angles and becomes dominant for the supercritical ones. A method of incorporating the eigensolution into the numerical method is described that makes numerical results mesh-independent again. Some implications of the unavoidable finiteness of the mesh size in practical applications of the finite-element method in the context of the present problem are discussed. Copyright (C) 2009 John Wiley & Sons, Ltd.

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

finite-element methods
navier stokes
incompressible flow
two-phase flows


fast gaze typing with an adjustable dwell time Previous research shows that text entry by gaze using dwell time is slow, about 5-10 words per minute (wpm). These results are based on experiments with novices using a constant dwell time, typically between 450 and 1000 ms. We conducted a longitudinal study to find out how fast novices learn to type by gaze using an adjustable dwell time. Our results show that the text entry rate increased from 6.9 wpm in the first session to 19.9 wpm in the tenth session. Correspondingly, the dwell time decreased from an average of 876 ms to 282 ms, and the error rates decreased from 1.28\% to .36\%. The achieved typing speed of nearly 20 wpm is comparable with the result of 17.3 wpm achieved in an earlier, similar study with Dasher.

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

text entry
gaze typing
longitudinal study


Analysis and prevention of convex corner undercutting in bulk micromachined silicon microstructures Convex corner undercutting in silicon is an undesired phenomena during bulk micromachining of crystalline silicon substrate using anisotropic wet chemical etching process. The present investigation concentrates on the studies of convex corner undercutting at the free end of silicon cantilever beams released by anisotropic etching process. It also reports a simple, space efficient compensation design for complete prevention of corner deformation. Various compensation patterns such as square, rectangle and superposition of square and rectangular blocks of various dimensions have been employed at the free end corners of cantilever beam to protect corner deformation due to undercutting. The experiment was carried out in 44wt.% KOH at 70C using oriented silicon wafer. Both n-type and p-type silicon wafers were used to study the variations in the nature of corner deformation. A simple empirical relation has been obtained from the experimental data to calculate the lateral dimensions of the compensation layout from the total etch depth required to release the structure.

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

corner undercutting
anisotropic etching
compensation patterns


An Online Failure Detection Method for Data Buses Using Multithreshold Receiving Logic Random voltage changes on bus lines may lead to reading corrupted digital data. A novel methodology for detecting such anomalies is proposed. It uses multiple threshold voltages at the receiver end. In earlier work it was shown that multiple voltage thresholds improve the performance along buses, especially when they are coupled as is often the case in deep-submicron. This work shows that multiple thresholds can also be used to identify voltage perturbations online. The mechanism is assessed on bus lines that may have up to two adjacent aggressors. The efficiency of the methodology is evaluated for perturbations at single and multiple receiving nodes of a data bus.

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


A Novel Mobility Management Scheme for Integration of Vehicular Ad Hoc Networks and Fixed IP Networks Integration of vehicular ad hoc network and fixed IP network is important to provide Internet connection and mobile data service for vehicles. However, the unique characteristics of vehicular networks, such as linear topology and constrained movements of vehicles, are not considered in the conventional mobility management schemes. Using conventional schemes, unnecessary management messages are generated and the connections to roadside-installed base stations are not fully utilized. As the results, bandwidth is wasted and data delivery ratio is not maximized. In this paper, we propose a novel mobility management scheme to integrate vehicular ad hoc network and fixed IP networks more efficiently. The proposed scheme manages mobility of vehicles based on street layout as well as the distance between vehicles and base stations. Utilizing the unique characteristics of vehicular networks, the proposed scheme has substantially less mobility management overhead and higher data delivery ratio. The proposed scheme is simulated by SUMO (a vehicular traffic simulator) and QualNet (a data network simulator). The simulation results show that the proposed scheme reduced the mobility management overhead up to 63% and improved the data delivery ratio up to 90%.

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

vehicular networks
integration
vehicular ad hoc networks
fixed ip networks
mobility management


adaptive web-based multiplexer educational tool A Web-based application for combinational logic functions realization using multiplexer that can be used for self-education is presented in the article. A functional model with student, expert and educator modules is realized. A set of educator's comments on student's activities and corresponding directions to overcome user's mistakes is proposed and implemented. A scheme where the education ends after two consecutive tasks are decided with no mistake is used. The tool can use different languages. A measurable Learning Ability Coefficient is applied.

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

applets
web-based educational tools
adaptive e-learning


Exhaustive and Efficient Constraint Propagation: A Graph-Based Learning Approach and Its Applications This paper presents a novel pairwise constraint propagation approach by decomposing the challenging constraint propagation problem into a set of independent semi-supervised classification subproblems which can be solved in quadratic time using label propagation based on \(k\)-nearest neighbor graphs. Considering that this time cost is proportional to the number of all possible pairwise constraints, our approach actually provides an efficient solution for exhaustively propagating pairwise constraints throughout the entire dataset. The resulting exhaustive set of propagated pairwise constraints are further used to adjust the similarity matrix for constrained spectral clustering. Other than the traditional constraint propagation on single-source data, our approach is also extended to more challenging constraint propagation on multi-source data where each pairwise constraint is defined over a pair of data points from different sources. This multi-source constraint propagation has an important application to cross-modal multimedia retrieval. Extensive results have shown the superior performance of our approach.

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

pairwise constraint propagation
constrained spectral clustering

semi-supervised classification
multi-source data
cross-modal retrieval


commercial film detection and identification based on a dual-stage temporal recurrence hashing algorithm This paper proposes a dual-stage temporal recurrence hashing algorithm for fully unsupervised and super-fast Commercial Film (CF) mining in large-scale broadcast video archives. The first-stage hashing algorithm converts a large amount of video segments into a set of temporal occurrence patterns on the basis of a luminance-based fingerprinting strategy. During the second stage, each temporal recurrence of a certain segment is mapped to an inverted index to build a recurrence hashing histogram, which is the key idea in this paper to achieve super-fast CF detection and identification. The detection and identification task is then converted into one of detecting local maximums from this hashing histogram, with one local maximum corresponding to one pair of two identical CF segments. A large-scale archive, containing a 10-hour and a 1-month sequence, was used for experimentation. Our algorithm performed CF detection and identification on the 1-month sequence in merely 87 minutes and had 90.59\% detection accuracy and 98.06\% localization accuracy.

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