Integration of Decentralized Clinical Data in a Data Warehouse A Service-oriented Design and Realization Objectives: In this paper we present a general concept and describe the difficulties for the integration of data from various clinical partners in one data warehouse using the Open European Nephrology Science Center (OpEN.SC) as an example. This includes a requirements analysis of the data integration process and also the design according to these requirements. Methods: This conceptual approach based on the Rational Unified Process (RUP) and paradigm of Service-Oriented Architecture (SOA). Results: Because we have to enhance the confidence of our partners in the OpEN.SC system and with this the willingness of them to participate, important requirements are controllability, transparency and security for all partners. Reusable and fine-grained components were found to be necessary when working with diverse data sources. With SOA the requested reusability is implemented easily. Conclusions: A key step in the development of a data integration process within such a health information system like OpEN.SC is to analyze the requirements. And to show that this is not only a theoretical work, we present a design - developed with RUP and SOA which fulfills these requirements.

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

data storage and retrieval
multicenter studies as topic
information management
software design


Finite-element analysis of a PBGA assembly under isothermal/mechanical twisting loading In order to reduce the reliability testing time for new electronic products, a new highly accelerated mechanical-thermal (HAMT) test system has been developed. In this system, a cyclic out-of-plane deformation is imposed on a printed circuit board (PCB) assembly by twisting the PCB mechanically inside a thermal chamber. The combined effects of the mechanical deformation and the coefficient of thermal expansion (CTE) mismatch of different materials accelerate the failure of solder joints, so as to reduce the reliability testing time of the PCB assembly. To verify the test method, HAMT tests of plastic ball grid array (PBGA) assemblies were carried out in an isothermal environment. Finite-element (FE) simulations were conducted to predict the reliability of the PBGA assemblies under the isothermal/mechanical twisting (ITMT) loading condition. In this paper, the simulation results are presented. The failure locations in the PBGA solder joints under the ITMT loading condition are investigated, and the fatigue life of the interconnections is predicted using Darveaux's crack initiation and growth model. The simulation results exhibit a good correlation with the test results.

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

fea
low-cycle fatigue
solder joint
electronic packaging


the case for separating routing from routers Over the past decade, the complexity of the Internet's routing infrastructure has increased dramatically. This complexity and the problems it causes stem not just from various new demands made of the routing infrastructure, but also from fundamental limitations in the ability of today's distributed infrastructure to scalably cope with new requirements.The limitations in today's routing system arise in large part from the fully distributed path-selection computation that the IP routers in an autonomous system (AS) must perform. To overcome this weakness, interdomain routing should be separated from today's IP routers, which should simply forward packets (for the most part). Instead, a separate Routing Control Platform (RCP) should select routes on behalf of the IP routers in each AS and exchange reachability information with other domains.Our position is that an approach like RCP is a good way of coping with complexity while being responsive to new demands and can lead to a routing system that is substantially easier to manage than today. We present a design overview of RCP based on three architectural principles path computation based on a consistent view of network state, controlled interactions between routing protocol layers, and expressive specification of routing policies and discuss the architectural strengths and weaknesses of our proposal.

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

network
stem
interdomain routing
platform
design
computation
forward
case
routing protocol
infrastructure
control
select
routing
complexity
distributed
reachability

requirements
policy
express
bgp
domain
router
response
informal
management
posit
interaction
systems
routing architecture
architecture
layer
consistency
internet
autonomic system


A general framework for representing, reasoning and querying with annotated Semantic Web data We describe a generic framework for representing and reasoning with annotated Semantic Web data, a task becoming more important with the recent increased amount of inconsistent and non-reliable meta-data on the Web. We formalise the annotated language, the corresponding deductive system and address the query answering problem. Previous contributions on specific RDF annotation domains are encompassed by our unified reasoning formalism as we show by instantiating it on (i) temporal, (ii) fuzzy, and (iii) provenance annotations. Moreover, we provide a generic method for combining multiple annotation domains allowing to represent, e.g., temporally-annotated fuzzy RDF. Furthermore, we address the development of a query language AnQL that is inspired by SPARQL, including several features of SPARQL 1.1 (subqueries, aggregates, assignment, solution modifiers) along with the formal definitions of their semantics.

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


Microscopically implicitmacroscopically explicit schemes for the BGK equation ? In this work a new class of numerical methods for the BGK model of kinetic equations is introduced. The schemes proposed are implicit with respect to the distribution function, while the macroscopic moments are evolved explicitly. In this fashion, the stability condition on the time step coincides with a macroscopic CFL, evaluated using estimated values for the macroscopic velocity and sound speed. Thus the stability restriction does not depend on the relaxation time and it does not depend on the microscopic velocity of energetic particles either. With the technique proposed here, the updating of the distribution function requires the solution of a linear system of equations, even though the BGK model is highly non linear. Thus the proposed schemes are particularly effective for high or moderate Mach numbers, where the macroscopic CFL condition is comparable to accuracy requirements. We show results for schemes of order 1 and 2, and the generalization to higher order is sketched.

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


Analytical Model to Evaluate the Performance of Mobile Agents in a Generic Network Topology The constant growth of computer and telecommunication networks and the variety of topologies being interconnected are making the efficient management of these networks a hard task. Centralized management, currently the most used model, is becoming inflexible and inefficient in view of this growth. On the other hand, code mobility is being considered as a possible solution to this problem. However, no research proposes a way to identify wich technique is the best to perform any management task in a network with any configuration. In this context, the present work proposes an analytical model to evaluate the performance of Mobile Agents in the decentralization of the management compared with the traditional and centralized management model in a generic network topology.

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

mobile agents
analytical model
generic network topology

performance evaluation
network management


Connectionless protocol: a localised approach to wireless ad hoc networks Most mobile ad hoc network's communication techniques need to discover routes and establish a connection before they can communicate. This strategy cannot robustly adapt to frequent unpredictable topology changes due to high mobility. Constant reconnections incur significant overhead making these schemes unsuitable for applications such as voice and video. To address these issues, we explore a connectionless paradigm in this paper. By leverage GPS technology, data packets are relayed along the general direction to packets' destination using different intermediate nodes at different times without having to first establish a connection. The performance of this solution is essentially unaffected by node mobility.

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

communication connection
localised scheme
routing protocol


Hybrid documents co-citation analysis: making sense of the interaction between science and technology in technology diffusion The paper presents a methodology called hybrid documents co-citation analysis, for studying the interaction between science and technology in technology diffusion. Our approach rests mostly on patent citation, cluster analysis and network analysis. More specifically, with the patents citing Smalley RE in Derwent innovations index as the data sets, the paper implemented hybrid documents co-citation network through two procedures. Then spectrum cluster algorithm was used to reveal the knowledge structure in technology diffusion. After that, with the concordance between network properties and technology diffusion mechanisms, three indicators containing degree, betweenness and citation half-life, were calculated to discuss the basic documents in the pivotal position during the technology diffusion. At last, the paper summarized the hybrid documents co-citation analysis in practise, thus concluded that science and technology undertook different functions and acted dominatingly in the different period of technology diffusion, though they were co-activity all the time.

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

technology diffusion
cluster analysis
network analysis


