ppxscal/embedding_network huggingface dataset:
A Representation of Specular Appearance
Authors: Stephen Lin, Sang W. Lee
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

The appearance of an object can vary considerably with changes in illumination conditions. Methods have been developed to describe these differences for diffuse reflection using the Lambertian model, but little work has been done in characterizing specular appearance.Towards a more comprehensive global reflectance descriptor, this paper focuses on a representation of specular appearance based on an approximate specular reflection model derived from Torrance-Sparrow. We propose that under certain illumination and surface conditions local specular structure can be expressed by the logarithms of three intensity-normalized photometric images. The total number of photometric images needed for representing global specular appearance depends on the object surface roughness, and we suggest an illumination planning method for determining the number of images. Experimental results demonstrate the effectiveness of this logarithmic model as a specular descriptor.
Experimental result analysis for a generative probabilistic image retrieval model
Authors: Thijs Westerveld, Arjen P. de Vries
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

The main conclusion from the metrics-based evaluation of video retrieval systems at TREC's video track is that non-interactive image retrieval from general collections using visual information only is not yet feasible. We show how a detailed analysis of retrieval results -- looking beyond mean average precision (MAP) scores on topical relevance -- gives significant insight in the main problems with the visual part of the retrieval model under study. Such an analytical approach proves an important addition to standard evaluation measures.
A BIST-Based Solution for the Diagnosis of Embedded Memories Adopting Image Processing Techniques
Authors: D. Appello, A. Fudoli, V. Tancorre, F. Corno, M. Rebaudengo, M. Sonza Reorda
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

This paper proposes a new solution for the diagnosis of faults into embedded RAMs, currently under evaluation within STMicroelectronics. The proposed scheme uses dedicated circuitry added to the BIST, selecting the failure data, and the ATE test program to schedule the data extraction flow. Testing is possible through a standard IEEE 1149.1 TAP, and allows the access to multiple cores with a P1500 compliant solution. The approach aims at implementinga low-cost solution to diagnose embedded RAMs with the goal to minimize the ATE costs and the time required to extract the diagnostic information. In our approach, the ATE drives the diagnostic scheme and is dedicated to the classification of faults, only, allowing adoptinglow-cost equipment. The proposed solution allows a scalable extraction of test data, whose amount is proportional to the available testing time. In order to accelerate the fault classification image processing techniques have been applied. The Hough transform has been adopted to analyze the bitmap representing the faulty cells. Preliminary experimental results show the advantages of the proposed approach in terms of time required to completea diagnostic process.
A New Strategic Enterprise Information Model Based on Super Parallel Evolution Computing
Authors: Haruki (Hal) Inoue, Yutaka Funyu, Shiozawa Masami
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

