ppxscal/embedding_network huggingface dataset:
A Nonlinear Probabilistic Curvature Motion Filter for Positron Emission Tomography Images
Authors: Musa Alrefaya, Hichem Sahli, Iris Vanhamel, Dinh Nho Hao
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

Positron Emission Tomography (PET) is an important nuclear medicine imaging technique which enhances the effectiveness of diagnosing many diseases. The raw-projection data, i.e. the sinogram, from which the PET is reconstructed, contains a very high level of Poisson noise. The latter complicates the PET image's interpretation which may lead to erroneous diagnoses. Suitable denoising techniques prior to reconstruction can significantly alleviate the problem. In this paper, we propose filtering the sinogram with a constraint curvature motion diffusion for which we compute the edge stopping function in terms of edge probability under the assumption of contamination by Poison noise. We demonstrate through simulations with images contaminated by Poisson noise that the performance of the proposed method substantially surpasses that of recently published methods, both visually and in terms of statistical measures.
Data contamination and row-level error identification
Authors: C. Sophie Lee
Venue: Proceedings of the 10th WSEAS international conference on Automation & information (2009)

Massive data are processed by business organizations daily. Errors in upstream dataspace or faulty processes may already contaminate tens of thousands of data records downstream by the time the errors are detected and corrected. Many data space possesses the Strictly Downstream Dataspace property where an overall refresh of the dataspace is infeasible, and row level error identification is required. Such identification is usually done manually. It is time consuming and error prone. This paper models the error contamination process and proposes a design to quickly identify row-level error space in the system.
Nonlinear fiber Bragg gratings
Authors: Farzin Emami, Amir H. Jafari
Venue: Proceedings of the 8th WSEAS international conference on Microelectronics, nanoelectronics, optoelectronics (2009)

In this paper we review some of the dominant topics in fiber Bragg gratings (FBGs). The combination of theory and simulations shows that these structures can use in filters, nonlinear fiber optical applications, soliton propagations etc. We discussed the theory of FBGs, grating solitons, Bragg soliton generation in intrinsic media and birefringence effects in FBGs together with some numerical simulations for nonlinear coupled equations governing them.
Personal Stereo Videoconferencing System Supporting 3D Telepointers and Annotations
Authors: Noritaka Osawa, Norio Takase
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

We have developed a personal 3D videoconferencing system. A sender using the system can capture stereoscopic images from a stereo camera, encode them, and transmit them. The receiver can then receive the compressed data, decode it, and render the decoded images on a stereoscopic display. 3D video is useful for understand natural environments or scenes in which depth is important. The system mainly utilizes an autostereoscopic display, which is easy to use because it does not require glasses for stereoscopic views. The system enables users to share 3D telepointers, and it supports the creation of 3D graphical annotations by using telepointers, or by line drawing in 3D space. Finally, the system utilizes IPv4/IPv6 multicasting to exchange stereoscopic video, audio, and shared telepointer information among multiple sites.
Photo-mask fabrication by low-energy microcolumn lithography
Authors: H. S. Kim, S. Ahn, D. W. Kim, Y. C. Kim, S. J. Ahn
Venue: Microelectronic Engineering (2009)

We have designed and fabricated a low-energy electron-beam lithography system based on a single column module (SCM) microcolumn. From the observed characteristics of the polymethyl methacrylate (PMMA) resist, the optimum conditions for the low-energy e-beam lithography have been determined. Fine line patterns on PMMA with line width less than 60nm were obtainedunder optimized lithographic conditions. For the first time an aluminum photo-mask for optical lithography was created utilizing microcolumn lithography. Our results show that low-energy lithography systems have the potential to be used in high quality photo-mask fabrication processes.
TIMELINESUnderstanding visual thinking: the history and future of graphic facilitation
Authors: Christine Valenza, Jan Adkins
Venue: interactions (2009)

Editor's Note: The Timelines column was launched in 2006 around a three-row timeline focused on the 1940s through the present, designed with an assist from a great graphic designer. This provocative column has a timeline similar in outline, designed by a great graphic artist. Would that I could use big paper as effectively as she! --Jonathan Grudin
Energy-performance Exploration of a CGA-based SDR Processor
Authors: D. Novo, T. Schuster, B. Bougard, A. Lambrechts, L. Perre, F. Catthoor
Venue: Journal of Signal Processing Systems (2009)

