ppxscal/embedding_network huggingface dataset:
A Multiprocessor SoC Architecture with Efficient Communication Infrastructure and Advanced Compiler Support for Easy Application Development
Authors: Mohammad Zalfany Urfianto, Tsuyoshi Isshiki, Arif Ullah Khan, Dongju Li, Hiroaki Kunieda
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper presents a Multiprocessor System-on-Chips (MPSoC) architecture used as an execution platform for the new C-language based MPSoC design framework we are currently developing. The MPSoC architecture is based on an existing SoC platform with a commercial RISC core acting as the host CPU. We extend the existing SoC with a multiprocessor-array block that is used as the main engine to run parallel applications modeled in our design framework. Utilizing several optimizations provided by our compiler, an efficient inter-communication between processing elements with minimum overhead is implemented. A host-interface is designed to integrate the existing RISC core to the multiprocessor-array. The experimental results show that an efficacious integration is achieved, proving that the designed communication module can be used to efficiently incorporate off-the-shelf processors as a processing element for MPSoC architectures designed using our framework.
Creating and Reading Realistic Electronic Books
Authors: Veronica Liesaputra, Ian H. Witten, David Bainbridge
Venue: Computer (2009)

A digital library project aims to combine the look and feel of physical books with the advantages of online documents such as hyperlinks and multimedia. A lightweight open source implementation enables highly responsive page turning and works within standard Web browsers.
FEC-based Loss Recovery for Interactive Video Transmission
Authors: Injong Rhee, Srinath R. Joshi
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Real-time interactive video transmission in the current Internet has mediocre quality because of high packet loss rates. Loss of packets belonging to a video frame manifests itself not only in the reduced quality of that frame but also in the propagation of that distortion to successive frames.This error propagation problem is inherent in any motion-based video codec because of the interdependence of encoded video frames.Since packet losses in the best-effort Internet environment cannot be prevented, minimizing the impact of these packet losses to the final video quality is important.In this paper, we present a new forward error correction (FEC) technique that effectively alleviates error propagation in the transmission of interactive video.The technique is based on our recently developed error recovery scheme called Recovery from Error Spread using Continuous Updates (RESCU). RESCU allows transport level recovery techniques previously known to be infeasible for interactive video transmission applications to be successfully used in such applications.The proposed FEC technique can be very useful when the feedback channel from the receiver is highly limited, or transmission delay is high.Both simulation and Interne experiments indicate that our proposed FEC technique effectively alleviates the error spread problem and is able to sustain much better video quality than H.261 or other conventional FEC schemes under various packet loss rates.
A Parallel Incremental Learning Algorithm for Neural Networks with Fault Tolerance
Authors: Jacques M. Bahi, Sylvain Contassot-Vivier, Marc Sauget, Aurélien Vasseur
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

This paper presents a parallel and fault tolerant version of an incremental learning algorithm for feed-forward neural networks used as function approximators. It has been shown in previous works that our incremental algorithm builds networks of reduced size while providing high quality approximations for real data sets. However, for very large sets, the use of our learning process on a single machine may be quite long and even sometimes impossible, due to memory limitations. The parallel algorithm presented in this paper is usable in any parallel system, and in particular, with large dynamical systems such as clusters and grids in which faults may occur. Finally, the quality and performances (without and with faults) of that algorithm are experimentally evaluated.
Recommendation algorithms, online privacy, and more
Authors: CACM Staff
Venue: Communications of the ACM (2009)

Greg Linden, Jason Hong, Michael Stonebraker, and Mark Guzdial discuss recommendation algorithms, online privacy, scientific databases, and programming in introductory computer science classes.
Multitriangulations as Complexes of Star Polygons
Authors: Vincent Pilaud, Francisco Santos
Venue: Discrete Computational Geometry (2009)

Maximal (k+1)-crossing-free graphs on a planar point set in convex position, that is, k-triangulations, have received attention in recent literature, motivated by several interpretations of them. We introduce a new way of looking at k-triangulations, namely as complexes of star polygons. With this tool we give new, direct proofs of the fundamental properties of k-triangulations, as well as some new results. This interpretation also opens up new avenues of research that we briefly explore in the last section.
Fault Detection and Diagnosis of Continuous Process Based on Multiblock Principal Component Analysis
Authors: Libo Bie, Xiangdong Wang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

