ppxscal/embedding_network huggingface dataset:
Service Commitment and Load Balancing for Domain-based P2P networks
Authors: Joseph C. H. So, P. C. Wong
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Peer-to-peer (P2P) networks offer scalability through the collaborative sharing of storage and bandwidth resources among the peers. To support corporate applications, P2P networks have to be enhanced to offer certain service guarantees. We consider a domain-to-domain (D2D) network in which domains cooperate to offer a given service with resources reservation. We consider its network architecture and propose load balancing algorithms to meet the external service commitments. We show that, by defining a resource boundary variable, r, a committed service through load balancing among peers within a domain can be achieved.
Rao-Blackwellised particle filter for tracking with application in visual surveillance
Authors: Xinyu Xu, Baoxin Li
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

Particle filters have become popular tools for visual tracking since they do not require the modeling system to be Gaussian and linear. However, when applied to a high dimensional state-space, particle filters can be inefficient because a prohibitively large number of samples may be required in order to approximate the underlying density functions with desired accuracy. In this paper, by proposing a tracking algorithm based on Rao-Blackwellised particle filter (RBPF), we show how to exploit the analytical relationship between state variables to improve the efficiency and accuracy of a regular particle filter. Essentially, we estimate some of the state variables as in a regular particle filter, and the distributions of the remaining variables are updated analytically using an exact filter (Kalman filter in this paper). We discuss how the proposed method can be applied to facilitate the visual tracking task in typical surveillance applications. Experiments using both simulated data and real video sequences show that the proposed method results in more accurate and more efficient tracking than a regular particle filter.
Modelling run-time arbitration by latency-rate servers in dataflow graphs
Authors: Maarten H. Wiggers, Marco J. G. Bekooij, Gerard J. M. Smit
Venue: Proceedingsof the 10th international workshop on Software compilers for embedded systems (2007)

In order to obtain a cost-efficient solution, tasks share resources in a Multi-Processor System-on-Chip. In our architecture, shared resources are run-time scheduled. We show how the effects of Latency-Rate servers, which is a class of run-time schedulers, can be included in a dataflow model. The resulting dataflow model, which can have an arbitrary topology, enables us to provide guarantees on the temporal behaviour of the implementation. Traditionally, the end-to-end behaviour of multiple Latency-Rate servers has been analysed with Latency-Rate analysis, which is a Network Calculus. This paper bridges a gap between Network Calculi and dataflow analysis techniques, since we show that a class of run-time schedulers can now be included in dataflow models, or, from a Network Calculus perspective, that restrictions on the topology of graphs that include run-time scheduling can be removed.
AI techniques in modelling, assignment, problem solving and optimization
Authors: Zsolt János Viharos, Zsolt Kemény
Venue: Engineering Applications of Artificial Intelligence (2007)

This paper recapitulates the results of a long research on a family of artificial intelligence (AI) methods-relying on, e.g., artificial neural networks and search techniques-for handling systems with high complexity, high number of parameters whose input or output nature is partly unknown, high number of dependencies, as well as uncertainty and incomplete measurement data. Aside from classical modelling, basic problem solving and optimization techniques are presented. Finally, a novel submodel decomposition method is shown with an extended feature selection algorithm highlighted, along with possibilities of further development. Examples of practical application are shown to illustrate the viability of the methods.
Information losses within the collaborative integration of different process models - BPML as an XML-based interchange format for BPMN business process models
Authors: Johannsen Florian, Leist Susanne, Zellner Gregor
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

During the last decades market competition created various constellations of collaborative integration between enterprises: integration of parts of the value chain or integration of common e-services just to name two. It is useful to know the processes within the collaborating enterprises to be able to establish the cooperation. For this purpose different process models have to be exchanged or integrated within the collaborating enterprises. It is, however, only in a few cases that the collaborating enterprises use the same business process modeling techniques and tools which allow an uncomplicated exchange of the models. But even within the same tools process information can get lost during the mapping between the graphical objects of a business process and its code-representation. Corresponding to this problem the following paper analyses the mapping between BPMN and BPML, highlights the information losses and points out possibilities for further improvement.
Use of expert system generation to promote knowledge synthesis in a meteorology forecasting course
Authors: R. M. Marra
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

