ppxscal/embedding_network huggingface dataset:
Mathematical Formulae Recognition Using 2D Grammars
Authors: D. Pru_a, V. Hlavac
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

We present a method for off-line mathematical formulae recognition based on the structural construction paradigm and two-dimensional grammars. In general, this approach can be successfully used in the analysis of images contain- ing objects that exhibit rich structural relations. An impor- tant benefit of the structural construction is in treating the symbol segmentation in the image and its structural analy- sis as a single intertwined process. This allows the system to avoid errors usually appearing during the segmentation phase. We have developed and tested a pilot study proving that the method is computationally efficient, practical and able to cope with noise.
Microsystems Here Comes the PET
Venue: Computer (1977)

If Chuck Peddle can solve the parts, production, and distribution problems attendant to the manufacture and distribution of a new consumer product, you should soon be able to buy a complete computer system (CRT display, keyboard, 4K RAM memory, 12K ROM including Basic and a monitor, and cassette tape) for under $600. And your purchase could just as easily be at your local department store or discount house as at your local computer store. 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
Epistemic analysis of strategic games with arbitrary strategy sets
Authors: Krzysztof R. Apt
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

We provide here an epistemic analysis of arbitrary strategic games based on the possibility correspondences. Such an analysis calls for the use of transfinite iterations of the corresponding operators. Our approach is based on Tarski's Fixpoint Theorem and applies both to the notions of rationalizability and the iterated elimination of strictly dominated strategies.
Models and Genetic Algorithms for the Optimal Stochastic Riding Routes in Urban Public Transportation and Its Applications
Authors: Ruichun He, Yinzhen Li, Xuesong Feng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

With the development of ATIS(Advanced traveler infor- mation system), it is valuable to provide travel plans for the trip makers. For the bus trip makers, transfer times are always considered firstly. However, in most of cases, only the information about the bus routes, serving time, bus stops on these bus routes, etc, are offered ATIS. Considering the stochastic bus traveling time and transfer waiting time, the non-linear 0-1 programming model and the hyper-graph model for optimal riding routes with transfer times limited under the random circumstance are formulated in this paper. And the improved priority-based encoding genetic algorithm is also designed. Finally, we give a numerical example.
An Authentication Scheme for Ad-hoc Networks using Threshold Secret Sharing
Authors: Dimitrios D. Vergados, Giannis Stergiou
Venue: Wireless Personal Communications: An International Journal (2007)

Ad-hoc networks are peer-to-peer self- organized networks that make possible the communication between nodes located in areas, where communication infrastructure is absent or difficult to implement. For such networks, security is a crucial issue, since the wireless medium is vulnerable to various attacks. A centralized solution can be easily compromised, leaving the nodes exposed to threats originating from malicious users. In this paper, a security design for Ad-hoc networks is proposed and studied, providing authentication to the nodes that follow the principles of threshold secret sharing.
Improving Performance of Effect-Cause Diagnosis with Minimal Memory Overhead
Authors: Huaxing Tang, Chen Liu, Wu-Tung Cheng, Sudahkar M. Reddy, Wei Zou
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Effect-cause diagnosis procedures are the most commonly used in industry to diagnose VLSI circuits that fail manufacturing test or field applications. Fast and effective diagnosis procedures are essential to diagnose large numbers of failing dies for yield ramp-up. We have recently proposed a method to speed up effect-cause diagnosis procedures by using a dictionary of small size [26]. In this paper we propose methods to further reduce the dictionary size and still achieve higher performance. Experiments on several industrial designs demonstrate that, on average, effect-cause diagnosis procedures can be speeded up by 3.5X while requiring minimal memory overhead for a very small dictionary.
Online Games and Security
Authors: Gary McGraw, Greg Hoglund
Venue: IEEE Security and Privacy (2007)

Gaming has always been (and remains) a prime driver of PC technology, with deep penetration into the consumer market. Yet, online games -- especially massively multiplayer online role-playing games (MMORPGs) -- suffer from various security problems. This introduction to MMORPG security focuses on bugs involving time and state -- bugs that will likely appear more frequently as real-world software evolves to become more like game software.
Emulator Architecture
Authors: E. G. Mallach
Venue: Computer (1975)

Upgrading to a newer data processing system is not simply a matter of removing the old equipment and plugging in the new. The older system's workload must be transferred to the newer one/p=n-/and the newer one is usually also a fundamentally different one. The effort involved in such a conversion is massive. The difficulties of obtaining a smooth transition from one machine to the next are immense. 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
The graphical Krivine machine
Authors: Sylvain Lippi
Venue: Higher-Order and Symbolic Computation (2007)