Effective and Efficient Query Processing for Video Subsequence Identification With the growing demand for visual information of rich content, effective and efficient manipulations of large video databases are increasingly desired. Many investigations have been made on content-based video retrieval. However, despite the importance, video subsequence identification, which is to find the similar content to a short query clip from a long video sequence, has not been well addressed. This paper presents a graph transformation and matching approach to this problem, with extension to identify the occurrence of potentially different ordering or length due to content editing. With a novel batch query algorithm to retrieve similar frames, the mapping relationship between the query and database video is first represented by a bipartite graph. The densely matched parts along the long sequence are then extracted, followed by a filter-and-refine search strategy to prune some irrelevant subsequences. During the filtering stage, Maximum Size Matching is deployed for each subgraph constructed by the query and candidate subsequence to obtain a smaller set of candidates. During the refinement stage, Sub-Maximum Similarity Matching is devised to identify the subsequence with the highest aggregate score from all candidates, according to a robust video similarity model that incorporates visual content, temporal order, and frame alignment information. The performance studies conducted on a long video recording of 50 hours validate that our approach is promising in terms of both search accuracy and speed.

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

subsequence identification
query processing

multimedia databases
similarity measures


On the influence of foundation flexibility on the seismic response of structures The main objective of this paper is to contribute to a quantification of the effect of foundation flexibility on the most important design variables in the seismic response of building structures with prismatic rectangular foundations. A soilstructure interaction model was used for this purpose. A general continuum formulation was adopted to represent the physical model of the structure and a lumped parameter model was adopted to represent the soil and the interaction mechanisms. Using the implemented models and in view of the objective of the work, a parametric study was made. For this purpose, a group of three structures, three seismic accelerations and seven sets of soil properties will be considered. The results obtained, in view of the large number of uncertainties involved, are presented in a probabilistic format and suggest that the soilstructure interaction can be neglected in the analysis of this class of structures.

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

soilstructure interaction
foundations
parametric study

seismic design
earthquake resistant structures


Optimization of implicitly defined functions Gradient methods for local optimization of implictly defined functions are presented. The methods are structurally unstable under data perturbations that create null-points of Fy = partial derivativeF/partial derivativey, where F(x, y) = 0 defines y(x). Then, a set filtration method for global optimization of implictly defined functions under constraints is proposed which is structurally stable under data perturbations. Example are considered illustrating theory and numerical algorithms. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

local optimization
global optimization
set filtration
data perturbations


Towards hybridization of knowledge representation and machine learning Machine learning and knowledge representation are two fields of artificial intelligence that lead with intelligent reasoning, each one differently. When Knowledge Representation (KR) focuses more on the epistemological face of knowledge to carry out a power-expression model with detriment of the computation efficiency. Machine learning pays more attention to the computation efficiency, often with loss of expressing power. In this paper we show that features of one may overwhelm drawbacks of the other. Taking the uncertainty artefact from machine learning and symbolic representation from KR, we propose in this paper a new memory modelling for knowledge based systems which is at the same time machine-learning structure and a knowledge representation model. In terms of machine learning, our structure allows an unlimited flexibility where no restraining architecture is imposed at the beginning (think about decision trees [18, 6, 5, 2]). Classification can be performed with incomplete vectors where the most likely corresponding class is assigned to the vector with missing attributes. Viewed as a knowledge model, a basic knowledge is easily specified graphically. Inference is defined by rules expressed in the same manner, where the existing sub-instances are used to generate new connections and entities. Inference on existing knowledge is described in two algorithms. Our approach is mainly based on the representation of the context concept. Our model brings together advantages of the symbolic knowledge representation, namely human to computer knowledge coding, and those of machine learning structures, namely ease of efficient coding of inference to perform the so-called intelligent tasks like pattern recognition, prediction and others. Its graphical representation allows visualization of both dynamic and static sides of the model (i.e. inference and knowledge).

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

knowledge representation (kr)
machine learning (ml)


prioritizing remote procedure calls in ada distributed systems In this paper we discuss the assignment of priorities to the execution of remote procedure calls in distributed real-time systems that are programmed using the Distributed Systems Annex (DSA) of Ada 95. We first discuss the current priority model used in the Glade implementation of the DSA. We then present some theoretical results that show that a more flexible priority assignment methodology can provide much better schedulable utilization levels. Based upon these results we propose an implementation that would allow using this priority assignment methodology in Glade. Finally, we propose new features for a future DSA that would allow prioritizing remote procedure calls in a flexible manner.

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

ada distributed systems annex
real-time
priority optimization


Homotopy in two-dimensional digital images We recall the basic definitions concerning homotopy in 2D Digital Topology, and we set and prove several results concerning homotopy of subsets. Then we introduce an explicit isomorphism between the fundamental group of a 2D connected object and a (non-abelian) free group. As a consequence, we provide an algorithm for deciding whether two closed path are homotopic. (C) 2000 Elsevier Science B.V. All rights reserved.

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

digital topology
homotopy
fundamental group


Complexity of min-max subsequence problems We determine the computational complexity of the problem of ordering a set of n numbers, either into a sequence or a cycle, such that the maximum sum of any k successive numbers is minimal. Both problems are easy for k = 2 and strongly NP-hard for any k greater than or equal to 3. However, the two problems allow a polynomial-time approximation scheme that is linear in n. (C) 2003 Elsevier B.V. All rights reserved.

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

polynomial-time approximation scheme
min-max subsequence problem


Smoothness-constrained quantization for wavelet image compression Uniform quantization of wavelet coefficients introduces perceptually disturbing artifacts by decreasing visual smoothness. In this paper, local Holder regularity is used to quantify these changes in visual smoothness. A modified uniform quantization scheme that constrains local regularity decreases is proposed. The quantizer modification is applicable to any uniform quantization scheme and requires no additional side information to be transmitted to the decoder, unlike standard deadzone quantizers. The reconstructed images show a noticeable perceptual improvement as well as an increased PSNR relative to uniform quantization.

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

dead zone quantization
perceptual image compression
smoothness constrained quantization
wavelet coefficient shrinkage


The role of adipocytokines in fetal growth Cumulative evidence suggests that the origins of obesity may occur during fetal development. In this respect, the concept of developmental programming was introduced and supported by experimental and epidemiological data. This concept supports the idea that the nutritional and hormonal status during pregnancy could irreversibly interfere in metabolism control. The mechanisms responsible for this developmental programming remain poorly documented. However, recent research indicates that adipocytokines may play a critical role in this process. Thus, leptin, adiponectin, and the recently identified resistin, visfatin, and apelin, all exert effects on fat, muscle, and liver cells early in life. The aforementioned adipocytokines are secreted by adipocytes and human placenta during fetal life and may play a major role in the etiopathogenesis of the metabolic syndrome. This review will focus on the intrauterine expression of adipocytokines, their contribution to the hormonal control of fetal growth, and their role in restricted and exaggerated intrauterine growth.

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

fetal growth
adipocytokines
metabolic syndrome


Efficient virtual reality design of quiet underwater shells Abstract

finite element analysis
sub-structural analysis
reduced order models
meta-models
multi-criteria design optimization
design in virtual reality environment


Pattern recognition techniques for automatic detection of suspicious-looking anomalies in mammograms We have employed two pattern recognition methods used commonly for face recognition in order to analyse digital mammograms. The methods are based on novel classification schemes, the AdaBoost and the support vector machines (SVM). A number of tests have been carried out to evaluate the accuracy of these two algorithms under different circumstances. Results for the AdaBoost classifier method are promising, especially for classifying mass-type lesions. In the best case the algorithm achieved accuracy of 76% for all lesion types and 90% for masses only. The SVM based algorithm did not perform as well. In order to achieve a higher accuracy for this method, we should choose image features that are better suited for analysing digital mammograms than the currently used ones.

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