We attempt to determine if the critical thinking and knowledge synthesis benefits could be demonstrated in the meteorology domain. We want to test and subsequently refine our procedures for training users to develop expert systems. For the pilot study we define and implement a particular amount and kind of training. This paper discussed the results of a study where meteorology students generated expert systems on forecasting topics. In prior studies, the processing that a learner must engage in to create the knowledge bases of if-then rules required in expert systems has been shown to increase knowledge synthesis in the domain of interest. The current pilot study confirmed that the activity encouraged knowledge synthesis in the domain as evaluated by students' final presentations of their expert systems. Further, students in the study, who tend to be poorer performers based upon their GPA predictors tended to excel in the project, thus providing this type of student with an alternative means of learning the material.
Improved blotch detection by postprocessing
Authors: J. Biemond
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Blotches are common artifacts in old film sequences that manifest themselves as disturbing bright or dark spots. Existing methods for detecting blotches can achieve high detection rates. High detection rates are only useful if the corresponding number of false alarms is not too high, visible artifacts in the corrected sequence result otherwise. We show that the performance of blotch detectors can be improved significantly by taking statistical influence of noise on the detection mechanism into account. Further improvements are achieved first by using a double-stage detection strategy and second by a constrained dilation technique.
Verification-guided soft error resilience
Authors: Sanjit A. Seshia, Wenchao Li, Subhasish Mitra
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Algorithmic techniques for formal verification can be used not just for bug-finding, but also to estimate vulnerability to reliability problems and to reduce overheads of circuit mechanisms for error resilience. We demonstrate this idea of verification-guided error resilience in the context of soft errors in latches. We show how model checking can be used to identify latches in a circuit that must be protected in order that the circuit satisfies a formal specification. Experimental results on a Verilog implementation of the ESA SpaceWire communication protocol indicate that the power overhead of soft error protection can be reduced by a factor of 4.35 by using our approach rather than protecting all latches.
On Channel Reliability Measure Training for Multi-Camera Face Recognition
Authors: Binglong Xie, Visvanathan Ramesh, Ying Zhu, Terry Boult
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

Single-camera face recognition has severe limitations when the subject is not cooperative, or there are pose changes and different illumination conditions. Face recognition using multiple synchronized cameras is proposed to overcome the limitations. We introduce a reliability measure trained from examples to evaluate the inherent quality of channel recognition. The recognition from the channel predicted to be the most reliable is selected as the final recognition results. In this paper, we enhance Adaboost to improve the component based face detector running in each channel as well as the channel reliability measure training. Effective features are designed to train the channel reliability measure using data from both face detection and recognition. The recognition rate is far better than that of either single channel, and consistently better than common classifier fusion rules.
Simultaneous gesture segmentation and recognition based on forward spotting accumulative HMMs
Authors: Daehwan Kim, Jinyoung Song, Daijin Kim
Venue: Pattern Recognition (2007)

Existing gesture segmentations use the backward spotting scheme that first detects the end point, then traces back to the start point and sends the extracted gesture segment to the hidden Markov model (HMM) for gesture recognition. This makes an inevitable time delay between the gesture segmentation and recognition and is not appropriate for continuous gesture recognition. To solve this problem, we propose a forward spotting scheme that executes gesture segmentation and recognition simultaneously. The start and end points of gestures are determined by zero crossing from negative to positive (or from positive to negative) of a competitive differential observation probability that is defined by the difference of observation probability between the maximal gesture and the non-gesture. We also propose the sliding window and accumulative HMMs. The former is used to alleviate the effect of incomplete feature extraction on the observation probability and the latter improves the gesture recognition rate greatly by accepting all accumulated gesture segments between the start and end points and deciding the gesture type by a majority vote of all intermediate recognition results. We use the predetermined association mapping to determine the 3D articulation data, which reduces the feature extraction time greatly. We apply the proposed simultaneous gesture segmentation and recognition method to recognize the upper-body gestures for controlling the curtains and lights in a smart home environment. Experimental results show that the proposed method has a good recognition rate of 95.42% for continuously changing gestures.
New disparity map estimation using higher order statistics
Authors: M. Rziza
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

