ppxscal/embedding_network huggingface dataset:
Non-Abelian homomorphism testing, and distributions close to their self-convolutions
Authors: Michael Ben-or, Don Coppersmith, Mike Luby, Ronitt Rubinfeld
Venue: Random Structures Algorithms (2008)

In this paper, we study two questions related to the problem of testing whether a function is close to a homomorphism. For two finite groups G,H (not necessarily Abelian), an arbitrary map f : G,H, and a parameter 0 < ε < 1, say that f is ε-close to a homomorphism if there is some homomorphism g such that g and f differ on at most ε | G | elements of G, and say that f is ε-far otherwise. For a given f and ε, a homomorphism tester should distinguish whether f is a homomorphism, or if f is ε-far from a homomorphism. When G is Abelian, it was known that the test which picks O(1&#x002F;ε) random pairs x,y and tests that f(x) + f(y) = f(x + y) gives a homomorphism tester. Our first result shows that such a test works for all groups G. Next, we consider functions that are close to their self-convolutions. Let A = &lcub;ag | g ε G&rcub; be a distribution on G. The self-convolution of A, A&prime; = &lcub;a <stack>g&prime;</stack> | g ε G&rcub;, is defined by $$a^{\prime}_x = \sum_{y,z \in G; yz=x}a_y a_z.$$ It is known that A= A&prime; exactly when A is the uniform distribution over a subgroup of G. We show that there is a sense in which this characterization is robust&mdash;that is, if A is close in statistical distance to A&prime;, then A must be close to uniform over some subgroup of G. Finally, we show a relationship between the question of testing whether a function is close to a homomorphism via the above test and the question of characterizing functions that are close to their self-convolutions. &copy; 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008 A preliminary version of this paper appeared in RANDOM 2004 [3].
Semiconductor and EDA Challenges: Still Lots To Solve!
Authors: Chi-Foon Chan
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

For all the solutions that EDA has already brought to the table, the relentless march of Moore's Law continues to drive incredibly complex design and manufacturing challenges. Increasingly, physics and complexity are causing more than just technical issues: the economic realities are rapidly coming to the forefront as companies struggle for a sustainable ROI on design and manufacturing efforts.
The simple genetic algorithm and the walsh transform: Part i, theory
Authors: Michael D. Vose, Alden H. Wright
Venue: Evolutionary Computation (1998)

This paper is the first part of a two-part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary representation, the Walsh transform is the Fourier transform.) The results are of a theoretical nature and are based on the analysis of mutation and crossover. The Fourier transform of the mixing matrix is shown to be sparse. An explicit formula is given for the spectrum of the differential of the mixing transformation. By using the Fourier representation and the fast Fourier transform, one generation of the infinite population simple genetic algorithm can be computed in time O(cl log2 3), where c is arity of the alphabet and l is the string length. This is in contrast to the time of O(c3l) for the algorithm as represented in the standard basis. There are two orthogonal decompositions of population space that are invariant under mixing. The sequel to this paper will apply the basic theoretical results obtained here to inverse problems and asymptotic behavior.
Peer-based computer-supported knowledge refinement: an empirical investigation
Authors: Kwangsu Cho, Tingting Rachel Chung, William R. King, Christian Schunn
Venue: Communications of the ACM (2008)

Nonexpert peer-based knowledge refinement, it turns out, is just as helpful as expert-centric knowledge refinement for improving the quality of results.
A Simplified Analysis of Processor "Look-Ahead" and Simultaneous Operation of a Multi-Module Main Memory
Authors: J. E. Shemer, S. C. Gupta
Venue: IEEE Transactions on Computers (1969)

This paper focuses attention upon the design of a processor and memory system which is structured to achieve a satisfactory balance of processor speed and memory speed when both the processor and input-output controller are simultaneously competing for memory service. A mathematical model is developed to investigate the degree to which the processor is capable of overlapping memory references with instruction execution as a function of respective cycle times, the number of instruction "look-aheads," the number of independent memory modules, and input-output traffic. Utilizing this model, design trade-offs and performance indices are graphically examined for a hypothetical system.
Towards Explainable Writer Verification and Identification Using Vantage Writers
Authors: A. Brink, L. Schomaker, M. Bulacu
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

In this paper, a new method for off-line writer verifica- tion and identification is proposed which encodes writer features as a mix of typical handwriting styles, written by so-called vantage writers. Since their handwriting can be shown to the user, the method provides a degree of trans- parency that is usually not present in automatic verification and identification systems. It acts as a dimensionality re- duction of a precomputed basic feature vector. In this exper- iment, the hinge feature was used. The method was tested with unconstrained connected cursive text in two datasets: a known dataset of 252 writers and 1074 writers from a new, forensic dataset.
Two methods to enhance the master thread's performance in SMT Chip
Authors: Ma Pengyong, Chen Shuming, Hu Xiao
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

