ppxscal/embedding_network huggingface dataset:
Hardware support in a middleware for distributed and real-time embedded applications
Authors: Elias T. Silva,  Jr, Flávio R. Wagner, Edison P. Freitas, Carlos E. Pereira
Venue: Proceedings of the 19th annual symposium on Integrated circuits and systems design (2006)

One of the main challenges in the development of tools and methodologies for a multiprocessor real-time embedded system is to reuse already developed software, but at the same time obtaining low memory footprint, low energy consumption, and minimal area, obviously addressing the real-time constraints. This work aims to face these problems at the middleware level. We show that adaptations in the platform architecture, for instance exploring hardware implementations of middleware services, such as task scheduling and communication, can drive better gains in application requirements like energy and performance, which are essential for embedded applications. This approach is coupled with a high flexibility in choosing either a hardware or a software implementation, because services are encapsulated into objects and the application development and the design space exploration at middleware level can be performed independently from each other, in a fully transparent way. Furthermore, the use of the object-oriented approach reduces time-to-market and development costs.
Efficient Evaluation of CSAN Models by State Space Analysis Methods
Authors: Mohammad Abdollahi Azgomi, Ali Movaghar
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

We have recently introduced a high-level extension for stochastic activity networks (SANs) called coloured stochastic activity networks (CSANs). CSANs have several distinguishing properties, which make them quite appropriate for modeling and evaluation of software performance and dependability. CSANs have introduced a construct called coloured place for data manipulation. A coloured place holds a list of tokens of a userdefined token type. CSAN models can be evaluated by state space analysis techniques or discrete-event simulation. However, their state spaces will become very large, even for a small CSAN model. For efficient evaluation of these models by state space analysis methods, we will introduce measure-adaptive state space analysis process in this paper. Based on this method, it is possible to construct high-level CSAN models. However, for efficient evaluation, it is possible to generate and analyze a reduced state space based on user-specified performance or dependability measures.
Age dependency in handwritten dynamic signature verification systems
Authors: Richard Guest
Venue: Pattern Recognition Letters (2006)

An assessment of age dependency of biometric dynamic signature verification systems is presented. A number of commonly used features are extracted from multiple signature sample donated by 274 signers. These features are examined for repeatability both within a single signature capture session and between multiple sessions with particular consideration for any performance variation between age groups. Alongside this analysis, an age evaluation of test subjects' ability to enrol/validate on standard systems is presented. Performance is stable across all evaluated age groups proving the ability signature system to be deployed for use within a general population. Some performance features however vary significantly with age in terms of repeatability and mean feature value; characteristics which can be exploited and must be accommodated in the design of systems for use amongst a wide or specific population.
Communication through the artefact by means of synchronous co-construction
Authors: Astrid Wichmann, Markus Kuhn, Ulrich Hoppe
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This paper examines the collaborative features of a tool environment called Cool Modes. Cool Modes provides different modelling environments allowing learners to co-construct representations of domain-specific models. These systems range from curriculum topics such as stochastic to subjects with a non-standard character such as astronomy. In the current study we focus upon the Stochastic palette and the Moon palette, which both provide visual languages to support modelling activities specifically in the subject matter area of mathematics. These visual languages are embedded in the Cool Modes Framework providing tools for annotating and enriching the co-constructive modelling process. Both palettes have been tested and adapted for learning scenarios taking place in formal and informal learning environments. In this paper we report the findings from observational material collected from 3 classes in Germany using Cool Modes. The observation concentrates upon assessing the effectiveness of supporting co-constructive modelling activities in a synchronous learning setting.
A Research on Steganography Method Based on Error-Correcting Codes
Authors: Cui-Qing Liu, Xi-Jian Ping, Tao Zhang, Lin-Na Zhou, Yun-He Wang
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

With the encoding redundancy of Error-Correcting codes a new steganography method is proposed. A mapping code between secret information and codeword error map is built. By modifying the part of the codeword of the error-correcting codes according to the error map secret information is embedded. Theoretical analysis and experimental results show that this method has better security.
Affine Invariance Revisited
Authors: Evgeni Begelfor, Michael Werman
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

This paper proposes a Riemannian geometric framework to compute averages and distributions of point configurations so that different configurations up to affine transformations are considered to be the same. The algorithms are fast and proven to be robust both theoretically and empirically. The utility of this framework is shown in a number of affine invariant clustering algorithms on image point data.
Accurate and Scalable Surface Representation and Reconstruction from Images
Authors: Gang Zeng, Sylvain Paris Long Quan, Francois Sillion
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

