ppxscal/embedding_network huggingface dataset:
Metadata Integration Framework for Managing Forest Heterogeneous Information Resources
Authors: Thanh Binh Nguyen, Mohamed T. Ibrahim
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Managing a large number of heterogeneous information sources and repositories, including databases, knowledge bases, file systems, digital library is a general problem faced by many organizations today. In this context, forest web data sources provide complex query and analysis capabilities such as sequence similarity search engines that need to be integrated as well as the data. In this paper we introduce a framework to provide abilities for accessing and managing, in a metadata integrated manner, multiple forest information resources. Afterwards, the MIFOR (Metadata Integration for managing Forest Information Resources) prototype is studied and developed as a resource discovery tool to map, convert and harvest metadata from structured and semi-structured sources.
A virtual reality simulator of the ENIAC
Authors: Douglas E. Harms
Venue: ACM SIGCSE Bulletin (2004)

The ENIAC was designed and built at the University of Pennsylvania between 1943 and 1946 and is one of the world's first general-purpose programmable electronic computers. It occupied a 40 x 60 foot room, weighed 30 tons, and was programmed using knobs, switches, and cables. This poster describes the development of a virtual reality simulator of the ENIAC that permits students to program the ENIAC and see it operate.
Efficient simulation of trace samples on parallel machines
Authors: Lieven Eeckhout, Koen De Bosschere
Venue: Parallel Computing (2004)

Architectural simulations of microprocessors are extremely time-consuming nowadays due to the ever increasing complexity of current applications. In order to get realistic workloads for the architectural simulations, benchmarks need to constructed with huge dynamic instruction counts. For example, SPEC released the CPU2000 benchmark suite containing benchmarks that have a dynamic instruction count of several hundreds of billions of instructions. This is beneficial for real hardware evaluation. However, simulating these workloads is impractical if not impossible if we take into account that many simulation runs are needed in order to evaluate a large number of design points. Trace sampling is often proposed as a practical solution for this problem. In trace sampling, several representative samples are chosen from a real program trace. Since the sampled trace is much shorter than the original trace, a significant speedup is obtained. In this paper, we study how parallel processing can speedup the simulation of the sampled traces even further. Therefore, we propose and evaluate two ways of distributing sampled traces over parallel machines while taking into account the additional overhead due to the cold-start problem associated with trace sampling. We conclude that in many (practical) trace sampling scenarios, 'distributing samples' is more efficient than 'distributing traces'. This information will help researchers and computer designers in speeding up their simulation runs.
Four-Wavelength Near-Infrared Imaging of Abdominal Aorta Blood Flow under Surgical Occlusion
Authors: William W. Lau, Homayoun Mozaffari-Naeini, Nitish V. Thakor
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

This paper presents a four-wavelength near-infrared imaging system that can assistsurgeons with intraoperative monitoring and imaging of blood flow of the vessel beingoccluded. The algorithm for this system, based on the Beer-Lambert law, calculates therelative concentrations of deoxyhemoglobin, oxyhemoglobin and water, which are the majorNIR absorbers in tissues. Regional blood volume and oxygen saturation can be determinedfrom these measurements. This proof-of-concept study investigated the utility of the algorithmon detecting rat infrarenal abdominal aortic blood flow subjected to various degrees ofocclusion. The images provided a good visualization of the aorta because of the highconcentration of oxyhemoglobin in the blood stream. The imager was able to detect whenblood flow was completely stopped. Average intensity values of the blood volume imagescorrelated well with the laser Doppler recordings.
JClarens: A Java Based Interactive Physics Analysis Environment for Data Intensive Applications
Authors: Arshad Ali, Ashiq Anjum, Tahir Azim, Michael Thomas, Conrad Steenberg, Harvey Newman, Julian Bunn, Rizwan Haider, Waqas ur Rehman
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

In this paper we describe JClarens; a Java based implementation of the Clarens remote dataserver. JClarens provides web services for an interactive analysis environment to dynamicallyaccess and analyze the tremendous amount of data scattered across various locations.Additionally this research is aimed to develop a service oriented Grid Enabled Portal (GEP) that provides interface and access to several Grid services to give a homogeneous and optimized view of the distributed and heterogeneousenvironment. Other than showing platform independent behavior provided by Java, the useof XML-RPC based Web Services enabled JClarens to be a language neutral server anddemonstrated interoperability with its Python variant. Extreme care has been taken in theusage and manipulation of various Java libraries to cater the needs of high performancecomputing. The overall exercise has yielded in a prototype with strong emphasis on security and virtual organization management (VOM). This shall provide a common platform to supportdevelopment of larger, more flexible framework with future aims to integrate it with a looselycoupled, decentralized, and autonomous framework for Grid enabled AnalysisEnvironment (GAE).
Classifying offensive sites based on image content
Authors: Will Archer Arentz, Bjørn Olstad
Venue: Computer Vision and Image Understanding (2004)

