ppxscal/embedding_network huggingface dataset:
A note on an order-level inventory model for a deteriorating item with time-dependent quadratic demand
Authors: S. Khanra, K. S. Chaudhuri
Venue: Computers and Operations Research (2003)

An order-level inventory problem is discussed with the demand rate being represented by a continuous, quadratic function of time. It is assumed that a constant fraction of the on-hand inventory deteriorates per unit of time. The solution of the model is discussed both for infinite and finite time-horizon. A numerical example is taken up to illustrate the solution procedure and sensitivity analysis is also carried out. The rationale for the time-dependent quadratic demand is discussed.
A characterization of span program size and improved lower bounds for monotone span programs
Authors: Anna Gál
Venue: Computational Complexity (2002)

We give a characterization of span program size by a combinatorial-algebraic measure. The measure we consider is a generalization of a measure on covers which has been used to prove lower bounds on formula size and has also been studied with respect to communication complexity.In the monotone case our new methods yield nΩ(log n) lower bounds for the monotone span program complexity of explicit Boolean functions in n variables over arbitrary fields, improving the previous lower bounds on monotone span program size. Our characterization of span program size implies that any matrix with superpolynomial separation between its rank and cover number can be used to obtain superpolynomial lower bounds on monotone span program size. We also identify a property of bipartite graphs that is sufficient for constructing Boolean functions with large monotone span program complexity.
Finding composition trees for multiple-valued functions
Authors: E. V. Dubrova, J. C. Muzio, B. von Stengel
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

The composition tree of a given function, when it exists, provides a representation of the function revealing all possible disjunctive decompositions, thereby suggesting a realization of the function at a minimal cost. Previously and independently, the authors had studied the class of multiple-valued functions that are fully sensitive to their variables. These functions are useful for test generation purposes, and almost all m-valued n-variable functions belong to this class as n increases. All functions in this class have composition trees. This paper presents a recursive algorithm for generating the composition tree for any function in this class. The construction proceeds top-down and makes immediate use of any encountered decomposition, which reduces the (in general exponential) computation time.
User-Centered Web Site Development: A Human-Computer Interaction Approach
Authors: Daniel D. McCracken, Jared M. Spool, Rosalee J. Wolfe
Venue:  (2003)

:Here is a book that presents Web design as an application of key ideas of Human-Computer Interaction (HCI). This text is the only one of its kind that addresses Human-Computer Interaction as it relates to website design. It stresses HCI principles, not just Web implementation techniques. The book provides a working knowledge of Web design, aimed at creating Web pages and sites that are attractive and user-friendly, while allowing students to become familiar with the concepts and terminology of Web design as a basis for further study. Major themes include: Human Computer Interaction: Chapters 1-8 cover the importance of knowing your customer and the significance of visual and content organization of a website, as well as navigation design and the crucial issues of prototyping and user testing. Supporting Disciplines: The impact of color, typography, and multimedia are discussed in terms of website development. Major Web Issues: The significance of accessibility, globalization, and personalization are discussed in the context of a successful website. Rich in pedagogy, the book contains more than 300 review questions, exercises, and projects. A full suite of instructor supplements is also available.
Mean Shift Analysis and Applications
Authors: Dorin Comaniciu, Peter Meer
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

A non-parametric estimator of density gradient, the mean shift, is employed in the joint, spatial-range (value) domain of gray level and color images for discontinuity preserving filtering and image segmentation. Properties of the mean shift are reviewed and its convergence on lattices is proven.The proposed filtering method associates with each pixel in the image the closest local mode in the density distribution of the joint domain. Segmentation into a piecewise constant structure requires only one more step, fusion of the regions associated with nearby modes.The proposed technique has two parameters controlling the resolution in the spatial and range domains. Since convergence is guaranteed, the technique does not require the intervention of the user to stop the filtering at the desired image quality. Several examples, for gray and color images, show the versatility of the method and compare favorably with results described in the literature for the same images.
Performance Analysis for an Important Class of Parallel-Processing Networks
Venue: Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks (1996)