We present a natural implementation of the Krivine machine in interaction nets: one rule for each transition and the usual rules for duplication and erasing. There is only one rule devoted to the so-called administration. This way, we obtain a graphical system encoding &lambda;-calculus weak head reduction that can be extended to a &lambda;-calculus normalizer by encoding left reduction.
Multiuser Power and Channel Allocation Algorithm in Cognitive Radio
Authors: Jiandong Li, Dong Chen, Weiying Li, Jing Ma
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

The multiuser power and channel allocation problem in cognitive radio is considered in this paper. Based on game theory, we modeled the problem into a non-cooperative game and proved that this problem is a supermodular game with the purpose to maximize the total system capacity of the network in which secondary users choose their power allocated in each channel according to their payoff function which consider both the capacity gain of themselves and the loss of the others. A distributed multiuser power and channel allocation algorithm is proposed according to our analysis. Simulation results indicate that our algorithm can achieve greater performance improvement compared with selfish power and channel allocation scheme in channel capacity.
Research and Application of a Hierarchical Fault Diagnosis System Based on Support Vector Machine
Authors: Ailun Liu, Xiaoyan Yuan, Jinshou Yu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Support Vector Machine (SVM) is a kind of machine learning method based on the statistical learning theory , it has been applied in the fault diagnosis field. After analyzing SVM pattern classification theory, a hierarchical structure Fault Detection and Identification (FDI) system is presented in this paper, and simulation results show that this method can effectively handle the complex process characteristic and improve FDI model performance .
Routing Management in the PSTN and the Internet: A Historical Perspective
Authors: Deep Medhi
Venue: Journal of Network and Systems Management (2007)

Two highly visible public communication networks are the public-switched telephone network (PSTN) and the Internet. While they typically provide different services and the basic technologies underneath are different, both networks rely heavily on routing for communication between any two points. In this paper, we present a brief overview of routing mechanisms used in the PSTN and the Internet from a historical perspective. In particular, we discuss the role of management for the different routing mechanisms, where and how one is similar or different from the other, as well as where the management aspect is heading in an inter-networked environment of the PSTN and the Internet where voice over IP (VoIP) services are offered.
Efficient Algorithms for the Inverse Sort Transform
Authors: Ge Nong, Sen Zhang
Venue: IEEE Transactions on Computers (2007)

As an important variant of the Burrows-WheelerTransform (BWT), the Sort Transform (ST) can speed up thetransformation by sorting only a portion of the matrix. However,because the currently known inverse ST algorithms need toretrieve the complete k-order contexts and use hash tables, theyare less efficient than the inverse BWT. In this paper, we proposethree fast and memory-efficient inverse ST algorithms. The firstalgorithm uses two auxiliary vectors to replace the hash tables.The algorithm achieves O(kN) time and space complexities for atext of N characters under the context order k. The second usestwo additional compact "alternate vectors" to further eliminatethe need to restore all the k-order contexts and achieve O(N)space complexity. And the third uses a "doubling technique" tofurther reduce the time complexity to O(N log2 k). The hallmarkof these three algorithms is that they can invert ST in a mannersimilar to inverting BWT in that they all make use of precalculatedauxiliary mapping vectors and require no hash tables.These unifying algorithms can also better explain the connectionbetween the BWT and the ST: their forward components can notonly be performed by the same algorithm framework, but theirrespective inverse components can also be efficiently conductedby the unifying algorithm framework proposed in the presentwork.
Fuzzy Rough Modeling Approach: Based on Fuzzy Clustering and GA Search Strategy
Authors: Dongbo Zhang, Yaonan Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

A method to construct fuzzy rough model is proposed. By means of adaptive Gaustafason-Kessel (G-K) clustering algorithm, fuzzy partition can be accomplished and corresponding fuzzy clusters are achieved in data space. Then based on the search of cluster number and attribute subsets through GA search strategy, optimal FRM will be found, and a decision model can be built. The experiment results indicate that FRM method is superior to traditional Bayesian and learning vector quantization (LVQ) methods, moreover, it has more powerful generalization ability. Also, experiment results show that it is favorable to obtain better FRM model if the search of reductive attribute subsets is considered.
Barrier Slicing for Remote Software Trusting
Authors: Mariano Ceccato, Mila Dalla Preda, Jasvir Nagra, Christian Collberg, Paolo Tonella
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