mammogram analysis
computer-aided diagnosis
machine learning


Optimisation under hybrid uncertainty Fuzzy Stochastic Optimisation is emerging as a subfield of Mathematical programming, the disciplinary matrix of which consists of analysis of mathematical programs under fuzziness and randomness along with methods for solving them. The "primum movens" of this paper is to describe a unifying methodological approach, that is suitable for finding a satisfying solution of a mathematical program in the presence of fuzzy data and random variables. Properties of fuzzy random variables (FRVs) serve as the backdrop to this approach which also lends itself better to handling mathematical programs with fuzzy random coefficients. For the paper to be somewhat self-contained, the notion of FRV is briefly discussed and a synopsis of Fuzzy Stochastic Optimisation provided. A systematically solved example aimed at illustrating the proposed approach is also included. (C) 2004 Elsevier B.V. All rights reserved.

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

fuzzy random variable (frv)
fuzzy number
random variable


On the Trade-Off between Network Connectivity, Round Complexity, and Communication Complexity of Reliable Message Transmission Perfectly reliable message transmission (PRMT) is one of the fundamental problems in distributed computing. It allows a sender to reliably transmit a message to a receiver in an unreliable network, even in the presence of a computationally unbounded adversary. In this article, we study the inherent trade-off between the three important parameters of the PRMT protocols, namely, the network connectivity (n), the round complexity (r), and the communication complexity by considering the following generic question (which can be considered as the holy grail problem) in the context of the PRMT protocols. Given an n-connected network, a message of size l (to be reliably communicated) and a limit c for the total communication allowed between the sender and the receiver, what is the minimum number of communication rounds required by a PRMT protocol to send the message, such that the communication complexity of the protocol is O(c)? We answer this interesting question by deriving a nontrivial lower bound on the round complexity. Moreover, we show that the lower bound is tight in the amortized sense, by designing a PRMT protocol whose round complexity matches the lower bound. The lower bound is the first of its kind, that simultaneously captures the inherent tradeoff between the three important parameters of a PRMT protocol.

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

distributed computing
computationally unbounded
message transmission


A new clustering algorithm for coordinate-free data This paper presents the colored farthest-neighbor graph (CFNG), a new method for finding clusters of similar objects. The method is useful because it works for both objects with coordinates and for objects without coordinates. The only requirement is that the distance between any two objects be computable. In other words, the objects must belong to a metric space. The CFNG uses graph coloring to improve on an existing technique by Rovetta and Masulli. Just as with their technique, it uses recursive partitioning to build a hierarchy of clusters. In recursive partitioning, clusters are sometimes split prematurely, and one of the contributions of this paper is a way to reduce the occurrence of such premature splits, which also result when other partition methods are used to find clusters.

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


Do smarter systems make for smarter organizations? This article explores the role of knowledge-based systems (KBS) in knowledge management (KM). KM is considered an umbrella term, incorporating various issues related to the value of knowledge as a production factor. This study assesses three research themes which together address the main object of KM. First, how do the introduction and utilization of KBS affect the organizational core competencies? Secondly, is the knowledge content of products and services affected by KBS? Thirdly, how do these systems affect job quality? The results of an empirical investigation in 24 knowledge-intensive, commercial organizations show that KBS usually have a positive impact on organizational competencies. They reveal that KBS may both threaten and enhance the knowledge content of certain tasks. They also show that, in general, the introduction of KBS leads to a slight decrease in job quality.

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

knowledge management
core competencies
job quality

organizational impact of knowledge-based systems


Bott-Duffin inverse over the quaternion skew field with applications In this paper, we show some properties of the Bott-Duffin inverses \(A_{r_{ ( L_{1} ) }}^{ ( -1 ) }\) and \(A_{l_{ ( L_{2} ) }}^{ ( -1 ) }\) over the quaternion skew field. In particular, we establish the determinantal representations of these generalized inverses by the theory of the column and row determinants. Moreover, we derive some Cramer rules for the unique solution to some restricted linear quaternion equations. The findings of this paper extend some known results in the literature.

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


An approach to designing and evaluating blended courses Recently, there has been an increased interest in producing electronic courses. However, literature shows that adopting e-learning does not guarantee improved learning. This is because mixing technology and content does not necessarily yield effective learning. This paper presents a systematic design process for developing blended courses for undergraduate higher education. The instructional design process is based on instructional design theories and utilized three taxonomies: Bloom Taxonomy, Redeker Taxonomy and Guerra scale. A mapping model is proposed and embedded in the design process to develop a blended course starting from the objectives and content of a traditional course. This paper also presents a evaluation process that estimates the effectiveness of the selected technologies in the design of the blended course. This effectiveness is evaluated in terms of three dimensions: course content formats, interaction and collaboration. A case study is presented to demonstrate the proposed design approach on a System Analysis and Design blended course under development.

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

instructional blended course design
design evaluation


Fabrication and electrical characteristics of ultrathin (HfO2)x(SiO2)1?x films by surface solgel method and reaction-anneal treatment Hafnium oxide (HfO2) films were deposited on Si substrates with a pre-grown oxide layer using hafnium chloride (HfCl4) source by surface solgel process, then ultrathin (HfO2)x(SiO2)1?x films were fabricated due to the reaction of SiO2 layer with HfO2 under the appropriate reaction-anneal treatment. The observation of high-resolution transmission electron microscopy indicates that the ultrathin films show amorphous nature. X-ray photoelectron spectroscopy analyses reveal that surface solgel derived ultrathin films are HfSiO alloy instead of HfO2 and pre-grown SiO2 layer, and the composition was Hf0.52Si0.48O2 under 500C reaction-anneal. The lowest equivalent oxide thickness (EOT) value of 0.9nm of film annealed at 500C has been obtained with small flatband voltage of ?0.31V. The experimental results indicate that a simple and feasible solution route to fabricate (HfO2)x(SiO2)1?x composite films has been developed by means of combination of surface solgel and reaction-anneal treatment.

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

high-k dielectrics
(hfo2)x(sio2)1?x
reaction-anneal


optimal xor hashing for a linearly distributed address lookup in computer networks Hashing algorithms have been widely adopted to provide a fast address look-up process which involves a search through a large database to find a record associated with a given key. Modern examples include address-lookup in network routers for a forwarding outgoing link, rule-matching in intrusion detection systems comparing incoming packets with a large database, etc. Hashing algorithms involve transforming a key inside each target data to a hash value hoping that the hashing would render the database a uniform distribution with respect to this new hash value. When the database are already key-wise uniformly distributed, any regular hashing algorithm would easily lead to perfectly uniform distribution after the hashing. On the other hand, if records in the database are instead not uniformly distributed, then different hashing functions would lead to different performance. This paper addresses the case when such distribution follows a natural negative linear distribution, which is found to approximate distributions in many various applications. For this distribution, we derive a general formula for calculating the distribution variance produced by any given non-overlapped bit-grouping XOR hashing function. Such a distribution variance from the hashing directly translates to performance variations in searching. In this paper, the best XOR hashing function is determined for any given key size and any given hashing target size.

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

intrusion detection
hashing
computer networks
address lookup

packet matching
network security
internet


