ppxscal/embedding_network huggingface dataset:
Sizing and placement of charge recycling transistors in MTCMOS circuits
Authors: Ehsan Pakbaznia, Farzan Fallah, Massoud Pedram
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

A downside of using Multi-Threshold CMOS (MTCMOS) technique for leakage reduction is the energy consumption during transitions between sleep and active modes. Previously, a charge recycling (CR) MTCMOS architecture was proposed to reduce the large amount of energy consumption that occurs during the mode transitions in power-gated circuits. Considering the RC parasitics of the virtual ground and VDD lines, proper sizing and placement of charge-recycling transistors is key to achieving the maximum power saving. In this paper, we show that the sizing and placement problems of charge-recycling transistors in CR-MTCMOS can be formulated as a linear programming problem, and hence, can be efficiently solved using standard mathematical programming packages. The proposed sizing and placement techniques allow us to employ the CR-MTCMOS solution in large row-based standard cell layouts while achieving nearly the full potential of this power-gating architecture, i.e., we achieve 44% saving in switching energy due to the mode transition in CR-MTCMOS compared to standard MTCMOS.
Learning of Pattern-Based Rules for Document Classification
Authors: A. Dengel
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

Automatic processing of office documents, such as orders, invoices, or offers entails a significant poten- tial for saving costs. Because such domains have a high percentage of special vocabulary, purely statisti- cal approaches fail in automatic classification. The inherent structure and short text messages require spe- cific approaches. We propose a rule-based method to classify mixed stacks of documents into a set of hierar- chically organized classes. Rules are learned by ex- tracting patterns of different types from a document sample. The paper focuses on the architecture and on the learning process, presents comparing results to other techniques, and gives an outlook on how to fur- ther improve the system.
Blues for Gary: Design Abstractions for a Jazz Improvisation Assistant
Authors: Robert Keller, Martin Hunt, Stephen Jones, David Morrison, Aaron Wolin, Steven Gomez
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We describe the design and implementation of a tool to help students learn the art of jazz improvisation. The tool integrates elements of database, AI in the form of automatic melody generation, and human interface design. We describe the philosophy of using several coordinated mini-languages to provide user specifications for various aspects of the tool, including melody and chord representation, styles, melody generation, and other musical knowledge.
A Property of N-Graphs
Authors: A. Hashimoto, K. Noshita
Venue: IEEE Transactions on Computers (1971)

T. A. J. Nicholson has introduced a restricted class of drawn graphs (N-graphs) into the problem of drawing a graph with a minimum number of crosspoints. This short note shows some defects in representing the capability of N-graphs by presenting a planar graph which cannot be represented by any N-graphs.
KadStreaming: A Novel Kademlia P2P Network-Based VoD Streaming Scheme
Authors: Jie Wu, BiSheng Liu, ShiYong Zhang, ZhiHui Lu, YiPing Zhong
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Providing video on demand (VoD) service over the Internet is a challenging problem. In this paper, we present A Novel Kademlia P2P Network -based VoD Streaming Scheme: KadStreaming. In this infrastructure, we emphasize on the main mechanism of Node initiation, Node joining, Media publishing, Media searching, Node departure. Based on that, a developed prototype system of this scheme is given. As part of experiment work, we discuss P2P-based VoD System scheme implementation and then analyze the experiment results. At last, from our research experiences and related survey, we analyze the prospective research direction and challenges in this field.
Automatic rule-based expert system for English to Thai transcription
Authors: Chakkrit Snae, Pupong Pongcharoen
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Transliteration or transcription of names is necessary to communicate between different language communities, e.g. English to Thai writing system. Since names tend to show a certain intrinsic grade of variation this is even more the case for the transliterated or transcribed forms. Correct transcription and transliteration of names is one of the major problems in inter-cultural communication. Available standard "manual" transcription systems are often simply not used or are used inconsistently. Many computer-assisted systems are based on orthographic forms or pronunciation, rule based, and statistics-based approaches. In this paper we discuss the problems of Romanization, e.g. ambiguities of pronunciation as well as syllable and word segmentation. These problems can be considerable guidelines an implementation of backward transcription from English to Thai. To standardise this process the author proposes an automated English to Thai transcription system, called RESETT (Rule-based Expert System for English to Thai Transcription). This tool uses rule based Royal Thai General System of Transcription, syllable pronounciation and segmentation, and a hybrid name matching algorithm called LIG3 (Levenshtein, Index of similarity, and Guth). An advantage of the name matching process is an optimised transliteration of the rather complex Thai writing system. The LIG3 algorithm helps to produce highly accurate matches for transcribed forms.
Stack Computers
Authors: D. M. Bulman
Venue: Computer (1977)

