ppxscal/embedding_network huggingface dataset:
Color constancy and the functional significance of McCollough effects
Authors: T. Vladusich, J. Broerse
Venue: Neural Networks (2002)

A central problem in visual perception concerns how humans perceive stable and uniform object colors despite variable lighting conditions (i.e. color constancy). One solution is to 'discount' variations in lighting across object surfaces by encoding color contrasts, and utilize this information to 'fill in' properties of the entire object surface. Implicit in this solution is the caveat that the color contrasts defining object boundaries must be distinguished from the spurious color fringes that occur naturally along luminance-defined edges in the retinal image (i.e. optical chromatic aberration). In the present paper, we propose that the neural machinery underlying color constancy is complemented by an 'error-correction' procedure which compensates for chromatic aberration, and suggest that error-correction may be linked functionally to the experimentally induced illusory colored aftereffects known as McCollough effects (MEs). To test these proposals, we develop a neural network model which incorporates many of the receptive-field (RF) profiles of neurons in primate color vision. The model is composed of two parallel processing streams which encode complementary sets of stimulus features: one stream encodes color contrasts to facilitate filling-in and color constancy; the other stream selectively encodes (spurious) color fringes at luminance boundaries, and learns to inhibit the filling-in of these colors within the first stream. Computer simulations of the model illustrate how complementary color-spatial interactions between error-correction and filling-in operations (a) facilitate color constancy, (b) reveal functional links between color constancy and the ME, and (c) reconcile previously reported anomalies in the local (edge) and global (spreading) properties of the ME. We discuss the broader implications of these findings by considering the complementary functional roles performed by RFs mediating color-spatial interactions in the primate visual system.
Per-flow QoS support over a stateless differentiated services IP domain
Authors: G. Bianchi, N. Blefari-Melazzi, M. Femminella
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2002)

This paper consists of two parts. In the first part, we propose an admission control paradigm, called Gauge & Gate Reservation with Independent Probing (GRIP), devised to operate over a stateless Differentiated Services IP domain. GRIP admits a new flow upon the successful and timely delivery, through the domain, of probing packets independently generated by the end-points. Failed reception of probing packets is interpreted as congestion in the network. Our solution is fully distributed and scalable, as admission control decisions are taken at the edge nodes, and requires no coordination between routers, which are stateless and remain oblivious to individual flows. An interesting feature of the GRIP operation is its backward compatibility (at the expense of experienced performance) with existing routers. The performance of GRIP is related to the capability of routers to locally take decisions about the degree of congestion, and suitably block probing packets when congestion conditions are detected. In the second part of the paper we describe a specific GRIP implementation, characterized by the capability of providing strict Quality of Service guarantees, thanks to suitable assumptions made on the supported traffic and on the traffic control mechanisms, in a specific domain.
Interactive TV: VoD Meets the Internet
Authors: Simon S. Y. Shim, Yen-Jen Lee
Venue: Computer (2002)

The Internet has brought dramatic changes to individuals and businesses alike. E-mail has become a ubiquitous form of communication, and e-commerce is emerging as a major medium for business transactions. The information from these transactions facilitates the study of focused consumergroups, allowing merchants to target their products to user profiles and behaviors.As broadband enters the home, it will allow television to become an ecommerce medium merging video, voice, and transactional data in television commerce, which combines the interactive power of the Internet with traditional TV programming.
Simultaneous gate sizing and fanout optimization
Authors: Wei Chen, Cheng Ta Hsieh, Massoud Pedram
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

This paper describes an algorithm for simultaneous gate sizing and fanout optimization along the timing-critical paths in a circuit. First, a continuous-variable delay model that captures both sizing and buffering effects is presented. Next, the optimization problem is formulated as a non-convex mathematical program. To manage the problem size, only a small number of critical paths are considered simultaneously. The mathematical program is solved by a non-linear programming package. Finally, a design flow based on iterative selection and optimization of the k most critical paths in the circuit is proposed. Experimental results show that the proposed flow reduces the circuit delay by an average of 9.2% compared to conventional flows that separate gate sizing from fanout optimization.
A radial focus+context visualization for multi-dimensional functions
Authors: Sanjini Jayaraman, Chris North
Venue: Proceedings of the conference on Visualization '02 (2002)

