Comparative statistical analysis of hole taper and circularity in laser percussion drilling Investigates the relationships and parameter interactions between six controllable variables on the hole taper and circularity in laser percussion drilling . Experiments have been conducted on stainless steel workpieces and a comparison was made between stainless steel and mild steel . The central composite design was employed to plan the experiments in order to achieve required information with reduced number of experiments . The process performance was evaluated . The ratio of minimum to maximum Feret 's diameter was considered as circularity characteristic of the hole . The models of these three process characteristics were developed by linear multiple regression technique . The significant coefficients were obtained by performing analysis of variance -LRB- ANOVA -RRB- at 1 , 5 and 7 % levels of significance . The final models were checked by complete residual analysis and finally were experimentally verified . It was found that the pulse frequency had a significant effect on the hole entrance diameter and hole circularity in drilling stainless steel unlike the drilling of mild steel where the pulse frequency had no significant effect on the hole characteristics

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

comparative statistical analysis
hole taper
circularity
laser percussion drilling
stainless steel workpieces
mild steel
pulse frequency
central composite design
process performance
linear multiple regression technique
analysis of variance
anova
complete residual analysis

laser peak power
laser pulse width
assist gas pressure
focal plane position
equivalent entrance diameter
ferets diameter
least squares procedure
stepwise regression method


Decomposition of additive cellular automata Finite additive cellular automata with fixed and periodic boundary conditions are considered as endomorphisms over pattern spaces . A characterization of the nilpotent and regular parts of these endomorphisms is given in terms of their minimal polynomials . Generalized eigenspace decomposition is determined and relevant cyclic subspaces are described in terms of symmetries . As an application , the lengths and frequencies of limit cycles in the transition diagram of the automaton are calculated

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

cellular automata
transition diagram
endomorphisms

finite cellular automaton
computational complexity


Favorable noise uniformity properties of Fourier-based interpolation and reconstruction approaches in single-slice helical computed tomography Volumes reconstructed by standard methods from single-slice helical computed tomography -LRB- CT -RRB- data have been shown to have noise levels that are highly nonuniform relative to those in conventional CT. . These noise nonuniformities can affect low-contrast object detectability and have also been identified as the cause of the zebra artifacts that plague maximum intensity projection -LRB- MIP -RRB- images of such volumes . While these spatially variant noise levels have their root in the peculiarities of the helical scan geometry , there is also a strong dependence on the interpolation and reconstruction algorithms employed . In this paper , we seek to develop image reconstruction strategies that eliminate or reduce , at its source , the nonuniformity of noise levels in helical CT relative to that in conventional CT. . We pursue two approaches , independently and in concert . We argue , and verify , that Fourier-based longitudinal interpolation approaches lead to more uniform noise ratios than do the standard 360LI and 180LI approaches . We also demonstrate that a Fourier-based fan-to-parallel rebinning algorithm , used as an alternative to fanbeam filtered backprojection for slice reconstruction , also leads to more uniform noise ratios , even when making use of the 180LI and 360LI interpolation approaches

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

reconstruction approaches
noise uniformity properties
conventional ct
more uniform noise ratios
zebra artifacts

fourier-based fan-to-parallel rebinning algorithm


Quasi stage order conditions for SDIRK methods The stage order condition is a simplifying assumption that reduces the number of order conditions to be fulfilled when designing a Runge-Kutta -LRB- RK -RRB- method . Because a DIRK -LRB- diagonally implicit RK -RRB- method can not have stage order greater than 1 , we introduce quasi stage order conditions and derive some of their properties for DIRKs . We use these conditions to derive a low-order DIRK method with embedded error estimator . Numerical tests with stiff ODEs and DAEs of index 1 and 2 indicate that the method is competitive with other RK methods for low accuracy tolerances

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

quasi stage order conditions
embedded error estimator
numerical tests
sdirk methods

diagonally implicit runge-kutta method
differential-algebraic systems


Operator splitting and approximate factorization for taxis-diffusion-reaction models In this paper we consider the numerical solution of 2D systems of certain types of taxis-diffusion-reaction equations from mathematical biology . By spatial discretization these PDE systems are approximated by systems of positive , nonlinear ODEs -LRB- Method of Lines -RRB- . The aim of this paper is to examine the numerical integration of these ODE systems for low to moderate accuracy by means of splitting techniques . An important consideration is maintenance of positivity . We apply operator splitting and approximate matrix factorization using low order explicit Runge-Kutta methods and linearly implicit Runge-Kutta-Rosenbrock methods . As a reference method the general purpose solver VODPK is applied

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

operator splitting
numerical solution
mathematical biology
spatial discretization
pde systems
nonlinear odes
numerical integration
approximate matrix factorization
approximate factorization

linearly implicit runge-kutta-rosenbrock methods


Dynamic neighborhood structures in parallel evolution strategies Parallelizing is a straightforward approach to reduce the total computation time of evolutionary algorithms . Finding an appropriate communication network within spatially structured populations for improving convergence speed and convergence probability is a difficult task . A new method that uses a dynamic communication scheme in an evolution strategy will be compared with conventional static and dynamic approaches . The communication structure is based on a so-called diffusion model approach . The links between adjacent individuals are dynamically chosen according to deterministic or probabilistic rules . Due to self-organization effects , efficient and stable communication structures are established that perform robustly and quickly on a multimodal test function

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

evolutionary algorithms
multimodal test function
convergence probability
convergence speed
parallelizing


National learning systems : a new approach on technological change in late industrializing economies and evidences from the cases of Brazil and South Korea The paper has two intertwined parts . The first one is a proposal for a conceptual and theoretical framework to understand technical change in late industrializing economies . The second part develops a kind of empirical test of the usefulness of that new framework by means of a comparative study of the Brazilian and South Korean cases . All the four types of macroevidences of the technical change processes of Brazil and Korea corroborate , directly or indirectly , the hypothesis of the existence of actual cases of national learning systems -LRB- NLSs -RRB- of passive and active nature , as it is shown to be the cases of Brazil and South Korea , respectively . The contrast between the two processes of technical change prove remarkable , despite both processes being essentially confined to learning . The concepts of passive and active NLSs show how useful they are to apprehend the diversity of those realities , and , consequently , to avoid , for instance , interpretations that misleadingly suppose -LRB- based on conventional economic theory -RRB- that those countries have a similar lack of technological dynamism

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

national learning systems
technological change
late industrializing economies
brazil
south korea


Network-centric systems The author describes a graduate-level course that addresses cutting-edge issues in network-centric systems while following a more traditional graduate seminar format

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

network-centric systems
graduate level course


Model theory for hereditarily finite superstructures We study model-theoretic properties of hereditarily finite superstructures over models of not more than countable signatures . A question is answered in the negative inquiring whether theories of hereditarily finite superstructures which have a unique -LRB- up to isomorphism -RRB- hereditarily finite superstructure can be described via definable functions . Yet theories for such superstructures admit a description in terms of iterated families TF and SF . These are constructed using a definable union taken over countable ordinals in the subsets which are unions of finitely many complete subsets and of finite subsets , respectively . Simultaneously , we describe theories that share a unique -LRB- up to isomorphism -RRB- countable hereditarily finite superstructure

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


Evolution complexity of the elementary cellular automaton rule 18 Cellular automata are classes of mathematical systems characterized by discreteness -LRB- in space , time , and state values -RRB- , determinism , and local interaction . Using symbolic dynamical theory , we coarse-grain the temporal evolution orbits of cellular automata . By means of formal languages and automata theory , we study the evolution complexity of the elementary cellular automaton with local rule number 18 and prove that its width 1-evolution language is regular , but for every n > or = 2 its width n-evolution language is not context free but context sensitive

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

