ppxscal/embedding_network huggingface dataset:
Vanishing Point Detection without Any A Priori Information
Authors: Andrés Almansa, Agnès Desolneux, Sébastien Vamech
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

Even though vanishing points in digital images result from parallel lines in the 3D scene, most of the proposed detection algorithms are forced to rely heavily either on additional properties (like orthogonality or coplanarity and equal distance) of the underlying 3D lines, or on knowledge of the camera calibration parameters, in order to avoid spurious responses. In this work, we develop a new detection algorithm that relies on the Helmoltz principle recently proposed for computer vision by Desolneux et al.,both at the line detection and line grouping stages. This leads to a vanishing point detector with a low false alarms rate and a high precision level, which does not rely on any a priori information on the image or calibration parameters, and does not require any parameter tuning.
Testing Media Richness Theory in the New Media: the Effects of Cues, Feedback, and Task Equivocality
Authors: Alan R. Dennis, Susan T. Kinney
Venue: Information Systems Research (1998)

Media richness theory argues that performance improves when team members use "richer" media for equivocal tasks. This experiment studied the effects of media richness on decision making in two-person teams using "new media" (i.e., computer-mediated and video communication). Media richness was varied based on multiplicity of cues and immediacy of feedback. Subjects perceived differences in richness due to both cues and feedback, but matching richness to task equivocality did not improve decision quality, decision time, consensus change, or communication satisfaction. Use of media providing fewer cues (i.e., computer mediated communication) led to slower decisions and more so for the less equivocal task. In short, the results found no support for the central proposition of media richness theory; matching media richness to task equivocality did not improve performance.
Webquery: a simple web-enabled system for database management
Authors: Ping Wang, Qingru Zhang
Venue: Journal of Computing Sciences in Colleges (2002)

Many existing tools support developing Web-enabled database interfaces. However, most of these tools are limited in the sense that they only work with a particular database product or Web server. In this paper, we describe WebQuery, a system for defining such interfaces that runs under any popular operating system, works with any Web server that supports CGI scripting and is compatible with many different database systems. The WebQuery system supports defining data (tables), defining queries, executing queries and updating data, all through an intuitive Web interface. Much of the complication and r77edundancy of such work is hidden from both database managers and users.
A theorem on mappings with bounded derivatives with applications to quadrature rules and means
Authors: M. Emin Özdemir
Venue: Applied Mathematics and Computation (2003)

