ppxscal/embedding_network huggingface dataset:
Application of Gaussian quadratures to density functional (df) theories of confined liquid crystals
Authors: Agnieszka Chrzanowska
Venue: Journal of Computational Physics (2003)

We present a technique to conduct the density functional analysis of a liquid crystal system under the constraints of two parallel walls. The key feature of our approach is the way to perform multidimensional integrals in which certain regimes of the arguments are forbidden due to the effect of the wall excluded volume. This effect occurs in the surface potentials that contain orientationally dependent hard cores. The proposed calculations are based on the exact Gaussian quadratures and application of the modified limits of integration. They are quick and efficient and give reasonable orientation-density distribution functions for a relatively small number of the integration grid points. Another benefit of the proposed method is the fact that neither polynomial expansions nor interpolations of the integral elements is needed and the resulting solution for the distribution functions is only endowed by the error of the second virial approximation. Application of this algorithm can be extended to soft interactions by using the hard core cutoff of the soft potentials as the limits of integration.
Applying data mining in investigating money laundering crimes
Authors: Zhongfei (Mark) Zhang, John J. Salerno, Philip S. Yu
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

In this paper, we study the problem of applying data mining to facilitate the investigation of money laundering crimes (MLCs). We have identified a new paradigm of problems --- that of automatic community generation based on uni-party data, the data in which there is no direct or explicit link information available. Consequently, we have proposed a new methodology for Link Discovery based on Correlation Analysis (LDCA). We have used MLC group model generation as an exemplary application of this problem paradigm, and have focused on this application to develop a specific method of automatic MLC group model generation based on timeline analysis using the LDCA methodology, called CORAL. A prototype of CORAL method has been implemented, and preliminary testing and evaluations based on a real MLC case data are reported. The contributions of this work are: (1) identification of the uni-party data community generation problem paradigm, (2) proposal of a new methodology LDCA to solve for problems in this paradigm, (3) formulation of the MLC group model generation problem as an example of this paradigm, (4) application of the LDCA methodology in developing a specific solution (CORAL) to the MLC group model generation problem, and (5) development, evaluation, and testing of the CORAL prototype in a real MLC case data.
MOVIE: an incremental maintenance system for materialized object views
Authors: M. Akhtar Ali, Alvaro A. A. Fernandes, Norman W. Paton
Venue: Data Knowledge Engineering (2003)

View materialization is an important technique for high performance query processing, data integration and replication. Solutions to the problem of incrementally maintaining materialized views are very relevant. So far, most work on this problem has been confined to relational settings and solutions have not been comprehensively evaluated. This paper describes MOVIE, a complete, implemented and evaluated solution to the problem of incrementally maintaining materialized OQL views in ODMG-compliant object databases. The evaluation throws light into how the effectiveness of incremental maintenance is affected by issues such as database size, and the complexity and selectivity of views.
MMWA: A Software Sizing Model for Web Applications
Authors: Leonardo Mangia, Roberto Paiano
Venue: Proceedings of the Fourth International Conference on Web Information Systems Engineering (2003)

Estimating time and costs is a crucial factor in application development projects and low error margins are a priority.In line with the very fast evolution of Internet technologies, all applications are quickly becoming Web Applications, which are growing without a consolidated project methodology.Thus there is a clear need for an estimation model for these applications' development projects.The aim of the present paper is to illustrate a new Web Application cost estimation model that can form the starting point for any development project.The estimation model described in this paper is called MMWA (Metrics Model for Web Applications). This is an "early measures model", since the measurements are effected at the start of the software life cycle, with a view to accurately estimate time and costs so that the right decisions can be taken concerning the development of the Web Application in hand.
CyberparaBLAST: the Parallelized BLAST Web Server
Authors: Qi Yutao, Lin Feng
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Retrieving homologous sequences from existingdatabases, for instance, is a fundamental routinefor the bioinformatics research community.Programs of the NCBI BLAST family have beenwidely used for retrieving homologous sequencesfrom existing databases. This article brieflyintroduces and evaluates a parallelized version ofthe BLAST algorithm using Message PassingInterface (MPI) on a multi-node compute cluster,paraBLAST and its web server, CyberparaBLAST.The CyberparaBLAST web server can be accessedthrough web browsers on intranet web servers.CyberparaBLAST enables the researchers ofinstitutes to query sequence databases in the realtime when needed. Parallelized computing togetherwith cyber access make the bioinformatics researchmore efficient with the aid of CyberparaBLAST.
A software agent framework for the support of software project management
Authors: Rita Nienaber, Elsabe Cloete
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