In SMT processor, every thread's executing time will be enlarged due to sharing resource by several threads. It will result in task lost in real time system. In this paper, we present two methods to alleviate the Cache conflict in Multithread chip, one is protecting the last instructions of master thread, and the other is locking loop. Both methods only need several additional registers. Simulations show that not only the performance of master thread is improved by 14%, but also the IPC of all threads is improved about 6%.
System Fault Diagnosis: Masking, Exposure, and Diagnosability Without Repair
Authors: J. D. Russell
Venue: IEEE Transactions on Computers (1975)

Diagnosability without fault repair of a digital system containing at most t faults is considered. A system-level diagnostic model defined in an earlier paper [1] is employed. The model is to an extent independent of the means used to implement diagnostic procedures, i.e., whether the tests are accomplished via hardware, software, or combinations thereof. Two parameters, the masking and exposure indices, are defined. Conjoined with the previously defined closure index, the parameters fundamentally characterize the capability for executing valid tests in a multiple-fault environment. Necessary and sufficient conditions for a system to be t-fault diagnosable without repair are derived in terms of these parameters. Examples are presented to illustrate the application of the model for systems close to those encountered in actual practice.
Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
Authors: Jorge M. S. Valente, Rui A. F. S. Alves
Venue: Computers and Operations Research (2008)

In this paper, we consider the single machine weighted tardiness scheduling problem with sequence-dependent setups. We present heuristic algorithms based on the beam search technique. These algorithms include classic beam search procedures, as well as the filtered and recovering variants. Previous beam search implementations use fixed beam and filter widths. We consider the usual fixed width algorithms, and develop new versions that use variable beam and filter widths. The computational results show that the beam search versions with a variable width are marginally superior to their fixed value counterparts, even when a lower average number of beam and filter nodes is used. The best results are given by the recovering beam search algorithms. For large problems, however, these procedures require excessive computation times. The priority beam search algorithms are much faster, and can therefore be used for the largest instances. Scope and purpose: We consider the single machine weighted tardiness scheduling problem with sequence-dependent setups. In the current competitive environment, it is important that companies meet the shipping dates, as failure to do so can result in a significant loss of goodwill. The weighted tardiness criterion is a standard way of measuring compliance with the due dates. Also, the importance of sequence-dependent setups in practical applications has been established in several studies. In this paper, we present several heuristics based on the beam search technique. In previous beam search implementations, fixed beam and filter widths have been used. We consider the usual fixed width algorithms, and also develop new versions with variable beam and filter widths. The computational tests show that the beam search versions with a variable width are marginally superior to their fixed value counterparts. The recovering beam search procedures are the heuristic of choice for small and medium size instances, but require excessive computation times for large problems. The priority beam search algorithm is the fastest of the beam search heuristics, and can be used for the largest instances.
Object Detection Using Geometrical Block Structures
Authors: Zisheng Cao, Feng Chen, Youtian Du
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

We propose a novel method of object detection in unconstrained, clustered scenes. Our method strongly benefits from object representation using geometrical structure of image blocks. It comes from an intuition that object has strong relationships between some of its components. It effectively extends the features of local area to the global using a complete graph of blocks so as to achieve a perspective of features in geometrical structure of the object. AdaBoost is adopted to select those relations of block pairs which are able to distinguish object from the rest while designing classifier. This method gives a good result when we use face and human detection as testing cases.
Guidon-Watch: A Graphic Interface for Viewing a Knowledge-Based System
Authors: Mark Richer, William clancey
Venue: IEEE Computer Graphics and Applications (1985)

Multiple windows, menus,and a mouse help students browse through a complex medical consulting database and view reasoning processes during a consultation.
Performance of current mirror with high-k gate dielectrics
Authors: F. Crupi, P. Magnone, A. Pugliese, G. Cappuccino
Venue: Microelectronic Engineering (2008)

This work compares the performance of the basic current mirror topology by using two different materials for gate dielectrics, the conventional SiON and an Hf-based high-k dielectrics. The impact of gate leakage and of channel length modulation on the basic current mirror operation is described. It is shown that in the case of SiON gate dielectrics with an equivalent oxide thickness (EOT) of 1.4nm, it is not possible to find a value for the channel length which allows a good trade-off to be obtained while minimizing the gate leakage and reducing the channel length modulation. On the other hand, the study demonstrates that in the case of HfSiON gate dielectrics with similar EOT, appropriate L values can be found obtaining very high output impedance current sources with reduced power consumption owing to low leakage and most of all with better parameter predictability.
Image Retrieval Using the Curvature Scale Space (CSS) Technique and the Self-Organizing Map (SOM) Model under Affine Transforms
Authors: Carlos W. D. de Almeida, Renata M. C. R. de Souza, Carlos E. B. Rodrigues, Nicomedes L. Junior Cavalcanti
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