This paper presents performance and feasibility analyses for important mesh-connected architectures that contain sparse broadcast buses. Two basic architectures, that implement bus intersections differently, are given special attention. The first architecture simply allows row/column bus crossovers. The second architecture has separable buses and implements such intersections with switches for further flexibility. Both architectures have lower cost than the mesh with multiple broadcast, which has buses spanning each row and each column, but the former architectures maintain to a high extent the powerful properties of the latter mesh. The architecture with separable buses is shown to often perform better than the higher-cost mesh with multiple broadcast. Architectures with separable buses that employ store-and-forward routing often perform better than architectures with contiguous buses that employ high-cost wormhole routing. All these architectures are evaluated in reference to cost, and efficiency in implementing several important operations and application algorithms. The results prove that these architectures are very promising alternatives to the mesh with multiple broadcast; in addition, their implementationis cost-effective and feasible. * The work presented in this research was supported in part by the National Science Foundation under Grants CCR-9109084, CDA-9121475, and DMI-9500260. Dr. Ziavras is also with the CIS Dept. at NJIT.
Multi-agent coordination: a fuzzy logic based approach
Authors: Gang Chen, Zhonghua Yang, Hao He, Kiah Mok Goh
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In the past decade, the multiagent systems have appeared as a new promising software paradigm. However, its succesful application is subject to the adoption of effective agent coordination techniques. In this paper, we consider a fuzzy logic based approach to agent coordination. Specifically, a bidding based coordination strategy has been proposed to manage the inter-relations among agents. The strategy is developed under the fuzzy logic based task structure model (FSTS) we proposed. Through using the strategy, agents can effectively coordinate their behaviors without consuming so much communication and computation resources.
Scalable Resource Allocation for Multi-Processor QoS Optimization
Authors: Sourav Ghosh, Ragunathan (Raj) Rajkumar, Jeffery Hansen, John Lehoczky
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

We present scalable QoS optimization algorithms for allocating resources to tasks in a multi-processor environment.Given a set of tasks, each of which is capable of running atone of several different QoS levels, the algorithms can select a QoS operating point, the number of replicas for fault-tolerance and the processors on which to run the replicas soas to maximize overall system QoS. The algorithms are extensions of Q-RAM (QoS-based Resource Allocation Model)[5] and fix two deficiencies with the basic algorithm. Thefirst is that the existing algorithm is weak in making resourcetrade-off decisions such as to which processor to map a task.The second was that it was not scalable to very large numbers of resources such as in a large multi-processor system.In this paper we present two new algorithms which significantly enhance the ability of Q-RAM to make resource trade-off decisions. We also introduce a hierarchical decompositionscheme which enables QoS optimization to be performed onproblems with thousands of resources and thousands of tasks.
Aliasing-Free Space and Time Compactions with Limited Overhead
Authors: Jin Ding, David Moloney, Xiaojun Wang
Venue: Proceedings of the 1st International Symposium on Quality of Electronic Design (2000)

Space- and time-oriented compactions are to reduce the output response data width and length of circuits under test for built-in self-test technique. In this paper, the space- and time-oriented compaction techniques are considered together. First, the space-oriented data compaction technique is analyzed. We present a scheme, which can compress the data of k-output circuit into 1-bit signature stream with zero-aliasing and zero-performance-degradation for single stuck-line faults. Based on the investigation of space's odd-sensitized and space's even-sensitized faults of the circuits under test, we discuss the compact methods of space's odd sensitization and space's even sensitization test responses, respectively.The graph coloring is adopted to decrease space compactor overhead. The coloring complexity is greatly decreased owing to only painting the output notes with respect to the space's even-sensitized faults. Next, we take into account of the time-oriented data compaction scheme.We use property that a test vector detects multiple faults in the time's even sensitization response compaction. In the time-oriented compaction approach developed in this paper, a s-bit long data stream can be compressed to an r-bit signature with zero-aliasing, where s >> r. Experimental results are presented to demonstrate the effectiveness of the proposed space- and time-oriented compaction techniques.
The STARLIGHT information visualization system
Authors: J. S. Risch, D. B. Rex, S. T. Dowson, T. B. Walters, R. A. May, B. D. Moon
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

STARLIGHT is an example of a new class of information system expressly designed around visualization-oriented user-interface. Incorporating more traditional information storage and retrieval technologies into its design, the STARLIGHT system also enables the integrated use of multiple, concurrent visualization techniques to support comparison of content and interrelationship information levels of abstraction simultaneously. This powerful new form of information analysis eases cognitive workloads by providing a visual context for the information under study. Originally developed for intelligence analysis applications, the STARLIGHT software is intended to support the rapid, concurrent analysis of complex multimedia information, including structured and unstructured text, geographic information, and digital imagery. The system uses novel 3-D visualization techniques that interactively generate easily understandable representations of explicit and implicit relationships contained in information collections of various types. This paper describes the general theory behind our approach, and the design and features of a Windows NT-based operational system.
Query by Image Similarity Using a Fuzzy Logic Approach
Authors: Anchizes do E. L. GonA alves Filho, Guilherme L. A. Mota, Marley M. B. R. Vellasco, Marco A. C. Pacheco
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