Numerous software development projects do not live up to expectations or sadly fail. This can be seen in the fact that software projects often do not comply with the traditional standard measurements of success, namely time, cost and specifications. Traditionally, individual software projects were executed at a single location. However, due to globalisation and advances in computing technologies, this has changed, and software projects are developed and deployed in distributed and collaborative environments. This means that traditional project management methods cannot and do not address the added complexities found in a distributed environment, such as efficient task scheduling, tracking and monitoring, as well as effective sharing of information and knowledge among project contributors. High levels of collaboration, task interdependence and distribution have become essential across time, space and technology. In this paper the utilisation of stationary and mobile software agents is investigated as a potential tool to improve software project management processes. We also propose and discuss a software agent framework to support distributed software project management. Although still in its initial phases, this research shows promise of significant results in enabling software developers to meet market expectations, and produce projects timeously, within budget and to users' satisfaction.
Error Estimates for Low-Order Isoparametric Quadrilateral Finite Elements for Plates
Authors: Ricardo G. Durán, Erwin Hernández, Luis Hervella-Nieto, Elsa Liberman, Rodolfo Rodríguez
Venue: SIAM Journal on Numerical Analysis (2003)

This paper deals with the numerical approximation of the bending of a plate modeled by Reissner--Mindlin equations. It is well known that, in order to avoid locking, some kind of reduced integration or mixed interpolation has to be used when solving these equations by finite element methods. In particular, one of the most widely used procedures is based on the family of elements called MITC (mixed interpolation of tensorial components). We consider two lowest-order methods of this family on quadrilateral meshes.Under mild assumptions we obtain optimal H1 and L2 error estimates for both methods. These estimates are valid with constants independent of the plate thickness. We also obtain error estimates for the approximation of the plate vibration problem. Finally, we report some numerical experiments showing the very good behavior of the methods, even in some cases not covered by our theory.
Business-structured client/server: an architecture for distributed applications
Authors: Dominic R. Cols
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

The drive towards 'downsizing' from centralized, mainframe systems to distributed systems is based on the expectation of lower costs and greater flexibility from using cheaper MIPS and workstations. The result, however, is a much more complex network of distributed systems, running with a variety of operating systems, database managers, transaction processors, and applications.The author will show that, by using current application design techniques, the cost of deploying and maintaining applications will be higher than ever before and will more than consume whatever benefits may be realized. Application time-to-market, consistency, and flexibility will not improve. A company's Information Systems (I/S) will still be the crucial gating factor in a company's ability to remain competitive.The author will show a specific client/server structuring of the applications (not just the computing infrastructure) that can be the key factor in keeping down the cost of developing distributed applications. This structuring will follow both business process structuring at the highest level and distributed system structuring at the lowest level.
Data-driven validation, completion and construction of event relationship networks
Authors: Chang-Shing Perng, David Thoenen, Genady Grabarnik, Sheng Ma, Joseph Hellerstein
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Event management is a focal point in building and maintaining high quality information infrastructures. We have witnessed the shift of the paradigm of event management in practice from root cause analysis (RCA) to action-oriented analysis (AOA). IBM has developed a pioneer event management methodology (EMD) based on the AOA paradigm and applied it to more than two hundred production sites with success. Foreseeably, more and more event management professionals will apply AOA in different incarnations in building proactive management facilities. By that, building correct and effective Event Relationship Networks (ERNs) becomes the dominating activity in AOA service design process. Currently, the quality of ERNs and the cost of building them largely depend on the knowledge of domain experts. We believe that we can utilize historical event logs in shortening the ERNs design process and perfecting the quality of ERNs. In this paper, we describe in detail how to apply this data-driven approach in ERN validation, completion and construction.
Mathematical Modeling of Traffic Flows
Authors: V. I. Shvetsov
Venue: Automation and Remote Control (2003)

Main methods and concepts of mathematical modeling of traffic flows were reviewed. Two important lines of research&mdash;modeling of loading of urban transportation network and modeling of traffic flow dynamics&mdash;were discussed. For modeling of loading, consideration was given to the models for calculation of correspondences and distribution of flows over the network including different variants of equilibrium distribution and the optimal strategy algorithm. The main classes of dynamic models&mdash;macroscopic (hydrodynamic), kinetic, and microscopic&mdash;were examined as well.
A pre-processing algorithm for solving constraint satisfaction optimisation problems
Authors: Louise Leenen, Lucas Venter, Katarina Britz
Venue: Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology (2003)