We introduce a new surface representation method, called patchwork, to extend three-dimensional surface reconstruction capabilities from multiple images. A patchwork is the combination of several patches that are built one by one. This design potentially allows for the reconstruction of an object with arbitrarily large dimensions while preserving a fine level of detail. We formally demonstrate that this strategy leads to a spatial complexity independent of the dimensions of the reconstructed object and to a time complexity that is linear with respect to the object area. The former property ensures that we never run out of storage and the latter means that reconstructing an object can be done in a reasonable amount of time. In addition, we show that the patchwork representation handles equivalently open and closed surfaces, whereas most of the existing approaches are limited to a specific scenario, an open or closed surface, but not both. The patchwork concept is orthogonal to the method chosen for surface optimization. Most of the existing optimization techniques can be cast into this framework. To illustrate the possibilities offered by this approach, we propose two applications that demonstrate how our method dramatically extends a recent accurate graph technique based on minimal cuts. We first revisit the popular carving techniques. This results in a well-posed reconstruction problem that still enjoys the tractability of voxel space. We also show how we can advantageously combine several image-driven criteria to achieve a finely detailed geometry by surface propagation. These two examples demonstrate the versatility and flexibility of patchwork reconstruction. They underscore other properties inherited from patchwork representation: Although some min-cut methods have difficulty in handling complex shapes (e.g., with complex topologies), they can naturally manipulate any geometry through the patchwork representation while preserving their intrinsic qualities. The above properties of patchwork representation and reconstruction are demonstrated with real image sequences.
A new generalized Laguerre spectral approximation and its applications
Authors: Guo Ben-yu, Zhang Xiao-yong
Venue: Journal of Computational and Applied Mathematics (2005)

A new family of generalized Laguerre polynomials is introduced. Various orthogonal projections are investigated. Some approximation results are established. As an example of their important applications, the mixed spherical harmonic-generalized Laguerre approximation is developed. A mixed spectral scheme is proposed for a three-dimensional model problem. Its convergence is proved. Numerical results demonstrate the high accuracy of this new spectral method.
Vector quantization based QoS classification for admission control in CDMA systems
Authors: Mainak Chatterjee, Sajal K. Das
Venue: Wireless Networks (2005)

Optimal power control is of great importance for CDMA systems and it can be controlled to provide the desired quality of service (QoS) to mobile hosts in a cellular radio system. The power levels of all the mobile hosts are determined and constantly tuned in order to achieve the required SINR (signal to interference and noise ratio) which changes dynamically. The SINR of all the K mobiles in a cell can be expressed in the form of a k-dimensional vector. It helps determine the operating point of the system and hence it is constantly monitored and updated due to the variability in the wireless channel conditions and user mobility. We view this continuously changing vector as the motion of a point in a higher dimensional Euclidean space, called the QoS space. We apply vector quantization technique to shrink the infinite-point space to a finite-point space by partitioning the former into N regions such that the points within a region reflect almost similar system performance and are identified by what we call a QoS index. We show how the system operating point can be mapped to one of the QoS indices. The location of the point or the region of operability in the QoS space conveys the system status in terms of the current load and the QoS being delivered. The dynamism in the system's input conditions due to wireless link characteristics and user mobility acts like an opposing force against which the system has to operate. The system reacts to all such changes preventing it from going into a region with an undesirable QoS index. We show how the apriori knowledge of the operating region helps in decision making pertaining to call admission and resource allocation in CDMA systems.
Tool-Supported Verification of Contingency Software Design in Evolving, Autonomous Systems
Authors: Robyn Lutz, Ann Patterson-Hine, Anupa Bajwa
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

Advances in software autonomy can support system robustness to a broader range of operational anomalies, called contingencies, than ever before. Contingency management includes, but goes beyond, traditional fault protection. Increased autonomy to achieve contingency management brings with it the challenge of how to verify that the software can detect and diagnose contingencies when they occur. The approach used in this work to investigate the verification was two-fold: (1) to integrate in a single model the representation of the contingencies and of the data signals and software monitors required to identify those contingencies, and (2) to use tool-supported verification of the diagnostics design to identify gaps in coverage of the contingencies. Results presented here indicate that tool-supported verification of the adequacy and correct behavior of such diagnostic software for contingency management can improve on-going contingency analysis, thereby reducing the risk that change has introduced gaps in the contingency software.
A Proposed Pipelined-Architecture for FPGA-Based Affine-Invariant Feature Detectors
Authors: Cristina Cabani, W. James MacLean
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