Those of us who have worked with stack computers for several years have found an unending source of amazement -and some consternation-in how few computer professionals there are who seem aware that there is an entirely different approach to computer architecture from the familiar von Neumann model. Sometimes when such phrases as "zero-address machine" have dropped from my lips, and I see that the phrase had about as much meaning for the listeners as "zero-bit word" might have, I have wished that knowledge of stack machines were more widely spread. Fortunately Jack Grimes, the technical editor of Computer, had the same desire and suggested that an issue be devoted to the subject. 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
Robust Fast Marching Method Based on Anisotropic Diffusion
Authors: Zhang Hongwei, Zhang Jianwei, Cao Jian, Wang Wulin, Gong Jinfeng, Wang Xu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

As the most powerful numerical techniques for analyzing and solving interface evolution problems, level sets display interesting elastic behaviors and level set method can handle topological changes based on partial differential equations. But there are still some difficulties it must face up to, such as poor image contrast, noise, and missing or diffuse boundaries, this weakens its advantage. The fast marching method provides a fast implementation for level set methods, the anisotropic diffusion is allowed to better control the amount of smoothing effect and this process can get both noise smoothing and edge enhancement at the same time. The fast marching based on the anisotropic diffusion took the advantage of the above two methods. Experimental results indicate this method can greatly reduce the noise without distorting the image and made the level set methods more robust and accurate.
SESA: Emerging Technology for Service-Centric Environments
Authors: Tomas Vitvar, Michal Zaremba, Matthew Moran, Maciej Zaremba, Dieter Fensel
Venue: IEEE Software (2007)

Development of today's information systems must take a service-centric approach. The drive is toward designing service-centric systems involving well-defined, loosely coupled services that are reusable, discoverable, and composable. To promote service interoperability, usability, and efficiency in such systems, extending existing solutions with semantics offers better integration that's more adaptive to changes throughout the system's lifetime. This article is part of a special issue on service-centric software systems.
Using short-range communication to control mobile device functionality
Authors: Tim Moors, Marvyn Mei, Agus Salim
Venue: Personal and Ubiquitous Computing (2008)

This paper describes a prototype system, ZoneIT, for selectively controlling the functionality of mobile devices, e.g. the ringing of cellular telephones. ZoneIT exploits the fact that many such devices have short-range radio communication systems (e.g. Bluetooth and ZigBee). It uses such radio systems to allow these devices to communicate with Base Stations to learn what functionality is permissible in a particular zone. ZoneIT is secured by a process that enables mobile devices to authenticate base stations, and so protect against denial of service attacks.
A Performance Study of a Microcomputer-Implemented FSK Receiver
Authors: Paul Stigall, Rodger Ziemer, Van Pham
Venue: IEEE Micro (1981)

Microprocessors are finding new usefulness in digital signal processing. Here, a frequency shift-keyed receiver is implemented on a two-processor system.
A View on the Past and Future of Character and Document Recognition
Authors: H. Fujisawa
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

The paper first gives an overview on the technical advances in the field of character and document rec- ognition, decade by decade. Then, it highlights key technical developments especially for Kanji (Chinese character) recognition in Japan. Technical issues around post address recognition are then discussed, which have promoted advanced techniques including information integration. Robustness design principles are introduced. Finally, future prospects are discussed.
Shape Estimation of Transparent Objects by Using Inverse Polarization Ray Tracing
Authors: Daisuke Miyazaki, Katsushi Ikeuchi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Few methods have been proposed to measure three-dimensional shapes of transparent objects such as those made of glass and acrylic. In this paper, we propose a novel method for estimating the surface shapes of transparent objects by analyzing the polarization state of the light. Existing methods do not fully consider the reflection, refraction, and transmission of the light occurring inside a transparent object. We employ a polarization raytracing method to compute both the path of the light and its polarization state. Polarization raytracing is a combination of conventional raytracing, which calculates the trajectory of light rays, and Mueller calculus, which calculates the polarization state of the light. First, we set an initial value of the shape of the transparent object. Then, by changing the shape, the method minimizes the difference between the input polarization data and the rendered polarization data calculated by polarization raytracing. Finally, after the iterative computation is converged, the shape of the object is obtained. We also evaluate the method by measuring some real transparent objects.
An On-Chip Test Clock Control Scheme for Multi-Clock At-Speed Testing
Authors: Xiao-Xin FAN, Yu HU, Laung-Terng (L. -T. ). WANG
Venue: Proceedings of the 16th Asian Test Symposium (2007)