cellular automata
symbolic dynamical theory
formal languages
complexity
elementary cellular automaton


On the monotonicity conservation in numerical solutions of the heat equation It is important to choose such numerical methods in practice that mirror the characteristic properties of the described process beyond the stability and convergence . The investigated qualitative property in this paper is the conservation of the monotonicity in space of the initial heat distribution . We prove some statements about the monotonicity conservation and total monotonicity of one-step vector-iterations . Then , applying these results , we consider the numerical solutions of the one-dimensional heat equation . Our main theorem formulates the necessary and sufficient condition of the uniform monotonicity conservation . The sharpness of the conditions is demonstrated by numerical examples

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

monotonicity conservation
numerical solutions
heat equation
characteristic properties
qualitative property
necessary and sufficient condition


Ethernet networks : getting down to business While it seems pretty clear that Ethernet has won the battle for the mindshare as the network of choice for the factory floor , there 's still a war to be won in implementation as cutting-edge manufacturers begin to adopt the technology on a widespread basis

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

cutting-edge manufacturers
supervisory level


Frontier between separability and quantum entanglement in a many spin system We discuss the critical point x/sub c / separating the quantum entangled and separable states in two series of N spins S in the simple mixed state characterized by the matrix operator rho = x | phi > < phi | +1 - x/D/sup N/I/sub D/N , where x in -LSB- 0 , 1 -RSB- , D = 2S + 1 , I/sub D/N is the D/sup N / * D/sup N / unity matrix and | phi > is a special entangled state . The cases x = 0 and x = 1 correspond respectively to fully random spins and to a fully entangled state . In the first of these series we consider special states | phi > invariant under charge conjugation , that generalizes the N = 2 spin S = 1/2 Einstein-Podolsky-Rosen state , and in the second one we consider generalizations of the Werner -LRB- 1989 -RRB- density matrices . The evaluation of the critical point x/sub c / was done through bounds coming from the partial transposition method of Peres -LRB- 1996 -RRB- and the conditional nonextensive entropy criterion . Our results suggest the conjecture that whenever the bounds coming from both methods coincide the result of x/sub c / is the exact one . The results we present are relevant for the discussion of quantum computing , teleportation and cryptography

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

separability
quantum entanglement
many spin system
separable states
matrix operator
unity matrix
entangled state
charge conjugation
critical point
partial transposition method
nonextensive entropy criterion
quantum computing
teleportation
cryptography

random spin
einstein-podolsky-rosen state
werner density matrices


Optimization of the memory weighting function in stochastic functional self-organized sorting performed by a team of autonomous mobile agents The activity of a team of autonomous mobile agents formed by identical `` robot-like-ant '' individuals capable of performing a random walk through an environment that are able to recognize and move different `` objects '' is modeled . The emergent desired behavior is a distributed sorting and clustering based only on local information and a memory register that records the past objects encountered . An optimum weighting function for the memory registers is theoretically derived . The optimum time-dependent weighting function allows sorting and clustering of the randomly distributed objects in the shortest time . By maximizing the average speed of a texture feature -LRB- the contrast -RRB- we check the central assumption , the intermediate steady-states hypothesis , of our theoretical result . It is proved that the algorithm optimization based on maximum speed variation of the contrast feature gives relationships similar to the theoretically derived annealing law

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

autonomous mobile agents
random walk
memory weighting function
sorting
clustering
algorithm optimization


A leaf sequencing algorithm to enlarge treatment field length in IMRT With MLC-based IMRT , the maximum usable field size is often smaller than the maximum field size for conventional treatments . This is due to the constraints of the overtravel distances of MLC leaves and/or jaws . Using a new leaf sequencing algorithm , the usable IMRT field length -LRB- perpendicular to the MLC motion -RRB- can be mostly made equal to the full length of the MLC field without violating the upper jaw overtravel limit . For any given intensity pattern , a criterion was proposed to assess whether an intensity pattern can be delivered without violation of the jaw position constraints . If the criterion is met , the new algorithm will consider the jaw position constraints during the segmentation for the step and shoot delivery method . The strategy employed by the algorithm is to connect the intensity elements outside the jaw overtravel limits with those inside the jaw overtravel limits . Several methods were used to establish these connections during segmentation by modifying a previously published algorithm -LRB- areal algorithm -RRB- , including changing the intensity level , alternating the leaf-sequencing direction , or limiting the segment field size . The algorithm was tested with 1000 random intensity patterns with dimensions of 21 * 27 cm/sup 2 / , 800 intensity patterns with higher intensity outside the jaw overtravel limit , and three different types of clinical treatment plans that were undeliverable using a segmentation method from a commercial treatment planning system . The new algorithm achieved a success rate of 100 % with these test patterns . For the 1000 random patterns , the new algorithm yields a similar average number of segments of 36.9 + or-2 .9 in comparison to 36.6 + or-1 .3 when using the areal algorithm . For the 800 patterns with higher intensities outside the jaw overtravel limits , the new algorithm results in an increase of 25 % in the average number of segments compared to the areal algorithm . However , the areal algorithm fails to create deliverable segments for 90 % of these patterns . Using a single isocenter , the new algorithm provides a solution to extend the usable IMRT field length from 21 to 27 cm for IMRT on a commercial linear accelerator using the step and shoot delivery method

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

leaf sequencing algorithm
overtravel distances
upper jaw overtravel limit
intensity pattern
jaw position constraints
step and shoot delivery method
commercial treatment planning system
random patterns
deliverable segments
single isocenter
commercial linear accelerator
treatment field length
intensity elements
jaw overtravel limits
areal algorithm
segment field size
random intensity patterns
segmentation method

usable intensity modulated radiation therapy field length

multileaf-based collimators intensity modulated radiation therapy


Code generator for the HPF Library and Fortran 95 transformational functions One of the language features of the core language of HPF 2.0 -LRB- High Performance Fortran -RRB- is the HPF Library . The HPF Library consists of 55 generic functions . The implementation of this library presents the challenge that all data types , data kinds , array ranks and input distributions need to be supported . For instance , more than 2 billion separate functions are required to support COPY-SCATTER fully . The efficient support of these billions of specific functions is one of the outstanding problems of HPF . We have solved this problem by developing a library generator which utilizes the mechanism of parameterized templates . This mechanism allows the procedures to be instantiated at compile time for arguments with a specific type , kind , rank and distribution over a specific processor array . We describe the algorithms used in the different library functions . The implementation gives the ease of generating a large number of library routines from a single template . The templates can be extended with special code for specific combinations of the input arguments . We describe in detail the implementation and performance of the matrix multiplication template for the Fujitsu VPP5000 platform

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

hpf
high performance fortran
generic functions
data types
library generator
library functions
parameterized templates
matrix multiplication

hpf library
parallel computing
parallel languages
code generation