This paper describes a hardware architecture for an FPGAbased implementation of affine-invariant image feature detectors, following the algorithm of Mikolajczyk & Schmid. The architecture mimics the structure of the algorithm by implementing a multi-scale Harris corner detector which feeds candidate points into an iterative procedure to determine the local affine shape of the feature's neighbourhood (up to an undetermined rotation). Since the algorithm is iterative, and since we desire a high throughput rate, the iterations are "unrolled" into a sequence of identical computation blocks arranged in a pipeline architecture. The modularity of the resulting architecture allows for scaling the implementation to devices of different resource capacity, as well as partitioning the algorithm over several devices. The final implementation, when completed, will be part of a smart-camera system which outputs features at the same time as the associated images.
Comparison with a Standard via All-Pairwise Comparisons
Authors: E. Jack Chen
Venue: Discrete Event Dynamic Systems (2006)

We develop two sequential procedures to compare a finite number of designs with respect to a single standard. The goal is to identify a good design, and ensure that the standard is chosen when other alternatives are not better than the standard. We give preference to the standard since there are costs and time involved when replacing the standard. These procedures can be used when the expected performance of the standard is known or unknown, when variances across designs are unequal, and with the variance reduction technique of common random numbers. An experimental performance evaluation demonstrates the validity and efficiency of these sequential procedures.
SOA Collaboration Modeling, Analysis, and Simulation in PSML-C
Authors: Bingnan Xiao, W. T. Tsai, Qian Huang, Yinong Chen, Ray A. Paul
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

This paper extends the ebXML Web services development framework to introduce a new collaboration framework, which is based on the collaboration specification language PSML-C (Process Specification and Modeling Language for Collaboration), CCSOA (Consumer-Centric Service- Oriented Architecture), and DDSOS (Dynamic Distributed Service-Oriented Simulation) framework. Since collaborations are inevitable and play a critical role in SOA, an effective framework will greatly reduce the effort for rapid and adaptive service composition, simulation, evaluation, and collaboration. The PSMLC collaboration framework provides a service-oriented infrastructure for process collaboration specification, modeling, design, code generation, simulation, deployment, execution, and management. This paper presents the concepts, architecture, enabling techniques, and illustrative examples that demonstrate the concepts and the techniques.
Rapidly deployable multiprojector immersive displays
Authors: Christopher Jaynes, R. Matt Steele, Stephen Webb
Venue: Presence: Teleoperators and Virtual Environments (2005)

Immersive, multiprojector systems are a compelling alternative to traditional head-mounted displays and have been growing steadily in popularity. However, the vast majority of these systems have been confined to laboratories or other special purpose facilities and have had little impact on general human-computer and human-human communication models. Cost, infrastructure requirements, and maintenance are all obstacles to the widespread deployment of immersive displays. We address these issues in the design and implementation of the Metaverse. The Metaverse system focuses on a multiprojector scalable display framework that supports automatic detection of devices as they are added/removed from the display environment. Multiple cameras support calibration over wide fields of view for immersive applications with little or no input from the user.The approach is demonstrated on a 24-projector display environment that can be scaled on the fly, reconfigured, and redeployed according to user needs. Using our method, subpixel calibration is possible with little or no user input. Because little effort is required by the user to either install or reconfigure the projectors, rapid deployment of large, immersive displays in somewhat unconstrained environments is feasible.
Diagnosing At-Speed Scan BIST Circuits Using a Low Speed and Low Memory Tester
Authors: Yoshiyuki Nakamura, Thomas Clouqueur, Kewal K. Saluja, Hideo Fujiwara
Venue: Proceedings of the 15th Asian Test Symposium (2006)

Numerous solutions have been proposed to reduce test data volume and test application time during manufacturing testing of digital devices. However, time to market challenge also requires a very efficient debug phase. Error identification in the test responses can become impractically slow in the debug phase due to large debug data, slow tester speed and limited memory of the tester. In this paper, we investigate how a relatively slow and limited memory tester can observe the at-speed behavior of fast circuits. Our method can identify all errors in at-speed scan BIST environment without any aliasing and negligible extra hardware while taking into account the relatively slower speed of the tester and the re-load time of the expected data to the tester memory due to limited tester memory. Experimental results show that the test application time by our method can be reduced by a factor of 10 with very little hardware overhead to achieve such advantage.
Error-Diffusion Kernel Estimation Using Least Squares
Authors: Ken-Chung Ho, Jr-Shian Juang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