To test timing-related faults between synchronous clocks, an at-speed test clock and an automatic test pattern generation scheme are needed. However, previous work on designing on-chip at-speed test clock controllers for multi-clock has quadratic increasing area overhead along with linearly increasing clocks. This paper presents a clock-chain based test clock control scheme using an internal phase-locked-loop (PLL) as the at-speed test clock generator, which supports at-speed testing for inter-clock domain and intra-clock domain logic. Experimental results demonstrate that the proposed design has low area overhead when increasing the number of clocks.
A Simple and Fast Term Selection Procedure for Text Clustering
Authors: Luiz Gonzaga, Marco Grivet, Ana Teresa Vasconcelos
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Text clustering is a theme that is receiving considerable attention nowadays in areas such as text mining and information retrieval. A starting point for clustering methods applied on unstructured document collection is the creation of a vector-space model usually known as bag-of-words model [1]. Documents are then usually described by a matrix which happens to be huge and extremely sparse which is due to the exceeding number of terms describing the set of documents. Although several techniques can be employed to reduce this number, the final figure is still high thus leading to a feature space of high dimensionality. This paper presents a simple procedure that not only considerably reduces the dimensionality of the feature space and hence the processing time, but also produces clustering performances comparable or even better when confronted with the full set of terms.
Second Generation of Vector Supercomputers
Authors: E. W. Kozdrowicki
Venue: Computer (1980)

Integral scalar processing and increased parallelism are major advances in supercomputer evolution. Three second-generation machines BSP, Cyber 205, and Cray-1are here described and compared.
Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable
Authors: I. Tomek
Venue: IEEE Transactions on Computers (1974)

Two simple heuristic algorithms for piecewise-linear approximation of functions of one variable are described. Both use a limit on the absolute value of error and strive to minimize the number of approximating segnents subject to the error limit. The first algorithm is faster and gives satisfactory results for sufficiently smooth functions. The second algorithm is not as fast but gives better approximations for less well-behaved functions. The two algorithms are ilustrated by several examples.
Diagnosis of Faults in Modular Trees
Authors: F. G. Gray
Venue: IEEE Transactions on Computers (1979)