A constraint satisfaction problem (CSP) involves finding values, selected from a finite domain, for all variables such that all constraints on the variables are satisfied. A constraint satisfaction optimisation problem (CSOP) is a CSP that has some objective function defined in terms of some or all of the variables. We present an algorithm where we employ local consistency techniques in a pre-processing phase, in order to decrease the domain sizes of the variables. This results in a simplified CSOP to be solved by an existing algorithm.Partial constraint satisfaction involves finding values for all variables such that a maximal subset of the constraints is satisfied. We expand our pre-processing algorithm to the partial CSOP case.
Proceedings of the twelfth international conference on Information and knowledge management
Venue: Conference on Information and Knowledge Management (2003)

Welcome to the Twelfth ACM International Conference on Information and Knowledge Management (CIKM 2003)! The Organizing Committee, as well as the sponsors of CIKM 2003, join me in the desire that this conference will be the opportunity for you to learn, to grow, to share knowledge and skills about information and knowledge management.In twelve years, the world of information and knowledge management has changed greatly. However, the need for information scientists and technologists and practitioners to meet face-to-face and exchange ideas, as well as to welcome new members into our scientific community, is still here. To the extent that we are successful in these goals, CIKM 2003 will have served its purpose.
Monotone iterative methods for the adaptive finite element solution of semiconductor equations
Authors: R.-C. Chen, Jinn-Liang Liu
Venue: Journal of Computational and Applied Mathematics (2003)

Picard, Gauss-Seidel, and Jacobi monotone iterative methods are presented and analyzed for the adaptive finite element solution of semiconductor equations in terms of the Slotboom variables. The adaptive meshes are generated by the 1-irregular mesh refinement scheme. Based on these unstructured meshes and a corresponding modification of the Scharfetter-Gummel discretization scheme, it is shown that the resulting finite element stiffness matrix is an M-matrix which together with the Shockley-Read-Hall model for the generation-recombination rate leads to an existence-uniqueness-comparison theorem with simple upper and lower solutions as initial iterates. Numerical results of simulations on a MOSFET device model are given to illustrate the accuracy and efficiency of the adaptive and monotone properties of the present methods.
Mining complex clinical data for patient safety research: a framework for event discovery
Authors: George Hripcsak, Suzanne Bakken, Peter D. Stetson, Vimla L. Patel
Venue: Journal of Biomedical Informatics (2003)

Successfully addressing patient safety requires detecting medical events effectively. Given the volume of patients seen at medical centers, detecting events automatically from data that are already available electronically would greatly facilitate patient safety work. We have created a framework for electronic detection. Key steps include: selecting target events, assessing what information is available electronically, transforming raw data such as narrative notes into a coded format, querying the transformed data, verifying the accuracy of event detection, characterizing the events using systems and cognitive approaches, and using what is learned to improve detection.
Modeling and comparing change using spatiotemporal helixes
Authors: Anthony Stefanidis, Kristin Eickhorst, Peggy Agouris, Panos Partsinevelos
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

Spatiotemporal helixes are a novel way to model spatiotemporal change. They represent both the movement of an object, as it is expressed by the trajectory of its center, and the changes of its outline. Accordingly they are highly suitable to communicate the evolution of phenomena as they are captured e.g. in sequences of imagery. In this paper we present the spatiotemporal helix model and introduce spatiotemporal similarity metrics for the comparison of helixes. These metrics allow us to compare the behavior of different objects over time, and express the degree of their similarity. To demonstrate the application of our models and metrics we present experimental results.
CAS: a centre for applied research and development
Authors: J. Slonim, P. Larson, D. Sabbah, M. Bauer, E. Buss
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

The Centre for Advanced Studies is a newly formed applied research centre within the IBM Canada Limited Laboratory. Its primary aim is to facilitate the transfer of research ideas into the various product groups of the Laboratory. This paper provides some background to the formation of the Centre, some of the challenges deemed important in defining the role of the Centre, identifies a number of principles that are used to guide its formation and current operation, and reports on how it has fared to date. A brief comparison with the previous research framework within the Laboratory is also given. The paper concludes with a discussion of some of the weaknesses noted to date and directions for improving the Centre in the future.
On characterizations of the basic feasible functionals, Part I
Authors: Robert J. Irwin, James S. Royer, Bruce M. Kapron
Venue: Journal of Functional Programming (2001)

