ppxscal/embedding_network huggingface dataset:
Using Hidden Markov Models as a Tool for Handwritten Text Line Segmentation
Authors: F. Luthy, T. Varga, H. Bunke
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In this paper, the segmentation of off-line cursive hand- written text lines into individual words is investigated. The problem is considered as a text line recognition task, adapted to the characteristics of segmentation. That is, at a certain position of a text line, it has to be decided whether the considered position belongs to a letter of a word, or to a space between two words. Thus the text line needs to be recognized as a sequence of non-space and space charac- ters. For this purpose, three different recognizers based on Hidden Markov Models are designed, and results of writer- dependent as well as writer-independent experiments are reported in the paper.
An Efficient Clustering-Based Method for Data Gathering and Compressing in Sensor Networks
Authors: Qianqian Ren, Jianzhong Li, Jinbao Li
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

The dissemination of data costs much energy in wireless sensor network. In this paper, we incorporate a data gathering method which groups sensor nodes into clusters and gathers data efficiently. Considering characteristics of data in sensor networks and the good properties of wavelets, we further propose to compress sensor data at cluster head using wavelet transform and a novel threshold technique with bounded error. The analysis and experiment results show that our methods can compress data and gather compact data with efficiency. Besides, they exhibit significant conservation of energy cost at both node and network-level as a result of reduced data transmission overhead.
An Improved Lower Bound on Polynomial Multiplication
Authors: M. R. Brown
Venue: IEEE Transactions on Computers (1980)

We prove an asymptotic lower bound of 3.52n nonscalar multiplications for (degree n - 1 by degree n - 1) polynomial multiplication in a model which allows only integers as scalars. Index Terms-Algebraic complexity, lower bound, polynomial multiplication.
Light-weight End-to-End QoS as DoS Prevention
Authors: Marcel Waldvogel, Tobias Köck
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

This paper proposes a first step into a common solution, where combined and extended interests will hopefully allow us to surpass this threshold. While there are still some open issues, we hope to not only propose a basic working mechanism but also provide fresh ideas to start thinking off the beaten path. Our main contribution is to create a lightweight, end-to-end binding between path and service, which is then used as a basis to associate further attributes and mechanisms to this binding.
Implementing queues in Lisp
Authors: Peter Norvig, Richard C. Waters
Venue: ACM SIGPLAN Lisp Pointers (1991)

A queue is a data structure where items are entered one at a time and removed one at a time in the same order---i.e., first in first out. They are the same as stacks except that in a stack, items are removed in the reverse of the order they are entered---i.e., last in first out. Queues are most precisely described by the functions that act on them: (make-queue) Creates and returns a new empty queue.
CMOS balanced regenerative frequency dividers for wide-band quadrature LO generation
Authors: Andrea Mazzanti, L. Larcher, Francesco Svelto
Venue: Microelectronics Journal (2007)

CMOS regenerative frequency dividers, based on a fully balanced Gilbert cell, are analyzed in this paper for quadrature local oscillator (LO) signal generation. Driven in opposite phase by double frequency signals, they provide quadrature waveforms while simultaneously driving large mixers LO input capacitances, thereby avoiding power hungry buffers typically required. Experimental results, carried out on 0.18@mm CMOS prototypes, show 68% bandwidth around 2GHz center frequency, with a quadrature accuracy better than 1^o, making them suitable for multi-standard wireless receivers. To keep the output amplitude constant while simultaneously minimizing the average power consumption, a digital calibration loop regulates each divider biasing current.
Introducing a decision tree-based indoor positioning technique
Authors: Jaegeol Yim
Venue: Expert Systems with Applications: An International Journal (2008)

Positioning a user is an essential ingredient of a location-based system. For the outdoor positioning, GPS is practically used. For the indoor positioning, Active Badge, BAT, Cricket, and so on have been introduced. These methods are very accurate but require special equipments dedicated for positioning. Instead of using special equipments, using existing equipments is more economical. For this reason, positioning methods of using existing wireless LAN access points have recently been introduced. Among the methods employed by them, the fingerprint methods are the most promising. Probabilistic method, K-NN (Nearest Neighbor), and Neural networks are the techniques used by the most location fingerprinting. We are proposing a new technique which is more efficient than these three. Our technique builds a decision tree during the off-line phase and determines a user's location referring to the tree. Time complexity analysis and experimental accuracy analysis of the proposed technique are presented in this paper.
Integrating Fuzzy Logic and Data Mining: Impact on Cyber Security
Authors: A. Q. Ansari, Tapasya Patki, A. B. Patki, V. Kumar
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Data mining is the search for significant patterns and trends in large databases. Fuzzy Logic, on the other hand, provides techniques for handling cognitive issues in the real world. The paper discusses the application of fuzzy logic techniques and data mining practices in Cyber
Verified component-based software in SPARK: experimental results for a missile guidance system
Authors: Kung-Kiu Lau, Zheng Wang
Venue: Proceedings of the 2007 ACM international conference on SIGAda annual international conference (2007)

