ppxscal/embedding_network huggingface dataset:
New Applications
Venue: Computer (1972)

A small computer has joined the artists and craftsmen at Michael Machet Associates to help meet the growing demand for Tiffany-inspired stained glass lampshades and panels. "Our sales jumped 40 percent last year," said Michael W. Machet, company president. "By installing the IBM System/3 Model 10, we have been able to meet the increased demand for our products by processing orders faster and planning production better." 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
Scheme-79 Lisp on a Chip
Authors: G. J. Sussman
Venue: Computer (1981)

The Scheme-79 single-chip microcomputer implements an automatic storage allocation system and an interrupt facility to support direct interpretation of a variant of the Scheme dialect of Lisp.
The Interpretation of Meta Grammars Describing Syntax-Directed Interpreters Using an Attribute Grammar Interpreter
Authors: J. Kontos
Venue: IEEE Transactions on Software Engineering (1982)

A syntax-directed interpreter of attribute grammars is applied to interpret meta grammars describing translators. A specific example is used which concerns the formal description of the same syntax-directed interpreter of attribute grammars for illustration of our approach.
Improvement on Network Capacity for Voice Services over HCCA
Authors: Wenpeng Yuan, Guangxi Zhu, Gan Liu, Di Wu
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

In the 802.11e protocol, voices traffic takes a higher priority than other services. However, there are still some technical problems existing in VoIP services over WLAN: (a) low voice capacity caused by the inherent characteristic of WLAN and heavy packet headers from upper layers and (b) unacceptable voice delay in the presence of coexisting with other applications. To address these problems, in this paper we propose several schemes to better manage the limited network capacity of VoIP network. In the proposed schemes, every voice stream occupies a fixed bandwidth to avoid collision between packets. With the Packet Header Compression technology, the overhead of voice packets is greatly reduced. Under various PHY rates, we investigate the performance of our proposed scheme over various voice codecs. Compared to HCCA, the proposed scheme greatly advances the maximum throughput of voice streams.
The TPR*-tree: an optimized spatio-temporal access method for predictive queries
Authors: Yufei Tao, Dimitris Papadias, Jimeng Sun
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

A predictive spatio-temporal query retrieves the set of moving objects that will intersect a query window during a future time interval. Currently, the only access method for processing such queries in practice is the TPR-tree. In this paper we first perform an analysis to determine the factors that affect the performance of predictive queries and show that several of these factors are not considered by the TPR-tree, which uses the insertion/deletion algorithms of the R*-tree designed for static data. Motivated by this, we propose a new index structure called the TPR*- tree, which takes into account the unique features of dynamic objects through a set of improved construction algorithms. In addition, we provide cost models that determine the optimal performance achievable by any data-partition spatio-temporal access method. Using experimental comparison, we illustrate that the TPR*-tree is nearly-optimal and significantly outperforms the TPR-tree under all conditions.
A New Fuzzy Logic Image De-noising Algorithm Based on Gradient Detection
Authors: Liangrui Tang, Hongting Wang, Bing Qi
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

This paper presents a gradient detecting fuzzy logic-based algorithm (GDFF) for image de-nosing issue. For the first step, GDFF selects different fixed filtering sub-windows to process the input signal by linear de-noising. And then it modifies the de-noised results by a set of membership functions established by making full use of edge information. Finally, these signals are summed with weight to accomplish the image de-noising. Experiments illustrate that, GDFF performs a better de-noising effect with PSNR Gain 2.65-10.34dB compared with WFM and FIRE, when noise probability exceeds from 0.5 to 0.8. Furthermore, GDFF exhibits more effective performance both in reserving image edge and in removing noise.
An Efficient Method for Attribute Reduction in Incomplete Information Systems
Authors: Renpu Li, Yongsheng Zhao, Fuzeng Zhang, Lihua Song
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Attribute reduction is an important issue of data mining. In this paper a novel method based on rough sets is provided for attribute reduction in incomplete information systems. Through a transformation technique, an incomplete system is firstly converted into a new and simpler system and then reducts are obtained from the transformed system. It is proved by theorem that the transformed system has the same reducts as the previous one. Experiments show that the proposed method is more efficient on reduct computation of incomplete information systems.
Influence of Imaging Condition on Matching Point Detection
Authors: Tomoki Hodokuma, Naru Hirata, Hirohide Demura, Noriaki Asada
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Matching point detection between a template image and a target image is a key for mosaicking of two or more images. Robustness of a common of tem- plate matching algorithm, Sequential Similarity Detec- tion Algorithm (SSDA), was evaluated. Influence of imaging condition, such as solar azimuth, solar ele- vation, and image azimuth, is also investigated. We particularly consider a production of regional mosaics of the lunar surface from images obtained by an explo- ration satellite. A Japanese lunar explorer SELENE is going to be launched in the summer of 2007. Thus, synthesized lunar images with various imaging condi- tions are used as test data in this study. Effects on matching results of features appeared in the templates are also evaluated to know how we choose the location of a template in lunar images to obtain the best match- ing result.
WCOMP: Waveform Comparison Tool for Mixed-signal Validation Regression in Memory Design
Authors: Peng Zhang
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