In this paper, we establish a new inequality of Theorem 2 [Appl. Math. Lett. 13 (2000) 19] (Dragomir's integral inequality) for functions whose derivatives are bounded. This has immediate applications in numerical integration where new estimates are obtained for the remainder term of the trapezoid, mid-point. Some natural applications to special means of real numbers are given. For several recent results concerning Dragomir's integral inequality (see [Appl. Math. Lett. 13 (2000) 19] where further references are listed).
Convertibility verification and converter synthesis: two faces of the same coin
Authors: Roberto Passerone, Luca de Alfaro, Thomas A. Henzinger, Alberto L. Sangiovanni-Vincentelli
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

An essential problem in component-based design is how to compose components designed in isolation. Several approaches have been proposed for specifying component interfaces that capture behavioral aspects such as interaction protocols, and for verifying interface compatibility. Likewise, several approaches have been developed for synthesizing converters between incompatible protocols. In this paper, we introduce the notion of adaptability as the property that two interfaces have when they can be made compatible by communicating through a converter that meets specified requirements. We show that verifying adaptability and synthesizing an appropriate converter are two faces of the same coin: adaptability can be formalized and solved using a game-theoretic framework, and then the converter can be synthesized as a strategy that always wins the game. Finally we show that this framework can be related to the rectification problem in trace theory.
Granularity and specificity in fuzzy rule-based systems
Authors: Thomas Sudkamp
Venue: Granular computing: an emerging paradigm (2001)

The structure of fuzzy models produced by a heursitic analysis of the problem domain is compared with that of models algorithmically generated from training data. The trade-offs between granularity, specificity, interpretability, and efficiency are examined for rule-bases produced in each of these manners. An algorithm that combines rule learning with region merging is introduced to incorporate beneficial features of both the heuristic and learning approaches to producing fuzzy models.
A posteriori error estimates for general numerical methods for Hamilton-Jacobi equations: part I: The steady state case
Authors: Samuel Albert, Bernardo Cockburn, Donald A. French, Todd E. Peterson
Venue: Mathematics of Computation (2002)

A new upper bound is provided for the L∞-norm of the difference between the viscosity solution of a model steady state Hamilton-Jacobi equation, u, and any given approximation, v. This upper bound is independent of the method used to compute the approximation v; it depends solely on the values that the residual takes on a subset of the domain which can be easily computed in terms of v. Numerical experiments investigating the sharpness of the a posteriori error estimate are given.
Theorem proving for verification
Authors: John Rushby
Venue: Modeling and verification of parallel processes (2001)

The challenges in using theorem proving for verification of parallel systems are to achieve adequate automation, and to allow human guidance to be expressed in terms of the system under examination rather than the mechanisms of the prover. This paper provides an overview of techniques that address these challenges.
Defect-Based Reliability Analysis for Mission-Critical Software
Authors: Raymond A. Paul, Farokh Bastani, I-Ling Yen, Venkata U. B. Challagulla
Venue: 24th International Computer Software and Applications Conference (2000)

Most software reliability methods have been developed to predict the reliability of a program using only data gathered during the testing and validation of a specific program. Hence, the confidence that can be attained in the reliability estimate is limited since practical resource constraints can result in a statistically small sample set. One exception is the Orthogonal Defect Classification (ODC) method, which uses data gathered from several projects to track the reliability of a new program. Combining ODC with root-cause analysis can be useful in many applications where it is important to know the reliability of a program for a specific type of a fault. By focusing on specific classes of defects, it becomes possible to (a) construct a detailed model of the defect and (b) use data from a large number of programs. In this paper, we develop one such approach and demonstrate its application to modeling Y2K defects.
The impact of spike timing variability on the signal-encoding performance of neural spiking models
Authors: Amit Manwani, Peter N. Steinmetz, Christof Koch
Venue: Neural Computation (2002)

It remains unclear whether the variability of neuronal spike trains in vivo arises due to biological noise sources or represents highly precise encoding of temporally varying synaptic input signals. Determining the variability of spike timing can provide fundamental insights into the nature of strategies used in the brain to represent and transmit information in the form of discrete spike trains. In this study, we employ a signal estimation paradigm to determine how variability in spike timing affects encoding of random time-varying signals. We assess this for two types of spiking models: an integrate-and-fire model with random threshold and a more biophysically realistic stochastic ion channel model. Using the coding fraction and mutual information as information-theoretic measures, we quantify the efficacy of optimal linear decoding of random inputs from the model outputs and study the relationship between efficacy and variability in the output spike train. Our findings suggest that variability does not necessarily hinder signal decoding for the biophysically plausible encoders examined and that the functional role of spiking variability depends intimately on the nature of the encoder and the signal processing task; variability can either enhance or impede decoding performance.
The Mutual Knowledge Problem and Its Consequences for Dispersed Collaboration
Authors: Catherine Durnell Cramton
Venue: Organization Science (2001)

This paper proposes that maintaining "mutual knowledge" is a central problem of geographically dispersed collaboration and traces the consequences of failure to do so. It presents a model of these processes which is grounded in study of thirteen geographically dispersed teams. Five types of problems constituting failures of mutual knowledge are identified: failure to communicate and retain contextual information, unevenly distributed information, difficulty communicating and understanding the salience of information, differences in speed of access to information, and difficulty interpreting the meaning of silence. The frequency of occurrence and severity of each problem in the teams are analyzed. Attribution theory, the concept of cognitive load, and feedback dynamics are harnessed to explain how dispersed partners are likely to interpret failures of mutual knowledge and the consequences of these interpretations for the integrity of the effort. In particular, it is suggested that unrecognized differences in the situations, contexts, and constraints of dispersed collaborators constitute "hidden profiles" that can increase the likelihood of dispositional rather than situational attribution, with consequences for cohesion and learning. Moderators and accelerators of these dynamics are identified, and implications for both dispersed and collocated collaboration are discussed.
How synthetic characters can help decision making
Authors: Giuliano Pistolesi
Venue: Decision making support systems: achievements, trends and challenges for (2002)

Synthetic characters are intelligent agents able to show typical human-like cognitive behavior and an artificially-made perceived personality by means of complex natural language interaction and artificial reasoning and emotional skills. They are mainly spreading on the web as highly interactive digital assistants and tutoring agents on online database systems, e-commerce sites, web-based communities, online psychotherapy, anal in several consulting situations where humans need assistance from intelligent software. Until now, synthetic characters, equipped with data, models, and simulation skills, have never been thought as the building blocks for natural language interaction-based intelligent DMSS. This chapter illustrates the first research and development attempt in this sense by an Open Source project in progress centred on the design of a synthetic character-based DMSS.
Mathematical preparation as a basis for success in CS-II
Authors: Michael V. Stein
Venue: Journal of Computing Sciences in Colleges (2002)

A study was performed to determine the significance of taking math courses such as Discrete Mathematics or Calculus before taking CS-II on the outcomes of students in CS-II for students at the author's institution. At this institution, Discrete Mathematics is a prerequisite for CS-II, but Calculus is not. This study examined the outcomes of 160 students who took CS-II for the first time during a period in which the textbook remained the same, and the syllabus for CS-II remained relatively constant across instructors. The results suggest that students who take Calculus before taking CS-II do at least as well as those who take Discrete Math: the real mathematical "prerequisite" for CS-II is some form of "mathematical maturity".
Inter channel crosstalk in fiber Bragg grating based optical add drop multiplexer
Authors: S. K. Narayankhedkar, R. K. Shevgaonkar
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

In an fiber Bragg grating-based optical add/drop multiplexer the dense wavelength division multiplexed (DWDM) data transmission results in data distortion in the form of inter symbol interference and inter channel crosstalk. This papers presents a study on the crosstalk performance of fiber Bragg gratings (FBG).
Compiler optimization on VLIW instruction scheduling for low power
Authors: Chingren Lee, Jenq Kuen Lee, Tingting Hwang, Shi-Chun Tsai
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2003)