Achieving performance under OpenMP on ccNUMA and software distributed shared memory systems OpenMP is emerging as a viable high-level programming model for shared memory parallel systems . It was conceived to enable easy , portable application development on this range of systems , and it has also been implemented on cache-coherent Non-Uniform Memory Access -LRB- ccNUMA -RRB- architectures . Unfortunately , it is hard to obtain high performance on the latter architecture , particularly when large numbers of threads are involved . In this paper , we discuss the difficulties faced when writing OpenMP programs for ccNUMA systems , and explain how the vendors have attempted to overcome them . We focus on one such system , the SGI Origin 2000 , and perform a variety of experiments designed to illustrate the impact of the vendor 's efforts . We compare codes written in a standard , loop-level parallel style under OpenMP with alternative versions written in a Single Program Multiple Data -LRB- SPMD -RRB- fashion , also realized via OpenMP , and show that the latter consistently provides superior performance . A carefully chosen set of language extensions can help us translate programs from the former style to the latter -LRB- or to compile directly , but in a similar manner -RRB- . Syntax for these extensions can be borrowed from HPF , and some aspects of HPF compiler technology can help the translation process . It is our expectation that an extended language , if well compiled , would improve the attractiveness of OpenMP as a language for high-performance computation on an important class of modern architectures

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

openmp
programming model
shared memory parallel systems
hpf
single program multiple data

cache-coherent non-uniform memory access


Modeling discourse in collaborative work support systems : a knowledge representation and configuration perspective Collaborative work processes usually raise a lot of intricate debates and negotiations among participants , whereas conflicts of interest are inevitable and support for achieving consensus and compromise is required . Individual contributions , brought up by parties with different backgrounds and interests , need to be appropriately structured and maintained . This paper presents a model of discourse acts that participants use to communicate their attitudes to each other , or affect the attitudes of others , in such environments . The first part deals with the knowledge representation and communication aspects of the problem , while the second one , in the context of an already implemented system , namely HERMES , with issues related to the configuration of the contributions asserted at each discourse instance . The overall work focuses on the machinery needed in a computer-assisted collaborative work environment , the aim being to further enhance the human-computer interaction

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

collaborative work support systems
knowledge representation
conflicts of interest
consensus
compromise
hermes

discourse modeling
knowledge communication
human-computer interaction


A knowledge-based approach for business process reengineering , SHAMASH We present an overview of SHAMASH , a process modelling tool for business process reengineering . The main features that differentiate it from most current related tools are its ability to define and use organisation standards , functional structure , and develop automatic model simulation and optimisation . SHAMASH is a knowledge-based system , and we include a discussion on how knowledge acquisition takes place . Furthermore , we introduce a high level description of the architecture , the conceptual model , and other important modules of the system

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

business process reengineering
shamash
process modelling tool
organisation standards
functional structure
automatic model simulation
optimisation
knowledge acquisition
conceptual model

knowledge-based approach
knowledge-based system


Multi-agent collaboration for B2B workflow monitoring Business-to-business -LRB- B2B -RRB- application environments are exceedingly dynamic and competitive . This dynamism is manifested in the form of changing process requirements and time constraints . However , current workflow management technologies have difficulties trying to solve problems , such as : how to deal with the dynamic nature of B2B commerce processes , how to manage the distributed knowledge and recourses , and how to reduce the transaction risk . In this paper , a collaborative multi-agent system is proposed . Multiple intelligent agents in our system can work together not only to identify the workflow problems , but also to solve such problems , by applying business rules , such as re-organizing the procurement and the transaction processes , and making necessary workflow process changes

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

b2b workflow monitoring
changing process requirements
time constraints
workflow management
transaction risk
business rules

multi-agent collaboration
internet
business-to-business applications
electronic commerce


Outsourced backup saves time To increase the efficiency of its data backup and to free staff to concentrate on core business , The Gadget Shop is relying on a secure , automated system hosted by a third party

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


Knowledge organisation of product design blackboard systems via graph decomposition Knowledge organisation plays an important role in building a knowledge-based product design blackboard system . Well-organised knowledge sources will facilitate the effectiveness and efficiency of communication and data exchange in a blackboard system . In a previous investigation , an approach for constructing blackboard systems for product design using a non-directed graph decomposition algorithm was proposed . In this paper , the relationship between graph decomposition and the resultant blackboard system is further studied . A case study of a number of hypothetical blackboard systems that comprise different knowledge organisations is provided

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

knowledge organisation
product design blackboard systems
graph decomposition
data exchange
case study


High-level language support for user-defined reductions The optimized handling of reductions on parallel supercomputers or clusters of workstations is critical to high performance because reductions are common in scientific codes and a potential source of bottlenecks . Yet in many high-level languages , a mechanism for writing efficient reductions remains surprisingly absent . Further , when such mechanisms do exist , they often do not provide the flexibility a programmer needs to achieve a desirable level of performance . In this paper , we present a new language construct for arbitrary reductions that lets a programmer achieve a level of performance equal to that achievable with the highly flexible , but low-level combination of Fortran and MPI . We have implemented this construct in the ZPL language and evaluate it in the context of the initialization of the NAS MG benchmark . We show a 45 times speedup over the same code written in ZPL without this construct . In addition , performance on a large number of processors surpasses that achieved in the NAS implementation showing that our mechanism provides programmers with the needed flexibility

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

parallel supercomputers
clusters of workstations
reductions
language construct

parallel programming
scientific computing


High-speed CMOS circuits with parallel dynamic logic and speed-enhanced skewed static logic In this paper , we describe parallel dynamic logic -LRB- PDL -RRB- which exhibits high speed without charge sharing problem . PDL uses only parallel-connected transistors for fast logic evaluation and is a good candidate for high-speed low-voltage operation . It has less back-bias effect compared to other logic styles , which use stacked transistors . Furthermore , PDL needs no signal ordering or tapering . PDL with speed-enhanced skewed static logic renders straightforward logic synthesis without the usual area penalty due to logic duplication . Our experimental results on two 32-bit carry lookahead adders using 0.25 - mu m CMOS technology show that PDL with speed-enhanced skewed static -LRB- SSS -RRB- look reduces the delay over clock-delayed -LRB- CD -RRB- - domino by 15 % -27 % and the power-delay product by 20 % -37 %

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

parallel dynamic logic
logic synthesis
carry lookahead adders
delay
stacked transistors

high-speed cmos circuits
speed-enhanced skewed static logic
parallel-connected transistors
low-voltage operation
power-delay product
back-bias effect
32 bit
0.25 micron


A knowledge-based approach for managing urban infrastructures This paper presents a knowledge e-based approach dedicated to the efficient management , regulation , interactive and dynamic monitoring of urban infrastructures . This approach identifies the data and related treatments common to several municipal activities and defines the requirements and functionalities of the computer tools developed to improve the delivery and coordination of municipal services to the population . The resulting cooperative system called SIGIU is composed of a set of integrated operating systems -LRB- SYDEX -RRB- and the global planning and coordination system -LRB- SYGEC -RRB- . The objective is to integrate the set of SYDEX and the SYGEC into a single coherent system for all the SIGIU 's users according to their tasks , their roles , and their responsibilities within the municipal administration . SIGIU is provided by different measurement and monitoring instruments installed on some system 's elements to be supervised . In this context , the information can be presented in different forms : video , pictures , data and alarms . One of SIGIU 's objectives is the real-time management of urban infrastructures ' control mechanisms . To carry out this process , the alarm control agent creates a mobile agent associated with the alarm , which is sent to a mobile station and warns an operator . Preliminary implementation results show that SIGIU supports effectively and efficiently the decision making process related to managing urban infrastructures

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

regulation
dynamic monitoring
municipal activities
cooperative system
sigiu
integrated operating systems
sydex
coordination system
sygec
video
alarm control agent
mobile agent

knowledge-based approach
urban infrastructure management
global planning system
real-time management
intelligent decision support system
urban planning
multi-agent systems


