ppxscal/embedding_network huggingface dataset:
A Fast Method to Mine Frequent Subsequences from Graph Sequence Data
Authors: Akihiro Inokuchi, Takashi Washio
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

In recent years, the mining of a complete set of frequent subgraphs from labeled graph data has been extensively studied.However, to our best knowledge, almost no methods have been proposed to find frequent subsequences of graphs from a set of graph sequences. In this paper, we define a novel class of graph subsequences by introducing axiomatic rules of graph transformation, their admissibility constraints and a union graph. Then we propose an efficient approach named "GTRACE'' to enumerate frequent transformation subsequences (FTSs) of graphs from a given set of graph sequences. Its fundamental performance has been evaluated by using artificial datasets, and its practicality has been confirmed through the experiments using real world datasets.
On the use of Kalman filter for enhancing speech corrupted by colored noise
Authors: Boubakir Chabane, Berkani Daoued
Venue: WSEAS Transactions on Signal Processing (2008)

Kalman filtering is a powerful technique for the estimation of the speech signal observed in additive background noise. This paper presents a contribution in the enhancement of noisy speech with white and colored noise assumption. Some tests were performed with ideal filter parameters, others using the Expectation Maximization (EM) algorithm to iteratively estimate the spectral parameters of the speech and noise. Simulation results show that the application has the best performance evaluated with objective quality scores, observation of the waveforms, as well as informal listening tests in the case of Noizeus database.
Who Needs a Publisher or a Retailer or a Marketer?
Authors: Chris Swain
Venue: Computer (2009)

Digital distribution platforms enable creators to connect directly to audiences.
Ring signature scheme for ECC-based anonymous signcryption
Authors: Yu Fang Chung, Zhen Yu Wu, Tzer Shyong Chen
Venue: Computer Standards Interfaces (2009)

This study presents an elliptic curve cryptosystem-based signcryption scheme with anonymity features. The scheme possesses the properties of elliptic curve cryptosystem and ring signature. While the technique of ring signature endows the signers with anonymity, the elliptic curve cryptosystem provides advantages like high security, low computation load, and small bandwidth requirements. Integrating the advantages of these two applications, the outcome is a highly secure and efficient anonymous signcryption scheme. Signcryption does not require an advance establishment of session key for each session. Thus, transmission load is reduced, and efficiency of performance and transmission enhanced.
Comparative Study on the Use of Analytical Software to Identify the Different Stages of Breast Cancer Using Discrete Temperature Data
Authors: Joanna M. Tan, E. Y. Ng, Rajendra Acharya U., Louis G. Keith, Jim Holmes
Venue: Journal of Medical Systems (2009)

Breast cancer is the second leading cause of death in women. It occurs when cells in the breast begin to grow out of control and invade nearby tissues or spread throughout the body. The limitations of mammography as a screening modality, especially in young women with denser breasts, necessitated the development of novel and more effective screening strategies with acceptable sensitivity and specificity. The aim of this study was to develop a feasible interpretive software system which was able to detect and classify breast cancer patients by employing techniques of different analytical software. The protocol described uses 6,000 pieces of thermal data collected from 16-sensors, eight placed on the surface of each breast. Data was collected every 5 min for the duration of the test period. Placement of sensors was accomplished with the use of a template design from information provided by the national tumor registry to insure that the information was collected in areas of the breast where most breast cancers develop. Data in this study was collected from 90 individuals exhibiting four different breast conditions, namely: normal, benign, cancer and suspected-cancer. The temperature data collected from these 16 sensors placed on the surface of each breast were fed as inputs to the classifiers. Comparisons were made on five different kinds of classifiers: back-propagation algorithm, probabilistic neural network, fuzzy (Sugeno-type), Gaussian mixture model and support vector machine. These classifiers were able to attain approximately 80% accuracy in classifying the four different diagnoses (normal, benign, cancer and suspected-cancer). Gaussian mixture model was the most sensitive classifier, achieving the highest sensitivity of 94.8%. Support vector machine was considered the best classifier as it was able to produce the most specific and accurate results. Based on these evaluations, this current effort shows the feasibility of applying analytical software techniques together with the real-time functional thermal analysis to develop a potential tool for the detection and classification of breast cancer.
A Parallel Matrix Scaling Algorithm
Authors: Patrick R. Amestoy, Iain S. Duff, Daniel Ruiz, Bora Uçar
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