We introduce a typed programming formalism, type-2 inflationary tiered loop programs or ITLP2, that characterizes the type-2 basic feasible functionals. ITLP2 is based on Bellantoni and Cook's (1992) and Leivant's (1995) type-theoretic characterization of polynomial-time, and turns out to be closely related to Kapron and Cook's (1991; 1996) machine-based characterization of the type-2 basic feasible functionals.
Recent talks at Stanford University on AIM
Authors: Ben Kuipers
Venue: ACM SIGBIO Newsletter (1984)

By analyzing a verbatim protocol of an expert's explanation we can derive constraints on the conceptual framework used by human experts for causal reasoning in medicine. We use these constraints, along with textbook descriptions of physiological mechanisms and the computational requirements of successful performance, to propose a model of qualitative causal reasoning. One important design decision in the model is the selection of the "envisionment" version of causal reasoning rather than a version based on "causal links." The envisionment process performs a qualitative simulation, starting with a description of the structure of a mechanism and predicting its behavior. The qualitative causal reasoning algorithm is a step toward second-generation medical diagnosis programs that understand how the mechanisms of the body work. The protocol analysis method is a knowledge acquisition technique for determining the conceptual framework of new types of knowledge in an expert system, prior to acquiring large amounts of domain-specific knowledge. The qualitative causal reasoning algorithm has been implemented and tested on medical and non-medical examples. It will be the core of RENAL, a new expert system for diagnosis in nephrology, that we are now developing.
The atoms, molecules and fibers of organizations
Authors: Jan L. G. Dietz
Venue: Data Knowledge Engineering (2003)

The increasing demands concerning the modifiability and connectivity of business processes cannot be met adequately anymore by relying on best practices only. There is an urgent need for a reference conceptual framework for studying, modeling, analyzing and designing business processes. The Language-Action Perspective (LAP), in particular Habermas' theory of Communicative Action offers a sound and rigid foundation for such a framework. In this paper, the DEMO (Demo Engineering Methodology for Organizations)-framework is presented. It builds on the LAP-based theoretical foundation of the DEMO methodology. Several other LAP-based frameworks have been proposed in the past years. They are evaluated in a comparative review with the DEMO-framework. Several shortcomings of these frameworks are revealed and discussed. The practical applicability of the DEMO-framework is demonstrated using a small example.
Improving memory hierarchy performance using data reorganization
Authors: Viktor K. Prasanna
Venue:  (2002)

In state-of-the-art computing platforms with deep memory hierarchies, mismatch between data layout and data access pattern during a computation causes expensive memory access costs, thereby degrading the overall performance. To improve the memory hierarchy performance, we propose data reorganization as an approach, where data layout is reorganized to match the data access pattern. Our approach reduces the number of cache misses in uni-processor platforms and the number of remote memory accesses in multi-processor platforms. This dissertation discusses three main contributions in using data reorganization. The data reorganization in multi-processor platforms is called data redistribution. However, the redistribution itself requires interprocessor communications. To minimize the overhead of data redistribution, we propose an efficient array redistribution algorithm between processor sets. The proposed algorithm minimizes the number of communication steps, eliminates node contention, and fully utilizes the network bandwidth in each communication step; thereby reducing the data transfer time. Furthermore, the time to compute the schedule and the index set is minimized. Therefore, our algorithm is suitable for runtime data redistribution. For dense matrix applications, block data layout (BDL) has been proposed in conjunction with tiling. It is called static data reorganization in this dissertation, since the data layout is reorganized before the computation begins and then is fixed during the computation. For generic matrix access patterns, we derive an asymptotic lower bound on the number of Translation Look-aside Buffer (TLB) misses for any data layout and show that BDL achieves this bound. We also show that BDL improves TLB misses by a factor of O(B) when compared with conventional data layouts for the tiled matrix multiplication, where B is the block size of BDL. Using our TLB and cache performance analysis, we also discuss the impact of block size on the memory hierarchy performance. As the computation proceeds, the data access stride changes. This change results in poor cache performance, if the data layout is fixed during the computation. To improve cache performance, the data layout is dynamically reorganized between computation stages. This is called dynamic data layout (DDL) approach. Using DDL approach, we develop optimized packages for Fast Fourier Transform (FFT) and Walsh-Hadamard Transform (WHT). Simulation and experiment results show that our FFT and WHT packages achieve performance improvement over other FFT and WHT packages.