ppxscal/embedding_network huggingface dataset:
Deep middleware for the divergent Grid
Authors: Paul Grace, Geoff Coulson, Gordon S. Blair, Barry Porter
Venue: Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware (2005)

Next-generation Grid applications will be highly heterogeneous in nature, will run on many types of computer and device, will operate within and across many heterogeneous network types, and must be explicitly configurable and runtime reconfigurable. We refer to this future Grid environment as the "divergent Grid". In this paper, we propose a "deep middleware" approach to meeting key requirements of the divergent Grid. Deep middleware reaches down into the network to provide highly flexible network support that underpins a rich, extensible and reconfigurable set of application-level "interaction paradigms" (such as publish-subscribe, multicast, tuple spaces etc.). In our Gridkit middleware platform, these facilities are encapsulated in two key component frameworks: the interaction framework and the overlay framework, which are the subject of this paper. The paper also evaluates the two frameworks in terms of their configurability (e.g. ability to be profiled for different device types) and reconfigurability (e.g. to self-optimise as the environment changes).
CommVault Storage Policies: An in depth guide to storage policy design and implementation
Authors: Frank Celauro, Madelyn Moalam, Evan Benjamin, M. C. Dahlmeier
Venue:  (2008)

CommVault Storage Policies provides an in-depth view of storage policy design and implementation. Topics are covered in detail and focus on conceptual aspects of storage policies, retention, and data stream management. Use case scenarios provide real world solutions and step-by-step design strategies for environments of all sizes. This book can provide value for new users to CommVault software as well as experienced veterans. As always, the definitive guide to CommVault's product suite is, and will always be, the latest version of CommVault's Online Books available which can be found on http://documentation.commvault.com. As enhancements and new features are being introduced regularly, if a conflict exists between statements made in this book and the most recent Online Books, the latest version of the later will always be the authoritative source.
A microcomputer system for color video picture processing
Authors: Yoshikuni Okawa
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

A color picture processing system is proposed. It consists of a microcomputer and a color video recorder. A picture is taken by a portable videotape recorder and a camera on cassette tapes in the field and brought back to the laboratory where the processing computer is installed. The scenes are replayed on the videotape player on the monitor TV screen, from which signals are stolen by three A-D converters (one each for R, G, and B) and stored in the memory of the microcomputer. The software package provides several commands which make it possible to process images on the CRT screen by man-machine interaction. A functional description of the commands is stated in some detail. One example of the application of this system is briefly described.
Image composition schemes for sort-last polygon rendering on 2D mesh multicomputers
Authors: Tong-Yee Lee, C. S. Raghavendra, John B. Nicholas
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

In a sort-last polygon rendering system, the efficiency of image composition is very important for achieving fast rendering. In this paper, the implementation of a sort-last rendering system on a general purpose multicomputer system is described. A two-phase sort-last-full image composition scheme is described first, and then many variants of it are presented for 2D mesh message-passing multicomputers, such as the Intel Delta and Paragon. All the proposed schemes are analyzed and experimentally evaluated on Caltech's Intel Delta machine for our sort-last parallel polygon renderer. Experimental results show that sort-last-sparse strategies are better suited than sort-last-full schemes for software implementation on a general purpose multicomputer system. Further, interleaved composition regions perform better than coherent regions. In a large multicomputer system, performance can be improved by carefully scheduling the tasks of rendering and communication. Using 512 processors to render our test scenes, the peak rendering rate achieved on a 262, 144 triangle dataset is close to 4.6 million triangles per second which is comparable to the speed of current state-of-the-art graphics workstations.
Reinforcement Learning with Orthonormal Basis Adaptation Based on Activity-Oriented Index Allocation
Authors: Hideki Satoh
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

An orthonormal basis adaptation method for function approximation was developed and applied to reinforcement learning with multi-dimensional continuous state space. First, a basis used for linear function approximation of a control function is set to an orthonormal basis. Next, basis elements with small activities are replaced with other candidate elements as learning progresses. As this replacement is repeated, the number of basis elements with large activities increases. Example chaos control problems for multiple logistic maps were solved, demonstrating that the method for adapting an orthonormal basis can modify a basis while holding the orthonormality in accordance with changes in the environment to improve the performance of reinforcement learning and to eliminate the adverse effects of redundant noisy states.
Command use in a relational database system
Authors: John D. Joyce, David R. Warn
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