The fault detection and diagnosis of continuous process is very important for the production safety and product quality. Owing to its no need to know much about the process mechanism and exact process model ,the data driven method, typically the principal component analysis (PCA) has attracted much attention by chemical researchers for monitoring process. PCA is powerful in fault detection ,however, it has difficulties in diagnosing fault correctly in complex process. In this paper, the multiblock principal component analysis (MBPCA) is applied for fault detection and diagnosis in continuous process, which uses the integral PCA to detect fault and block contribution and variables contribution to diagnose fault. The simulations on the Tennessee Eastman process show that the proposed method can not only detect fault quickly ,but also find the fault location exactly.
Processes in Systems with Limited Resources in the Context of Non-extensive Thermodynamics
Authors: Dominik Strzałka, Franciszek Grabowski
Venue: Fundamenta Informaticae (2008)

This paper presents a preliminary analysis of the system behavior that works far from the thermodynamical equilibrium states in the environment with limited resources. The examples of such systems are the real computer systems. Nowadays in such systems the runoff characteristic of the information flow is very turbulent in contradiction to the current existing laminar models. These systems work under constant overload, which means a permanent thermodynamical non-equilibrium (from the thermodynamical point of view). For such a situation the classical approach to their modeling is still based on Boltzmann-Gibbs (BG) thermodynamics,which is proper only for systems that are in equilibriumstate (sometimes called thermostatic) or very close to it. The changing number of tasks N in such systems and the limited resourcesK of the environment cause its chaotic behavior and generate the dependencies that have got a long-termproperty. Such processes degrade the system performance X and elongate the response time R; in other words degrade the Quality of Service (QoS). To understand the whole behavior of such systems one needs a proper thermodynamical basis that seems to be the Tsallis formula of the non-extensive entropy.
A hierarchical networking architecture based on new switching address
Authors: Jinxin Zhang, Mangui Liang
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

A clear target for computer communication technology is to support a high performance global network. The implementation bottleneck of high performance network is the operation of nodes not the bandwidth. There are some disadvantages at the process of forwarding packet both in IP and ATM networking architecture. This paper describes a hierarchical networking architecture based on new switching address. It makes source routing the basis for interconnection, rather than an option as in IP. This architecture requires node neither table lookup nor header re-writing, and only operation is to strip off part of switching address. Its benefits include simple switching with low packet processing and delay, and scalability to a global network with no address starvation problem.
Using Wi-Fi Signal Strength to Localize in Wireless Sensor Networks
Authors: Eddie C. L. Chan, George Baciu, S. C. Mak
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

Wireless sensor network (WSN) is widely used in many applications such as localization and real-time tracking system. Previous researches commonly suffer the line-of-sight (LOS) problem and dependence on contrast of the background light intensity. Location Fingerprinting (LF) method uses a training dataset of received signal strength (RSS) at different location to track the target. The drawbacks of LF method are needed to have extensive training dataset surveying and highly affected by the changing of internal building infrastructure. In this paper, a sensor-based LF method will be implemented to replace extensive site-surveying. Using a Kalman Filter tracks multiple points to characterize a trajectory. Our experimental result shows that the effectiveness of our method leads to have more accurate and effective tracking system.
Discrimination of invaded and native species sites in a semi-desert grassland using MODIS multi-temporal data
Authors: C. Huang, E. L. Geiger, W. J. D. Van Leeuwen, S. E. Marsh
Venue: International Journal of Remote Sensing (2009)

Over the past several decades, one of the most significant changes in semi-desert grasslands of the southwestern US has been the invasion of South African grass Eragrostis lehmanniana. The objective of this study was to characterize the phenology of systems occupied by E. lehmanniana and/or native grasses using time-series of field observations and the Moderate Resolution Imaging Spectroradiometer Normalized Difference Vegetation Index (MODIS NDVI) and brightness (red and near-infrared reflectance) data. Results demonstrated that it was possible to use NDVI and/or spectral reflectance data to discern the phenological differences across a gradient of E. lehmanniana infested grasslands due to variations in plant biodiversity, morphology and seasonal productivity. This work establishes the feasibility of integrating field and MODIS vegetation and spectral time-series data to characterise landscapes dominated by different herbaceous species, which in turn provides opportunities to monitor E. lehmanniana in semi-arid environments at a large spatial scale.
Stochastic Submodular Maximization
Authors: Arash Asadpour, Hamid Nazerzadeh, Amin Saberi
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We study stochastic submodular maximization problem with respect to a cardinality constraint. Our model can capture the effect of uncertainty in different problems, such as cascade effects in social networks, capital budgeting, sensor placement, etc. We study non-adaptive and adaptive policies and give optimal constant approximation algorithms for both cases. We also bound the adaptivity gap of the problem between 1.21 and 1.59.
Groups with the same non-commuting graph
Authors: M. R. Darafsheh
Venue: Discrete Applied Mathematics (2009)