HPF/JA : extensions of High Performance Fortran for accelerating real-world applications This paper presents a set of extensions on High Performance Fortran -LRB- HPF -RRB- to make it more usable for parallelizing real-world production codes . HPF has been effective for programs that a compiler can automatically optimize efficiently . However , once the compiler can not , there have been no ways for the users to explicitly parallelize or optimize their programs . In order to resolve the situation , we have developed a set of HPF extensions -LRB- HPF/JA -RRB- to give the users more control over sophisticated parallelization and communication optimizations . They include parallelization of loops with complicated reductions , asynchronous communication , user-controllable shadow , and communication pattern reuse for irregular remote data accesses . Preliminary experiments have proved that the extensions are effective at increasing HPF 's usability

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

high performance fortran
hpf
compiler
parallelization of loops

parallel processing
data parallel language
supercomputer
parallel programming


Mining the optimal class association rule set We define an optimal class association rule set to be the minimum rule set with the same predictive power of the complete class association rule set . Using this rule set instead of the complete class association rule set we can avoid redundant computation that would otherwise be required for mining predictive association rules and hence improve the efficiency of the mining process significantly . We present an efficient algorithm for mining the optimal class association rule set using an upward closure property of pruning weak rules before they are actually generated . We have implemented the algorithm and our experimental results show that our algorithm generates the optimal class association rule set , whose size is smaller than 1/17 of the complete class association rule set on average , in significantly less time than generating the complete class association rule set . Our proposed criterion has been shown very effective for pruning weak rules in dense databases

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

minimum rule set
predictive power
redundant computation
predictive association rules
upward closure property
experimental results
dense databases

optimal class association rule set mining


A formal framework for viewpoint consistency Multiple viewpoint models of system development are becoming increasingly important . Each viewpoint offers a different perspective on the target system and system development involves parallel refinement of the multiple views . Viewpoint related approaches have been considered in a number of different guises by a spectrum of researchers . Our work particularly focuses on the use of viewpoints in open distributed processing -LRB- ODP -RRB- which is an ISO/ITU standardisation framework . The requirements of viewpoint modelling in ODP are very broad and , hence , demanding . Multiple viewpoints , though , prompt the issue of consistency between viewpoints . This paper describes a very general interpretation of consistency which we argue is broad enough to meet the requirements of consistency in ODP . We present a formal framework for this general interpretation ; highlight basic properties of the interpretation and locate restricted classes of consistency . Strategies for checking consistency are also investigated . Throughout we illustrate our theory using the formal description technique LOTOS . Thus , the paper also characterises the nature of and options for consistency checking in LOTOS

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

multiple viewpoint models
formal framework
viewpoint consistency
system development
open distributed processing
odp
consistency checking
formal description technique
lotos

iso/itu standardisation framework
development models
process algebra


Formula-dependent equivalence for compositional CTL model checking We present a polytime computable state equivalence that is defined with respect to a given CTL formula . Since it does not attempt to preserve all CTL formulas , like bisimulation does , we can expect to compute coarser equivalences . This equivalence can be used to reduce the complexity of model checking a system of interacting FSM . Additionally , we show that in some cases our techniques can detect if a formula passes or fails , without forming the entire product machine . The method is exact and fully automatic , and handles full CTL

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

ctl model checking
polytime computable state equivalence
ctl formula
interacting fsm

formula-dependent equivalence
compositional minimization
coarse equivalence
complexity reduction
automatic method
formal design verification
computation tree logic


A new identification approach for FIR models The identification of stochastic discrete systems disturbed with noise is discussed in this brief . The concept of general prediction error -LRB- GPE -RRB- criterion is introduced for the time-domain estimate with optimal frequency estimation -LRB- OFE -RRB- introduced for the frequency-domain estimate . The two estimation methods are combined to form a new identification algorithm , which is called the empirical frequency-domain optimal parameter -LRB- EFOP -RRB- estimate , for the finite impulse response -LRB- FIR -RRB- model interfered by noise . The algorithm theoretically provides the global optimum of the model frequency-domain estimate . Some simulation examples are given to illustrate the new identification method

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

identification approach
fir models
stochastic discrete systems
optimal frequency estimation

empirical frequency-domain optimal parameter estimate


Formalization of weighted factors analysis Weighted factors analysis -LRB- WeFA -RRB- has been proposed as a new approach for elicitation , representation , and manipulation of knowledge about a given problem , generally at a high and strategic level . Central to this proposal is that a group of experts in the area of the problem can identify a hierarchy of factors with positive or negative influences on the problem outcome . The tangible output of WeFA is a directed weighted graph called a WeFA graph . This is a set of nodes denoting factors that can directly or indirectly influence an overall aim of the graph . The aim is also represented by a node . Each directed arc is a direct influence of one factor on another . A chain of directed arcs indicates an indirect influence . The influences may be identified as either positive or negative . For example , sales and costs are two factors that influence the aim of profitability in an organization . Sales has a positive influence on profitability and costs has a negative influence on profitability . In addition , the relative significance of each influence is represented by a weight . We develop Binary WeFA which is a variant of WeFA where the factors in the graph are restricted to being either true or false . Imposing this restriction on a WeFA graph allows us to be more precise about the meaning of the graph and of reasoning in it . Binary WeFA is a new proposal that provides a formal yet sufficiently simple language for logic-based argumentation for use by business people in decision-support and knowledge management . Whilst Binary WeFA is expressively simpler than other logic-based argumentation formalisms , it does incorporate a novel formalization of the notion of significance

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

weighted factors analysis
significance
wefa graph
directed arc
profitability
organization
binary wefa
reasoning
knowledge management
directed weighted graph

knowledge elicitation
knowledge representation
knowledge manipulation
logic-based argumentation
decision-support


Formalising optimal feature weight setting in case based diagnosis as linear programming problems Many approaches to case based reasoning -LRB- CBR -RRB- exploit feature weight setting algorithms to reduce the sensitivity to distance functions . We demonstrate that optimal feature weight setting in a special kind of CBR problems can be formalised as linear programming problems . Therefore , the optimal weight settings can be calculated in polynomial time instead of searching in exponential weight space using heuristics to get sub-optimal settings . We also demonstrate that our approach can be used to solve classification problems

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

optimal feature weight setting
case based diagnosis
linear programming
case based reasoning
distance functions
polynomial time
searching
exponential weight space
classification
heuristics


The MAGNeT toolkit : design , implementation and evaluation The current trend in constructing high-performance computing systems is to connect a large number of machines via a fast interconnect or a large-scale network such as the Internet . This approach relies on the performance of the interconnect -LRB- or Internet -RRB- to enable fast , large-scale distributed computing . A detailed understanding of the communication traffic is required in order to optimize the operation of the entire system . Network researchers traditionally monitor traffic in the network to gain the insight necessary to optimize network operations . Recent work suggests additional insight can be obtained by also monitoring traffic at the application level . The Monitor for Application-Generated Network Traffic toolkit -LRB- MAGNeT -RRB- we describe here monitors application traffic patterns in production systems , thus enabling more highly optimized networks and interconnects for the next generation of high-performance computing systems

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

internet
optimized networks
interconnects
magnet

monitor for application-generated network traffic toolkit


TCRM : diagnosing tuple inconsistency for granulized datasets Many approaches to granularization have been presented for knowledge discovery . However , the inconsistent tuples that exist in granulized datasets are hardly ever revealed . We developed a model , tuple consistency recognition model -LRB- TCRM -RRB- to help efficiently detect inconsistent tuples for datasets that are granulized . The main outputs of the developed model include explored inconsistent tuples and consumed processing time . We further conducted an empirical test where eighteen continuous real-life datasets granulized by the equal width interval technique that embedded S-plus histogram binning algorithm -LRB- SHBA -RRB- and largest binning size algorithm -LRB- LBSA -RRB- binning algorithms were diagnosed . Remarkable results : almost 40 % of the granulized datasets contain inconsistent tuples and 22 % have the amount of inconsistent tuples more than 20 %

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