In this article, we investigate compiler transformation techniques regarding the problem of scheduling VLIW instructions aimed at reducing power consumption of VLIW architectures in the instruction bus. The problem can be categorized into two types: horizontal scheduling and vertical scheduling. For the case of horizontal scheduling, we propose a bipartite-matching scheme for instruction scheduling. We prove that our greedy bipartite-matching scheme always gives the optimal switching activities of the instruction bus for given VLIW instruction scheduling policies. For the case of vertical scheduling, we prove that the problem is NP-hard, and we further propose a heuristic algorithm to solve the problem. Our experiment is performed on Alpha-based VLIW architectures and an ATOM simulator, and the compiler incorporated in our proposed schemes is implemented based on SUIF and MachSUIF. Experimental results of horizontal scheduling optimization show an average 13.30&percnt; reduction with four-way issue architecture and an average 20.15&percnt; reduction with eight-way issue architecture for transitional activities of the instruction bus as compared with conventional list scheduling for an extensive set of benchmarks. The additional reduction for transitional activities of the instruction bus from horizontal to vertical scheduling with window size four is around 4.57 to 10.42&percnt;, and the average is 7.66&percnt;. Similarly, the additional reduction with window size eight is from 6.99 to 15.25&percnt;, and the average is 10.55&percnt;.
Distributed rendering of interactive soft shadows
Authors: M. Isard, M. Shand, A. Heirich
Venue: Parallel Computing (2003)

Recently several distributed rendering systems have been developed that exploit a cluster of commodity computers by connecting host graphics cards over a fast network to form a compositing pipeline. This paper introduces an algorithm for one such system to parallelize contributions from arbitrary numbers of OpenGL lights, for example to compute approximate soft shadows by sampling area light sources. The algorithm renders multiple shadow maps across nodes of the cluster by factoring the OpenGL lighting equation into illumination and material properties. Additional parallelism is achieved by utilizing multiple texture units within each graphics card. Illumination by L point sources can be rendered by (L/K) + 1 nodes where K is the number of texture units on each graphics card. For walkthrough applications each node requires a single rendering pass, while for scenes with dynamic lights or geometry K+ 1 passes are needed per node. We present results using fragment shaders on nVidia Ge- Force4 Ti4600 and ATI Radeon 8500 graphics cards, and a cycle-accurate simulation of the compositing operators. These results show interactive frame rates for walkthroughs and dynamic models rendering shadows with 32 light sources on 9 nodes of a Sepia-2a distributed rendering cluster.
The application of an integrated GIS procedure for characterising TSP industrial emissions impact: a test case in Southern Italy
Authors: R. Caggiano, M. D'Emilio, M. Ragosta, M. Macchiato
Venue: Development and application of computer techniques to environmental studies (2002)

In this work we present an application of a monitoring and modelling integrated procedure in a GIS-environment, for describing the impact of TSP and heavy metal industrial emissions in an industrial area of Southern Italy. The monitoring method is based on the measurement of the bioavailable fraction of heavy metals in topsoil; the modelling procedure is based on the application of a simple transport model. Different tools are integrated in a GIS, which gives us the hardware-software environment for comparing databases, model outputs and measurements. The study involves the Melfi industrial area, where, in the last twenty years, many industrialisation processes have been taking place. This area is located in the Vulture basin, a zone characterised by naturalistic and agricultural resources, so it is an optimal site for developing and testing procedures aimed at evaluating the environmental impact of industrial activities.
A Decomposition Approach for a Class of Economic Equilibrium Models
Authors: Frederic H. Murphy, Murthy V. Mudrageda
Venue: Operations Research (1998)