In this paper, we propose a method called the iterated estimation of kernel and error (KE estimation) to find the maximum-likelihood (ML) estimate of the error-diffusion (ED) kernel for halftones. The KE estimation consists mainly of iterated boundconstrained least squares (BLS). The KE-estimated kernel avoids the difficulty of regulating the control parameter in the previous least-mean-square (LMS) method. Most importantly, our method also guarantees the two characteristics of ED kernel: every kernel coefficient falls in the range [0,1] and the total of all coefficients must be one. The experimental results show that using the KE estimation to estimate kernel for the halftones generated from an ED process is very effective. The estimate progressively increases its accuracy as the number of iterations increases.
Refinable bivariate quartic and quintic C2-splines for quadrilateral subdivisions
Authors: Charles K. Chui, Qingtang Jiang
Venue: Journal of Computational and Applied Mathematics (2006)

Refinable compactly supported bivariate C2 quartic and quintic spline function vectors on the four-directional mesh are introduced in this paper to generate matrix-valued templates for approximation and Hermite interpolatory surface subdivision schemes, respectively, for both the √2 and 1-to-4 split quadrilateral topological rules. These splines have their full local polynomial preservation orders. In addition, we extend our study to parametric approach and use the symmetric properties of our refinable quintic spline components as a guideline to reduce the number of free parameters in constructing second order C2 Hermite interpolatory quadrilateral subdivision schemes with precisely six components.
Distributed Grid Resource Discovery with Matchmakers
Authors: Mohammad Imran Shaik, S. Mary Saira Bhanu, N. P. Gopalan
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

The Grid provides mechanisms to share dynamic, heterogeneous, distributed resources spanned across multiple administrative domains. Resources required to execute a job are identified from the resource pool based on the desired set of attributes of the resources that exhibit various degrees of dynamism. A Resource Discovery service provides mechanisms to identify the set of resources that are capable of satisfying the job requirements. Current grid systems (Condor, European Data Grid) employ centralized matchmakers for resource discovery. Centralized matchmakers become a performance bottle neck as the grid grows. To alleviate this problem and to effectively exploit the grid, a distributed matchmaking approach is desirable not only for performance reasons, but also to surmount single point failures for grid resource discovery. In this paper, a novel distributed matchmaking approach for resource discovery in large, dynamically varying collections of grid resources is proposed.
The Functional Neuroanatomy of Episodic and Semantic Autobiographical Remembering: A Prospective Functional MRI Study
Authors: Brian Levine, Gary R. Turner, Danielle Tisserand, Stephanie J. Hevenor, Simon J. Graham, Anthony R. McIntosh
Venue: Journal of Cognitive Neuroscience (2004)

Autobiographical memory comprises episodic and semantic components mediated by dissociable states of consciousness, one promoting the experience of the self at a specific moment in the past, and the other involving self-knowledge that does not require ''mental time travel.'' These components can be difficult to dissociate using retrospective autobiographical stimuli collection. In this study, we manipulated the episodic/semantic distinction within prospectively collected autobiographical stimuli. Over several months, participants made recordings documenting specific episodes, repeated episodes, and world knowledge. These recordings were later played back to participants during scanning with functional MRI. The results indicated overlapping but distinct patterns of brain activity corresponding to episodic and semantic autobiographical memory. Both episodic and semantic autobiographical memory engaged the left anteromedial prefrontal cortex associated with self-reference, but the episodic condition did so to a greater degree. The episodic condition uniquely engaged the medial temporal, posterior cingulate, and diencephalic regions associated with remote memory recovery. Whereas the episodic condition engaged the right temporo-parietal cortex involved in reconstruction of spatial context and attentional orienting, the semantic condition engaged the left temporo-parietal and parieto-frontal systems involved in egocentric spatial processing and topdown attentional control. Episodic recollection was also associated with suppression of emotional paralimbic regions. These findings support a functional neuroanatomical dissociation between episodic and semantic autobiographical memory, providing concordance to amnesic syndromes with disproportionate impairment in one of these two forms of autobiographical memory.