Developing an educational software framework for distance-less learning Abstract This paper considers educational technology as both a tool and process. The focus is on a strategy to develop a software framework with reusable components to support a specific teaching/learning (the Question-and-Answer) model. It demonstrates how such a software framework can be used for building educational software systems which can be adapted easily to different levels and subjects of education on top of Internet/Intranet and web technologies. As a result, the developed educational environment is called distance-less, allowing students to have instant support from teachers by way of an existing virtual permanent connection. An example is provided of a teaching/learning model which was built based on the development principles and guidelines proposed in the paper and which shows one possible application for use with an existing learning and teaching system.

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

distance-less learning
distributed learning
post-secondary
software design
student-centred
taxonomy
internet
world-wide web


A tool for generating synthetic authorship records for evaluating author name disambiguation methods The author name disambiguation task has to deal with uncertainties related to the possible many-to-many correspondences between ambiguous names and unique authors. Despite the variety of name disambiguation methods available in the literature to solve the problem, most of them are rarely compared against each other. Moreover, they are often evaluated without considering a time evolving digital library, susceptible to dynamic (and therefore challenging) patterns such as the introduction of new authors and the change of researchers interests over time. In order to facilitate the evaluation of name disambiguation methods in various realistic scenarios and under controlled conditions, in this article we propose SyGAR, a new Synthetic Generator of Authorship Records that generates citation records based on author profiles. SyGAR can be used to generate successive loads of citation records simulating a living digital library that evolves according to various publication patterns. We validate SyGAR by comparing the results produced by three representative name disambiguation methods on real as well as synthetically generated collections of citation records. We also demonstrate its applicability by evaluating those methods on a time evolving digital library collection generated with the tool, considering several dynamic and realistic scenarios.

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

author name disambiguation
digital library
synthetic generator


CheS-Mapper 2.0 for visual validation of (Q)SAR models Sound statistical validation is important to evaluate and compare the overall performance of (Q)SAR models. However, classical validation does not support the user in better understanding the properties of the model or the underlying data. Even though, a number of visualization tools for analyzing (Q)SAR information in small molecule datasets exist, integrated visualization methods that allow the investigation of model validation results are still lacking.

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


Modelling force deployments from army installations using the transportation system capability (TRANSCAP) model: A standardized approach Argonne National Laboratory (Argonne) developed the transportation system capability (TRANSCAP) model to simulate the deployment of forces from Army bases, in collaboration with and under the sponsorship of the Military Transportation Management Command Transportation Engineering Agency (MTMCTEA). TRANSCAP's design separates its pre- and post-processing modules (developed in Java) from its simulation module (developed in MODSIM III(R)). This paper describes TRANSCAP's modelling approach, emphasizing Argonne's highly detailed, object-oriented, multilanguage software design principles. Fundamental to these design principles is TRANSCAP's implementation of an improved method for standardizing the transmission of simulated data to output analysis tools and the implementation of three Army deployment/redeployment community standards, all of which are in the final phases of community acceptance. The first is the extensive hierarchy and object representation for transport simulations (EXHORT), which is a reusable, object-oriented deployment simulation source code framework of classes. The second and third are algorithms for rail deployment operations at a military base. (C) 2004 Elsevier Ltd. All rights reserved.

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

discrete-event simulation
army standards
standardization
object-oriented analysis
object-oriented design


Group-oriented settings multisigncryption scheme with threshold designcryption Signcryption supports the authenticity and confidently in a single logic step and it has more efficient cost than the signature-then-encryption approach. Currently signcryption schemes only support a peer to peer secure message transfer between single users, and thus it cannot be adapted to the group users in multiple senders and receivers. In this paper, we propose a group-oriented multisigncryption scheme with threshold designcryption in multi-users setting, which combines the threshold secret sharing technology, zero knowledge proof for the bilinear map equality of two discrete logarithms, multi-signature and identity-based signcryption schemes. The ciphertext in the proposed scheme is computed by all the m members in sender group, and it can be decrypted only by t-out-of-n members in receiver group. We prove the security of the proposed scheme in several models including semantic security, unforgeability, public ciphertext authenticity and verifiability.

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

multisigncryption
threshold designcryption
unforgeability


on optimal communication cost for gathering correlated data through wireless sensor networks In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g.overall energy) used for data collection, previous works have focused on specific coding schemes, such as Slepian-Wolf Code or Explicit Entropy Code. However, the minimum communication cost under arbitrary coding/routing schemes has not yet been characterized. In this paper, we consider the problem of minimizing the total communication cost of a wireless sensor network with a single sink. We prove that the minimum communication cost can be achieved using Slepian-Wolf Code and Commodity Flow Routing when the link communication cost is a convex function of link data rate. Furthermore, we find it useful to introduce a new metric distance entropy, a generalization of entropy, to characterize the data collection limit of networked sources. When the energy consumption is proportional to the link data rate (e.g.normally in 802.11), we show that distance entropy provides a lower bound of the communication cost and can be achieved by using a specific rate SWC and shortest path routing. Theoretically, achieving optimality may require global knowledge of the data correlation structure, which may not be available in practice. Therefore, we propose a simple, hierarchical scheme that primarily exploits data correlation between local neighboring nodes. We show that for several correlation structures and topologies, the communication cost achieved by this scheme is within a constant factor of the distance entropy, i.e., it is asymptotically optimal. Finally, we simulate our algorithm using radar reffectivity data as well as traces from Gaussian Markov Fields (GMF). As the network size goes large, for the radar data, we find our algorithm saves two thirds of the communication cost compared to a non-coding approach; as for the GMF data, our algorithm converges to a constant factor (1 .5_1.8) the distance entropy.

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

joint coding and routing
network coding
distributed source coding
communication cost minimization


Lambda-dropping: transforming recursive equations into programs with block structure Lambda-lifting a block-structured program transforms it into a set of recursive equations. We present the symmetric transformation: lambda-dropping. Lambda-dropping a set of recursive equations restores block structure and lexical scope. For lack of block structure and lexical scope, recursive equations must carry around all the parameters that any of their callees might possibly need. Both lambda-lifting and lambda-dropping thus require one to compute Def/Use paths: for lambda-lifting: each of the functions occurring in the path of a free variable is passed this variable as a parameter; for lambda-dropping: parameters which are used in the same scope as their definition do not need to be passed along in their path. A program whose blocks have no free variables is scope-insensitive. Its blocks are then free to float (for lambda-lifting) or to sink (for lambda-dropping) along the vertices of the scope tree. To summarize: [GRAPHICS] Our primary application is partial evaluation. Indeed, many partial evaluators for procedural programs operate on recursive equations. To this end, they lambda-lift source programs in a pre-processing phase. But often, partial evaluators [automatically] produce residual recursive equations with dozens of parameters, which most compilers do not handle efficiently. We solve this critical problem by lambda-dropping residual programs in a post-processing phase, which significantly improves both their compile time and their run time. To summarize: [GRAPHICS] Lambda-lifting has been presented as an intermediate transformation in compilers for functional languages. We study lambda-lifting and lambda-dropping per se, though lambda-dropping also has a use as an intermediate transformation in a compiler: we noticed that lambda-dropping a program corresponds to transforming it into the functional representation of its optimal SSA form. This observation actually led us to substantially improve our PEPM'97 presentation of lambda-dropping. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

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


Ideal observer of single neuron activity We find that adding certain amounts of inhibitory inputs to a neuron improves its capability of accurately decoding the input information. The optimal ratio r of inhibitory to excitatory inputs for decoding the input information from an observation of the efferent interspike intervals is calculated. Surprisingly, the Fisher information could be zero for certain values of the ratio, seemingly implying that it is impossible to read out the encoded information at these values. By analyzing the maximum likelihood estimate of the input information, it is then concluded that the input information is, in fact, most easily estimated at the points where the Fisher information vanishes.

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