This paper presents a new algorithm of disparity map estimation. The originality of this method lies in the process of dense disparity map estimation using dynamic programming constrained by interest points and using the higher order statistics (HOS) criteria for matching noisy images. Experiments with noisy real images have validated our method and have clearly shown the improvement over the existing ones. The dense disparity map obtained is more reliable when compared to the similar second-order statistics (SOS)-based dynamic programming and HOS-based correlation methods.
Using semantics for automatic enforcement of access control policies among dynamic coalitions
Authors: Janice Warner, Vijayalakshmi Atluri, Ravi Mukkamala, Jaideep Vaidya
Venue: Proceedings of the 12th ACM symposium on Access control models and technologies (2007)

In a dynamic coalition environment, organizations should be able to exercise their own local fine-grained access control policies while sharing resources with external entities. In this paper, we propose an approach that exploits the semantics associated with subject and object attributes to facilitate automatic enforcement of organizational access control policies while resource sharing occurs among coalition members. Our approach relies on identifying the necessary attributes required by external users to gain access to a specific organizational object (or service). Specifically, it consists of extracting user attribute sets that semantically match with the attributes of the objects for which a role has permissions. This relies on a closer examination of why a user is assigned a specific role. These attribute sets are first pruned based on their significance in characterizing a role, which are then checked against those submitted by an external user to decide whether to allow or deny access to the specific object. While our goal in this paper is to support coalition based access control, the proposed approach can also aid in automating the process of role engineering.
Spreadsheet-based Framework for Interactive 3D Visualization of Web Resources
Authors: Masahiko ITOH, Jun FUJIMA, Makoto OHIGASHI, Yuzuru TANAKA
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

We propose a spreadsheet-based visualization framework for end-users to generate and modify multiple 3D visualizations of data-sets from various Web resources. In this paper, first, we provide a 3D component-based access mechanism to Web resources. It allows users to access various Web resources using only 3D visual components interactively. Second, we provide an interactive 3D visualization mechanism. It enables users to construct multiple 3D visualizations of data-sets from various Web resources just by combining 3D visual components. Third, we provide 2D components for communicating between a spreadsheet and 3D components. Users can export necessary functions of 3D components and define synchronization between these components and cells on a spreadsheet. A spreadsheet environment allows us to define relationships among cells, and copy these relationships through a copy and paste manipulation. By using these mechanisms, users can create multiple visualizations in parallel in order to compare different visualization results simultaneously for different visualization parameters just through a user's direct manipulation.
A Fully Labelled Lambda Calculus: Towards Closed Reduction in the Geometry of Interaction Machine
Authors: Nikolaos Siafakas
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

We investigate the possibility of performing new reduction strategies with the Geometry of Interaction Machine (GOIm). To this purpose, we appeal to Levy's labelled lambda calculus whose labels describe: a) the path that the GOIm will follow in the graph of a term and b) the operations that the GOIm requires to compute the multiplicative part from the Multiplicative and Exponential Linear Logic encoding that the machine uses. Our goal is to unveil the missing exponential information in the structure of the labels. This will provide us with a tool to talk about strategies for computing paths with the GOIm.
Transfering Proofs of Zero-Knowledge Systems with Quantum Correlations
Authors: P. Mateus, F. Moura, J. Rasga
Venue: Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies (2007)

The use of quantum correlations to attack security protocols is an important research line deserving growing attention. An important class of cryptographic protocols used as building blocks for several other more complex protocols is zero-knowledge proof systems. One of the properties that zeroknowledge proof systems are assumed to satisfy i s that it is impossible for the verifier to show to a third party that he has interacted with the prover (impossibility of transferring proofs). Herein, it is shown how Bell pairs, together with tamper-proofing, can be used to break the impossibility of transferring proofs for an important class of zero-knowledge proof systems.
Harmonic retrieval in nonstationary noise
Authors: Tong Zhou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Harmonic retrieval is a classical signal processing problem but it has been almost invariably assumed that the additive noise is stationary. In this paper, we abandon this requirement and allow the additive noise to be nonstationary (but also non-cyclostationary in order to distinguish it from the information bearing signal). We show that various FFT based approaches can still be used on a single record of data to yield frequency estimates that have the O(T/sup -3/) variance, where T is the data length. Stationary multiplicative noise is also permitted in the model. Numerical examples illustrate the key concepts of the paper.
Industrial applications
Authors: Xavier Olive, Jean-Marie Pasquet, Didier Flament
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This first technical session is further developing the technological dimensions of technology transfer, with three illustrations of successful and representative industrial applications. It covers the cases of embedded autonomy in spacecraft applications, advanced avionics solutions for satellite communication and component hybridization for navigation.
Diphone multi-trajectory subspace models
Authors: K. Reinhard
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