The analysis of multidimensional functions is important in many engineering disciplines, and poses a major problem as the number of dimensions increases. Previous visualization approaches focus on representing three or fewer dimensions at a time. This paper presents a new focus+context visualization that provides an integrated overview of an entire multidimensional function space, with uniform treatment of all dimensions. The overview is displayed with respect to a user-controlled polar focal point in the function's parameter space. Function value patterns are viewed along rays that emanate from the focal point in all directions in the parameter space, and represented radially around the focal point in the visualization. Data near the focal point receives proportionally more screen space than distant data. This approach scales smoothly from two dimensions to 10-20, with a 1000 pixel range on each dimension.
Learning by Discovering Problem Solving Heuristics Through Experience
Authors: W. Wang, J. Chen
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

The authors present a system, called SAFE (strategy acquisition from experience), which incorporates novel methods for discovering domain-dependent problem-solving heuristics. SAFE is implemented as a sorting system whose sorting strategies are represented as production rules. SAFE initially uses the insertion sort strategy to solve problems. After solving each given problem. SAFE learns symbolic rules from the solution path which is obtained by applying the existing heuristic information. By one or several processes of learning. SAFE is able to obtain the heuristics to sort new problems with minimum exchanges of elements. The notion of shortcut, an effective inductive learning bias for reducing the hypothesis space to be searched during learning, is introduced.
Evolutionary Algorithms for Multi-Objective Optimization: Performance Assessments and Comparisons
Authors: K. C. Tan, T. H. Lee, E. F. Khor
Venue: Artificial Intelligence Review (2002)

Evolutionary techniques for multi-objective (MO) optimization are currently gaining significant attention from researchers in various fields due to their effectiveness and robustness in searching for a set of trade-off solutions. Unlike conventional methods that aggregate multiple attributes to form a composite scalar objective function, evolutionary algorithms with modified reproduction schemes for MO optimization are capable of treating each objective component separately and lead the search in discovering the global Pareto-optimal front. The rapid advances of multi-objective evolutionary algorithms, however, poses the difficulty of keeping track of the developments in this field as well as selecting an existing approach that best suits the optimization problem in-hand. This paper thus provides a survey on various evolutionary methods for MO optimization. Many well-known multi-objective evolutionary algorithms have been experimented with and compared extensively on four benchmark problems with different MO optimization difficulties. Besides considering the usual performance measures in MO optimization, e.g., the spread across the Pareto-optimal front and the ability to attain the global trade-offs, the paper also presents a few metrics to examine the strength and weakness of each evolutionary approach both quantitatively and qualitatively. Simulation results for the comparisons are analyzed, summarized and commented.
A cycle lemma for permutation inversions
Authors: S. Brunetti, A. Del Lungo, F. Del Ristoro
Venue: Discrete Mathematics (2002)

In this paper we study some properties of the inversion statistic. Some enumerative results concerning the permutations of the multiset {x1m1, x2m2} with respect to the inversion parameter are established and it is shown that these depend on gcd (m1, m2). Using a "cycle lemma", a combinatorial proof of the results is given. Moreover, some applications to the Gaussian binomial coefficient are illustrated.
The Message Flow Model for Routing in Wormhole-Routed Networks
Authors: Xiaola Lin, Philip K. McKinley, Lionel M. Ni
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

In this paper, we introduce a new approach to deadlock-free routing in wormhole-routed networks called the message flow model. This method may be used to develop deterministic, partially-adaptive, and fully-adaptive routing algorithms for wormhole-routed networks with arbitrary topologies. We first establish the necessary and sufficient condition for deadlock-free routing, based on the analysis of the message flow on each channel. We then use the model to develop new adaptive routing algorithms for 2D meshes.
Developing Software Engineers at the C-130J Software Factory
Authors: Richard Conn
Venue: IEEE Software (2002)

The educational needs of the C-130J Software Factory are as diverse as the roles of the C-130J aircraft itself, covering many software development domains that address corporate, FAA, and national and international military and civilian requirements. This article presents insight into the diverse education and training needs of the software engineers in the C-130J Avionics/Software Integrated Product Team, focusing on the shortfalls of the conventional academic education in computer science and the engineering disciplines that result in a mismatch of expectations between the new hire and his or her company. The author points out the need to prepare students to work on teams, communicate, and understand the importance of a disciplined, measured, and mature engineering process.
Fuzzy Control of HVAC Systems Optimized by Genetic Algorithms
Authors: Rafael Alcalá, Jose M. Benítez, Jorge Casillas, Oscar Cordón, Raúl Pérez
Venue: Applied Intelligence (2003)