The increasing effort on full-chip validation constrains design cost and time-to-market. A waveform comparison tool named WCOMP is presented to automate mixed-signal validation regression in memory design. Unlike digital waveform comparison tools, WCOMP compares mixed-signal waveforms for functional match instead of graphical match, which tally with the requirements of full-chip validation regression. Simulations with different regression runs, process parameters, voltages and temperatures can be functionally compared. The methods are proved to be effective in Intelreg Flash memory design.
Convergence Transforms Digital Home: Techno-Economic Impact
Authors: Mahbubul Alam, Neeli Rashmi Prasad
Venue: Wireless Personal Communications: An International Journal (2008)

This paper discusses the past, the present, and the future of digital home and in particular, how convergence transforms home networking. It describes technology adoption-, consumer-, and behavioural-trends and discusses the business impact from consumer demand for "living in real-time" and from the convergence of applications, services, networks, and terminals. With the explosion of mobile and broadband usage with high Wi-Fi penetration at home and emerging trends such as online social networks, mashups, blogs, etc. will create unparalleled value to customers that will disrupt existing business models of fixed and mobile operators. Consumers expect access to applications and services instantaneously, irrespective of the location, place and all at real-time. Telco's and business are beginning to understand how those behavioural trends, and convergence could have major impact on their service offering, marketing, products, price, go-to-market and how they can leverage these trends to attract and seek global talents. Proliferation of IP enabled device and applications will lead to the development of IP-based home networking in the areas of personal communications, network entertainment, communications and monitoring management. Finally, a new law was established that will drive the future development of digital home, E = mc3, where E equates to Entertainment experience, m for media (content) and c3 for convergence of communications, computing technologies and consumer electronics. Success of home networking will heavily depend on industries ability to hide networks and systems complexities from end-users where simplicity of the user interface is the key.
A Design Procedure for Gradient Operators on Hexagonal Images
Authors: Bryan Gardiner, Sonya Coleman, Bryan Scotney
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

Image processing tasks have traditionally involved the use of square operators on regular rectangular image lattices. For many years the concept of using hexagonal pixels for image capture has been investigated, and several advantages of such an approach have been highlighted. Therefore, we present a design procedure for hexagonal gradient operators, developed within the finite element framework, for use on hexagonal pixel based images. In order to evaluate the approach we generate pseudo hexagonal images via resizing and resampling which also allows us to present results visually without the use of hexagonal lattice capture or display hardware. We provide comparative results with existing gradient operators, both rectangular and hexagonal.
A Fast Path Planning Algorithm for Vehicle Navigation System
Authors: Bi Jun, Guang-yu Zhu, Zheng-yu Xie
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

This paper proposes an algorithm for seeking the shortest path between two nodes in city's road net according to the characteristics of the net. The algorithm takes advantage of the theories of bidirectional search, projection, minimum angle and binary tree. According to the algorithm analysis , the algorithm can reduce seeking space and raise seeking speed greatly, and its time complexity can not exceed O(N), while N is the number of road network nodes. The application results show that the algorithm has good practicability.
Indoor sound field feature matching for robot's location and orientation detection
Authors: Jwu-Sheng Hu, Wei-Han Liu, Chieh-Cheng Cheng
Venue: Pattern Recognition Letters (2008)