We recently proposed an iterative procedure which asymptotically scales the rows and columns of a given matrix to one in a given norm. In this work, we briefly mention some of the properties of that algorithm and discuss its efficient parallelization. We report on a parallel performance study of our implementation on a few computing environments.
A new simulated annealing algorithm for terminal allocation
Authors: Zengnian Zhang, Xudong Ke
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

In this paper, we focus on studying the capability of Simulated Annealing Arithmetic for optimizing the terminal allocation problems in communications network. They take advantage of the best characteristic of the two effective scheduling strategies Round Robin and Shortest Distance based on local information at the terminal in the communications network. The effectiveness of the Simulated Annealing Arithmetic, where some cooling strategies are used, is passed judgment by comparing system performance under different terminal allocation algorithms including Round Robin and Short Distance.
Assessment of Environmental Effect of Chinese Foreign Trade Based on Rough Sets and SOM Nerve Network
Authors: Jinana Zhao, Zhao Xu, Zhuozheng Wu
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

a hybrid intelligent system is applied to assess the environment effect of Chinese foreign trade, combining Rough Set approach (RS) and self organizing map (SOM). We can get reduced information table with no information loss by Rough Set approach. And then, this reduced information is used to develop classification rules and train SOM. The effectiveness of our methodology was verified by experiments data of Chinese product in 2006.
A measurement study supporting P2P file-sharing community models
Authors: R. Bolla, R. Gaeta, A. Magnetto, M. Sciuto, M. Sereno
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

Knowledge of emergent properties of existing peer-to-peer file-sharing communities can be helpful for the design and implementation of innovative peer-to-peer protocols/services that exploit autonomicity, self-configuration, resilience, scalability, and performance. It is well known that the performance of this class of peer-to-peer applications depends on several parameters that represent the topological structure of the overlay network, the users' behavior, and resource dynamics. Estimation of these parameters is difficult, but it is crucial for analytical models as well as for realistic simulation of peer-to-peer applications. In this paper, we present an active measurement-based study designed to glean insights on the above parameters within the Gnutella network. The measurement software that we developed is able to collect topological information about the overlay network topology in a few minutes; in a second step, it contacts the users discovered during the topological measurement in order to acquire a novel dataset regarding the shared resources.
Measurement Equivalence in Cross-Culture Research: Concept, Bias Resource and Test Method
Authors: Xianfang Xue
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Measurement equivalence (ME) is an important issue in cross-culture research, it’s critical for the interpretation and comparison of measured scores. It also has important meaning for human resource management and organizational behavior research. ME in cross-culture research can be reviewed from concept, bias resource and test method. The measurement bias mainly comes from culture, language, organization and response context. At present, there are two test methods: confirmative factor analysis(CFA) and item response theory(IRT).
Avionics Certification: A Complete Guide to DO-178 (Software), DO-254 (Hardware), 1st edition
Authors: Vance Hilderman, Len Buckwalter
Venue:  (2007)

This book explains the most critical safety certification required by commercial and military aircraft. The authors describe each step in creating and submitting formal documents for government approval. Their advice is highly practical, acquired over 20 years of performing successful certifications now flying aboard every major airliner and many military aircraft. The book includes dozens of real-life anecdotes to show where applicants go wrong, fall victim to common myths and waste time with misconceptions. The authors approach avoids the abstract by delivering clear advice on such practical matters as budgets, staff members, tools, programming languages and schedules. They give numerous rules-of-thumb for guiding the reader along what can otherwise be an arduous path to certification. Although the book deals with each milestone of a program, the authors point out, We don t teach regulations, but how to think like the FAA! That approach has worked for scores of companies, helping avoid damaging overruns in budgets and schedules. As DO-178 (software) and DO-254 (hardware) certification become established in aviation, they are spreading to other industries, such transportation, medical instruments and power generation. As in aviation, these technologies are now in the digital world, and need to meet high standards of safe operation demanded for aircraft. Increasingly, these other industries are required to meet DO-178/254 certification. As the authors explain, the official DO-178 and DO-254 documents are not only vague and non-specific, but have to be! The reason is, they need to apply to a wide range of systems. The authors meet the challenge by skillfully interpreting the intent of the documents. They have been doing it for years in world-wide seminars that have trained more people than all other seminars combined. Their book is the first text on this critical subject. Contents of "Avionics Certification" 1. Introduction 2. Real World of DO-178B 3. Planning the Project 4. Criticality Levels 5. What is Certified ? 6. Cost Vs Benefits 7. Military Certification 8. Getting Started 9. Safety Assessment 10. Planning, Development and Correctness 11. Quality Assurance Plan 12. Configuration Management 13. Software Development Plan 14. System Requirements| 15. Software Design 16. Unit Testing 17. Software Testing 18. Structural Coverag 19. Test and Tools 20. DO-254 (Hardware) 21. Hardware Design Life Cycle 22. Gap Analysis 23. Verification 24. Project Organization 25. PSAC 26. Tool Qualification 27. Software Design Aspects 28. Cost Estimation and Metrics Glossary
Goals in conflict: semantic foundations of goals in agent programming
Authors: M. Birna Riemsdijk, Mehdi Dastani, John-Jules Ch. Meyer
Venue: Autonomous Agents and Multi-Agent Systems (2009)