This paper proposes a method for helping to identify adult web sites by using the imagecontent as means of detecting erotic material. The image content is classified by investigating probable skin-regions, and extracting their feature vectors. These feature vectors are based on color-, texture-, contour-, placement-, and relative size-information for a given region. The importance of the different elements in the feature vector is determined by a genetic algorithm. For each picture, the algorithm gives the probability that a certain picture has erotic content. By mapping all the images in a web site, and running the image-based classifier on the whole collection, we were able to set up a histogram of images with regards to the log-likelihood of erotic content for each image. Hence giving a good overview of the web site's content and at the same time leaving room for errors in the image-based classifier.The algorithm proved to be quite successful in our tests where all 20 sites where classified correctly. The image-based classifier is able to properly identify 89% of the evaluation images at an average processing speed of 11 images per second.Although this experiment focused on classifying adult web sites, small alterations to the system can be done, enabling classification of other kinds of images and web sites.
Acute Triangulations of the Regular Icosahedral Surface
Authors: Jin-Ichi Itoh, Tudor Zamfirescu
Venue: Discrete Computational Geometry (2004)

We prove here that the surface of the regular icosahedron can be triangulated with 8 non-obtuse and with 12 acute triangles. We also show these numbers to be smallest possible.
The Dynamic Interaction between External Information and the Internal Model
Authors: Toshio Inui
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

We can manipulate the object in the environment accurately and smoothly. There are two unavoidable difficult issues in order to realize this function; one is illposedness of the vision and motor problem, and the other is delay time which occurs in the signal transmission of the nervous sustem. In this paper, we examined how cognitive and motor functions are realized under forward-inverse transformation and predictive processing theoretically and experimentally.
A semi-discrete scheme for the stochastic nonlinear Schr&#x00f6;dinger equation
Authors: A. De Bouard, A. Debussche
Venue: Numerische Mathematik (2004)

We study the convergence of a semi-discretized version of a numerical scheme for a stochastic nonlinear Schr&#x00f6;dinger equation. The nonlinear term is a power law and the noise is multiplicative with a Stratonovich product. Our scheme is implicit in the deterministic part of the equation as is usual for conservative equations. We also use an implicit discretization of the noise which is better suited to Stratonovich products. We consider a subcritical nonlinearity so that the energy can be used to obtain an a priori estimate. However, in the semi discrete case, no Ito formula is available and we have to use a discrete form of this tool. Also, in the course of the proof we need to introduce a cut-off of the diffusion coefficient, which allows to treat the nonlinearity. Then, we prove convergence by a compactness argument. Due to the presence of noise and to the implicit discretization of the noise, this is rather complicated and technical. We finally obtain convergence of the discrete solutions in various topologies.
Set Systems with few Disjoint Pairs
Authors: B&#x00e9;la Bollob&#x00e1;s, Imre Leader
Venue: Combinatorica (2003)