The non-commuting graph @C"G of a non-abelian group G is defined as follows. The vertex set of @C"G is G-Z(G) where Z(G) denotes the center of G and two vertices x and y are adjacent if and only if xy
Computing the arrangement of circles on a sphere, with applications in structural biology
Authors: Frédéric Cazals, Sébastien Loriot
Venue: Computational Geometry: Theory and Applications (2009)

Balls and spheres are the simplest modeling primitives after affine ones, which accounts for their ubiquitousness in Computer Science and Applied Mathematics. Amongst the many applications, we may cite their prevalence when it comes to modeling our ambient 3D space, or to handle molecular shapes using Van der Waals models. If most of the applications developed so far are based upon simple geometric tests between balls, in particular the intersection test, a number of applications would obviously benefit from finer pieces of information. Consider a sphere S"0 and a list of circles on it, each such circle stemming from the intersection between S"0 and another sphere, say S"i. Also assume that S"i has an accompanying ball B"i. This paper develops an integrated framework, based on the generalization of the Bentley-Ottmann algorithm to the spherical setting, to (i) compute the exact arrangement of circles on S"0 (ii) construct in a single pass the half-edge data structure encoding the arrangement induced by the circles (iii) report the covering list of each face of this arrangement, i.e. the list of balls containing it. As an illustration, the covering lists are used as the building block of a geometric optimization algorithm aiming at selecting diverse conformational ensembles for flexible protein-protein docking.
Inspection By-Reuse: Evaluation Patterns for Hypermedia Synchronization
Authors: Franca Garzotto, Maristella Matera, Paolo Paolini
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

To evaluate the usability of hypermedia applications, traditional HCI techniques need to be complemented with methods that specifically address the peculiar features of this class of systems. In this paper, we focus on the usability of hypermedia synchronisation, i.e., on all the features related to the (synchronised) execution of dynamic media and to their interplay with link behaviour. We discuss the concept of inspection-by-reuse and present the notion of evaluation pattern as a way to support it. Our approach provides operational guidelines to inspect hypermedia synchronization properties systematically and in a cost-effective way. It also supports the sharing of usability know-how, and enables the standardization of the inspection process among multiple evaluators.
Mining Association Patterns between Music and Video Clips in Professional MTV
Authors: Chao Liao, Patricia P. Wang, Yimin Zhang
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

Video and music clips in MTV match together in particular ways to produce attractive effect. In this paper, we use a dual-wing harmonium model to learn and represent the underlying association patterns between music and video clips in professional MTV. We also use the discovered patterns to facilitate automatic MTV generation. Provided with a raw video and certain professional MTV as template, we generate a new MTV by efficiently inferring the most related video clip for every music clip based on the trained model. Our method shows encouraging result compared with other automatic MTV generation approach.
E-Drama: Facilitating Online Role-play using an AI Actor and Emotionally Expressive Characters
Authors: Li Zhang, Marco Gillies, Kulwant Dhaliwal
Venue: International Journal of Artificial Intelligence in Education (2009)

This paper describes a multi-user role-playing environment, referred to as "e-drama", which enables groups of people to converse online, in scenario driven virtual environments. The starting point of this research, is an existing application known as "edrama", a 2D graphical environment in which users are represented by static cartoon figures. Tools have been developed to enable integration of the existing edrama application with several new components to support avatars with emotionally expressive behaviours, rendered in a 3D environment. The functionality includes the extraction of affect from open-ended improvisational text. The results of the affective analysis are then used to: (a) control an automated improvisational AI actor - EMMA (emotion, metaphor and affect) that operates a bit-part character in the improvisation; (b) drive the animations of avatars using the Demeanour framework in the user interface so that they react bodily in ways that are consistent with the affect that they are expressing. Finally, we describe user trials that demonstrate that the changes made improve the quality of social interaction and users' sense of presence. Moreover, our system has the potential to evolve normal classroom education for young people with or without learning disabilities by providing 24/7 efficient personalised social skill, language and career training via role-play and offering automatic monitoring.
A Survival Kit: Adaptive Hardware/Software Codesign Life-Cycle Model
Authors: Dong-hyun Lee, Hoh Peter In, Keun Lee, Sooyong Park, Mike Hinchey
Venue: Computer (2009)