In this work, an indoor sound field feature matching method is proposed and is applied to detect a mobile robot's location and orientation. The sound field feature, captured from a sound source to a pair of microphones, contains the dynamic of the propagation path. Because of the complexity of indoor environment, the features from different path can be distinguished using appropriate models. Gaussian mixture models are utilized in this paper to characterize the phase difference and magnitude ratio distributions between the microphone pair in consecutive data frames. The application provides an alternative thinking compared with traditional methods such as direction of arrival (DOA) using propagation delay. They usually suffer from reverberation, non-line-of-sight and microphone mismatch problems. The experimental results show the method not only has a high recognition rate for robot's location and orientation, but also is robust against environmental noise.
Placing Multicast Proxies for Internet Live Media Streaming
Authors: Jun Guo, Sanjay Jha
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Placing multicast proxies on the Internet can largely reduce the delivery delay of Internet live media streaming using overlay multicast mechanisms. In this paper, we propose a new approach to address the issue of proxy placement in an overlay multicast network. The task is to decide an optimal placement of multicast proxies in the overlay multicast network so as to minimize the average end-to-end delay of the overlay skeleton tree subject to out-degree balancing constraint and maximum delivery delay bound. We present two heuristic methods for this proxy placement problem. Experimental results demonstrate that proxy placement due to our proposed approach can greatly improve the overlay multicast routing performance. In comparison with an existing approach commonly used for replica placement in content distribution networks, our proposed approach significantly improves the end-to-end latency performance of overlay multicast networks, and is not much sensitive to network dynamics.
Distance on a Hexagonal Grid
Authors: E. Luczak
Venue: IEEE Transactions on Computers (1976)

A simple formula is derived for the distance between two points on a hexagonal grid, in terms of coordinates with respect to a pair of oblique axes.
Menus for Scheme
Authors: Morton Goldberg
Venue: ACM SIGPLAN Lisp Pointers (1988)

Menus for Scheme is a trademark of Morton Goldberg. Microsoft, MS-DOS, and MS are registered trademarks of Microsoft Corporation. CompuServe is a registered trademark of CompuServe Incorporated 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
Learning Horn Expressions with LOGAN-H
Authors: Marta Arias, Roni Khardon, Jérôme Maloberti
Venue: The Journal of Machine Learning Research (2007)

The paper introduces LOGAN-H  a system for learning first-order function-free Horn expressions from interpretations. The system is based on an algorithm that learns by asking questions and that was proved correct in previous work. The current paper shows how the algorithm can be implemented in a practical system, and introduces a new algorithm based on it that avoids interaction and learns from examples only. The LOGAN-H system implements these algorithms and adds several facilities and optimizations that allow efficient applications in a wide range of problems. As one of the important ingredients, the system includes several fast procedures for solving the subsumption problem, an NP-complete problem that needs to be solved many times during the learning process. We describe qualitative and quantitative experiments in several domains. The experiments demonstrate that the system can deal with varied problems, large amounts of data, and that it achieves good classification accuracy.
Methodology and Experimental Setup for the Determination of System-level Dynamic Reconfiguration Overhead
Authors: Kyprianos Papadimitriou, Antonis Anyfantis, Apostolos Dollas
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

Dynamic reconfiguration is gaining popularity [2], [4] but it may cause degradation of overall execution time due to the time to download the bitstream before an application starts execution of the new configuration. Thus evaluation of its performance becomes an interesting area [3]. In this work we include an analysis of the reconfiguration time by defining the delays that add up to it. An experimental setup is deployed that can be used for performance evaluation of applications implemented with dynamic reconfiguration, as well as of mechanisms developed to reduce reconfiguration overhead.
A Processor Generation Method from Instruction Behavior Description Based on Specification of Pipeline Stages and Functional Units
Authors: Takeshi Shiro, Masaaki Abe, Keishi Sakanushi, Yoshinori Takeuchi, Masaharu Imai
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

This paper proposes a method for generating a pipeline processor from the behavior description of instructions. In the proposed method, a micro-operation description is generated by complementing the behavior description with specifications of the pipeline stages, such as the number of pipeline stages, the attributes of each stage. From the behavior description, software development tools, such as an instruction-set simulator (ISS), a compiler, and an assembler can be generated, and a synthesizable HDL description of a processor can be generated from the micro-operation description. Compared with the conventional method of writing individual descriptions, the proposed method can dramatically reduce the code size of the architectural description language and the design time without degrading the design quality. As a result, a design space exploration can be performed efficiently.
Dynamic semantic retrieval space reconstruction for WWW environments
Authors: Xing Chen, Yasushi Kiyoki
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