A study of commands in a relational database system was undertaken to provide a basis for improving future implementations of relational techniques. The use of Regis (Relational General Information System), an interactive relational database system developed at General Motors Research Laboratories, was monitored to accumulate a large amount of data about distribution of command uses across a variety of applications developed by users with a diverse set of capabilities. Of the basic relational commands, it is important that searching, PROJECTION, and JOIN operations be efficient. However, optimizing INTERSECTION and "exclusive or" may not warrant the time and effort it would require. Although proportions of use varied, the rankings of use of relational operations were reasonably independent of applications and the programming expertise level of the users.
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
Authors: Jianxi Fan, Jiwen Yang, Guodong Zhou, Lei Zhao, Wenzhe Zhang
Venue: Information Sciences: an International Journal (2009)

A DCC (disjoint consecutive cycles) linear congruential graph G(F,n) consists of n nodes and is generated by a set of linear functions F with special properties. It was proved that G(F,n) is a 2t-regular graph and has connectivity 2t, where t=|F| and 1==3 and 2=
ECG pattern classification based on generic feature extraction
Authors: Hee-Soo Park, Soo-Min Woo, Yang-Soo Kim, Bub-Joo Kang, Sang-Woo Ban
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

In this paper, we propose a mew ECG pattern classification model based on a generic feature extraction method. The proposed classifier is applied for indicating supraventricual arrhythmia in order to verify the performance of the proposed approach. A generic approach based on a histogram of 1st derivative of signals is applied for feature extraction. Principal component analysis (PCA) is considered for both reducing dimension of features and extracting more plausible features from the extracted features. A simple k-means algorithm works for ECG signal classification in feature space for discriminating abnormal ECG beats caused by supraventricular arrhythmia from normal ECG ones.
Low-cost, low-bandwidth online meetings between farmers and scientists
Authors: Dean M. G. Hargreaves, Bob R. L. McCown
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

This paper presents aspects of a nine year research activity into the use of low-cost, low-bandwidth Information and Communications Technology (ICT) to support online meetings between farmers and scientists in rural Australia. It discusses the use of Microsoft NetMeeting&trade; (NM) to support these meetings, and describes the social and technical conditions under which these tools are likely to be useful and used.
confine(S)
Authors: Makoto Yabuki
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

A human being consists of two elements: "surface and shadow." These two opposite elements are themes of this work, in which a human being is subduing the monster that lurks in the mind.
Learning how: the search for craft knowledge on the internet
Authors: Cristen Torrey, Elizabeth F. Churchill, David W. McDonald
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Communicating the subtleties of a craft technique, like putting a zipper into a garment or throwing a clay pot, can be challenging even when working side by side. Yet How-To content - including text, images, animations, and videos - is available online for a wide variety of crafts. We interviewed people engaged in various crafts to investigate how online resources contributed to their craft practice. We found that participants sought creative inspiration as well as technical clarification online. In this domain, keyword search can be difficult, so supplemental strategies are used. Participants sought information iteratively, because they often needed to enact their knowledge in order to evaluate it. Our description of people learning how allows us to elaborate existing understandings of information-seeking behavior by considering how search originates and is evaluated in knowledge domains involving physical objects and physical processes.
POCS-Based Annotation Method Using Kernel PCA for Semantic Image Retrieval
Authors: Takahiro Ogawa, Miki Haseyama
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

A projection onto convex sets (POCS)-based annotation method for semantic image retrieval is presented in this paper. Utilizing database images previously annotated by keywords, the proposed method estimates unknown semantic features of a query image from its known visual features based on a POCS algorithm, which includes two novel approaches. First, the proposed method semantically assigns database images to some clusters and introduces a nonlinear eigenspace of visual and semantic features in each cluster into the constraint of the POCS algorithm. This approach accurately provides semantic features for each cluster by using its visual features in the least squares sense. Furthermore, the proposed method monitors the error converged by the POCS algorithm in order to select the optimal cluster including the query image. By introducing the above two approaches into the POCS algorithm, the unknown semantic features of the query image are successfully estimated from its known visual features. Consequently, similar images can be easily retrieved from the database based on the obtained semantic features. Experimental results verify the effectiveness of the proposed method for semantic image retrieval.
Practical and scalable evolution of digital circuits
Authors: A. P. Shanthi, Ranjani Parthasarathi
Venue: Applied Soft Computing (2009)