tcrm
tuple inconsistency
granulized datasets
granularization
knowledge discovery
tuple consistency recognition model
processing time
equal width interval technique
largest binning size algorithm

relational database
large database
s-plus histogram binning algorithm
sql


Will new Palms win laurels . ? PalmSource 's latest operating system for mobile devices harnesses the ARM architecture to support more powerful business software , but there are concerns over compatibility with older applications

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

palmsource
operating system
mobile devices
arm architecture
compatibility


Adaptive optimizing compilers for the 21st century Historically , compilers have operated by applying a fixed set of optimizations in a predetermined order . We call such an ordered list of optimizations a compilation sequence . This paper describes a prototype system that uses biased random search to discover a program-specific compilation sequence that minimizes an explicit , external objective function . The result is a compiler framework that adapts its behavior to the application being compiled , to the pool of available transformations , to the objective function , and to the target machine . This paper describes experiments that attempt to characterize the space that the adaptive compiler must search . The preliminary results suggest that optimal solutions are rare and that local minima are frequent . If this holds true , biased random searches , such as a , genetic algorithm , should find good solutions more quickly than simpler strategies , such as hill climbing

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

compilers
optimizations
compilation sequence
adaptive compiler
biased random search

optimizing compilers
configurable compilers


Temp IT chief rallies troops -LSB- Mori -RSB- The appointment of a highly qualified interim IT manager enabled market research company Mori to rapidly restructure its IT department . Now the resulting improvements are allowing it to support an increasing role for technology in the assimilation and analysis of market research

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

market research company
mori
interim it manager


A knowledge intensive multi-agent framework for cooperative/collaborative design modeling and decision support of assemblies Multi-agent modeling has emerged as a promising discipline for dealing with the decision making process in distributed information system applications . One of such applications is the modeling of distributed design or manufacturing processes which can link up various designs or manufacturing processes to form a virtual consortium on a global basis . This paper proposes a novel knowledge intensive multi-agent cooperative/collaborative framework for concurrent intelligent design and assembly planning , which integrates product design , design for assembly , assembly planning , assembly system design , and assembly simulation subjected to econo-technical evaluations . An AI protocol based method is proposed to facilitate the integration of intelligent agents for assembly design , planning , evaluation and simulation processes . A unified class of knowledge intensive Petri nets is defined using the OO knowledge-based Petri net approach and used as an AI protocol for handling both the integration and the negotiation problems among multi-agents . The detailed cooperative/collaborative mechanism and algorithms are given based on the knowledge object cooperation formalisms . As such , the assembly-oriented design system can easily be implemented under the multi-agent-based knowledge-intensive Petri net framework with concurrent integration of multiple cooperative knowledge sources and software . Thus , product design and assembly planning can be carried out simultaneously and intelligently in an entirely computer-aided concurrent design and assembly planning system

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


Advanced optimization strategies in the Rice dHPF compiler High-Performance Fortran -LRB- HPF -RRB- was envisioned as a vehicle for modernizing legacy Fortran codes to achieve scalable parallel performance . To a large extent , today 's commercially available HPF compilers have failed to deliver scalable parallel performance for a broad spectrum of applications because of insufficiently powerful compiler analysis and optimization . Substantial restructuring and hand-optimization can be required to achieve acceptable performance with an HPF port of an existing Fortran application , even for regular data-parallel applications . A key goal of the Rice dHPF compiler project has been to develop optimization techniques that enable a wide range of existing scientific applications to be ported easily to efficient HPF with minimal restructuring . This paper describes the challenges to effective parallelization presented by complex -LRB- but regular -RRB- data-parallel applications , and then describes how the novel analysis and optimization technologies in the dHPF compiler address these challenges effectively , without major rewriting of the applications . We illustrate the techniques by describing their use for parallelizing the NAS SP and BT benchmarks . The dHPF compiler generates multipartitioned parallelizations of these codes that are approaching the scalability and efficiency of sophisticated hand-coded parallelizations

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

legacy fortran codes
parallel performance
hpf compilers
compiler analysis
rice dhpf compiler

mgh-performance fortran
compiler optimization
multipartitioning
automatic parallelization


Knowledge flow management for distributed team software development Cognitive cooperation is often neglected in current team software development processes . This issue becomes more important than ever when team members are globally distributed . This paper presents a notion of knowledge flow and the related management mechanism for realizing an ordered knowledge sharing and cognitive cooperation in a geographically distributed team software development process . The knowledge flow can carry and accumulate knowledge when it goes through from one team member to another . The coordination between the knowledge flow process and the workflow process of a development team provides a new way to improve traditional team software development processes . A knowledge grid platform has been implemented to support the knowledge flow management across the Internet

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

knowledge flow management
distributed team software development
cognitive cooperation
ordered knowledge sharing
workflow process
knowledge grid platform
internet

knowledge flow representation
software development management
cooperative work


HPCVIEW : a tool for top-down analysis of node performance It is increasingly difficult for complex scientific programs to attain a significant fraction of peak performance on systems that are based on microprocessors with substantial instruction-level parallelism and deep memory hierarchies . Despite this trend , performance analysis and tuning tools are still not used regularly by algorithm and application designers . To a large extent , existing performance tools fail to meet many user needs and are cumbersome to use . To address these issues , we developed HPCVIEW - a toolkit for combining multiple sets of program profile data , correlating the data with source code , and generating a database that can be analyzed anywhere with a commodity Web browser . We argue that HPCVIEW addresses many of the issues that have limited the usability and the utility of most existing tools . We originally built HPCVIEW to facilitate our own work on data layout and optimizing compilers . Now , in addition to daily use within our group , HPCVIEW is being used by several code development teams in DoD and DoE laboratories as well as at NCSA

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

hpcview
node performance
complex scientific programs
peak performance
deep memory hierarchies
performance analysis
source code
commodity web browser
data layout
optimizing compilers

top-down analysis
instruction-level parallelism
software tools
binary analysis


