waashk/acm huggingface dataset:
apt - a productivity tool for supporting expert analysis of time series data  computer programs for graphing and analyzing time series data are widely available. for large data analysis applications, however, the analyst may invest a great deal of time navigating an ocean of data in order to find the relevant and interesting pieces. by making this process of discovery easier we can improve the productivity of the analyst. in this paper we describe a data analysis system composed of an eclectic combination of pattern recognition, artificial intelligence, and digital signal processing with the goal of providing some of the right tools. the machine is used to accept abstract descriptions of interesting or anomalous data and then to bring that data quickly into the user interface. the same tools can screen large datasets in the analyst's absence. the human analyst spends less time wading through graphs and numbers and more time answering the question of the day. our goal is to empower the analyst by providing a higher-level language with which to manipulate, visualize, and restructure the semantic concepts of the domain.  jonathan delatizky jeffrey morrill
some characterizations of families of surfaces using functional equations  in this article functional equations are used to characterize some families of surfaces. first, the most general surfaces in implicit form f(x, y, z) = 0, such that any arbitrary intersection with the planes z = z0, y = y0, and x = x0 are linear combinations of sets of functions of the other two variables, are characterized. it is shown that only linear combinations of tensor products of univariate functions are possible for fx, y, z). second, we obtain the most general families of surfaces in explicit form such that their intersections with planes parallel to the planes y = 0 and x = 0 belong to two, not necessarily equal, parametric families of curves. finally, functional equations are used to analyze the uniqueness of representation of gordon-coon surfaces. some practical examples are used to illustrate the theoretical results.  enrique castillo andres iglesias
pest management modeller's workbench (abstract only)  the pest management modelier's workbench is a program developed at l.s.u. as part of an expert system for soybean crop production. the past management program is designed to simulate the growth rates of an insect by each development stage of the insect. the attributes of an insect to mocel are recorded in a data base and maintained through editing features built in the package. the results of a simulation run is a day by day account of the insect's population per stage. another feature of the program is a plot graph of the results, allowing selection and/or grouping of insect stages as desired and the optional inclusion of field data, plotted as points. the pest management modeller's workbench program is designed for ease of use by interacting with the system through the program and supplying the user with "help" during any point of the program. the pest management program is currently running on a vax under unix and is also being adapted to run on the ibm pc system.  brady r. rimes walter g. rudd
an introspective environment for knowledge based simulation  an intelligent system is developed to help the user in building models which can disclose their operation, learn, verify and check their own operations. the knowledge necessary for this is represented using the knowledge representation language srl and this allows the user to enter the necessary information at different levels of abstraction. in addition to automatic verification, some important debugging aids like selective tracing of any collection of model elements under different conditions are also developed.  venkataseshan baskaran y. v. reddy
vite: a visual interface supporting the direct manipulation of structured data using two-way mappings  information processed by computers is frequently stored and organized for the computer's, rather than for the user's, convenience. for example, information stored in a database is normalized and indexed so computers can efficiently access, process, and retrieve it. however, it is not natural for people to manipulate such formal/prescriptive representations. instead, people frequently sort items by rough notions of association or categorization. one natural organizational process has been found to center around manipulations of objects in spatial arrangements. examples of this range from the organization of documents and other items on a regular office desktop to the use of 3″×5″ cards to organize a conference program. using visual cues and spatial proximity, people change the categorizations of and relationships between objects. without the help of indices or perfect memory people can still interpret, locate, and manipulate the information represented by the items and the higher-level visual structures they form. the vite system presented here is an intuitive interface for people to manipulate information in their own way and at their own pace. vite provides for configurable visualizations of structured data sets so users can design their own "perspectives" and a direct manipulation interface allowing editing of and manipulation on the structured data.  hao-wei hsieh frank m. shipman
normal forms in function fields  we consider function fields of functions of one variable augmented by the binary operation of composition of functions. it is shown that the straightforward axiomatization of this concept allows the introduction of a normal form for expressions denoting elements in such fields. while the description of this normal form seems relatively intuitive, it is surprisingly difficult to prove this fact. we present an algorithm for the normalization of expressions, formulated in the symbolic computer algebra language mathematica. this allows us to effectively decide compositional identities in such fields. examples are given.  k. aberer
computational strategies for object recognition  this article reviews the available methods for automated identification of objects in digital images. the techniques are classified into groups according to the nature of the computational strategy used. four classes are proposed: (1) the simplest strategies, which work on data appropriate for feature vector classification, (2) methods that match models to symbolic data structures for situations involving reliable data and complex models, (3) approaches that fit models to the photometry and are appropriate for noisy data and simple models, and (4) combinations of these strategies, which must be adopted in complex situations. representative examples of various methods are summarized, and the classes of strategies with respect to their appropriateness for particular applications.  paul suetens pascal fua andrew j. hanson
reduce package for the indefinite and definite summation this article describes the reduce package zeilberg implemented by gregor st lting and the author which can be obtained from redlib, accessible via anonymous ftp on ftp.zib-berlin.de in the directory pub/redlib/rules.the reduce package zeilberg is a careful implementation of the gosper and zeilberger algorithms for indefinite, and definite summation of hypergeometric terms, respectively. an expression _ak_ is called a _hypergeometric term_ (or _closed form_), if _ak/ak-1_ is a rational function with respect to _k._ typical hypergeometric terms are ratios of products of powers, factorials, function terms, binomial coefficients, and shifted factorials (pochhammer symbols) that are integer- linear in their arguments.the package covers further extensions of both gosper's and zeilberger's algorithm which in particular are valid for ratios of products of powers, factorials, function terms, binomial coefficients, and shifted factorials that are rational-linear in their arguments.a similar maple package is described elsewhere [2]. wolfram koepf
camdroid: a system for implementing intelligent camera control  in this paper, a method of encapsulation camera tasks into well defined units called "camera modules" is described. through this encapsulation, camera modules can be programmed and sequenced, and thus can be used as the underlying framework for controlling the virtual camera in the widely disparate types of graphical environments. two examples of the camera framework are shown: an agent which can film a conversation between two virtual actors and a visual programming language for filming a virtual football game.  steven m. drucker david zeltzer
an enhanced treatment of hidden lines  a new display scheme is presented in which three-dimensional objects are represented with a much higher degree of user control of the line-drawing format than those in conventional schemes. in this scheme, the attribute of a line is determined not at the time of definition but after the viewing transformation has been applied, taking the shielding environment of the line into consideration. the essential difference between our scheme and conventional hidden-line removal/indication lies in the treatment of the shielding environment. in conventional hidden-line removal/indication, only the visible/invisible information is available for the selection of the attribute of a line. in our scheme, the entire set of surfaces that hide a line can be used to determine the attribute of the line. a much higher degree of freedom in generating pictures is achieved owing to the treatment of the shielding environment. we also describe a system called grip, which implements the new scheme.  tomihisa kamada satoru kawai
similarity in harder cases: sentencing for fraud  we focus on one of the central concepts of case-based reasoning: similarity. in the field of sentencing, where the really decided cases are often on the harder side, similarity is multidimensional and depends less on formal rules than on various legitimate principles, objectives and factors which relate to the offender, the victim, the act and its social context. the paper presents our data base of empirically analysed cases of fraud and discusses two of the different phases completed to reduce complexity: (1) a decision topology whose categories emerged from in-depth interviews with judges, crown and defense attorneys and which proved to be statistically significant; (2) experimenting with fxs, a program designed to retrieve similar cases based on their degree of salience. the salience coefficient used is a measure of similarity based on relative high or low frequency of factors in their local context. particularly promising, although not yet formally explained, are fxs' flexible weighting possibilities.  ruth murbach Éva nonn
spaf: sub-texel precision anisotropic filtering  texture mapping is a technique which most effectively improves the realism of computer-generated scenes in 3d graphics. tri-linear filtering of the mip- mapped texture has been popular as a texture filtering method but it blurs images on the surface of objects angled obliquely away from the viewer in a scene. various anisotropic filtering methods like footprint assembly, feline, and fast footprint mip- mapping have been proposed to satisfy the desire for the high quality image [7].  in spite of the increase of the memory bandwidth, the memory bandwidth limit is still the bottleneck of the texture filtering hardware. moreover, it is very important to keep the quality of rendered image good. in this paper, we propose sub-texel precision anisotropic filtering (spaf) which filters texels in a region that covers a quadrilateral footprint with the weights. the weight plays a key role in effective filtering to render the image of high quality with the restricted number of texels loaded from memory for real-time filtering. first, the area coverage based texel filtering scheme is introduced to obtain the footprint's coverage for each texel on the sub-texel precision leading to the small weight table size. second, the gaussian weight is applied to this footprint's coverage for each texel to reduce the artifacts. therefore, the quality of rendered images is superior to other anisotropic filtering methods in the same restricted number of texels. and the size of this weight table is several hundred kbytes which is much smaller than fast footprint mip-mapping. this small rom table size enables the spaf to be implemented at feasible hardware costs.  hyun-chul shin jin-aeon lee lee-sup kim
application of reduce system for analyzing consistency of systems of p.d.e.'s  a consistency analysis of differential equation systems involves a sequence of differential - algebraic operations. at present there are know two methods: the cartan's and the riquier-janet-kuranishi(rjk) method which are equivalent. the implementation of the both of the methods with the purpose of their practical application leads to large symbolic computations which often cannot be performed without a computer. the problem on the consistency investigation of a specific overdetermined system was solved in [1] with the aid of a computer. more recently, a number of computer codes implementing the both of the above methods on a computer have been developed (for example [2]).  in the present paper we propose a realization of the rjk algorithm the reduce system [3]. one of rjk algorithm advantages over cartan's algorithm is that there is no need to go over to exterior differential equation. it is, therefore more economical, particularly in the use of computer memory, which, in the problem at hand, is very important. the proposed version of the computer code enables us to investigate only the systems of quasilinear first - order differential equations. this limitation is not very restrictive, because the non-linearity is taken into account only in the process of the computation of the ranks of matrices. the reduce program was also used by the present authors for the extraction and construction of exact solutions of the equation systems from the continuum mechanics. new results were obtained with the aid of a computer.  v.s. shurygin and n.n. yanenko: on the computer implementation of algebraic- differential algorithms. problemy kibernetik, vyp. 6, 1961.  v.g. ganzha, s.v. meleshko, f.a. murzin, v.p. shapeev, n.n yanenko: realization on computer of an algorithm for studying the consistency of partial differential equations.  dokl. acad. nauk sssr, vol. 261, no 5, 1981. [3]. a.c. hearn: reduce user's manual. 1985.  v. g. ganzha s. v. meleshko v. p. shelest
viewing composition tables as axiomatic systems axiomatic systems and composition tables are often seen asalternative ways of specifying the semantic interrelations ofrelations for qualitative reasoning. axiomatic characterizationsusually specify ontological assumptions concerning the domain ofthe relations and introduce a taxonomic system of relations that,on the one hand, serves to specify the relations and, on the otherhand, supports the communication of the intended meaning.in thisarticle, composition tables are seen as a specific form ofaxiomatic theories that can also be combined with a taxonomicsystem of relations. on this basis, the content of compositiontables can be reformulated in a simplified way. this simplificationsupports the construction of such tables parallel to thedevelopment of the axiomatic specification or on the basis of agiven axiomatic characterization. carola eschenbach
a fast shadow algorithm for area light sources using backprojection  the fast identification of shadow regions due to area light sources is necessary for realistic rendering and for discontinuity meshing for global illumination. a new shadow-determination algorithm is presented that uses a data structure, called a backprojection, to represent the visible portion of a light source from any point in the scene. a complete discontinuity meshing algorithm is described for polyhedral scenes and area light sources, which includes an important class of light/geometry interactions that have not been implemented before. a fast incremental algorithm for computing backprojections is also described. the use of spatial subdivision, and heuristics based on computed statistics of typical scenes, results in efficient mesh and backprojection computation. results of the implementation show that the use of the backprojection and discontinuity meshing permits accelerated high-quality rendering of shadows using both ray- casting and polygon-rendering with interpolants.  george drettakis eugene fiume
a digital video display system implemented on a kim-1 microcomputer  the "microelectronic revolution" and the accompanying decrease in the cost of semiconductor memory has increased the availability of raster-scan graphical displays, yet, as pointed out in a recent survey [bae79], the implementation of graphics software for raster-scan systems has lagged behind that for random-scan ones. the aim of the work described in the present paper has been to apply random-scan techniques to a system employing a relatively inexpensive raster-scan device. the system, incorporating a display-file processor, is implemented on a kim-1 microcomputer. the display device is composed of a micro technology unlimited video board and a standard tv monitor.  n. solntseff m. d. drummond
color gamut mapping and the printing of digital color images  principles and techniques useful for calibrated color reproduction are defined. these results are derived from a project to take digital images designed on a variety of different color monitors and accurately reproduce them in a journal using digital offset printing. most of the images printed were reproduced without access to the image as viewed in its original form; the color specification was derived entirely from calorimetric specification. the techniques described here are not specific to offset printing and can be applied equally well to other digital color devices.  the reproduction system described is calibrated using cie tristimulus values. an image is represented as a set of three-dimensional points, and the color output device as a three-dimensional solid surrounding the set of all reproducible colors for that device, called its gamut. the shapes of the monitor and the printer gamuts are very different, so it is necessary to transform the image points to fit into the destination gamut, a process we call gamut mapping. this paper describes the principles that control gamut mapping. included also are some details on monitor and printer calibration, and a brief description of how digital halftone screens for offset printing are prepared.  maureen c. stone william b. cowan john c. beatty
intelligent simulation environments: identification of the basics  a problem exists in efficiently combining a non-deterministic decision capability with a current discrete event simulation language for use by the simulationist (programmer and in the future the user). this paper explores this problem in the context of the discrete event simulation problem domain implemented in siman. the purpose is (1) to provide an ontological definition of abstract ideas from data to wisdom, (2) identify a taxonomy of simulation and artificial intelligence combination dialects, and (3) establish the need for and then introduce a "decide node" which will assist the simulationist in incorporating a broader spectrum of the ontology more easily than current dialects allow.  jordan snyder gerald t. mackulack
agents teaching agents to share meaning  the promise of intelligent agents acting on behalf of users' personalized knowledge sharing needs may be hampered by the insistence that these agents begin with a predefined, common ontology instead of personalized, diverse ontologies. only until recently have researchers diverged from the last decades common "ontology paradigm" to a paradigm involving agents that can share knowledge using diverse ontologies. this paper describes how we address this agent knowledge sharing problem of how agents deal with diverse ontologies by introducing a methodology and algorithms for multi- agent knowledge sharing and learning. we demonstrate how this approach will enable multi- agent systems to assist groups of people in locating, translating, and sharing knowledge using our distributed ontology gathering group integration environment (doggie) and describe our proof- of- concept experiments. doggie synthesizes agent communication, machine learning, and reasoning for information sharing in the web domain.  andrew b. williams zijian ren
texture synthesis for digital painting  the problem of digital painting is considered from a signal processing viewpoint, and is reconsidered as a problem of directed texture synthesis. it is an important characteristic of natural texture that detail may be evident at many scales, and the detail at each scale may have distinct characteristics. a "sparse convolution" procedure for generating random textures with arbitrary spectral content is described. the capability of specifying the texture spectrum (and thus the amount of detail at each scale) is an improvement over stochastic texture synthesis processes which are scalebound or which have a prescribed 1/f spectrum. this spectral texture synthesis procedure provides the basis for a digital paint system which rivals the textural sophistication of traditional artistic media. applications in terrain synthesis and texturing computer-rendered objects are also shown.  john-peter lewis
identity criteria and sortal concepts in this paper we focus on a specific aspect of the notion of_conceptualisation_, i.e. on the issue of the specification ofa certain kind of concept: _sortal concept_. our startingpoint is the intuitive idea that a sortal concept cannot bespecified in isolation from a general notion of entity. we thinkthat this idea has some bearing on the way in which _identitycriteria_ should be conceived, since they are usually taken as afundamental tool for the specification of a sortal concept. thefirst goal of our paper is to discuss and point out somedifficulties concerning the relation between sortals and identitycriteria. in general, we think that the specification of a sortalpresupposes - in russellian terms - a range of significance onwhich the concept is defined. it follows that the sortal cannot bestated without a specification of its range of significance. thismeans that identity criteria for a sortal _k_ providingconditions of identity only for objects falling under _k_ arenot enough to specify _k_. independently of this point, we arequite skeptical about the possibility of achieving a formalsatisfactory definition of _sortal_. we will try to show thateven guarino and welty's last proposal [4] does not succeed. oursecond goal concerns which concepts are to be taken as sortals. bythinking that identity criteria are necessary and sufficientconditions for identity, guarino and welty cannot accept that, say,_a_ is s1 and _a_ is s2, in thecase that s1 and s2 are associated withincompatible criteria. so they are lead to postulate, for example,that not _a_ but _b_ is s2 and _a_ isconstituted by _b_. we defend the thesis that it is possibleto take some concepts - in our case s2 \\- as endowed onlywith necessary conditions for identity. we will argue for somespecific choices. massimiliano carrara pierdaniele giaretta