Remote trusting aims at verifying the "healthy" execution of a program running on an untrusted client that communicates with a trusted server via network connection. After giving a formal definition of the remote trusting problem and a test to determine whether an attack against a given remote trusting scheme is successful or not, we propose a protection against malicious modification of the client code, based on the replication of a portion of the client on the server. To minimize the size of the code that is replicated, we propose to use barrier slicing. We show the feasibility of our approach on a case study. Our results indicate that a barrier slice is significantly smaller than the corresponding backward slice while providing the same level of protection.
Intel Microprocessors-8008 to 8086
Authors: S. P. Morse
Venue: Computer (1980)

A mere six years of microprocessor evolution have yielded a three-orders-of-magnitude performance improvement.
Random subspace for an improved BioHashing for face authentication
Authors: Loris Nanni, Alessandra Lumini
Venue: Pattern Recognition Letters (2008)

Verification based on tokenised pseudo-random numbers and user specific biometric feature has received much attention. In this paper, we propose a BioHashing system for automatic face recognition based on Fisher-based Feature Transform, a supervised transform for dimensionality reduction that has been proved to be very effective for the face recognition task. Since the dimension of the Fisher-based transformed space is bounded by the number of classes - 1, we use random subspace to create K feature spaces to be concatenated in a new higher dimensional space, in order to obtain a big and reliable ''BioHash code''.
New Protection Mechanisms for Intellectual Property in Reconfigurable Logic
Authors: Tim Guneysu, Bodo Moller, Christof Paar
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

The distinct advantage of SRAM-based Field Programmable Gate Arrays (FPGA) is their flexibility for configuration changes. But this opens up the threat of Intellectual Property (IP) theft since the system configuration is stored in easy-to-access Flash memory. High-end FPGAs have already been extended with symmetric-key decryption engines used to load an encrypted version of the configuration that cannot simply be copied and used without knowledge of the secret key. However, with respect to business and licensing processes, this protection system lacks a convenient scheme for key transport and installation. We propose a new protection scheme for the IP of circuits in configuration bit files that provides a significant improvement to the current unsatisfying situation. It uses both public-key and symmetric cryptography, but does not burden FPGAs with the usual overhead of public-key cryptography: While it needs hard-wired symmetric cryptography, the public-key functionality is moved into a temporary configuration bit stream for a one-time setup procedure. This approach requires only very few modifications to current FPGA technology. Using five basic stages, the new protection scheme allows new accounting models for volume licensing of IP, with automated key installation on FPGAs taking place at the customer's site.
The UML Communication Diagram Revisited
Authors: Ahmad Alsaadi
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

This paper shows how the communication-diagram mechanism can be supplied with concepts, so that each collaboration can be specified. It enriches sequence expressions of messages with sub-terms that denote: Types of control structures choice, concurrence, and repetition of messages; and Complete information about their guarded branches, parallel threads, and iterative messages. Furthermore, each concatenation of these sub-terms maps onto an interlacement of message structures in an abstraction level or within levels of abstraction.
On LID assignment in infiniBand networks
Authors: Wickus Nienaber, Xin Yuan, Zhenhai Duan
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID)in the InfiniBand specification, must be assigned to the destination and used in the forwarding tables of intermediate switches to direct the traffic following the path. Hence, path computation in InfiniBand networks has two tasks: (1)computing the paths, and (2 )assigning LIDs to destinations (and using the LIDs in the forwarding tables to realize the paths). We will refer to the task of computing paths as routing and the task of assigning LIDs as LID assignment Existing path computation methods for InfiniBand networks integrate these two tasks in one phase. In this paper, we propose to separate routing and LID assignment into two phases so as to achieve the best performance for both routing and LID assignment. Since the routing component has been extensively studied and is fairly well understood, this paper focuses on LID assignment whose major issue is to minimize the number of LIDs required to support a routing. We prove that the problem of realizing a routing with a minimum number of LIDs is NP-complete, develop a number of heuristics for this problem, and evaluate the performance of the heuristics through simulation. Our results demonstrate that by separating routing from LID assignment and using the schemes that are known to achieve good performance for routing and LID assignment separately, more effective path computation methods than existing ones can be developed.
A Novel Optimizer Based on Particle Swarm Optimizer and LBG for Vector Quantization In Image Coding
Authors: Huilian Liao, Yiwei Wang, Jiarui Zhou, Zhen Ji
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