This paper addresses the scalability problem prevalent in the evolutionary design of digital circuits and shows that Evolvable Hardware (EHW) can indeed be considered as a viable alternative design methodology for large and complex circuits. Despite the effort by the EHW community to overcome the scalability problems using both direct mapped techniques and developmental approaches, so far only small circuits have been evolved. This paper shows that, by partitioning a digital circuit and making use of a modular developmental approach, namely, the Modular Developmental Cartesian Genetic Programming (MDCGP) technique, it is indeed possible to evolve large circuits. As a proof of concept, a 5x5 multiplier is evolved for partition sizes of 32 and 64. It is shown that compared to the direct evolution technique, the MDCGP technique provides five times reduction in terms of evolution times, 6-56% reduction in area and improved fault tolerance. The technique is readily scalable and can be applied to even larger partition sizes, and also to sequential circuits, thus providing a promising path to evolve large and complex circuits.
Proceedings of the 40th ACM technical symposium on Computer science education
Venue: Technical Symposium on Computer Science Education (2009)

Welcome to the proceedings of the 40th ACM Technical Symposium on Computer Science Education, or SIGCSE 2009. "Engaging Computer Science Education" is the theme of the Symposium this year. The theme reflects our common desire to create computer science education that engages our students and facilitates learning. The theme also implies a need to engage in a discussion about the future of computer science education. In these challenging times, we need to reflect on how we interest students, how we retain students, how we make our students globally competitive, and how we lead students to succeed in the interdisciplinary settings of professional computer scientists. We are pleased to announce the winners of the two annual SIGCSE awards. Elliot B. Koffman of Temple University will receive the SIGCSE award for Outstanding Contribution to CS Education, and will provide the opening keynote. Michael J. Clancy will accept the SIGCSE Award for Lifetime Service to the CS Education Community. Craig Mundie, Chief Research and Strategy Officer of Microsoft, will give the Friday keynote address on "Rethinking Computing." Gregory Abowd of Georgia Institute of Technology will speak during Saturday's concluding luncheon on "Make IT Matter: How Computing Can Make a Difference." This year's program features a number of special Birthday Events on Thursday, celebrating the 40th annual SIGCSE conference. The reception on Thursday night will be at Chattanooga's Tennessee Aquarium. The First Timers' Lunch will be on Thursday, featuring a special talk by Mike Clancy. As always, we have a large exhibit hall featuring the latest in instructional materials. With the SIGCSE Doctoral Consortium moving to the ICER workshop, we have instead filled Wednesday with a variety of pre-symposium events including the Roundtable for Department Chairs, NSF-supported work on Studio Learning in Computing Education, an Assessment Roundtable, New Teaching Faculty Roundtable, BlueJ/Greenfoot Day, and events on Data Intensive Scalable Computing, the Future of Robots in Education, Integrating FOSS into the Undergraduate Computing Curriculum, and Managing the Academic Career for Faculty Women at Undergraduate Computer Science and Engineering Institutions (CRA-W). During Friday lunch, the UPE Abacus Award will be presented to Eugene Spafford, with a speech by the awardee. On Saturday, top undergraduate and graduate students will present their work at the ACM SIGCSE Student Research Competition.
Research of Abnormal Target Detection Algorithm in Intelligent Surveillance System
Authors: Tan Jiyuan, Wu Chengdong, Zhou Yun, Hou Jun, Wang Qiaoqiao
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This paper is researched intelligent surveillance system which is based on embedded system platform and wireless communication technology. To overcome interference that coming from small target movement or background light changes, moving target detection algorithm is proposed in this system. Abnormal matters at the monitor area can be detected exactly by analyzing the real time image information, and effective security actions will be taken with corresponding patterns. The experimental results show that the system possesses the advantages of real-time standard, high credibility and practicability.
An activity-based sensor networks course for undergraduates with sun spot devices
Authors: Damon Tyman, Nirupama Bulusu, Jens Mache
Venue: ACM SIGCSE Bulletin (2009)

Wireless sensor networks are revolutionizing the instrumentation of the physical world, across scientific, industrial and military applications. In this paper, we describe our efforts developing and classroom-testing hands-on materials for use in undergraduate-accessible courses on sensor networks. In Winter 2008 at Portland State University, we introduced an in-class laboratory component to a sensor networks course that had previously been entirely lecture-based. For the laboratory exercises, we utilized Sun's Java-programmable Sun SPOT [7] sensor network technology. We found the Sun SPOT based laboratory activities to be quite powerful as a teaching and excitement-fostering tool.
Two peers are better than one: aggregating peer reviews for computing assignments is surprisingly accurate
Authors: Ken Reily, Pam Ludford Finnerty, Loren Terveen
Venue: Proceedings of the ACM 2009 international conference on Supporting group work (2009)