Diagnosis of stuck-at faults (s-a-f's) in modular trees is studied. Detection conditions for each distinguishable s-a-f in a module are derived. For single s-a-f's, the detection conditions are easily partitioned to achieve fault location by performing a small number of additional tests. A multiple s-a-f that produces the same test result as a single s-a-f can be located by applying additional tests whose number grows with the tree depth. All other multiple s-a-f's are detected but cannot be located. In this paper location algorithms for combinational modular trees are presented in detail. They are then modified to locate faults in modular trees which realize arbitrary definite machines. Since a pair of these tree structures can be connected to realize arbitrary sequential machines, the results derived here are useful in diagnosing sequential machines. The ability to diagnose faults, combined with the fact that the function of the tree is easily altered, makes this structure attractive in reconfiguration applications. In particular, application to array processors is suggested.
PLLSim - An Ultra Fast Bang-Bang Phase Locked Loop Simulation Tool
Authors: Michael Chan, Adam Postula, Yong Ding
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

This paper presents a simulation tool targeted specifically at bang-bang type phase locked loop systems. The aim of this simulator is to quickly and accurately predict important PLL transient characteristics such as capture range, locking time, and jitter. We present a behavioral model for bang-bang type PLLs, and show how the application of this model in a simulator can speed up simulation time by four to five orders of magnitude. With this performance, Monte-Carlo simulation techniques become not only feasible, but convenient. The simulator also models the major non-idealities typical of phase locked loop systems. The accuracy of the simulator is confirmed via detailed analysis and comparison with Matlab Simulink based models.
The application of grey theory in the data analysis of ground calibration test for unmanned aerial vehicles' main landing gear
Authors: Jee-Ray Wang, Chien-Fu Huang, Jiam-Hwa Lee, Che-Han Chu
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

In the past, a lot of resources have been invested into the research and development of unmanned aerial vehicles. Landing gear is one of the major components for the structure; the theoretical analysis of landing gear's load has many external limitations. Therefore, in order to ensure the flight safety, flying measurement becomes a necessary step. Before the flying measurement takes place, ground calibration test (GCT) is required to obtain the relationship between the structural strain and the load. Traditionally, we utilize regression analysis method to analyze GCT test data. To ensure the accuracy of regression method, we use the GM(1,1) model of grey system theory at the same time. There are a lot of successful applications about grey system theory in the domain of engineering. In this study, we try to utilize GM(1,1) model in grey system theory to analyze the experiment data. After compare with regression analysis results, it is proved that grey system theory can also produce the same accurate outputs. The comparison for analysis is consistent with each other. We can find that it is quite match for our purpose, especially in reliability and also proves the potential of grey system theory in the domain of aerospace technology.
Noisy Speech Recognition Based on Speech Enhancement
Authors: Xia Wang, Hongmei Tang, Xiaoqun Zhao
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In speech recognition system, recognition rate is always influenced by noise because training and recognition models are often mismatch in noisy environments. In this paper, we present a recognition system based on speech enhancement. First, noisy speech is enhanced by a filter composed of morphology and wavelet, then enhanced signals are sent into recognition system based on Hidden Markov Model, and the model is trained by signals passed through morphology filter. Experiments show that this method can increase system performance in noisy environment.
Evaluation of collaborative worm containment on the DETER testbed
Authors: L. Li, P. Liu, Y. C. Jhi, G. Kesidis
Venue: Proceedings of the DETER Community Workshop on Cyber Security Experimentation and Test on DETER Community Workshop on Cyber Security Experimentation and Test 2007 (2007)

The advantage of collaborative containment over independent block or address blacklisting on worm defense has been advocated in previous worm studies. In this work, we will evaluate two collaborative worm containment proposals and present some of the results of our DETER emulation experiments. In the first one, proactive worm containment (PWC), security agents block all suspicious hosts on the network on receiving alerts of a worm and run "relaxation analysis" on those blocked hosts afterwards. Emulation experiments will evaluate PWC's ability to stop the propagation of fast local worms and to reduce scan traffic of fast global scanning worms. The second proposal, which detects and contains a scanning worm based on the concept of dark port, focuses on stealthy worms that target only specific local networks or enterprise networks. Emulation experiments run on the DETER testbed demonstrate the efficiency of local scanning worms and their elevated threat to enterprise networks. The effectiveness of a collaborative containment strategy based on dark port detection is evaluated using DETER emulation and compared with that of individual address blacklisting.
Systems of Asynchronously Operating Modules
Authors: A. D. Friedman, P. R. Menon
Venue: IEEE Transactions on Computers (1971)

This note considers the operation of systems composed of interconnected asynchronously operating modules and shows that some such systems may enter "blocking conditions" in which no module can change state. The model considered applies specifically to asynchronous systems in which each module is controlled only by its neighbors, but may also be relevant to other systems such as parallel computational schemes. We also demonstrate a procedure that may speed up computation and we show that the function computed by a given network may depend upon the initial state.
A Bayesian method for guessing the extreme values in a data set?
Authors: Mingxi Wu, Christopher Jermaine
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

For a large number of data management problems, it would be very useful to be able to obtain a few samples from a data set, and to use the samples to guess the largest (or smallest) value in the entire data set. Min/max online aggregation, top-k query processing, outlier detection, and distance join are just a few possible applications. This paper details a statistically rigorous, Bayesian approach to attacking this problem. Just as importantly, we demonstrate the utility of our approach by showing how it can be applied to two specific problems that arise in the context of data management.
RARE: An Energy-Efficient Target Tracking Protocol for Wireless Sensor Networks
Authors: Elizabeth Olule, Guojun Wang, Minyi Guo, Mianxiong Dong
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Energy efficiency for target tracking in wireless sensor networks is very important and can be improved by reducing the number of nodes involved in communications. We propose two algorithms, RARE-Area and RARE-Node to reduce the number of nodes participating in tracking and so increase energy efficiency. The RARE-Area algorithm ensures that only nodes that receive a given quality of data participate in tracking and the RARE-Node algorithm ensures that any nodes with redundant information do not participate in tracking. Simulation studies show significant energy savings are obtained with implementation of either the RARE-Area algorithm alone or both RARE-Area and RARE-Node algorithms together.
Intelligent Recognizing and Classifying of Tubular-shaped Objects: A Case Study of Mystical Tibetan Dzis
Authors: Check-Teck Foo, Su-Xin Wong
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Human recognition of patterns is one underlying key to knowledge development. Yet pattern recognition as the basis for generating knowledge is only recently emphasized in the literature. It is through classification of objects (eg. butterflies) and establishing taxonomy that fields of knowledge are established. Also intelligence emerges through human beings cognizant of types within a typology. The empirical meaning of artificial intelligence (AI) in this cognitive sense is explored here: recognizing and then classifying objects through identifying patterns. Here we document our attempts to model expertise to construct a typology of Tibeatan dzis. We simulate expertise that required visual, cognitive and memory accessing capabilities. Whilst there is adequate literature on pattern recognition of two-dimensional objects (eg. Chinese characters), there are relatively fewer studies on the construction of artificially intelligent systems of 3D objects. Yet in the real world, objects that are classified are more often three-dimensional than of the two dimensions.