This paper presents the use of genetic algorithms to develop smartly tuned fuzzy logic controllers dedicated to the control of heating, ventilating and air conditioning systems concerning energy performance and indoor comfort requirements. This problem has some specific restrictions that make it very particular and complex because of the large time requirements existing due to the need of considering multiple criteria (which enlarges the solution search space) and to the long computation time models require to assess the accuracy of each individual.To solve these restrictions, a genetic tuning strategy considering an efficient multicriteria approach has been proposed. Several fuzzy logic controllers have been produced and tested in laboratory experiments in order to check the adequacy of such control and tuning technique. To do so, accurate models of the controlled buildings (two real test sites) have been provided by experts. Finally, simulations and real experiments were compared determining the effectiveness of the proposed strategy.
Specs: Making Formal Techniques Usable
Authors: Michel Dauphin, Georges Fonade, Rick Reed
Venue: IEEE Software (1993)

Specs, one of the RACE I programming-infrastructure projects, designed to improve software engineering for integrated, broadband communication, is described. Specs is a development methodology that maximizes the automation of telecommunications-software specification, design, implementation, testing, execution, maintenance, and adaptation. To accomplish this, Specs makes formal description techniques like the Specification and Description Language and Lotos usable. The project produced a set of methods, interfaces, functions, and techniques, whose feasibility and efficacy have been demonstrated by a prototype toolset used in a pilot project.
Software Quality: The Elusive Target
Authors: Barbara Kitchenham, Shari Lawrence Pfleeger
Venue: IEEE Software (1996)

If you are a software developer, manager, or maintainer, quality is often on your mind. But what do you really mean by software quality? Is your definition adequate? Is the software you produce better or worse than you would like it to be? In this special issue, we put software quality on trial, examining both the definition and evaluation of our software products and processes.
Blow-up in a reactive-diffusive medium with a moving heat source
Authors: C. M. Kirk, W. E. Olmstead
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

A concentrated source of heat is allowed to move in one-dimension through a reactive-diffusive medium. For rather general motion, it is shown that if the speed remains sufficiently high then a blow-up can be avoided; whereas, if the speed remains sufficiently low then a blowup must eventually occur. Other criteria involving the displacement and velocity of the heat source are found to guarantee a blow-up. Special examples of (i) rapid deceleration from one velocity level to a lower level and (ii) a simple periodic motion are examined.
Exhaustive Test Pattern Generation Using Cyclic Codes
Authors: C. L. Chen
Venue: IEEE Transactions on Computers (1988)

The generation of exhaustive test patterns for VLSI circuits using linear feedback shift registers is described in terms of cyclic codes. Punctured cyclic codes are used to generate exhaustive test patterns of any length. A techniques for the generation of punctured cyclic codes is presented. A technique is also presented to reduce the size of test sets obtained from punctured cyclic codes.
Relative Loss Bounds for Temporal-Difference Learning
Authors: Jürgen Forster, Manfred K. Warmuth
Venue: Machine Learning (2003)

Foster and Vovk proved relative loss bounds for linear regression where the total loss of the on-line algorithm minus the total loss of the best linear predictor (chosen in hindsight) grows logarithmically with the number of trials. We give similar bounds for temporal-difference learning. Learning takes place in a sequence of trials where the learner tries to predict discounted sums of future reinforcement signals. The quality of the predictions is measured with the square loss and we bound the total loss of the on-line algorithm minus the total loss of the best linear predictor for the whole sequence of trials. Again the difference of the losses is logarithmic in the number of trials. The bounds hold for an arbitrary (worst-case) sequence of examples. We also give a bound on the expected difference for the case when the instances are chosen from an unknown distribution. For linear regression a corresponding lower bound shows that this expected bound cannot be improved substantially.
Visual Identification by Signature Tracking
Authors: Mario E. Munich, Pietro Perona
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

We propose a new camera-based biometric: visual signature identification. We discuss the importance of the parameterization of the signatures in order to achieve good classification results, independently of variations in the position of the camera with respect to the writing surface. We show that affine arc-length parameterization performs better than conventional time and Euclidean arc-length ones. We find that the system verification performance is better than 4 percent error on skilled forgeries and 1 percent error on random forgeries, and that its recognition performance is better than 1 percent error rate, comparable to the best camera-based biometrics.
Adaptive Termination of Voting in the Probabilistic Circular Hough Transform
Authors: A. Ylä-Jääski, N. Kiryati
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Reliable detection of objects using the Hough transform is often possible even if just a small random poll of edge points is used for voting. This can lead to significant computational savings. To reduce the risk of errors, it is customary to preset the poll size to a value that is much larger than necessary in average conditions. An adaptive setting of the poll size in the probabilistic Hough transform is suggested. It is experimentally demonstrated that by monitoring changes in the ranks of peaks in the parameter space, sensible decisions on voting termination can be made. Adaptive stopping leads to polls that are on average smaller than the fixed poll that leads to the same error rate. In many applications the number of objects to be detected is unknown. Finding the number of appearances of an object in a noisy image is difficult, especially with partial data. The authors present an adaptive stopping rule that terminates voting as soon as any number of objects seem to be reliably detected, even though the existence of others may not be ruled out yet.
On subgraphs of Cartesian product graphs
Authors: Sandi Klavzar, Alenka Lipovec, Marko Petkovsek
Venue: Discrete Mathematics (2002)

