waashk/acm huggingface dataset:
bugid (abstract only): a soybean insect pest identifier  bugid is a production system for identifying insect pests. it is written in ops5, an expert system language. the features that have been implemented in the system include the ability to start at any level of analysis, show the insects that are possible or not possible at any level of analysis, and to trace to the beginning of analysis from any stage, and to display results. the system is designed to handle erroneous inputs also. the system can guide the user at any stage, suggest remedial measures for various insects, and give explanation of how it arrived at its conclusions and suggestions. bugid is intended to be a component in a larger expert system for insect pest management for which a prototype is being developed at lsu.  krishna m. uppuluri walter g. rudd
taxonomic ambiguities in category variations needed to support machine conceptualization  this is a theoretical expositional exploration into the underlying needs of concept formation. the main purpose is to identify and discuss the differing forms of categorization in the context of possible machine learning and representation of those concepts. conceptualization is the process of developing the abstractions that are needed to support reasoning. the formation of the machine equivalent of human concepts is critical to the development of a general, machine based reasoning capacity. an aid in understanding conceptual categorization is prototype theory. it helps to identify the building block tools that are used to construct categories and taxonomies. when developing taxonomic structures, framing conflicts can occur in terms of how things should be clustered together, what should be the relative hierarchal levels, and what should be subordinate to what.  l j mazlack
reactive search, a history-sensitive heuristic for max-sat  the reactive search (rs) method proposes the integration of a simple history- sensitive (machine learning) scheme into local search for the on-line determination of free parameters. in this paper a new rs algorithm is proposed for the approximated solution of the maximum satisfiability problem: a component based on local search with temporary prohibitions (tabu search) is complemented with a reactive scheme that determines the appropriate value of the prohibition parameter by monitoring the hamming distance along the search trajectory. the proposed algorithm (h-rts) can therefore be characterized as a dynamic version of tabu search.  in addition, the non- oblivious functions recently introduced in the framework of approximation algorithms are used to discover a better local optimum in the initial part of the search  the algorithm is developed in two phases. first the bias-diversification properties of individual candidate components are analyzed by extensive empirical evaluation, then a reactive scheme is added to the winning component, based on tabu search.  the final tests on a benchmark of random max-3-sat and max-4-sat problems demonstrate the superiority of h-rts with respect to alternative heuristics.  roberto battiti marco protasi
exploring geo-scientific data in virtual environments  this paper describes tools and techniques for the exploration of geo- scientific data from the oil and gas domain in stereoscopic virtual environments. the two main sources of data in the exploration task are seismic volumes and multivariate well logs of physical properties down a bore hole. we have developed a props- based interaction device called the cubic mouse to allow more direct and intuitive interaction with a cubic seismic volume. this device effectively places the seismic cube in the user's hand. geologists who have tried this device have been enthusiastic about the case of use, and were adept only a few moments after picking it up.  we have also developed a multi- modal visualisation and sonification technique for the dense, multivariate well log data. the visualisation can show two well log variables mapped along the well geometry in a bivariate colour scheme, and another variable on a sliding lens. a sonification probe is attached to the lens so that other variables can be heard. the sonification is based on a geigercounter metaphor that is widely understood and which makes it easy to explain. the data is sonified at higher or lower resolutions depending on the speed of the lens. sweeps can be made at slower rates and over smaller intervals to home in on peaks, boundaries or other features in the full resolution data set.  bernd fröhlich stephen barrass björn zehner john plate martin göbel
the displacement method for implicit blending surfaces in solid models  to date, methods that blend solids, that is, b-rep or csg models, with implicit functions require successive composition of the blending functions to handle an arbitrary solid model. the shape of the resulting surfaces depends upon the algebraic distances defined by these functions. to achieve meaningful shapes, previous methods have relied on blending functions that have a pseudo- euclidean distance measure. these methods are abstracted, resulting in some general observations. unfortunately, the functions used can exhibit unwanted discontinuities. a new method, the displacement form of blending, embeds the zero surface of the blending functions in a form for which algebraic distance is c1 continuous in the entire domain of definition.  characteristics of the displacement form are demonstrated using the superelliptic blending functions. intuitive and mathematical underpinnings are provided.  a. p. rockwood
a belief management architecture for diagnostic problem solving  an architecture for diagnosis that uses qualitative endorsements as its principal method of uncertainty abstraction and propagation is presented. the framework performs local belief computations in a hierarchical hypothesis space, in contrast with methods that propagate evidence throughout the whole frame of discernment. in this system, global control of the decision making process is maintained by local evaluations of belief status. these local evaluations determine an active focus in which refinement of belief status is undertaken by gathering additional information. the main goal of the research project is the development of a framework for reasoning with endorsements, and the diagnostic application explicated in the paper is built as a proof-of- principle.  serdar uckun benoit m. dawant gautam biswas kazuhiko kawamura
a computer simulation of the effects of variations in constitutive rules and individual goals on interpersonal communications  this paper is an extension of earlier work concerning the coordinated management of meaning theory of interpersonal communication. prior research has taken several paths. among them have been laboratory experiments utilizing games to simulate conversations, computer simulations, and case studies of actual conversations. the research reported in this paper involves a detailed examination of relatively simple interpersonal communications systems. the results of the simulation will be used to evaluate selected theorems to develop protocols for further laboratory testing and to identify laboratory and field research necessary to develop a more accurate model of conversational behavior.  aaron h. brown charles j. campbell eugene e. kaczka
a framework for knowledge representation and use in pattern analysis  in this paper a prototype expert system oriented to signal and pattern analysis is described together with a general methodology based on a hypothesize-and-test strategy similar to the one used by a human expert. this paper focuses on the knowledge base architecture and on its use. in order to make it capable of dealing with noisy patterns, the knowledge description is based on fuzzy logic and the inference engine is able to reason about the knowledge it uses. the system is being applied to the phonetic analysis of the voice signal in speech recognition, as a case study.  f bergadano a giordana
a method to document data entry forms  all of us receive data entry forms manually and electronically. these forms have to be filled and returned. they vary in size, content and clarity. frequently parts of them are duplicates, but the duplication is concealed by the use of different terminology. the amount of duplicate input will increase sharply in the future, as more and more forms are communicated electronically.  this paper describes a method to document data entry forms. this method converts a paper form to computerized form, divides the form into data elements, identifies synonyms and replaces them with one preferred term, standardizes mathematical relationships, and arrives at a smaller subset of elements for which actual values have to be input. once values are input for this limited subset, the method can compute the values for the other derived elements and produce the final filled-in form. all the data elements in the forms are thus documented precisely.  six different software products have to be developed and linked together to make this method operational. the work on these is also described.  c. s. sankar
the control and transformation metric: toward the measurement of simulation model complexity  current complexity metrics based upon graphical analysis or static program characteristics are not well suited for discrete event simulation model representations, owing to their inherent dynamics. this paper describes a complexity metric suitable for model representations. a study of existing metrics provides a basis for the development of the desired metric, and a set of characteristics for a simulation model complexity metric is defined. a metric is described based on the two types of complexity that are apparent in model representations. experimental data are presented to verify that this metric possesses the desired characteristics. based on evaluation of this data and the desired characteristics, this metric appears to offer an improvement over existing metrics.  jack c. wallace
efficient image-based methods for rendering soft shadows  we present two efficient imaged-based approaches for computation and display of high- quality soft shadows from area light sources. our methods are related to shadow maps and provide the associated benefits. the computation time and memory requirements for adding soft shadows to an image depend on image size and the number of lights, not geometric scene complexity. we also show that because area light sources are localized in space, soft shadow computations are particularly well suited to imaged-based rendering techniques. our first approach---layered attenuation maps\\---achieves interactive rendering rates, but limits sampling flexibility, while our second method---coherence-based raytracing of depth images---is not interactive, but removes the limitations on sampling and yields high quality images at a fraction of the cost of conventional raytracers. combining the two algorithms allows for rapid previewing followed by efficient high-quality rendering.  maneesh agrawala ravi ramamoorthi alan heirich laurent moll
composable controllers for physics-based character animation  an ambitious goal in the area of physics-based computer animation is the creation of virtual actors that autonomously synthesize realistic human motions and possess a broad repertoire of lifelike motor skills. to this end, the control of dynamic, anthropomorphic figures subject to gravity and contact forces remains a difficult open problem. we propose a framework for composing controllers in order to enhance the motor abilities of such figures. a key contribution of our composition framework is an explicit model of the "pre- conditions" under which motor controllers are expected to function properly. we demonstrate controller composition with pre- conditions determined not only manually, but also automatically based on support vector machine (svm) learning theory. we evaluate our composition framework using a family of controllers capable of synthesizing basic actions such as balance, protective stepping when balance is disturbed, protective arm reactions when falling, and multiple ways of standing up after a fall. we furthermore demonstrate these basic controllers working in conjunction with more dynamic motor skills within a prototype virtual stunt-person. our composition framework promises to enable the community of physics-based animation practitioners to easily exchange motor controllers and integrate them into dynamic characters.  petros faloutsos michiel van de panne demetri terzopoulos
creating digital libraries together - collaboration, multimodality, and plurality many have tried to answer the question of what a digital library is and how such libraries should be built. but, in a sense the question of how to construct digital libraries as well defined entities is misguided from the beginning. there are many approaches to building digital libraries [7, 18, 4] and each approach must be understood from within a context. some contexts such as information retrieval and digitizing of existing materials have received much attention [12, 22, 18, 17], while other contexts have been more or less ignored [19]. one such context is that of networking from a higher level of abstraction [8, 11]. since traditional libraries have long since existed in elaborate and large-scale physical networks it is only natural that we should see such structures mirrored in the world of digital abstract networks. the universal simulator [10] application builds on the idea that research in digital libraries need not necessarily focus on micro level infrastructures, but that we may also find interesting possibilities on the macro level of digital library infrastructures. moreover, at such a macro level we may find important new ways of collaborating and building digital libraries in educational settings. anders hedman
v-clip: fast and robust polyhedral collision detection  this article presents the voronoi-clip, or v-clip, collision detection alogrithm for polyhedral objects specified by a boundary representation. v-clip tracks the closest pair of features between convex polyhedra, using an approach reminiscent of the lin-canny closest features algorithm. v-clip is an improvement over the latter in several respects. coding complexity is reduced, and robustness is significantly improved; the implementation has no numerical tolerances and does not exhibit cycling problems. the algorithm also handles penetrating polyhedra, and can therefore be used to detect collisions between nonvconvex polyhedra described as hierarchies of convex pieces. the article presents the theoretical principles of v-clip, and gives a pseudocode description of the algorithm. it also documents various test that compare v-clip, lin-canny, and the enhanced gjk algorithm, a simplex-based algorithm that is widely used for the same application. the results show v-clip to be a strong contender in this field, comparing favorably with the other algorithms in most of the tests, in term of both performance and robustness.  brian mirtich
interfaces for understanding multi-agent behavior  >synchronized punch-card displaysare an interface technique to visualize tens of thousands of variables by encoding their values as color chips in a rectangular array. our technique ties multiple such displays to a timeline of events enabling the punch-card displays to show animations of the behavior of complex systems. punch-card displays not only make it easy to understand the high-level behavior of systems, but also enable users to quickly focus on individual variables and on fine-grained time intervals. this paper describes synchronized punch-card displays and shows how this technique is extremely powerful for understanding the behavior of complex multi-agent systems.  pedro szekely craig milo rogers martin frank
practical animation of liquids  we present a general method for modeling and animating liquids. the system is specifically designed for computer animation and handles viscous liquids as they move in a 3d environment and interact with graphics primitives such as parametric curves and moving polygons. we combine an appropriately modified semi-lagrangian method with a new approach to calculating fluid flow around objects. this allows us to efficiently solve the equations of motion for a liquid while retaining enough detail to obtain realistic looking behavior. the object interaction mechanism is extended to provide control over the liquid s 3d motion. a high quality surface is obtained from the resulting velocity field using a novel adaptive technique for evolving an implicit surface.
refinement: a tool to deal with inconsistencies  in traditional belief revision approaches, new information is accepted unconditionally. in such models the agent either corrrects his knowledge by introducing a new conflicting information or simply rejects it. this paper proposes an alternative way where, in presence of new conflicting data, the agent refines his knowledge by accepting the new conflicting information under certain conditions. such operation, called here refinement, provides an interesting tool to avoid contradictions in normative systems and is a first step towards a rigorous treatment of how courts provide fresh solutions to circumstances which were unpredicted by legal statutes. it is an alternative to defeasible conditionals approaches much in the spirit of alchourron's defense of revision as the proper account of ampliative resoning [1].  the paper introduces a constructive model for refinement based on the power of the agm contruction [3] and inspired by general ideas of selective revision put forward by ferme and hansson [6]. a refinement operator @@@@ is defined and an axiomatic characterization is provided with a representation theorem.  juliano maranhão
an analysis of line numbering strategies in text editors  many techniques are employed in numbering lines for text editing. the simplest approach uses a single integer that changes each time a line is added or deleted (1). basic, in addition to other systems, uses fixed multi-digit numbers bound to each line. this approach has problems: only a fixed number of lines can be inserted between two consecutive lines of text, otherwise the original text must be renumbered. this negates one advantage of line numbers: the ability to compare different versions of the same document.  in order to overcome these disadvantages, two basic schemes have been proposed and implemented. the following grammar defines the two schemes: fractional line numbering (fln) and hierarchical line numbering (hln).  m. l. schneider s. nudelman k. hirsh-pasek
the design of a multi-microprocessor based simulation computer - i  a discrete event simulation computer based on a network of microprocessors is being developed at florida international university. this paper contains a description of the simulation models used thus far in the development process and results obtained from them. a system using a pdp-11 as the principal processor and a motorola m68000 as an event set processor has been implemented. results from the performance of this system are presented, and plans for further development are discussed.  john craig comfort
computer-generated pen-and-ink illustration of trees  we present a method for automatically rendering pen-and-ink illustrations of trees. a given 3-d tree model is illustrated by the tree skeleton and a visual representation of the foliage using abstract drawing primitives. depth discontinuities are used to determine what parts of the primitives are to be drawn; a hybrid pixel-based and analytical algorithm allows us to deal efficiently with the complex geometric data. using the proposed method we are able to generate illustrations with different drawing styles and levels of abstraction. the illustrations generated are spatial coherent, enabling us to create animations of sketched environments. applications of our results are found in architecture, animation and landscaping.  oliver deussen thomas strothotte
two-stage multiple-comparison procedures for steady-state simulations  procedures for multiple comparisons with the best are investigated in the context of steady-state simulation, whereby a number k of different systems (stochastic processes) are compared based upon their (asymptotic) means μi (i = 1,2,…, k). the variances of these (asymptotically stationary) processes are assumed to be unknown and possibly unequal. we consider the problem of constructing simultaneous confidence intervals for  mi-max j imj i=1,2, ,k which is known as multiple comparisons with the best (mcb). our intervals are constrained to contain 0, and so are called constrained mcb intervals. in particular, two- stage procedures for construction of absolute- and relative- width confidence intervals are presented. their validity is addressed by showing that the confidence intervals cover the parameters with probability of at least some user-specified threshold value, as the confidence intervals' width parameter shrinks to 0. the general assumption about the processes is that they satisfy a functional central limit theorem. the simulation output analysis procedures are based on the method of standardized time series (the batch means method is a special case). the techniques developed here extend to other multiple- comparison procedures such as unconstrained mcb, multiple comparisons with a control, and all-pairwise comparisons. although simulation is the context in this paper, the results naturally apply to (asymptotically) stationary time series.  halim damerdji marvin k. nakayama
learning apprentice system for turbine modelling  a learning apprentice system is presented, which learns from examples extracted from user dialogues. the system provides an interface between the user and the turbine modeller. while a dialogue is carried out between the user and the turbine modelling software, the system observes the dialogues and whenever a new example is observed which performs a task completely, the system tries to learn it. the learning methodology used by the system is described and various drawbacks are pointed out. a new learning methodology is proposed which easily overcomes the problems faced by the earlier methodology.  mohammad jamil sawar richard c. thomas
double- and triple-step incremental generation of lines  a method of increasing the efficiency of line drawing algorithms by setting additional pixels during loop iterations is presented in this paper. this method adds no additional costs to the loop. it is applied here to the double- step algorithm presented in [15] and later used in [14], resulting in up to a thirty-three percent reduction in the number of iterations and a sixteen percent increase in speed. in addition, the code complexity and initialization costs of the resulting algorithm remain the same.  phil graham s. sitharama iyengar
scribe: how to use it for document production  scribe is a document production system that makes it easier to produce and maintain large complex technical documentation. although its primary purpose is high-quality text formatting, scribe also performs cross-reference tabulations, indexing, automatic generation of text such as tables of contents, figure integration.  many text formatting programs exist, and many can do some or all of what scribe can do. but scribe has proven through the years to be much easier to learn and use than most other systems, and documents produced in scribe have proven to be much easier to edit and maintain than documents produced other ways.  brian reid