In this paper we present the theoretical foundations for one of the methods used to achieve convergence in the National Energy Modeling System (NEMS). NEMS is a large model with several component models that are built and operated by different branches in the organization and is an example of a system without a hierarchical structure that cannot be solved by traditional equation solving methods. Some of the component models use linear programs to construct supply and demand curves. The discontinuities that result lead to oscillations in the standard relaxation algorithms. We explain where the convergence problems lie and how the convergence theory with step functions links to the convergence theory with continuous functions. To achieve convergence within the entire system, a set of ad hoc techniques were developed to implement a decomposition strategy that allows the individual models to be run separately. We present the theoretical justification for one of them here. The technique presented here has the potential to allow an organization to use operational models for planning without resorting to aggregation. It also facilitates decentralized computing over Internet.
A Weighted Autoregressive Model to Improve Mobile Emissions Estimates for Locations with Spatial Dependence
Authors: Sung-Eun Kim, Debbie Niemeier
Venue: Transportation Science (2001)

For air quality analysis, travel demand model output must be converted to the fine-grained spatial and temporal resolution required by the photochemical models. In particular, network link volume estimates by modeling period (i.e., AM, PM, off-peak) must be converted to hourly profiles. New methods for accomplishing this have not taken spatial autocorrelation into account. This research proposes a weighted autoregressive model for estimating hourly profiles when geographic ordering (i.e., links on a network) is present. An iterative maximum likelihood estimation procedure is developed and used to estimate allocation factors, which disaggregate period-based travel demand model assignments into hourly profiles, for San Diego. Three different forms of the weight matrix, W 1 (binary), W 2 (reciprocal distance), and W 3 (combination of W 1 and W 2), are tested in the analysis. The results indicate that autocorrelation from geographic ordering can be eliminated with the proposed technique.
SystemC Cosimulation and Emulation of Multiprocessor SoC Designs
Authors: Luca Benini, Davide Bertozzi, Davide Bruni, Nicola Drago, Franco Fummi, Massimo Poncino
Venue: Computer (2003)

SystemC is an open source C/C++ simulation environment that provides several class packages for specifying hardware blocks and communication channels. The design environment specifies software algorithmically as a set of functions embedded in abstract modules that communicate with one another and with hardware components via abstract communication channels.The authors describe a simulation environment that targets heterogeneous multiprocessor systems. They are currently working to extend their methodology to more complex on-chip architectures.
Optimal Lot Sizes with Geometric Production Yield and Rigid Demand
Authors: Shoshana Anily, Avraham Beja, Amit Mendel
Venue: Operations Research (2002)

A job shop has to deliver a given number of custom-order items. Production is performed in "lots" that require costly setup, and output quality is stochastic. The size of each lot must be set before output quality is observed. We study production processes whose yield is distributed according to a generalized truncated geometric distribution: Production can randomly go "out of control," in which case all subsequent output of that lot is defective. The "generalization" allows both hazard rates and marginal production costs to vary as production progresses. Our results characterize the optimal lot sizes. In particular, we show that for small demands the optimal lot size equals the outstanding demand, and for larger demands it is less than the outstanding demand, with all lot sizes being uniformly bounded. For sufficiently large demands, we identify conditions under which the optimal lots are precisely those that minimize the ratio of production cost to the expected number of good items. A tighter characterization is given for the standard case, where hazard rates and marginal costs are constant.
Solving Large Nonconvex Water Resources Management Models Using Generalized Benders Decomposition
Authors: Ximing Cai, Daene C. McKinney, Leon S. Lasdon, David W. Watkins,  Jr.
Venue: Operations Research (2001)

Nonconvex nonlinear programming (NLP) problems arise frequently in water resources management, e.g., reservoir operations, groundwater remediation, and integrated water quantity and quality management. Such problems are usually large and sparse. Existing software for global optimization cannot cope with problems of this size, while current local sparse NLP solvers, e.g., MINOS (Murtagh and Saunders 1987), or CONOPT (Drud 1994) cannot guarantee a global solution. In this paper, we apply the Generalized Benders Decomposition (GBD) algorithm to two large nonconvex water resources models involving reservoir operations and water allocation in a river basin, using an approximation to the GBD cuts proposed by Floudas et al. (1989) and Floudas (1995). To ensure feasibility of the GBD subproblem, we relax its constraints by introducing elastic slack variables, penalizing these slacks in the objective function. This approach leads to solutions with excellent objective values in run times much less than the GAMS NLP solvers MINOS5 and CONOPT2, if the complicating variables are carefully selected. Using these solutions as initial points for MINOS5 or CONOPT2 often leads to further improvements.