the fisher information
decoding
maximum likelihood estimate


Characterization and representation problems for intersection betweennesses For a set system M=(Mv)v?V M = ( M v ) v ? V indexed by the elements of a finite set V V , the intersection betweenness B(M) B ( M ) induced by M M consists of all triples (u,v,w)?V3 ( u , v , w ) ? V 3 with Mu?Mw?Mv M u ? M w ? M v . Similarly, the strict intersection betweenness Bs(M) B s ( M ) induced by M M consists of all triples (u,v,w)?B(M) ( u , v , w ) ? B ( M ) such that u u , v v , and w w are pairwise distinct. The notion of a strict intersection betweenness was introduced by Burigana [L. Burigana, Tree representations of betweenness relations defined by intersection and inclusion, Math. Soc. Sci. 185 (2009) 536]. We provide axiomatic characterizations of intersection betweennesses and strict intersection betweennesses. Our results yield a simple and efficient algorithm that constructs a representing set system for a given (strict) intersection betweenness. We study graphs whose strict shortest path betweenness is a strict intersection betweenness. Finally, we explain how the algorithmic problem related to Buriganas notion of a partial tree representation can be solved efficiently using well-known algorithms.

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


Robust error bounds for finite element approximation of reactiondiffusion problems with non-constant reaction coefficient in arbitrary space dimension We present a fully computable a posteriori error estimator for piecewise linear finite element approximations of reactiondiffusion problems with mixed boundary conditions and piecewise constant reaction coefficient formulated in arbitrary dimension. The estimator provides a guaranteed upper bound on the energy norm of the error and it is robust for all values of the reaction coefficient, including the singularly perturbed case. The approach is based on robustly equilibrated boundary flux functions of Ainsworth and Oden (2000) and on subsequent robust and explicit flux reconstruction. This paper simplifies and extends the applicability of the previous result of Ainsworth and Vejchodsk (2011) in three aspects: (i) arbitrary dimension, (ii) mixed boundary conditions, and (iii) non-constant reaction coefficient. It is the first robust upper bound on the error with these properties. An auxiliary result that is of independent interest is the derivation of new explicit constants for two types of trace inequalities on simplices.

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


Geometrical and Topological Properties of a Parameterized Binary Relation in Vector Optimization In real linear spaces, partial orderings are usually generated by ordering cones. In many situations, however, such an ordering cone is too small with respect to the whole space. Therefore, in this paper, we extend the concept of ordering cones to a more general concept. For this purpose, we define a parameterized binary relation, based on a convex cone and a binary function. We investigate some geometrical and topological properties of this relation in detail.

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

positive and negative semidefinite operators


Crystal

structure

and

conformational

analysis

of