Let X = {1, . . . , n}, and let $${\user1{A}}$$ be a family of subsets of X. Given the size of $${\user1{A}}$$, at least how many pairs of elements of $${\user1{A}}$$ must be disjoint? In this paper we give a lower bound for the number of disjoint pairs in $${\user1{A}}$$. The bound we obtain is essentially best possible. In particular, we give a new proof of a result of Frankl and of Ahlswede, that if $${\user1{A}}$$ satisfies $${\left| {\user1{A}} \right|} = {\left| {X^{{{\left( { \geqslant r} \right)}}} } \right|}$$ then $${\user1{A}}$$ contains at least as many disjoint pairs as X(&#x2265;r).The situation is rather different if we restrict our attention to $${\user1{A}} \subset X^{{{\left( r \right)}}}$$: then we are asking for the minimum number of edges spanned by a subset of the Kneser graph of given size. We make a conjecture on this lower bound, and disprove a related conjecture of Poljak and Tuza on the largest bipartite subgraph of the Kneser graph.
Eulerian multi-fluid modeling for the numerical simulation of coalescence in polydisperse dense liquid sprays
Authors: Frédérique Laurent, Marc Massot, Philippe Villedieu
Venue: Journal of Computational Physics (2004)

In this paper, we present a new Eulerian multi-fluid modeling for dense sprays of evaporating liquid droplets which is able to describe droplet coalescence and size polydispersion as well as the associated size-conditioned dynamics. It is an uncommon feature of Eulerian spray models which are required in a number of non-stationary simulations because of the optimization capability of a solver coupling a Eulerian description for both phases. The chosen framework is the one of laminar flows or the one of direct numerical simulations since no turbulence models are included in the present study. The model is based on a rigorous derivation from the kinetic level of description (p.d.f. equation) and can be considered as a major extension of the original sectional method introduced by Tambour et al. We obtain a set of conservation equations for each "fluid": a statistical average of all the droplets in given size intervals associated to a discretization of the size phase space. The coalescence phenomenon appears as quadratic source terms, the coefficients of which, the collisional integrals, can be pre-calculated from a given droplet size discretization and do not depend on space nor time. We validate this Eulerian model by performing several comparisons, for both stationary and non-stationary cases, to a classical Lagrangian model which involves a stochastic algorithm in order to treat the coalescence phenomenon. The chosen configuration is a self-similar 2D axisymmetrical decelerating nozzle with evaporating sprays having various size distributions, ranging from smooth ones up to Dirac delta functions through discontinuous ones. We show that the Eulerian model, if the discretization in the size phase space is fine enough (the problem is then 3D unstationary, 2D in space and 1D in size), is able to reproduce very accurately the non-stationary coupling of evaporation, dynamics and coalescence. Moreover, it can still reproduce the global features of the behavior of the spray with a coarse size discretization, which is a nice feature compared to Lagrangian approaches. The computational efficiency of both approaches are then compared and the Eulerian model is provided to be a good candidate for more complex and realistic configurations.
Self-Adaptability and Man-in-the-Loop: A Dilemma in Autonomic Computing Systems
Authors: Mohamed T. Ibrahim, Ric Telford, Petre Dini, Pascal Lorenz, Nino Vidovic, Richard Anthony
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper addresses some controversial issues relating to two main questions. Firstly, we discuss 'man-in-the loop' issues in SAACS. Some people advocate this must always be so that man's decisions t can override autonomic components. In this case, the system has two subsystems - man and machine. Can we, however, have a fully autonomic machine - with no man in sight; even for short periods of time? What kinds of systems require man to always be in the loop? What is the optimum balance in self-to-human control? How to we determine the optimum? How far can we go in describing self-behaviour? How does a SAACS system handle unexpected behaviour? Secondly, what are the challenges/obstacles in testing SAACS in the context of self/human dilemma? Are there any lesson to be learned from other programmes e.g. Star-wars, aviation and space explorations? What role human factors and behavioural models play whilst in interacting with SAACS?
Implementation prototypes in the development of programming language features
Authors: Ray Ford, Chris Marlin
Venue: Proceedings of the workshop on Rapid prototyping (1982)

This paper describes the experiences of the authors in the application of prototyping techniques to the development of programming languages with "advanced" features such as coroutines and abstract data types. The essence of the approach described here is the careful extension of a suitable base language (Pascal was used in all the experiments described here) by one new facility at a time and the production of a prototype implementation of the new language by modifying an existing implementation of the base language. Criteria for choosing a base language, the central role of formal semantic models in the approach and alternative strategies for producing a new prototype implementation from an existing one are all discussed in some detail.
Component Allocation with Multiple Resource Constraints for Large Embedded Real-Time Software Design
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Allocating software components while meeting multipleplatform resource constraints is crucial for model-based designof large embedded real-time software and automaticdesign model transformation. In this paper, we propose anew method for component allocation using an informedbranch-and-bound and forward checking mechanism subjectto a combination of resource constraints. We haveimplemented this method in the Automatic Integration ofReusable Embedded Software (AIRES) toolkit - which hasbeen developed under the DARPA MoBIES Program - andapplied it to an automotive electronic throttle control (ETC)system. Our evaluation based on randomly-generated designmodels has shown that the proposed method scales wellfor large and complex embedded real-time software.
Using MEDLINE as a Knowledge Source for Disambiguating Abbreviations in Full-Text Biomedical Journal Articles
Authors: Hong Yu, Won Kim, Vasileios Hatzivassiloglou, W. John Wilbur
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

Biomedical abbreviations and acronyms are widely used in biomedical literature. Since many abbreviations represent important content in biomedical literature, information retrieval and extraction benefits from identifying the meanings of biomedical abbreviations. Since many abbreviations are ambiguous, it would be important to map abbreviations to their full forms, which ultimately represent the meanings of the abbreviations. In this study, we present a novel unsupervised method that applies MEDLINE records as a knowledge source for disambiguating abbreviations in full-text biomedical journal articles. We first automatically generated from MEDLINE records a knowledge source or dictionary of abbreviation-full pairs. We then trained on MEDLINE records and predicted the full forms of abbreviations in full-text journal articles by applying supervised machine-learning algorithms in an unsupervised fashion. We report up to 92% prediction precision and up to 91% coverage.
The Net Worth of an Object-Oriented Pattern: Practical Implications of Java RMI
Authors: Dan-Adrian German
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Debugging distributed applications in their run-time environmentis notoriously hard and development and testingof application logic must be completed ahead of this step.Using Java RMI allows a developer to separate the twostages (development of the application logic from the deploymentof the application in its distributed run-time environment)but the developer must acknowledge a specificpattern from the outset. We present this pattern below: it allowsfor a stage of fully carried out development of the applicationin an isolated run-time environment (no network)and makes the switch to a true networked run-time environmentcompletely transparent.
Curve and surface interpolation and approximation: knowledge unit and software tool
Authors: John Fisher, John Lowther, Ching-Kuang Shene
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

This paper describes a knowledge unit and the use of a software tool, DesignMentor, for teaching a very challenging topic in computer graphics and visualization, namely: curve and surface interpolation and approximation. Topics include global and local interpolation, global approximation, and curve network interpolation. For the past six years, a junior-level course has successfully used this approach.
Untangling of 2D meshes in ALE simulations
Authors: Pavel Vachal, Rao V. Garimella, Mikhail J. Shashkov
Venue: Journal of Computational Physics (2004)

A procedure is presented to untangle unstructured 2D meshes containing inverted elements by node repositioning. The inverted elements may result from node movement in Arbitrary Lagrangian Eulerian (ALE) simulations of continuum mechanics problems with large shear deformation such as fluid flow and metal forming. Meshes with inverted elements may also be created due to the limitations of mesh generation algorithms particularly for nonsimplicial mesh generation. The untangling procedure uses a combination of direct node placement based on geometric computation of the feasible set, and node repositioning driven by numerical optimization of an objective function that achieves its minimum on a valid mesh. It is shown that a combination of the feasible set, based method and the optimization method achieves the best results in untangling complex 2D meshes. Preliminary results are also presented for untangling of 3D unstructured meshes by the same approach.
Interesting basic problems for CS1
Authors: Judith Gal-Ezer, Dvir Lanzberg, Daphna Shahak
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

In this paper, we recommend using "real world" problems, instead of "toy problems", in CS1 to enhance the students' motivation.
On-Line Analytical Processing on Large Databases Managed by Computational Grids
Authors: Bernhard Fiser, Umut Onan, Ibrahim Elsayed, Peter Brezany, A. Min Tjoa
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Management of large data repositories integrated into the Grid poses new challenges for Grid research. There already exist several successful Data Grid projects addressing processing files storing large volumes of scientific data and projects developing services for accessing remote relational and XML databases. However, so far, no effort was devoted to On-Line Analytical Processing (OLAP), an essential support for modern decision support systems. In this paper, we present our approach to the design and implementation of a Grid-enabled OLAP server, which is one functional building block of the GridMiner system, a novel infrastructure for knowledge discovery in Grid databases. We present the global architecture model of our solution, describe how the OLAP components are integrated into the GridMiner system, and present the software architecture of our first prototype. The OLAP components were implemented in Java on top of the software toolkit Globus 3.
Multiple objective-integrated methodology of global optimum decision-making on mineral resources exploitation
Authors: Wei-Xuan Xu, Yi-Ming Wei
Venue: Computers and Industrial Engineering (2004)

The concept of a complex large system of mineral resource exploitation was advanced from the system theory viewpoint. On the basis of the integrated techniques of qualitative and quantitative analysis, the multiple objective intelligence-integrated methodology for decision-making on mineral resource exploitation was investigated and its integrated model was also formulated. The mineral deposit model, expert system model for mining method selection and the artificial neural network model for prediction economic index, as well as the programming model, acted as the core of this system, while the multiple goal programming model served as the top of the model. An intelligent system to assist the programming of decision-making on mineral resource exploitation for operating mines was developed by means of the systematic combination of optimization technology with an artificial neural network, an expert system, computer-aided design and operations research (OR). The structure of an integrated intelligent system for decision-making on mineral resource exploitation was described. In addition, forecast and simulation, as well as optimization, were integrated. The system's preliminary application was illustrated with an example.