In this paper we propose a new model for query by image similarity.The model utilizes afuzzy logic approach to cluster intrinsic image characteristics, which are extracted fromsubregions of the image.The clustering process provides a set of parameters that are usedto compare a target image with a group of images.As a result, the systems provides theimages in the data set which are similar to the target image.We present as an examplesome queries by similarity on an image database composed of 20 types of animals.Themain objective of this model is to develop an intelligent image query system that can beapplied on the web and image databases.
Performance Measurements of the Multimedia Testbed on Real-Time Mach
Authors: Roger B. Dannenberg, David B. Anderson, Tom Neuendorffer, Dean Rubine
Venue:  (2001)

Keywords: Performance measurements, multimedia, real time, operating systems, interprocess communication 20 pages [FTP: CMU-CS-94-141.ps] Multimedia has generated widespread interest in real-time support within general purpose operating systems. Multimedia also places new demands on operating systems for interprocess communication. The Multimedia Testbed is a set of applications that stress consistent low-latency response and efficient interprocess communication for large blocks of data. The Multimedia Testbed was ported to Real-Time Mach in the hopes of providing predictable low-latency response and, consequently, good synchronization and low jitter as required for multimedia applications. Our work compares the performance of Real-Time Mach with that of Mach 3.0. Although the fixed-priority scheduling of Real-Time Mach is a substantial improvement, user threads are still preempted by device drivers, and the overall real-time performance is not suitable for multimedia applications. We discuss areas where Real-Time Mach needs improvement.
Body of Knowledge -Stakeholder Issues and Intended Usages
Authors: Robert Dupuis, Pierre Bourque
Venue: Proceedings of the 4th IEEE International Symposium and Forum on Software Engineering Standards (1999)

This workshop will: provide an overview of the project and its deliverables; prepare you to be a reviewer of one or more of its deliverables; enable you to provide input to the editorial team to ensure all stakeholder points of view and intended usages have been fully taken into account in the project deliverables and development process. Workshop results will be used to improve the project deliverable, review instructions and will be provided to the Knowledge Area specialists so they can interpret correctly and to the fullest extent possible the various stakeholder viewpoints when handling the review comments.
Discriminating Fault Rate and Persistency to Improve Fault Treatment
Authors: Andrea Bondavalli, Silvano Chiaradonna, Felicita DiGiandomenico, Fabrizio Grandoni
Venue:  (1996)

In this paper the consolidate identification of faults, distinguished as transient or permanent/intermittent, is approached, through the definition of a fault identification mechanism, called a-count. The goal is to allow continued use of parts being hit by transient faults, which may lead to better overall system performance if proper handling is provided. Transient faults discrimination is especially important in all those dependability-qualified applications where replacing and repairing failed components is costly, difficult or impossible at all (as on computer-guided space probes). a-count tries to balance between two conflicting requirements: the first is to keep in the system those components that have experienced just transient faults; the other is to quickly remove those affected by permanent or intermittent faults. The delay in spotting faulty components and the probability of improperly blaming correct ones are evaluated, as a-count''s figures of merit. The approach is compared with some heuristics developed to deal with the same problem. EMAIL:: grandoni@iei.pi.cnr.it
Failure Detectors in Omission Failure Environments
Authors: Danny Dolev, Roy Friedman, Idit Keidar, Dahlia Malkhi
Venue:  (1996)

We study failure detectors in an asynchronous environment that admits message omission failures. In such environments, processes may fail by crashing, but may also {\em disconnect\/} from each other. We adapt Chandra and Toueg''s definitions of failure detection completeness and accuracy to the omissions failure model, and define a weak failure detector ><W(om) that allows any majority of the processes that become connected to reach a Consensus decision, despite any number of transient communication failures in their past. We provide a protocol that solves the Consensus problem in this model whenever a majority of the processes become connected, regardless of past omissions. Moreover, in our protocol it is not necessary to save and repeatedly send all past messages, which makes it more efficient than previous protocols in this model.
On a Framework for Logic Programming With Incomplete Information
Authors: Hiroshi Sakai
Venue:  (1991)