s-cis-(acetylacetonato)(ethylenediamine-N,N

'-diacetato)-chromium(III)

The

crystal

structure

of

[Cr(edda)(acac)]

(edda

ethylediamine-N,N'-diacetate;

acac

acetylacetonato)

has

been

determined

by

a

single

crystal

X-ray

diffraction

study

at

K.

The

chromium

ion

is

in

a

distorted

octahedral

environment

coordinated

by

two

N

and

two

O

atoms

of

chelating

edda

and

two

O

atoms

of

acac,

resulting

in

s-cis

configuration.

The

complex

crystallizes

in

the

space

group

of

the

monoclinic

system

in

a

cell

of

dimensions

a

b

c

beta

degrees

and

Z

The

mean

Cr-N(edda),

Cr-O(edda)

and

Cr-O(acac)

bond

distances

are

and

while

the

angles

O-Cr-O

of

edda

and

O-Cr-O

of

acac

are

and

degrees,

respectively.

The

crystal

structure

is

stabilized

by

N-Ha

<-O

hydrogen

bonds

linking

[Cr(edda)(acac)]

molecules

in

distinct

linear

strands.

The

visible

electronic

and

IR

spectroscopic

properties

are

also

discussed.

An

improved,

physically

more

realistic

force

field,

Vibrationally

Optimized

Force

Field

(VOFF),

capable

of

reproducing

structural

and

vibrational

properties

of

[Cr(edda)(acac)]

was

developed

and

its

transferability

demonstrated

on

selected

chromium(III)

complexes

with

similar

ligands.

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

chromium(iii)
molecular mechanics
s-cis geometry
spectral properties


Nonlinear analysis of adhesively bonded lap joints considering viscoplasticity in adhesives This paper presents nonlinear finite element analysis of adhesively bonded joints considering the elasto-viscoplastic constitutive model of the adhesive material and the finite rotation of the joint. Though the adherends have been assumed to be linearly elastic, the yielding of the adhesive is represented by a pressure sensitive modified von Mises yield function. The stressstrain relation of the adhesive is represented by the RambergOsgood relation. Geometric nonlinearity due to finite rotation in the joint is accounted for using the GreenLagrange strain tensor and the second PiolaKirchhoff stress tensor in a total Lagrangian formulation. Critical time steps have been calculated based on the eigenvalues of the transition matrices of the viscoplastic model of the adhesive. Stability of the viscoplastic solution and time dependent behaviour of the joints are examined. A parametric study has been carried out with particular reference to peel and shear stress along the interface. Critical zones for failure of joints have been identified. The study is of significance in the design of lap joints as well as on the characterization of adhesive strength.

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

adhesive
adherends
bonded joints
critical time
finite rotation
nonlinear finite element analysis
shear stress


Intelligent phishing detection and protection scheme for online transactions Phishing is an instance of social engineering techniques used to deceive users into giving their sensitive information using an illegitimate website that looks and feels exactly like the target organization website. Most phishing detection approaches utilizes Uniform Resource Locator (URL) blacklists or phishing website features combined with machine learning techniques to combat phishing. Despite the existing approaches that utilize URL blacklists, they cannot generalize well with new phishing attacks due to human weakness in verifying blacklists, while the existing feature-based methods suffer high false positive rates and insufficient phishing features. As a result, this leads to an inadequacy in the online transactions. To solve this problem robustly, the proposed study introduces new inputs (Legitimate site rules, User-behavior profile, PhishTank, User-specific sites, Pop-Ups from emails) which were not considered previously in a single protection platform. The idea is to utilize a Neuro-Fuzzy Scheme with 5 inputs to detect phishing sites with high accuracy in real-time. In this study, 2-Fold cross-validation is applied for training and testing the proposed model. A total of 288 features with 5 inputs were used and has so far achieved the best performance as compared to all previously reported results in the field.

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


Creep-controlled electromigration in near-threshold interconnects A model of creep affected electromigration (CAEM) in near-threshold conductors (near-threshold denoting length L or current density j close to the corresponding Blech thresholds Lth and jth) is shown to fit electromigration (EM) threshold and kinetics data better than the Blech model. Its most significant prediction is that the overall rate of EM displacement in near-threshold conductors (or short polygranular segments in near-bamboo interconnects) is controlled by a strictly local mechanical process, diffusional creep, most likely by a bulk diffusion NabarroHerring process.

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

electromigration kinetics and threshold
hillocks
stress adjustment


Non-orthogonal spline wavelets for boundary element analysis Non-orthogonal spline wavelets are developed for Galerkin boundary element method. The proposed wavelets have compact supports and closed-form expressions. Besides, one can choose arbitrarily the order of vanishing moments of the wavelets independently of order of B-splines. Sparse coefficient matrices are obtained by truncating the small elements a priori. The memory requirement and computational time can be controled by changing the order of vanishing moments of the wavelets. As an iterative technique for solving the boundary element equations, GMRES(m) method is employed. Diagonal scaling and incomplete LU factorization (ILU(0)) are considered for the preconditioning. The ILU(0) becomes an effective preconditioner for higher order vanishing moments. Through numerical examples, availability of the proposed wavelets is investigated.

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

wavelet-bem
non-orthogonal wavelet
fast solution
2-d laplace problem
gmres


Run-time support for heterogeneous multitasking on reconfigurable SoCs In complex reconfigurable systems on chip (SoC), the dynamism of applications requires an efficient management of the platform. To allow run-time management of heterogeneous resources, operating systems (OS) and reconfigurable SoC platforms should be developed together. For run-time support of reconfigurable architectures, the OS must abstract the reconfigurable computing resources and provide an efficient communication layer. This paper presents our efforts to simultaneously develop the run-time support and the communication layer of reconfigurable SoCs. We show that networks-on-chip (NoC) are an ideal communication layer for dynamically reconfigurable SoCs, explain how our OS provides run-time support for dynamic task relocation and detail how hardware parts of the OS are integrated into the higher layers of the NoC. An implementation of the OS and of the dedicated communication layer on our reconfigurable architecture supports the concepts we describe. (C) 2004 Elsevier B.V. All rights reserved.

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


Dual-bounded generating problems: Partial and multiple transversals of a hypergraph We consider two generalizations of the notion of transversal to a finite hypergraph, the so-called multiple and partial transversals. Multiple transversals naturally arise in 0-1 programming, while partial transversals are related to data mining and machine learning. We show that for an arbitrary hypergraph the families of multiple and partial transversals are both dual-bounded in the sense that the size of the corresponding dual hypergraph is bounded by a polynomial in the cardinality and the length of description of the input hypergraph. Our bounds are based on new inequalities of extremal set theory and threshold Boolean logic, which may be of independent interest. We also show that the problems of generating all multiple and all partial transversals for a given hypergraph are polynomial-time reducible to the generation of all ordinary transversals for another hypergraph, i.e., to the well-known dualization problem for hypergraphs. As a corollary, we obtain incremental quasi-polynomial-time algorithms for both of the above problems, as well as for the generation of all the minimal binary solutions for an arbitrary monotone system of linear inequalities.

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

transversal
hypergraph
dualization
data mining

independent set
monotone boolean function
incremental polynomial time
threshold function
maximal frequent set
minimal infrequent set


Fight or Flight, Forbearance and Fortitude: The Spectrum of Actions of the Catecholamines and Their Cousins Catecholamines are recognized to play an important part in the fight-or-flight response to impending stress. Catecholamine and other phase-reactant levels are raised in the first 24 h following acute stress, but the bigger picture of their action on the organism is unavailable. In this article, we examine their actions in light of the theory of phase transitions borrowed from the numerate sciences. Phase transitions involve changes in the state of matter or an organism with a common example of what is termed a first-order phase transition (sudden change) being provided by the popular expression the straw that broke the camel's back. We propose that the response to catecholamines follows a triphasic response

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

critical phenomena
collapsible tube
stress physiology


Some findings relevant to the mechanistic interpretation in the case of predictive models for carcinogenicity based on the counter propagation artificial neural network The goal of the study was to contribute to a better mechanistic understanding of so-called "general" QSAR models for non-congeneric chemicals based on the counter propagation artificial neural network (CP ANN). Possible mechanisms of action was proofed using the Toxtree expert system based on structural alerts (SAs) for carcinogenicity. We have illustrated how statistically selected MDL descriptors, which refer to topological characteristics as well as to polarizability and charge distribution related to reactivity, are correlated with particular chemical classes (containing carcinogenic SA) with the recognized mechanistic link to the carcinogenic activity and consequently with the carcinogenic potency. Mechanistic insight in CP ANN models was demonstrated using an inherent mapping technique (i.e. Kohonen maps).

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

mechanistic interpretation of model
qsar model
chemical descriptors
non-congeneric chemicals
classification model


towards the prediction of development effort for hypermedia applications Accurate estimates of development effort play an important role in the successful management of larger hypermedia development projects. By applying measurement principles to measure characteristics of the applications and their development processes, feedback can be obtained to help understand, control and improve future applications and corresponding processes. The objective of this paper is to describe the application of case-based reasoning to estimating the effort for developing hypermedia applications. The data used in the estimation process was obtained through an experiment where effort and size metrics were collected. We have shown that case-based reasoning is a candidate technique to effort estimation and, with the aid of an automated environment, can be applied to hypermedia development effort prediction.

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

effort prediction
hypermedia
development


Repairing and reasoning with inconsistent and uncertain ontologies With the development of semantic web, the quality and correctness of ontologies play more and more important roles in semantic representation and knowledge sharing. However, ontologies are often inconsistent and uncertain in real situations. Because of the difficulty in ensuring the quality of ontologies, there is an increasing need for dealing with the inconsistency and uncertainty in real-world applications of ontological reasoning and management. This paper adopts two methods to handle the inconsistent and uncertain ontologies: the first one is to repair the inconsistency, algorithms RIO and RIUO are proposed to compute the candidate repair set, the consistency of ontology could be recovered through deleting or modifying the axioms in candidate repair set; the second one is to develop a non-standard reasoning method to obtain meaningful answers, algorithms RMU and RMIU are proposed to perform query-specific reasoning methods for inconsistent and uncertain ontologies without changing the original ontologies. Finally the prototype system is constructed and the experiment results validate the usability and effectiveness of our approaches.

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

ontology reasoning
knowledge representation
query and answer


A process algebra for probabilistic and nondeterministic processes We present an algebraic language for the specification of probabilistic and nondeterministic processes, PNAL, which is a probabilistic extension of EPL that maintains nondeterminism. (C) 2001 Elsevier Science B.V. All rights reserved.

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

concurrency
formal semantics
specification languages


Network mapping services for dynamic selection of web services: promises and challenges Web services provide the possibility of dynamically integrating distributed service components scattered over the Internet to fulfill sophisticated business demands. The effectiveness of service integration depends critically on the selection of best-fit service components. In this paper, we first review several research streams related to server selection. We then propose a framework of dynamic service discovery, termed Network Mapping Services (NMS), which combines prior efforts on network-aware applications and server selection into a coherent structure. As successful implementation of NMS requires the collaboration among all participating service providers, we also discuss several incentive schemes and compare their effectiveness in supporting collaboration.

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

network mapping
network distance prediction
incentives
information distortion


Testretest reliability and concurrent validity of a web-based questionnaire measuring workstation and individual correlates of work postures during computer work Introduction: Ergonomic questionnaires are widely used in epidemiological field studies to study the association between workstation characteristics, work posture and musculoskeletal disorders among office workers. Findings have been inconsistent regarding the putative adverse effect of work postures. Underestimation of the true association might be present in studies due to misclassification of subjects to risk (i.e. exposed to non-neutral working postures) and no-risk categories (i.e. not exposed to non-neutral working postures) based on questionnaire responses. The objective of this study was to estimate the amount of misclassification resulting from the use of questionnaires. Methods: Testretest reliability and concurrent validity of a newly developed questionnaire was assessed. This questionnaire collects data on workstation characteristics and on individual characteristics during computer work (i.e. work postures, movements and habits). Pictures were added where possible to provide visual guidance. The study population consisted of 84 office workers of a research department. They filled out the questionnaire on the Internet twice, with an in-between period of 2 weeks. For a subgroup of workers (n=38), additional on-site observations and multiple manual goniometer measurements were performed. Results: Percentage agreement ranged between 71% and 100% for the testretest analysis, between 31% and 100% for the comparison between questionnaire and on-site observation, and between 26% and 71% for the comparison between questionnaire and manual goniometer measurements. For 9 out of 12 tested items, the percentage agreement between questionnaire and manual goniometer measurements was below 50%. Conclusions: The questionnaire collects reliable data on workstation characteristics and some individual characteristics during computer work (i.e. work movements and habits), but does not seem to be useful to collect data on work postures during computer work in epidemiological field studies among office workers.

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


The backup reprovisioning problem of FIPP p-cycles for node failure on survivable WDM networks Protection techniques for optical networks mainly rely on pre-allocated backup bandwidth, which may not be able to provide full protection guarantee when multiple failures occur in a network. After recovering from the previous failure, if failure occurs again, unprotected or vulnerable lightpaths cannot be recovered. In this paper, the minimal backup reprovisioning (MBR) problem is studied, in which the failure-independent path protecting p-cycles (FIPP p-cycles) scheme is considered for single-node failure on WDM networks. After recovering the affected lightpaths from a node failure, the goal of the MBR is to re-arrange the protecting and available resources such that working paths can be protected against next node failure if possible. An algorithm is designed to recover the protecting capabilities of the FIPP p-cycles, unless there is no sufficient network resource. The simulation results of the proposed method are also given.

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


Data-driven smooth tests for the martingale difference hypothesis ? A general method for testing the martingale difference hypothesis is proposed. The new tests are data-driven smooth tests based on the principal components of certain marked empirical processes that are asymptotically distribution-free, with critical values that are already tabulated. The smooth tests are shown to be optimal in a semiparametric sense discussed in the paper, and they are robust to conditional heteroscedasticity of unknown form. A simulation study shows that the data-driven smooth tests perform very well for a wide range of realistic alternatives and have more power than omnibus and other competing tests. Finally, an application to the S&P 500 stock index and some of its components highlights the merits of our approach. The paper also contains a new weak convergence theorem that is of independent interest.

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

nonlinear time series
pivotal tests
neymans tests
semiparametric efficiency
market efficiency


SURE-based Optimization for Adaptive Sampling and Reconstruction We apply Stein's Unbiased Risk Estimator (SURE) to adaptive sampling and reconstruction to reduce noise in Monte Carlo rendering. SURE is a general unbiased estimator for mean squared error (MSE) in statistics. With SURE, we are able to estimate error for an arbitrary reconstruction kernel, enabling us to use more effective kernels rather than being restricted to the symmetric ones used in previous work. It also allows us to allocate more samples to areas with higher estimated MSE. Adaptive sampling and reconstruction can therefore be processed within an optimization framework. We also propose an efficient and memory-friendly approach to reduce the impact of noisy geometry features where there is depth of field or motion blur. Experiments show that our method produces images with less noise and crisper details than previous methods.

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

ray tracing
cross bilateral filter
stein's unbiased risk estimator (sure)


Dependability Modeling and Analysis of Software Systems Specified with UML The goal is to survey dependability modeling and analysis of software and systems specified with UML, with focus on reliability, availability, maintainability, and safety (RAMS). From the literature published in the last decade, 33 approaches presented in 43 papers were identified. They are evaluated according to three sets of criteria regarding UML modeling issues, addressed dependability characteristics, and quality assessment of the surveyed approaches. The survey shows that more works are devoted to reliability and safety, fewer to availability and maintainability, and none to integrity. Many methods support early life-cycle phases (from requirements to design). More research is needed for tool development to automate the derivation of analysis models and to give feedback to designers.

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

design reliability availability maintainability safety

languages
standardization
verification
model transformation
dependability analysis


towards context-aware adaptable web services In this paper, we present a context framework that facilitates the development and deployment of context-aware adaptable Web services. Web services are provided with context information about clients that may be utilized to provide a personalized behavior. Context is extensible with new types of information at any time without any changes to the underlying infrastructure. Context processing is done by Web services, context plugins, or context services. Context plugins and context services pre- and post-process Web service messages based on the available contextinformation. Both are essential for automatic context processing and automatic adaption of Web services to new context types without the necessity to adjust the Web services themselves. We implemented the context framework within the ServiceGlobe system, our open and distributed Web service platform.

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

extensibility
information services
extensible framework
automatic context processing


Design of Protocols for Task Administration in Collaborative Production Systems Customer-focused and concurrent engineering service systems process tasks more effectively as a result of the power of collaboration among multiple participants. In such environments, however, complex situations might arise that require decisions beyond simple coordination. Task Administration Protocols (TAPs) are designed as a control mechanism to manage complex situations in collaborative task environments. This article presents the design of TAPs for collaborative production systems in which tasks are performed by the collaboration of multiple agents. Three component protocols are found to constitute TAPs and are triggered at appropriate stages in task administration: 1) Task Requirement Analysis Protocol, 2) Shared Resource Allocation Protocol, and 3) Synchronization & Time-Out Protocol. A case Study with TAPs metrics for task allocation in a collaborative production system is investigated to compare performance under TAPs, and under a non-TAP coordination protocol (which is considered to be simpler). In terms of task allocation ratio, the case study indicates that performance under TAPs is significantly better (up to 10.6%) than under the non-TAP coordination protocol, especially under medium or high load conditions. The advantage of TAPs can be explained by their design with relatively higher level of collaborative intelligence, addressing more complex control logic compared with non-TAP coordination protocols.

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