This paper presents an optimizer based on particle swarm optimization and LBG (PSO-LBG) for vector quantization in image coding. Three swarms, including two initial swarms and one elitist swarm whose particles are selected from two initial swarms respectively, are applied to find the global optimum. At each iteration of a swarm's updating process, particles perform the basic operations of PSO, but with smaller parameter values and population size compared with conventional PSO, followed by the well-known vector quantizer, i.e. LBG algorithm. Experimental results have demonstrated that the quality of codebook design using this optimizer is much better than that of Fuzzy K-means (FKM), Fuzzy Reinforcement Learning Vector Quantization (FRLVQ) and FRLVQ as the pre-process of Fuzzy Vector Quantization (FRLVQ-FVQ) consistently with shorter computation time and faster convergence rate. The final codevectors are scattered reasonably and the dependence of the final optimum codebook on the selection of the initial codebook is reduced effectively.
A High Performance Low Power Consumption Robot Vision System
Authors: Peng Lu, Kui Yuan, Wei Zou
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Considering about to solve the bottleneck problem of computing ability and power consumption of mobile robot vision system, a DSP and FPGA based intelligent image grabber and a robot vision system using this intelligent image grabber are developed. The configuration and some important characteristics of this robot vision system, which can not only complete the work of image capturing but can also process images using different algorithms in real-time, are described in this paper. It has been shown by experiments and performance comparison that this newly developed robot vision system is more suitable for mobile robots than the traditional PC based robot vision system.
How to Update Dependable Secure Computing Systems from a Survivability Assessment Perspective?
Authors: Li Bai, Saroj Biswas, Musoke Sendaula
Venue: Proceedings of the Third IEEE International Symposium on Dependable, Autonomic and Secure Computing (2007)

In this paper, we investigate how to compute an updating time for a dependable secure computing (DSC) system from a survivability assessment perspective. Generally speaking, to prevent adversaries from learning secret information in a DSC system, the secret information has to be updated in the system. The proposed method is based on a novel concept of survivability of reconfigurable systems presented earlier in [1]. It is shown that secret updating time increases with k, which is the number of secret shares for reconstructing the secret. The proposed method presents a solution for an important problem in the DSC system which is how to determine an appropriate updating time.
Users as contextual features of software product development and testing
Authors: David Martin, John Rooksby, Mark Rouncefield
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

This paper examines how software developers discuss users and how such discussions are intrinsic to the negotiation and settling of technical decisions in the development and testing of a software product. Using ethnographic data, we show how the user features in conversations, not as a 'topic' but as 'context' to technical work. By understanding the user as a contextual feature in developers' group work we are able to draw attention to issues in the use of Extreme Programming for software product development. Extreme Programming is a participatory design method, but software product development involves envisioning and designing for future customers.
Program working storage: a beginner's model
Authors: Evgenia Vagianou
Venue: Proceedings of the 6th Baltic Sea conference on Computing education research: Koli Calling 2006 (2006)

The aim of this paper is to introduce and validate the concept of program working storage (PWS) as a) a means of smooth transition of students in introductory programming courses from the end-user stance to the programmer stance, and b) a system which can provide comprehensive understanding of certain difficult programming concepts. In this respect, the program-memory interaction is considered as a possible "threshold concept" [31, 33]. Based on constructivism [16, 23, 41, 42], the PWS is then discussed as a potential beginner's viable model, which can be, later on, refined to what Ben-Ari describes as a viable computer model [5]. The extent to which the PWS can be used as a conceptual framework, which will enable teachers and learners to focus on program-memory interaction across a variety of dimensions, and eventually relate them to form a coherent whole, is also examined. The exact implementation of the PWS in the context of the various programming languages is beyond the scope of this paper. Nevertheless, it constitutes a topic for detailed study and future research.
Dissipativity and periodic attractor for non-autonomous neural networks with time-varying delays
Authors: Yumei Huang, Daoyi Xu, Zhichun Yang
Venue: Neurocomputing (2007)

In this paper, a model is considered to describe the dynamics of a class of non-autonomous neural networks with time-varying delays. By applying the properties of M-matrix, the techniques of inequality analysis and the Banach fixed point theorem, we obtain a series of new criteria on the dissipativity and existence of periodic attractor. Our results can extend and improve earlier ones.
Decision Tree Algorithm based on Sampling
Authors: Song Xudong, Cheng Xiaolan
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

As the size of the database increases, data mining algorithm faces more demanding requirements for efficiency and accuracy. Data mining for large data sets require large amounts of time and physical resources. Sampling is introduced as an effective method. Facing large data sets, a new decision tree algorithm based on sampling is put forward. It can select small initial samples with similar distribution to the original data sets to study, and stop sampling according to the time complexity requirements and convergence criteria. Comparing with the existing flexible decision tree algorithm, the algorithm can reduce the computation time and I/O complexity, while maintaining the accuracy of the tree.
Software Quality Assurance
Authors: E. Miller
Venue: Computer (1979)

Although long recognized as a serious problem, many of the issues encountered in assuring the quality of computer programs have only received the level of attention they deserve in the last decade.