SPARK is useful for developing reliable software for safety-critical systems, using the `correctness-by-construction' approach. It also has verification tools that can be used to produce verified software. To tackle larger-scale development of verified software, components are useful. In this paper we show how to define and implement software components in SPARK and use existing SPARK tools to produce verified component-based software. We demon- strate our approach on a missile guidance system.
Trace Based Mobility Model for Ad Hoc Networks
Authors: V. Vetriselvi, Ranjani Parthasarathi
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

network poses a challenge in determining stable routes in the network. It is often difficult to predict the mobility of the nodes, as they tend to be random in nature. However, a non-random component would also exist in many scenarios. It is this non-random behavior that we consider in this paper to identify the movement trace of the mobile nodes. An algorithm is proposed to model the regular movement of a node as a trace containing a list of stable positions and their associated time. We call this model as a trace based mobility model (TBMM). The effectiveness of this model is shown by predicting the accuracy of a node movement by performing a ten fold cross validation. We also show the applicability of the trace information in the routing protocol to provide Quality of Service (QoS).
On Complexity of Internal and External Equivalence Checking
Authors: Eugene Goldberg, Kanupriya Gulati
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

We compare the complexity of "internal" and "external" equivalence checking. The former is meant for proving the correctness of a synthesis transformation by which circuit N2 is obtained from circuit N1. The latter is meant for proving that circuits N1 and N2 are functionally equivalent without making any explicit assumptions about the origin of N1 and N2. We describe logic synthesis procedures that can produce a circuit N2 whose equivalence with the original circuit N1, most likely, can not be efficiently proved by an external equivalence checker. On the other hand, there are internal equivalence checking procedures that easily prove that N1 and N2 are equivalent. We give experimental data showing that these logic synthesis procedures are not a mathematical curiosity but indeed can be used as a powerful method of logic optimization.
Reasoning about topological relations between regions with broad boundaries
Authors: Shihong Du, Qimin Qin, Qiao Wang, Haijian Ma
Venue: International Journal of Approximate Reasoning (2008)

Uncertain regions can be represented as having broad boundaries (BBRs) and their topological relations can be modeled by the extended 9-intersection. In order to satisfy the need for querying, managing, and processing BBRs, this study presents a 4-tuple representation of topological relations between BBRs, and a method in which the relations between simple regions with broad boundaries (SBBRs) are used to infer new topological information. The 4-tuple representation can distinguish the same topological relations as identified by the extended 9-intersection. Since the 4-tuple uses combinations of the basic topological relations between crisp regions to describe the relations between uncertain regions, the reasoning of topological relations between SBBRs can be obtained by combining the results of those between crisp regions. The reasoning mechanism can be used in several applications, such as to evaluate the consistency of topological relations between uncertain regions in multi-resolution spatial databases and to assess the consistency of a complete or incomplete symbolic description of a spatial scene.
Access and Alignment of Data in an Array Processor
Authors: D. H. Lawrie
Venue: IEEE Transactions on Computers (1975)

This paper discusses the design of a primary memory system for an array processor which allows parallel, conflict-free access to various slices of data (e.g., rows, columns, diagonals, etc.), and subsequent alignment of these data for processing. Memory access requirements for an array processor are discussed in general terms and a set of common requirements are defined. The ability to meet these requirements is shown to depend on the number of independent memory units and on the mapping of the data in these memories. Next, the need to align these data for processing is demonstrated and various alignment requirements are defined. Hardware which can perform this alignment function is discussed, e.g., permutation, indexing, switching or sorting networks, and a network (the omega network) based on Stone's shuffle-exchange operation [1] is presented. Construction of this network is described and many of its useful properties are proven. Finally, as an example of these ideas, an array processor is shown which allows conflict-free access and alignment of rows, columns, diagonals, backward diagonals, and square blocks in row or column major order, as well as certain other special operations.
The Ergonomics of Video Display Terminals
Authors: Ware Myers
Venue: IEEE Computer Graphics and Applications (1984)

More and more people working with information are using VDTs. Hence, it is critical that the hardware conform to health and safety standards.
An Improved MRWD Coding Algorithm
Authors: Guihua Liu, Benming Zhu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

The MRWD(Mathematical Morphology of the Wavelet Data ) algorithm utilizes morphological dilation in the wavelet domain to exploit the salient wavelet coefficient, with the appearance of a mass of long series of "0" code stream in the bit-plane. By studying the statistical characteristics of bit stream of wavelet coefficient of some typical images in bit-plane and MRWD code of some original code stream, an improved MRWD coding algorithm is presented to reduce tremendous redundancies existing in MRWD code. The improved MRWD algorithm is a lossless compressing algorithm vs MRWD algorithm, with the same SNR in both algorithms. Simulation results showed that the improved MRWD can reduce the lengths of encoded streams to increase the compression ratio of digital images, and also fully meet actual requirements for encoding of many images.
An Object-Oriented Command Language
Authors: R. Snodgrass
Venue: IEEE Transactions on Software Engineering (1983)

This paper describes Cola, an object-oriented command language for Hydra; Hydra is a capability-based operating system that runs on C.mmp, a tightly coupled multiprocessor. The two primary aspects of Cola, that it is a command language for Hydra, and that it is based on the object paradigm, are examined. Cola was designed to effect a correspondence between capabilities in Hydra and objects that are supported by the language. Cola is based on Smalltalk in that it uses message-passing as a control structure to allow syntactic freedom in the expression of commands to the system. Cola objects are arranged in a hierarchy, and the message-passing mechanism was designed to exploit this structure by automatically forwarding an unanswered message up the hierarchy. Two ramifications of this mechanism, automatic inheritance and shadowing, are discussed. An evaluation of the design decisions is also given.
Realization of Arbitrary Logic Functions by Completely Monotonic Functions and Its Applications to Threshold Logic
Authors: S. Yajima, T. Ibaraki
Venue: IEEE Transactions on Computers (1968)

Abstract The concept of mutual monotonicity developed in the previous paper[1] is applied to the compound synthesis of an arbitrary logic function by a combination of completely monotonic functions or in most cases by threshold functions.
A long-term study of a popular MMORPG
Authors: Wu-chang Feng, David Brandt, Debanjan Saha
Venue: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games (2007)

Over the last decade, Massively Multi-player On-line Role Playing Games (MMORPGs), have become big business. In typical MMORPGs, players pay a monthly subscription to the game publisher who hosts the game and provides periodic content updates. To be successful, game publishers must characterize their player population so that they can provision sufficient resources to support the game and so that they can update the game in a timely manner. To this end, this paper provides the first, long-term study of a popular MMORPG from its launch. Our dataset encompasses the entire lifetime of "EVE Online" [1, 2], a science-fiction based MMORPG that has supported nearly 1 million unique players, 67 million player sessions, and 17,000 player years of gameplay since its launch in May 2003.
Towards a User-Centric and Quality-Aware Multimedia Service Delivery Implementation on IP Multimedia Subsystem
Authors: Chitra Balakrishna, Khalid Al-Begain
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

IP Multimedia Subsystem (IMS) originating from the 3GPP is pivotal on the road to next generation all-IP networks. Multimedia applications are potential drivers for the adoption of next generation IP multimedia subsystem (IMS) and could be a decisive factor in its deployment. They are expected to generate revenue to the operators and justify their investment in IMS. And, for these multimedia services to be widely accepted by the end users, guaranteed and adaptable quality of service provision across heterogeneous access networks and heterogeneous device types is mandatory. In this paper, a generic, adaptive, controlled service delivery framework implementation for multimedia applications on IMS architecture is proposed. The framework is designed to be usercentric, adaptable to terminal mobility and session mobility with minimum session disruption enabling a better end-to-end QoS. It is at the session-level, completely user-driven and does not account for the network-level QoS. It employs the Session initiation protocol (SIP), which is the signaling protocol for the 3GPP specified IMS. The purpose behind designing the framework is to evaluate the provisioning of quality-adaptive multimedia services on IMS network and analyze the performance with respect to delay induced by quality adaptation procedures during session and terminal mobility which might contribute towards the end-toend quality of service delivered to the users.
On Overflow Detection and Correction in Digital Filters
Authors: A. Landauro
Venue: IEEE Transactions on Computers (1975)

A new method for correction of two's, complement adders characteristics at the output of the multiplier following the adders is proposed. It is very suitable to ordinary pipe-line implementation.
Erratum, July issue
Venue: Computer (1978)

Steven and Svetlana Kartashev's guest editors' introduction, "LSI Modular Computers, Systems, and Networks," in the July Computer, erroneously stated on p.7, "By the late 60's, the high cost of vacuum tubes, transistors, and diodes had prompted development of design techniques that minimized the component count in a computer." The sentence should have read " By the late 50's..." 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
Fuzzy CDS scheduling for flow shops with more than two machines
Authors: Tzung-Pei Hong, Tzung-Nan Chuang
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

We have demonstrated how fuzzy concepts can easily be used in the Johnson algorithm for managing uncertain scheduling on two-machine flow shops. This paper extends application to fuzzy flow shops with more than two machines. A new fuzzy heuristic flow-shop scheduling algorithm (the fuzzy CDS algorithm) is then designed since optimal solutions seem unnecessary for uncertain environments. Also, the conventional CDS algorithm is shown as a special case of the fuzzy CDS algorithm with special membership functions being assigned.
Topologically Clean Distance Fields
Authors: Attila Gyulassy Mark Duchaineau, Vijay Natarajan, Valerio Pascucci, Eduardo Bringa Andrew Higginbotham Bernd Hamann
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Analysis of the results obtained from material simulations is important in the physical sciences. Our research was motivated by the need to investigate the properties of a simulated porous solid as it is hit by a projectile. This paper describes two techniques for the generation of distance fields containing a minimal number of topological features, and we use them to identify features of the material. We focus on distance fields defined on a volumetric domain considering the distance to a given surface embedded within the domain. Topological features of the field are characterized by its critical points. Our first methodbegins with a distance field that is computed using a standard approach, and simplifies this field using ideas from Morse theory. We present a procedure for identifying and extracting a feature set through analysis of the MS complex, and apply it to find the invariants in the clean distance field. Our second method proceeds by advancing a front, beginning at the surface, and locally controlling the creation of new critical points. We demonstrate the value of topologically clean distance fields for the analysis of filament structures in porous solids. Our methods produce a curved skeleton representation of the filaments that helps material scientists to perform a detailed qualitative and quantitative analysis of pores, and hence infer important material properties. Furthermore, we provide a set of criteria for finding the &#x201C;difference&#x201D; between two skeletal structures, and use this to examine how the structure of the porous solid changes over several timesteps in the simulation of the particle impact.
Analysis of Multiprocessors with Private Cache Memories
Authors: J. H. Patel
Venue: IEEE Transactions on Computers (1982)

This paper presents an approximate analytical model for the performance of multiprocessors with private cache memories and a single shared main memory. The accuracy of the model is compared with simulation results and is found to be very good over a broad range of parameters. The parameters of the model are the size of the multiprocessor, the size and type of the interconnection network, the cache miss-ratio, and the cache block transfer time. The analysis is extended to include several different read/write policies such as write-through, load-through, and buffered write-back. The analytical technique presented is also applicable to the performance of interconnection networks under block transfer mode.
Approximation of sets of superwords by L-language formulas
Authors: A. N. Chebotarev, O. I. Kurivchak
Venue: Cybernetics and Systems Analysis (2007)

L is a language for specifying properties of reactive systems. Such properties are considered as sets of words over the alphabet defined by a specification. Properties that correspond to complements of such sets are not expressible in the language L. An approach is proposed to constructing formulas of the language L that specify approximations of complements of sets defined in L.
Designing the Micro/370
Authors: H. h. Chao, S. Ong, M. Tsai, F. w. Shih, K. W. Lewis, J. F. Tang, C. Trempel, H. Yu, P. E. McCormick, C. Davis, A. Diamond, T. Medve, J. L. Hou
Venue: IEEE Design Test (1987)

The first System/370 microprocessor, the Micro/370 is a 32-bit processor that implements 102 System/370 instructions and supportsthe emulation of the rest of the instructions. The chip is 10 mmx 10 mm with 200,000 transistor sites, fabricated with a 2-micronpolysilicon gate NMOS technology with two levels of aluminum. It is designed for 10 MHz clock at worst case and has been operatedat 18 MHz with 3W power dissipation. Design tasks included maximizing the noise margin, minimizing noise, and being able tocomplete design changes in a short time. A mixed custom and standard-cell design approach was used in a hierarchical designand verification methodology.
Assessing continuous bivariate effects among different groups through nonparametric regression models: An application to breast cancer detection
Authors: Javier Roca-Pardiñas, Carmen Cadarso-Suárez, Pablo G. Tahoces, María J. Lado
Venue: Computational Statistics Data Analysis (2008)

In many applications, the joint effect of two continuous covariates on the target binary response may vary across groups defined by levels of a given factor. A testing procedure that would enable this type of surface-by-factor interactions to be detected has been designed. To accomplish this goal, a logistic generalized additive model (GAM) with bivariate continuous interactions varying across groups defined by levels of a factor is considered. A local scoring algorithm based on local linear kernel smoothers was implemented to estimate the proposed logistic GAM. Bootstrap resampling techniques were used for the purpose of testing for factor-by-surface interactions. Given the high computational cost involved, binning techniques were used to speed up computation in the estimation and testing processes. The adequacy of the bootstrap-based test was assessed by means of a simulation study. If a factor-by-surface interaction is detected in the model, it is then established that the use of the odds-ratio curves is very useful in obtaining a direct interpretation of the fitted model. The benefits of using this methodology when analyzing real data are illustrated by applying the technique to the outputs produced by a computerized system dedicated to the early detection of breast cancer.