In a previous work [1], we presented an approach for shape-based image retrieval using the curvature scale space (CSS) and self-organizing map (SOM) methods. Here, we examine the robustness of the representation under affine transforms. Moreover, the CSS images extracted from a database are processed and described by median vectors that constitutes the training data set for a SOM neural network. This way of description improves the accuracy of image retrieval in comparison with the previous work [1] that used the first principal component of the PCA technique. Experiments with a benchmark database are carried out to demonstrate the usefulness of the proposed methodology.
Computers aid optimization for ultra-high performance (UHP) lamps processes
Authors: Yuan-Piao Lee, Yi-Fang Chen, Yao-Wun Chen, Sin-Rong Wu, Yong-Ji Wu
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

The computer projectors are increasingly popular in the meetings or educations. Developing a low cost, high efficient and high luminance lamp is the key to extend the lifetime of projector. Here, we have successfully developed the ultra-high performance lamps (UHP) to instead of the conventional projector lamp-metal halide lamp (MHL). The luminance of ultra-high performance lamps can exceed 12,000 only with 200W power consumption. Many processes parameters are largely affected lamp. The computer systems are important to ensure that the processes are stable and the researches are quickly. At this moment, this paper will discuss the measure & computer systems. As well, the processes, structures, and properties of ultra-high performance lamps are discussed.
A proposal for interactive-constructivistic teaching methods supported by Web 2.0 technologies and environments
Authors: Francesco Di Cerbo, Giancarlo Succi
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In this paper, we will illustrate our proposal for a methodology of academical teaching, based on cooperative learning paradigm, which also relies on cutting edge e-learning techniques. We use Web 2.0 resources to fulfill requirements coming from our vision of an interactive-constructivistic "learning space", where blended-teaching paradigm may be proficiently applied. We propose our plan for extending an existing Free/Open Source Software Learning Management System, to create a cooperative and community-based learning space adherent to our proposal.
BIOCHAM
Authors: Laurence Calzone, François Fages, Sylvain Soliman
Venue: Bioinformatics (2006)

Summary: BIOCHAM (the BIOCHemical Abstract Machine) is a software environment for modeling biochemical systems. It is based on two aspects: (1) the analysis and simulation of boolean, kinetic and stochastic models and (2) the formalization of biological properties in temporal logic. BIOCHAM provides tools and languages for describing protein networks with a simple and straightforward syntax, and for integrating biological properties into the model. It then becomes possible to analyze, query, verify and maintain the model with respect to those properties. For kinetic models, BIOCHAM can search for appropriate parameter values in order to reproduce a specific behavior observed in experiments and formalized in temporal logic. Coupled with other methods such as bifurcation diagrams, this search assists the modeler/biologist in the modeling process. Availability: BIOCHAM (v. 2.5) is a free software available for download, with example models, at Contact: Sylvain.Soliman@inria.fr
CacheCompress: a novel approach for test data compression with cache for IP embedded cores
Authors: Hao Fang, Chenguang Tong, Bo Yao, Xiaodi Song, Xu Cheng
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

In this paper, we propose a novel test data compression technique named CacheCompress, which combines selective encoding and dynamic dictionary based encoding. Depending on the number of specified bits, a test data word is either encoded in a single code word or as a lookup in the dictionary. Explicit dictionary initialization is not required since the content of the dictionary is updated during testing. The dictionary itself only contains the most recently used patterns, thus it exhibits a behaviour similar to a cache. Experiments show that our technique achieves higher compression ratio than other recent compression schemes while the dictionary size has been dramatically reduced.
Semantic Structures for Efficient Code Generation on a Stack Machine
Authors: J. Couch
Venue: Computer (1977)

Since the expression is the fundamental building block of any programming language, its evaluation is an integral part of program compilation and execution. In particular, the evaluation techniques and data structures are determined by the class of expressions acceptable by the language. This paper serves as a framework for expression evaluation on a stack machine by presenting a set of optimized algorithms and internal data structures developed during the implementation of several compilers for the Hewlett-Packard computer systems.
Test Generation for Crosstalk Glitches Considering Multiple Coupling Effects
Authors: Minjin Zhang, Xiaowei Li
Venue: Proceedings of the 16th Asian Test Symposium (2007)