This paper describes the New Strategic Information Model, an information model that can accommodate sudden changes to the external environment of a manufacturing enterprise. The model optimizes the whole enterprise activities from a strategic point of view. The new strategic information model consists of two (sub) models viz. Real-time Oriented Plane Information Model and Higher Dimensional Optimization Model. This paper focuses on the concept forming and features of the model. Application and the results of this model on an oil manufacturing and logistic enterprise are also discussed. In addition, this system won the award of ¿Software Product of the Year '99¿ as the best computer system in Japan.
Active Replication: Towards a Truly SRAM-Based FPGA On-Line Concurrent Testing
Authors: Manuel G. Gericota, Gustavo R. Alves, Miguel L. Silva, José M. Ferreira
Venue: Proceedings of the Proceedings of The Eighth IEEE International On-Line Testing Workshop (IOLTW'02) (2002)

The reusing of the same hardware resources to implement speed-critical algorithms, without interrupting system operation, is one of the main reasons for the increasing use of reconfigurable computing platforms, employing complex SRAM-based FPGAs. However, newsemiconductor manufacturing technologies increase the probability of lifetime operation failures, requiring new on-line testing/fault-tolerance methods able to improve the dependability of the systems where they are included.The Active Replication technique presented in this paper consists of a set of procedures that enables the implementation of a truly non-intrusive structural on-line concurrent testing approach, detecting and avoiding permanent faults and correcting errors due to transient faults.In relation to a previous technique proposed by the authors as part of the DRAFT FPGA concurrent test methodology, the Active Replication technique extends the range of circuits that can be replicated, by introducing a novel method with very low silicon overhead.
Comparing Arguments Using Preference Orderings for Argument-Based Reasoning
Authors: Leila Amgoud, Claudette Cayrol, Daniel Le Berre, I. R. I. T. UniversitePaul Sabatier
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

Argument-based reasoning is a promising approach to handle inconsistent belief bases. The basic idea is to justify each plausible conclusion by acceptable arguments. The purpose of this paper is to enforce the concept of acceptability by the integration of preference orderings. Pursuing previous work on preference-based argumentation, we focus here on the definition of preference relations for comparing conflicting arguments. We present a comparative study of several proposals. Then, we propose techniques for computing and comparing arguments, taking advantage of an Assumption-Based Truth Maintenance System.
The Weakening of Taxonomic Inferences by Homological Errors
Authors: D. M. Jackson, L. J. White
Venue:  (1970)

In the past decade there has been a growing concern in devising classification algorithms which are applicable to large bodies of data. Such algorithms are characterized necessarily by a sacrifice of statistical sophistication for a gain in computational simplicity. Accordingly, inferences drawn from taxonomic studies in which these algorithms have been employed may be affected by accidental and poorly understood features of such algorithms. An error analytic technique is presented which reduces this possibility. It is applicable to many of the classification algorithms currently in use. The combinatorial problems encountered in the error analysis are discussed and a computationally viable method for their solution is formulated. The technique is illustrated by an experiment with a small set of data.
Caching Neighborhood Protocol: a Foundation for Building Dynamic Web Caching Hierarchies with Proxy Servers
Authors: Cho-Yu Chiang, Ming T. Liu, Mervin E. Muller
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

In this paper, we propose a Caching Neighborhood Protocol (CNP) that describes an infrastructure upon which proxy servers can build dynamic Web caching hierarchies. Such a scheme decreases the response times for the requests by increasing the availability of documents without compromising the currency of the rendered documents. Some qualitative reasoning and studies on the request accessing traces collected by a proxy server at NLANR [16] are presented to justify CNP. A five-day trace analysis shows that the top 20% Web sites (in terms of frequency of accesses) provide 93% of the most frequently accessed top 20% documents and such top 20% documents account for 94% of the documents that have been accessed more than once. Hence, an important observation is that caching the most popular documents provided by the most popular Web sites would be a very effective approach for Web caching.
Complexity of the "basic unit" of language: some parallels in physics and biology
Authors: Evelyne Andreewsky
Venue: Quantum mechanics, mathematics, cognition and action: proposals for a formalized epistemology (2002)

It is first brought into evidence that such fundamentally different domains of research as physics, biology, and language sciences, present--with remarkable unity--the same tendency to base their theoretical constructs upon "bricks," from where "information" is carried upwards by a one-way flow of causal determinations. It is then shown that in all these three domains, such theoretical constructs are far to be supported by the present data and conceptions. This brings into evidence the interest of a formalized epistemology, enabling the general mould in which are cast our representations of "reality" to be explicitly reconsidered in keeping with these data and conceptions.
Mathematical Models of Interactive Computing
Authors: Peter Wegner, Dina Goldin
Venue:  (1999)

D. Goldin, Univ. of Massachusetts - Boston P. Wegner, Brown University Finite computing agents that interact with an environment are shown to be more expressive than Turing machines according to a notion of expressiveness that measures problem-solving ability and is specified by observation equivalence. Sequential interactive models of objects, agents, and embedded systems are shown to be more expressive than algorithms. Multi-agent (distributed) models of coordination, collaboration, and true concurrency are shown to be more expressive than sequential models. The technology shift from algorithms to interaction is expressed by a mathematical paradigm shift that extends inductive definition and reasoning methods for finite agents to coinductive methods of set theory and algebra. An introduction to models of interactive computing is followed by an account of mathematical models of sequential interaction in terms of coinductive methods of non-well-founded set theory, coalgebras, and bisimulation. Models of distributed information flow and multi-agent interaction are developed, and the Turing test is extended to interactive sequential and distributed models of computation. Specification of interactive systems is defined in terms of observable behavior, Godel incompleteness is shown for interaction machines, and explanatory power of physical theories is shown to correspond to expressiveness for models of computation. Our goal is to provide multiple perspective on interactive modeling from the viewpoint of interaction machines and mathematics, to persuade readers that interaction paradigms can play a significant role in narrowing the gap between theoretical models and software practice.
Time Series Prediction by a Neural Network Model Based on the Bi-Directional Computation Style
Authors: Hiroshi Wakuya, Jacek M. Zurada
Venue: Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2 (2000)

A number of neural network models and training procedures for time series prediction have been proposed in the technical literature. These models typically used unidirectional computation flow or its modifications. In this study, a novel concept of bi-directional computation style is proposed and applied to prediction tasks. Since the coupling effects between the future prediction system and the past prediction system help the proposed model improve its performance, it is found that the prediction score is better than with the traditional uni-directional method. The hi-directional predicting architecture has been found to perform better than the conventional one when tested with standard benchmark sunspot data.
The EuroWordNet Base Concepts and Top Ontology
Authors: Piek Vossen, Laura Bloksma, Horacio Rodriguez, Salvador Climent, Nicoletta Calzolari, Adriana Roventini, Francesca Bertagna, Antonietta Alonge, Wim Peters
Venue:  (1998)

This deliverable describes the EuroWordNet top ontology, the selection of the Base Concepts and the classification of these Base Concepts in terms of the top ontology. TEL:: +39 50 560481
Building the usability professionals certification scheme: where next?
Authors: Nigel Bevan, Jonathan Earthy, Caroline Jarrett
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Discussions have taken place on the development of a certification scheme by an international working group. This session will inform delegates and elicit views.
Firewall Architecture for the Enterprise, 1 edition
Authors: Norbert Pohlmann, Tim Crothers
Venue:  (2002)

:In this comprehensive guidebook, network security gurus Norbert Pohlmann and Tim Crothers deliver all the information you need to build the right firewall solution for your organization-and protect your network from unwanted intruders. Beginning with an incisive overview of TCP/IP vulnerabilities, Internet and intranet security threats, and firewall strategies, they show you step by step how to put together your system, from choosing firewall design scenarios to implementing encryption, authentication, and intrusion detection. Covering all of today's leading firewall products and network operating systems as well as PKI, PGP, and other complementary security solutions, this book is your road map to state-of-the-art network security.
The Subgraph Bisimulation Problem
Authors: Agostino Dovier, Carla Piazza
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

We study the complexity of the Subgraph Bisimulation Problem, which relates to Graph Bisimulation as Subgraph Isomorphism relates to Graph Isomorphism, and we prove its NP-Completeness. Our analysis is motivated by its applications to semistructured databases.
Dynamic response of double-track railway bridges
Authors: M. K. Swailem
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper presents the investigation of the effect of moving trains on the dynamic response of double-track railway bridges. The finite element approach and the application of a mode superposition technique are used to achieve the desired dynamic analysis. Train loads according to Egyptian and American codes are modeled as a series of concentrated moving loads and used in the analysis. Cases of simply supported steel girder bridges are tested and analyzed. Two moving trains with constant and varying speeds traversing the tested bridges simultaneously in identical and opposite directions are studied. The free vibration characteristics for each of the tested bridges are determined. The influence of the different variables on the dynamic behaviour of railway bridges is also included. A comparison between the accurate values calculated for the dynamic effect factors of the investigated cases and the corresponding impact factors given by the Egyptian and the American specifications of railway bridges has been made.
Transition-independent decentralized markov decision processes
Authors: Raphen Becker, Shlomo Zilberstein, Victor Lesser, Claudia V. Goldman
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

There has been substantial progress with formal models for sequential decision making by individual agents using the Markov decision process (MDP). However, similar treatment of multi-agent systems is lacking. A recent complexity result, showing that solving decentralized MDPs is NEXP-hard, provides a partial explanation. To overcome this complexity barrier, we identify a general class of transition-independent decentralized MDPs that is widely applicable. The class consists of independent collaborating agents that are tied together through a global reward function that depends upon both of their histories. We present a novel algorithm for solving this class of problems and examine its properties. The result is the first effective technique to solve optimally a class of decentralized MDPs. This lays the foundation for further work in this area on both exact and approximate solutions.
Multiple Motion Scene Reconstruction with Uncalibrated Cameras
Authors: Mei Han, Takeo Kanade
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

In this paper, we describe a reconstruction method for multiple motion scenes, which are scenes containing multiple moving objects, from uncalibrated views. Assuming that the objects are moving with constant velocities, the method recovers the scene structure, the trajectories of the moving objects, the camera motion, and the camera intrinsic parameters (except skews) simultaneously. We focus on the case where the cameras have unknown and varying focal lengths while the other intrinsic parameters are known. The number of the moving objects is automatically detected without prior motion segmentation. The method is based on a unified geometrical representation of the static scene and the moving objects. It first performs a projective reconstruction using a bilinear factorization algorithm and, then, converts the projective solution to a Euclidean one by enforcing metric constraints. Experimental results on synthetic and real images are presented.
Applying Automatically Derived Gene-Groups to Automatically Predict and Refine Metabolic Pathways
Authors: Arvind K. Bansal
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

This paper describes an automated technique to predict integrated pathways and refine existing metabolic pathways using the information of automatically derived, functionally similar gene-groups and orthologs (functionally equivalent genes) derived by the comparison of complete microbial genomes archived in GenBank. The described method integrates automatically derived orthologous and homologous gene-groups (http://www.mcs.kent.edu/~arvind/orthos.html) with the biochemical pathway template available at the KEGG database (http://www.genome.ad.jp), the enzyme information derived from the SwissProt enzyme database (http://expasys.hcuge.ch/), and the Ligand database (http://www.genome.ad.jp). The technique refines existing pathways (based upon the network of reactions of enzymes) by associating corresponding nonenzymatic and regulatory proteins to enzymes and operons and by identifying substituting homologs. The technique is suitable for building and refining integrated pathways using evolutionary diverse organisms. A methodology and the corresponding algorithm are presented. The technique is illustrated by comparing the genomes of E. coli and B. subtilis with M. tuberculosis. The findings about integrated pathways are briefly discussed.
A comparative study on content-based music genre classification
Authors: Tao Li, Mitsunori Ogihara, Qi Li
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Content-based music genre classification is a fundamental component of music information retrieval systems and has been gaining importance and enjoying a growing amount of attention with the emergence of digital music on the Internet. Currently little work has been done on automatic music genre classification, and in addition, the reported classification accuracies are relatively low. This paper proposes a new feature extraction method for music genre classification, DWCHs. DWCHs stands for Daubechies Wavelet Coefficient Histograms. DWCHs capture the local and global information of music signals simultaneously by computing histograms on their Daubechies wavelet coefficients. Effectiveness of this new feature and of previously studied features are compared using various machine learning classification algorithms, including Support Vector Machines and Linear Discriminant Analysis. It is demonstrated that the use of DWCHs significantly improves the accuracy of music genre classification.
Agile Modeling: Effective Practices for eXtreme Programming and the Unified Process
Authors: Scott Ambler
Venue:  (2002)

:Extreme Programming (XP) and the Unified Process (UP) have both caused quite a sensation in the software development community. Although XP offers a methodology for faster software development, many developers find that it does not explicitly include modeling time, which is crucial to ensure that a project meets its proposed requirements. UP developers, on the other hand, have found that the UP approach to modeling is too documentation-intensive and top heavy, thus impeding progress. Enter Agile Modeling (AM) -- a unique methodology specifically designed to enhance your modeling efforts on software development projects.
Bad Boy Ballmer: The Man Who Rules Microsoft
Authors: Fredric Alan Maxwell
Venue:  (2003)

:"In January 2000 Bill Gates gave his responsibilities and the title chief executive officer of Microsoft to his best friend, Steve Ballmer, who had been at Gates's side almost since the company's earliest days. The news sent shock waves throughout the technology and computer worlds, making many people wonder about the man who was now entrusted with Bill Gates's baby." The life of Steve Ballmer is an incredible story of tremendous ambition, genius, arrogance, and charisma, an up-by-the-bootstraps saga of how the only child of a Swiss immigrant grew up in suburban Michigan and became the fourth wealthiest American while working for someone else. Bad Boy Ballmer also reveals a man so arrogant that after the Department of Justice filed its antitrust suit against Microsoft, Ballmer stood onstage in San Jose and proclaimed "to hell with Janet Reno," a man so intense and aggressive that he once ripped his vocal cords by yelling too loudly. 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
Dynamic ATM Traffic Control Using Feedback and Traffic Prediction
Authors: Yu Gong
Venue:  (1993)

This paper focuses on the congestion problem arising in broadband wide area networks using asynchronous transfer mode (ATM). The ATM replaces the conventional window-based flow and congestion control by an open-loop mechanism, consisting of a connection admission control (CAC) and a usage parameter control (UPC). This so-called preventive congestion control (PCC) principle does not suffice since in reality effective CAC and UPC are both hard to achieve. Recently, the feasibility of using feedback to assist traffic controller has been investigated. It has been found that feedback is useful in the long run to alleviate congestion. This general conclusion, although theoretically important, does not address the practical concern as to how the network behaves when it is adjusting itself. In practice, it is desirable that the mid-term, even short term congestion be controlled using certain types of feedback. The work reported in this paper is motivated by this practical concern. A new feedback-based dynamic traffic control mechanism (called the balanced mechanism) is proposed and compared with the pure PCCC and an existing feedback based mechanism, known as EFCN. It is shown that the balanced mechanism outperforms both PCC and the EFCN. 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