Software-Defined Radio (SDR) provides the flexibility to enable cost-effective multi-mode terminals. However, the growing complexity of the new communication standards, which need to be executed with the reduced energy budget required by battery-powered devices, is still challenging architects. Although Coarse Grain Array (CGA) -based processors extended with domain specific instructions are considered strong candidates to undertake both the high-performance and low power, the lack of efficient methodologies to derive optimal instances of such an architecture paradigm is still a major limitation. In this paper, an extensive energy-performance exploration of a CGA-based SDR processor is presented. This approach targets sufficient relative accuracy on the optimization metrics, which assures meaningful comparisons between different instances, while the absolute accuracy is relaxed and traded off against simulation time. The balance between the different sources of architectural parallelism, such as data and instruction level parallelism is crucial in order to achieve the required performance at minimum energy cost. Accordingly, the proposed method is used to select the optimal DLP---ILP combination required to run the symbol-based baseband processing of a 100 Mbps+ WLAN (Wireless Local Area Network) receiver in a CGA-based processor. As a result, a 4 × 4 array with four ways SIMD (Single Instruction, Multiple Data) extensions is shown to be the optimal instance, providing minimum energy consumption and real-time processing guarantees.
Measuring the Effect of Collaboration in an Assessment Environment
Authors: Beatriz Barros, Ricardo Conejo, Eduardo Guzman
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

This paper describes a computerized collaborative testing environment in which students can take an assessment session in groups. For each question, an individual response is firstly requested, then students are allowed to view the answers of the others and discuss the question. After that a final response is requested. This collaborative environment has been used to measure the effect of collaboration in test performance obtaining promising results that indicates that all students improve their performance no matter what their knowledge levels are.
EmoEmma: emotional speech input for interactive storytelling
Authors: Fred Charles, David Pizzi, Marc Cavazza, Thurid Vogt, Elisabeth André
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

Whilst techniques for narrative generation and agent behaviour have made significant progress in recent years, natural language processing remains a bottleneck hampering the scalability of Interactive Storytelling systems. This demonstrator introduces a novel interaction technique based solely on emotional speech recognition. It allows the user to use speech to interact with virtual actors without any constraints on style or expressivity, by mapping the recognised emotional categories to narrative situations and virtual characters feelings.
Decreasing the cost of mutation testing with second-order mutants
Authors: Macario Polo, Mario Piattini, Ignacio García-Rodríguez
Venue: Software Testing, Verification Reliability (2009)

Although powerful, mutation is a computationally very expensive testing technique. In fact, its three main stages (mutant generation, mutant execution and result analysis) require many resources to be successfully accomplished. Thus, researchers have made important efforts to reduce its costs. This paper represents an additional effort in this sense. It describes the results of two experiments in which, by means of combining the original set of mutants and therefore obtaining a new set of mutants&mdash;each one with two faults&mdash;the number of mutants used is reduced to half. Results lead to believe that mutant combination does not decrease the quality of the test suite, whereas it supposes important savings in mutant execution and result analysis. Copyright &copy; 2008 John Wiley & Sons, Ltd.
An Active Classification System for Context Representation and Acquisition
Authors: Fulvio Mastrogiovanni, Antonio Sgorbissa, Renato Zaccaria
Venue: Proceeding of the 2007 conference on Advances in Ambient Intelligence (2007)

This work deals with a distributed knowledge representation and active information fusion system suitable for use in Ambient Intelligence applications. The architecture --which is modeled as a multi-agent system --exploits a sound formal model to relate numerical data to symbolic representations, thus being able to reason about predicates, situations and contexts. In particular, agents collaborate to perform an intelligent multi-sensor data fusion according to the guidance of an active classification layer. Experimental results performed both in simulation and in a real set-up are discussed with respect to a number of implications and future directions related to the system approach.
Quantum Theory of Conducting Matter: Newtonian Equations of Motion for a Bloch Electron, 1st edition
Authors: Shigeji Fujita, Kei Ito
Venue:  (2007)