We report on the extension of capturing speech transitions embedded in diphones using trajectory models. The slowly varying dynamics of spectral trajectories carry much discriminant information that is very crudely modelled by traditional approaches such as HMMs. We improved our methodology of explicitly capturing the trajectory of short time spectral parameter vectors introducing multi-trajectory concepts in a probabilistic framework. Optimal subspace selection is presented which finds the most discriminant plane for classification. Using the E-set from the TIMIT database results suggest that discriminant information is preserved in the subspace.
I wish I had understood this at the beginning: dilemmas in research, teaching, and the introduction of technology in engineering design courses
Authors: J. Turns, M. Guzdial, F. Mistree, J. K. Allen, D. Rosen
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Advances in computer technology have made it feasible to provide engineering design students with computer support for learning about and performing various activities in the engineering design process. Important issues for consideration are how to design the computer tools and how to integrate these tools into existing courses. We have focused our efforts on learning how to design collaboration software and also on understanding how to integrate it into an engineering design course. We conducted two quarters of a formative evaluation, during which our software (CaMILE, an Internet based collaboration tool) was used by third year mechanical engineering design students. These students were introduced to and received support for the software in the context of a special voluntary laboratory course focusing more generally on technological support for their efforts in the design course. Our reflections on this experience have led to the identification of the three dilemmas described in the paper: evaluation in or out of the classroom; more with less or more with more; and compatibility of learning about and learning through collaboration. While the three dilemmas were identified in the context of our specific efforts, findings from other educational technology projects as well as other domains support their generality. The paper provides the context for understanding the dilemmas, a description of each, and the impact of each on our current endeavors.
Voice Query Transcription and Expansion Scheme for Efficient Music Retrieval
Authors: Seungmin Rho, Byeong-jun,  Han, Eenjun Hwang, Minkoo Kim
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

In this paper, we present a scheme for efficient hummingbased music retrieval. For that purpose, we first describe how to extract a sequence of pitch and duration pairs as its feature information from sung or hummed query accurately and automatically. And then, we propose a novel scheme for reformulating user query to improve retrieval performance. The scheme is based on user relevance feedback with genetic algorithm. We implemented a prototype system based on these scheme and performed various experiments. Experimental result shows that our proposed scheme achieves an impressive performance.
Integer code generation for the TI TMS320C62X
Authors: M. Coors
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper presents a methodology which enables the generation of C62/spl times/ optimized fixed-point C-code from a floating-point description of an algorithm. The FRIDGE design environment transforms floating-point ANSI-C code with local fixed-point annotations into an internal bit-true representation. From this representation we generate C62/spl times/ optimized integer C code utilizing the code transformation techniques illustrated in this paper. A benchmark is presented comparing the efficiency of the generated code with C67/spl times/ C-code, C62/spl times/ floating-point emulation and generic integer ANSI-C code.
Multimedia retrieval at INEX 2006
Authors: Thijs Westerveld, Roelof van Zwol
Venue: ACM SIGIR Forum (2007)

Structured document retrieval allows for the retrieval of document fragments, i.e. XML elements, containing relevant information. The main INEX Ad Hoc track focuses on text-based XML element retrieval. Although text is dominantly present in most XML document collections, other types of media can also be found. Existing research on multimedia information retrieval has shown that it is far from trivial to determine the combined relevance of a document that contains several multimedia objects. The objective of the INEX multimedia track is to exploit the XML structure that provides a logical level at which multimedia objects are connected, to improve the retrieval performance of an XML-driven multimedia information retrieval system.
What Graphs can be Efficiently Represented by BDDs?
Authors: C. Dong, P. Molitor
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for graphs from real applications such as graphs representing the networks of the Internet or the World Wide Web and other technical and social networks the sizes of the corresponding OBDDs do not differ much from the number of edges which the graphs contain. It is noteworthy that all of these large graphs are sparse. For randomly generated dense graphs, the gain, i.e., the ratio of the number of graph edges to the OBDD size, increases with the number of vertices and the density of the graphs. The importance to know whether a graph falls into the region where algorithms based on OBDDs are more efficient than that based on adjacent lists and matrices is therefore emphasized through the results of this paper.