rules
figures
citation of papers
citation of books
examples


Fuzzy assessment method on sampling survey analysis Developing a well-designed market survey questionnaire will ensure that surveyors get the information they need about the target market. Traditional sampling survey via questionnaire, which rates item by linguistic variables, possesses the vague nature. It has difficulty in reflecting interviewees incomplete and uncertain thought. Therefore, if we can use fuzzy sense to express the degree of interviewees feelings based on his own concept, the sampling result will be closer to interviewees real thought. In this study, we propose the fuzzy sense on sampling survey to do aggregated assessment analysis. The proposed fuzzy assessment method on sampling survey analysis is easily to assess the sampling survey and evaluate the aggregative evaluation.

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


Performance evaluation as an influence factor for the determination of profit shares of competence cells in non-hierarchical regional production networks In order to bear the challenge of global competition, the realisation of value adding processes within networked production structures gains significance. To optimise the supply chain in these production networks hereby is one major challenge in order to assure success. This contribution focuses the procedure of performance evaluation in production networks as one part of the network controlling. Thereby the specific model of a non-hierarchical production network based on competence cells (CCs) serves as the theoretical background. The evaluation of performances of the involved CCs is one important task in that context. It is realised during the final phase of an ideal-typical life cycle of a production network. In order to quantify the evaluation data, suitable performance attributes need to be identified. The evaluation process is realised by an adapted value benefit analysis. As the final result a measure for the valuation of the performance of participating CCs is ascertained. In case of an unsatisfying performance the profit shares will be shortened. Thereby a specific approach for the distribution of profit serves as the basis.

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

performance evaluation
network controlling
production network

profit distribution
sanctions
extended value chain management