Semantic retrieval for Web pages is an important issue in WWW environments. One of the typical methods for implementing semantic retrieval is to map Web pages onto an orthogonal space according to contents of Web pages. In this paper, we represent a space creation method for semantic retrieval for WWW environments. In this method, the orthogonal space, which is referred to as the retrieval space, is created by using sample Web pages. A sample Web page is selected from a Web page cluster as the typical Web page to stand all the Web pages in the cluster. As Web pages change rapidly every day, that is, new Web pages appear and some existing Web pages disappear, the sample Web pages have to be reselected dynamically according to the changes of Web pages. Following the changes of sample Web pages, the retrieval space has to be reconstructed dynamically. In general, the retrieval space reconstruction is a time consuming process because all the retrieval candidates in the space have to be re-mapped to the reconstructed retrieval space. In this paper, we present a mechanism for reducing the processing overhead of the retrieval space reconstruction. In our mechanism, we only reconstruct some parts of the retrieval space which are related to the modified sample Web pages. Furthermore, we present a fast search method to search Web pages which are needed to be remapped onto the retrieval space. By using these methods, our system is efficient for the semantic retrieval for Web pages in the WWW environment.
On the Use of "Importance Weights" in Assessing Subsystem Reliability
Authors: E. G. Mallach
Venue: IEEE Transactions on Computers (1973)

The importance of obtaining correct circuit outputs may vary from one input to another, along a continuum of "importance weights." Assigning such weights introduces a concept of degraded operation, where some relatively unimportant outputs may be in error. A simple procedure is given for assessing reliability using these weights.
A note on the empirical evaluation of intermediate recombination
Authors: David B. Fogel, Hans-Georg Beyer
Venue: Evolutionary Computation (1995)

The effectiveness of intermediate recombination in evolution strategies is analyzed in light of the typical procedure of initializing trial solutions uniformly about the global optimum of benchmark functions. Analysis indicates that this procedure may predispose results in favor of intermediate recombination.
A Generic Framework for Target-Specific Transformation Operators in XML Transformation Languages
Authors: Daniel Fotsch
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

A key issue in exchanging XML-based data is their transformation. However, available transformation languages are generally still low-level. Their low-level transformation operators do not reflect the target language concepts and terminologies. Moreover, transformation correctness is usually beyond the scope of such operators. This paper presents a generic framework which offers higher-level transformation operators. Since it allows to express the transformation operators on the specific target languages level, the developer can more easily understand, validate, and modify the transformation. Based on a given XML schema of the target XML language, the necessary level transformation definitions are generated by the framework. In addition, transformation constraints are taken into consideration; besides transformation corresponding validation components are constructed. A showcase demonstrates how to generate the required components for BPELspecific transformation operators and how to use them in XSLT.
Selecting Capacities in Computer Communication Systems
Authors: K. M. Chandy
Venue: IEEE Transactions on Software Engineering (1977)

This paper considers the selection of capacities, in two classes of open queueing network models of computer communication systems: 1) local-balanced queueing networks with multiple classes of customers and 2) the Reiser-Kobayashi diffusion approximation model. The problem of selecting optimal bandwidths for communication lines and switches and computing machinery is difficult due to 1) the economy of scale exhibited by components (i.e., the bandwidth per dollar increases with the total cost of the component) and 2) the discrete nature of computer/communication components (for instance it is possible to lease communication lines with 2400-Bd or 4800-Bd band-widths but not one with a 2401.3-Bd bandwidth). This paper develops aun algorithm to select servers taking both of these characteristics of server costs into account. The contribution of this paper is to discuss 1) the optimization of more general network models with 2) the consideration of more realistic tariffs and 3) more constraints on network behavior than were previously analyzed.
Conjoint Analysis to Measure the Perceived Quality in Volume Rendering
Authors: Joachim Giesen Klaus Mueller, Eva Schuberth Lujin Wang Peter Zolliker
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Visualization algorithms can have a large number of parameters, making the space of possible rendering results rather high-dimensional. Only a systematic analysis of the perceived quality can truly reveal the optimal setting for each such parameter. However, an exhaustive search in which all possible parameter permutations are presented to each user within a study group would be infeasible to conduct. Additional complications may result from possible parameter co-dependencies. Here, we will introduce an efficient user study design and analysis strategy that is geared to cope with this problem. The user feedback is fast and easy to obtain and does not require exhaustive parameter testing. To enable such a framework we have modified a preference measuring methodology, conjoint analysis, that originated in psychology and is now also widely used in market research. We demonstrate our framework by a study that measures the perceived quality in volume rendering within the context of large parameter spaces.