ppxscal/embedding_network huggingface dataset:
Matched Filter Computation on FPGA, Cell and GPU
Authors: Zachary K. Baker, Maya B. Gokhale, Justin L. Tripp
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

The matched filter is an important kernel in the processing of hyperspectral data. The filter enables researchers to sift useful data from instruments that span large frequency bands and can produce Gigabytes of data in seconds. In this work, we evaluate the performance of a matched filter algorithm implementation on an FPGA-accelerated co-processor (Cray XD-1), the IBM Cell microprocessor, and the NVIDIA GeForce 7900 GTX GPU graphics card. We provide extensive discussion of the challenges and opportunities afforded by each platform. In particular, we explore the problems of partitioning the filter most efficiently between the host CPU and the co-processor. Using our results, we derive several performance metrics that provide the optimal solution for a variety of application situations.
Multimedia Reasoning with Natural Language Support
Authors: Stamatia Dasiopoulou, Johannes Heinecke, Carsten Saathoff, Michael G. Strintzis
Venue: Proceedings of the International Conference on Semantic Computing (2007)

In this paper we present an approach that combines multimedia reasoning and natural language processing for the semantic integration of automatic and manual image annotations based on domain ontologies. We discuss how to apply natural language processing to transform natural language descriptions and queries into an ontological representation that allows users to formulate formal semantics in an intuitive manner, without the need to cope with complex ontological structures and unwieldy user interfaces. Illustrative experimental examples demonstrate the added value.
Research of Technology on Making Linux Interrupts Tasked
Authors: Zhao Hong-wei, Fang Ke-chi, Zang Xue-bai
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Linux2.6 has done much work on improving its real-time performance, a new scheduling algorithm with a O(1) time complexity and preemptive kernel have been included. But there are still some disadvantages in its interrupt mechanism. a real-time task may be busy handling interrupts , so it can not complete itself in the expected time. After analyzing its interrupts mechanism, a new solution was designed to make interrupts handle as a kernel thread. A special interrupt can be handled immediately if only it has a higher priority, otherwise it will return and a service thread will take control of it. The interrupt handling process acts as requesting and serving pattern. As test result shows, this solution successfully prevents real-time tasks from disturbing of interrupts, and helps a lot on improving real-time performance.
Predictive Multiple Metrics in Proactive Mobile Ad Hoc Network Routing
Authors: Zhihao Guo, Behnam Malakooti
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

In this paper we present a MANET proactive routing enhancement scheme by comprehensive evaluation of multiple dynamic routing metrics, including delay, energy cost, and link stability. We developed efficient routing metric prediction methods: predicting delay and energy using double exponential smoothing, and predicting link stability using a heuristic based on the normal-like distributions of the link lifetimes in typical MANET mobility scenarios. The routing metrics predictions are incorporated with regular routing information exchanges. On each node, routing table is constructed by a modified version of Dijkstra's algorithm, which evaluates the predicted metrics values compositively. We integrated such a multi-metric prediction/evaluation mechanism into OLSR and name it OLSR_MC. We show by simulation that OLSR_MC is more adaptive to the network dynamics and therefore is able to improve performance significantly on multiple routing objectives, including higher packet delivery ratio, shorter average end-to-end delay, and prolonged network energy lifetime.
Fair Load-Balancing on Parallel Systems for QoS
Authors: L. F. Orleans, P. N. Furtado
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Many of the load-balancing algorithms used in parallel systems do not have a concern about response times: tasks (or requests) are simply dispatched to a server, which provides no guarantees about their execution times. When there is a maximum acceptable response time (i.e. deadline) for tasks to be executed, the consequences caused by the adoption of traditional algorithms for load-balancing can be catastrophic: when the system is under heavy loads, a huge amount of tasks miss their deadlines, even the faster ones. Also, the number of longer tasks that ends is very small -- near to zero in all cases. In this paper we discuss why the traditional algorithms fail to provide the intended QoS capacity. Then, we present a new algorithm, "On-demand Restriction for Big Tasks (ORBITA)", which is proved, by simulation, to be a fair alternative for stressed systems since tasks of all durations have a chance to complete their execution before their deadlines are reached.
Interactive Tree Comparison for Co-located Collaborative Information Visualization
Authors: Petra Isenberg, Sheelagh Carpendale
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