Enhanced Sodium-Calcium Exchange in the Infarcted Heart Arrhythmias and contractile dysfunction both contribute to the high morbidity and mortality in patients with congestive heart failure. Contractile dysfunction is generally believed to reflect a decrease in the amplitude of intracellular Ca2+ transients, whereas tachyarrythmias are often initiated in the setting of cellular Ca2+ overload. In a rabbit model of left ventricular dysfunction due to myocardial infarction, we found evidence that myocyte sarcoplasmic reticulum Ca2+ content may be normal or even increased at slow stimulation rates. This may occur because prolonged action potential duration promotes Ca2+ influx via the Na+/Ca2+ exchanger. Despite preserved SR Ca2+ content, intracellular Ca2+ transients and contractions may be reduced in amplitude because of impaired synchronization of Ca2+ release events throughout the myocyte.

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


First Person Indoor/Outdoor Augmented Reality Application: ARQuake This paper presents a first person outdoor/indoor augmented reality application ARQuake that we have developed. ARQuake is an extension of the desktop game Quake, and as such we are investigating how to convert a desktop first person application into an outdoor/indoor mobile augmented reality application. We present an architecture for a low cost, moderately accurate six degrees of freedom tracking system based on GPS, digital compass, and fiducial vision-based tracking. Usability issues such as monster selection, colour, input devices, and multi-person collaboration are discussed.

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


Dopamine-dependent plasticity of corticostriatal synapses Knowledge of the effect of dopamine on corticostriatal synaptic plasticity has advanced rapidly over the last 5 years. We consider this new knowledge in relation to three factors proposed earlier to describe the rules for synaptic plasticity in the corticostriatal pathway. These factors are a phasic increase in dopamine release, presynaptic activity and postsynaptic depolarisation. A function is proposed which relates the amount of dopamine release in the striatum to the modulation of corticostriatal synaptic efficacy. It is argued that this function, and the experimental data from which it arises, are compatible with existing models which associate the reward-related firing of dopamine neurons with changes in corticostriatal synaptic efficacy.

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

dopamine striatum corticostriatal plasticity


lessons from brain age on password memorability User authentication involves establishing a user's right to access a system. Most user authentication is done with text passwords, which have advantages over other approaches, but more secure passwords are often difficult to remember. Nintendo's Brain Age games involve cognitive training which can improve memory. We examined Brain Age in search of insights towards helping users create and remember more secure passwords. Although Brain Age offers no techniques for memorising specific information, we discovered ideas for a new type of serious game that may help with password memorisation: Password Rehearsal Games .

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


Wavelet-based feature extraction for DNA microarray classification Complementary DNA (cDNA) microarray-based tumor gene expression profiles have been successfully used for cancer diagnosis. The main difficulty in processing cDNA microarrays is the ultra-high dimensionality of the microarrays. In this paper, we approach the dimensionality reduction using a novel wavelet-based approach that extracts classification features through microarray-block processing, thresholding, and averaging of approximation coefficients. The proposed cancer detection system presents the extracted features to a support vector machine SVM for classification (tumor or non-tumor). To show the robustness of the proposed system, its performance is tested on two public cancer microarray databases.

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

cancer detection
microarrays
feature extraction

wavelet transform
support vector machine (svm)
block processing


Isotropic-BEM coupled with a local point interpolation method for the solution of 3D-anisotropic elasticity problems This paper presents a solution procedure for the three-dimensional linear elastic problem with anisotropic properties. The approach uses the partition of the displacement field into complementary and particular parts. The former is the solution of a differential equation similar to that of an isotropic elastostatic and is obtained by the isotropic boundary element method. The particular integral is obtained by solving the corresponding strong form differential equations, using the local radial point interpolation method. This promising approach is simple to implement and leads to highly accurate solutions in some simple tested situations.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 elasticity
isotropic-bem
meshfree strong form
radial basis function


Lexicographically-ordered constraint satisfaction problems We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two are easily distinguished conceptually and for purposes of problem solving. Preferences are represented as a lexicographic order over complete assignments based on variable importance and rankings of values in each domain. Feasibility constraints are treated in the usual manner. Since the preference representation is ordinal in character, these problems can be solved with algorithms that do not require evaluations to be represented explicitly. This includes ordinary CSP algorithms, although these cannot stop searching until all solutions have been checked, with the important exception of heuristics that follow the preference order (lexical variable and value ordering). We describe relations between lexicographic CSPs and more general soft constraint formalisms and show how a full lexicographic ordering can be expressed in the latter. We discuss relations with (T)CP-nets, highlighting the advantages of the present formulation, and we discuss the use of lexicographic ordering in multiobjective optimisation. We also consider strengths and limitations of this form of representation with respect to expressiveness and usability. We then show how the simple structure of lexicographic CSPs can support specialised algorithms: a branch and bound algorithm with an implicit cost function, and an iterative algorithm that obtains optimal values for successive variables in the importance ordering, both of which can be combined with appropriate variable ordering heuristics to improve performance. We show experimentally that with these procedures a variety of problems can be solved efficiently, including some for which the basic lexically ordered search is infeasible in practice.

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

constraint satisfaction
preference
lexicographic order
soft constraint


A new range query algorithm for Universal B-trees ? In multi-dimensional databases the essential tool for accessing data is the range query (or window query). In this paper we introduce a new algorithm of processing range query in universal B-tree (UB-tree), which is an index structure for searching in multi-dimensional databases. The new range query algorithm (called the DRU algorithm) works efficiently, even for processing high-dimensional databases. In particular, using the DRU algorithm many of the UB-tree inner nodes need not to be accessed. We explain the DRU algorithm using a simple geometric model, providing a clear insight into the problem. More specifically, the model exploits an interesting relation between the Z-curve and generalized quad-trees. We also present experimental results for the DRU algorithm implementation.

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

spatial access methods
multi-dimensional indexing
ub-tree
z-region
space filling curves


The Nonparanormal: Semiparametric Estimation of High Dimensional Undirected Graphs Recent methods for estimating sparse undirected graphs for real-valued data in high dimensional problems rely heavily on the assumption of normality. We show how to use a semiparametric Gaussian copula-or "nonparanormal"- for high dimensional inference. Just as additive models extend linear models by replacing linear functions with a set of one-dimensional smooth functions, the nonparanormal extends the normal by transforming the variables by smooth functions. We derive a method for estimating the nonparanormal, study the method's theoretical properties, and show that it works well in many examples.

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

graphical models
gaussian copula
sparsity
l(1) regularization
graphical lasso
paranormal
occult


Representation of context-dependant knowledge in ontologies: A model and an application Most of current Information and Knowledge Based Systems manage impressive amounts of information, ranging from local databases to resources imported from the web. In addition to widely pointed-out integration and maintenance difficulties, other common problem is overwhelming of users with much more information than the strictly necessary for fulfilling a task, forcing them to dig in a list of results to find valuable answers. This issue is especially critical in mobile decision support systems, since neither the capabilities of the handheld devices nor the users situation are likely to ease or even permit carrying out this manual post-processing. Use of context knowledge has been envisioned as an appropriate solution to deal with this information overload matter: system responses can be summarized and customized depending on the situation and the preferences of the user, which results in presenting him only relevant information. In this work we propose a formal model for representing in ontologies relevance relations between context descriptions and domain-knowledge subsets. Besides the formulation of the model, we describe an algorithm to reason within it. We demonstrate the contributions of our approach with the implementation of the IASO application, a system which provide doctors in nomadic healthcare with brief context-dependant pieces of advice about patients electronic health records.

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

knowledge representation
mobile systems
context-aware systems
medical informatics