Scientific peer review, open source software development, wikis, and other domains use distributed review to improve quality of created content by providing feedback to the work's creator. Distributed review is used to assess or improve the quality of a work (e.g., an article). However, it can also provide learning benefits to the participants in the review process. We developed an online review system for beginning computer programming students; it gathers multiple anonymous peer reviews to give students feedback on their programming work. We deployed the system in an introductory programming class and evaluated it in a controlled study. We find that: peer reviews are accurate compared to an accepted evaluation standard, that students prefer reviews from other students with less experience than themselves, and that participating in a peer review process results in better learning outcomes.
Improving Identity Discovery through Fusion
Authors: Melissa C. Zoepfl, Harold J. Korves
Venue: IT Professional (2009)

In a complex, interconnected world, being able to confirm the identity of a person or object is critical. Applications from border control to banking rely on the notion that a system can weed out deception while permitting legitimate access. This trade-off is at the heart of identity discovery. As more scanning technologies become available, data potentially useful to identity discovery is growing exponentially. Different features and processing algorithms can have complementary strengths and weaknesses, so combining them increases identity discovery accuracy. We believe fusion—the use of multiple technologies, algorithms, or modalities in identifying or authenticating people and items—is the better approach because it can improve a system's accuracy, efficiency, and robustness. A simple linear combination fusion method can work almost as well as more analytically sophisticated fusion methods. A framework for generalizing fusion-based identity discovery helps designers think about an identity discovery system in system engineering terms.
List-coloring graphs without K4,k-minors
Authors: Ken-ichi Kawarabayashi
Venue: Discrete Applied Mathematics (2009)

In this note, it is shown that every graph with no K"4","k-minor is 4k-list-colorable. We also give an extremal function for the existence for a K"4","k-minor. Our proof implies that there is a linear time algorithm for showing that either G has a K"4","k-minor or G is 4k-choosable. In fact, if the latter holds, then the algorithm gives rise to a 4k-list-coloring.
An integrated health care information processing and retrieval system
Authors: Kevin C. O'Kane, Richard J. Hildebrandt
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

In this paper we present the design and some initial experiences with a computerized medical records system (called the CSAR System) currently in use in several departments of the Milton S. Hershey Medical Center of The Pennsylvania State University. The purpose of this work has been to develop a high-speed efficient information system for the storage, retrieval and dissemination of the total patient medical record.
Detecting Hunts in Wildlife Videos
Authors: Niels Haering, Richard J. Qian, M. Ibrahim Sezan
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

We propose a three-level algorithm to detect animal hunt events in wildlife documentaries. The first level extracts texture, color and motion features, and detects motion blobs. The mid-level employs a neural network to verify the relevance of the detected motion blobs using the extracted color and texture features. This level also generates shot summaries in terms of intermediate-level descriptors which combine low-level features from the first level and contain results of mid-level, domain specific inferences made on the basis of shot features. The shot summaries are then used by a domain-specific inference process at the third level to detect the video segments that contain hunts.
Artificial Spiking Neurons and Analog-to-Digital-to-Analog Conversion
Authors: Hiroyuki Torikai, Aya Tanaka, Toshimichi Saito
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper studies encoding/decoding function of artificial spiking neurons. First, we investigate basic characteristics of spike-trains of the neurons and fix parameter value that can minimize variation of spike-train length for initial value. Second we consider analog-to-digital encoding based upon spike-interval modulation that is suitable for simple and stable signal detection. Third we present a digital-to-analog decoder in which digital input is applied to switch the base signal of the spiking neuron. The system dynamics can be simplified into simple switched dynamical systems and precise analysis is possible. A simple circuit model is also presented.
Development of assessment criteria for clustering algorithms
Authors: Sameh A. Salem, Asoke K. Nandi
Venue: Pattern Analysis Applications (2009)

In this paper, new measures&#x2014;called clustering performance measures (CPMs)&#x2014;for assessing the reliability of a clustering algorithm are proposed. These CPMs are defined using a validation measure, which determines how well the algorithm works with a given set of parameter values, and a repeatability measure, which is used for studying the stability of the clustering solutions and has the ability to estimate the correct number of clusters in a dataset. These proposed CPMs can be used to evaluate clustering algorithms that have a structure bias to certain types of data distribution as well as those that have no structure biases. Additionally, we propose a novel cluster validity index, V I index, which is able to handle non-spherical clusters. Five clustering algorithms on different types of real-world data and synthetic data are evaluated. The first dataset type refers to a communications signal dataset representing one modulation scheme under a variety of noise conditions, the second represents two breast cancer datasets, while the third type represents different synthetic datasets with arbitrarily shaped clusters. Additionally, comparisons with other methods for estimating the number of clusters indicate the applicability and reliability of the proposed cluster validity V I index and repeatability measure for correct estimation of the number of clusters.