This paper addresses the notion of (declarative) goals as used in agent programming. Goals describe desirable states, and semantics of these goals in an agent programming context can be defined in various ways. We focus in this paper on the representation of conflicting goals. In particular, we define two semantics for goals, one for unconditional goals and one for conditional goals. The first is based on propositional logic, and the latter is based on default logic. We establish relations between and properties of these semantics.
A modular approach to packet voice terminal hardware design
Authors: G. C. O'Leary, P. E. Blankenship, J. Tierney, J. A. Feldman
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

In addition to encoding and decoding speech, packet voice terminal functions include packetization and depacketization; the application and interpretation of voice, internet, and local network protocols; dialing, ringing, ancillary signaling; and interface to local network transmission media. In this paper we describe a modular packet voice terminal design in which the partitioning of the hardware is effected along these basic functional lines. Interfaces are provided between the speech processing, protocol handling, and local network interfacing functions such that each of these is implemented in a physically independent module with considerable freedom for modifying or replacing any one module independently of the others. This allows for a broad choice of voice coders on the one hand, and a variety of local network types on the other. Specific modules discussed include a microprocessor-based protocol-handling section, an interface module to a local area coaxial cable network which uses a contention-based mechanism for packet voice communication, and a variety of voice coder/decoder designs covering the rate spectrum from 2.4 to 64 kbps.
Dynamic LoD for QoS Management in the Next Generation VRML
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

High speed computer networks will provide us with new broad band multimedia applications. This paper discusses new functions for the next generation VRML (Virtual Reality Modeling Language) over high speed computer networks. The LoD (Level of Detail) of 3D objects is the most important function for rendering scenes dynamically while managing the QoS (Quality of Service). New requirements for the next generation VRML are discussed. We present Differential VRML (DVRML) in order to update scene graphs dynamically, and describe principles of the LoD function based on the DVRML. 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
Note to self: examining personal information keeping in a lightweight note-taking tool
Authors: Max G. Van Kleek, Michael Bernstein, Katrina Panovich, Gregory G. Vargas, David R. Karger, MC Schraefel
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

This paper describes a longitudinal field experiment in personal note-taking that examines how people capture and use information in short textual notes. Study participants used our tool, a simple browser-based textual note-taking utility, to capture personal information over the course of ten days. We examined the information they kept in notes using the tool, how this information was expressed, and aspects of note creation, editing, deletion, and search. We found that notes were recorded extremely quickly and tersely, combined information of multiple types, and were rarely revised or deleted. The results of the study demonstrate the need for a tool such as ours to support the rapid capture and retrieval of short notes-to-self, and afford insights into how users' actual note-keeping tendencies could be used to better support their needs in future PIM tools.
MPEG-4 Multicast Over Satellite
Authors: Franco Casalino, Gianluca Di Cagno
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This paper presents possible future usage of MPEG-4 technology, illustrating a broadcast architecture. A broadcast system typically provides a complement of services over a fixed unidirectional communication channel. The overall goal of broadcasters is to provide more and better services over a given bandwidth. The use of MPEG-4 in certain broadcast application areas is expected to provide the means to achieve this goal. A system for multicast over satellite of MPEG-4 content is presented. This architecture was successfully demonstrated at the 45th MPEG meeting, where a satellite demonstration was hold.
Pi-calculus Based Assembly Mechanism of UML State Diagram and Validation of Model Refinement
Authors: Yefei Zhao, Zong-yuan Yang, Jinkui Xie
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

UML provides a graphical method to model object-oriented system. However, UML is a meta-model which has only static semantics and without dynamic semantics. From the perspective of assembly mechanism, we proposed six kinds of UML state diagram's assembly mechanisms, and gave the mapping rules between assembly mechanism and picalculus. Finally we proved that it is practical to validate model refinement with above theory in two different ways — experiment and theory deduction. The theory deduction coincides with the experiment results. Furthermore, the mobile assembly and interrupt assembly we proposed supplement for the insufficient description ability of UML.
Fast Generation of Dynamic and Multi-Resolution 360-Degree Panorama from Video Sequences
Authors: Zhigang Zhu, Guangyou Xu, Edward M. Riseman, Allen R. Hanson
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