The measurements of the Hall coefficient RH and the Seebeck coefficient (thermoelectric power) S are known to give the sign of the carrier charge q. In sodium (Na) forming a body-centered cubic (bcc) lattice both RH and S are negative, indicating that the carrier is the "electron". In silver (Ag) forming a face-centered cubic (fcc) lattice the Hall coefficient RH is negative but the Seebeck coefficient S is positive. This complication arises from the Fermi surface of the metal. In conducting matter physics the "electrons" and the "holes" play important roles. The "electrons" ("holes") which by definition circulate counterclockwise (clockwise) around the magnetic field (flux) vector B cannot be discussed based on the prevailing equation of motion in the electron dynamics: dk/dt=q (E + v x B), k = k-vector, E = electric field, v = velocity since the energy-momentum relation is not incorporated in this equation. In this book we shall derive Newtonian equations of motion with a symmetric mass tensor. We diagonalize this tensor by introducing the principal masses and the principal axes of the inverse-mass tensor associated with the Fermi surface. We demonstrate that the "electrons" ("holes") are generated near the Fermi surface, depending on the curvature sign of the surface. As applications, we treat magnetic oscillations in the susceptibility and conductivity, cyclotron resonance, thermopower and infrared Hall effect. In each case we treat the phenomena, starting with the crystal structure and using the Fermi surface. Free-electron model, phonons, kinetic theory of the electron transport, the magnetic susceptibility and the Boltzmann equation method, which are normally covered in the introductory solid state physics course are included as the preliminaries. The text is composed of three parts, Part I preliminaries, Chap. 1-6, Bloch electron dynamics, Chap. 7-10, and applications, Chap. 11-15.
VIDA: Visual interactive debugging
Authors: Dan Hao, Lingming Zhang, Lu Zhang, Jiasu Sun, Hong Mei
Venue: Proceedings of the 2009 IEEE 31st International Conference on Software Engineering (2009)

Software debugging is time-consuming and effort-consuming. Although software debugging, especially fault-localization, has been studied for long, few practical debugging tools have been developed and used by the industry. In this paper we present VIDA, a visual interactive debugging tool, which has been integrated with the Eclipse Integrated Development Environment to support a programmer's debugging process. During the programmer's conventional debugging process, VIDA continuously recommends break-points for the programmer based on the analysis of execution information and the gathered feedback from the programmer. Moreover, VIDA provides a program outline to help the programmer choose breakpoints and visualizes the static dependency relation to help the programmer make estimation at breakpoints.
Semantics, calculi, and analysis for object-oriented specifications
Authors: Achim D. Brucker, Burkhart Wolff
Venue: Acta Informatica (2009)

We present a formal semantics for an object-oriented specification language. The formal semantics is presented as a conservative shallow embedding in Isabelle/hol and the language is oriented towards ocl formulae in the context of uml class diagrams. On this basis, we formally derive several equational and tableaux calculi, which form the basis of an integrated proof environment including automatic proof support and support for the analysis of this type of specifications. We show applications of our proof environment to data refinement based on an adapted standard refinement notion. Thus, we provide an integrated formal method for refinement-based object-oriented development.
An approach to derive the use case diagrams from an event table
Authors: Mohammad I. Muhairat, Rafa E. Al-Qutaish
Venue: Proceedings of the 8th WSEAS International Conference on Software engineering, parallel and distributed systems (2009)

Building the use-case diagram is a very important task since it represents a transition between the requirements and design phases. However, building such diagram is a time consuming process and needs a complete understanding of the requirements. In this paper, we introduce an approach to derive use case diagrams from an event table. This new approach will facilitate and speed the generation process of the use case diagrams. However, this approach will completely depends on the availability of a comprehensive event table which to be built from the available requirements.
A new priority based congestion control protocol for Wireless Multimedia Sensor Networks
Authors: Mohammad Hossein Yaghmaee, Donald Adjeroh
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

New applications made possible by the rapid improvements and miniaturization in hardware has motivated recent developments in Wireless Multimedia Sensor Networks (WMSNs). As multimedia applications produce high volumes of data which require high transmission rates, multimedia traffic is usually high speed. This may cause congestion in the sensor nodes, leading to impairments in the quality of service (QoS) of multimedia applications. Thus, to meet the QoS requirements of multimedia applications, a reliable and fair transport protocol is mandatory. An important function of the transport layer in WMSNs is congestion control. In this paper, we present a new Queue based Congestion Control Protocol with Priority Support (QCCP-PS), using the queue length as an indication of congestion degree. The rate assignment to each traffic source is based on its priority index as well as its current congestion degree. Simulation results show that the proposed QCCP-PS protocol can detect congestion better than previous mechanisms. Furthermore it has a good achieved priority close to the ideal and near-zero packet loss probability, which make it an efficient congestion control protocol for multimedia traffic in WMSNs. As congestion wastes the scarce energy due to a large number of retransmissions and packet drops, the proposed QCCP-PS protocol can save energy at each node, given the reduced number of retransmissions and packet losses.
Using Model Counting to Find Optimal Distinguishing Tests
Authors: Stefan Heinz, Martin Sachenbacher
Venue: Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2009)