As the feature size continues to scale into the nanometer era, crosstalk-induced effect begins to exert a more significant influence. In this paper, we address the condition of maximum crosstalk glitch noise considering multiple coupling effects and propose a novel test generation technique for this problem. A multiple crosstalk-induced glitch fault (MCGF) model is introduced, which gives information on one or more sub-paths to be sensitized to generate transitions coupled to a victim line. The test for an MCGF is a 2-vector pattern that sensitizes the transition signal along the sub-path to each aggressor line at the maximum aggressive time (MAT), and propagates the signal on a victim line to an output. A new structure, transition map (TM), is proposed to record all the possible arrival time of a line. The MAT of a victim line is calculated based on effective coupling capacitance (ECC). Therefore, the crosstalk-induced effects can be effectively identified, and exactly activated using the generated test patterns. Experiments on ISCAS89 benchmark circuit show that the proposed technique can be applied to circuits of reasonable sizes within acceptable time.
Distributed adaptive rate system for wireless packet networks
Authors: Jui Teng Wang
Venue: Wireless Personal Communications: An International Journal (2007)

A distributed adaptive rate system for wireless packet networks is proposed. Compared to the centralized adaptive rate system that needs to know the packet retransmission probability to maximize the throughput, this system need not know the packet retransmission probability in advance and can achieve the optimal adaptive rate system that maximizes the throughput for wireless packet networks.
Prototyping Fast, Simple, Secure Switches for Etha
Authors: Jianying Luo, Justin Pettit, Martin Casado, John Lockwood, Nick McKeown
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

We recently published our proposal for Ethane: A cleanslate approach to managing and securing enterprise networks. The goal of Ethane is to make enterprise networks (e.g. networks in companies, universities, and home offices) much easier to manage. Ethane is built on the premise that the only way to manage and secure networks is to make sure we can identify the origin of all traffic, and hold someone (or some machine) accountable for it. So first, Ethane authenticates every human, computer and switch in the network, and tracks them at all times. Every packet can be immediately identified with its sender. Second, Ethane implements a network-wide policy language in terms of users, machines and services. Before a flow is allowed into the network, it is checked against the policy.
Shaded Computer Graphics in the Entertainment Industry
Authors: F. C. Crow
Venue: Computer (1978)

The term "shaded computer graphics" refers to computer-generated images in which an intensity is calculated for each of a quarter-million or more resolvabe spots which form a picture. Realistic images of this sort were first synthesized about a decade ago,1,2 and subsequent years have seen considerable research and development. Although these efforts were largely stimulated by the need for visual simulators for training airplane and spacecraft pilots, the resulting techniques and equipment are now available for a broad spectrum of applications.
Position Estimation Based Object Tracking across Multiple Cameras
Authors: Yingna Deng, Hong Zhu, Gang Li, and Ruirui Ji
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

An object tracking method based on position estimation across multiple cameras is proposed in this paper. For an object which is exiting a former view and entering in a latter, Kalman filter is used to predict the position in the next frame, and the reference region where the object will be observed in the latter view is obtained through a camera model. The object detected in the reference region is the correspondent object and the experiments show its validity. Key Words: Object Tracking, Kalman Filter, Multiple Cameras, Camera Model
A Performance Evaluation of an Optimized Caching Protocol for the Mobile Gnutella based Network to Support Distributed Collaborative Virtual Environments
Authors: Azzedine Boukerche, Anis Zarrad, Regina Borges Araujo
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

A novel caching protocol for the Mobile Gnutella based network is presented and evaluated in this paper. The caching mechanism is combined with a Gnutella Ultrapeer System (GUS) to better meet the mobility requirement of Collaborative Virtual Environments (CVEs). The contributions of this work are twofold: a) an efficient overlay formation mechanism for mobile nodes participating in a CVE; b) an optimized PONG caching technique implemented in selected nodes to control PING/PONG messages.
Improving predictive models of cognitive complexity using an evolutionary computational approach: a case study
Authors: Rodrigo Vivanco, Dean Jin
Venue: Proceedings of the 2007 conference of the center for advanced studies on Collaborative research (2007)

The development of software is a human endeavor and program comprehension is an important factor in software maintenance. Predictive models can be used to identify software components as potentially problematic for the purpose of future maintenance. Such modules could lead to increased development effort, and as such, may be in need of mitigating actions such as refactoring or assigning more experienced developers. Source code metrics can be used as input features to classifiers, however, there exist a large number of structural measures that capture different aspects of coupling, cohesion, inheritance, complexity and size. In machine learning, feature selection is the process of identifying a subset of attributes that improves a classifier's performance. This paper presents initial results when using a genetic algorithm as a method of improving a classifier's ability to discover cognitively complex classes that degrade program understanding.