Knowledge acquisition for expert systems in accounting and financial problem domains Since the mid-1980s , expert systems have been developed for a variety of problems in accounting and finance . The most commonly cited problems in developing these systems are the unavailability of the experts and knowledge engineers and difficulties with the rule extraction process . Within the field of artificial intelligence , this has been called the ` knowledge acquisition ' -LRB- KA -RRB- problem and has been identified as a major bottleneck in the expert system development process . Recent empirical research reveals that certain KA techniques are significantly more efficient than others in helping to extract certain types of knowledge within specific problem domains . This paper presents a mapping between these empirical studies and a generic taxonomy of expert system problem domains . To accomplish this , we first examine the range of problem domains and suggest a mapping of accounting and finance tasks to a generic problem domain taxonomy . We then identify and describe the most prominent KA techniques employed in developing expert systems in accounting and finance . After examining and summarizing the existing empirical KA work , we conclude by showing how the empirical KA research in the various problem domains can be used to provide guidance to developers of expert systems in the fields of accounting and finance

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

knowledge acquisition
expert systems
accounting
finance
rule extraction process
artificial intelligence
problem domain taxonomy


Efficient parallel programming on scalable shared memory systems with High Performance Fortran OpenMP offers a high-level interface for parallel programming on scalable shared memory -LRB- SMP -RRB- architectures . It provides the user with simple work-sharing directives while it relies on the compiler to generate parallel programs based on thread parallelism . However , the lack of language features for exploiting data locality often results in poor performance since the non-uniform memory access times on scalable SMP machines can not be neglected . High Performance Fortran -LRB- HPF -RRB- , the de-facto standard for data parallel programming , offers a rich set of data distribution directives in order to exploit data locality , but it has been mainly targeted towards distributed memory machines . In this paper we describe an optimized execution model for HPF programs on SMP machines that avails itself with mechanisms provided by OpenMP for work sharing and thread parallelism , while exploiting data locality based on user-specified distribution directives . Data locality does not only ensure that most memory accesses are close to the executing threads and are therefore faster , but it also minimizes synchronization overheads , especially in the case of unstructured reductions . The proposed shared memory execution model for HPF relies on a small set of language extensions , which resemble the OpenMP work-sharing features . These extensions , together with an optimized shared memory parallelization and execution model , have been implemented in the ADAPTOR HPF compilation system and experimental results verify the efficiency of the chosen approach

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

parallel programming
scalable shared memory
high performance fortran

multiprocessor architectures
scalable hardware
shared memory multiprocessor


VPP Fortran and the design of HPF/JA extensions VPP Fortran is a data parallel language that has been designed for the VPP series of supercomputers . In addition to pure data parallelism , it contains certain low-level features that were designed to extract high performance from user programs . A comparison of VPP Fortran and High-Performance Fortran -LRB- HPF -RRB- 2.0 shows that these low-level features are not available in HPF 2.0 . The features include asynchronous interprocessor communication , explicit shadow , and the LOCAL directive . They were shown in VPP Fortran to be very useful in handling real-world applications , and they have been included in the HPF/JA extensions . They are described in the paper . The HPF/JA Language Specification Version 1.0 is an extension of HPF 2.0 to achieve practical performance for real-world applications and is a result of collaboration in the Japan Association for HPF -LRB- JAHPF -RRB- . Some practical programming and tuning procedures with the HPF/JA Language Specification are described , using the NAS Parallel Benchmark BT as an example

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

asynchronous communication
data locality


Packet spacing : an enabling mechanism for delivering multimedia content in computational grids Streaming multimedia with UDP has become increasingly popular over distributed systems like the Internet . Scientific applications that stream multimedia include remote computational steering of visualization data and video-on-demand teleconferencing over the Access Grid . However , UDP does not possess a self-regulating , congestion-control mechanism ; and most best-effort traffic is served by congestion-controlled TCP . Consequently , UDP steals bandwidth from TCP such that TCP flows starve for network resources . With the volume of Internet traffic continuing to increase , the perpetuation of UDP-based streaming will cause the Internet to collapse as it did in the mid-1980 's due to the use of non-congestion-controlled TCP . To address this problem , we introduce the counter-intuitive notion of inter-packet spacing with control feedback to enable UDP-based applications to perform well in the next-generation Internet and computational grids . When compared with traditional UDP-based streaming , we illustrate that our approach can reduce packet loss over 50 % without adversely affecting delivered throughput

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

streaming multimedia
udp
distributed systems
internet
remote computational steering
visualization data

inter-packet spacing
udp-based streaming
network protocol
transport protocols


A Virtual Test Facility for the simulation of dynamic response in materials The Center for Simulating Dynamic Response of Materials at the California Institute of Technology is constructing a virtual shock physics facility for studying the response of various target materials to very strong shocks . The Virtual Test Facility -LRB- VTF -RRB- is an end-to-end , fully three-dimensional simulation of the detonation of high explosives -LRB- HE -RRB- , shock wave propagation , solid material response to pressure loading , and compressible turbulence . The VTF largely consists of a parallel fluid solver and a parallel solid mechanics package that are coupled together by the exchange of boundary data . The Eulerian fluid code and Lagrangian solid mechanics model interact via a novel approach based on level sets . The two main computational packages are integrated through the use of Pyre , a problem solving environment written in the Python scripting language . Pyre allows application developers to interchange various computational models and solver packages without recompiling code , and it provides standardized access to several data visualization engines and data input mechanisms . In this paper , we outline the main components of the VTF , discuss their integration via Pyre , and describe some recent accomplishments in large-scale simulation using the VTF

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

virtual shock physics facility
virtual test facility
high explosives
shock wave propagation
solid material response
pressure loading
compressible turbulence
parallel fluid solver
parallel solid mechanics
data visualization
pyre
problem solving environment
python scripting language


Implementation and evaluation of HPF/SX V2 We are developing HPF/SX V2 , a High Performance Fortran -LRB- HPF -RRB- compiler for vector parallel machines . It provides some unique extensions as well as the features of HPF 2.0 and HPF/JA . In particular , this paper describes four of them : -LRB- 1 -RRB- the ON directive of HPF 2.0 ; -LRB- 2 -RRB- the REFLECT and LOCAL directives of HPF/JA ; -LRB- 3 -RRB- vectorization directives ; and -LRB- 4 -RRB- automatic parallelization . We evaluate these features through some benchmark programs on NEC SX-5 . The results show that each of them achieved a 5-8 times speedup in 8-CPU parallel execution and the four features are useful for vector parallel execution . We also evaluate the overall performance of HPF/SX V2 by using over 30 well-known benchmark programs from HPFBench , APR Benchmarks , GENESIS Benchmarks , and NAS Parallel Benchmarks . About half of the programs showed good performance , while the other half suggest weakness of the compiler , especially on its runtimes . It is necessary to improve them to put the compiler to practical use

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

vector parallel machines
benchmark
parallelization
compiler

hpf/sx v2
high performance fortran compiler


Design and prototype of a performance tool interface for OpenMP This paper proposes a performance tools interface for OpenMP , similar in spirit to the MPI profiling interface in its intent to define a clear and portable API that makes OpenMP execution events visible to runtime performance tools . We present our design using a source-level instrumentation approach based on OpenMP directive rewriting . Rules to instrument each directive and their combination are applied to generate calls to the interface consistent with directive semantics and to pass context information -LRB- e.g. , source code locations -RRB- in a portable and efficient way . Our proposed OpenMP performance API further allows user functions and arbitrary code regions to be marked and performance measurement to be controlled using new OpenMP directives . To prototype the proposed OpenMP performance interface , we have developed compatible performance libraries for the EXPERT automatic event trace analyzer -LSB- 17 , 18 -RSB- and the TAU performance analysis framework -LSB- 13 -RSB- . The directive instrumentation transformations we define are implemented in a source-to-source translation tool called OPARI . Application examples are presented for both EXPERT and TAU to show the OpenMP performance interface and OPARI instrumentation tool in operation . When used together with the MPI profiling interface -LRB- as the examples also demonstrate -RRB- , our proposed approach provides a portable and robust solution to performance analysis of OpenMP and mixed-mode -LRB- OpenMP + MPI -RRB- applications

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

performance tool interface
mpi profiling interface
api
openmp directive rewriting
directive semantics
arbitrary code regions
performance libraries
expert automatic event trace analyzer
tau performance analysis framework
opari

source-level instrumentation approach
source-to-source translation tool
parallel programming


Server safeguards tax service Peterborough-based tax consultancy IE Taxguard wanted real-time failover protection for important Windows-based applications . Its solution was to implement a powerful failover server from UK supplier Neverfail in order to provide real-time backup for three core production servers

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

tax consultancy
ie taxguard
failover server
neverfail
backup


Optimization of element-by-element FEM in HPF 1.1 In this study , Poisson 's equation is numerically evaluated by the element-by-element -LRB- EBE -RRB- finite-element method in a parallel environment using HPF 1.1 -LRB- High-Performance Fortran -RRB- . In order to achieve high parallel efficiency , the data structures have been altered to node-based data instead of mixtures of node - and element-based data , representing a node-based EBE finite-element scheme -LRB- nEBE -RRB- . The parallel machine used in this study was the NEC SX-4 , and experiments were performed on a single node having 32 processors sharing common memory . The HPF compiler used in the experiments is HPF/SX Rev 2.0 released in 1997 -LRB- unofficial -RRB- , which supports HPF 1.1 . Models containing approximately 200 000 and 1,500,000 degrees of freedom were analyzed in order to evaluate the method . The calculation time , parallel efficiency , and memory used were compared . The performance of HPF in the conjugate gradient solver for the large model , using the NEC SX-4 compiler option-noshrunk , was about 85 % that of the message passing interface

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

hpf compiler
conjugate gradient solver
message passing
hpf

finite element method
parallel programs
poisson equation
element-by-element


Dot-Net makes slow progress Microsoft 's Windows . Net Enterprise Server Release Candidate I , which was released at the end of last month , provides an early glimpse of the system that will eventually replace Windows 200 Advanced Server . The software has been improved so that Active Directory is more flexible and easier to deploy ; and security , scalability and management have also been enhanced

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


BT voices its support for IP BTexact 's chief technology officer , Mick Reeve , gives his views on the future for voice over DSL services and virtual private networks , and defends the slow rollout of public access WLANs

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

btexact
voice over dsl
virtual private networks
public access wlans


High-performance numerical pricing methods The pricing of financial derivatives is an important field in finance and constitutes a major component of financial management applications . The uncertainty of future events often makes analytic approaches infeasible and , hence , time-consuming numerical simulations are required . In the Aurora Financial Management System , pricing is performed on the basis of lattice representations of stochastic multidimensional scenario processes using the Monte Carlo simulation and Backward Induction methods , the latter allowing for the exploitation of shared-memory parallelism . We present the parallelization of a Backward Induction numerical pricing kernel on a cluster of SMPs using HPF + , an extended version of High-Performance Fortran . Based on language extensions for specifying a hierarchical mapping of data onto an SMP cluster , the compiler generates a hybrid-parallel program combining distributed-memory and shared-memory parallelism . We outline the parallelization strategy adopted by the VFC compiler and present an experimental evaluation of the pricing kernel on an NEC SX-5 vector supercomputer and a Linux SMP cluster , comparing a pure MPI version to a hybrid-parallel MPI/OpenMP version

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

finance
financial management
pricing
monte carlo simulation
backward induction methods

aurora financial management system
stochastic processes
numerical pricing kernel
derivative pricing
investment strategies


An approach to developing computational supports for reciprocal tutoring This study presents a novel approach to developing computational supports for reciprocal tutoring . Reciprocal tutoring is a collaborative learning activity , where two participants take turns to play the role of a tutor and a tutee . The computational supports include scaffolding tools for the tutor and a computer-simulated virtual participant . The approach , including system architecture , implementations of scaffolding tools for the tutor and of a virtual participant is presented herein . Furthermore , a system for reciprocal tutoring is implemented as an example of the approach

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

collaborative learning
scaffolding tools
system architecture

reciprocal tutoring computational support


Three-dimensional global MHD simulation code for the Earth 's magnetosphere using HPF/JA We have translated a three-dimensional magnetohydrodynamic -LRB- MHD -RRB- simulation code of the Earth 's magnetosphere from VPP Fortran to HPF/JA on the Fujitsu VPP5000/56 vector-parallel supercomputer and the MHD code was fully vectorized and fully parallelized in VPP Fortran . The entire performance and capability of the HPF MHD code could be shown to be almost comparable to that of VPP Fortran . A three-dimensional global MHD simulation of the Earth 's magnetosphere was performed at a speed of over 400 Gflops with an efficiency of 76.5 % using 56 processing elements of the Fujitsu VPP5000/56 in vector and parallel computation that permitted comparison with catalog values . We have concluded that fluid and MHD codes that are fully vectorized and fully parallelized in VPP Fortran can be translated with relative ease to HPF/JA , and a code in HPF/JA may be expected to perform comparably to the same code written in VPP Fortran

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

hpf mhd code
mhd simulation
parallel computation

magnetohydrodynamic simulation
vector-parallel supercomputer
fujitsu vpp5000/56


Technology decisions 2002 The paper looks at the critical hardware , software , and services choices manufacturers are making as they begin to emerge from the recession and position themselves for the future

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

manufacturing industries
information technology
management of change
customer relationship management
enterprise resource planning


Finding performance bugs with the TNO HPF benchmark suite High-Performance Fortran -LRB- HPF -RRB- has been designed to provide portable performance on distributed memory machines . An important aspect of portable performance is the behavior of the available HPF compilers . Ideally , a programmer may expect comparable performance between different HPF compilers , given the same program and the same machine . To test the performance portability between compilers , we have designed a special benchmark suite , called the TNO HPF benchmark suite . It consists of a set of HPF programs that test various aspects of efficient parallel code generation . The benchmark suite consists of a number of template programs that are used to generate test programs with different array sizes , alignments , distributions , and iteration spaces . It ranges from very simple assignments to more complex assignments such as triangular iteration spaces , convex iteration spaces , coupled subscripts , and indirection arrays . We have run the TNO HPF benchmark suite on three compilers : the PREPARE prototype compiler , the PGI-HPF compiler , and the GMD Adaptor HPF compiler . Results show performance differences that can be quite large -LRB- up to two orders of magnitude for the same test program -RRB- . Closer inspection reveals that the origin of most of the differences in performance is due to differences in local enumeration and storage of distributed array elements

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

portable performance
distributed memory machines
hpf compilers
performance portability
benchmark suite

high-performance fortran
parallel compilers
compiler optimizations


Techniques for compiling and implementing all NAS parallel benchmarks in HPF The NAS parallel benchmarks -LRB- NPB -RRB- are a well-known benchmark set for high-performance machines . Much effort has been made to implement them in High-Performance Fortran -LRB- HPF -RRB- . In previous attempts , however , the HPF versions did not include the complete set of benchmarks , and the performance was not always good . In this study , we implement all eight benchmarks of the NPB in HPF , and parallelize them using an HPF compiler that we have developed . This report describes the implementation techniques and compiler features necessary to achieve good performance . We evaluate the HPF version on the Hitachi SR2201 , a distributed-memory parallel machine . With 16 processors , the execution time of the HPF version is within a factor of 1.5 of the hand-parallelized version of the NPB 2.3 beta

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


Hybrid decision tree In this paper , a hybrid learning approach named hybrid decision tree -LRB- HDT -RRB- is proposed . HDT simulates human reasoning by using symbolic learning to do qualitative analysis and using neural learning to do subsequent quantitative analysis . It generates the trunk of a binary HDT according to the binary information gain ratio criterion in an instance space defined by only original unordered attributes . If unordered attributes can not further distinguish training examples falling into a leaf node whose diversity is beyond the diversity-threshold , then the node is marked as a dummy node . After all those dummy nodes are marked , a specific feedforward neural network named FANNC that is trained in an instance space defined by only original ordered attributes is exploited to accomplish the learning task . Moreover , this paper distinguishes three kinds of incremental learning tasks . Two incremental learning procedures designed for example-incremental learning with different storage requirements are provided , which enables HDT to deal gracefully with data sets where new data are frequently appended . Also a hypothesis-driven constructive induction mechanism is provided , which enables HDT to generate compact concept descriptions

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

hybrid decision tree
hybrid learning approach
reasoning
symbolic learning
qualitative analysis
neural learning
quantitative analysis
binary information gain ratio criterion
feedforward neural network
fannc
incremental learning
storage requirements
data sets


Compatibility comparison and performance evaluation for Japanese HPF compilers using scientific applications The lack of compatibility of High-Performance Fortran -LRB- HPF -RRB- between vender implementations has been disheartening scientific application users so as to hinder the development of portable programs . Thus parallel computing is still unpopular in the computational science community , even though parallel programming is common to the computer science community . As users would like to run the same source code on parallel machines with different architectures as fast as possible , we have investigated the compatibility of source codes for Japanese HPF compilers -LRB- NEC , Fujitsu and Hitachi -RRB- with two real-world applications : a 3D fluid code and a 2D particle code . We have found that the source-level compatibility between Japanese HPF compilers is almost preserved , but more effort will be needed to sustain complete compatibility . We have also evaluated parallel performance and found that HPF can achieve good performance for the 3D fluid code with almost the same source code . For the 2D particle code , good results have also been obtained with a small number of processors , but some changes in the original source code and the addition of interface blocks is required

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

hpf
portable programs
parallel programming
compilers
parallel performance

high-performance fortran
source compatability


A notion of non-interference for timed automata The non-interference property of concurrent systems is a security property concerning the flow of information among different levels of security of the system . In this paper we introduce a notion of timed non-interference for real-time systems specified by timed automata . The notion is presented using an automata based approach and then it is characterized also by operations and equivalence between timed languages . The definition is applied to an example of a time-critical system modeling a simplified control of an airplane

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

timed automata
concurrent systems
security property

noninterference notion
real-time systems
time-critical system


Supporting unified interface to wrapper generator in integrated information retrieval Given the ever-increasing scale and diversity of information and applications on the Internet , improving the technology of information retrieval is an urgent research objective . Retrieved information is either semi-structured or unstructured in format and its sources are extremely heterogeneous . In consequence , the task of efficiently gathering and extracting information from documents can be both difficult and tedious . Given this variety of sources and formats , many choose to use mediator/wrapper architecture , but its use demands a fast means of generating efficient wrappers . In this paper , we present a design for an automatic eXtensible Markup Language -LRB- XML -RRB- - based framework with which to generate wrappers rapidly . Wrappers created with this framework support a unified interface for a meta-search information retrieval system based on the Internet Search Service using the Common Object Request Broker Architecture -LRB- CORBA -RRB- standard . Greatly advantaged by the compatibility of CORBA and XML , a user can quickly and easily develop information-gathering applications , such as a meta-search engine or any other information source retrieval method . The two main things our design provides are a method of wrapper generation that is fast , simple , and efficient , and a wrapper generator that is CORBA and XML-compliant and that supports a unified interface

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

unified interface
wrapper generator
integrated information retrieval
internet
automatic extensible markup language
corba


UPSILON : universal programming system with incomplete lazy object notation This paper presents a new model of computation that differs from prior models in that it emphasizes data over flow control , has no named variables and has an object-oriented flavor . We prove that this model is a complete and confluent acceptable programming system and has a usable type theory . A new data synchronization primitive is introduced in order to achieve the above properties . Subtle variations of the model are shown to fall short of having all these necessary properties

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

upsilon
universal programming system
programming system
usable type theory
data synchronization primitive
incomplete lazy object notation


A synergic analysis for Web-based enterprise resources planning systems As the central nervous system for managing an organization 's mission and critical business data , Enterprise Resource Planning -LRB- ERP -RRB- system has evolved to become the backbone of e-business implementation . Since an ERP system is multimodule application software that helps a company manage its important business functions , it should be versatile enough to automate every aspect of business processes , including e-business

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

enterprise resource planning
erp
synergic analysis

e-business
customer relationship management
web-based enterprise resources planning


Products and polymorphic subtypes This paper is devoted to a comprehensive study of polymorphic subtypes with products . We first present a sound and complete Hilbert style axiomatization of the relation of being a subtype in presence of to , * type constructors and the For all quantifier , and we show that such axiornatization is not encodable in the system with to , For all only . In order to give a logical semantics to such a subtyping relation , we propose a new form of a sequent which plays a key role in a natural deduction and a Gentzen style calculi . Interestingly enough , the sequent must have the form E implies T , where E is a non-commutative , non-empty sequence of typing assumptions and T is a finite binary tree of typing judgements , each of them behaving like a pushdown store . We study basic metamathematical properties of the two logical systems , such as subject reduction and cut elimination . Some decidability/undecidability issues related to the presented subtyping relation are also explored : as expected , the subtyping over to , * , For all is undecidable , being already undecidable for the to , For all fragment -LRB- as proved in -LSB- 15 -RSB- -RRB- , but for the * , For all fragment it turns out to be decidable

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

polymorphic subtypes
hilbert style axiomatization
logical semantics
gentzen style calculi
finite binary tree
pushdown store

products subtypes
metamathernatical properties
decidability


Public business libraries : the next chapter Traces the history of the provision of business information by Leeds Public Libraries , UK , from the opening of the Public Commercial and Technical Library in 1918 to the revolutionary impact of the Internet in the 1990s . Describes how the Library came to terms with the need to integrate the Internet into its mainstream business information services , with particular reference to its limitations and to the provision of company information , market research , British Standards information , press cuttings and articles from specialized trade and scientific journals , and patents information . Focuses on some of the reasons why the public business library is still needed as a service to businesses , even after the introduction of the Internet and considers the Library 's changing role and the need to impress on all concerned , especially government , the continuing value of these services . Looks to the partnerships formed by the Library over the years and the ways in which these are expected to assist in realizing future opportunities , in particular , the fact that all public libraries in England gained free Internet access at the end of 2001 . Offers some useful ideas about how the Library could develop , noting that SINTO , a Sheffield based information network formed in 1938 and originally a partnership between the public library , the two Sheffield universities and various leading steel companies of the time , is being examined as a model for future services in Leeds . Concludes that the way forward can be defined in terms of five actions : redefinition of priorities ; marketing ; budgets ; resources ; and the use of information technology -LRB- IT -RRB-

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

history
public business libraries
leeds public libraries
internet
public commercial and technical library
business information services
company information
market research
british standards information
press cuttings
patents information
government
sinto
information network
sheffield universities
steel companies
marketing
budgets
resources

trade journal articles
scientific journal articles
priority redefinition
it use


3D reconstruction from uncalibrated-camera optical flow and its reliability evaluation We present a scheme for reconstructing a 3D structure from optical flow observed by a camera with an unknown focal length in a statistically optimal way as well as evaluating the reliability of the computed shape . First , the flow fundamental matrices are optimally computed from the observed flow . They are then decomposed into the focal length , its rate of change , and the motion parameters . Next , the flow is optimally corrected so that it satisfies the epipolar equation exactly . Finally , the 3D positions are computed , and their covariance matrices are evaluated . By simulations and real-image experiments , we test the performance of our system and observe how the normalization -LRB- gauge -RRB- for removing indeterminacy affects the description of uncertainty

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

3d reconstruction
reliability evaluation
flow fundamental matrices
motion parameters
epipolar equation
covariance matrices
normalization

uncalibrated-camera optical flow
real-image experiments