Testing is the process of stimulating a system with inputs in order to reveal hidden parts of the system state. In the case of non-deterministic systems, the difficulty arises that an input pattern can generate several possible outcomes. Some of these outcomes allow to distinguish between different hypotheses about the system state, while others do not.In this paper, we present a novel approach to find, for non-deterministic systems, modeled as constraints over variables, tests that allow to distinguish among the hypotheses as good as possible. The idea is to assess the quality of a test by determining the ratio of distinguishing (good) and not distinguishing (bad) outcomes. This measure refines previous notions proposed in the literature on model-based testing and can be computed using model counting techniques. We propose and analyze a greedy-type algorithm to solve this test optimization problem, using existing model counters as a building block. We give preliminary experimental results of our method, and discuss possible improvements.
Investigation of domain effects on software
Authors: Shamsnaz Virani, Letha Etzkorn, Sampson Gholston, Phillip Farrington, Dawn Utley, Julie Fortune
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

It has been stated that there is very less variability in cohesion, coupling and complexity of software packages within specific domains such as Graphical User Interface (GUI). This implies that software metrics show low variability within single domain and high variability between domains. This paper investigates the domain issue by creating hierarchical model of four different domains and two software packages within each domain. Metrics are collected on each package and compared against the domains and packages. Results confirm metrics are not domain centric.
Construction of Peer-to-Peer Systems for Knowledge Resource Distribution Using Overlay Clustering of Similar Peers
Authors: Huijun Li, Samir Ibradzic, Xiao Shao, Takehiro Tokuda
Venue: Proceeding of the 2009 conference on Information Modelling and Knowledge Bases XX (2009)

Peer-to-Peer (P2P) systems have been attractive solutions for resource distribution and sharing because of their self-organizing and fault-tolerant features. However, due to the decentralized nature, search efficiency is a challenging problem for large scale knowledge resource distribution P2P systems. In this paper, peer-similarity based P2P overlay clustering algorithm is proposed. Simulation results show that search efficiency using overlay clustering of similar peers is substantially improved.
A robust digital audio watermarking based on statistics characteristics
Authors: Xiang-Yang Wang, Pan-Pan Niu, Hong-Ying Yang
Venue: Pattern Recognition (2009)

In digital audio watermarking, the watermark's vulnerability to desynchronization attacks has long been a difficult problem. According to the audio statistics characteristics and synchronization code technique, a new robust audio watermarking scheme against desynchronization attacks is proposed in this paper. Firstly, the original digital audio is segmented and then each audio segment is cut into two parts. Secondly, with the spatial watermarking technique, the synchronization code is embedded into the statistics average value of audio samples in the first part. Finally, the second part of audio segment is cut into audio sections, the DWT is performed on the audio sections, and the watermark bit is embedded into the statistics average value of low frequency components. Experimental results show that the proposed scheme is inaudible and robust against common signals processing, including MP3 compression, low-pass filtering, noise addition, and equalization, etc. Moreover, it also survives several desynchronization attacks, such as random cropping, amplitude variation, pitch shifting, time-scale modification, and jittering, etc.
Quantifying path exploration in the internet
Authors: Ricardo Oliveira, Beichuan Zhang, Dan Pei, Lixia Zhang
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Previous measurement studies have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of protocol enhancements have been proposed to remedy the problem. However, existing measurements were conducted only over a small number of testing prefixes. There has been no systematic study to quantify the pervasiveness of Border Gateway Protocol (BGP) slow convergence in the operational Internet, nor any known effort to deploy any of the proposed solutions. In this paper, we present our measurement results that identify BGP slow convergence events across the entire global routing table. Our data shows that the severity of path exploration and slow convergence varies depending on where prefixes are originated and where the observations are made in the Internet routing hierarchy. In general, routers in tier-1 Internet service providers (ISPs) observe less path exploration, hence they experience shorter convergence delays than routers in edge ASs; prefixes originated from tier-1 ISPs also experience less path exploration than those originated from edge ASs. Furthermore, our data show that the convergence time of route fail-over events is similar to that of new route announcements and is significantly shorter than that of route failures. This observation is contrary to the widely held view from previous experiments but confirms our earlier analytical results. Our effort also led to the development of a path-preference inference method based on the path usage time, which can be used by future studies of BGP dynamics.
Theory of Computation
Authors: O. G. Kakde
Venue:  (2007)

Deals with mathematical foundations, finite automata, regular expressions and pumping lemma for regular sets, formal grammar, chomsky hierarchy and regular grammar, context free grammar, pushdown automata, and recursive function theory. 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