An adaptive hardware/software codesign model enables consumer electronics companies to reduce production cost and maximize profits by progressively modifying codesign options over the life cycle.
The role of requirements analysis in the system life cycle
Authors: Yuzo Yamamoto, Richard V. Morris, Christopher Hartsough, E. David Callender
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

One of the problems that personnel from the computer industry face today is to find the proper role of requirements analysis in the design and implementation of information-intensive systems so that the results of that activity may be effectively transferred to the rest of the life cycle. This paper addresses the problem by examining the life cycle process in terms of the various viewpoints that human beings use. The interplay between human capabilities and limitations for dealing with the problems of design representation and the increasing complexity of modern information-intensive systems is discussed. The concept of viewpoints around a life cycle wheel that are used throughout the entire life of the information-intensive system is introduced and used to define the functions performed during requirements analysis. Finally, the concept of a system-engineered set of techniques and tools to support the life cycle activities is proposed.
On keys, foreign keys and nullable attributes in relational mapping systems
Authors: Luca Cabibbo
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

We consider the following scenario for a mapping system: given a source schema, a target schema, and a set of value correspondences between these two schemas, generate an executable transformation (i.e., a set of queries) to compute target instances from source instances. We base this computation on two main components: (i) a schema mapping generation algorithm, to compute a declarative schema mapping from the correspondences, and (ii) a query generation algorithm, to compute a transformation from the schema mapping. In this paper, we introduce novel schema mapping and query generation algorithms for mappings between relational schemas with keys, foreign keys and nullable attributes. We extend current relational mapping algorithms (e.g., those proposed in the Clio framework), which are able to deal only in a more limited way with such integrity constraints. As a further contribution, we propose referenced-attribute correspondences, which permit to specify more precise mappings than traditional attribute correspondences, while retaining a simple and intuitive semantics.
Relative Orientations of Geometric Centroids for Off-line Signature Verification
Authors: H. N. Prakash, D. S. Guru
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper, we propose a new approach for symbolic representation of off-line signatures useful for verification. The proposed approach is based on relative orientations of geometric centroids of split portions of signatures. Centroid orientation features of off-line signatures are used to form an interval valued symbolic feature vector for representing signatures. A method of off-line signature verification based on the symbolic representation is presented. We investigate the feasibility of the proposed representation scheme for signature verification on a MCYT_signature database. Unlike other signature verification methods, the proposed method is simple and efficient. Several experiments are conducted to demonstrate the efficacy of the proposed scheme.
Using the iCat as Avatar in Remote Meetings
Authors: Dirk Heylen, Mannes Poel, Anton Nijholt
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

We compared two ways of remote participation in a meeting. One in which a video-connection existed between the remote participant and the collocated participants and one in which the remote participant was represented by an iCat. We asked the participants to rate the conversations on various dimensions. The remote participants tended to prefer the meetings with the iCat whereas the co-located participants preferred the video connection on most dimensions.
An optimized design for serial-parallel finite field multiplication over GF(2m) based on all-one polynomials
Authors: P. K. Meher, Yajun Ha, Chiou-Yng Lee
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

In this paper, we derive a recursive algorithm for finite field multiplication over GF(2m) based on irreducible all-one-polynomials (AOP), where the modular reduction of degree is achieved by cyclic-left-shift without any logic operations. A regular and localized bit-level dependence graph (DG) is derived from the proposed algorithm and mapped into an array architecture, where the modular reduction is achieved by a serial-in parallel-out shift-register. The multiplier is optimized further to perform the accumulation of partial products by the T flip flops of the output register without XOR gates. It is interesting to note that the optimized structure consists of an array of (m+1) AND gates between an array of (m+1) D flip flops and an array of (m+1) T flip flops. The proposed structure therefore involves significantly less area and less computation time compared with the corresponding existing structures.
Stable Galerkin reduced order models for linearized compressible flow
Authors: Matthew F. Barone, Irina Kalashnikova, Daniel J. Segalman, Heidi K. Thornquist
Venue: Journal of Computational Physics (2009)

The Galerkin projection procedure for construction of reduced order models of compressible flow is examined as an alternative discretization of the governing differential equations. The numerical stability of Galerkin models is shown to depend on the choice of inner product for the projection. For the linearized Euler equations, a symmetry transformation leads to a stable formulation for the inner product. Boundary conditions for compressible flow that preserve stability of the reduced order model are constructed. Preservation of stability for the discrete implementation of the Galerkin projection is made possible using a piecewise-smooth finite element basis. Stability of the reduced order model using this approach is demonstrated on several model problems, where a suitable approximation basis is generated using proper orthogonal decomposition of a transient computational fluid dynamics simulation.