In many domains increased collaboration has lead to more innovation by fostering the sharing of knowledge, skills, and ideas. Shared analysis of information visualizations does not only lead to increased information processing power, but team members can also share, negotiate, and discuss their views and interpretations on a dataset and contribute unique perspectives on a given problem. Designing technologies to support collaboration around information visualizations poses special challenges and relatively few systems have been designed. We focus on supporting small groups collaborating around information visualizations in a co-located setting, using a shared interactive tabletop display. We introduce an analysis of challenges and requirements for the design of co-located collaborative information visualization systems. We then present a new system that facilitates hierarchical data comparison tasks for this type of collaborative work. Our system supports multi-user input, shared and individual views on the hierarchical data visualization, flexible use of representations, and flexible workspace organization to facilitate group work around visualizations.
GridDB: a data-centric overlay for scientific grids
Authors: David T. Liu, Michael J. Franklin
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

We present GridDB, a data-centric overlay for scientific grid data analysis. In contrast to currently deployed process-centric middleware, GridDB manages data entities rather than processes. GridDB provides a suite of services important to data analysis: a declarative interface, type-checking, interactive query processing, and memoization. We discuss several elements of GridDB: workflow/data model, query language, software architecture and query processing; and a prototype implementation. We validate GridDB by showing its modeling of real-world physics and astronomy analyses, and measurements on our prototype.
Semiconductor Rams - a Status Report
Authors: G. E. Moore
Venue: Computer (1971)

Semiconductor data storage offers many advantages. These include: 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
An Improved Differential Evolution Algorithm for the Vehicle Routing Problem With Simultaneous Delivery and Pick-up Service
Authors: Erbao Cao, Mingyong Lai
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

The vehicle routing problem with simultaneous delivery and pick-up (VRP-SDP) is a variant of the classical vehicle routing problem (VRP) where clients require simultaneous delivery and pick-up. Deliveries are supplied from a single depot at the beginning of the vehicle's service, while pick-up loads are taken to the same depot at the conclusion of the service. One important characteristic of this problem is that a vehicle's load in any given route is a mix of delivery and pick-up loads, at the same time in any route the vehicle can not violate some constraints ,for example the vehicle capacity and traveling distance constraints. In this paper, VRP-SDP is presented from the point of strategic view that combined the logistics and reverse logistics (bidirectional logistics). We constructed a universal mixed integer programming mathematic model of VRP-SDP in detail, it can transform into other classical vehicle routing problems by setting different parameters. An improved differential evolution algorithm (IDE) is proposed. In operation process, we firstly adopted the novel decimal coding to construct initial population, and then some improved differential evolution operators were adopted as the main optimizing scheme, such as adopted a real number coding method based on integer order criterion in mutation operation, a punishment function was designed to dispose constraints, and in crossover operation the crossover probability was self-updated with iteration. The computer simulations are used to compare the performance of the proposed method with genetic algorithm (GA), numerical results show that the performance of the proposed method is better than GA.
An Efficient Shared Learning Scheme for Layered Video Streaming over Application Layer Multicast
Authors: Jongmin Park, Seungik Lee, Yangwoo Ko, Dongman Lee
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Layered video multicast such as RLM (Receiver- driven layered multicast) is a promising technique for delivering streaming video to a set of heterogeneous receivers over ALM (Application Layer Multicast) as well as over IP multicast. However, this approach may suffer from unnecessary fluctuation of video quality due to overlapped and failed join-experiments. Though a shared learning scheme was introduced to resolve these problems in IP multicast-based layered video streaming, it may cause high control overhead and slow convergence problem when used with ALM. In this paper, we propose a new shared learning scheme for ALM-based layered video multicast which reduces control overhead and convergence latency while keeping the number of fluctuation reasonably small. Through the analysis of link sharing in ALM, we redefine the range of receivers that are affected by overlapped or failed join-experiments and incorporate it into the proposed scheme. The simulation results show that the proposed scheme performs better than an ALM-based layered video multicast with shared learning in terms of control overhead and convergence latency.
Betweenness centrality as an indicator of the interdisciplinarity of scientific journals
Authors: Loet Leydesdorff
Venue: Journal of the American Society for Information Science and Technology (2007)