Graphs which can be represented as nontrivial subgraphs of Cartesian product graphs are characterized. As a corollary it is shown that any bipartite, K2,3-free graph of radius 2 has such a representation. An infinite family of graphs which have no such representation and contain no proper representable subgraph is also constructed. Only a finite number of such graphs have been previously known.
The Current Status of Expert System Development and Related Technologies in Japan
Authors: Hiroshi Motoda
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

General trends and statistics obtained from responses to a questionnaire are reviewed, showing that more than 400 expert systems are now under development or in practical use in Japan. Three expert systems selected as representative examples from among planning-and-design-system candidates are described: IBM Japan's Scheplan, Kayaba's OHCS, and Hitachi's automatic pipe-routing system for a power plant. Current Japanese research in related methodologies, including knowledge compilation, knowledge acquisition, generic methods for building expert systems, the automatic generation of task-oriented expert systems, and machine learning, is examined. It is noted that AI is spreading into almost every Japanese industry, and Japanese companies are seeking the most efficient way of introducing AI technologies, particularly expert systems.
Graphs induced by Gray codes
Authors: Elizabeth L. Wilmer, Michael D. Ernst
Venue: Discrete Mathematics (2002)

We disprove a conjecture of Bultena and Ruskey (Electron. J. Combin. 3 (1996) R11), that all trees which are cyclic graphs of cyclic Gray codes have diameter 2 or 4, by producing codes whose cyclic graphs are trees of arbitrarily large diameter. We answer affirmatively two other questions from (Electron. J. Combin. 3 (1996) R11), showing that strongly Pn × Pn-compatible codes exist and that it is possible for a cyclic code to induce a cyclic digraph with no bidirectional edge. A major tool in these proofs is our introduction of supercomposite Gray codes; these generalize the standard reflected Gray code by allowing shifts. We find supercomposite Gray codes which induce large diameter trees, but also show that many trees are not induced by supercomposite Gray codes. We also find the first infinite family of connected graphs known not to be induced by any Gray code--trees of diameter 3 with no vertices of degree 2.
Internet Resource Discovery at the University of Colorado
Authors: Michael F. Schwartz
Venue: Computer (1993)

The author discusses aspects of Internet's resource discovery problem: how users specify searches, the difference between discovering classes of resources and locating appropriate instances, system-management problems that can be cast as global state discovery searches, issues involved with characterizing resources and with the efficient distribution of characterizing information, and social issues, especially privacy. Results of efforts to address these problems as part of the Networked Resource Discovery project at the University of Colorado are presented. These efforts use a variety of experimental approaches, including prototype systems, network measurement studies, and simulation studies.
Demonstration of Automatic Data Partitioning Techniques for Parallelizing Compilers on Multicomputers
Authors: M. Gupta, P. Banerjee
Venue: IEEE Transactions on Parallel and Distributed Systems (1992)

An approach to the problem of automatic data partitioning is introduced. The notion of constraints on data distribution is presented, and it is shown how, based on performance considerations, a compiler identifies constraints to be imposed on the distribution of various data structures. These constraints are then combined by the compiler to obtain a complete and consistent picture of the data distribution scheme, one that offers good performance in terms of the overall execution time. Results of a study performed on Fortran programs taken from the Linpack and Eispack libraries and the Perfect Benchmarks to determine the applicability of the approach to real programs are presented. The results are very encouraging, and demonstrate the feasibility of automatic data partitioning for programs with regular computations that may be statically analyzed, which covers an extremely significant class of scientific application programs.
File Migration and File Replication: A Symbiotic Relationship
Authors: Richard T. Hurley, Soon Aun Yeap
Venue: IEEE Transactions on Parallel and Distributed Systems (1996)

Much of the past research on file migration and file replication has examined these two resource management strategies in isolation or in an environment where they do not work together. We establish through simulation that these two strategies can be utilized simultaneously to potentially provide significant performance benefits over a system without file migration or replication. File replication can be viewed as a natural extension to file migration, and thus, we derive a dynamic file replication policy based on an established file migration heuristic: a file is migrated (or replicated) whenever a reduction in total mean response time of the file requests currently in the affected storage sites can be achieved. Through our performance model, we use simulation to establish the conditions under which our file migration/replication policies are beneficial in a distributed file system.