This paper presents a systematic approach to automatic construction of a dynamic and multi-resolution 360( panoramic (DMP) representation from image sequences taken during camera rotation and zoom. Although a simple 2D rigid motion model is used to estimate inter-frame motion parameters, our mosaicing methodology enables precise cylindrical panoramic mosaic. Moving objects are detected and separated from images based on motion information, and their accurate contours are extracted using a modified active contour algorithm. A multi-resolution representation is built for the more interesting areas by means of camera zooming. The DMP construction method is fast, robust and automatic, achieving 1 Hz on a 266MHz PC. No camera calibration, feature extraction, image segmentation or complicated nonlinear optimization processing is required in our algorithms. The construction of the panoramic representation can be used in virtual reality and very low bit-rate video coding.
Race-Free Mixed Serial-Parallel Comparison for Low Power Content Addressable Memory
Authors: Seong-Ook Jung, Sei-Seung Yoon
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This letter presents a race-free mixed serial-parallel comparison (RFMSPC) scheme which uses both serial and parallel CAMs in a match line. A self-reset search line scheme for the serial CAM is proposed to avoid the timing race problem and additional timing penalties. Various 32 entry CAMs are designed using 90 nm 1.2 V CMOS process to verify the proposed RFMSPC scheme. It shows that the RFMSPC saves power consumption by 40%, 53% and 63% at the cost of a 4%, 6% and 16% increase in search time according to 1, 2, and 4 serial CAM bits in a match line.
Relevance Feedback Techniques for Image Retrieval Using Multiple Attributes
Authors: Tat-Seng Chua, Chun-Xin Chu, Mohan Kankanhalli
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

This paper proposes a relevance feedback (RF) approach to content-based image retrieval using multiple attributes. The proposed approach has been applied to images' text and color attributes. In order to ensure that meaningful features are extracted, a pseudo object model based on color coherence vector has been adopted to model color content. The RF approach employs techniques developed in the fields of information retrieval and machine learning to extract pertinent features from each of the attributes. It then uses the user's relevance judgments to estimate the importance of different attributes in an integrated content-based image retrieval. The system developed has been tested on a large image collection containing over 12,000 images. The results demonstrate that the proposed RF approaches and pseudo-object based color model are effective.
Information systems for ambulatory care
Authors: Anthony I. Wasserman, William Cass, Jerome H. Grossman, Alfred H. Garratt, William V. Glenn,  Jr., Gerald A. Giebink
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Until recently, most medical information systems were developed for use in hospitals, despite the fact that the majority of health care is given in clinics and physician's offices. There are several reasons for this situation, including the following: (1) the nature of acute care implies a more urgent need for communication of information among health professionals; (2) there is a greater volume of data collected on inpatients than on outpatients; (3) there are larger sums of money per encounter involved, tending to make information systems more economical.
Abstraction Refinement for Probabilistic Software
Authors: Mark Kattenbelt, Marta Kwiatkowska, Gethin Norman, David Parker
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

We present a methodology and implementation for verifying ANSI-C programs that exhibit probabilistic behaviour, such as failures or randomisation. We use abstraction-refinement techniques that represent probabilistic programs as Markov decision processes and their abstractions as stochastic two-player games. Our techniques target quantitative properties of software such as "the maximum probability of file-transfer failure" or "the minimum expected number of loop iterations" and the abstractions we construct yield lower and upper bounds on these properties, which then guide the refinement process. We build upon state-of-the-art techniques and tools, using SAT-based predicate abstraction, symbolic implementations of probabilistic model checking and components from GOTO-CC, SATABS and PRISM. Experimental results show that our approach performs very well in practice, successfully verifying actual networking software whose complexity is significantly beyond the scope of existing probabilistic verification tools.
A computation method in robust Bayesian decision theory
Authors: Christophe Abraham
Venue: International Journal of Approximate Reasoning (2009)

We propose a method for computing the range of the optimal decisions when the utility function runs through a class U. The class U has constraints on the values and the shape of the utility functions. A discretization method enables to easily approximate the optimal decision associated with a particular utility function u@?U. The range of optimal decisions is computed by a Monte Carlo optimization method. An example is provided with numerical results.