In addition to science citation indicators of journals like impact and immediacy, social network analysis provides a set of centrality measures like degree, betweenness, and closeness centrality. These measures are first analyzed for the entire set of 7,379 journals included in the Journal Citation Reports of the Science Citation Index and the Social Sciences Citation Index 2004 (Thomson ISI, Philadelphia, PA), and then also in relation to local citation environments that can be considered as proxies of specialties and disciplines. Betweenness centrality is shown to be an indicator of the interdisciplinarity of journals, but only in local citation environments and after normalization; otherwise, the influence of degree centrality (size) overshadows the betweenness-centrality measure. The indicator is applied to a variety of citation environments, including policy-relevant ones like biotechnology and nanotechnology. The values of the indicator remain sensitive to the delineations of the set because of the indicator's local character. Maps showing interdisciplinarity of journals in terms of betweenness centrality can be drawn using information about journal citation environments, which is available online.
PC Hardware Developments and CAD Software
Authors: Tom Lazear
Venue: IEEE Computer Graphics and Applications (1987)

Not too long ago, PC-based CAD was used only for simple drafting functions by companies that couldn't afford anything better. Now it has become a force driving the CAD industry, and manufacturers of traditional mini and mainframe-based systems are playing their respects by marketing PC-CAD systems of their own. AS much as anything else, new computer and graphics hardware developed in the past few years has made this shift possible.
Unsafe Standardization
Authors: Martyn Thomas
Venue: Computer (2007)

Software safety standards should lead the industry to use the best computer science and software engineering possible to make safety claims for which we can provide credible evidence.
Heterogeneous Floorplanner for FPGA
Authors: Love Singhal, Elaheh Bozorgzadeh
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

The current generations of FPGA comprise of many specialized hardware cores, like embedded processors, multipliers, RAMs and FIFOs, along with the regular arrays of reconfigurable logic. On any FPGA device, these embedded cores are located at fixed locations only. This makes the task of floorplanning for the applications with heterogeneous components very difficult. Recently, some researchers have started looking into this problem of heterogeneous floorplanning on FPGA. However, all these work suffer from one fundamental flaw which affects the quality of solutions leading to higher device areas or excessively high runtime. In this paper, we propose a heterogeneous floorplanner for the FPGA, HPlan, which is fast and highly efficient in finding floorplans of variety of resources. We present a case study of a real implementation on Xilinx Virtex device. The proposed floorplanner could effectively implement the design with tight resource constraints whereas the traditional floorplanner could not find a feasible floorplan.
De-blurring Algorithm for Online Particle System
Authors: Weixing Wang, Jiangyan Xu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In order to quickly and accurately estimate average size of densely packed aggregate particles on a moving conveyor belt, one problem is motion blur. This paper presents a novel algorithm to restore the blurred image accurately. Moving object or camera motion can cause motion blur in conventional single-exposure photography. Because the exposure time is short, the motion can be seen as constant-speed straight-line movement.
Satya: a reputation-based approach for service discovery and selection in service oriented architectures
Authors: Alexandre G. Lages, Luci Pirmez, Paulo F. Pires, Flávia C. Delicato
Venue: Proceedings of the 9th annual ACM international workshop on Web information and data management (2007)

We present SATYA, a system that computes a reputation value for Web service providers in order to enhance the service discovery and selection process increasing reliability in SOA transactions. In this work, objective values of service evaluations supplied by monitoring entities are used along with subjective evaluations supplied by service consumers. The objective and subjective values are compared in order to: (i) validate subjective evaluations; (ii) minimize the degree of subjectivity of computed reputation values; and (iii) discover consumers' preferences in terms of QoS metrics. By assigning Web services a trustable reputation value, SATYA enhances the service descriptions provided by registries with additional information to be used during the service discovery phase.
Labeling schemes for weighted dynamic trees
Authors: Amos Korman, David Peleg
Venue: Information and Computation (2007)

A Distance labeling scheme is a type of localized network representation in which short labels are assigned to the vertices, allowing one to infer the distance between any two vertices directly from their labels, without using any additional information sources. As most applications for network representations in general, and distance labeling schemes in particular, concern large and dynamically changing networks, it is of interest to focus on distributed dynamic labeling schemes. The paper considers dynamic weighted trees where the vertices of the trees are fixed but the (positive integral) weights of the edges may change. The two models considered are the edge-dynamic model, where from time to time some edge changes its weight by a fixed quanta, and the increasing-dynamic model in which edge weights can only grow. The paper presents distributed approximate distance labeling schemes for the two dynamic models, which are efficient in terms of the required label size and communication complexity involved in updating the labels following the weight changes.
Hidden Markov Models for Online Handwritten Tamil Word Recognition
Authors: Bharath A., S. Madhvanath
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