\indent A framework for {\em Logic Programming with Incomplete Information} is proposed. Recently, an important problem in the fields of knowledge bases, logic programming and AI is the problem of how effectively we use information which may have incompleteness, especially disjunctive information. In order to express disjunctive information, we use the predicate symbol $or ^{m}$, where the superscript $m$ implies its arity, and we include any disjunctive information in $or ^m$ as arguments, which we call an {\em or-type atom}. Based on or-type atoms, we define a new language which we call an {\em or-type language} and give an interpretation for the new language. {\em Logic Program with Incomplete Information} (LPII) is defined by a subset of the or-type language. We first show that if interpretations with a restriction are only used to evaluate an {\em LPII}, then our framework is reduced to that of disjunctive logic program, where two important works have been done. The one is near-Horn prolog by Loveland and the other is the study of {\em SLI}-derivation by Minker. We call this evaluation system an {\em external evaluation system} of an {\em LPII.} Then, we consider a general case where every interpretation is used to evaluate an {\em LPII}. We call this evaluation system an {\em internal evaluation system} of an {\em LPII}. In this evaluation system, we show the model intersection property on an {\em LPII,} fixpoint theorem, the soundness and the completeness of a resolution which we call {\em Box}-resolution. The framework for logic programming with incomplete information can also be seen as an extension from a relational database with incomplete information by Lipski to logic programming.
Hidden-Surfaces: Combining BSP Trees with Graph-Based Algorithms
Authors: Timothy Miller
Venue:  (1996)

BSP trees and a priori potential-occlusion-graph-based techniques may be unified to produce a superior algorithm for visible surface determination involving a hybrid data structure in which BSP nodes are used where the simple graph-based algorithm breaks down. In particular, empirical results show around two to three times fewer split polygons for this method, 20--40 space needed, and up to 34 (including significant computation not affected by the algorithm). The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Polynomial-time Algorithm for the Change-Making Problem
Authors: David Pearson
Venue:  (1994)

The change-making problem is the problem of representing a given value with the fewest coins possible from a given set of coin denominations. To solve this problem for arbitrary coin systems is NP-hard [L]. We investigate the problem of determining whether the greedy algorithm always produces the optimal result for a given coin system. Chang and Gill [CG] show that this can be solved in time polynomial in the size of the largest coin and in the number of coins. Kozen and Zaks [KZ] give a more efficient algorithm, and pose as an open problem whether there is an algorithm to solve this problem which is polynomial in the size of the input. In this paper, we will derive such an algorithm. We first obtain a characterization of the smallest coounterexample (if there is one) for which the greedy algorithm is not optimal. We then derive a set of $O(n^2)$ possible values (where $n$ is the number of coins) which must contain the smallest counterexample. Each can be tested with $O(n)$ arithmetic operations, giving us an $O(n^3)$ algorithm.
Equilibria of the Rescorla--Wagner model
Authors: David Danks
Venue: Journal of Mathematical Psychology (2003)

The Rescorla-Wagner model has been a leading theory of animal causal induction for nearly 30 years, and human causal induction for the past 15 years. Recent theories (especially Psychol. Rev. 104 (1997) 367) have provided alternative explanations of how people draw causal conclusions from covariational data. However, theoretical attempts to compare the Rescorla-Wagner model with more recent models have been hampered by the fact that the Rescorla-Wagner model is an algorthimic theory, while the model recent theories are all computational. This paper provides a detailed derivation of the long-run behaviour of the Rescorla-Wagner model under a wide range of parameters and experimental setups, so that the model can be compared with computational theories. It also shows that the model agrees with competing theories on a wider range of cases than had previously been thought. The paper concludes by showing how recently suggested modification of the Rescorla-Wagner model impact the long-run behavior of the model.
Synthesis of Real Time Programs
Authors: Fawzy A Fahmy
Venue:  (1991)

\indent A real time program is defined here to be a program that reads a finite sequence of symbols and performs one computational step after each such symbol. At the end of the sequence, the program outputs a single symbol, yes or no, indicating whether or not the input sequence has been accepted. This thesis is concerned with the problem of automatically constructing real time programs given finite subsets of their behaviors. Such programs are particularly amenable to automatic synthesis because the real time restriction means that their internal structures are mirrored in their behaviors. Synthesis is done by a decomposition of the structures observed in the behaviors into two parts, the control structure, which in most environments is called the program, and the data structure. Several examples of synthesized real time programs are given. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player