Hidden Markov Models (HMM) have long been a popu- lar choice for Western cursive handwriting recognition fol- lowing their success in speech recognition. Even for the recognition of Oriental scripts such as Chinese, Japanese and Korean, Hidden Markov Models are increasingly being used to model substrokes of characters. However, when it comes to Indic script recognition, the published work em- ploying HMMs is limited, and generally focussed on iso- lated character recognition. In this effort, a data-driven HMM-based online handwritten word recognition system for Tamil, an Indic script, is proposed. The accuracies obtained ranged from 98% to 92.2% with different lexicon sizes (1K to 20K words). These initial results are promising and warrant further research in this direction. The results are also encouraging to explore possibilities for adopting the approach to other Indic scripts as well.
Constructing a Reference Model of a Grouped-Metadata Object and Its Change Model
Authors: Liangli Ma, Yongjie Li
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

Component metadata is one of the most effective methods to improve the testability of component-based software. We give a formal definition of component, and summarize meanings of component metadata. Based on these, an idea of Grouped-Metadata Object (GMO) is introduced, which is divided into two types, respectively named descriptive metadata and operative metadata. And a general framework of descriptive metadata and operative metadata is further given, which is consisted of several groups. Each group includes several attributes, and their meanings are described. Furthermore, we give a formal reference model of GMO using class diagram of UML. And change model in GMO is described. Here we introduce a concept of Method Dependency Graph(MDG) to implement mapping component changes to component interface changes. Then the changes are reflected in relevant attributes in GMO provided to component users in order to facilitate regression testing. Finally the case study based on previous model is done, and the corresponding results are given. All these show effectively that the models we presented are valid and helpful for component-based software testing.
Soft-Sensing Modeling Based on Multi-Phases for Fermentation Process
Authors: Qiangda Yang, Fuli Wang, Yuqing Chang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

For the process of Nosiheptied fermentation, a new method for soft-sensing modeling by phases is presented. By using the state equations established for the Nosiheptied fermentation process, the secondary variables are determined according to the inverse system theory. Then, fuzzy c-means clustering algorithm and neural network are used for phase identification, and for each phase, a local neural network model for soft sensing is developed. Finally, the estimation is implemented by computing the sum of outputs of the developed local models weighted by the corresponding degrees of membership from the phase identification. The testing result shows the effectiveness of the approach to the development of the soft-sensing model.
Marketing event optimization
Authors: D. A. Selby
Venue: IBM Journal of Research and Development (2007)

We present an algorithm for performing multi-channel marketing event optimization. Previous related work, which made use of a complex mixed-integer linear program to generate a marketing plan, was capable of providing plans for only groups of individuals, referred to as micro-segments, and considered only the direct mail channel. Today, most firms use multiple channels, such as e-mail, call centers, and direct mail, to contact customers with marketing events. Our method successfully overcomes many past restrictions and reduces the run time for the marketing scenarios so that computation can take place on a daily basis. The algorithm used is an advanced form of a greedy heuristic which--given a set of marketing events by channel, a set of individuals, some constraints, and the concepts of saturation and cannibalization--determines the optimal set of marketing events to present to an individual customer. The algorithm is embedded in a solution that is designed to operate as an interactive what-if scenario planner, or as a batch-oriented job that can continually maintain each customer's future contact plans in an optimal fashion.
The likelihood ratio test for hidden Markov models in two-sample problems
Authors: Jörn Dannemann, Hajo Holzmann
Venue: Computational Statistics Data Analysis (2008)

The asymptotic distribution of the likelihood ratio test statistic in two-sample testing problems for hidden Markov models is derived when allowing for unequal sample sizes as well as for different families of state-dependent distributions. In both cases under regularity conditions the limit distribution is a standard @g^2-distribution, and in particular does not depend on the ratio of the distinct sample sizes. In a simulation study, the finite sample properties are investigated, and the methodology is illustrated in an application to modeling the movement of Drosophila larvae.
Computer Graphics: Reaching the User
Authors: W. Myers
Venue: Computer (1981)

New techniques color table animation, stereoscopic graphics, procedural drawing, and random irregularity are bringing less costly motion, depth, detail, and warmth to interactive displays. 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